The exponent-two conjecture for matrix multiplication

Let $\omega$ denote the exponent of matrix multiplication, equivalently the asymptotic exponent governing the border rank of the matrix multiplication tensors. Exponent-two conjecture.

$$\omega=2.$$

This would establish the optimal possible asymptotic complexity for matrix multiplication. The source presents it as a special case of a broader conjecture, but no resolution evidence is supplied here.