Tools · range explorer
Exact interval ranges
Puzzle N covers exactly 2N−1 ≤ k ≤ 2N − 1 — that is 2N−1 candidate keys, both bounds inclusive. Every value on this page is computed with BigInt, so nothing is rounded, estimated or fetched.
Showing the last valid result — fix the puzzle number to update it.
Result
Interval (inclusive)
270 ≤ k ≤ 271 − 1
- Puzzle
- #71
- Scalar bit length
- 71 bits — the top bit is set for every k in the interval
- Search bits
- 70 bits — 270 = 1,180,591,620,717,411,303,424 candidates
- Lowest key (hex)
- 0x400000000000000000
- Highest key (hex)
- 0x7fffffffffffffffff
- Lowest key (decimal)
- 1,180,591,620,717,411,303,424
- Highest key (decimal)
- 2,361,183,241,434,822,606,847
- Width (inclusive)
- 270 keys exactly = 1,180,591,620,717,411,303,424
- Catalog classification
- open — address only
- Nominal reward
- 7.1 BTC nominal (not a balance)
Reading the numbers
Scalar bit length vs search bits.
Every scalar in the interval has exactly N significant bits (the top bit is set), but there are only 2N−1 candidates because the lowest one is 2N−1, not 0. The search space is therefore N−1 bits. A uniform scan without replacement expects the first hit after (2N−1+1)/2 distinct trials — half the interval, not half of N.
Historical vs open.
A solved puzzle is history: a spending transaction is on record and the key material is public. An open puzzle is a live record — either address-only (no public key published) or public-key known (a partial spend revealed it while the puzzle stayed unsolved).
Bounds are inclusive.
Both endpoints are valid scalars; the width is end − start + 1, checked with BigInt, never floating point.
This page contains no engine commands, no key derivation and no WIF. It reports interval mathematics from the public catalog.
Continue with the kangaroo work estimator to see what a public-key target costs, or the probability/EV tool to put a budget against it.