Topic: Pollard's kangaroo ECDLP solver - page 85. (Read 60189 times)

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

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?

yes buddy please make that one thanks ahead.

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.

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

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

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.

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.

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.

Time to refresh the discussion  
Edit:i was wrong.

Kangaroo argument -wsplit save hashtable to file and reset hashtable

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.

what key you find?

As for me DP not so simple. Then I crack 64 bytes with DP 20, key was not be found, and with dp 16 key was found. This on 2080ti.

wow great thanks a lot for that information. guess needed it a lot.
now i can continue, now it works. great pieces. your's and brichard's work.
good luck

bitcrack generate public keys and convert each pub key to address then just compare this address with main and pow.
So you didn`t spent time to find pow address. It is the same like you start walk from the beginning of the street before you find house number 10(main address) you first find house number 6(pow address)
There no verbose option, each connection of client to server you can see in server console(ask job, submit, etc). Or you mean that you not see anything in client console?
In client console you should see that the work recieved(params of this work) and information that bitcrack started.(Your GPU will be buzzy during solving job)
About -dp, dp you need set dependency of your gpu power. -dp 20 mean devide range into 2^20 subranges. For pazzle #64  2^64/2^20=2^43 each subrange. 2080ti can calculate 2^30.3key/s so subrange 2^43 2080ti can done in 2.5h. More dp = more subranges = more quick will be solved subrange. Don`t forget that server have timeout 24h for job done. If your subrange will be to big and gpu can not done this job in 24 then job will be deleted and you just waste of your time.
For me for #64 best choice set DP between 19-21 for hi-end GPU and 22..24 for low-end GPU.
And before using client app make clear test and launch bitcrack directly.. find best params -t,-b,-p for your GPU and after that use this params in client app.

ok took some time, but i get it now, random no problemo, its on the same road, ok thanks for the answer, what if i dont want to solve those random address takes time to solve them?.
just the 64th puzzle how you start like wich -dp  and is dp21 to high?
Etar and one more question, it sits at 21.00 start time, for over a day, without showing anything, is there a verbose option or more details while this waiting happens, thanks

sorry i didn't inderstand what you say

Edited:
Show me private key first. If you do it, we are talk after. Ok ?

how did you know the range is not large and how did you find this public key ? i can help if you give me more information about this