lotterypuzzle atlas

Bitcoin Puzzle record

Bitcoin Puzzle #150

open · public key on chain

15 BTC nominal2149 candidate keys

Where it sits on the line

Puzzles #136–#160: search work One column per puzzle; height is the base-2 logarithm of the search steps. Puzzle #150 is highlighted. The line sits at 2^69. #136 · 2^135 #137 · 2^136 #138 · 2^137 #139 · 2^138 #140 · 2^70.5 #141 · 2^140 #142 · 2^141 #143 · 2^142 #144 · 2^143 #145 · 2^73 #146 · 2^145 #147 · 2^146 #148 · 2^147 #149 · 2^148 #150 · 2^75.5 #151 · 2^150 #152 · 2^151 #153 · 2^152 #154 · 2^153 #155 · 2^78 #156 · 2^155 #157 · 2^156 #158 · 2^157 #159 · 2^158 #160 · 2^80.5
  • found
  • open · address only
  • open · public key on chain
  • the line · 269

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

No puzzle above the line has been found yet.

Model: kangaroo. The public key has been on chain since 2019, so the square-root shortcut applies: about 2 × 2(N−1)/2 group operations.

How the work is estimated

Record

P2PKH address
1MUJSJYtGPVGkBCTqGspnxyHahpt5Te8jy
mempool.space Blockstream
Known public key
03137807790ea7dc6e97901c2bc87411f45ed74a5629315c4e4b03a0a102250c49
HASH160
e08c4d3bc9cf2b3e2cb88de2bfaa4fe8c7aa3f24
Search class
public-key
A public key is on record, so the square-root shortcut (kangaroo) works inside the interval. A key on record is not a spend.
Candidate interval
2149 → 2150 − 1
start0x20000000000000000000000000000000000000
end0x3fffffffffffffffffffffffffffffffffffff
Interval size713623846352979940529142984724747568191373312 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.

Mentioned in the atlas

Where #150 comes up in the room pages. rooms 7 · mentions 9

History
Cases
Myths
Theories
FAQ
Scale
+1 more mentions
Library

Method

Kangaroo searches only the window you choose. Being inside the window (containment) and being found by the solver are two separate odds, and finishing a bounded run stays probabilistic.