OpenAI claims a general-purpose reasoning model found a counterexample to Erdos's unit-distance bound [D]

In three linesOpenAI claims a general-purpose reasoning model found a counterexample to Erdős's unit-distance conjecture in discrete geometry. The model constructed planar point sets with more than n^{1+δ} unit distances, disproving the conjectured upper bound. The proof was verified by an AI grading pipeline and reviewed by mathematicians.

Summary generated by Claude — human-verified