OpenAI Claims AI Model Disproved Erdős's 50-Year-Old Unit-Distance Conjecture

A Mathematical Milestone Claimed

OpenAI announced that one of its general-purpose reasoning models found a construction that disproves the conjectured upper bound in Erdős's planar unit-distance problem, a question open for roughly 50 years.

The Mathematics

The unit-distance problem asks how many pairs of points in a set of n points in the plane can be at unit distance. The prevailing conjecture placed this near n^(1+O(1/log log n)) — nearly linear. OpenAI's result constructs finite planar point sets with more than n^(1+δ) unit distances for some fixed δ > 0 and infinitely many n, directly disproving the near-linear upper bound.

Process and Verification

A general-purpose reasoning model produced the construction, checked by an AI grading pipeline, then reviewed and reworked by mathematicians. Both a proof PDF and an abridged reasoning writeup were released publicly.

Transparency Questions

The ML community's key concern: OpenAI disclosed the original prompt but withheld the model name, sampling setup, number of attempts, compute budget, and full grading pipeline details. The debate centers on whether this represents genuine autonomous mathematical reasoning or a carefully selected result from a large-scale search.