Will a matmul algorithm better than O(n^{2.371552}) [Willians et al. 2023] be published before the end of 2025?
23
129
Ṁ805Ṁ450
2025
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 Ṁ200 play money
Related questions
Sort 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
[Metaculus] Will the creators of any iteration of AlphaFold win a Nobel Prize before 2030?
66% chance
Will the majority of mathematicians rely on formal computer proof assistants before the end of 2040?
65% chance
Which MATH-AI 23 works will have >50 Google Scholar citations by end of 2026?
Will the 52nd Mersenne prime be discovered before the end of 2024?
20% chance
Will a 3x3 magic square of distinct perfect square numbers be proven impossible by end of 2025?
15% chance
Will AI contribute as much as a co-author would today to a real research mathematics paper before Jan 1 2025?
33% chance
Will a correct solution to a Millennium Prize Problem be published by the end of 2030?
31% chance
Will Manifold be cited in a paper from a top-tier AI lab or AI journal before 2025?
45% chance
Will AI contribute as much as a co-author would today to a real research mathematics paper before Jan 1 2026?
32% chance
Will a O(n^2.3) or faster matrix multiplication algorithm be discovered by the end of 2024
9% chance