On: P≠NP proof update

[eru]

By the way, prime factoring is not proven to be NP-complete. So it could turn out that prime factoring is in P, without implying P=NP.

Other cryptography schemes would still remain viable, even if RSA broke down. (As long as nobody proves P=NP.)

[eru → eru]

By the way, it seems highly unlikely that prime-factoring NP-complete, since it is in co-NP.