Topic: Keyhunt - development requests - bug reports - page 21. (Read 15202 times)

My idea is precalculate this part: **7ae41e4649b934c****991b7852b855 and just brute force the second.
if all the missing characters were together then it can be solved with BSGS in seconds

Is the search range for BSGS n/2 right? and not like xpoint mode when you have to search the whole range?

I have 2 questions if my keys is 0 is it still generating keys or what? I know about using a lot keys slows the speed down

Check my tweet:

https://twitter.com/albertobsd/status/1491653063882383362

I tested One million of publickey with a speed of 40 Gigakeys/s with only 4threads and 22 Gigabytes of RAM used

Where or who has the BSGS that can search for multiple public keys?

I think PrivatePerson is referring to that topic: https://bitcointalksearch.org/topic/bitcoin-alpha-challenge-81585631744-btc-5385235

For sure any gap is a complication and I think brute-forcing the key from puzzle requires a dedicated program, relying on existing solutions requires too many additional assumptions.

I think PrivatePerson is referring to that topic...

My idea is precalculate this part: **7ae41e4649b934c****991b7852b855 and just brute force the second.

I wanted to know 2^24 precalculated keys, is that the maximum precalculated keys that would fit in the hashtable/bloomfilter or could you add more than that?

e3b0c44****c1c149afbf4c8996fb****7ae41e4649b934c****991b7852b855

---

Edit

I found in a way to solve this (Hexadecimal key) in less than one hour, we can divide it in 2 parts a hashtable/bloomfilter of 2^24 of precalculated keys, and 24 bits of forcebrute with some math operations with publickey.

I correctly understood that everything that you wrote about the division of the private key and the use of the BSGS is only subject to a known public key?

Any updates on the additional features for Keyhunt?

is it possible to add an option to search for lost characters in the private key?

All depends on number of missing characters. 12 like in your example is already a serious amount of work.

Private key 5KYZdUEo***3FPrtuX2Qb***nNP5zTd7yyr2S******sBCnWjss  or

e3b0c44****c1c149afbf4c8996fb****7ae41e4649b934c****991b7852b855

Perhaps the creator of the keyhunt knows faster algorithms.

is it possible to add an option to search for lost characters in the private key?
For example:
Address 1HZwkjkeaoZfTSaJxDw6aKkxp45agDiEzN
Private key 5KYZdUEo***3FPrtuX2Qb***nNP5zTd7yyr2S******sBCnWjss  or e3b0c44****c1c149afbf4c8996fb****7ae41e4649b934c****991b7852b855

Maybe someone knows similar already existing programs?

Great information to share!! 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

• Add the publickey to a file

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

• 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!


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

• BSGS with K factor Release in 6/March
• Network/Pool versión
• Pollard rho

Best regards!