Mathematicians stunned by AI's biggest breakthrough in mathematics yet
The planar unit distance problem is about how many equal-sized lines you can draw that connect dots on an infinite sheet of paper An 80-year-old maths conjecture that has eluded the world’s greatest m
ManyPress Editorial Team
ManyPress Editorial

The planar unit distance problem is about how many equal-sized lines you can draw that connect dots on an infinite sheet of paper An 80-year-old maths conjecture that has eluded the world’s greatest mathematicians has been cracked by an artificial intelligence model built by OpenAI. The result has stunned experts and is being hailed as a seismic moment for AI’s mathematical ability. “This is a problem that I didn’t expect to see solved in my lifetime,” says Misha Rudnev at the University of Bris
“It’s absolutely a bomb.” Tim Gowers at the University of Cambridge wrote that the solution is “a milestone in AI mathematics” in a blog post accompanying the work . “If a human had written the paper and submitted it to the Annals of Mathematics and I had been asked for a quick opinion, I would have recommended acceptance without any hesitation. No previous AI-generated proof has come close to that.” Twentieth-century mathematician Paul Erdős considered the puzzle, known as the planar unit distance problem, as his “most striking contribution to geometry”, because it was seemingly simple to explain but deeply complex to answer. He asked: if you take an infinite-sized piece of paper and draw a number of dots in a pattern of your choice, what is the maximum number of equal-sized lines you can draw between these dots? Erdős conjectured that the patterns that yielded the most connections were points arranged in a grid, meaning the maximum number of connections would be only slightly higher than the number of points themselves. Successive attempts to prove that this really is the upper limit, or find a different arrangement of points that might lead to many more connections, yielded only small successes. The most recent improvement to Erdős’s conjecture was more than 40 years ago. Now, a model from OpenAI has found that Erdős was significantly wrong, and that you can arrange points in less symmetric patterns that can yield a far greater number of pairs. “My immediate reaction was disbelief,” says Will Sawin at Princeton University. “I thought the way that it was trying to solve it wouldn’t work, but then I looked at it more and I convinced myself that it does work. I pretty quickly became convinced this is the most significant achievement by AI in mathematics so far.” OpenAI hasn’t said exactly how the model differs from publicly available AIs or how it was trained, but the firm’s researchers have publicly commented that the model is “general purpose” and wasn’t trained “with the goal of doing math research”. The AI borrowed a technique from algebraic number theory to construct vast lattices in much higher dimensions than the two of a plane.
Key points
- “It’s absolutely a bomb.” Tim Gowers at the University of Cambridge wrote that the solution is “a milestone in AI mathematics” in a blog post accompanying the work .
- “If a human had written the paper and submitted it to the Annals of Mathematics and I had been asked for a quick opinion, I would have recommended acceptance without any hesitation.
- No previous AI-generated proof has come close to that.” Twentieth-century mathematician Paul Erdős considered the puzzle, known as the planar unit distance problem, as his “most striking contributi…
- He asked: if you take an infinite-sized piece of paper and draw a number of dots in a pattern of your choice, what is the maximum number of equal-sized lines you can draw between these dots?
- Erdős conjectured that the patterns that yielded the most connections were points arranged in a grid, meaning the maximum number of connections would be only slightly higher than the number of poin…
This article was independently rewritten by ManyPress editorial AI from reporting originally published by New Scientist.



