Provide a theoretical analysis of the P vs NP problem. Explain the distinction between problems solvable in polynomial time and those verifiable in polynomial time. Discuss the potential consequences for cryptography, optimization, and algorithmic efficiency if P were proven to equal NP.