Keyhunt - development requests - bug reports

[albert0bsd]

Hi guys i just update the double speed version for BSGS: Version 0.2.230519
Also the legacy version was already on github from somo days ago (Now it works again on termux android and maybe another processor)

I setup a small dashboard for my self to keep track what features i am working on, you can see that in the link:

https://trello.com/b/GXBPiBCM/keyhunt

Things pending TO-DO in keyhunt  (in order)

• Finish the Double BSGS speed. (I'm having some troubles here but i'm at halfway)
• Legacy version (to run everywhere Linux, Mac, termux)
• Windows Version
• GPU Version
• Pool client Version

Tell me more: after stopping and restarting the program, it starts to sort through the keys again, or how is the previous search result saved?

There is no saved mode yet, but in random the probability of scan the te same rage twice is almost the same that find one key.

In any case That feature is on my TO-DO list, check the dashboard above, i don't know when i will add it, i hope soon.

[1714995707]

1714995707

[1714995707]

1714995707

[venom4464]

Hi guys i just update the double speed version for BSGS: Version 0.2.230519
Also the legacy version was already on github from somo days ago (Now it works again on termux android and maybe another processor)

I setup a small dashboard for my self to keep track what features i am working on, you can see that in the link:

https://trello.com/b/GXBPiBCM/keyhunt

Things pending TO-DO in keyhunt  (in order)

• Finish the Double BSGS speed. (I'm having some troubles here but i'm at halfway)
• Legacy version (to run everywhere Linux, Mac, termux)
• Windows Version
• GPU Version
• Pool client Version

Tell me more: after stopping and restarting the program, it starts to sort through the keys again, or how is the previous search result saved?

There is no saved mode yet, but in random the probability of scan the te same rage twice is almost the same that find one key.

In any case That feature is on my TO-DO list, check the dashboard above, i don't know when i will add it, i hope soon.

Great, waiting Windows version.

[digaran]

On android? So we can run keyhunt on our phones?

[citb0in]

I'm looking forward to the GPU feature, which will certainly have the biggest impact on speed and efficiency. Thank you so much for your great work Albert0

[digaran]

Still no words about the system you were supposed to buy with a few grands you received as a donation a couple of months ago? Maybe you live far far away from civilization, that's why it has taken you so long!

~regards.😉

[PrivatePerson]

Is it possible to use the same pb table for 50 bit range and for 70 bit range?
Or under each range and a public key the new table is necessary?

[albert0bsd]

Is it possible to use the same pb table for 50 bit range and for 70 bit range?
Or under each range and a public key the new table is necessary?

Is the same baby table for all the ranges

[albert0bsd]

Still no words about the system you were supposed to buy with a few grands you received as a donation a couple of months ago? Maybe you live far far away from civilization, that's why it has taken you so long!

~regards.😉

I'm going to go for the computer tomorrow, they already assembled it. I hope start the developing for GPU ASAP


Guys i release some kind of server for BSGS if some of you want to test it. I did some separate readme for it BSGSD.md I hope you like it

[kalos15btc]

Still no words about the system you were supposed to buy with a few grands you received as a donation a couple of months ago? Maybe you live far far away from civilization, that's why it has taken you so long!

~regards.😉

I'm going to go for the computer tomorrow, they already assembled it. I hope start the developing for GPU ASAP


Guys i release some kind of server for BSGS if some of you want to test it. I did some separate readme for it BSGSD.md I hope you like it

 thank you for you effort, but i didnt understand hwo the server and client work, im using keyhunt windows, and i want to try the serve, i have a question is , if i scan bsgs with the server it wont scan the same ranges again ? it means always new ranges ? and if there is a tuto on windows how to install and run the server with bsgs thank you ?

[tgfx]

thank you for you effort, but i didnt understand hwo the server and client work, im using keyhunt windows, and i want to try the serve, i have a question is , if i scan bsgs with the server it wont scan the same ranges again ? it means always new ranges ? and if there is a tuto on windows how to install and run the server with bsgs thank you ?

In Windows, you can install the Linux environment. Use PowerShell write wsl --install and run.
https://learn.microsoft.com/en-us/windows/wsl/basic-commands

[tgfx]

