Explain the theoretical distinction between P (polynomial time) and NP (nondeterministic polynomial time) complexity classes. Discuss the significance of the P vs NP problem, focusing on why proving P equals NP or P does not equal NP would fundamentally change our understanding of cryptography, optimization, and mathematical proof verification.