I have developed a theorem that proposes a method to build algorithms. All the algorithms produced by this method are in P … they never go up to more than $ 6(n^{12})$ operations.

Following that, I have defined an algorithm to resolve the TSP-metric. I agree that $ 6(n^{12})$ is a lot, but it is $ P$ and it is the limit of *n* trending to infinite. For $ n < 45$ the performance is $ 5(n^9)$ .

First question: Assuming the theorem is correct, Is this enough to proof $ P = NP$ ?

Before publishing the results and the method in a paper, I want to show on-line that the algorithm is in $ P$ . I can produce an exact result of 45 cities in less than a half of a day since the Held-Karp algorithm will need more than 16 days.

I will certify with a cloud computing provider the host hardware used, but source code will be black-boxed. Inputs will be provided by anyone and she/he/they may be the only one(s) that know(s) the solution.

Second question: Is this “show” good enough/idea to prove that I actually have solid evidence of it is not a fake?

Important to note that its purpose is only to claim attention showing evidence not substituting the proof of the theorem, I´ll make it publish (public-free) as soon as it will be demanded, I won’t keep it in secret. The reason to do this “show” is that being no one if I publish the “theorem” no one gives it a chance. I have checked that way.