[AdmSmith]

If P = NP then we can not trust that bank transactions are safe or trust cryptography, but we might find efficient algorithms for solving several computational problems. I hope that P is not equal to NP.

In order to even check a proposed solution it takes time to learn the technicalities, that is why there might be a correct proof at this page http://www.win.tue.nl/~gwoegi/P-versus-NP.htm but it is more likely that all are wrong.

[AdmSmith]

http://www.win.tue.nl/~gwoegi/P-versus-NP.htm