The expected number of DP's is just an average.

Here's the problem though: each kangaroo on the GPU makes maybe 20 hops per second. It is going to take a very long time (e.g. 2^28 / 20 seconds) before a DP actually represents ~2^28 points.

This is why zielar's run is taking so long (barring any bugs). They have many DPs but the average walk is far less than 2^28.

To find the optimal DP bits you need to consider your total MKeys/sec, the number of kangaroos, and the number of hops each kangaroo can make per second.

Also full disclosure: I have been working on puzzle 110 since March 31st using my own implementation but will probably not finish by Sunday.

A distributed project like this is probably necessary if we want to solve the puzzles in the 130-160 bit range.

That usually means the GPU code was compiled to target a compute capability higher than what your card supports. The GTX 1080 Ti supports up to 6.1, so it would need to be compiled with sm_61,compute_61 or lower.

This is possible.

Use these options with clBitCrack/cuBitCrack:

This is really cool! How does it work? I guess it's distributing keyspaces to clients?

Very much appreciated! The donations are going towards new hardware, as I only have a GeForce GT 640 and Radeon 280X at the moment.

You can probably get more than 64Mkeys/second. Try increasing the p parameter.

It doesn't have distributed processing right now but it's on the to-do list.

For now you'll need to run it for each GPU on each machine. It shouldn't be too difficult if you have SSH access to your machines.

I'm not touching LBC, as the client source code is not available.


My machine is getting ~1 million keys per second with oclVanityGen. Not sure if it's not using my GPU or not picking optimal parameters.



I imagine people would check the balance for an address before trying to crack it. But like I said, it's main purpose is for the puzzle addresses, which have balances.

It's not social engineering anything. It's simply a brute-force tool.

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/08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15

Screenshot:



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 Done
-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/BitCrack
https://github.com/brichard19/BitCrack/releases/tag/v0.0.6


Thoughts?


Thanks!