Pollard's kangaroo ECDLP solver

[COBRAS]

Maybe any one can share map file from crackServer?

hi there etar,

where does it get those 32 addressess. i mean it finds those 32 but writes one
at the end inside this file with a date and winkey.txt inside the default folder the test.bat.
so when run 1 time, at the end of those 32 can it show the keys saved inside the xxx.txt cause right
now nowhere the pkey for 31 of them to be found. is it.?
thanks man.

in test.bat address main addres 1EeAxcprB2PpCnr34VfZdFrkUWuxyiNEFv and -dp 6 and range 8000000000:ffffffffff
This mean that whole range devide into 32subranges. And each of this subranges in random way go to client.
So Task for client is find 1EeAxcprB2PpCnr34VfZdFrkUWuxyiNEFv but to prof of work, that client realy solve rubrange, server add 1 address randomly generated on the fly in this subrange.
So client get 2 address in each job. main address and pow address. And he need at worst case solve 1 address and in the best 2 address.
Once main key solved server creat winkey.txt file where put privat key and address. PK from pow keys never stored no where.
File xxx.txt created only on clientside and always deleted by client app.

Bro, Hi !

Do you cnow how to move data from memory to file in kangaroo ? Kangaroo eating to many mmory - 20-30 Gb and more, and I search method for move data from memory to file on disk.... ?

I think I heard that there is such a function, but I can't figure out how to enable it.

[Etar]

-snip-
Do you cnow how to move data from memory to file in kangaroo ? Kangaroo eating to many mmory - 20-30 Gb and more, and I search method for move data from memory to file on disk.... ?

I think I heard that there is such a function, but I can't figure out how to enable it.

Kangaroo argument -wsplit save hashtable to file and reset hashtable

[Etar]

Time to refresh the discussion  
Edit:i was wrong.

[COBRAS]

Time to refresh the discussion  
range 2^64
BSGS HT=2^30 = 9GB
OP to scan whole range 2^64/2^30=2^34 op

BSGS with DP and endomorphisms
BSGS HT=2^30 * DP 2^8 = 2^38 = 9GB (We have 2^30 points but range computed is 2^38)
HT contain DP 2^29 pointG, 2^28 pointLambda1, 2^28 pointLambda2, totaly 2^30 points
jump will be equil to double HTsize = 2^38 * 2 = 2^39
OP to scan whole range 2^64/2^39=2^25 and each jump cost 2^8 op
We will use 2 endomorphism beta1 and beta2 so each point computed from pubkey give us 3 point(point,beta1 and beta2)
So we can 3 times faster(in average) calculate each DP and jump will cost 2^6.4 op
Totaly to scan whole range we need 2^25 jumps and each jump cost 2^6.4 = 2^31.4 op

HT table content:
G,2G,3G...2^29G
(2^29G+G)*Lambda1,(2^29G+2G)*Lambda1,(2^29G+3G)*Lambda1...(2^29G+2^28G)*Lambda1
(2^29G+2^28G+G)*Lambda2,(2^29G+2^28G+2G)*Lambda2,(2^29G+2^28G+3G)*Lambda2...(2^29G+2^28G+2^28G)*Lambda2

Not Bad !!! I thnk this is a faster then kangaro or =. Kangaroo is not stable result. I may start kangaroo 2 times and get 2 result- not found and found. BSGS eting many many memory, but BSGS as I remeber work with big ranges for ex 128 bytes, I not remeber about 2 mptnhs for calculation in BSGS, but Kangaroo many times say me what wayt 2 monts....

There is the link to BSGS code with endomorthism ? Have you implement hash dump from memory to disk ?

To all many respected members. THEN YOU SHOW CODE FOR ETHEREUM

 ETH is simle then BTC as I know(BTC pubkey is a SHA+SHA..., ETH ONLY 1 SHA !!!) ?

Br.

[dextronomous]

Time to refresh the discussion  
Edit:i was wrong.

Hey there, i have 64 bit address and -dp 20 or 21 it has 524288 or more Left, and didn't do 1 in 24hrs. whats wrong, is it a solver issue, bitcrack issue, could you get rid off those random addressess. so only report current place and percentage of something, now took 2 days nothing nada happened yet. could you add Telariusts bitcrack version. thanks a lot.

[Etar]

Time to refresh the discussion  
Edit:i was wrong.

Hey there, i have 64 bit address and -dp 20 or 21 it has 524288 or more Left, and didn't do 1 in 24hrs. whats wrong, is it a solver issue, bitcrack issue, could you get rid off those random addressess. so only report current place and percentage of something, now took 2 days nothing nada happened yet. could you add Telariusts bitcrack version. thanks a lot.

i think you are using CL version that have bug.(i do not test but heared) or maybe your GPU is to slow and can`t done job in 24h.
Try test .bat file there very low subranges.
Any way "solver" it is only launcher for bitcrack, he not do anything, just send arguments to the bitckrack. Also all arguments you can see in concole of client app.
Else i can`t remove pow address because you can fall into a trap like filo1992, he was using old version of server(where no pow checking) and bitcrack CL version that have bug.
With CL bug of BC he scan each subrange 2^53 in a very short time(it impossible) and client app send this not realy checked subranges to server. He is just waste time becouse subranges was not realy scanned!
Now with pow checking server can at least understand that the entire subrange has been scanned becouse client app send pow address and key to server and validate his there.
So consider that pow address is some kind of error protection.

[COBRAS]

Endomorphism on ECSDA reading:

fresh with codes - speedup 40% https://medium.com/@CoinExChain/acceleration-of-ecdsa-verification-with-endomorphism-mapping-of-secp256k1-126e77a51dba

Endomorphisms for Faster Elliptic Curve
Cryptography on a Large Class of Curves

