OpenAI says one of its reasoning models produced an original proof disproving a conjecture tied to Paul Erdős’s 1946 planar unit distance problem—an unsolved question studied for nearly 80 years—though the full techni... Unlike an earlier GPT‑5 episode that only rediscovered known results, the new claim centers on a...

Create a landscape editorial hero image for this Studio Global article: What is OpenAI’s new claim about its reasoning model solving an 80‑year‑old geometry conjecture first posed by Paul Erdős, how is this diffe. Article summary: OpenAI’s new claim is that an internal reasoning model produced an original proof disproving a major conjecture about Erdős’s 1946 planar unit distance problem, a nearly 80-year-old question in discrete geometry.[1] Unli. Topic tags: general, general web, user generated. Reference image context from search candidates: Reference image 1: visual subject "An internal OpenAI reasoning model disproved a conjecture from 1946 that had stumped mathematicians for decades, with Fields Medalist Tim Gowers validating the result. A machine ju" source context "OpenAI model solves 80-year-old planar unit distance problem posed by legendary mathematician Erdős" Reference image
OpenAI says one of its internal reasoning models has produced an original mathematical proof that disproves a long‑standing conjecture related to the planar unit distance problem, a famous question first posed by mathematician Paul Erdős in 1946.
If confirmed through full mathematical review, the result would represent one of the most significant examples of AI contributing to original research in pure mathematics. It also differs from an earlier AI claim involving GPT‑5 that later turned out to be a rediscovery of existing results rather than a new breakthrough.
The planar unit distance problem asks a deceptively simple question: given n points in the plane, what is the maximum number of pairs that can be exactly one unit apart?
Despite its straightforward wording, the question became one of the most studied problems in combinatorial and discrete geometry. For decades, mathematicians investigated possible constructions of points that maximize the number of unit‑distance pairs, as well as upper bounds that limit how large that number can be.
A widely held belief was that the most efficient arrangements of points would resemble square‑grid‑like patterns, similar to points placed on a lattice.
According to reports about OpenAI’s new work, the AI-generated proof challenges this assumption by showing that the conjecture underlying that belief is false.
OpenAI says a general‑purpose reasoning model produced an original proof that disproves a central conjecture connected to the Erdős problem.
Key elements of the claim include:
If correct, the result changes the theoretical picture around one of discrete geometry’s best‑known open questions.
The announcement comes after a previous controversy involving GPT‑5.
In that earlier case, OpenAI representatives said the model had solved several Erdős problems. Later analysis showed that the model had rediscovered solutions already present in the mathematical literature, meaning it had not produced genuinely new results.
The new claim is different in two important ways:
Because mathematics requires rigorous verification, the ultimate status of the result depends on detailed peer review and publication.
Reports indicate that several prominent mathematicians examined the proof and offered supportive comments. Those cited include researchers such as Noga Alon, Melanie Wood, and Thomas Bloom, who have expertise in combinatorics and number theory.
Observers have suggested the result is unusually strong for an AI‑generated proof. Some commentary described it as far beyond previous AI attempts at producing novel mathematical results.
At the same time, the broader mathematical community typically requires extensive verification before accepting a proof of this scale. Full validation usually involves detailed scrutiny and, eventually, publication in a peer‑reviewed journal.
Beyond the specific geometry result, researchers see a broader implication: AI may be starting to handle long chains of reasoning required for advanced research.
Many difficult problems in science require hundreds or thousands of logical steps connecting ideas across fields. If AI systems can reliably construct and verify such chains, they could contribute to discovery in areas such as:
Some researchers say the development hints that AI may evolve from a tool that assists scientists to one that occasionally generates new theoretical insights itself.
OpenAI’s claim is that a reasoning model produced a genuinely new proof disproving a conjecture tied to the Erdős planar unit distance problem—something mathematicians have studied since 1946.
That makes the announcement fundamentally different from earlier AI math claims that merely reproduced existing results.
However, in mathematics the final verdict comes only after detailed peer review. If the proof holds up under that scrutiny, it could mark one of the first major examples of AI contributing an original solution to a long‑standing open problem in pure mathematics.
Studio Global AI
Use this topic as a starting point for a fresh source-backed answer, then compare citations before you share it.
OpenAI says one of its reasoning models produced an original proof disproving a conjecture tied to Paul Erdős’s 1946 planar unit distance problem—an unsolved question studied for nearly 80 years—though the full techni...
OpenAI says one of its reasoning models produced an original proof disproving a conjecture tied to Paul Erdős’s 1946 planar unit distance problem—an unsolved question studied for nearly 80 years—though the full techni... Unlike an earlier GPT‑5 episode that only rediscovered known results, the new claim centers on a genuinely new proof that outside mathematicians have reportedly reviewed.[4][13]
The AI reportedly used ideas from algebraic number theory to challenge the long‑held belief that optimal configurations resemble square grids.[3][8]