lotterypuzzle atlas

Bitcoin Puzzle record

Bitcoin Puzzle #113

open · address only

11.3 BTC nominal2112 candidate keys

Where it sits on the line

Puzzles #101–#125: search work One column per puzzle; height is the base-2 logarithm of the search steps. Puzzle #113 is highlighted. The line sits at 2^69. #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 #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
  • found
  • open · address only
  • open · public key on chain
  • the line · 269

This puzzle needs about 2112 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
1NeGn21dUDDeqFQ63xb2SpgUuXuBLA4WT4
mempool.space Blockstream
HASH160
ed673389e4b12925316f9166d56d701829e53cf8
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
2112 → 2113 − 1
start0x10000000000000000000000000000
end0x1ffffffffffffffffffffffffffff
Interval size5192296858534827628530496329220096 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.