Pollard's kangaroo ECDLP solver

[Etar]

-snip-
Bro, Your code is making what is described there https://bitcointalk.org/index.php?topic=5238719.msg54296078#msg54296078 or something else ?

Python code do exactly what you need (substract startrange from public key). After you will find key, just add to key your startrange and you will get correct PK.

[COBRAS]

-snip-
Bro, Your code is making what is described there https://bitcointalk.org/index.php?topic=5238719.msg54296078#msg54296078 or something else ?

Python code do exactly what you need (substract startrange from public key). After you will find key, just add to key your startrange and you will get correct PK.

Big Thank You Bro !!!

[Etar]

shifted result> 045b7696358e6ba86341eb97a1f1a6622a4a1f175660b456c7c89562eadf3c4e3dfb73c7828b8de ad960cc92c1bc6c3aef5bf4c8496095b65df554ff98c06ce5e9

it is wrong result because you are using uncompressed public key as pointstr!!!
Use only compressed pubkey in pointstr!

[COBRAS]

shifted result> 045b7696358e6ba86341eb97a1f1a6622a4a1f175660b456c7c89562eadf3c4e3dfb73c7828b8de ad960cc92c1bc6c3aef5bf4c8496095b65df554ff98c06ce5e9

it is wrong result because you are using uncompressed public key as pointstr!!!
Use only compressed pubkey in pointstr!

Okey !!! Big Thank You Bro !!!

[Etar]

I am also can admit that there no faster way to solve public key then kangaroo.
Not bsgs not division point and find public keys of fractional parts .
Not division range in to small subranges and solve each separately.
Only kangaroo as is. In full range is the faster method.

[COBRAS]

I am also can admit that there no faster way to solve public key then kangaroo.
Not bsgs not division point and find public keys of fractional parts .
Not division range in to small subranges and solve each separately.
Only kangaroo as is. In full range is the faster method.

I need a method = my budget bro, i have no 200 Tesla. Im not like full range in Kangaroo, this is not liked idea for me. And Kangaroo not  use endomrphsm in what all priveys only 128 bytes !!! Yes - not more 128 bytes !!! Bat kabgaroo version waht make Jean_Luc not make any priveys to 128 bytes max with endomorphism. And I think symmetry what imposible with endomorphism is to expansuve for pay symmetry for 128 bytes privkey. I hope Jean_Luc implement endomorphism in his Kangaroo - he is super programmer and great man. 

[WanderingPhilospher]

I am also can admit that there no faster way to solve public key then kangaroo.
Not bsgs not division point and find public keys of fractional parts .
Not division range in to small subranges and solve each separately.
Only kangaroo as is. In full range is the faster method.

Maybe...however, I think it depends on the size of the range you are checking, and luck.  My implementation of BSGS, how I use it, will compare to quickness of Kangaroo. If luck is really good, even faster. In lower ranges (say ranges 1 to 80), the way I use BSGS, it is as fast or faster. If I had server client to assign ranges, I think it would be even faster. But Kangaroo is definitely the easiest to use, no modding, just click and let it run.

[Etar]

-snip-
Maybe...however, I think it depends on the size of the range you are checking, and luck.  My implementation of BSGS, how I use it, will compare to quickness of Kangaroo. If luck is really good, even faster. In lower ranges (say ranges 1 to 80), the way I use BSGS, it is as fast or faster. If I had server client to assign ranges, I think it would be even faster. But Kangaroo is definitely the easiest to use, no modding, just click and let it run.

