Claude-discovered algorithm breaks 3SUM and APSP speed barriers, Columbia/MIT paper shows

rohanpaul_ai · x · 2026-11-22

A Columbia/MIT paper reports Claude found, in one 16M-token session with no human input, a new thin-matrix-product algorithm that yields O(n^1.9992) 3SUM and O(n^2.9995) APSP — refuting the 3SUM and APSP hypotheses and related conjectures. Main results were formally verified in Lean 4. Lesson: treat "known hard" limits as open targets for AI search.

Related event: Claude-Helped Algorithm Breaks Decades-Old Speed Limits for 3SUM and APSP(2 posts)→

Original post →

More from Research

Research channel →