Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Did U know...
Code:
G = 115792089237316195423570985008687907852837564279074904382605163141518161494338 * G
or simply
G = (SECP256k1.order+1) * G
or simply
G = (SECP256k1.order+1) * G
Did U know, 0.5G point has extremly low X coordinate 
Code:
Qx: 0x00000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
Qy: 0xc0c686408d517dfd67c2367651380d00d126e4229631fd03f8ff35eef1a61e3c
Qy: 0xc0c686408d517dfd67c2367651380d00d126e4229631fd03f8ff35eef1a61e3c
I wonder how much time you spent arriving at this formidable discoveries. Who'd of guessed that 1 == N + 1 mod N
Did U know?
Quote
Oddly enough, all algorithms - Pollard, Floyd, Shanks - work the same way (little step, oops, huge step = collision). The only difference is in the choice of step and interpretation of values.
Oddly enough, I'm lost interpreting your post.