Explain the P vs NP problem in computational complexity theory. Define what it means for a problem to be in P versus NP, and provide examples of problems in each category (e.g., sorting vs. traveling salesman). Discuss the theoretical implications if P were equal to NP, particularly regarding cryptography, optimization, and mathematical proof verification. Finally, outline the current consensus among mathematicians and computer scientists.