The best-case theoretical complexity of matrix multiplication has been lowered from $n^{2.376}$ to $n^{2.373}$.
You may argue against its real-world importance, since it is not based on a ground-breaking new technique and is just 0.1% lower than the previous bound, but this is the first improvement on that exponent in 25 years, so I find it interesting.
