would keyhunt be used for ethereum publickey?
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
Topic: Keyhunt - development requests - bug reports - page 25. (Read 15025 times)
How do you create the bPfile?
The best way to correct it is delete you current bPfile and create it again with the correct amount.
Each item in the file is 32 bytes, but in ram it need to be processed to store ~4 bytes in bloom filter and 20 bytes in the array table.
The best way to correct it is delete you current bPfile and create it again with the correct amount.
Each item in the file is 32 bytes, but in ram it need to be processed to store ~4 bytes in bloom filter and 20 bytes in the array table.
hi,
I have a file Pfile.bin file generated for 1B points. which is almost 30GB
I get an error which states " Can't read the file seen you have fewer items that the amount needed"
does this mean I need to have 25Gb+ ram for a 30GB Pfile.bin file ?
:/mnt/d/crypto_repos/keyhunt$ ./keyhunt -m bsgs -f tests/120.txt -b 64 -k 256 -p ./Pfile.bin -t 4
I think I found the issue., the program looks for 1073741824 points in the Pfile.bin file.I have a file Pfile.bin file generated for 1B points. which is almost 30GB
I get an error which states " Can't read the file seen you have fewer items that the amount needed"
does this mean I need to have 25Gb+ ram for a 30GB Pfile.bin file ?
:/mnt/d/crypto_repos/keyhunt$ ./keyhunt -m bsgs -f tests/120.txt -b 64 -k 256 -p ./Pfile.bin -t 4
- Version 0.1.20210412 secp256k1
- Setting mode BSGS
- Min range: 8000000000000000
- Max range: 10000000000000000
- Setting k factor to 256
- Setting 4 threads
- Opening file tests/120.txt
- Added 1 points from file
- Bit Range 64
- Setting N up to 17592186044416.
- Init 1st bloom filter for 1073741824 elements : 3680.00 MB
- Init 2nd bloom filter for 53687092 elements : 184.03 MB
- Allocating 1.9 MB for 16384 aMP Points
- Precalculating 16384 aMP points
- Allocating 819.20 MB for 53687092 bP Points
- Reading 1073741824 bP points from file ./Pfile.bin
- processing 87167273/1073741824 bP points : 8%Can't read the file seen you have less items that the amount needed
The file I generated contains less than 1073741824.
I think still one question remains ie is it faster of entire Pfile.bin can be loaded to the RAM?
hi,
I have a file Pfile.bin file generated for 1B points. which is almost 30GB
I get an error which states " Can't read the file seen you have fewer items that the amount needed"
does this mean I need to have 25Gb+ ram for a 30GB Pfile.bin file ?
:/mnt/d/crypto_repos/keyhunt$ ./keyhunt -m bsgs -f tests/120.txt -b 64 -k 256 -p ./Pfile.bin -t 4
I have a file Pfile.bin file generated for 1B points. which is almost 30GB
I get an error which states " Can't read the file seen you have fewer items that the amount needed"
does this mean I need to have 25Gb+ ram for a 30GB Pfile.bin file ?
:/mnt/d/crypto_repos/keyhunt$ ./keyhunt -m bsgs -f tests/120.txt -b 64 -k 256 -p ./Pfile.bin -t 4
- Version 0.1.20210412 secp256k1
- Setting mode BSGS
- Min range: 8000000000000000
- Max range: 10000000000000000
- Setting k factor to 256
- Setting 4 threads
- Opening file tests/120.txt
- Added 1 points from file
- Bit Range 64
- Setting N up to 17592186044416.
- Init 1st bloom filter for 1073741824 elements : 3680.00 MB
- Init 2nd bloom filter for 53687092 elements : 184.03 MB
- Allocating 1.9 MB for 16384 aMP Points
- Precalculating 16384 aMP points
- Allocating 819.20 MB for 53687092 bP Points
- Reading 1073741824 bP points from file ./Pfile.bin
- processing 87167273/1073741824 bP points : 8%Can't read the file seen you have less items that the amount needed
I tested via Windows 10 and all modes work.
Code and exe files are on github.
Code and exe files are on github.
Thank you so much
I think I saw a Window's version/release but I could not relocate it so I decided to make a Window's exe and put it out publicly in case any Windows users wanted to try out this program.
I tested via Windows 10 and all modes work.
https://github.com/WanderingPhilosopher/keyhunt/releases
Code and exe files are on github.
I tested via Windows 10 and all modes work.
https://github.com/WanderingPhilosopher/keyhunt/releases
Code and exe files are on github.
Wondering one thing. In bsgs mode with a range -r is there a way to log an intermediate state of the calculus so that you can stop everything than start again from such intermediate point without losing previous computation ?
Not yet im working in that.
why zero?
Because you add 100K publickeys, that is why it take some time in update the speed counter.- Added 116697 points from file[/b]
Best regards!
why zero?
- Opening file pubkey.txt
- Added 116697 points from file
- Bit Range 132
- Setting N up to 17592186044416.
- Init 1st bloom filter for 4194304 elements : 14.00 MB
- Init 2nd bloom filter for 209716 elements : 0.72 MB
- Allocating 480.0 MB for 4194304 aMP Points
- Precalculating 4194304 aMP points
- Allocating 3.20 MB for 209716 bP Points
- processing 4194304/4194304 bP points : 100%
- Sorting 209716 elements... Done!
- Thread a357bfdba77566407e9b4e3e353a700bd
Hi there,
Successfully straightforward built on Ubuntu 16.04.7 LTS.
Wondering one thing. In bsgs mode with a range -r is there a way to log an intermediate state of the calculus so that you can stop everything than start again from such intermediate point without losing previous computation ?
Thank you
Successfully straightforward built on Ubuntu 16.04.7 LTS.
Wondering one thing. In bsgs mode with a range -r is there a way to log an intermediate state of the calculus so that you can stop everything than start again from such intermediate point without losing previous computation ?
Thank you
Hi albert0bsd,
have any progress about the program?
have any progress about the program?
Sorry there is no progress yet.
Hi WanderingPhilospher, thanks for test the program.
Keyhunt use a Bloom filter to check if the generated address or hash is on the list, this will lead in some false positive collision (Error rate is one in a million or something like that), so if the the bloom filter return a positive result, it use a second check, this is a binary search over all the address or items in the list, it can dertermine if one item is on the list perfoming only log(N)/log(2) operation, for 15 Milllions of addres this process only take 24 comparations.
This is like the hash table but i prefer keep those separated becuase there are some trick with the bloom filter that allow you use a little less ram in the case of the BSGS mode.
And no, in keyhunt there are no key drop or anything like that.
Yes you are totally right this will be changed soon.
Im working in some migration from libgmp to the secp256k1 library used in the JLP BSGS Code, i already check that librery and with some hardware and code tricks it can be 4 or 5 times more faster for publickey generations, this will boost all the modes speeds, address, rmd160, xpoint and bsgs mode in the code.
Best regards!
I can get 1 MKey/s with a list of 15 million addresses (i5-4690 running 4 threads). I am curious, does/will your Keyhunt program handle that many addresses and if so, does the Key/s drop?
Keyhunt use a Bloom filter to check if the generated address or hash is on the list, this will lead in some false positive collision (Error rate is one in a million or something like that), so if the the bloom filter return a positive result, it use a second check, this is a binary search over all the address or items in the list, it can dertermine if one item is on the list perfoming only log(N)/log(2) operation, for 15 Milllions of addres this process only take 24 comparations.
This is like the hash table but i prefer keep those separated becuase there are some trick with the bloom filter that allow you use a little less ram in the case of the BSGS mode.
And no, in keyhunt there are no key drop or anything like that.
why not read the input file of full addresses, convert them to RIPE, and then do the search on RIPE?
Yes you are totally right this will be changed soon.
Im working in some migration from libgmp to the secp256k1 library used in the JLP BSGS Code, i already check that librery and with some hardware and code tricks it can be 4 or 5 times more faster for publickey generations, this will boost all the modes speeds, address, rmd160, xpoint and bsgs mode in the code.
Best regards!
Hi albert0bsd,
have any progress about the program?
I'm just now seeing this, is this worth trying to use?
No it not worth the time or effort
Code:
./bPfile 3355443200 bPfile.bin
each bP item is 32 bytes in disk.
In RAM is about ~24 Bytes
2. A 100 GB file was created.
I don't notice any performance gain from bPfile.bin.
Code:
./keyhunt -m bsgs -f 50bit.txt -b 50 -R -k 800 -t 12
The only performance is the time to generate the bPitems in runtime or read those from disk, anything else (Final speeed) is going to be the same
Code:
./keyhunt -m bsgs -f 1-63.txt -R -t 12 -r 0000000000000001:8000000000000000 -k 800
more than 1.5 hours passed, nothing went wrong, although if you make one public key of 63 bits, it finds it quickly.
upd. Understood, it was necessary to remove the -R parameter
The mode bsgs works with each publickey individualy, this mean that 1 publickey give you some speed but 2 publickeys give you the half of that speed and so on...
It remains to understand whether the bPfile.bin file is necessary, since I did not notice any benefit from it, except for the 100GB of space on the ssd.
When people stop and rerun the program so many times the bP file is good but is you are going to let it run for months then the file is useless.
anyone wondering if this is legal, or nah... ? 
I made this program for the puzzles.
Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.
there are some tools that can do that.
Trying to make on Ubuntu(WSL)
can anyone help with the below error?
/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status
can anyone help with the below error?
/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status
Install libgmp
Trying to make on Ubuntu(WSL)
can anyone help with the below error?
gcc -O3 -c bloom/bloom.c -o bloom.o
g++ -O3 -c sha256/sha256.c -o sha256.o
gcc -O3 -c base58/base58.c -o base58.o
gcc -O3 -c rmd160/rmd160.c -o rmd160.o
gcc -O3 -c sha3/sha3.c -o sha3.o
gcc -O3 -c xxhash/xxhash.c -o xxhash.o
g++ -O3 -c util.c -o util.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Int.cpp -o Int.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Point.cpp -o Point.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/SECP256K1.cpp -o SECP256K1.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntMod.cpp -o IntMod.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Random.cpp -o Random.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntGroup.cpp -o IntGroup.o
g++ -o keyhunt keyhunt.c base58.o rmd160.o sha256.o bloom.o xxhash.o util.o Int.o Point.o SECP256K1.o IntMod.o Random.o IntGroup.o -lgmp -lm -lpthread
/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status
make: *** [Makefile:15: default] Error 1
can anyone help with the below error?
gcc -O3 -c bloom/bloom.c -o bloom.o
g++ -O3 -c sha256/sha256.c -o sha256.o
gcc -O3 -c base58/base58.c -o base58.o
gcc -O3 -c rmd160/rmd160.c -o rmd160.o
gcc -O3 -c sha3/sha3.c -o sha3.o
gcc -O3 -c xxhash/xxhash.c -o xxhash.o
g++ -O3 -c util.c -o util.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Int.cpp -o Int.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Point.cpp -o Point.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/SECP256K1.cpp -o SECP256K1.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntMod.cpp -o IntMod.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/Random.cpp -o Random.o
g++ -m64 -mssse3 -Wno-unused-result -Wno-write-strings -O2 -c secp256k1/IntGroup.cpp -o IntGroup.o
g++ -o keyhunt keyhunt.c base58.o rmd160.o sha256.o bloom.o xxhash.o util.o Int.o Point.o SECP256K1.o IntMod.o Random.o IntGroup.o -lgmp -lm -lpthread
/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status
make: *** [Makefile:15: default] Error 1
Hello guys, please help
I'm having compile errors and bugs using linux.....
Please help me someone post me a link to download keyhunt.exe file i would really be thankful!
Thank you guys!
I'm having compile errors and bugs using linux.....
Please help me someone post me a link to download keyhunt.exe file i would really be thankful!
Thank you guys!
Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.
Are you wanting to know if the program keyhunt, can add this capability? All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.
Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58dec
This can be useful for preparing a bloom filter for Brainflayer.
Ok, I hope you get lucky and get the keys for some nice wallets, like microstrategy's or tesla's, and then I wish you luck in the court 
He who owns the private key, owns the cryptocurrency and that's a fact.
Well, in this case, is 100% legal! 
Legal.
Cryptocurrency rule: Whoever has the private key is the owner.
Cryptocurrency rule: Whoever has the private key is the owner.
Jump to: