Pollard's kangaroo ECDLP solver - page 62.

jacky19790729

jr. member

Activity: 82

Merit: 8

I don't understand "kangaroos"
but, if you want to printf P.x, P.y , pk value
you can use GetBase16()

Public Key (compressed) = (02 or 03) + P.x
Public Key (uncompressed) = 04 + P.x + P.y
Target Private key = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 - pk

Code:

  Point P = secp->ComputePublicKey(&pk);

  printf("\nTestPrint1   %064s  %064s \nPK: %064s\n"
	  , P.x.GetBase16().c_str() , P.y.GetBase16().c_str()
	  , pk.GetBase16().c_str() );

-----my result output

TestPrint1   9FFC74F6136E60E9229A58544C0E9CFFA5A9D955D949E75E4BCCBE1C06B81C34  
FD2B45B2609A46E7C893F3409073557BF59D9E306FF0BEC04AD8644CBC0DEFE3
PK: FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A027244DA849B5C9F250

====  2021-04-25 21:38:34 =====
找到了 Key# 0 [1S]Pub:  0x0290E6900A58D33393BC1097B5AED31F2E4E7CBD3E5466AF958665BC0121248483
       Priv: 0x349B84B6431A6C4EF1

This Find time 06:35

test in #70

fxsniper

member

Activity: 406

Merit: 47

Quote from: NotATether on April 25, 2021, 06:00:01 AM

Wait those spaces in between shouldn't be there, I meant for it to be zero-padded, can you change the code to this?

Code:

::printf("Point X: %016X%016X%016X%016X \n", P.x.bits64[3], P.x.bits64[2], P.x.bits64[1], P.x.bits64[0]);
::printf("Point Y: %016X%016X%016X%016X \n", P.y.bits64[3], P.y.bits64[2], P.y.bits64[1], P.y.bits64[0]);

Thank you very much

last code compare with old one, am I do correct?
if correct I will remove all old code that wrong

fxsniper

member

Activity: 406

Merit: 47

Quote from: ?? on ??

I'm using Kangaroo 2.2
Windows version

Kangaroo 2.2 using C++ language

Visual Studio 2019 Community Edition (Free)
https://visualstudio.microsoft.com/downloads/

compile using project file Kangaroo.sln on folder VC_CUDA102
require to install CUDA version 10.2

I am not programmer it is hard to modify it a lot
Kangaroo 2.2 only can work with 120 bit puzzle

python it easy to modify but it very very slow and limited with 50 bit puzzle

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Wait those spaces in between shouldn't be there, I meant for it to be zero-padded, can you change the code to this?

Code:

::printf("Point X: %016X%016X%016X%016X \n", P.x.bits64[3], P.x.bits64[2], P.x.bits64[1], P.x.bits64[0]);
::printf("Point Y: %016X%016X%016X%016X \n", P.y.bits64[3], P.y.bits64[2], P.y.bits64[1], P.y.bits64[0]);

fxsniper

member

Activity: 406

Merit: 47

Quote from: NotATether on April 25, 2021, 02:19:16 AM

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

Thank you very much

code it is works

compare with my test print directly

this is 64 bit number right , how can decode to decimal

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

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

NotATether, Did you ever work on the 128 + bits DP mask?

Yes I finished the 128+ bit range quite some time ago, you can get it from https://github.com/ZenulAbidin/Kangaroo-256

As for dpmask, what I discovered is that the runtime goes UP the bigger the dpmask you use. Search time becomes too long (in hundreds of years) when your dpmask is at 128 so I scrapped the addition.

Quote from: WanderingPhilospher on April 24, 2021, 02: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.~~ My bad, I thought you were talking about range

Quote from: gsciservices on April 24, 2021, 05: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 April 24, 2021, 08:37:54 PM

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

fxsniper

member

Activity: 406

Merit: 47

Quote from: WanderingPhilospher on April 24, 2021, 10:06:54 AM

