Every puzzle publishes an exact private key range. This solver walks that range right in your browser and checks keys against the target. On a small solved puzzle it lands a hit in seconds. On a big one it shows you, honestly, why brute force runs out of road.
This one is already solved, so the search replays its range in order and will find the key. Press start and watch the key rate and the hit.
This puzzle is already solved, so the demo scans the range from the start and stops when it reaches the known key. It is a replay, not a treasure hunt.
Want a specific one? Open any row on the full puzzle table and run its search from the puzzle page.
The solver never leaves your machine. It generates candidate private keys inside the puzzle's published range, one range only, and tests them against the target. Solved puzzles are replayed from the start of the range so a hit is guaranteed and quick. Unsolved puzzles are sampled at random, since walking them in order would take longer than the age of the universe. A short benchmark reports how many keys per second your device sustains.
Nothing here touches anyone's wallet. The only addresses in play are the puzzle addresses, which were funded on purpose in 2015 as an open challenge.
The range doubles with every bit. A fast browser checks a few million keys per second, a strong GPU rig a few billion. Put that against the size of a range and the wall shows up fast.
At a billion keys per second a 70 bit range still takes on the order of ten thousand years, and each further puzzle doubles that. This is why the serious attempts do not brute force blindly. When a puzzle's public key is exposed they use Pollard's Kangaroo, which needs only about the square root of the steps.