HeadsUpAI

OpenAI Reasoning Model Disproves 80 Year Old Erdős Math Conjecture

OpenAI announced that an internal reasoning model (AI trained to perform explicit step-by-step reasoning before answering) has disproved a central conjecture in discrete geometry posed by Paul Erdős in 1946. The model solved the planar unit distance problem by discovering a new family of constructions that outperform the square grid optimal solution.
Problem
Planar unit distance problem
Conjecture origin
Paul Erdős (1946)
New lower bound exponent
1.014 (refined)
Mathematical fields
Discrete geometry, algebraic number theory
Verification
External (Fields Medalist Tim Gowers and others)

This milestone validates the shift toward reasoning models that use test-time compute (allocating extra processing power during inference) to solve frontier research problems. Unlike specialized systems, this model autonomously connected concepts from algebraic number theory to resolve a geometric question. It follows the GPT-5.5 feature set, which introduced the self-correction loops.

While the proof is an internal milestone, OpenAI is using these results to test how models can contribute to biology and materials science. This capability mirrors the GPT-Rosalind launch, suggesting a future where reasoning models act as autonomous research partners. You can review the verified proof and companion remarks online.

View the full update on openai.com
OpenAI
OpenAI
@OpenAI
X

Today, we share a breakthrough on the planar unit distance problem, a famous open question first posed by Paul Erdős in 1946. For nearly 80 years, mathematicians believed the best possible solutions looked roughly like square grids. An OpenAI model has now disproved that belief, discovering an entirely new family of constructions that performs better. This marks the first time AI has autonomously solved a prominent open problem central to a field of mathematics.

1.3kretweets9.6klikes
View on X

Still wondering? A few quick answers below.

The planar unit distance problem is a famous question in discrete geometry first posed by Paul Erdős in 1946. It asks for the maximum number of pairs of points that can be exactly one unit apart in a set of n points. For decades, mathematicians believed square grid constructions were the most efficient way to maximize these pairs.

The model discovered an entirely new family of point constructions that performs better than the previously accepted square grid model. By applying sophisticated ideas from algebraic number theory, the model proved that the number of unit distance pairs grows faster than the nearly linear rate mathematicians had assumed was the upper limit for eighty years.

No, the breakthrough came from a general-purpose reasoning model rather than a system built specifically for mathematics or this particular geometry problem. OpenAI evaluated the model on a collection of open math problems to test if advanced reasoning systems could contribute to frontier research, and the model autonomously produced the proof without specialized human direction.

Yes, the proof has been checked and verified by a group of prominent external mathematicians, including Fields Medalist Tim Gowers and leading number theorist Arul Shankar. These experts confirmed the validity of the argument and published a companion paper explaining the significance of the result and the sophisticated algebraic number theory tools the model used.

This milestone demonstrates that reasoning models can hold together long, difficult chains of logic and connect ideas across distant fields of knowledge. OpenAI intends to apply these same autonomous reasoning capabilities to accelerate research in biology, physics, and medicine, moving AI from a simple assistant to a partner capable of surfacing original ideas.

Share this update