Assume the theoretical scenario where P is proven to be equal to NP. Write a comprehensive essay detailing the cascading effects this would have on modern cryptography, mathematical proof verification, and optimization problems. Conversely, analyze the theoretical landscape if P is proven to not equal NP. What does this separation imply about the fundamental limits of human computation and efficiency?