Simple example:
Range 2^ 64.0
Kangaroo >Expected OP 2^ 33.05491672361811 (n=0.5+math.sqrt(0.25-2*range*math.log(0.5))
So you need totaly calculate 2^ 33.0549 points.

BSGS>2^ 64.0 in worst case, in the best case unknown (dependency where PK lie) 
Ok, let`s for ex. PK lie in middle of the range, so you need calculate 2^ 63.0 points.
Of course you can say that you have a hash table on 2^36 points for ex. And you need only 2^63/2^36 = 2^27 operations.
But you already spent 2^36 operations to create this hashtable.

[Etar]

About using Endomorphisms in Kangaroo. I think it is not give you result.
Why? becouse you need create new lambda wild herd and beta tame herd.
You get little bit more perfomance due to not point but arithmetic calculation x-coordinate of beta tame kangaroo betax = (x*beta)%p
Maybe I'm wrong, but the advantage there will be minimal.
I mean that betax will never colide with x-coordinate of simple wild DP
You need first create new lambda point from your pub and then produce wild DP from both points (simple pub and lambda point)
In this case x-tame can collide x-wild and x-betatame can collide x-lambdawild.

[filo1992]

-snip-
I was trying to compile your "pure basic" server/client script but I don't seem to find this file: Curve64.pb 
-snip-

Here is link to archive https://drive.google.com/file/d/1XMxvxB1FGxfAi7hFMitiQpENUqvabiQ6
it is new version server/client for bitcrack with POW . Archive contain all source files, libs and precompiled applications.
Before use in a big range try in a small.

Hi, where is the xxx.txt file saved?

[Etar]

-snip-
I was trying to compile your "pure basic" server/client script but I don't seem to find this file: Curve64.pb  
-snip-

Here is link to archive https://drive.google.com/file/d/1XMxvxB1FGxfAi7hFMitiQpENUqvabiQ6
it is new version server/client for bitcrack with POW . Archive contain all source files, libs and precompiled applications.
Before use in a big range try in a small.

Hi, where is the xxx.txt file saved?

file xxx.txt saved in the same folder as client app but it immediately deleted when any key solved(pow key or main key), and content of this file send to the server.
Once xxx.txt created by bitcrack client app read content, delete this file and send to the server.

[filo1992]

-snip-
I was trying to compile your "pure basic" server/client script but I don't seem to find this file: Curve64.pb  
-snip-

Here is link to archive https://drive.google.com/file/d/1XMxvxB1FGxfAi7hFMitiQpENUqvabiQ6
it is new version server/client for bitcrack with POW . Archive contain all source files, libs and precompiled applications.
Before use in a big range try in a small.

Hi, where is the xxx.txt file saved?

file xxx.txt saved in the same folder as client app but it immediately deleted when any key solved(pow key or main key), and content of this file send to the server.
Once xxx.txt created by bitcrack client app read content, delete this file and send to the server.

but the POW keys found and saved in xxx.txt on the server do not track us

[Etar]

-snip-
but the POW keys found and saved in xxx.txt on the server do not track us

It is no matter pow key solved or main key, xxx.txt wil be deleted.
If solved powkey then cleint app read content of xxx.file and wait while range will be solved.
After bitcrack will quit cleint app send content of xxx.file to the server to submit work.

if solved main key than client app send content to the server immediately.
If solved both key than you submit work + submit key, but any way xxx.file will be deleted from client.
Pow address need only to proof of work client, that he realy check subrange.
server do not save xxxx.txt file. He save only winkey.txt(by default) file where put address and Pk when main key solved.
Also server create database file named personal.db where saved work for each client.
you can use this data base file to pay reward for work(if you want).
DB file it is simple sqlite3 file. You can read it any sqlite viewer.

[filo1992]

-snip-
but the POW keys found and saved in xxx.txt on the server do not track us

It is no matter pow key solved or main key, xxx.txt wil be deleted.
If solved powkey then cleint app read content of xxx.file and wait while range will be solved.
After bitcrack will quit cleint app send content of xxx.file to the server to submit work.

if solved main key than client app send content to the server immediately.
If solved both key than you submit work + submit key, but any way xxx.file will be deleted from client.
Pow address need only to proof of work client, that he realy check subrange.

ok, I understand thanks

[Etar]

-snip-
ok, I understand thanks

i can also share my map file. it is not big around 70 solved subranges with -dp 20 but any way maybe it can help for some solve key faster then zielar.
I don`t like monopoly in all its manifestations.

[filo1992]

-snip-
ok, I understand thanks

i can also share my map file. it is not big around 70 solved subranges with -dp 20 but any way maybe it can help for some solve key faster then zielar.
I don`t like monopoly in all its manifestations.

it might be interesting, afterwards is there the possibility to link my MAP file with yours?

[filo1992]

-snip-
but the POW keys found and saved in xxx.txt on the server do not track us

It is no matter pow key solved or main key, xxx.txt wil be deleted.
If solved powkey then cleint app read content of xxx.file and wait while range will be solved.
After bitcrack will quit cleint app send content of xxx.file to the server to submit work.

if solved main key than client app send content to the server immediately.
If solved both key than you submit work + submit key, but any way xxx.file will be deleted from client.
Pow address need only to proof of work client, that he realy check subrange.

ok, I understand thanks

one last question, why when the customer finishes the range and receives another job does not increase the scanned value but the buzzy value

https://imgur.com/jctfJtN

[COBRAS]

-snip-
ok, I understand thanks

i can also share my map file. it is not big around 70 solved subranges with -dp 20 but any way maybe it can help for some solve key faster then zielar.
I don`t like monopoly in all its manifestations.

Bro, share please work files ??  All link what was in this thread for working files dead !!! And noone whant reupload then I ask.

??

I don`t like monopoly in all its manifestations.

Yes !!! Chachahca!!! 

[Etar]

-snip-
one last question, why when the customer finishes the range and receives another job does not increase the scanned value but the buzzy value

https://imgur.com/jctfJtN

When work will be submit you wil see + scanned and message that pow key valid. in screen i can`t see that any client submit work.
Sould be like this.


Edit: here is link to map merger for crackServer https://drive.google.com/file/d/1zBsO6CUWgPQStPq1du6Yymdjx8aOqmFc
Source and precompiled exe file included. Also included map.bin file . If you have question let me know PM because i am already alot write here offtopic message.(sorry @JeanLuc  )

[Bitcoinfan2020]

Hello @Jean_Luc and dear forum members,

Thanks for this, I gave it a try with a 80bit range and it worked.

One question please. If the key/keys is out of range for the given PubKeys in the .txt file, is it suppose to stop and give an error? I tested this by searching out of range keys for 3 pubKeys and it kept searching for many hours without stopping or giving an error like "not found" or something. Isn't it supposed to stop once it finishes searching the range without finding the key? Again I'm referring o smaller ranges 70-80 bits and I use powerful Teslas. If the keys are in range it finds them but if they keys are out of range it just keeps going...Thanks.

Cheers,
Jorge