lotterypuzzle atlas

Bitcoin Puzzle record

Bitcoin Puzzle #101

open · address only

10.1 BTC nominal2100 candidate keys

Where it sits on the line

Puzzles #89–#113: search work One column per puzzle; height is the base-2 logarithm of the search steps. Puzzle #101 is highlighted. The line sits at 2^69. #89 · 2^88 #90 · 2^45.5 #91 · 2^90 #92 · 2^91 #93 · 2^92 #94 · 2^93 #95 · 2^48 #96 · 2^95 #97 · 2^96 #98 · 2^97 #99 · 2^98 #100 · 2^50.5 #101 · 2^100 #102 · 2^101 #103 · 2^102 #104 · 2^103 #105 · 2^53 #106 · 2^105 #107 · 2^106 #108 · 2^107 #109 · 2^108 #110 · 2^55.5 #111 · 2^110 #112 · 2^111 #113 · 2^112
  • found
  • open · address only
  • open · public key on chain
  • the line · 269

This puzzle needs about 2100 search steps — above the line (269).

No puzzle above the line has been found yet.

Model: range scan. Every candidate key in the interval is hashed and compared with the address.

How the work is estimated

Record

P2PKH address
1CKCVdbDJasYmhswB6HKZHEAnNaDpK7W4n
mempool.space Blockstream
HASH160
7c1a77205c03b9909663b2034faa0b544e6bc96b
Search class
address-only
No public key on record: the only route is to hash candidate keys and compare them with the address (HASH160).
Candidate interval
2100 → 2101 − 1
start0x10000000000000000000000000
end0x1fffffffffffffffffffffffff
Interval size1267650600228229401496703205376 scalars. Exact BigInt bounds, not a floating estimate.

Snapshot 2 Oct 2026. The reward is the catalog's nominal allocation (N × 0.1 convention from 2023-04-16; earlier spends predate it), not a live balance. A key that matches the address proves the math, not that the coins are still there: check an explorer. Missing fields are omitted, not invented.

Method

Without a catalogued public key the work is sequential HASH160 comparison across the interval, so it grows with the interval size.