Igor's KB Site

A personal website for information sharing

Follow me on GitHub

Breakthroughs Weekly — 1 November 2026

· breakthroughs · 1 item

Independent experts have now re-derived OpenAI's claimed bound of 9/4 on the matrix multiplication exponent, a large step for algorithms.

Experts independently re-prove that matrix multiplication needs exponent at most 9/4

ECCC · 27 Oct 2026 · Complexity theory

Amir Shpilka has posted an elementary, self-contained proof that the matrix multiplication exponent is at most 9/4, following an OpenAI manuscript from its large early-October release of machine-generated mathematics. His version yields an explicit algorithm for any exponent just above 9/4, which the original, built on Strassen’s asymptotic spectrum theory, did not directly provide. It is the third independent write-up by established complexity theorists: Rafael Pass posted a constructive proof on 20 October, and Amanov, van den Berg and Zuiddam posted an exposition on 21 October that also extends the result to every field and proves a barrier showing the current method cannot push the bound lower. The original result became news for the field this month through these expert re-derivations. All of these are preprints and none has been through peer review.


← All digests · Site home