The Bitcoin Puzzle
In 2015, someone locked bitcoin into 160 addresses whose private keys sit in deliberately sized ranges — a public measuring stick for how fast the world can crack keys. Today 82 of 160 are solved and about 916.52 BTC remains unclaimed. This site explains each unsolved puzzle and lets you run a fast key scanner in your own browser.
Start with the frontier
How the puzzle works
Each puzzle number n hides a private key somewhere between 2^(n−1) and 2^n − 1. Puzzle #1 is trivial; puzzle #71's range already holds about 2^70 keys. The creator has stated there is no hidden pattern — the keys are simply consecutive values from a wallet, masked to set the difficulty — so the only route for an address-only puzzle is to try keys and check each one's address. Read the full explanation →
A free, private scanner
The scanner here is a from-scratch secp256k1 engine compiled to WebAssembly. It runs across all your CPU cores, checks several million keys per second on a modern laptop, and never sends anything anywhere — every candidate key is generated and discarded locally. It's built for learning how elliptic-curve key search actually works.
An honest word on the odds
Brute-forcing puzzle #71 on personal hardware is, realistically, hopeless: the range is so large that even millions of keys per second would take astronomically longer than the age of the universe to sweep. People who have solved the higher puzzles used GPU and FPGA farms, and still relied heavily on luck. Treat this as a fascinating cryptography sandbox, not an investment. More about this project →
Puzzle status last checked 2026-06-23.