NotATether, Did you ever work on the 128 + bits DP mask?
Yes I finished it quite some time ago, you can get it from
https://github.com/ZenulAbidin/Kangaroo-256That was a joke...it would take you 2^128 jumps to find a 128 DP mask. So let's say your CPU (1 thread) can do 4,000 jumps per second. Now divide 2^128 / 4000 jumps per second = 85,070,591,730,234,615,865,843,651,857,942,052,864 seconds to find one 128 DP.
I get that it wasn't a practical change to make but it's nice to be able to run it without it chopping the range while you're unaware of it.
I'm not sure where you got that Google Drive link from but I don't recall it ever being posted in this thread.
yes, I print directly
I don't know C++ command to convert to binary (like 1010101)
or convert to hex
I try only
::printf("Point: %02X \n", P);
(it worsk)
Don't do it like that, print it like this using 16-character padding for the hex numbers (they are 64-bit):
::printf("Point X: %16X%16X%16X%16X \n", P.x.bits64[3], P.x.bits64[2], P.x.bits64[1], P.x.bits64[0]);
::printf("Point Y: %16X%16X%16X%16X \n", P.y.bits64[3], P.y.bits64[2], P.y.bits64[1], P.y.bits64[0]);