Pollard's kangaroo ECDLP solver

[WanderingPhilospher]

Windows 7, Win64.
C \ windows \ system32 \ cmd.exe
C: \ USERS \ GAM> "D: BTC \ Kangaroo.exe" Nothing happens.
If I immediately start Kangaroo.exe, the Windows 7 Command Prompt (CMD) appears and closes immediately. How to make the program work?javascript:void(0);

Do this so you know it works on your machine/rig:

copy the below text, paste in notepad, and save it as a .bat file.  Save it as kangarootest.bat

if you only have CPU

Code:

Kangaroo.exe -t 4 -d 14 -w 65save -wi 30 65.txt

pause

if you have GPU:

Code:

Kangaroo.exe -t 0 -d 14 -gpu -gpuId 0 -w 65save -wi 30 65.txt

Again, copy and paste that into a text document and save as kangarootest.bat

Now, copy the below text and save it as 65.txt  

Code:

10000000000000000
1FFFFFFFFFFFFFFFF
0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

make sure each line is it's own line...a total of 3 lines.  Save it as 65.txt

Now, place the kangarootest.bat file, the 65.txt file, and the Kangaroo.exe file all in the same folder.
Double click or select the kangarootest.bat file and the program will start.
It may tell you that you do not have a certain file called, "vcruntime140_1" . If that's the case, Google that file, download it and place it in the same folder as the other files. Now, double click, select the kangarootest.bat file and it should work.

Let us know.

[COBRAS]

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.
This value assume that your setup is well tuned with a negligible DP overhead.

Jean_Luc explain this is more detailed ?

For ex. I try fined key in 80 bytes range(0-FFFFFFFF*), I was setup D 24.  

This is fine tuning ?

How to use this option ? "-m maxStep" if I thant after 2^40 kangaro program gibve up search (mean do search in range FFFFFFF-FFFFFF+N) I right understand this function ?

So if I install -m 2^40, program shift search range after 2^40 ?

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.

Why chnace that the key in the range is to small ? ? ?

BR

[WanderingPhilospher]

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.
This value assume that your setup is well tuned with a negligible DP overhead.

Jean_Luc explain this is more detailed ?

For ex. I try fined key in 80 bytes range(0-FFFFFFFF*), I was setup D 24.  

This is fine tuning ?

How to use this option ? "-m maxStep" if I thant after 2^40 kangaro program gibve up search (mean do search in range FFFFFFF-FFFFFF+N) I right understand this function ?

So if I install -m 2^40, program shift search range after 2^40 ?

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.

Why chnace that the key in the range is to small ? ? ?

BR

As for the -m option, yes. But you have to set it up as -m 0.0 (whatever number you want) If estimated ops is at 2^40 and you want to end it if it reaches 2^40.5 then you would use -m 0.5

[COBRAS]

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.
This value assume that your setup is well tuned with a negligible DP overhead.

Jean_Luc explain this is more detailed ?

For ex. I try fined key in 80 bytes range(0-FFFFFFFF*), I was setup D 24.  

This is fine tuning ?

How to use this option ? "-m maxStep" if I thant after 2^40 kangaro program gibve up search (mean do search in range FFFFFFF-FFFFFF+N) I right understand this function ?

So if I install -m 2^40, program shift search range after 2^40 ?

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.

Why chnace that the key in the range is to small ? ? ?

BR

As for the -m option, yes. But you have to set it up as -m 0.0 (whatever number you want) If estimated ops is at 2^40 and you want to end it if it reaches 2^40.5 then you would use -m 0.5

Buddy, thank your for your answer. But, after -m 0.5 for ex, program STOP calculation or CHANGE the search range and continue calculation  ?

[WanderingPhilospher]

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.
This value assume that your setup is well tuned with a negligible DP overhead.

Jean_Luc explain this is more detailed ?

For ex. I try fined key in 80 bytes range(0-FFFFFFFF*), I was setup D 24.  

This is fine tuning ?

How to use this option ? "-m maxStep" if I thant after 2^40 kangaro program gibve up search (mean do search in range FFFFFFF-FFFFFF+N) I right understand this function ?

So if I install -m 2^40, program shift search range after 2^40 ?

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.

Why chnace that the key in the range is to small ? ? ?

BR

As for the -m option, yes. But you have to set it up as -m 0.0 (whatever number you want) If estimated ops is at 2^40 and you want to end it if it reaches 2^40.5 then you would use -m 0.5

Buddy, thank your for your answer. But, after -m 0.5 for ex, program STOP calculation or CHANGE the search range and continue calculation  ?

