Claude produces O(n^1.9992) 3SUM algorithm with Lean proof, vetted by top experts
thegautamkamath · x · 2026-10-06
Ilya Razenshteyn reports that Claude obtained an O(n^1.9992)-time algorithm for the classic 3SUM problem (finding whether three of n integers sum to zero), long conjectured to be impossible below O(n^2), complete with a Lean proof. Leading fine-grained hardness experts Josh Alman and Virginia Williams checked and digested the algorithm, giving Razenshteyn 99.99% a priori confidence it's correct. If it holds up, this is a landmark for AI-assisted mathematics and threatens the many hardness results built on the 3SUM hypothesis.
More from AGI Musings
- AI researcher tszzl: a 'biblical flood' is coming to San Francisco, for obvious reasons — tszzl · 2026-11-22
- NYT Magazine asks: the internet broke our taste — will AI destroy it for good? — dreamwieber · 2026-11-22
- Tao expected the Riemann Hypothesis to fall by 2050 — it took AI only 35 days — SydSteyerhart · 2026-11-22
- LeCun invokes Piaget: LLMs are memory, not intelligence — 'what you do when you don't know' — ylecun · 2026-11-22
- Owner of first-gen Tesla GPU argues local inference is increasingly just cope — generativist · 2026-11-22
- After AI cracked Riemann and Fermat in Lean, Reddit asks: Turing Award for Lean creator de Moura? — coconautico · 2026-11-22