Define the complexity classes P and NP theoretically. Discuss the core question of whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. Analyze the potential consequences for cryptography, optimization, and mathematical proof if P were proven to equal NP.