New arXiv paper refutes 3SUM and APSP hypotheses; Claude credited with subquadratic algorithm
burny_tech · x · 2026-10-06
A new arXiv paper by Josh Alman and Virginia Vassilevska Williams delivers the first polynomial improvements over textbook algorithms:
- 3SUM solved deterministically in O(n^1.9992) for polynomial-size integers, and APSP in O(n^2.9995) on directed graphs with polynomially bounded integer weights — refuting the 3SUM and APSP hypotheses.
- Via known reductions, this also refutes the real-valued versions of both hypotheses, the Exact Triangle hypothesis, the Zero-Weight k-Clique hypotheses, and three Online Matrix-Vector conjectures, with polynomial speedups for many other problems.
- The single engine behind all results is a new thin matrix product algorithm: computing up to N²/√D specified entries of an N×D by D×N product (D≤N^{1/18}) in O(N²/D^0.063) operations, built by adapting Coppersmith's rectangular matrix multiplication (from Schönhage's ten-multiplication identity).
Mira Murati amplified the result saying "Claude found a subquadratic 3SUM algorithm," sparking wide discussion of Claude's involvement.
More from Research
- Fields Medalist Bao Chau Ngo on AI proof of Riemann Hypothesis: treat AI output as data — Dr_Atoosa · 2026-11-22
- AI-written six-page proof of Deligne's bound lands, checked only by Claude models — Singularitarian · 2026-11-22
- AI math pace outruns expert timelines: two Millennium Prize-level problems now reportedly solved — haider1 · 2026-11-22
- Darmok AI solves all 7 Times Crossword Championship puzzles, beats human champ by 3m13s — rohanpaul_ai · 2026-11-22
- Do adaptive optimizers still work? Reddit users doubt it for flow-matching models — Inevitable_Pen9043 · 2026-11-22
- Thinking Machines' loop dial tested: 3 inner loops cut written reasoning 41% while MATH accuracy rose to 99% — SonglinYang4 · 2026-11-22