P ≟ NP
Can every verifiable problem also be solved quickly?
- Instrument:
- P≟NP Explorer
- Last update:
- 2025-10-25
Five civilization-scale questions. Each instrument emits auditable proof artifacts — hashed, reproducible, independently verifiable.
Can every verifiable problem also be solved quickly?
Do smooth solutions exist for all fluid flows?
Are all nontrivial zeros of ζ(s) on the critical line?
Why do particles acquire mass in non-abelian gauge theory?
Can we design compounds that safely depolymerize plastics?
Results ship with certificate bundles (CBOR) including code hashes, parameters, and witness files. Anyone can re-run verifiers and reproduce outcomes bit-for-bit.
Suggest the next civilization-scale question to tackle. Your idea will go straight to [email protected].