An OpenAI reasoning model disproved a 1946 Erdős conjecture — new math, not a retrieved answer
OpenAI says one of its general-purpose reasoning models independently disproved the Erdős unit-distance conjecture, a discrete-geometry question Paul Erdős first posed in 1946. The model built an infinite family of point configurations — leaning on heavy machinery from algebraic number theory, including infinite class field towers — that beats the long-assumed limit by a polynomial factor. The AI-generated proof checked out as valid, then human mathematicians sharpened it further.
Why it matters: The significance isn't the conjecture; it's the category of act. This looks like a model producing genuinely new mathematics on a named open problem rather than reconstructing a result that already exists somewhere in its training data — the distinction that separates sophisticated retrieval from actual reasoning, and the one skeptics have rightly demanded evidence for. If it holds up under scrutiny, the practical implication for anyone using these models on hard problems is that 'the answer isn't on the internet' stops being a hard ceiling and becomes, at least sometimes, a solvable search. The honest caveat is that one verified result on one problem is a data point, not a trend, and the human sharpening afterward is a reminder that the frontier here is still collaborative rather than autonomous. But even as a single point, it moves the debate from whether reasoning models can contribute at the research frontier to when and where — and that reframing is what makes it worth watching closely rather than dismissing as a stunt.