What are the pros and cons of constructive P=NP proof (with algorithm)?

Question

Mathematics

It’s clear with the minuses - encryption stops working and everything that depends on it: mobile phones, satellite TV, online games ...
Are there any pluses?

Answer 1

Assuming that the proof will be algorithmic and can be used in practice, this will make the solution of the entire class of NP-complete problems more efficient, their complexity will become not exponential, but polynomial.
The list of tasks is here: https: //en.wikipedia.org/wiki/List_of_NP-complete
_...
in a specific problem with specific dimensions, the required polynomial may turn out to be less efficient than the exponent.