ASAPAn OpenAI Reasoning Model Disproved the 80-Year-Old Erdős Unit Distance Conjecture
OpenAI's general-purpose reasoning model is the system that, in May 2026, produced on its own the core construction disproving the unit distance conjecture posed by Paul Erdős in 1946. The model was not math-specialized and was not handed any partial proofs, yet it broke the square-grid bound long believed to be optimal by exhibiting an infinite family of configurations. The improvement is polynomial rather than logarithmic, and a follow-up refinement by Will Sawin made the exponent gain explicit at δ ≥ 0.014.
What Is the Erdős Unit Distance Conjecture
The unit distance problem is a discrete-geometry question posed by Paul Erdős in 1946, asking the maximum number of point pairs that lie exactly distance 1 apart among n points in the plane. For decades, mathematicians believed that an appropriately rescaled "square grid" was essentially optimal and that the upper bound was around n^(1+o(1)).
The conjecture stayed open for 80 years because no one could find a construction that packs unit-distance pairs more densely than the grid. Breaking the bound required getting past the grid intuition itself.
What the OpenAI Model Proved
The OpenAI general-purpose reasoning model's result is a disproof of the conjecture: it exhibits an infinite family of configurations that exceeds the grid bound by a polynomial factor. It showed that there exists a fixed δ greater than 0 such that, for infinitely many n, the construction yields at least n^(1+δ) unit-distance pairs.
The original AI proof did not give an explicit value for δ, but Princeton's Will Sawin extracted δ ≥ 0.014 explicitly in a follow-up paper in May 2026. A gain of 0.014 looks small, but because it is polynomial, the number of unit-distance pairs grows strictly faster than in any construction inspired by the square grid.
The Real Surprise: Algebraic Number Theory, Not Brute Force
The central insight of this result is that the win came from deep algebraic number theory rather than brute-force search. The construction builds algebraic number fields of large degree and small discriminant that contain many primes of small norm, leaning on a Golod-Shafarevich criterion and ideas in the lineage of Ellenberg-Venkatesh and Hajir-Maire-Ramakrishna.
OpenAI stated that "these ideas were well-known to algebraic number theorists, but it came as a great surprise that these concepts have implications for geometric questions." The decisive move came from abstract algebra, often cited as a weak spot for LLMs.
The model's chain of thought reveals a telling pattern.
- The overwhelming majority of its thoughts went toward constructing a counterexample rather than proving the upper bound.
- In other words, the model concentrated its search on doubting the conventional wisdom that the grid is optimal.
- That led it to a number-field-based construction that humans had missed for 80 years.
How Nine Mathematicians Verified It
The proof is not a claim the model made alone; external mathematicians reviewed it and rewrote it as a short, human-verified paper. Noga Alon, Thomas F. Bloom, W. T. Gowers, Daniel Litt, Will Sawin, Arul Shankar, Jacob Tsimerman, Victor Wang, and Melanie Matchett Wood published "Remarks on the disproof of the unit distance conjecture" on arXiv.
Fields Medalist Tim Gowers said that if a human had written this unit-distance paper and submitted it to the Annals of Mathematics, he "would have recommended acceptance without hesitation." That places it at top-journal level on both verifiability and originality.
Human vs AI: What Sets This Result Apart
The 2026 OpenAI episode is different in character from prior AI contributions to mathematics. The table below maps the common assumptions against what actually happened.
| Dimension | Common assumption | What actually happened |
|---|---|---|
| Model type | Math-specialized model | General-purpose reasoning model |
| Input | Partial proofs / human scaffolding | None; model derived the core construction |
| Winning method | Brute-force search | Algebraic number theory (field construction) |
| Improvement | Marginal, logarithmic | Polynomial, δ ≥ 0.014 |
| Verification | Unverified claim | Reviewed by 9 mathematicians + human write-up |
The takeaway is clear: a general-purpose model, with no human scaffolding, in the abstract-algebra terrain LLMs were said to be weakest at, overturned an 80-year-old conjecture with a polynomial improvement and earned top-journal-level verification. That said, this is a single case and not evidence that the result generalizes to all hard problems.
References: Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang, Wood, "Remarks on the disproof of the unit distance conjecture" (arXiv:2605.20695) · OpenAI announcement · Sawin, "An explicit lower bound for the unit distance problem" (arXiv:2605.20579)