Pages:
Author

Topic: Keyhunt - development requests - bug reports - page 5. (Read 15173 times)

hero member
Activity: 862
Merit: 662
Hello Alberto. I built a new computer with better performance than the old one, in order to establish a higher value of the K factor. I have 192 GB DDR5 memory and Intel i9-14900K CPU. After I installed Windows 11, I installed the keyhunt application on WSL, but any of the K value I put, it gives me an error when saving the *.blm file. I ask you for advice to solve the problem. I tried from K = 8192, 4096 I went down to K = 256 and in vain. The problem is not from the value of K. I mention that I have enough free space, 1.28TB on a Samsung PRO SSD with 7000 MB read/write. Thank you in advance!

This can be caused y one of three problems
  • Not enough privilegies on the current directory
  • Not enough space
  • WSL configuration

List the current directory with ls -lah to see if "." (current directory) have  your same user and write permissions.
Use df -h to see how many disk space is available.

For the last one please check https://learn.microsoft.com/en-us/windows/wsl/wsl-config.

Can you please add the in GitHub ZEC donation address?

Let me check how to get one, I also plan to add a Monero wallet.


newbie
Activity: 5
Merit: 0
Hello Alberto,

Can you please add the in GitHub ZEC donation address?

Addicted to the program, also I think you should accept private donations not everybody wants to reveal their wallets to the world.

THX
newbie
Activity: 30
Merit: 0
Hello Alberto. I built a new computer with better performance than the old one, in order to establish a higher value of the K factor. I have 192 GB DDR5 memory and Intel i9-14900K CPU. After I installed Windows 11, I installed the keyhunt application on WSL, but any of the K value I put, it gives me an error when saving the *.blm file. I ask you for advice to solve the problem. I tried from K = 8192, 4096 I went down to K = 256 and in vain. The problem is not from the value of K. I mention that I have enough free space, 1.28TB on a Samsung PRO SSD with 7000 MB read/write. Thank you in advance!
Code:
ovix@DESKTOP-Z790:~/keyhunt$ ./keyhunt -t 2 -m bsgs -f tests/130.txt -r 200000000000000000000000000000000:3ffffffffffffffffffffffffffffffff -q -s 10 -S -k 256 -R
[+] Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
[+] Threads : 2
[+] Quiet thread output
[+] Stats output every 10 seconds
[+] K factor 256
[+] Random mode
[+] Mode BSGS random
[+] Opening file tests/130.txt
[+] Added 1 points from file
[+] Range
[+] -- from : 0x200000000000000000000000000000000
[+] -- to   : 0x3ffffffffffffffffffffffffffffffff
[+] N = 0x100000000000
[+] Bloom filter for 1073741824 elements : 3680.66 MB
[+] Bloom filter for 33554432 elements : 115.02 MB
[+] Bloom filter for 1048576 elements : 3.59 MB
[+] Allocating 16.00 MB for 1048576 bP Points
[+] processing 1073741824/1073741824 bP points : 100%
[+] Making checkums .. ... done
[+] Sorting 1048576 elements... Done!
[E] Error can't create the file keyhunt_bsgs_4_1073741824.blm
ovix@DESKTOP-Z790:~/keyhunt$
newbie
Activity: 2
Merit: 0
Thanks for the answer and help, I'm just a newbie but could play around a little bit!
hero member
Activity: 862
Merit: 662
I tested bsgsd sever and it also is pretty fast

Nice, not much people test it because not much knows that the server exists  Roll Eyes

I know printing to screen will cause lost of speed but, is there any way I can check exactly how many keys/s are running  in bsgsd?

To keep the best performance in the server i should recommend not to look for this on the server side.

Instead of it i should recommend to this on client side, in the BSGSD.md file i post a small python client, since performance is not required on client python fit perfectly for this situation, you can send small chunks of work to the server something like 50 to 55 bits of subrange and edit the client output to print the speed:

Code:
# Loop for sending and receiving messages
for i in range(num_iterations):
    reply, elapsed_time = send_and_receive_line(host, port, message)
    if reply is not None:
        # speed = subrange / elapsed_time
        print(f'Received reply: {reply}')
        print(f'Elapsed time: {elapsed_time} seconds')
        # print(f'Speed: {speed} keys / seconds')

In that code you need to set the sub-range value, this require to know what are you doing but you can get more or less the speed that you are getting in each time.
I hope this workaround fit your needs because to be honest i don't see any necessary to print the speed on the server side, it was made to attend clients without the need to be in front the same terminal.

Will be any speed improvement in the future for bsgsd or bsgs key generator?

For CPU i doubt it, I already did a lot of improvements compared against the BSGS of JLP i think that i realdy reach the CPU speed limit.
The only possible improvement will be implement another faster storage for the Baby table and bloom filters or the use of GPU (It need to rewrite all the code)

albert0bsd, thanks for all your work!!!

Thanks, you're more than welcome.

Regards!
newbie
Activity: 2
Merit: 0
Hello,

I have been testing and playing with keyhunt, very impressive and fast.  Recently, I tested bsgsd sever and it also is pretty fast:

