Keyspace Türkçe

Bitcoin Puzzle Solver

Search the Bitcoin puzzle key ranges directly in your browser. The solver runs entirely on your own CPU, across every core. Nothing is uploaded, and any key you find stays in your browser. Measure your own machine with the benchmark below rather than taking a number on trust.

The Bitcoin puzzle is a set of 160 Bitcoin addresses created in 2015, each holding a reward and each with a private key deliberately confined to a known, progressively larger range. Puzzle #n has a key somewhere between 2n−1 and 2n−1. Puzzles 1–70 plus every fifth one up to 130 have been solved; 78 remain unsolved, holding roughly 903 BTC in total.

78unsolved puzzles
903.02BTC still unclaimed
82already solved
— keys/sec on this device

Most searched puzzles

Choose a puzzle to search

#71

7.10185241 BTC

270 → 271−1

 #72

7.20014379 BTC

271 → 272−1

 #73

7.30013849 BTC

272 → 273−1

 #74

7.40004977 BTC

273 → 274−1

 #76

7.6 BTC

275 → 276−1

 #77

7.70002426 BTC

276 → 277−1

 #78

7.8 BTC

277 → 278−1

 #79

7.9 BTC

278 → 279−1

Browse all 160 puzzles →

How the solver works

1. Pick a range

Every puzzle pins its private key inside one known power-of-two range. You choose which puzzle to attack; the solver never searches outside that range.

2. Generate and hash

For each candidate key the solver derives the secp256k1 public key, compresses it, and computes HASH160 = RIPEMD-160(SHA-256(pubkey)).

3. Compare

That 20-byte hash is compared against the puzzle address. A match means you hold the private key — the solver stops and shows it to you, in hex and WIF.

4. Repeat, in parallel

One Web Worker per CPU core walks its own slice of the range. Your browser tab does the work; no server is involved at any point.

Why this solver is fast

Naive solvers do one full elliptic-curve scalar multiplication per candidate key — hundreds of modular operations each. This one does a single scalar multiplication to enter a range, then walks it by adding precomputed multiples of the generator point, inverting an entire batch of 4,096 denominators with one modular inversion via Montgomery’s trick. SHA-256 and RIPEMD-160 are specialised to their exact single-block input, so the hot loop allocates nothing at all. Measured against a straightforward implementation that does one full scalar multiplication per key, the result is roughly 750 times faster.

Honest odds

Read this before you leave a tab running for a week. The smallest unsolved puzzle, #71, has a keyspace of 270 ≈ 1.18 × 1021 keys. At 4 million keys per second — a fast eight-core laptop — a full sweep would take about 9.4 million years. Random search gives you exactly the same expected time. This solver is honest arithmetic, not a lottery ticket dressed up as software: your realistic chance of a hit on a consumer machine is comparable to guessing a specific person on Earth, twice in a row. People do solve these puzzles, but they do it with GPU clusters and Kangaroo-class algorithms, not browser tabs. Run it because the mathematics is interesting.

What is the Bitcoin puzzle? → · Frequently asked questions →