Random brutus of 22 digit mini keys (GPU version)

The database contains 4524 addresses, each of which belongs to Series 1.
https://bitcoinpuzzle.ru/btc.txt

If a mini-key is found, the information about it will be saved to a file. FOUND.txt .

In ARGS.txt arguments can be passed

https://bitcoinpuzzle.ru/upload/000/u1/f/6/f6602451.png

The -t and -b arguments:

These values depend on your graphics card.
Start with -t 128 and -b 500, then experiment. On the RTX 3060, for example, -t 256 -b 1000 gives the best result.
Monitor the loading of video memory (GPU-Z or nvidia-smi).
The argument is bits:

The value of 12 is reasonable: the table will have a size of 2^12 = 4096 cells.
You can increase it to 14-16 if there is enough memory and you see a lack of caching.
If the value increases, you will have to wait a bit.
The argument is alfabet:

It is used to generate random keys.
Do not change it until the test key is found!
Test key found! All working correctly...
When configuring arguments, check… Whether or not the test key is found in the database.

Image

"What, is the antivirus swearing?"

There is protection in this software

Download here
https://bitcoinpuzzle.ru/casasciusbtc.rar

It won't work here without a hidden SHH connection, and the fact that I'll upload the source code won't help, I'll just upload the idea to the public, that's all. I would only be in favor, but this is a fully automatic software.

Maybe later someone will find the puzzle and confirm that everything is working fine.

Everyone needs local software, I understand..

In fact, if you think about how much time you can spend searching alone, then even losing the found key in bitcoinpuzzle looks more attractive... 

It won't work here without a hidden SHH connection, and the fact that I'll upload the source code won't help, I'll just upload the idea to the public, that's all. I would only be in favor, but this is a fully automatic software.

Maybe later someone will find it and confirm that everything is working normally.

300 billion keys per participant

(Everyone gets a unique set of keys with each new iteration)

The search goes in order

(No accident. The algorithm iterates through the keys sequentially)

Just run the program. It uses a GPU resource and an internet connection.

Everything works automatically, you do not need to perform unnecessary actions.

The found key is saved in found.txt on your device.

https://bitcoinpuzzle.ru/upload/000/u1/3/2/9d50f05c.png

₿ Join the team that is looking for Bitcoin puzzles!!! ₿

Going through them all at once, rather than going through the same keys in different places, especially in such huge spaces, is just a waste of time if you don't have several thousand video cards. We need to unite.

300 billion keys per participant

(Everyone gets a unique set of keys with each new iteration)

The search goes in order

(No accident. The algorithm iterates through the keys sequentially)

Just run the program. It uses a GPU resource and an internet connection.

Everything works automatically, you do not need to perform unnecessary actions.

The found key is saved in found.txt on your device.

https://bitcoinpuzzle.ru/upload/000/u1/3/2/9d50f05c.png