Claude-found algorithm breaks decades-old 3SUM and APSP speed limits
rohanpaul_ai · x · 2026-11-22
A new Columbia/MIT paper by Josh Alman and Virginia Vassilevska Williams gives the first polynomial improvements over textbook algorithms for 3SUM and All-Pairs Shortest Paths: 3SUM on n integers in O(n^1.9992) and APSP in O(n^2.9995), refuting the long-standing 3SUM and APSP hypotheses.
- The core is a new algorithm for thin matrix products: for integer matrices with D≤N^(1/18), entries at a specified set of positions can be computed in O(N²/D^0.063) operations, less than computing inner products one by one.
- It modifies a variant of Coppersmith's rectangular matrix multiplication, built on a ten-multiplication identity of Schönhage, to perform only needed operations.
- Via known reductions, the results also refute real-valued 3SUM/APSP hypotheses, the Exact Triangle hypothesis, Zero-Weight k-Clique hypotheses, and three rectangular hinted Online Matrix-Vector conjectures.
Per the thread, the breakthrough idea was originally found by Claude, breaking decades of only tiny improvements over quadratic/cubic time.
Related event: Claude-Helped Algorithm Breaks Decades-Old Speed Limits for 3SUM and APSP(2 posts)→
More from Models
- Uncensored Inkling-2-Mini (26B MoE) runs locally on 16GB, scores 77.9% on SWE-bench Pro Hard — udmrzn · 2026-11-22
- Tesla FSD V15 rolls out with 25x better safety handling and Reality View — Scobleizer · 2026-11-22
- Uncensored 26.4B Inkling 2 Mini runs locally on a 12GB laptop, keeps 98% MMLU — udmrzn · 2026-11-22
- Joke tweet suggests Grok 4.5 vs 4.7 teams 'need to be studied' — zdhnarsil · 2026-11-22
- Simon Willison: Gemini 4 Hydrogen 'xhigh' thinking costs 6x more but is far better — film_girl · 2026-11-22
- Researcher argues LLM companies have no moat as Gemini 4 Neon kills the data flywheel thesis — adam_karvonen · 2026-11-22