Gaudry method "beats the Pollard methods for m ≥ 3."

https://www.iacr.org/archive/eurocrypt2009/54790519/54790519.pdf

[dextronomous]

wot Etar, you did that for me, thanks a lot mate,
great piece still working flawless,

[COBRAS]

Hello,

I would like to present an interval ECDLP solver based on the Pollard's kangaroo method.
This program is fully open source and available on GitHub: https://github.com/JeanLucPons/Kangaroo
It has GPU support (CUDA Only) and works on both Linux and Windows.
This program is currently under development.

Thanks to test it and to share ideas of improvements here

Buddy, Can you make something like brainflare for search start range of private keys ? Brainflare operate word, so brainflare operate 128-256 bytes privkeys. Can you made soft for addition to Kangaroo - firs search start big range(or not 1 Big range for 1 pubkey, 1-5 potential big ranges for ex.), second search exact range with kangaroo PEASE PLEASE PLEASE !!!

Jean_Luc ? ? ?



Big Thank You.

[dextronomous]

yes buddy please make that one thanks ahead.

[stalker00075]

it would be great to check all the public keys at once over a given range
(interested in multi public checker)


will it be possible to do so?

[COBRAS]

it would be great to check all the public keys at once over a given range

will it be so?

Unfortunately, Jean_Luc is silent.

Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!

p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!

[WanderingPhilospher]

it would be great to check all the public keys at once over a given range

will it be so?

Unfortunately, Jean_Luc is silent.

Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!

p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!

What do you mean you can't find any keys from 1-80? 2^1 to 2^80?
It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help.

[COBRAS]

it would be great to check all the public keys at once over a given range

will it be so?

Unfortunately, Jean_Luc is silent.

Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!

p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!

What do you mean you can't find any keys from 1-80? 2^1 to 2^80?
It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help.

Hi. Yes from 1 to 128 bytes. But you don know 128 bytes start from 1 or from F, this understand ? And I ask Jean_Luc, making code for resolve this problem for find "BIG" range - START(FIRST) BYTES for 128 bytes, need find first NN bytes. BrainFlare generate 128-256 bytes privkeys !!! So with 80 bytes only is impossible to find privkey from not puzzle adresses.

Understand now ?

This is a example privkey

0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
                                                                            

How you get this privkey with search in range 80 without this "0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3" part of  the range ?

But if you know something lile

0x88888888888888888888888888888888888888888888887..............................
0x6...
0x77777777777777777778888888888888888888888888888..............................

the problem moves to a known solution area

[WanderingPhilospher]

Hi. Yes from 1 to 128 bytes. But you don know 128 bytes start from 1 or from F, this understand ? And I ask Jean_Luc, making code for resolve this problem for find "BIG" range - START(FIRST) BYTES for 128 bytes, need find first NN bytes. BrainFlare generate 128-256 bytes privkeys !!! So with 80 bytes only is impossible to find privkey from not puzzle adresses.

Understand now ?

This is a example privkey

0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
                                                                            

How you get this privkey with search in range 80 without this "0x74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3" part of  the range ?

But if you know something lile

0x88888888888888888888888888888888888888888888887..............................
0x6...
0x77777777777777777778888888888888888888888888888..............................

the problem moves to a known solution area

If you want to search range:
74189E6AC701E155D43F55A38B5D25129BE4D9481F0C3D550E604702A13BF925
to
74189E6AC701E155D43F55A38B5D25129BE4D9481F0Cxxxxxxxxxxxxxxxxxxxx
(80 bit range)
send me pubkey and I will make you an input file to search that range with pubkey.
or another range and pubkey.

[bigvito19]

it would be great to check all the public keys at once over a given range

will it be so?

Unfortunately, Jean_Luc is silent.

Everybody Vote here to Jean_Luc develop software fo search big ranges !!!! Please !!! Only Jean_Luc can help !!!!

p.s. you can check ranges from 1 to 80 and you won't be able to find any of them, because they are more than 80 (xxxyyyzzzzz................ + 80 !!!) !!!

What do you mean you can't find any keys from 1-80? 2^1 to 2^80?
It's posted on github this program only searches up to 125 bits. If you don't know the range or the known range is above 125 bits, then this program isn't for you/won't help you. Jean Luc says it's an easy mod to increase the program to search up to 256 bit range, but if you don't know the range, it's still not going to help.

Do you know the mod to increase the program to search up to 256 bit range?

[WanderingPhilospher]

Do you know the mod to increase the program to search up to 256 bit range?

negative...but Jean Luc says it has to do with the distance being stored on 126 bit so the starting position of each kangaroo must be in a 126 bit range MAX.

I imagine he could share what to tweak in the code to be able to search for larger bit range.  I haven't asked or tried because it's such a large range. Maybe if multi pubkey capability comes, I would venture out into larger ranges, but for now, just sticking to puzzle ranges.

edit: but you can shift range, if you have a specific range in mind, to use the current Kangaroo program

[Jean_Luc]

Searching on range larger than 126 bits will decrease performance a lot.
If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.

[WanderingPhilospher]

Searching on range larger than 126 bits will decrease performance a lot.
If you want to modify the code, the modification are not very difficult.
You have to change the structure and the interface in the HashTable to accept larger distance and restore 256 bit distance in the GPU code.

There you have it...the man, the myth, the coding legend has spoken.

If it takes 256 V100 Teslas roughly 45-60 days for 120 bit range search, I can't imagine how long it would take to search a 256 bit range.

I would recommend adjusting ranges or search the bottom 124 bit range of larger range. But that's just me.

If Jean Luc tells me what to adjust in the code, I will make the changes and post a 256 bit range Kangaroo program...for those who wish to have it.

[Kpot87]

Hello everyone! From which year the compressed pubkey become? 2015?