OpenAI · Bitcoin.com News
According to researchers involved, an internal model from OpenAI proposed a new family of point configurations that crosses
Compiled by KHAO Editorial — aggregated from 1 source. See llms.txt for citation guidance.
◌ Single Source
The system produced constructions with at least n^(1+δ) unit-distance pairs, for a fixed δ greater than 0 that does not fade as n increases.
Key facts
- Eight decades after Paul Erdős posed the unit distance problem in 1946, a general-purpose AI has produced configurations that beat the long-standing conjectured bounds, proving at least n^(1+δ)
- The field settled around the idea that the best lower bound hovered near n^(1+o(1)), a notch above n, not a stride
- The system produced constructions with at least n^(1+δ) unit-distance pairs, for a fixed δ greater than 0 that does not fade as n increases
- The unit distance problem, posed in 1946 by Paul Erdős, asked a deceptively crisp question: with n points on a flat plane, how many pairs can be exactly 1 unit apart
Summary
Eight decades after Paul Erdős posed the unit distance problem in 1946, a general-purpose AI has produced configurations that beat the long-standing conjectured bounds, proving at least n^(1+δ) unit-distance pairs for some δ>0. Princeton verified the result, giving AI a 2026 credibility boost in mathematics. Tim Gowers says the advance could influence cryptography and proofs beyond geometry. An 80-year-old geometry riddle finally budged when an OpenAI system stitched together an unlikely construction that beat long-standing expectations. Some problems keep nudging at the edges of human patience. The unit distance problem, posed in 1946 by Paul Erdős, asked a deceptively crisp question: with n points on a flat plane, how many pairs can be exactly 1 unit apart.