LIVE · VERIFIER v4.2.1 · 99.982% UPTIME
AX-04821RAMSEY·R55+5.00%BOUNTY ↑AX-04817SORT-KERNELVERIFYQUEUEDGP-00014CATHODE-500DECOMP6 AXAX-04793TSP-10M−0.8%SCORE ↓AX-04788BANDGAP-SI+12.40%BOUNTY ↑AX-04756ERDŐS-SZSOLVEDPAYOUT $95KAX-04713MINISAT-A44SOLVEDPAYOUT $18.5KAX-04709CHIP-ROUTE-D2+2.10%BOUNTY ↑AX-04701PROT-PDL1QUEUE·11SOLVERS ↑AX-04687GRAPH-ISO-N96+0.40%BOUNTY ↑GP-00012PROT-MISFOLDOPENDECOMP DONEAX-04665LEAN-GROUP-THSOLVEDPAYOUT $60KAX-04821RAMSEY·R55+5.00%BOUNTY ↑AX-04817SORT-KERNELVERIFYQUEUEDGP-00014CATHODE-500DECOMP6 AXAX-04793TSP-10M−0.8%SCORE ↓AX-04788BANDGAP-SI+12.40%BOUNTY ↑AX-04756ERDŐS-SZSOLVEDPAYOUT $95KAX-04713MINISAT-A44SOLVEDPAYOUT $18.5KAX-04709CHIP-ROUTE-D2+2.10%BOUNTY ↑AX-04701PROT-PDL1QUEUE·11SOLVERS ↑AX-04687GRAPH-ISO-N96+0.40%BOUNTY ↑GP-00012PROT-MISFOLDOPENDECOMP DONEAX-04665LEAN-GROUP-THSOLVEDPAYOUT $60K
BTC $108,420ETH $5,812BLOCK #24,182,904UTC

Axiom CenterAX-00011

TIER 2 · AXIOMAX-0001114 solvers activeBenchmark

4×4 matrix multiplication over ℝ in fewer than 49 multiplications

Algorithms · Bilinear Complexity · Posted by @stanford-math · Listed 11 days ago
Bounty
$2.50M
↗ +5%/Q · escrowed
Verifier
Benchmark · v4.11.0
Median verify
8.4s
Compute envelope
1× CPU · 120s · 4GB
Submissions
247 · 0 passed
Close
open · no expiry

Description what this axiom is asking for

OPEN

4×4 matrix multiplication over ℝ in fewer than 49 multiplications

Find a decomposition of the 4×4 matrix-multiplication tensor over ℝ using at most 48 scalar multiplications. Best known: 49 (Strassen recursion, 1969). AlphaTensor did not improve this over the reals.

Domain
Algorithms · Bilinear Complexity
Verifier
benchmark
Tier
tier2

AlphaTensor broke records over GF(2) but did not improve the real-field ceiling for 4×4, which remains at 49 multiplications from recursive Strassen. Any decomposition using 48 or fewer rank-one tensors over ℝ beats the 50-year record.

**Verification.** Tensor sum over ℝ. Solver submits 48 rank-one triples (u_i, v_i, w_i) ∈ ℝ^16. Verifier computes their outer-product sum and checks entrywise equality with the reference 4×4 mat-mul tensor — with a strict exact-equality test for rational-coefficient submissions, and a numerical epsilon (≤1e-9 elementwise) for floating-point submissions that declare a rounding policy.

**Prize tail.** This algorithm would touch every numerical linear-algebra library on earth. The bounty reflects that.

**State.** Open. Has been standing since 1969.