Rank of matrix multiplication over the two-element field
A bilinear algorithm multiplies two matrices by multiplying pairs of linear combinations of their entries. Over the field with two elements, how many such products are needed to multiply two matrices?
Why it matters and what counts as progress
Why it matters: The minimum is the tensor rank. An upper bound gives an algorithm, and a matching lower bound shows that every bilinear algorithm over the field needs that many products.
What counts as progress: Construct an algorithm using fewer products or rule out a stated number of products. State the field and distinguish ordinary rank from border rank.
How the problem developed
- 1976 · A 23-product algorithm [1]
Julian D. Laderman Gave a bilinear algorithm using 23 products. Its integer coefficients also work over the two-element field.
- October 2026 · Lower bound of 22 [2]
Rudich and Rousseau Ruled out algorithms with fewer than 22 products over the two-element field.
- 19 Oct 2026 · Exact rank of 23 [3]
Tejasvi Singh Tomar with generative AI tools Reported a matching lower bound and a Lean kernel proof in the revised manuscript.
AI contribution
The rank of matrix multiplication over 𝔽 is 23
Tejasvi Singh Tomar reports that the exact bilinear tensor rank of matrix multiplication over the two-element field is 23. Together with Laderman’s construction, the lower bound rules out every 22-product decomposition over and every such bilinear algorithm with integer coefficients.
Sources
Publication history
Daily emails by default, only when there’s an update.