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
1,000
3.00🏅 Top traders
| # | Name | Total profit |
|---|---|---|
| 1 | Ṁ394 | |
| 2 | Ṁ140 | |
| 3 | Ṁ98 | |
| 4 | Ṁ66 | |
| 5 | Ṁ41 |
https://arxiv.org/pdf/2404.16349 (2.371339) was accepted to SODA 2025 (https://www.siam.org/conferences-events/siam-conferences/soda25/program/accepted-papers/) which is peer reviewed, meeting the criteria in the description. resolves YES.
@Eliza Addendum: It's not 100% clear to me from the market description if we need to wait for the event to actually happen to resolve. I will resolve Yes but if this gets cut out or something weird happens before the actual event we may need to re-resolve.
@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