Sorry, it stops the search. If you have multiple pub keys in your info text, it will go to the next one and start searching for it. If you only have 1 pubkey in info text, then it stops the program because there is nothing else left to search.
Again, it stops the search, it does not shift any range.

[COBRAS]

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.
This value assume that your setup is well tuned with a negligible DP overhead.

Jean_Luc explain this is more detailed ?

For ex. I try fined key in 80 bytes range(0-FFFFFFFF*), I was setup D 24.  

This is fine tuning ?

How to use this option ? "-m maxStep" if I thant after 2^40 kangaro program gibve up search (mean do search in range FFFFFFF-FFFFFF+N) I right understand this function ?

So if I install -m 2^40, program shift search range after 2^40 ?

6*sqrt(N) => 99.752% chance that you found the key so ~0.25% chance that the key is well in the range.

Why chnace that the key in the range is to small ? ? ?

BR

As for the -m option, yes. But you have to set it up as -m 0.0 (whatever number you want) If estimated ops is at 2^40 and you want to end it if it reaches 2^40.5 then you would use -m 0.5

Buddy, thank your for your answer. But, after -m 0.5 for ex, program STOP calculation or CHANGE the search range and continue calculation  ?

Sorry, it stops the search. If you have multiple pub keys in your info text, it will go to the next one and start searching for it. If you only have 1 pubkey in info text, then it stops the program because there is nothing else left to search.
Again, it stops the search, it does not shift any range.

Thank you for your answer.

Buddy, how can be used ifro from  this picture https://github.com/JeanLucPons/Kangaroo/raw/master/DOC/successprob.jpg

?

What setting I nedd to do for get 100% probability ?

Br.

[math09183]

What setting I nedd to do for get 100% probability ?

Maximum patience 

[COBRAS]

What setting I nedd to do for get 100% probability ?

Maximum patience  

Oh, Good Lack Man !!! Be Be !!  

You trust Santa ? So, what he say you about time then he came to you again ? ? ?  

[PietCoin97]

someone have workfile for share with dp26 ?

[Etar]

Seems like #115 pazzle it is the latest pazzle to solve with kangaroo.
Next #120 need 160 days with 100x2080ti. With the same power even at not the best algorithm Ethash for this card this huge power get 1.6BTC for 160 days, it is much more then expected reward for solving key.

[PietCoin97]

oww Zielar i run my engines so long now for 115 and you solve it tomorrow ? wht dp size you choose ?

i have dp 26 maybe i can share with you

[PietCoin97]

the thing is i start with dp 24 after you found the 110 bit then i lost big file for dp 24

then i start with new one with dp 26 i run it for 6 days

this is my workfile

Loading: 115all
Version   : 0
DP bits   : 26
Start     : 40000000000000000000000000000
Stop      : 7FFFFFFFFFFFFFFFFFFFFFFFFFFFF
Key       : 0248D313B0398D4923CDCA73B8CFA6532B91B96703902FC8B32FD438A3B7CD7F55
Count     : 9743276691781672 2^53.113
Time      : 68.7d
DP Size   : 403.0/1183.5MB
DP Count  : 13140929 2^23.648
HT Max    : 89 [@ 021EC5]
HT Min    : 22 [@ 00EAD0]
HT Avg    : 50.13
HT SDev   : 7.09
Kangaroos : 0 2^-inf


Kangaroo v1.8
Loading: 115all
Version   : 0
DP bits   : 24
Start     : 40000000000000000000000000000
Stop      : 7FFFFFFFFFFFFFFFFFFFFFFFFFFFF
Key       : 0248D313B0398D4923CDCA73B8CFA6532B91B96703902FC8B32FD438A3B7CD7F55
Count     : 11306564601638692 2^53.328
Time      : 103.7d
DP Size   : 655.4/1815.3MB
DP Count  : 21411199 2^24.352
HT Max    : 129 [@ 021EC5]
HT Min    : 46 [@ 00BF14]
HT Avg    : 81.68
HT SDev   : 9.07
Kangaroos : 0 2^-inf

[MrFreeDragon]

Together with the author of this work, we plan to have solution # 115 tomorrow and set a new record :-)

How long are your GPUs working on #115?

If #110 was solved for 2 days, so with the same speed and the same luck you need 2days * sqrt(2^5) = 2 days * 5.66 ~ 11.3 days for #115. So, yes, if you started on 1 June, the estimated completion date 11-12 June  

For #110 you was very close to sqrt(n) operations, but not the average 2*sqrt(n). That means that probably you should wait another 11-12 days to be close to the average and 50% probability to find the key.

