OpenAI announced that an internal general-purpose reasoning model independently disproved the planar unit-distance conjecture — an 80-year-old open problem posed by Paul Erdős in 1946 — producing a 125-page proof that was verified by a Fields Medalist and leading mathematicians. It is being hailed as the first time an AI has autonomously resolved a prominent open problem in mathematics.
The Breakthrough
- The problem: how many pairs of n points in a plane can be exactly distance 1 apart
- For ~80 years mathematicians believed square grids were essentially optimal
- The model found constructions using deep algebraic number theory that beat the grid
- It connected the puzzle to “infinite class field towers”
Why It’s Significant
- A 125-page proof, validated by a Fields Medalist and other experts
- Came from a general-purpose reasoning model — not a math-specialised system
- Not scaffolded or targeted specifically at this problem
- First AI-autonomous resolution of a famous open conjecture
The Bigger Picture
- Signals AI moving from solving known problems to discovering new mathematics
- Potential spillover into science, engineering and medicine
- Arrives amid intense scrutiny of AI economics and IPO timelines
What To Watch
- Independent peer review and publication of the full proof
- Whether the methods generalise to other open problems
- Responses from Anthropic, Google DeepMind and academic labs
Follow Vibes Uncut Media for continuing AI + science coverage.
Leave a Reply