theoretical-computer-science / Algebraic complexity

The Matrix Multiplication Exponent

A record, not a resolution, and a small one by design. The bound moves from 2.3713392.371339 to 2.3711772.371177, about 1.6×10−41.6 \times 10^{-4}, and the authors describe it as a small step. Whether ω=2\omega = 2 is untouched, and nothing here suggests the laser method can reach it. The interesting claim is methodological rather than numerical. The bottleneck in this line of work is a hard optimization problem, and the paper reports progress by reformulating that problem and then improving the optimizer, with AlphaEvolve doing the final refinement. That is a different kind of contribution from a new mathematical identity, and it is why the entry is filed as computation.

55Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

theoretical-computer-scienceAug 17, 2026Significance 55/100Registry: unreviewed

The Matrix Multiplication Exponent

Prior state unknown→proved

A record, not a resolution, and a small one by design. The bound moves from 2.3713392.371339 to 2.3711772.371177, about 1.6×10−41.6 \times 10^{-4}, and the authors describe it as a small step. Whether ω=2\omega = 2 is untouched, and nothing here suggests the laser method can reach it. The interesting claim is methodological rather than numerical. The bottleneck in this line of work is a hard optimization problem, and the paper report…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

A record, not a resolution, and a small one by design. The bound moves from 2.3713392.371339 to 2.3711772.371177, about 1.6×10−41.6 \times 10^{-4}, and the authors describe it as a small step. Whether ω=2\omega = 2 is untouched, and nothing here suggests the laser method can reach it. The interesting claim is methodological rather than numerical. The bottleneck in this line of work is a hard optimization problem, and the paper reports progress by reformulating that problem and then improving the optimizer, with AlphaEvolve doing the final refinement. That is a different kind of contribution from a new mathematical identity, and it is why the entry is filed as computation.

A record, not a resolution, and a small one by design. The bound moves from 2.3713392.371339 to 2.3711772.371177, about 1.6×10−41.6 \times 10^{-4}, and the authors describe it as a small step. Whether ω=2\omega = 2 is untouched, and nothing here suggests the laser method can reach it. The interesting claim is methodological rather than numerical. The bottleneck in this line of work is a hard optimization problem, and the paper reports progress by reformulating that problem and then improving the optimizer, with AlphaEvolve doing the final refinement. That is a different kind of contribution from a new mathematical identity, and it is why the entry is filed as computation.

Recorded attempts

Evidence graph

Connected research record

The Matrix Multiplication Exponent — Mathematical Frontier Network