@fx
Also:

Quote

if can get collision point from save.work file by kangaroo.exe may be help to easy to set DP to match with
example

puzzle #40
ec9d5049bd4509aa41e1f5c312de1900d3eac4adba0692a41286b2497e520000 1110317004752
ec9d5049bd4509aa41e1f5c312de1900d3eac4adba0692a41286b2497e520000 106665591802

The Kangaroo.exe and the kangaroo python script you have been running will not match. Notice in your python script the zeros are at the end, they are "trailing". Kangaroo.exe uses leading zeros. Plus, if you use a range, Kangaroo.exe subtracts start range and reduces search by 1 bit. The two will never match unless you do some deep programming modification in one of the programs.

EDIT: and the Kangaroo.exe only saves the least (last) bits of the points, where your python script saves the entire point.

old python script I use
http://bitchain.pl/100btc/pollard_kangaroo.txt
and
https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo-multi.py

for modify python just code on output display but for process and algorithm I am not modify keep work from original

Can you help to modify save function to save full data purpose for read and learning not for use continue works?
How can I do make it save full point

fxsniper

member

Activity: 406

Merit: 47

Quote from: NotATether on April 24, 2021, 11:25:23 AM

Quote from: fxsniper on April 24, 2021, 07:49:15 AM

image I try to print P value out but fould like this may be is binary file need to be convert to hex or decimal

You are printing the P value directly, this will make binary output since it's a class, you have to print each of P.x and P.y separately, and each of those is split into 4 64-bit parts called P.x.bits64[0 1 2 3] which all need to be printed with a separate printf() format character.

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)

look like every value is store and works in binary
pk
P
keyToSearchNeg

all is binary (when print directly will get Alien language)

gsciservices

newbie

Activity: 8

Merit: 0

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

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

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

Quote from: NotATether on March 13, 2021, 11:32:48 PM

Quote from: WanderingPhilospher on March 12, 2021, 10:48:54 PM

This is just not true. The RAM consumed/used is not dependent on the bits being search...it comes down to your DP setting and how often you save the work file. I don't see your settings/flags when starting the program but you are using a very low -d setting or that plus using a long save to file time.

I can see now that searching a 256-bit interval will become feasible if we use 128+ bits of DP mask

Quote from: NotATether on March 23, 2021, 01:25:10 PM

Quote from: bigvito19 on March 15, 2021, 02:16:11 PM

How feasible are you talking? So you are working on searching 256-bit interval using 128 + bits of DP mask too?

I forgot about this thread - sorry about that.

Yeah I am, so far I have the actual program running on GPU, it's running at ~260MKeys/s with the expanded dpmask on my T4 though but it's making quite a large number of same herd collisions and dead kangaroos. I had actually expected the speed to be much faster, like around ~1500MKeys/s given that I saw someone's V100 do ~1100MKeys/s.

I doubt checking three more uint64's for equality within the main loop is what's causing this speed drop but it's a good opportunity to peek into the CUDA accelerated Int class and see what else can be sped up.

NotATether, Did you ever work on the 128 + bits DP mask?

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.

bigvito19

full member

Activity: 706

Merit: 111

Quote from: NotATether on March 13, 2021, 11:32:48 PM

Quote from: WanderingPhilospher on March 12, 2021, 10:48:54 PM

This is just not true. The RAM consumed/used is not dependent on the bits being search...it comes down to your DP setting and how often you save the work file. I don't see your settings/flags when starting the program but you are using a very low -d setting or that plus using a long save to file time.

I can see now that searching a 256-bit interval will become feasible if we use 128+ bits of DP mask

Quote from: NotATether on March 23, 2021, 01:25:10 PM

Quote from: bigvito19 on March 15, 2021, 02:16:11 PM

How feasible are you talking? So you are working on searching 256-bit interval using 128 + bits of DP mask too?

I forgot about this thread - sorry about that.

