I claim to have proved that my algorithm is NP-complete under the assumption that P=NP.
https://math.portonvictor.org/2021/04/08/my-algorithm-that-is-np-complete-in-the-case-if-pnp/
Please, check my proof for errors (3 pages PDF file with the proof itself fitting in 1 page).
That's the third revision of my algorithm. The first two were erroneous.
This is my first math research work outside of general topology (and some logic/CS stuff far from complexity theory). I did it in about two days.
I don't know how to break BitCoin, surely my algorithm is slow.
BTW, which prizes to expect?
