Will Worth
22.7K posts

Will Worth
@WillWorth
General enthusiast and earnest enjoyer. Aiming to be a good node in multiple networks.



here’s opus 4.7’s texed up version of mythos’s argument: www-cdn.anthropic.com/files/4zrzovbb…. i found it amusing that mythos was so nervous about the fame of the open problem that it stuck to the first choice, here X = d_n^2, that got it a contradiction, when simply choosing X a large constant depending on D in its bound wins a power. it had such a hard time believing in itself! all mathematicians know the feeling:).













(1) We are likely on track to develop AI systems capable of causing human extinction/permanent disempowerment, quite possibly within the next few years

A breakthrough by OpenAI in a very famous Combinatorics problem, the Planar Unit Distance problem by Erdos 1946. The problem is amazing because it can be described to a first-grader: Find a way to place n points on the plane to maximize the number of pairs that have distance exactly 1. For example, if you have n=4 points on a square (of side-length 1) you have 4 pairs of distance 1. The diagonals have length sqrt(2) so don't count. But you can squeeze one diagonal and create a point-set with n=4 points and 5 pairs of distance 1. And you can't get more than 5 pairs from n=4 points, so we are done with n=4 points. Now, if you place n points on a line, you have n-1 pairs of distance 1. In general, all known constructions of n points had a number of pairs scaling essentially linearly: n^{1+something vanishing} It seems that the model found a way to place n points on the plane so that their unit distances scale super-linearly: like n^{1+delta} for some *constant* delta. Delta was not explicitly specified apparently, but a forthcoming refinement by Will Sawin shows delta=0.014 works, according to the announcement. This is incredible progress for mathematics, since this is (unlike previous Erdos problems solved by AI) a major breakthrough, in one of the most studied problems in combinatorial geometry. If you're in mathematics research now, you feel the AGI. Lijie Chen said it honestly in the video: "It's very hard to sleep, man"

SITUATION EXPLAINED: OpenAI solves a real math problem In 1946, renowned mathematician Paul Erdős defined a simple problem: if you place n points in a plane, what is the maximum possible number of pairs of points that can be exactly 1 unit of distance apart? This problem, the planar unit distance problem, became one of the most well-known in the field of combinatorial geometry. Erdős conjectured that the “square lattice” solution shown below was more or less optimal. An internal OpenAI model just disproved this conjecture, finding a more optimal solution. This is a big deal. This isn’t a literature review that found a previously unpublished human solution, or a slight improvement to an existing human solution, or a solution to some minor subproblem that no one cares about. It’s a fully AI-discovered novel solution to a well-known open problem central to a field of mathematics. Just as crucially, the result came from a general-purpose reasoning model, not a model specifically designed for math like Google’s AlphaProof. It’s possible that this model is the next version of GPT-5.5 Pro, soon to be released to millions of ChatGPT subscribers worldwide. The dream of a genius in everyone’s pocket is one step closer to becoming a reality.


Today, we share a breakthrough on the planar unit distance problem, a famous open question first posed by Paul Erdős in 1946. For nearly 80 years, mathematicians believed the best possible solutions looked roughly like square grids. An OpenAI model has now disproved that belief, discovering an entirely new family of constructions that performs better. This marks the first time AI has autonomously solved a prominent open problem central to a field of mathematics.












