0
FFFFFFFFFFFFFF
02E9F43F810784FF1E91D8BC7C4FF06BFEE935DA71D7350734C3472FE305FEF82A
-----
I solve now this in 1:54 min !!! I happy now !!! And file size 8.4 Mb, memory on my notebook not working like shet !!!
Topic: brute-forcing public keys at amazing speed 2.2 PH/s on CPU [malware warning] - page 7. (Read 3490 times)
April 21, 2020, 05:54:30 AM
0
FFFFFFFFFFFFFF
02E9F43F810784FF1E91D8BC7C4FF06BFEE935DA71D7350734C3472FE305FEF82A
-----
I solve now this in 1:54 min !!! I happy now !!! And file size 8.4 Mb, memory on my notebook not working like shet !!!
April 21, 2020, 05:15:32 AM
May God protect you, you are a good man,Jean_Luc.👋
Biggest Thanks and Regards You Jean_Luc !!!!!!!!!!!!
Oh Yes Yes Yes Yes, Now I see exe file.
April 21, 2020, 05:08:23 AM
May God protect you, you are a good man,Jean_Luc.👋
Biggest Thanks and Regards You. Oh now I see exe file.
April 21, 2020, 04:28:38 AM
https://github.com/JeanLucPons/Kangaroo/releases
You see it ? for me it seems ok.
You see it ? for me it seems ok.
April 21, 2020, 04:22:19 AM
Jean_Luc, Anybodey can you make a exe file for windows ?
I re added it. Strangely github removed it ?!!!
I was seen only sorces for Kongaroo, in github witout exe. 😩
Please reupload exe for Kangaroo to github, Jean_Luc ?
Biiiiiig thank you !!!
April 21, 2020, 04:20:35 AM
Jean_Luc, Anybodey can you make a exe file for windows ?
I re added it. Strangely github removed it ?!!!
April 21, 2020, 04:18:49 AM
The Pollard's kangaroo has solved the 16 64bit keys in 3:07:38, so a bit faster than BSGS (03:35:53) and with a lot less memory.
https://github.com/JeanLucPons/Kangaroo/blob/master/README.md
I will definitely add a GPU support for it.
https://github.com/JeanLucPons/Kangaroo/blob/master/README.md
I will definitely add a GPU support for it.
April 21, 2020, 04:15:52 AM
Quote from: Jean_Luc link=topic=5238719.msg54267073#msg54267073
Jean_Luc, Anybodey can you make a exe file for windows ?
My intel i5 without CUDA, and my manipulation with memory cash, arh, radyboosters etc. unsuccesful for me. I hope Kangoro will work for me more succesful
Pleeeease.
Br.
April 21, 2020, 02:36:40 AM
Jean_Luc also made the vanity search program, and some guy modified it to work with pollard kangaroo method. The code is here: https://github.com/alek76-2/vs-kangaroo-hybrid
I beleive that this program should be faster. It uses GPU, not CPU. Of course it is not good to compare CPU and GPU, GPU will always be ahead.
I beleive that this program should be faster. It uses GPU, not CPU. Of course it is not good to compare CPU and GPU, GPU will always be ahead.
Just curious, I wrote a simple Kangaroo program, I didn't test the alek's one because I have a look in his code and see that basic optimizations (at least for CPU) are missed. Especially line 625 of Vanity.cpp
Code:
ph->Kp = secp->AddAffine(ph->Kp, Sp[pw]); // This requires a modular inversion which can be batched
I published the code here: https://github.com/JeanLucPons/Kangaroo
A comparison between BSGS and Kangaroo, (64bit search, on my old Xeon) :
Kangaroo should end in 2^33 iterations (in average). I reached 18.18 MKey/s (here the DP method can be applied to speed up the hashtable and decrease drastically the needed memory, this method can be efficiently implemented on GPU).
Code:
Kangaroo v1.0
Start:49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E0000000000000000
Stop :49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5EFFFFFFFFFFFFFFFF
Keys :16
Number of CPU thread: 8
Range width: 2^64
Number of random walk: 2^13.00 (Max DP=17)
DP size: 17 [0xffff800000000000]
Solvekey Thread 0: 1024 TAME kangaroos
Solvekey Thread 1: 1024 TAME kangaroos
Solvekey Thread 2: 1024 TAME kangaroos
Solvekey Thread 3: 1024 TAME kangaroos
Solvekey Thread 4: 1024 WILD kangaroos
Solvekey Thread 5: 1024 WILD kangaroos
Solvekey Thread 6: 1024 WILD kangaroos
Solvekey Thread 7: 1024 WILD kangaroos
[18.00 MKey/s][Count 2^34.40][20:47][Dead 10][20.2MB]
Key# 0 Pub: 0x0259A3BFDAD718C9D3FAC7C187F1139F0815AC5D923910D516E186AFDA28B221DC
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5EBB3EF3883C1866D4
[18.18 MKey/s][Count 2^33.80][13:44][Dead 3][15.4MB]
Key# 1 Pub: 0x02A50FBBB20757CC0E9C41C49DD9DF261646EE7936272F3F68C740C9DA50D42BCD
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5EB5ABC43BEBAD3207
[18.07 MKey/s][Count 2^30.28][01:12][Dead 1][2.8MB]
Key# 2 Pub: 0x0304A49211C0FE07C9F7C94695996F8826E09545375A3CF9677F2D780A3EB70DE3
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E5698AAAB6CAC52B3
[18.18 MKey/s][Count 2^32.78][06:44][Dead 2][9.4MB]
Key# 3 Pub: 0x030B39E3F26AF294502A5BE708BB87AEDD9F895868011E60C1D2ABFCA202CD7A4D
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E59C839258C2AD7A0
[18.18 MKey/s][Count 2^33.82][13:54][Dead 3][15.6MB]
Key# 4 Pub: 0x02837A31977A73A630C436E680915934A58B8C76EB9B57A42C3C717689BE8C0493
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E765FB411E63B92B9
[18.18 MKey/s][Count 2^33.07][08:16][Dead 1][10.9MB]
Key# 5 Pub: 0x020ECDB6359D41D2FD37628C718DDA9BE30E65801A88A00C3C5BDF36E7EE6ADBBA
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E7D0E6081C7E0E865
[18.18 MKey/s][Count 2^34.45][21:27][Dead 4][20.7MB]
Key# 6 Pub: 0x0322DD52FCFA3A4384F0AFF199D019E481D335923D8C00BADAD42FFFC80AF8FCF0
Priv: 0x49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5EC737344CA673CE28
I'll post the full result for the 16 keys on github when ended.
April 20, 2020, 04:01:50 AM
core i7 3770 8 RAM 28 mins
28 min per key with 8Gb RAM ?
I try fined key from in.txt of reliase. Speed down to 0.01Mkey per second. Give me please examples what you use ? My ex is to hard for me.
BabyStep:0x20000000
Start:49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E0000000000000000
Stop :49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5EFFFFFFFFFFFFFFFF
Keys :1
This config is down on my i5 with 8Gb !!!😠
Thenx
Code:
root@system:~# ./bsgs in.txt
BSGS v1.0
BabyStep:0x20000000 (2^29.00)
Start:10000000000000000
Stop :1FFFFFFFFFFFFFFFF
Keys :1
Number of CPU thread: 8
BabyStep Thread 0: 0x1 -> 0x4000000
BabyStep Thread 1: 0x4000001 -> 0x8000000
BabyStep Thread 3: 0xc000001 -> 0x10000000
BabyStep Thread 2: 0x8000001 -> 0xc000000
BabyStep Thread 4: 0x10000001 -> 0x14000000
BabyStep Thread 6: 0x18000001 -> 0x1c000000
BabyStep Thread 5: 0x14000001 -> 0x18000000
BabyStep Thread 7: 0x1c000001 -> 0x20000000
[2.42 MKey/s][Cnt 2^29.00][03:33][4864.0MB]
Sort Thread 3: 00C00000 -> 01000000
Sort Thread 0: 00000000 -> 00400000
Sort Thread 4: 01000000 -> 01400000
Sort Thread 2: 00800000 -> 00C00000
Sort Thread 1: 00400000 -> 00800000
Sort Thread 5: 01400000 -> 01800000
Sort Thread 7: 01C00000 -> 02000000
Sort Thread 6: 01800000 -> 01C00000
[10.64 MSort/s][Cnt 2^25.00][03s][4864.0MB]
GiantStep Thread 3: 16000000000000000
GiantStep Thread 2: 14000000000000000
GiantStep Thread 0: 10000000000000000
GiantStep Thread 1: 12000000000000000
GiantStep Thread 5: 1A000000000000000
GiantStep Thread 6: 1C000000000000000
GiantStep Thread 4: 18000000000000000
GiantStep Thread 7: 1E000000000000000
[13.72 MKey/s][Cnt 2^33.03][10:40][4864.0MB]
Key# 0 Pub: 0x0230210C23B1A047BC9BDBB13448E67DEDDC108946DE6DE639BCC75D47C0216B1B
Priv: 0x1A838B13505B26867
Done: Total time 14:18
in.txt
Code:
20000000
0000000000000000000000000000000000000000000000010000000000000000
000000000000000000000000000000000000000000000001FFFFFFFFFFFFFFFF
0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
https://imgur.com/gItX4Uh
April 19, 2020, 03:42:13 PM
core i7 3770 8 RAM 28 mins
28 min per key with 8Gb RAM ?
I try fined key from in.txt of reliase. Speed down to 0.01Mkey per second. Give me please examples what you use ? My ex is to hard for me.
BabyStep:0x20000000
Start:49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5E0000000000000000
Stop :49DCCFD96DC5DF56487436F5A1B18C4F5D34F65DDB48CB5EFFFFFFFFFFFFFFFF
Keys :1
This config is down on my i5 with 8Gb !!!😠
Thenx
April 19, 2020, 03:01:10 PM
core i7 3770 8 RAM 28 mins
28 min per key with 8Gb RAM ?
April 19, 2020, 01:59:10 PM
I published an exe file for Windows:
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
Hello respected Jean !!!
Then Lanch release on my 8 Gb memory PC, after memory was full used in release code, sped of working down to 0- zero. Can you please modyfy code for fine wlrking on PC with smole memory then 12 Gb.
-snip-
Etar already answered. I can confirm the same.
Just use the smaller baby step table. It is the 1st line in in.txt file. By default it is 40000000 in hex format (2^30), and it requitres approx. 9Gb RAM.
For your 8Gb memory you can use 20000000 (2^29), and in total you will need approx. 1 hour to find the private key for 64bit key. Jean tested with 12Gb RAM and 2^30 baby step and had approx 13 minutes. You will have 1 hour with your 8Gb RAM.
Just test, and say the result if 1 hour prediction was correct.
core i7 3770 8 RAM 28 mins
April 19, 2020, 08:10:51 AM
Is any method for add Windos ReadyBost to Release ? I was tern up readyboost but release code not used them. Have someone sny ideas ?
April 19, 2020, 06:47:38 AM
I published an exe file for Windows:
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
Hello respected Jean !!!
Then Lanch release on my 8 Gb memory PC, after memory was full used in release code, sped of working down to 0- zero. Can you please modyfy code for fine wlrking on PC with smole memory then 12 Gb.
-snip-
Etar already answered. I can confirm the same.
Just use the smaller baby step table. It is the 1st line in in.txt file. By default it is 40000000 in hex format (2^30), and it requitres approx. 9Gb RAM.
For your 8Gb memory you can use 20000000 (2^29), and in total you will need approx. 1 hour to find the private key for 64bit key. Jean tested with 12Gb RAM and 2^30 baby step and had approx 13 minutes. You will have 1 hour with your 8Gb RAM.
Just test, and say the result if 1 hour prediction was correct.
Big thanx all members for yours answers.
I will test today in the evening and show me results. I hope my PC without CUDA will can do something.
Again - big thanx to all.
April 19, 2020, 06:28:07 AM
I published an exe file for Windows:
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
Hello respected Jean !!!
Then Lanch release on my 8 Gb memory PC, after memory was full used in release code, sped of working down to 0- zero. Can you please modyfy code for fine wlrking on PC with smole memory then 12 Gb.
-snip-
Etar already answered. I can confirm the same.
Just use the smaller baby step table. It is the 1st line in in.txt file. By default it is 40000000 in hex format (2^30), and it requitres approx. 9Gb RAM.
For your 8Gb memory you can use 20000000 (2^29), and in total you will need approx. 1 hour to find the private key for 64bit key. Jean tested with 12Gb RAM and 2^30 baby step and had approx 13 minutes. You will have 1 hour with your 8Gb RAM.
Just test, and say the result if 1 hour prediction was correct.
April 19, 2020, 06:22:05 AM
-snip-
Thanks a lot for release.
Thanks a lot for release.
Have you tested this release on your config? How is the progress compared with your code?
Because have big base hashrate. I mean for ex. base hashrate for i7 3770 is 14Mkey/s. I can`t get this speed on my program because i use simple language where big integer calculations used 3ty part library. In that case i have low base hashrate due to convertion for integers.
Jean_Luc also made the vanity search program, and some guy modified it to work with pollard kangaroo method. The code is here: https://github.com/alek76-2/vs-kangaroo-hybrid
I beleive that this program should be faster. It uses GPU, not CPU. Of course it is not good to compare CPU and GPU, GPU will always be ahead.
Also for proper work of BSGS method the RAM is required; the more - the better.
April 19, 2020, 04:30:02 AM
how using address
0xaCe76f61460Bf1078b43bc0a343725d9898f0F48
and private key
f949ea6e8368d5717eecca584ac924efdd427910d6f6abbf1bd7f2c0b7748814
withdraw their coins there for $ 429
Good day members !!!0xaCe76f61460Bf1078b43bc0a343725d9898f0F48
and private key
f949ea6e8368d5717eecca584ac924efdd427910d6f6abbf1bd7f2c0b7748814
withdraw their coins there for $ 429
This is a ETH adress ? Only 0.5$ there not 429...
?
April 19, 2020, 05:08:34 AM
I published an exe file for Windows:
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
https://github.com/JeanLucPons/BSGS/releases/tag/1.0
To solve a 110bit puzzle, on my config, it would take a very very long time, ~4 billions years !
Hello respected Jean !!!
Then Lanch release on my 8 Gb memory PC, after memory was full used in release code, sped of working down to 0- zero. Can you please modyfy code for fine wlrking on PC with smole memory then 12 Gb.
?
Thanks
by default baby step = 2^30 = 40000000 in hex format
you can use for ex. 2^28 = 10000000 in hex
each step used 64bit of memory, so 2^28 need only 2Gb
2^29 around 4Gb
Decrease the baby step counter will proportionally increase the brute force time.
April 19, 2020, 03:58:40 AM
how using address
0xaCe76f61460Bf1078b43bc0a343725d9898f0F48
and private key
f949ea6e8368d5717eecca584ac924efdd427910d6f6abbf1bd7f2c0b7748814
withdraw their coins there for $ 429
0xaCe76f61460Bf1078b43bc0a343725d9898f0F48
and private key
f949ea6e8368d5717eecca584ac924efdd427910d6f6abbf1bd7f2c0b7748814
withdraw their coins there for $ 429
Jump to: