The Agentic Era · Research · 2026
The Unit Distance Proof
An AI system disproved a conjecture that had stood since 1946, and the mathematicians who checked its work used the same technique to settle a second problem within a week.
On May 20, 2026, OpenAI announced that one of its internal general-purpose reasoning models had disproved the Erdős unit distance conjecture, an open problem in discrete geometry posed by Paul Erdős in 1946. The question is simple to state: given n points in the plane, what is the largest possible number of pairs lying exactly one unit apart? For nearly eight decades the working belief was that square grid arrangements were essentially optimal.
This was the first time an AI system autonomously resolved a prominent open problem central to a subfield of mathematics. The distinction matters. Machines had assisted proofs for decades, verified them with formal systems, and searched large spaces for counterexamples. What had not happened was a model supplying the core mathematical idea, the choice of an unexpected tool from algebraic number theory applied to a problem in plane geometry, which is precisely the step that mathematicians describe as insight rather than computation.