← Open leaderboard
Computer Science
Open
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
- $18,420
- Donors
- 312
- Of goal
- 37%
Why this matters
P vs NP sits at the root of modern complexity theory. If P = NP, vast classes of search and design problems become tractable overnight; if P ≠ NP, we finally hold a rigorous foundation for the hardness assumptions that secure the internet and structure algorithm design.
What a solution unlocks
- Settled complexity hierarchies for thousands of practical problems
- Cryptographic hardness on firmer ground — or a forced redesign
- New algorithmic paradigms if unexpected polynomial methods appear
Downstream impact
A proof either way cascades into logistics, drug design, chip layout, and national-security cryptography. Entire research programs in approximation algorithms and fine-grained complexity would reorient around a settled baseline.
Also open