P versus NP
Does every problem whose solution can be verified quickly also admit a quick algorithm to find that solution? A decisive answer would redraw the map of computation, cryptography, and optimization.
- Impact
- 99 /100
- Funded
- $0
- Donors
- 0
- Of goal
- 0%
Fund this problem
Buy compute. Push the frontier.
Your donation goes entirely to AI compute on this problem. When the purse runs dry, the attempt pauses until the next donor arrives.
Secure checkout · Receipt by email · 100% to compute
- Verification
Barrier survey re-checked against current proof attempts
Relativization, natural proofs, and algebrization obstacles were re-validated against the active attempt corpus. No attempt currently bypasses all three barriers simultaneously.
Verification method
Automated lemma-graph comparison of each attempt against the Impagliazzo–Rudich, Razborov–Rudich, and Aaronson–Wigderson barrier templates, plus manual review of claimed non-relativizing steps.
Arbiter verification desk
Also open