lotterypuzzle atlas

Bitcoin Puzzle record

Bitcoin Puzzle #123

open · address only

12.3 BTC nominal2122 candidate keys

Where it sits on the line

Puzzles #111–#135: search work One column per puzzle; height is the base-2 logarithm of the search steps. Puzzle #123 is highlighted. The line sits at 2^69. #111 · 2^110 #112 · 2^111 #113 · 2^112 #114 · 2^113 #115 · 2^58 #116 · 2^115 #117 · 2^116 #118 · 2^117 #119 · 2^118 #120 · 2^60.5 #121 · 2^120 #122 · 2^121 #123 · 2^122 #124 · 2^123 #125 · 2^63 #126 · 2^125 #127 · 2^126 #128 · 2^127 #129 · 2^128 #130 · 2^65.5 #131 · 2^130 #132 · 2^131 #133 · 2^132 #134 · 2^133 #135 · 2^68
  • found
  • open · address only
  • open · public key on chain
  • the line · 269

This puzzle needs about 2122 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
1CdufMQL892A69KXgv6UNBD17ywWqYpKut
mempool.space Blockstream
HASH160
7fa4515066ba6905f894b2078f9af7b1379169cf
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
2122 → 2123 − 1
start0x4000000000000000000000000000000
end0x7ffffffffffffffffffffffffffffff
Interval size5316911983139663491615228241121378304 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.