Quote from: bigvito19 on April 24, 2021, 07:20:30 PM

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-256

Quote from: WanderingPhilospher on April 24, 2021, 07:30:54 PM

That 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.

Quote from: gsciservices on April 24, 2021, 10:54:12 PM

Dear Sir,
I have many time tried to download for this file; it was unable to download yet. Now it is required a access to the permission. Please given to me permission for download: https://drive.google.com/file/d/1wQWLCRsYY2s4DH2OZHmyTMMxIPn8kdsz

Regards,
Md. Ashraful Alam

I'm not sure where you got that Google Drive link from but I don't recall it ever being posted in this thread.

Quote from: fxsniper on Today at 01:37:54 AM

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):

Code:

::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]);