Asymmetry of verification highlights the disparity between the ease of verifying solutions and the complexity of solving problems, particularly in AI and reinforcement learning. The article discusses examples of tasks with varying degrees of verification difficulty and introduces the verifier's rule, which states that tasks that are easy to verify will be readily solved by AI. It also explores implications for future AI developments and connections to concepts like P = NP.