A Columbia and MIT paper published November 21 reports that Claude found an algorithm beating long-standing speed limits for 3SUM and all-pairs shortest paths, by computing selected entries of a product of two long, thin matrices more efficiently than classic methods, with known reductions yielding speedups for related problems.
The result stands apart from Alpöge's still-unresolved Lean-formalized proof claim, against which Terence Tao had recently stated that present AI was not capable of solving the Riemann hypothesis.