Hi all,
I've been working on a tool for brute-forcing Bitcoin private keys. The main purpose of this tool is to contribute to the effort of solving the Bitcoin puzzle transactions:
https://blockchain.info/tx/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15Screenshot:

It is open-source under the MIT licence and requires no external dependencies other than the CUDA toolkit. 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 can search for compressed/uncompressed keys or both.
The performance is good, but can likely be improved. On my hardware (GeForce GT 640) it gets 9.4 million keys per second compressed, 7.3 million uncompressed.
Note:
-Currently it is CUDA only.
-It can only search one target key at a time
Features I would like to add if there is enough interest for the project:
-Support for searching multiple target keys at one time
-OpenCL/AMD device support
-CPU with AVX/AVX2/SHA support
-Checkpoints/Stop and resume
-Vanity address generation
Source and Win32/Win64 binaries available here:
https://github.com/brichard19/BitCrackhttps://github.com/brichard19/BitCrack/releases/tag/v0.0.6Thoughts?
Thanks!
A set of tools for Bitcoin private keys that destroy. Currently the project requires a CUDA GPU. The main purpose of this project is to contribute to solving Bitcoin puzzle transactions: A transaction with 32 addresses becomes increasingly difficult to solve.
Currently this project is only CUDA, but I would like to bring it to another architecture if there is enough interest in the project.