![]() But I was doing manually, like 1 address/3 minutes lol I found some addresses which used to have balances, but not anymore. I tried those terms like "wallet" "bitcoin". I tried to do this once, but never found anything. If someone made an insecure private key, by just hashing some passphrase. ![]() What i think you could do is to find a collision. If it were brute force-able, bitcoin wouldn't be worth anything. If you have enough hash power, you would probably make more money working as an honest node, mining.īitcoin protocol is secure enough. I don´t think you will have any success doing this. What I am going to say is purely theoretical, as I have never tried to brute force private keys. I've been working on a tool for brute-forcing Bitcoin private keys. Source and Win32/Win64 binaries available here: Support for searching multiple target keys at one time Done It can only search one target key at a timeįeatures I would like to add if there is enough interest for the project: On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed. The performance is good, but can likely be improved. ![]() It can search for compressed/uncompressed keys or both. It builds on Windows using Visual Studio 2015, and Linux using Make (you might have to edit the Makefile and point it towards your CUDA toolkit directory). It is open-source under the MIT licence and requires no external dependencies other than the CUDA toolkit. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions:
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |