Which paper will win the Gödel prize in 2026
1
275Ṁ40
2026
46%
Other
5%
MIP* = RE
5%
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
5%
Graph Isomorphism in Quasipolynomial Time
5%
A Dichotomy Theorem for Nonuniform CSPs
5%
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
5%
An Average-Case Depth Hierarchy Theorem for Boolean Circuits
5%
Learning Algorithms from Natural Proofs
5%
Deciding Parity Games in Quasi-polynomial Time
5%
A Proof of the CSP Dichotomy Conjecture
5%
Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture

If several papers win the prize, resolves equally (e.g. 50%) for each. This is uncommon but happens in some years.

Get
Ṁ1,000
to start trading!
© Manifold Markets, Inc.TermsPrivacy