P versus NP is a central unsolved problem in computer science and mathematics. It asks whether every problem whose solution can be quickly verified can also be quickly found. Its resolution carries a million-dollar prize and could profoundly reshape our understanding of computation.