time echo "0365ec2994b8cc0a20d40dd69edfe55ca32a54bcbbaa6b0ddcff36049301a54579 4000000000000000:8000000000000000" | nc -v localhost 8080
Ncat: Version 7.80
Ncat: Connected to 127.0.0.1:8080.
7cce5efdaccf6808Ncat: 101 bytes sent, 16 bytes received in 2.95 seconds.
real    0m2.961s
user    0m0.022s
sys     0m0.004s

I know printing to screen will cause lost of speed but, is there any way I can check exactly how many keys/s are running  in bagsd? With debug or something similar to what keyhunt shows, just for testing. I was able to run bsgsd from a little shell scrip so I can handle some specific ranges without restarting bsgsd each time (it takes half an hour for server to startup), after that, I could get 5E.

Will be any speed improvement in the future for bsgsd or bsgs key generator?

albert0bsd, thanks for all your work!!!
newbie
Activity: 23
Merit: 2
I've been using Keyhunt for a long time. It's a great program.
Are there any plans to incorporate an option to also search segwit, native segwit, and taproot addresses simultaneously along with the current legacy compressed/uncompressed addresses?
For example, if you wanted to use Keyhunt, in address mode, to do random searching in the full keyspace against Loyce Club's funded wallet list.
./keyhunt -m address -f tests/Bitcoin_addresses_LATEST.txt -l all -R -t 32 -s 10 (where "-l all" would be compressed, uncompressed, segwit, native segwit, taproot)

I know people say it's pointless but it'd be fun to try.
hero member
Activity: 862
Merit: 662
I just understand a little of Portuguese. I Only know Spanish and English.

Alberto, eu estava mesmo pensando nisso, sobre eu mesmo minerar o bloco, mas dai daria mais trabalho, pelo hashrate necessário.
Mas dai a minha dúvida.
Supondo que tivesse poder pra minerar, o processo não seria:
1 - Colocar a transação na mempool;
2 - Minerar o bloco?


It is not necessary to broadcast the transaction before mining the block.

Once that miners found a valid hash for their private block, they need to broadcast their full block data, only at that time the transaction will be public. (We are talking of private transactions that are only public once that they are already inside of a mined block).
Obviously that need to be a Custom miner software

You need to learn the full mining process, you need to know about the merkle trees and how block headers need to be build:
https://github.com/bitcoinbook/bitcoinbook/blob/develop/ch12_mining.adoc#constructing-the-block-header

hero member
Activity: 630
Merit: 731
Bitcoin g33k
Because always it's possible (with enough hash rate)mine a block with your private Transaction on it, ( yourself or a miner )

yeah, you need just some tons of hashpower, better some Exahashes/sec and a lot of patience Cheesy
hero member
Activity: 862
Merit: 662
If so, why still people discussing about it anyway?

Because always it's possible (with enough hash rate)mine a block with your private Transaction on it, ( yourself or a miner )

jr. member
Activity: 65
Merit: 1
34Sf4DnMt3z6XKKoWmZRw2nGyfGkDgNJZZ
Hi everyone.
First, sorry by my english.

Ok, i wanna to understand about the very comments that say when public key puzzle 66 show up, that will be cracked and will use the private key to redirect the transaction.

If that is true, and I get about the hugeness of range that possible 256bits, my question is, why then the people don't use that algoritm, for example, to crack the "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3 8c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f" pubkey from satoshi or any other known public key with huge btc amount?

Once the puzzle reveals 66 pubkeys, it is solved within seconds because the scanning range is small. BUT even if a 256-bit wallet has a pubkey, it is impossible to decrypt it because the scanning range is incredibly large.
While 1 graphics card is enough to solve puzzle 66 in seconds
A large number of graphics cards are required to decrypt a 256-bit wallet. millions, billions, trillions, I hope you understand.

So, try to solve, any of this low bits puzzle, 66,67,68 ... is useless, cause there are many bots watching this addresses for their public key right?

If so, why still people discussing about it anyway?

And second, why didn't it with puzzle 64?

Yes, bots are waiting in wait. The moment a sucker waits for puzzle number 66 and sends the transaction to the network, Pubkey will appear and bots will steal it within seconds.
puzzle 64 reward was 0.64 and bitcoin value was low then also software bots were not that advanced. Currently the reward is 6.6 BTC and bots are waiting in ambush
newbie
Activity: 29
Merit: 0
Hi everyone.
First, sorry by my english.

Ok, i wanna to understand about the very comments that say when public key puzzle 66 show up, that will be cracked and will use the private key to redirect the transaction.

If that is true, and I get about the hugeness of range that possible 256bits, my question is, why then the people don't use that algoritm, for example, to crack the "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3 8c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f" pubkey from satoshi or any other known public key with huge btc amount?

Once the puzzle reveals 66 pubkeys, it is solved within seconds because the scanning range is small. BUT even if a 256-bit wallet has a pubkey, it is impossible to decrypt it because the scanning range is incredibly large.
While 1 graphics card is enough to solve puzzle 66 in seconds
A large number of graphics cards are required to decrypt a 256-bit wallet. millions, billions, trillions, I hope you understand.

