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.

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)→

Original post →

More from Models

Models channel →