Open Poll: Is Matmul's True Asymptotic Exponent 2, 2+ε, or Above?

cloneofsimo · x · 2026-11-08

cloneofsimo runs a poll on the true asymptotic exponent of matrix multiplication, with options including 2.25+ε, 2+ε, 2+c (c<0.25), 2, and 2.25, arguing that since matmul is "the most fundamental thing in the universe" he refuses to believe the answer sits at the higher bounds. The question highlights the gap between known algorithms (near 2.25, improved by approaches like AlphaTensor) and the conjectured lower bound of 2.

Original post →

More from Research

Research channel →