OpenAI announced that one of its internal general-purpose reasoning models has disproved the planar unit distance conjecture, a problem first posed by mathematician Paul Erdős in 1946. The proof has been checked and validated by external mathematicians including Fields Medal winner Tim Gowers, who called it “a milestone in AI mathematics.” This marks the first time AI has autonomously solved a prominent open problem central to a field of mathematics.
What Did OpenAI’s AI Model Actually Solve?
The planar unit distance problem asks a deceptively simple question: if you place N points in a plane, what’s the maximum number of pairs that can be exactly one unit apart? For nearly 80 years, mathematicians believed the best arrangements looked roughly like square grids, producing only slightly more than a linear number of unit-distance pairs. OpenAI’s model disproved this belief, discovering an infinite family of configurations that yield a polynomial improvement over what was thought possible.
How Did the Model Arrive at the Proof?
The proof came from a new general-purpose reasoning model, not a system specifically designed for mathematics, theorem proving, or the unit distance problem. What makes the result particularly striking is that the model connected insights from algebraic number theory — a very different branch of mathematics — to the geometric question at hand. The proof uses sophisticated concepts including infinite class field towers and Golod-Shafarevich theory to construct configurations that exceed previously assumed limits.
How Did Mathematicians Verify the Result?
OpenAI published the proof alongside companion remarks from external mathematicians including Noga Alon, Tim Gowers, Thomas Bloom, Daniel Litt, Will Sawin, and Melanie Matchett Wood. Gowers wrote that the solution is “a milestone in AI mathematics” and that if a human had submitted the paper to the Annals of Mathematics, he “would have recommended acceptance without any hesitation.” Princeton mathematician Will Sawin said his “immediate reaction was disbelief” before becoming convinced the proof works.
Why This Matters for AI Research
The result provides one of the strongest public demonstrations yet that AI models can contribute to original research rather than merely summarizing existing knowledge. OpenAI has spent the past year arguing that reasoning models can spend more computation working through difficult tasks, and this is a much sharper test than solving contest-style questions with known answers. The company’s researchers have noted the model wasn’t trained with the goal of doing math research.
Key Takeaways
- OpenAI’s general-purpose reasoning model disproved Erdős’s 1946 planar unit distance conjecture
- Proof independently verified by leading mathematicians including Tim Gowers and Noga Alon
- First time AI has autonomously solved a prominent open problem central to a mathematical field
- Model connected algebraic number theory to plane geometry without specialized training
- Proof considered strong enough for submission to the Annals of Mathematics
- Result has implications for AI-assisted research in biology, physics, engineering, and medicine
Frequently Asked Questions
Wasn’t this claimed before with GPT-5? Yes. In 2025, OpenAI’s former VP Kevin Weil posted that GPT-5 solved 10 previously unsolved Erdős problems, but those turned out to be solutions that already existed in the literature. This time, OpenAI published companion remarks from external mathematicians confirming the novelty of the result.
What is the planar unit distance problem? Put N points in a plane and ask how many pairs can sit exactly one unit apart. Erdős conjectured the number would be only slightly more than linear. OpenAI’s model found configurations that disprove this.
Could this lead to more AI mathematical discoveries? Mathematicians are cautious but optimistic. Princeton’s Will Sawin has already used the AI-discovered technique to produce a slightly improved result. The key question is whether this becomes a pattern or remains a singular achievement.