The specific case looks interesting. (I didn't read it yet.) Anyway, the title will make people ignore the blog because there are too many false claims about P=/!=NP that is boring t read them.
My suggestion is to repost this with a very specific title "Solving the TSP in the special case when there are only two distances" or something like that.
The consequences are pretty severe. It's considered wildly unlikely that P=NP. It's like being told that sometimes 2+2 really does equal 5. Effectively everybody thinks about computation gets shot.
The fact of proving P=NP is less consequential than how it comes about. What oddity has been overlooked after all this time, with such counter-intuitive results? That is the part that has the consequences.
There have been so many incorrect proposed proofs that it is wildly, insanely unlikely that yours is correct.
Many more good consequences than bad consequences will result. You can't say much about the intrinsic complexity of a difficult problem. A new point of view may lead to insight into the complexity of the problem.
The specific case looks interesting. (I didn't read it yet.) Anyway, the title will make people ignore the blog because there are too many false claims about P=/!=NP that is boring t read them.
My suggestion is to repost this with a very specific title "Solving the TSP in the special case when there are only two distances" or something like that.
Anyway, I get a 404 in https://www.pvsnp.blog/
The consequences are pretty severe. It's considered wildly unlikely that P=NP. It's like being told that sometimes 2+2 really does equal 5. Effectively everybody thinks about computation gets shot.
The fact of proving P=NP is less consequential than how it comes about. What oddity has been overlooked after all this time, with such counter-intuitive results? That is the part that has the consequences.
There have been so many incorrect proposed proofs that it is wildly, insanely unlikely that yours is correct.
Many more good consequences than bad consequences will result. You can't say much about the intrinsic complexity of a difficult problem. A new point of view may lead to insight into the complexity of the problem.
If you've actually proved it, submit it to peer review instead of HN
I doubt you have resolved it or need to answer your orig question
There is no need to submit it to peer review.