Will a matmul algorithm better than O(n^{2.371552}) [Willians et al. 2023] be published before the end of 2025?
Standard
27
Ṁ10192025
71%
chance
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
Get
1,000and
1.00
1,0001.00Sort by:
@AntoineTilloy 2025, description was a typo, thanks for the catch. Most traders will have looked at title and resolution time, not description.
@jskf Market will still resolve yes if the bound is only valid for N>10e100e100, on every 2nd Tuesday of the month, while standing on one leg
Related questions
Related questions
Will an AI model write the proof to the Riemann Hypothesis by the end of 2025?
10% chance
Will an AI co-author a mathematics research paper published in a reputable journal before the end of 2026?
38% chance
Will AIs be widely recognized as having developed a new, innovative, foundational mathematical theory before 2030?
31% chance
Will an AI solve any important mathematical conjecture before January 1st, 2030?
76% chance
Will a O(n^2.3) or faster matrix multiplication algorithm be discovered by the end of 2024
3% chance
Will an AI get bronze or silver on any International Math Olympiad by end of 2025?
80% 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?
42% chance
Will the AIMO (Artificial Intelligence Mathematical Olympiad) Grand Prize be won before 2026?
56% chance
Will a correct solution to a Millennium Prize Problem be published by the end of 2030?
34% chance
Will AIs be widely recognized as having developed a new, innovative, foundational mathematical theory before 2035?
41% chance