An OpenAI model has disproved a central conjecture in discrete geometry
An OpenAI model has successfully disproved a long-standing conjecture in discrete geometry regarding the planar unit distance problem. This breakthrough marks the first time an AI has autonomously solved a prominent open problem in mathematics. The proof has been validated by external mathematicians and highlights the advanced reasoning capabilities of current AI models.
- ▪The planar unit distance problem has been studied for nearly 80 years and was first posed by Paul Erdős in 1946.
- ▪The OpenAI model provided an infinite family of examples that yield a polynomial improvement over previous beliefs about the problem.
- ▪This achievement demonstrates that AI models can generate original ideas and contribute significantly to mathematical research.
4 outlets in our directory ran this story, first to last over 11 hours. All of the coverage we found sits in one bucket: centre. That one-sidedness is itself worth noticing.
- ▪ OpenAI model solves 80-year-old planar unit distance problem — Crypto Briefing
- ▪ An OpenAI model has disproved a central conjecture in discrete geometry - OpenAI — Google News
- ▪ OpenAI says an internal general-purpose reasoning model has disproved the Erdős unit distance conjecture, a central problem in discrete geometry posed in 1946 (OpenAI) — Techmeme
Hacker News (Front Page) files mainly under programming. We currently carry 996 of its stories. Top-voted stories on Hacker News.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | OpenAI |
| Canonical URL | https://openai.com/index/model-disproves-discrete-geometry-conjecture/ |
| Publication time | Wed, 20 May 2026 19:05:30 +0000 |
| Retrieval time | 2026-05-20T19:40:02.943Z |
| Last seen | 2026-05-20T19:40:02.943Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 40m7B2oGY_mn · 5 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
May 20, 2026ResearchMilestoneAn OpenAI model has disproved a central conjecture in discrete geometryRead the proof(opens in a new window)Read the companion remarks(opens in a new window)Loading…ShareFor nearly 80 years, mathematicians have studied a deceptively simple question: if you place nnn points in the plane, how many pairs of points can be exactly distance 111 apart?This is the planar unit distance problem, first posed by Paul Erdős in 1946. It is one of the best-known questions in combinatorial geometry, easy to state and remarkably difficult to resolve.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at OpenAI.
Discussion
0 commentsMore from OpenAI
