OpenAI's O(n^2.25) Fast Matrix Multiplication Algorithm Generalized to All Fields, Verified in Lean
aran_nayebi · x · 2026-10-08
Someone generalized OpenAI's O(n^{2.25}) fast matrix multiplication algorithm from complex to arbitrary fields, with the result checking out in Lean. The new paper takes a surprisingly elegant approach — defining a potential function on tensors and proving everything by contradiction via the convolution tensor, instead of powering the CW tensor — sparking speculation that n^{9/4} may be the true exponent.
Related event: OpenAI's Fast Matrix Multiplication Proof Generalized to Arbitrary Fields(2 posts)→
More from Research
- OpenAI Published 722 Math Papers in One Day — and Cites Itself in Over Half of Them — aran_nayebi · 2026-10-08
- AI Reveals Insights Hide in the 'Convex Hull' of Existing Ideas — and Science at Large Is Next — soumitrashukla9 · 2026-10-08
- When formal verification outpaces intuition: a library of proven theorems nobody fully understands — tallmetommy · 2026-10-08
- UMI robotics dataset scales from 5 to 90 operators, 1M+ tasks in 8 weeks — HildeKuehne · 2026-10-08
- ReSAIL mitigates collapse in iterative agent self-distillation, +22.5% final-cycle success — RUC · 2026-10-08
- WebFovea takes 2nd in WebRetriever Challenge 2026: most agent failures live in the harness, not the model — Jiangang Han · 2026-10-08