Explain the P vs NP problem in the context of computational complexity theory. Construct a theoretical scenario where P is proven to be equal to NP. Describe the profound impact this would have on cryptography, optimization problems, and scientific discovery. Specifically, discuss how the ability to efficiently verify solutions would translate to efficiently finding them, and why this disrupts current security paradigms like RSA encryption.