OpenAI Model Cracks 80-Year-Old Planar Unit Distance Problem

Mathematicians have long been fascinated with the planar unit distance problem, a conjecture first proposed by Paul Erdős in 1946. This challenging puzzle involves determining the maximum number of pairs that can be exactly one unit apart in a plane, given n points. For eight decades, mathematicians have grappled with this problem, but a solution has finally been found.

The breakthrough came when OpenAI's general reasoning model approached the problem through algebraic number theory, connecting it to advanced mathematical structures called infinite class field towers. This innovative approach allowed the AI to identify an infinite family of configurations that surpass the traditionally accepted optimal ones, refuting Erdős' conjectured upper bound outright.

The proof, which spans over 125 pages, has been extensively reviewed and validated by mathematicians Tim Gowers and Will Sawin. Gowers, a Fields Medalist, and Sawin, a mathematician at Princeton, have confirmed the correctness of the proof and quantified the improvement at approximately 0.014.

This remarkable achievement has significant implications for pure research contexts, where AI reasoning systems can now be seen as valuable tools for solving complex problems. Moreover, the techniques involved in this proof have direct relevance to formal verification and zero-knowledge proof systems, which are critical components of modern cryptography.