Yeah I am, so far I have the actual program running on GPU, it's running at ~260MKeys/s with the expanded dpmask on my T4 though but it's making quite a large number of same herd collisions and dead kangaroos. I had actually expected the speed to be much faster, like around ~1500MKeys/s given that I saw someone's V100 do ~1100MKeys/s.

I doubt checking three more uint64's for equality within the main loop is what's causing this speed drop but it's a good opportunity to peek into the CUDA accelerated Int class and see what else can be sped up.

NotATether, Did you ever work on the 128 + bits DP mask?

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: fxsniper on April 24, 2021, 07:49:15 AM

image I try to print P value out but fould like this may be is binary file need to be convert to hex or decimal

You are printing the P value directly, this will make binary output since it's a class, you have to print each of P.x and P.y separately, and each of those is split into 4 64-bit parts called P.x.bits64[0 1 2 3] which all need to be printed with a separate printf() format character.

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

@fx
Also:

Quote

if can get collision point from save.work file by kangaroo.exe may be help to easy to set DP to match with
example

puzzle #40
ec9d5049bd4509aa41e1f5c312de1900d3eac4adba0692a41286b2497e520000 1110317004752
ec9d5049bd4509aa41e1f5c312de1900d3eac4adba0692a41286b2497e520000 106665591802

The Kangaroo.exe and the kangaroo python script you have been running will not match. Notice in your python script the zeros are at the end, they are "trailing". Kangaroo.exe uses leading zeros. Plus, if you use a range, Kangaroo.exe subtracts start range and reduces search by 1 bit. The two will never match unless you do some deep programming modification in one of the programs.

EDIT: and the Kangaroo.exe only saves the least (last) bits of the points, where your python script saves the entire point.

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: fxsniper on April 24, 2021, 07:49:15 AM

Quote from: NotATether on April 24, 2021, 05:38:39 AM

