We don't know whether P equals NP, or whether some problems are fundamentally harder to solve than to check.
open
Global / Unspecified, Global
WS01229
If P equaled NP, countless hard problems in logistics, cryptography, and optimization could be solved efficiently, but most computer scientists suspect they can't. This remains the most famous open question in computer science.