# OpenAI Model Disproves Erdős Planar Unit Distance Conjecture > Source: > Published: 2026-05-28 02:31:00.526157+00:00 # OpenAI Model Disproves Erdős Planar Unit Distance Conjecture In a May 20 blog post, **OpenAI** announced that an internal general-purpose reasoning model produced a proof that disproves the **planar unit distance problem** conjectured by **Paul Erdős** in 1946, presenting an infinite family of point arrangements that give a polynomial improvement over prior grid constructions (OpenAI blog). OpenAI wrote that the proof was checked by a group of external mathematicians and released a companion paper with background and details (OpenAI blog; Scientific American). Prominent mathematicians quoted in coverage described the result as notable: **Daniel Litt** called it "the first result produced autonomously by an AI that I find interesting in itself" (ScienceAlert; Scientific American), and **Timothy Gowers** said no prior AI-generated proof had come close (Scientific American). Editorial analysis: This episode highlights growing model competence in constructive combinatorics and the need for reproduction and formal verification in math work produced with AI. ### What happened **OpenAI** published a May 20 blog post announcing that an internal general-purpose reasoning model produced a proof that disproves the **planar unit distance problem**, a conjecture posed by **Paul Erdos** in **1946** (OpenAI blog). Per OpenAI, the model returned an infinite family of point arrangements that yields a **polynomial improvement** over the previously believed best constructions. OpenAI wrote that the proof has been checked by a group of external mathematicians and that those mathematicians and a companion paper provide further explanation and verification (OpenAI blog; Scientific American). ### What the community reported Coverage in outlets including **Scientific American**, **New Scientist**, and **ScienceAlert** quoted mathematicians reacting to the work. **Daniel Litt** is quoted as calling the result "the first result produced autonomously by an AI that I find interesting in itself" (ScienceAlert; Scientific American). **Timothy Gowers** is quoted as saying that no previous AI-generated proof had come close to meeting the standards required for top mathematical journals (Scientific American). OpenAI's post also notes follow-up activity: US mathematician **Will Sawin** adopted similar reasoning, and a team at **Google DeepMind** reported resolving related questions using their own models, as reported by OpenAI and independent outlets (OpenAI blog; ScienceAlert). ### Technical details **OpenAI's** public description emphasizes two technical points: the result addresses a long-standing combinatorial-geometry question about how many unit-distance pairs can be forced among n points on the plane, and the model produced a *constructive* counterexample family that improves asymptotic pair counts compared with square-grid heuristics (OpenAI blog). The company framed the model as a general-purpose reasoning system rather than a tool specifically engineered for formal mathematics (OpenAI blog). Editorial analysis - technical context: Machine-learning systems that excel at pattern search and combinatorial construction tend to be effective at generating candidate counterexamples and explicit constructions, even when they struggle with fully formalized proof checking. For practitioners, that means models can surface novel combinatorial configurations and heuristics that human researchers can inspect and formalize. Independent, rigorous verification remains essential because current models do not provide formal guarantees the way mechanized theorem provers do. ### Context and significance Observers in math and AI describe this outcome as a milestone for AI-assisted mathematical discovery because it is a high-profile, 80-year-old problem and because multiple groups produced complementary results in short order (OpenAI blog; Scientific American; New Scientist). Coverage points to two implications: first, models are moving from heuristic assistance toward producing original, publishable mathematics; second, success in one well-posed combinatorial domain does not by itself imply general capability across all branches of mathematics. Several outlets noted that, had a human written the proof, it would likely merit publication in a top mathematics journal (Scientific American). ### What to watch For practitioners: track efforts to reproduce the construction and to formalize the proof in a proof assistant, which would provide a stronger, machine-verifiable guarantee than current natural-language derivations. Also watch whether OpenAI or other groups release replication artifacts, datasets, or model access that allow independent teams to reproduce the steps. Finally, monitor whether similar model-driven constructions appear in other combinatorial settings and whether integration with formal provers becomes standard practice for turning model-generated ideas into certified mathematics. ### Bottom line This episode is a notable demonstration that general-purpose reasoning models can produce novel, nontrivial mathematical constructions that attract expert verification and rapid follow-up. That development expands the set of practical tools mathematicians and ML researchers may use for exploratory construction, while underscoring the continuing need for independent verification, formalization, and transparent reproducibility of AI-originated results (OpenAI blog; Scientific American; ScienceAlert). ## Scoring Rationale The result is a high-profile demonstration that general-purpose models can produce original, publishable mathematics, which is highly relevant to ML and theorem-proving practitioners. The story's immediate technical novelty is significant but domain-limited, and verification/reproducibility remain open, so the impact is notable rather than industry-shaking. Practice interview problems based on real data 1,500+ SQL & Python problems across 15 industry datasets — the exact type of data you work with. [Try 250 free problems](/problems)