Krux
May 22, 2026
OpenAI's AI Just Solved a 70-Year Math Problem
Published: May 22, 2026 at 12:14 AM
Updated: May 22, 2026 at 12:14 AM
100-word summary
An unreleased OpenAI reasoning model autonomously disproved Erdős's planar unit distance conjecture, a foundational problem in discrete geometry that stumped mathematicians for decades. The AI found an infinite family of point configurations that beat the square-grid arrangements everyone assumed were optimal. External mathematicians verified the proof, which shows that certain geometric patterns can pack at least n^1.014 unit-distance pairs. The model isn't public yet, and humans still need to check the AI's work. But this marks the first time an AI cracked a central open problem in frontier mathematics on its own. The age of AI-first mathematical discovery just went from theory to reality.
What happened
An unreleased OpenAI reasoning model autonomously disproved Erdős's planar unit distance conjecture, a foundational problem in discrete geometry that stumped mathematicians for decades. The AI found an infinite family of point configurations that beat the square-grid arrangements everyone assumed were optimal. External mathematicians verified the proof, which shows that certain geometric patterns can pack at least n^1.014 unit-distance pairs. The model isn't public yet, and humans still need to check the AI's work. But this marks the first time an AI cracked a central open problem in frontier mathematics on its own.
Why it matters
The age of AI-first mathematical discovery just went from theory to reality.