OpenAI claims its internal AI model has solved the planar unit distance problem, a mathematical puzzle first proposed in the 1940s that had defied solution for over 80 years. Mathematicians have verified the result, marking a rare instance of an AI independently cracking a long-standing open question in mathematics.
The planar unit distance problem asks how many points can be placed in a plane such that every pair is exactly one unit apart—a deceptively simple geometry question that stumped researchers for decades. The closest prior attempt came in 1984, but no full solution was found until now.
According to the report, the AI model's solution was not merely a computational brute force but involved novel reasoning. The verification by human mathematicians confirms the result's validity, though the specific details of the solution were not disclosed in the source.
This breakthrough could signal a shift in how AI is used in theoretical mathematics, moving beyond pattern recognition to genuine problem-solving. It may also accelerate research in other unsolved problems, though experts caution that such successes remain rare and domain-specific.
Some researchers question whether the AI's method is truly novel or a reconfiguration of known approaches, but the verification lends credence to OpenAI's claim.