Topic: Keyhunt - development requests - bug reports - page 24. (Read 14735 times)
Did you observer any increase in memory usage with a new version?
I have a question about the operating mode -M matrix screen
It increases the chances of winning in random mode?
It increases the chances of winning in random mode?
That options just a test, is to show the full output line by line.
And no it doen't increment anything in chances.
I add that option -M just because some users need to see the program "working" if they don't see lines running out the screen it they think that the program is stuck or freeze.
I do not understand why the creation Bloom filter, became very slow almost 10 times slower.
I used the -S key and -M.
as I understand the key -S Bloom filter is created on disk/ from here creation Bloom filter the speed drops
The previous version of the program directly created bloom in RAM
And now it’s impossible?
I used the -S key and -M.
as I understand the key -S Bloom filter is created on disk/ from here creation Bloom filter the speed drops
The previous version of the program directly created bloom in RAM
And now it’s impossible?
Yes that is a bug, i already correct it, i will update the github repository today.
small calculation of how much RAM is needed to solve 120 puzzles
-n 0x100000000000000000000000000000 -k 1
Bloom filter for 288230376151711744 elements = 1.21755226 exabytes ram
if
Bloom filter for 13967032320 elements = 59.5GB
if I didn't mess anything up
-n 0x100000000000000000000000000000 -k 1
Bloom filter for 288230376151711744 elements = 1.21755226 exabytes ram
if
Bloom filter for 13967032320 elements = 59.5GB
if I didn't mess anything up
Seems tha the calculation is correct. That is why that puzzle is not solved yet. We all try it by our selfs just hopping for luck.
By the way i made some videos about keyhunt:
keyhunt - Why the program show 0 keys/s?
Keyhunt Solving the 63 bit puzzle, just testing
Regards!
small calculation of how much RAM is needed to solve 120 puzzles
-n 0x100000000000000000000000000000 -k 1
Bloom filter for 288230376151711744 elements = 1.21755226 exabytes ram
if
Bloom filter for 13967032320 elements = 59.5GB
if I didn't mess anything up
-n 0x100000000000000000000000000000 -k 1
Bloom filter for 288230376151711744 elements = 1.21755226 exabytes ram
if
Bloom filter for 13967032320 elements = 59.5GB
if I didn't mess anything up
I have a question about the operating mode -M matrix screen
It increases the chances of winning in random mode?
this seems to be a bug because I can't see the speed counter in -M mode
constantly jumps to the next line
I do not understand why the creation Bloom filter, became very slow almost 10 times slower.
I used the -S key and -M.
as I understand the key -S Bloom filter is created on disk/ from here creation Bloom filter the speed drops
The previous version of the program directly created bloom in RAM
And now it’s impossible?
It increases the chances of winning in random mode?
this seems to be a bug because I can't see the speed counter in -M mode
constantly jumps to the next line
Quote
./keyhunt -m rmd160 -f tests/64.rmd -l compress -s 10 -b 64 -R -t 24 -M
Quote
Base key: b446a02fd6f5381f
Base key: cae8a89843ee4ee8
Base key: 82fc18d395467fd4
Base key: cae8a89843ee4ee8
Base key: 82fc18d395467fd4
I do not understand why the creation Bloom filter, became very slow almost 10 times slower.
I used the -S key and -M.
as I understand the key -S Bloom filter is created on disk/ from here creation Bloom filter the speed drops
The previous version of the program directly created bloom in RAM
And now it’s impossible?
For 32gb ddr3 k = 
maybe -k 2048, you need to test.
can you please tell what is the optimal value of n and K for 256GB RAM?
I don't know maybe you need to test with -n 0x400000000000000 and some values some values of K upto fill all the memory. The program tell you more of less how much mamoery is going to need, so test one value and press ctrl C if you that it doesn't fill your RAM
Hi albert0bsd,
have any progress about the program?
have any progress about the program?
Sorry there is no progress yet.
Thanks for the updated Beta version. It looks amazing.
can you please tell what is the optimal value of n and K for 256GB RAM?
thanks.
For 32gb ddr3 k =
would keyhunt be used for ethereum publickey?
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
Do you have the pubkey? If not, but you had outgoing transactions, I or you could find the pubkey. Having the pubkey greatly reduces search time. You can use a variety of programs to help find your private key, especially with public key.I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
so keyhunt can be used for ethereum,only if i have publickey.
Who is sb and how did they steal your eth?
would keyhunt be used for ethereum publickey?
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
Do you have the pubkey? If not, but you had outgoing transactions, I or you could find the pubkey. Having the pubkey greatly reduces search time. You can use a variety of programs to help find your private key, especially with public key.I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
so keyhunt can be used for ethereum,only if i have publickey.
Who is sb and how did they steal your eth?
would keyhunt be used for ethereum publickey?
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
Do you have the pubkey? If not, but you had outgoing transactions, I or you could find the pubkey. Having the pubkey greatly reduces search time. You can use a variety of programs to help find your private key, especially with public key.I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
so keyhunt can be used for ethereum,only if i have publickey.
would keyhunt be used for ethereum publickey?
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
Do you have the pubkey? If not, but you had outgoing transactions, I or you could find the pubkey. Having the pubkey greatly reduces search time. You can use a variety of programs to help find your private key, especially with public key. I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
would keyhunt be used for ethereum publickey?
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
I lost my 12.7 eth,and want get them back.
here is the eth address:0xa42181ac82065d34095a3590c90cc56ac390ab5b
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
Jump to: