OpenAI model disproves Erdős unit distance conjecture

The result that's making mathematicians lose sleep is not just that an AI proved something — it's what it proved with. For eighty years, the unit distance problem looked combinatorial: arrange n dots so the count of pairs at distance exactly one is as large as possible, with the square grid serving as the field's intuition pump for near-optimality ^[1]. The OpenAI model abandoned that intuition entirely. Its construction lives inside algebraic number theory — specifically infinite class field towers of Golod–Shafarevich type with bounded root discriminant, CM fields whose elements have absolute value one in all embeddings simultaneously, and Minkowski lattice embeddings ^[2]. None of that vocabulary appears in the textbook chapter on the unit distance problem.

That machinery does two things at once. First, it manufactures arbitrarily large finite point sets whose unit-distance count grows polynomially faster than the conjectured n^(1+o(1)) — Will Sawin's later refinement pins the exponent at roughly n^(1.014), a small number that still represents a genuine polynomial improvement over Erdős's bound ^[4]. Second, it points at a methodological transfer that working mathematicians find more interesting than the headline. Thomas Bloom, who maintains erdosproblems.com, said the proof suggests "deep number theory may hold answers to several unsolved questions in discrete geometry" ^[6]. That is a sentence about research agenda, not about AI.

The contrast with prior AI-math systems is sharp. DeepMind's AlphaProof needed human translation of problems into Lean and roughly two to three days of compute per IMO question ^[7]. The OpenAI proof is an unscaffolded chain of natural-language reasoning that imports a body of advanced number theory into a problem nobody thought would yield to that machinery. That's the part that ought to interest you whether or not you care about OpenAI specifically: the cheap, generalist substrate happened to discover the unfashionable bridge.

OpenAI did not roll this announcement out the way a normal product launch goes. It dropped the blog post simultaneously with a nine-author arXiv companion paper from Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang and Wood, plus an approximately 125-page raw chain-of-thought PDF anyone can download ^[2][5]. That kind of verification pageant is uncommon for a closed-lab model release — and it is uncommon for a reason.

Seven months earlier, in October 2025, then-VP Kevin Weil claimed on X that GPT-5 had solved ten previously unsolved Erdős problems. Within hours, the mathematics community pointed out that the "solutions" were already in published literature; GPT-5 had performed a literature review and labeled it discovery. OpenAI quietly walked the claim back ^[3]. That single tweet became the case study mathematicians referenced every time a lab made a math-progress claim afterwards.

So when an internal model produced something that did look like an original proof, OpenAI did not announce it alone. They handed the result to Gowers — a Fields medalist whose endorsement effectively decides whether a result is "real" to the rest of the field — and waited. Gowers and his co-authors then publicly verified, simplified, and in Sawin's case sharpened the proof, and they put their names on the companion paper before OpenAI shipped the blog post ^[3]. Gil Kalai compares the moment to the Appel–Haken four color theorem of 1976: not just a result, but a moment where the field collectively decided what counts as a computer-mediated proof ^[4]. Read this announcement as a credibility purchase, not just a science press release. The October 2025 episode is what set the price.

The economic story here is doing more work than people realize. Community napkin estimates of the run — which OpenAI has not officially confirmed — put the cost at fewer than 32 hours of wall time and under roughly $1,000 in API spend, for a chain of reasoning that printed out to about 125 pages ^[5]. If those numbers are even directionally right, the unit economics of attacking a famous open problem just collapsed by orders of magnitude. A solo combinatorialist with a research budget that wouldn't cover a conference flight could now afford to throw a frontier model at a long-standing conjecture on a weekend.

That reframes the marginal cost of mathematical exploration. The expensive resource is no longer compute or even ideas; it is verification. The proof's natural-language form — no Lean, no formal certificate — means the bottleneck shifts to elite human reviewers like Gowers, Alon, and Sawin to confirm a result is genuinely correct rather than a hallucinated-but-plausible 125 pages. The companion paper explicitly exists to reduce that load: its job is to give the rest of the field a shorter, checkable distillation. Without that distillation step, every AI-generated proof would arrive as a multi-hundred-page chain that one or two senior people in the world could realistically referee.

The second-order question is uncomfortable. If running a frontier reasoning model on an open problem is suddenly cheap, the supply of "AI claims a proof" will go up faster than the supply of qualified verifiers. The October 2025 Erdős-problem retraction was a foretaste of that imbalance. Whoever solves the verification supply problem — whether through better formal-system integration, an AI grading pipeline that's trusted, or a new social institution around AI-mediated proofs — will define the next phase of the field.

It is worth resisting the announcement's own framing. The strongest skeptical voices, mainly on the machine-learning side, are pointing at something real: OpenAI published the original prompt and the chain-of-thought, but not the model name, sampling setup, number of attempts before success, full compute budget, hidden system prompt, or grading pipeline. Without those, the result is closer to "an internal OpenAI deployment produced a counterexample under undisclosed conditions" than to a reproducible scientific finding.

That critique is sharpened by an honest hedge from Gowers himself: a counterexample is the kind of object a computer can sometimes stumble onto by trying many configurations and getting lucky, without anything deserving the word "insight." He was careful to say that wasn't his read of this particular proof — but the door he left open is worth standing in for a moment. The companion-paper authors do most of their work where the AI's argument is least mechanical: the choice to look at CM fields with the right unit structure, the decision to embed the lattice in a way that controls split primes. If those choices were AI-original rather than recombined from training data, that is a genuinely new kind of result. If they were retrieved and recombined, this is still impressive engineering — but it is closer to a very expensive search than to a discovery.

The cross-platform reception lines up with that read. r/math is celebratory but routes its excitement through the named verifiers, treating Gowers's and Tsimerman's endorsements as the load-bearing evidence; r/singularity treats the proof itself as secondary to the "general-purpose model" framing; r/MachineLearning is the most sober room, demanding the model name, attempt count, grading pipeline, and compute budget OpenAI declined to publish. The split is itself informative: this is the rare AI announcement where the math community is more impressed than the AI-engineering community. None of those caveats undermine the proof itself. They sit alongside it. The grown-up read of the announcement is to accept that something significant happened on May 20, 2026, and also to notice that OpenAI has every reason to maximize that significance and minimal reason to publish the reproducibility data that would let outsiders pressure-test it.