To my understanding I believe it contains records with each entry (they're in binary if I remember correctly) having the positions of the tame and wild kangaroos, and possibly the number of kangaroos present. I'm not entirely sure, I have to check again.

your correct may be is binary

I try to print P Value after check pk and found

  Point P = secp->ComputePublicKey(&pk);

  if(P.equals(keyToSearch)) {
  if(P.equals(keyToSearchNeg)) {

P is point of collision point right

image I try to print P value out but fould like this may be is binary file need to be convert to hex or decimal

@fx, again, what are you trying to see or accomplish? You have seen the tame and wild files from the kangaroo python script you have ran. There is nothing different with the kangaroo.exe files. They contain point and distances. I do not understand your obsession with wanting to see the collision points and distances. Seeing them will not help you figure out a DP or help you in any way.

JP and a lot of other smart people have thought of pretty much everything to make kangaroo.exe the best kangaroo program out there. the DP is auto calculated based on bit size you are searching and the number of kangaroos you have (based on your GPUs/CPUs) to limit the amount of DP overhead.

The work/save files contain headers and then the tame and wild points and distances.

I've told you to use the -wsplit option if you want to see collision points. After key is solved, extract points and distances via the python script I showed you. THEN you can see the collision points.

Code:

TAME
01f57df72a208ecb0dff27e1836f190850728 0000000000000000c6b916f827ecc764
01f7fe7bfd3dc4c604b3e708c2fb4bdd2ed46 0000000000000000f862dc916dfc4479
01f84404e1bbaf74e5e86ddf86fa2e96f165a 0000000000000000d190f29c6c0596f6
34f64327b6e6129a2af1cc6a106f2cec5fcf0 00000000000000001f9e0d582f7942fd
34f6889b8abd66be32f13ebe2cf24d5ab6b62 00000000000000009b0984d32bf64396
34f6fdd77d4d6a532866be4fdfa5923a09ead 0000000000000000bc3de9e206c157db
--
WILD
34f44f024c8997abff6b5f1ee364c414c3016 0000000000000000344f3351ce019232
34f6889b8abd66be32f13ebe2cf24d5ab6b62 -00000000000000000d2f2c61d9bc24d1
34f738fed0a483f198a7a44d04e073c45b962 -0000000000000000602f88bbfaa6b336
01f7a2ae1656a659818a81f9a87204c29f1e8 -000000000000000048ea5f42dfb5bcc4
01f7fe7bfd3dc4c604b3e708c2fb4bdd2ed46 0000000000000000502a2b5c6849dc12
01f8143c41d86963bf9df718f9d0ba2e80cd7 00000000000000000a350d95bb55cb79

Code:

TAME: 01f7fe7bfd3dc4c604b3e708c2fb4bdd2ed46 0000000000000000f862dc916dfc4479
WILD: 01f7fe7bfd3dc4c604b3e708c2fb4bdd2ed46 0000000000000000502a2b5c6849dc12

SECRET_PRIV_KEY = TAME_DIST - WILD_DIST + START
0xf862dc916dfc4479 - 0x502a2b5c6849dc12 + 2**64 = 0x1a838b13505b26867

fxsniper

member

Activity: 406

Merit: 47

Quote from: NotATether on April 24, 2021, 05:38:39 AM

To my understanding I believe it contains records with each entry (they're in binary if I remember correctly) having the positions of the tame and wild kangaroos, and possibly the number of kangaroos present. I'm not entirely sure, I have to check again.

your correct may be is binary

I try to print P Value after check pk and found

Point P = secp->ComputePublicKey(&pk);

if(P.equals(keyToSearch)) {
if(P.equals(keyToSearchNeg)) {

P is point of collision point right

image I try to print P value out but fould like this may be is binary file need to be convert to hex or decimal

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

@lostbitcoin, your image links are broken and return 404 not found, can you update them?

Quote from: fxsniper on April 24, 2021, 04:16:39 AM

Can you help to explain for kangaroo.exe data from save.work file?

To my understanding I believe it contains records with each entry (they're in binary if I remember correctly) having the positions of the tame and wild kangaroos, and possibly the number of kangaroos present. I'm not entirely sure, I have to check again.

Quote from: fxsniper on April 24, 2021, 05:29:45 AM

Total I want to modify 2 thing
1. write save file again when write output file
2. print out collision point

2. is fairly easy to do, in the function Kangaroo::CollisionCheck or something named like that there are two variables called Td and Wd which are your tame and wild points which you can then print out. Only problem would be finding a way to print these variables since they are of Int class and may not have a print method.

1. is possible but only if you already passed a work file using -ws, you would put the SaveWork call just before the Output call.

fxsniper

member

Activity: 406

Merit: 47

Help to modify kangaroo.exe code

I am not expert with c++ (sorry it is very hard to learn normal user I am not programmer)

I think I would like to add command to call function Save to function output

I am not sure it correct or not

Kangaroo::SaveWork

bool Kangaroo::Output

I see at Kangaroo::Output function works two thing one open file output and write private key to output file and then print out treport on display show message found private key

So, if I add function SaveWork to work before write output file (or after write output file but before print out on scree to show private key message)
may be help to save work file include collision point

may be function SaveWork , process only on schedule time

and more one collision point to show when fprint show hex private key (when found)
how I can fprint this value when found it

Total I want to modify 2 thing
1. write save file again when write output file
2. print out collision point

I think insert code may be simple, anyone can help?

Thank you for help

fxsniper

member

Activity: 406

Merit: 47

Quote from: ?? on ??

thanks

https://ibb.co/yWd5j22
https://ibb.co/G0zdCNc

This program was created with a lot of time and effort.
I won't share.

Do you have source code how to calculate?

however I calculate difference with you

from script python(kangaroo)

puzzle #50 (python 1 hour solve)

collision point
c52d3e18cf60567ff0ec3ada36b35b214281c2d0a0fa24e1bd1844f982400000 383497870405204
c52d3e18cf60567ff0ec3ada36b35b214281c2d0a0fa24e1bd1844f982400000 994638366572968

994638366572968-383497870405204 = 611140496167764 = 22BD43C2E9354

>>> math.log2(994638366572968)
49.82116541027459
>>> math.log2(383497870405204)
48.44621189477088

c52d3e18cf60567ff0ec3ada36b35b214281c2d0a0fa24e1bd1844f982400000
convert to Dec
89185567865970002315484466436073764171950415667507660205264806658442243604480

is not publickkey key but it is Elliptic curve

Elliptic curve last calculate (from private key = 611140496167764 = 22BD43C2E9354)

Elliptic curve double x = 89185567865970002315484466436073764171950415667507660205264806658442243604480
Elliptic curve double y = 87127837977108995721802776410311454708031756638369374626443936686222994129249

public key x = c52d3e18cf60567ff0ec3ada36b35b214281c2d0a0fa24e1bd1844f982400000
public key y = c0a09bd53538cb2e3dabfdfb7a3385b62ce3e69963ea073967d9151c5edd4161

public key uncompressed:
04c52d3e18cf60567ff0ec3ada36b35b214281c2d0a0fa24e1bd1844f982400000c0a09bd53538c b2e3dabfdfb7a3385b62ce3e69963ea073967d9151c5edd4161

public key
03c52d3e18cf60567ff0ec3ada36b35b214281c2d0a0fa24e1bd1844f982400000

kangaroo found collision point on Elliptic curve calculate (process between convert private key to public key)

fxsniper

member

Activity: 406

Merit: 47

Quote from: NotATether on April 24, 2021, 03:32:55 AM

Quote from: fxsniper on April 24, 2021, 01:06:10 AM

I would like to measure kangaroo DP for puzzle #120

I always wondered what the relation was between DPsize and runtime. Maybe somebody should draw a few graphs. They will be parabolic because setting the size too low or high exponentially increases runtime, and if we could even make a 3D graph lining up the DP curves from all range sizes (powers in this case).

The idea would be to find the smallest points on the graph to see if there's a way to improve the automatically calculated dpsize value. (I once experimented with setting an arbitrary dpmask, but that had very bad effects for runtime.)

kangaroo still power full for now (not yet have other algorithm best for now)

Can you help to explain for kangaroo.exe data from save.work file?

save.work file from kangaroo.exe both solve a 120 bit and 256 bit data is same format (solve by using generate private key and publick key)

I convert hex to dec

from 120 bit solve (test pubkey)
262143,48357306424295921700769579380444332534 1562842135080204172
262143,236688263920794955386261906309794027722 967375894582543310

262143,209421810490797557957190854895683512892 441962270191571849
262143,225641934287901095819832523508370738498 1316787007398506857
262143,291551157822226898627726358187674170442 -493837653657333763

from 265 bit solve (test pubkey)

0,59459776387358570849530339812195619039 30449515388215305633
0,168557432531209639563818391489784546103 27117058245582788305
0,187703705753502279679574421533681592130 23895961494359236057
0,211282612041149045737248359108783970698 28316598789817799604

262143,303498835120544398690280772659518904948 15298374911161789743
262143,330471970880799703221136385694942800905 24405259179491741594
262143,333088154919942412776046848521499169913 29643794240743107223

bot still same format, I don't know what is number from?

fxsniper

member

Activity: 406

Merit: 47

Quote from: ?? on ??

I don't think there is such a feature in kangaroos yet.
I don't think there is yet an application that can calculate this, so I made an application that calculates this.

you want program

I am sorry that I have not reached the level where I can upload pictures.
I think it's the program you want.
Is it correct?

upload image easy by https://imgbb.com/

and copy BB code to post

Topic: Pollard's kangaroo ECDLP solver - page 62. (Read 60095 times)