openai recently announced a groundbreaking advancement: its self-developed ai system has, for the first time, solved the classic “unit-distance problem” proposed by mathematician paul erdős in 1946. this long-standing open problem in combinatorial geometry had been regarded as one of the most challenging unresolved questions in the field.
the core of the problem lies in determining how to arrange a finite number of points on a two-dimensional plane so as to maximize the number of pairs of points that are equidistant from each other. conventional wisdom has long held that regular grids—such as square or hexagonal arrangements—are the optimal solutions; however, the ai has transcended conventional geometric intuition and forged a new path.
rather than relying on standard spatial construction methods, it creatively mapped the problem onto the realm of number theory—a mathematical discipline that initially seems entirely unrelated. by uncovering deep connections among integer structures, modular arithmetic, and algebraic curves, the model generated an unprecedentedly dense set of equidistant points.
this achievement has received high praise from the international mathematical community and is seen as a landmark paradigm shift. experts note that the novel principles it reveals not only promise to reshape the trajectory of research in discrete geometry but may also provide entirely new tools for lattice design in materials science, biomolecular structure analysis, and modeling many-body interactions in quantum physics.
