Pushmeet Kohli: new record for the matrix multiplication exponent ω < 2.371177 with AlphaEvolve

Pushmeet Kohli (VP Science at Google DeepMind) announced on 18 Aug 2026 a new upper bound ω < 2.371177, improving Alman–Vassilevska Williams et al.'s 2.371339. He described it as a joint effort by Google DeepMind, academic collaborators and the Gemini-powered coding agent AlphaEvolve. The paper, arXiv 2608.16884 ("Improving the matrix multiplication exponent with modern optimization and AlphaEvolve"), is by Dupont, Eisenberger, Kozlovskii, Mehrabian, Ruiz, See, Zhou, Balog, Alman and Vassilevska Williams. It reformulates the laser method's analysis, optimises about 7M parameters with a new ML-based optimiser, refines with AlphaEvolve, and rounds the results to rationals for rigorous verification. OfficeChai quoted the tweet. Verified via syndication (pushmeet, 2026-08-18T14:12:44Z, ~3.8k likes).

Matrix multiplication is the basic computational operation that powers modern computing (including AI). Yet, the theoretical fastest speed at which computers can multiply matrices (omega ω) is still unknown and has been a longstanding challenge for complexity theory and computer science.

Today, we announce a new record for omega (ω<2.371177). This is the result of a great team effort between @GoogleDeepMind, our academic collaborators, and our Gemini-powered coding agent AlphaEvolve! 🧮

https://arxiv.org/abs/2608.16884v1

views 469590 · likes 3801 · reposts 407 · replies 91 (at fetch time)

Archived 2026-09-29 via fxtwitter (unofficial).