Bitcoin Puzzle record
Bitcoin Puzzle #71
Where it sits on the line
- found
- open · address only
- open · public key on chain
- the line · 269
This puzzle needs about 270 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 estimatedRecord
- HASH160
- f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8
- 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
- 270 → 271 − 1
- start0x400000000000000000
- end0x7fffffffffffffffff
- Interval size1180591620717411303424 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 #71 comes up in the room pages. rooms 10 · mentions 44
- Theories
-
- “There is no pattern” Forum statementForum statements
- 2017 consolidation as continued control On-chainOn-chain facts
- FAQ
-
- Why are some puzzles harder than others? MethodThe object
- Which one should I try? MethodSearch classes
+36 more mentions
- Myths
-
- Run kangaroo / BSGS on #71. Refuted
- Recover the #71 public key by adding G until HASH160 matches, then kangaroo. Refuted
- Bitcoin keys are 160-bit because of RIPEMD-160, so #71 is really 160 bits. Refuted
- A rainbow table of Bitcoin keys already contains #71. Refuted
- Someone shrank #71 to 64 bits; you just need the hidden offset. Refuted
- #71 is “next,” so it is due, and therefore easier this year. Refuted
- A GitHub repo that “solves the Bitcoin puzzle in minutes.” RefutedHardware & method
- Find any key whose HASH160 collides with the address. Easier than the range. RefutedCryptography
- Buy puzzle shares, cloud key-finders, or a “guaranteed scan.” RefutedClaim & operations
- saatoshi_rising lied; there is a closed-form pattern. Mix-upWrong object
- #160 without a public key is a practical brute-force target. RefutedFalse hope / EV
- Theories
-
- Reconstruct the generator (Python vs C++) SpeculationSpeculation
- One found key unlocks the rest RefutedRefuted readings
- FAQ
-
- What are the usual wrong ideas? RefutedPeople and stories
- Method
-
- Exact ranges, as integers Method
- The first keys are not a method Forum statement
- #4 scalar 8 Cryptographically verifiedThe first keys are not a method
- Scale
-
- #71 — width 270 Method
- #72 — twice #71 Method
- Doubling, not a mild slope Method
- What square-root does not erase Method
- Challenges
-
- How many candidate keys does puzzle #71 have? Method
- The first four keys are 1, 3, 7, 8. Does that give #71? Forum statement
- Given a known compressed public key for #140, which method applies? MethodWhich work, which unit
- After the 2023-04-16 increase, the nominal reward of #N is? On-chainCatalog unit and the 2019 leak
- Other puzzles
-
- Brainwallets and passphrase puzzles Mix-upSame word, different object
- Start
-
- The two that matter now MethodA first sitting
- How a search actually works MethodA first sitting
- Wrong ideas, before the math RefutedA first sitting
- Glossary
-
- N MethodRange
- HASH160 MethodCrypto objects
- Kangaroo / Pollard MethodSearch method
- Library
-
- #71 briefing Method
- Two search classes MethodMethod in prose
- The first keys as a lesson Cryptographically verifiedMethod in prose
- One-page sheetOrientation
Method
Without a catalogued public key the work is sequential HASH160 comparison across the interval, so it grows with the interval size.