lotterypuzzle atlas

Bitcoin Puzzle record

Bitcoin Puzzle #116

open · address only

11.6 BTC nominal2115 candidate keys

Where it sits on the line

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

This puzzle needs about 2115 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
1MnJ6hdhvK37VLmqcdEwqC3iFxyWH2PHUV
mempool.space Blockstream
HASH160
e3f381c34a20da049779b44cae0417c7fb2898d0
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
2115 → 2116 − 1
start0x80000000000000000000000000000
end0xfffffffffffffffffffffffffffff
Interval size41538374868278621028243970633760768 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.