another question haunts me, about the two modes:
- - normal search over the entire 66 range (./keyhunt -m rmd160 -f tests/66.rdb 66 -l compress -R -q)
- - or still bsgs by public key (./keyhunt -m bsgs -f tests/125.txt -b 125 -q -s 10 -R)
on the one hand, the 66 range is less than (total) 73786976294838206463 and the 125th is already 42535295865117307932921825928971026431
it turns out 66 I can take the number of possible keys and divide by the speed, then I will understand how much I need to search for the key.
but on the other hand, the public key search algorithm is not a simple search, how to estimate how many possible steps in bsgs?

[JDScreesh]

Hello there again

Congratulations to the solver (or solvers) of the puzzle #125  

12.5 BTC is an excellent prize  

Now, the destination address is the same as the puzzle #120 (https://bitaps.com/3Emiwzxme7Mrj4d89uqohXNncnRM15YESs)

That make me think a lot of thinks 

[NonFungibleUser]

Hello guys, noob here, sorry:

Why don't we have a 66.pub file? So I can use BSGS?

This is my command line, and outputs, does this look good? Is it a good speed?

Code:

$ ./keyhunt -m address -f tests/66.txt -b 66 -t 128 -S
[+] Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
[+] Mode address
[+] Threads : 128
[+] Setting search for btc adddress
[+] N = 0x100000000
[+] Bit Range 66
[+] -- from : 0x20000000000000000
[+] -- to   : 0x40000000000000000
[+] Reading file data_8cf4f3dc.dat
[+] Bloom filter for 10000 elements.
[+] Allocating memory for 1 elements: 0.00 MB
[+] Total 507962254336 keys in 5250 seconds: ~96 Mkeys/s (96754715 keys/s)

If I stop it does it continue where it left? What is the data_8cf4f3dc.dat file for?

[NonFungibleUser]

another question haunts me, about the two modes:
- - normal search over the entire 66 range (./keyhunt -m rmd160 -f tests/66.rdb 66 -l compress -R -q)
- - or still bsgs by public key (./keyhunt -m bsgs -f tests/125.txt -b 125 -q -s 10 -R)
on the one hand, the 66 range is less than (total) 73786976294838206463 and the 125th is already 42535295865117307932921825928971026431
it turns out 66 I can take the number of possible keys and divide by the speed, then I will understand how much I need to search for the key.
but on the other hand, the public key search algorithm is not a simple search, how to estimate how many possible steps in bsgs?

Where did you get that 66.rdb?

[GR Sasa]

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

[NonFungibleUser]

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

I see, thanks for explaining.

What would you recommend using in #66? -m address with 66.txt or -m rmd160 with 66.rmd? Any pros and cons of each vs the other?

Can I leverage my RAM in -m address or -m rmd160 to make it faster, or only BSGS has that benefit?

[digaran]

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

I see, thanks for explaining.

What would you recommend using in #66? -m address with 66.txt or -m rmd160 with 66.rmd? Any pros and cons of each vs the other?

Can I leverage my RAM in -m address or -m rmd160 to make it faster, or only BSGS has that benefit?

Why would you wanna waste time and energy on address only puzzles when you can spend the same time and use the same resources to search for puzzles with known public keys,  either learn how to utilize bsgs for public keys or use kangaroo.

[NonFungibleUser]

You cant use BSGS for 66. Public key is not visible. You can only use BSGS for known public keys, and the source you provide, you arent using BSGS, you are using normal -m address which refers to normal bruteforce. You need to use the -m -bsgs commandline. for BSGS fast speed

I see, thanks for explaining.

What would you recommend using in #66? -m address with 66.txt or -m rmd160 with 66.rmd? Any pros and cons of each vs the other?

Can I leverage my RAM in -m address or -m rmd160 to make it faster, or only BSGS has that benefit?

Why would you wanna waste time and energy on address only puzzles when you can spend the same time and use the same resources to search for puzzles with known public keys,  either learn how to utilize bsgs for public keys or use kangaroo.

Where can I find these public key puzzles?

Sorry, very new in this.

[albert0bsd]

Where can I find these public key puzzles?

Sorry, very new in this.

Not all puzzles have it available only those that have some Output transaction.

[NonFungibleUser]

Where can I find these public key puzzles?

Sorry, very new in this.

Not all puzzles have it available only those that have some Output transaction.

Any output transaction? Aren't the new transaction scripts protocols avoiding exposing public keys at all? I had the idea that only in very old transactions outputs could you find public keys.