The best-case theoretical complexity of matrix multiplication has been lowered from $n^{2.376}$ to $n^{2.373}$.