Research
OpenAI's reasoning model disproves decades-old geometry conjecture
OpenAI claims a general-purpose reasoning model discovered a counterexample to Erdős's unit-distance bound, a conjecture in discrete geometry. The result was verified by an AI grading pipeline and human mathematicians.
1 min read
Sourcer/machinelearning
OpenAI announced that one of its general-purpose reasoning models found a construction disproving the conjectured n^{1+O(1/log log n)} upper bound in Erdős's planar unit-distance problem, a foundational problem in discrete geometry that has resisted proof for decades.
The claim centers on finite pl...
Sign in to read the full analysis
Free — just an email. Get full analysis on LLM unit economics, plus the weekly Cost-of-Inference column.
Method & sources
- Source type
- Primary publication (lab/vendor blog) — our analysis + implication
- Source link
- r/machinelearning
- Published
- UTC
- Byline
- By the gotcontext.ai team (editorial standards)
- Correction?
- corrections@gotcontext.ai