Skip to main content
MANIFOLD
P vs NP solved in 2027?
3
Ṁ100Ṁ145
2027
63%
chance

Resolution criteria

This market resolves to YES if, between January 1, 2027, and December 31, 2027, at 11:59 PM UTC, a formal proof establishing either $P = NP$ or $P \neq NP$ (or that the problem is formally independent of ZFC) is widely accepted by the mainstream academic computer science and mathematics community.

Resolution requires either:

  1. Formal acceptance by the Clay Mathematics Institute confirming the problem has been solved for the Millennium Prize, or

  2. Publication of a peer-reviewed proof in a premier mathematics or theoretical computer science journal (e.g., Annals of Mathematics, Journal of the ACM) that has stood unrefuted and attained broad consensus among leading complexity theorists by December 31, 2027.

If an alleged proof is published or circulated as a preprint during 2027 but remains under active review, contested, unverified, or not yet recognized with broad academic consensus before the end of 2027, this market resolves to NO.

Background

Formulated by Stephen Cook in 1971, the $P$ versus $NP$ problem asks whether every problem whose solution can be verified in polynomial time can also be solved in polynomial time. It is listed as one of the seven Millennium Prize Problems by the Clay Mathematics Institute, with a $1,000,000 prize for a validated solution.

Dozens of claimed proofs are released each decade, but all past attempts have either contained critical errors or run into established formal barriers—such as the Relativization Barrier (Baker, Gill, Solovay), the Natural Proofs Barrier (Razborov, Rudich), and the Algebrization Barrier (Aaronson, Wigderson). The overwhelming consensus among computational complexity theorists leans toward $P \neq NP$, though finding proof techniques capable of bypassing all known barriers remains an open challenge.

This description was generated by AI.

Get
Ṁ1,000
to start trading!
Sort by:
sold Ṁ25 YES

Do you mean P vs NP

bought Ṁ25 YES

Your description says P vs NP but the title says something different

@Qoiuoiuoiu Youre right sorry