factual

P Equals NP Would Trivialize the Other Clay Problems

P versus NP is the most important of the seven million-dollar Clay problems because if P equaled NP with an efficient algorithm (like N-squared), you could program a computer to find short formal proofs and thereby solve the other six Clay problems, steal 200 billion dollars of Bitcoin, and proceed toward world domination.

factualpending

Speaker

Scott Aaronson

Evidence Quote

“if P equals NP, you could start by stealing $200 billion-worth of Bitcoin”

Source

99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity— Sean Carroll's Mindscape
Created: 6/13/2026, 12:26:25 AM

Your notes

Loading notes...