EDIT:
I doubt you will find the #115 key tomorrow. Much more likely at the end of June, or mid July. But not tomorrow.

[WanderingPhilospher]

If any of you are working on #115 or #120 or # any above that, by yourself, you're just wasting power.

Jean Luc's knowledge, with Zielar's unlimited GPUs through his work...YOU can't compete. Especially if Jean Luc is making changes to increase chances of Zielar finding the puzzle.

You can't compete. Not with Kangaroo. You'll have to get creative and try random other options.

It's like everyone has GPU power but no one wants to link up and send DPs to common server, or get together and agree on a specific DP to share work files, etc.

I'd rather have 10% of 1.15 BTC versus 0%.

I'm still in the chase, but not strictly with Kangaroo. I offered up my work files, at DP 30 or 31. They are just sitting in file, no longer being used. I'm down to DP 12, with creative works.

[WanderingPhilospher]

Together with the author of this work, we plan to have solution # 115 tomorrow and set a new record :-)

How long are your GPUs working on #115?

If #110 was solved for 2 days, so with the same speed and the same luck you need 2days * sqrt(2^5) = 2 days * 5.66 ~ 11.3 days for #115. So, yes, if you started on 1 June, the estimated completion date 11-12 June  

For #110 you was very close to sqrt(n) operations, but not the average 2*sqrt(n). That means that probably you should wait another 11-12 days to be close to the average and 50% probability to find the key.

EDIT:
I doubt you will find the #115 key tomorrow. Much more likely at the end of June, or mid July. But not tomorrow.

You never know, he may have been granted access to more GPUs through work. Or maybe the luck factor will play in to his favor.

[COBRAS]

Together with the author of this work, we plan to have solution # 115 tomorrow and set a new record :-)

How long are your GPUs working on #115?

If #110 was solved for 2 days, so with the same speed and the same luck you need 2days * sqrt(2^5) = 2 days * 5.66 ~ 11.3 days for #115. So, yes, if you started on 1 June, the estimated completion date 11-12 June  

For #110 you was very close to sqrt(n) operations, but not the average 2*sqrt(n). That means that probably you should wait another 11-12 days to be close to the average and 50% probability to find the key.

EDIT:
I doubt you will find the #115 key tomorrow. Much more likely at the end of June, or mid July. But not tomorrow.

You never know, he may have been granted access to more GPUs through work. Or maybe the luck factor will play in to his favor.

In wikipedia wrighted   -  about max solved is 109 Bytes )))

[Konstanting2]

Thank you very much for the help. I was able to finally run the program. Community tell me how to open a 65save answer file? The file does not have an extension, I open notepad there are hieroglyphs, squares. I tried to open Bred3.0.3, I didn’t open it. Thank you very much in advance.

[COBRAS]

Thank you very much for the help. I was able to finally run the program. Community tell me how to open a 65save answer file? The file does not have an extension, I open notepad there are hieroglyphs, squares. I tried to open Bred3.0.3, I didn’t open it. Thank you very much in advance.

Maybe totalcommander can help. TC file viewer support many codepages(ANSI,Unicode, etc...)

[sssergy2705]

Thank you very much for the help. I was able to finally run the program. Community tell me how to open a 65save answer file? The file does not have an extension, I open notepad there are hieroglyphs, squares. I tried to open Bred3.0.3, I didn’t open it. Thank you very much in advance.

HxD Hex Editor, Winhex, Cygnus Hex Editor, etc

[Jean_Luc]

How long are your GPUs working on #115?

If #110 was solved for 2 days, so with the same speed and the same luck you need 2days * sqrt(2^5) = 2 days * 5.66 ~ 11.3 days for #115. So, yes, if you started on 1 June, the estimated completion date 11-12 June  

For #110 you was very close to sqrt(n) operations, but not the average 2*sqrt(n). That means that probably you should wait another 11-12 days to be close to the average and 50% probability to find the key.

EDIT:
I doubt you will find the #115 key tomorrow. Much more likely at the end of June, or mid July. But not tomorrow.

We almost reached 50% probability yesterday (~8 days of run, ~2^33 DP, DP25) but unfortunately everything was shutdown due to a storm
Fortunately the workfiles has been preserved but we have to restart clients and servers to recover from crash.
As there was no kangaroo backup we will get a DP overhead by restarting the work.
I don't know if Zielar restarted the GPUs, yesterday he was a bit nervous
We also get lots of troubles handling large workfiles (above 200GB) so I created a partitioned work file system (available on github) , an integrity workfile checker. We manage to re-merge all worfiles in ~24H.
The current release is tagged 1.10(unstable) but should work.
Hope it will go better now...