keyhunt
keyhunt copied to clipboard
albertobsd
single key mode from file
Hi @albertobsd always thanks for your awesome work.
can you please implement single mode for file.
like if there are 100000 keys in input file and we set 64 range to scan for 100000 keys so program should pick 1 key first and scan whole range for first key if not found program switch to second one and scan whole range and so on. Thanks in advance
Interesting, let me guess did you want to read publickeys from the mempool to check if one of those is in the 64 bit range?
Maybe i want to implement that but for the keyhunt "shell" i don't know how to call it, this will be the same keyhunt but is going to have some shell where you can load publickeys indivisually as you said. And the data (bptable and blooms filters) are going to been already in memory.
But also letme thing if i can do something quick in the actual keyhunt without change much the program.
Hi @albertobsd always thanks for your awesome work.
can you please implement single mode for file.
like if there are 100000 keys in input file and we set 64 range to scan for 100000 keys so program should pick 1 key first and scan whole range for first key if not found program switch to second one and scan whole range and so on. Thanks in advance
I'm sure that in the 64 range, only one address has a balance. The rest of the addresses are empty. All public keys that have a balance are located in a much larger range 240-256 bits.You're just wasting your time.
Hi @albertobsd always thanks for your awesome work.
can you please implement single mode for file.
like if there are 100000 keys in input file and we set 64 range to scan for 100000 keys so program should pick 1 key first and scan whole range for first key if not found program switch to second one and scan whole range and so on. Thanks in advance
highly recommended please do such modification
64 bit is just i guess for understanding i talked with him , he said he need to load full file of keys and than program should grab every key one by one and than scan each key separately until end of the key range, if not found move to second key and if key found immediately terminate further search of that key and move to next key.
Maybe I don't understand .. But the space of keys is so large that you can search your whole life without finding anything. We are fighting for 64 bits in total and for 120 bits where the public key is known .. But even in this case, we need more than 2k years.
I have a server running at the moment, with a speed of 24 Ekeys/s, but even tpk I only hope for good luck.
By the way there is a memory problem I can not create a bloom filter over 500 GB. Error.
By the way there is a memory problem I can not create a bloom filter over 500 GB. Error.
I solved one bug related with the memory usage can you test if you can fill all your memory now?
Now I can create as much as possible points. Just one bug left is first 5% at start used just one core and on last version it’s stops on 99% of creating bloom. Now I start to regenerated a new filter of 295Gb ram, let’s see what will be
k 8192 freezes 99% k 16384 freezes 49% Considering that the first 5% takes the longest for the bloom filter, it's not very pleasant to know that the time is wasted.
k 8192 freezes 99% k 16384 freezes 49% Considering that the first 5% takes the longest for the bloom filter, it's not very pleasant to know that the time is wasted.
Sorry to heard that :(
yes the bug is also reported by zielar on https://github.com/albertobsd/keyhunt/issues/139
I wil put some effort to solve this ASAP but please be patient.
Regards!
This should be solved but if someone found some parameters that don't work please let me now
Hi @albertobsd always thanks for your awesome work.
can you please implement single mode for file.
like if there are 100000 keys in input file and we set 64 range to scan for 100000 keys so program should pick 1 key first and scan whole range for first key if not found program switch to second one and scan whole range and so on. Thanks in advance
I am about o finish a BSGS server that will do that on demand. I will le you know when it is finished
test if you want:
https://github.com/albertobsd/keyhunt/blob/main/BSGSD.md
test if you want:
https://github.com/albertobsd/keyhunt/blob/main/BSGSD.md
Does Bloom filter reload every time? After every request?
No, bloom and data are only reload every time tha you restart program, so if you don't restart this server version the data never will be reloaded.
So every request is processed almost inmediatly.