4h ago

OpenAI researchers establish a new lower bound for the unit distance problem showing arbitrarily large point sets contain more than n to the 1 plus epsilon pairs at distance 1

Follow-up arXiv preprint makes the exponent explicit at 1.014

——0——
Original post
OP(((ل()(ل() 'yoav))))👾#92(((ل()(ل() 'yoav))))👾@YOAVGO

i cannot read this and don't care to, but what i do understand is that people already claim to improve on the new bound discovered by openai-internal. https://arxiv.org/html/2605.20579v1

11:38 PM · May 20, 2026 View on X
REPLYJason Phang#672Jason Phang@ZHANSHENG

@yoavgo Will Sawin (the author) was one of the mathematicians who provided commentary on the proof https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf#page=12.42

(((ل()(ل() 'yoav))))👾(((ل()(ل() 'yoav))))👾@yoavgo

i cannot read this and don't care to, but what i do understand is that people already claim to improve on the new bound discovered by openai-internal. https://arxiv.org/html/2605.20579v1

6:38 AM · May 21, 2026 · 2.7K Views
7:39 AM · May 21, 2026 · 342 Views