Will a matmul algorithm better than O(n^{2.371552}) [Willians et al. 2023] be published before the end of 2025?
34
1kṀ15kresolved Dec 13
Resolved
YES1H
6H
1D
1W
1M
ALL
To date the best announced bound on the asymptotic complexity for matrix multiplication is 2.371552, published as a preprint [1].
Before the end of 2025, will a better bound appear in PEER REVIEWED venue?
Preprints will not be accepted as sufficient evidence, since there are perverse market incentives and verification issues for resolution.
[1] https://cs.paperswithcode.com/paper/new-bounds-for-matrix-multiplication-from
This question is managed and resolved by Manifold.
Get 
1,000 to start trading!
1,000🏅 Top traders
| # | Name | Total profit |
|---|---|---|
| 1 | Ṁ394 | |
| 2 | Ṁ140 | |
| 3 | Ṁ98 | |
| 4 | Ṁ66 | |
| 5 | Ṁ41 |
People are also trading
Related questions
Will Algorithmica receive more content before EOY 2025?
52% chance
Will Open AI release a model that can reliably compute a 20 digits multiplication correctly in 2025?
38% chance
Will an AI co-author a mathematics research paper published in a reputable journal before the end of 2026?
25% chance
Will the best public LLM at the end of 2025 solve more than 5 of the first 10 Project Euler problems published in 2026?
75% chance
Will Terence Tao publish a Math paper such that some result was solved by AI before 2028?
33% chance
Will the AIMO (Artificial Intelligence Mathematical Olympiad) Grand Prize be won before 2026?
45% chance
Will it be proven that there are finitely many different 3x3 magic squares of distinct perfect squares by end of 2025?
11% chance
Will an AI model write the proof to the Riemann Hypothesis by the end of 2025?
2% chance
Will an algorithm be able to work on million-line codebases before 2026?
37% chance
Will an AI get bronze or silver on any International Math Olympiad by end of 2025?
71% chance