Explain the theoretical implications of the P vs NP problem. Discuss the difference between problems solvable in polynomial time and those verifiable in polynomial time. Analyze the potential consequences for cryptography, optimization, and mathematical proof systems if P were to equal NP, versus the current consensus that P does not equal NP.