Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
What if we could divide by bits the range all the way to 1 bit? All keys are the modular inverse of the first key start point.
Thanks to Quite the Contrary for teaching me how to do this https://youtu.be/Vlqy1zB-QkE ecdsa secp256k1 algorithm explained.
As I see it, it's just 7 divided in half
He just subtracted 7 from N and divided the result by 2, and as I see it, it's just 15 divided in half, because dividing 7 in half would give you 3.5 where you could see 3 as the first character and that .5 as a huge number, here is the example :3fffffffffffffffffffffffffffffffaeabb739abd2280eeff497a3340d9052
As you see, the .5 which is a fraction has turned to something different, this is the beauty of big numbers combined with elliptic curves.😉
./keymath 025cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc / 2
Result: 03592152c398d6c719636a03a6dad64246a5a6814aa62c156b0ce5332f6759b031
We get the result divided in half in the middle of the key range of the bitcoin curve.
https://privatekeys.pw/key/7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a4#public