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
- Live Lean 4 benchmark tracks Riemann Hypothesis proof compression across models and agents — flngr · 2026-11-22
- Kalshi traders now put 54% odds on P vs NP being resolved before 2030 — ricklamers · 2026-11-22
- OpenAI proof dump shows first superlinear circuit lower bound, but progress stays slow — thomasahle · 2026-11-22
- One photo, 8 VLAs, only 3 correct: ERQA embodied-reasoning benchmark questioned — giffmana · 2026-11-22
- Fleuret: treat AI as oracles, not explainers — human-comprehensible math will be negligible — francoisfleuret · 2026-11-22
- Vovk paper shows probabilistically nonrandom objects have vanishing universal measure — _onionesque · 2026-11-22