# A new construction for the Erdős unit-distance problem

- ID: erdos-unit-distance
- Provider: OpenAI
- Published: 2026-05-20
- Editorial check: 2026-10-29
- Status: external-math-review
- Evidence: Proof checked by external mathematicians
- Source: https://openai.com/index/model-disproves-discrete-geometry-conjecture/
- Public article: https://appliedfrontier.nl/en/discoveries/erdos-unit-distance/

## Plain-language explanation

Put many points on paper and connect every pair exactly one unit apart. How many lines can you get? An OpenAI model found examples that beat a long-standing guess about the best arrangement.

## Research contribution

OpenAI reports an infinite family of configurations exceeding the traditionally expected square-grid behavior by a polynomial factor. External mathematicians checked the argument and wrote accompanying remarks.

## Academic interpretation

The planar unit-distance function u(n) counts the maximal number of distance-one pairs among n points. The result refutes a conjectured optimality of lattice-style constructions by giving an improved lower-bound family. It does not determine the exact asymptotics of u(n) or resolve every variant of the unit-distance problem.

## Implications

A concrete example of a new mathematical construction checked by external specialists; may inspire different methods in combinatorial geometry.

## Caveat

Externally checked according to the published announcement; this site has not audited every step or established journal peer review.

This is an editorial summary, NOT an independent mathematical proof check.