P=NP

https:/ /hooktube.com/watch?v=6ybd5rbQ5rU

…

Currently, many NP problems take a long time to solve. As such, certain problems like logistics scheduling and protein structure prediction are very difficult. Likewise, many cryptosystems, which are used to secure the world's data, rely on the assumption that they cannot be solved in polynomial time.

If someone were to show that NP problems were not difficult—that P and NP problems were the same—it would would have significant practical consequences. Advances in bioinformatics and theoretical chemistry could be made. Much of modern cryptography would be rendered inert. Financial systems would be exposed, leaving the entire Western economy vulnerable.

Proving that P = NP would have enormous ramifications that would be equally enlightening, devastating, and valuable…