So, try to solve, any of this low bits puzzle, 66,67,68 ... is useless, cause there are many bots watching this addresses for their public key right?

If so, why still people discussing about it anyway?

And second, why didn't it with puzzle 64?
jr. member
Activity: 65
Merit: 1
34Sf4DnMt3z6XKKoWmZRw2nGyfGkDgNJZZ
Hi everyone.
First, sorry by my english.

Ok, i wanna to understand about the very comments that say when public key puzzle 66 show up, that will be cracked and will use the private key to redirect the transaction.

If that is true, and I get about the hugeness of range that possible 256bits, my question is, why then the people don't use that algoritm, for example, to crack the "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3 8c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f" pubkey from satoshi or any other known public key with huge btc amount?

Once the puzzle reveals 66 pubkeys, it is solved within seconds because the scanning range is small. BUT even if a 256-bit wallet has a pubkey, it is impossible to decrypt it because the scanning range is incredibly large.
While 1 graphics card is enough to solve puzzle 66 in seconds
A large number of graphics cards are required to decrypt a 256-bit wallet. millions, billions, trillions, I hope you understand.
newbie
Activity: 29
Merit: 0
Hi everyone.
First, sorry by my english.

Ok, i wanna to understand about the very comments that say when public key puzzle 66 show up, that will be cracked and will use the private key to redirect the transaction.

If that is true, and I get about the hugeness of range that possible 256bits, my question is, why then the people don't use that algoritm, for example, to crack the "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3 8c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f" pubkey from satoshi or any other known public key with huge btc amount?
hero member
Activity: 862
Merit: 662
My question is if I was lucky enough to ever get one of the bitcoin private keys how do you use it to get into the wallet?

If you are asking this I sugest to you stop using keyhunt right now and start reading the basics about this:

https://github.com/bitcoinbook/bitcoinbook

About the wallets you can use some light wallets like
Electrum

Also Sparrow wallet is Good (I personally prefer this one)

Remember it cost nothing ask in google or even those AI bots like chatgpt, those are a really good staring point.
newbie
Activity: 1
Merit: 0
Sorry if this is posted in wrong thread. Started using keyhunt a couple weeks ago.

My question is if I was lucky enough to ever get one of the bitcoin private keys how do you use it to get into the wallet?
Is there a certain wallet you download to enter the key and get in or Huh?
I searched but only thing I found was something on downloading the electrum bitcoin wallet and using that but when I downloaded and checked that out
the string they tell you to put in before the key depending on the first couple of characters of the wallet address does not match up at all with the characters
of wallet 66 or that matter with most if not all the other wallets unless I am missing something obvious.

Any help would be appreciated
jr. member
Activity: 56
Merit: 2
How to view blm files?What info is stored in tbl file?

Code:
# ./keyhunt -m bsgs -f tests/130.txt -6 -b 130 -k 4096 -q -t 64 -S
[+] Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
[+] K factor 4096
[+] Quiet thread output
[+] Threads : 64
[+] Random mode
[+] Mode BSGS random
[+] Opening file tests/130.txt
[+] Added 1 points from file
[+] Bit Range 130
[+] -- from : 0x200000000000000000000000000000000
[+] -- to   : 0x400000000000000000000000000000000
[+] N = 0x100000000000
[+] Bloom filter for 17179869184 elements : 58890.60 MB
[+] Bloom filter for 536870912 elements : 1840.33 MB
[+] Bloom filter for 16777216 elements : 57.51 MB
[+] Allocating 256.00 MB for 16777216 bP Points
[+] processing 17179869184/17179869184 bP points : 100%
[+] Making checkums .. ... done
[+] Sorting 16777216 elements... Done!
[+] Writing bloom filter to file keyhunt_bsgs_4_17179869184.blm .... Done!
[+] Writing bloom filter to file keyhunt_bsgs_6_536870912.blm .... Done!
[+] Writing bP Table to file keyhunt_bsgs_2_16777216.tbl .. Done!
[+] Writing bloom filter to file keyhunt_bsgs_7_16777216.blm .... Done!
[+] Total 71813097836282642432 keys in 30 seconds: ~2 Ekeys/s (2393769927876088081 keys/s)

32-Core (64-Thread) Processor with 64 GB RAM = 2 Exa Keys Per Second
member
Activity: 503
Merit: 38
If anyone is using keyhunt on an AMD processor, try compiling it with AOCC.
I got a +13% performance increase on Zen2 architecture compared to GCC-12, 13 and 14.
It would be interesting to see tests on Zen4 architecture.
https://www.amd.com/en/developer/aocc.html

I have a zillion errors when compiling  with Clang . Need to remove all Intel Intrinsics (__builtin_ia32_) in code . These intrinsics are specific to Intel processors and are not compatible with AMD processors.
hero member
Activity: 862
Merit: 662
How to view blm files?What info is stored in tbl file?

To be honest you dont need view them, they contain thee bloom filter data, it is a probabilistic datastructure that use an array of bits to store collision of hashed data, if you see that bit array it will like a random data without any sense to the human brain.

if you want to learn about them, check this video

https://www.youtube.com/watch?v=-jiOPKt7avE

Pages:
Jump to: