Thanks now ok quiet option already
turn off display make program work fast that show it display
other program is same turn off is make it work faster
and What mean keys, it is mean 1 private key or 1 key character
Total 2163563847226549600256 keys in 69000 seconds: 31355997785892023 keys/s
Total 2164516112257133838336 keys in 69030 seconds: 31356165612880397 keys/s
Total 2165465615314509103104 keys in 69060 seconds: 31356293300239054 keys/s
Total 2166412549912721883136 keys in 69090 seconds: 31356383701153884 keys/s
Total 2167356300325260623872 keys in 69120 seconds: 31356427956094627 keys/s
Total 2168303551582822203392 keys in 69150 seconds: 31356522799462360 keys/s
Total 2169249254728011874304 keys in 69180 seconds: 31356595182538477 keys/s
Total 2170192670889015771136 keys in 69210 seconds: 31356634458734514 keys/s
Topic: Keyhunt - development requests - bug reports - page 23. (Read 11571 times)
is it available as working to test sir.?
Most of those test version doesn't work (those are crazy ideas), The only version available is the the github version.
Ok,
Sorry, I got how to turn off display message from help
Sorry, I got how to turn off display message from help
Code:
-q set quiet the thread output
add -q to your command line.
Best regards!
Ok,
Sorry, I got how to turn off display message from help
Usage:
-h show this help
-a file file is a binary raw file with the aMP points precalculated. Just work with -m bsgs
-b bits For some puzzles you only need some numbers of bits in the test keys.
This option only is valid with the Random option -R
-c crypto Search for specific crypo. < btc, eth, all > valid only w/ -m address
eth option is under develop sorry
-e The file is already Sorted descendent. This skip the sorting process.
Your file MUST be sordted if no you are going to lose collisions
-f file Specify filename with addresses or xpoints or uncompressed public keys
-g count Just for the stats, mark as counted every debugcount keys
-k value Use this with bsgs mode, k value is factor for M, more speed but more RAM use wisely
-m mode mode of search for cryptos. < address, xpoint, bsgs > default: address (more slow)
-n uptoN Check for N secuential numbers before the random chossen this only work with -R option
Use -n to set the N for the BSGS process. Bigger N more RAM needed
-p file file is a binary raw file with the bP points precalculated. Just work with -m bsgs
-q set quiet the thread output
-r SR:EN StarRange:EndRange, the end range can be omited for search from start range to N-1 ECC value
-R Random/Secuential this is the default behaivor, can't use this with range option -r
-s ns Number of seconds for the stats output, 0 to omit output.
-t tn Threads number, must be positive integer
-v va Search for vanity Address, only with -m address
-w Mark the input file as RAW data xpoint fixed 32 byte each point. Valid only with -m xpoint
Use the hexcharstoraw tool to create a raw file from your current hexadecimal file
Example
keyhunt -t 16 -r 00000001:FFFFFFFF -s 0
This line run the program with 16 threads from the range 00000001 to FFFFFFFF without stats output
Developed by AlbertoBSD Tips BTC: 1ABSD1rMTmNZHJrJP8AJhDNG1XbQjWcRz7
Thanks to Iceland always helping and sharing his ideas, Tips to Iceland: bc1q39meky2mn5qjq704zz0nnkl0v7kj4uz6r529at
Sorry, I got how to turn off display message from help
- Version 0.1.20210306 K*BSGS
Usage:
-h show this help
-a file file is a binary raw file with the aMP points precalculated. Just work with -m bsgs
-b bits For some puzzles you only need some numbers of bits in the test keys.
This option only is valid with the Random option -R
-c crypto Search for specific crypo. < btc, eth, all > valid only w/ -m address
eth option is under develop sorry
-e The file is already Sorted descendent. This skip the sorting process.
Your file MUST be sordted if no you are going to lose collisions
-f file Specify filename with addresses or xpoints or uncompressed public keys
-g count Just for the stats, mark as counted every debugcount keys
-k value Use this with bsgs mode, k value is factor for M, more speed but more RAM use wisely
-m mode mode of search for cryptos. < address, xpoint, bsgs > default: address (more slow)
-n uptoN Check for N secuential numbers before the random chossen this only work with -R option
Use -n to set the N for the BSGS process. Bigger N more RAM needed
-p file file is a binary raw file with the bP points precalculated. Just work with -m bsgs
-q set quiet the thread output
-r SR:EN StarRange:EndRange, the end range can be omited for search from start range to N-1 ECC value
-R Random/Secuential this is the default behaivor, can't use this with range option -r
-s ns Number of seconds for the stats output, 0 to omit output.
-t tn Threads number, must be positive integer
-v va Search for vanity Address, only with -m address
-w Mark the input file as RAW data xpoint fixed 32 byte each point. Valid only with -m xpoint
Use the hexcharstoraw tool to create a raw file from your current hexadecimal file
Example
keyhunt -t 16 -r 00000001:FFFFFFFF -s 0
This line run the program with 16 threads from the range 00000001 to FFFFFFFF without stats output
Developed by AlbertoBSD Tips BTC: 1ABSD1rMTmNZHJrJP8AJhDNG1XbQjWcRz7
Thanks to Iceland always helping and sharing his ideas, Tips to Iceland: bc1q39meky2mn5qjq704zz0nnkl0v7kj4uz6r529at
- Opening file addresses.txt
Require sample file addresses.txt (just for new user not yet to know)
Can possible I turn off this line message, if can possible have option for hide this display?
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d706fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d716fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d726fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d736fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d746fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d756fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d766fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d776fdd24ed0a6
- Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d786fdd24ed0a6
this display over 10000 message
just try BSGS version
if anyone use keyhunt and compile mission gmp.h
try install libgmp3-dev
Code:
apt-get install libgmp3-dev
Recommend to put sample address.txt and 120.txt setting puzzle 120 to github for easy copy setting
because first time I found Invalid length
Im testing.
Your first BSGS version (the one before bpfile) got few core dumps.
Actual version works great (tested with one pub and multi pub).
Waiting for new updates for tests
Your first BSGS version (the one before bpfile) got few core dumps.
Actual version works great (tested with one pub and multi pub).
Waiting for new updates for tests
hi albert0bsd, great pieces you got, thanks for giving, but hey was wondering,
I'm working in some other approach and trying to get a better performance but is still a work in development.
Best regards!
is it available as working to test sir.?
Work on windows?
I'm working in some other approach and trying to get a better performance but is still a work in development.
Best regards!
is it available as working to test sir.?
Work on windows?
Only with the Ubuntu shell for windows, or maybe some cgywin enviroment.
Yes speed is a little slow, but is CPU and RAM only, i can get the double of that speed wit the double of threads and RAM but my server is running some other things.
I can reach to some 2 Petaleys/s and some other friends with highend servers can reach more that 10 Petakeys/s.
I'm working in some other approach and trying to get a better performance but is still a work in development.
Best regards!
Work on windows?
Without running it, just from the speed you say, seems a little bit slower than what is already out there.
But I like to learn different programs in different languages.
And you say speed will be huge with higher RAM
I can run through 72,057,594,037,927,935 keys in less than 2 minutes, that is start to finish. And that is using only 1.8Gb of RAM.
I am most interested in how you will setup network/pool version as I have been wanting this for the version I use for some time now. When you start development, let me know and I can share some ideas.
Without running it, just from the speed you say, seems a little bit slower than what is already out there.
But I like to learn different programs in different languages.
And you say speed will be huge with higher RAM
Quote
maybe some hour depent of your speed.
so are you factoring that in to the total time?I can run through 72,057,594,037,927,935 keys in less than 2 minutes, that is start to finish. And that is using only 1.8Gb of RAM.
I am most interested in how you will setup network/pool version as I have been wanting this for the version I use for some time now. When you start development, let me know and I can share some ideas.
you can use the bPfile.c to generate your .bin file ( this is the baby step table)
This process can take some time, please be patient, maybe some hour depent of your speed.
Once that the file is already created, execute:
-k 250 is new factor of speed, 250 use some more of 17 GB of RAM.
But the speed will be huge:
864 Terakeys/s
Best regards!
Code:
./bPfile 1048576000 Pfile.bin
[+] precalculating 1048576000 bP elements in file Pfile.bin
This process can take some time, please be patient, maybe some hour depent of your speed.
Once that the file is already created, execute:
Code:
albertobsd $ ./keyhunt -m bsgs -f 120.txt -r 800000000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF -t 4 -k 250 -R -p ./bPfile.bin
[+] Version 0.1.20210306 K*BSGS
[+] Setting mode BSGS
[+] Setting 4 threads
[+] Setting k factor to 250
[+] Setting random mode.
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Setting N up to 17593008128000.
[+] Init bloom filter for 1048576000 elements : 1797.00 MB
[+] Allocating 0.00 MB for aMP Points
[+] Precalculating 16778 aMP points
[+] Allocating 16000.00 MB for bP Points
[+] Reading 1048576000 bP points from file ./bPfile.bin
-k 250 is new factor of speed, 250 use some more of 17 GB of RAM.
But the speed will be huge:
Quote
Total 155574970875904000 keys in 180 seconds: 864305393755022 keys/s
864 Terakeys/s
Best regards!
Hi nice one !
How to use pfile?
How to use pfile?
I want to open this thread to talk about the tool that i develop Keyhunt available on github.
https://github.com/albertobsd/keyhunt
Keyhunt use the BSGS algorimth to find privatekeys with the publickey, the program runs on CPU and make several use of RAM to boost the speed.
To try to find the privatekey from the 120 puzzle you need to add this publickey "uncompress" to a txt file:
How to use
120.txt
you can run the tool agains that file:
output
Speed: 1 Terakeys/s
Well in that example (same in github) we can reach 1Terakeys/s with one thread.
Wan to more speed? use the "-k value" param to boots the speed
Output:
Speed: ~23 Terekeys/s
Tips
Do you still want to more speed? Well Use more RAM, the -k 128 will use some 2.5 GB of RAM
This file will take some minutes for the value -k 128, but the speed worth it!
Output:
Speed: ~146 Terakeys/s one single thread
OK at this point maybe you want to use ALL your RAM memory to solve the puzzle 120, just a bigger -k value
I already tested it with some 24 GB used with -k 1024 and I get 1.16 Petakeys/s per thread.
Using the same configuration with 4 threads I get 4.5 Petakeys/s total
Image:
FAQ
Q: Why the Progress is not displayed?
R: The speed depent of the number of target publickeys if you load 1000 publickeys, it will take some more time, the speed is only displayed when at least one thread finish one of his cycles
Q: Can we faster this code with Gpu?
R: Well yes, but the BSGS algo use RAM, only high end video cards have a lot of RAM, for GPU is better to use Kangaroo
Q: How long will take the scan the 120 bit range?
R: Human brain usually can't handle big numbers, the 120 bit space have 664613997892457936451903530140172287 (six hundred sixty four decillion...) and we speed is about 1000000000000 (one trillion or one terakey/s) the spected time acording with your speed is:
Q: Why should i keep using brute force tools?
R: You should not, but people hope in luck.
Q: Is avaible for Windows?
R: Natively no, but you can install the ubuntu shell for windows and compile it from there
Q: It have dependencies?
R: Just libgmp for BigIntegers install it with
Q: Why your program use alot of RAM?
R: Actuallly i keep in RAM two things (Bloomfilter and a Full bPTable ) im working in one way to remove or reduce the bPTable.
Nexts releases
Best regards!
https://github.com/albertobsd/keyhunt
Keyhunt use the BSGS algorimth to find privatekeys with the publickey, the program runs on CPU and make several use of RAM to boost the speed.
To try to find the privatekey from the 120 puzzle you need to add this publickey "uncompress" to a txt file:
How to use
- Add the publickey to a file
120.txt
Code:
02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630
you can run the tool agains that file:
Code:
./keyhunt -m bsgs -f 120.txt -b 120 -R
output
Code:
[+] Version 0.1.20210321 K*BSGS
[+] Setting mode BSGS
[+] Min range: 800000000000000000000000000000
[+] Max range: ffffffffffffffffffffffffffffff
[+] Setting random mode.
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Bit Range 120
[+] Setting N up to 17592186044416.
[+] Init 1st bloom filter for 4194304 elements : 14.00 MB
[+] Init 2nd bloom filter for 209716 elements : 0.00 MB
[+] Allocating 128.0 MB for 4194304 aMP Points
[+] Precalculating 4194304 aMP points
[+] Allocating 3.00 MB for 209716 bP Points
[+] precalculating 4194304 bP points
[+] Sorting 209716 elements
[+] Thread 0: 000000000000000000000000000000000092dd2b47cff81ad94120bf853ef87f
[+] Thread 0: 0000000000000000000000000000000000f7fe7fccb98e136a97c2fa9d41de7b
[+] Thread 0: 00000000000000000000000000000000008d4882d7f596851a73ae35543c4dcd
Total 35184372088832 keys in 30 seconds: 1172812402961 keys/s
[+] Thread 0: 00000000000000000000000000000000009e80f97d3e3ff0fddbdcf02894e41d
^C
Speed: 1 Terakeys/s
Well in that example (same in github) we can reach 1Terakeys/s with one thread.
Wan to more speed? use the "-k value" param to boots the speed
Code:
./keyhunt -m bsgs -f 120.txt -b 120 -R -k 20
Output:
Code:
[+] Version 0.1.20210321 K*BSGS
[+] Setting mode BSGS
[+] Min range: 800000000000000000000000000000
[+] Max range: ffffffffffffffffffffffffffffff
[+] Setting random mode.
[+] Setting k factor to 20
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Bit Range 120
[+] Setting N up to 17592253153280.
[+] Init 1st bloom filter for 83886080 elements : 287.00 MB
[+] Init 2nd bloom filter for 4194304 elements : 14.00 MB
[+] Allocating 6.0 MB for 209716 aMP Points
[+] Precalculating 209716 aMP points
[+] Allocating 64.00 MB for 4194304 bP Points
[+] precalculating 83886080 bP points
[+] Sorting 4194304 elements
(Thread output omited....)
Total 703690126131200 keys in 30 seconds: 23456337537706 keys/s
(More thread output omited....)
Total 2814760504524800 keys in 120 seconds: 23456337537706 keys/s
Speed: ~23 Terekeys/s
Tips
- you can quiet the thread output with -q
- you can load the precalcutalted bPtable -p yourfile.bin
Do you still want to more speed? Well Use more RAM, the -k 128 will use some 2.5 GB of RAM
This file will take some minutes for the value -k 128, but the speed worth it!
Code:
./keyhunt -m bsgs -f 120.txt -b 120 -R -k 128 -p ./bPfile.bin
Output:
Code:
[+] Version 0.1.20210321 K*BSGS
[+] Setting mode BSGS
[+] Min range: 800000000000000000000000000000
[+] Max range: ffffffffffffffffffffffffffffff
[+] Setting random mode.
[+] Setting k factor to 128
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Bit Range 120
[+] Setting N up to 17592186044416.
[+] Init 1st bloom filter for 536870912 elements : 1840.00 MB
[+] Init 2nd bloom filter for 26843546 elements : 92.00 MB
[+] Allocating 1.0 MB for 32768 aMP Points
[+] Precalculating 32768 aMP points
[+] Allocating 409.00 MB for 26843546 bP Points
[+] Reading 536870912 bP points from file ./bPfile.bin
[+] Sorting 26843546 elements
(Thread output omited....)
Total 4345269952970752 keys in 30 seconds: 144842331765691 keys/s
(More thread output omited....)
Total 17539409486282752 keys in 120 seconds: 146161745719022 keys/s
Speed: ~146 Terakeys/s one single thread
OK at this point maybe you want to use ALL your RAM memory to solve the puzzle 120, just a bigger -k value
I already tested it with some 24 GB used with -k 1024 and I get 1.16 Petakeys/s per thread.
Using the same configuration with 4 threads I get 4.5 Petakeys/s total
Image:
FAQ
Q: Why the Progress is not displayed?
R: The speed depent of the number of target publickeys if you load 1000 publickeys, it will take some more time, the speed is only displayed when at least one thread finish one of his cycles
Q: Can we faster this code with Gpu?
R: Well yes, but the BSGS algo use RAM, only high end video cards have a lot of RAM, for GPU is better to use Kangaroo
Q: How long will take the scan the 120 bit range?
R: Human brain usually can't handle big numbers, the 120 bit space have 664613997892457936451903530140172287 (six hundred sixty four decillion...) and we speed is about 1000000000000 (one trillion or one terakey/s) the spected time acording with your speed is:
Code:
Puzzle 120 @ 1 Terakeys/s : 21074771622667996 years
Puzzle 120 @ 1 Petakeys/s : 21074771622667 years
Q: Why should i keep using brute force tools?
R: You should not, but people hope in luck.
Q: Is avaible for Windows?
R: Natively no, but you can install the ubuntu shell for windows and compile it from there
Q: It have dependencies?
R: Just libgmp for BigIntegers install it with
Code:
apt-get install libgmp3-dev
Q: Why your program use alot of RAM?
R: Actuallly i keep in RAM two things (Bloomfilter and a Full bPTable ) im working in one way to remove or reduce the bPTable.
Nexts releases
BSGS with K factorRelease in 6/March- Network/Pool versión
- Pollard rho
Best regards!
Jump to: