🔥 ~1000 BTC Bitcoin Challenge

Description

In 2015, in order to show the hugeness of the private key space (or maybe just for fun), someone created a "puzzle" where he chose keys in a certain smaller space and sent increasing amounts to each of those keys like this:

2⁰ ≤ random key < 2¹ — 0.001 BTC
2¹ ≤ random key < 2² — 0.002 BTC
2³ ≤ random key < 2³ — 0.003 BTC
...
2²⁵⁵ ≤ random key < 2²⁵⁶ — 0.256 BTC
(total 32.896 BTC)

Original puzzle description from the creator:

"A few words about the puzzle. There is no pattern. It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty). It is simply a crude measuring instrument, of the cracking strength of the community."

First #1–70 and #75, #80, #85, #90, #95, #100, #105, #110, #115, #120, #125, #130 private keys have already been cracked.

History

2015-01-15

A transaction was created containing a transfer transaction for 256 different Bitcoin addresses.

2017-07-11

Funds from addresses #161—256 were moved (tx) to the same number of addresses of the lower range – thus increasing the amount of funds on them.

2019-05-31

The creator of the "puzzles" creates outgoing transaction with the value of 1000 satoshi for addresses #65, #70, #75, #80, #85, #90, #95, #100, #105, #110, #115, #120, #125, #130, #135, #140, #145, #150, #155, #160 with the aim of probably comparing the difficulty of finding a private key for the address from which such a transaction was carried out, and one that there is no transaction.

2023-04-16

Somebody (maybe the owner) increased (tx) the unsolved puzzles prizes again by x10. Now the puzzle #66 prize is 6.6 BTC, #67 is 6.7 BTC and so on... puzzle #160 prize is 16 BTC.

2024-09-12

Puzzle #66 (6.6 BTC) was solved by 1Jvv4y (tx1) but the original spending transaction was replaced by bc1qpk (tx2) spending only 5.94 BTC. Finally, another address 15XVN6 took the rest of the prize: 0.66 BTC (tx3).

2025-02-21

Puzzle #67 (6.7 BTC) was solved by bc1qfk and the transaction was mined bypassing the public mempool to avoid interception as in the case of puzzle #66.

2025-04-06

Puzzle #68 (6.8 BTC) was solved by bc1qfw and the transaction was mined bypassing the public mempool to avoid interception as in the case of puzzle #66.

2025-04-30

Puzzle #69 (6.9 BTC) was solved by bc1qlp in less than one month, likely due to its position at the very beginning of the search range (0.72%). However, the original transaction (tx1) was publicly broadcast, leading to it being replaced multiple times (tx2, tx3). Ultimately, 15g7XH managed to steal the prize (tx4).

Solution

In order to solve the puzzle, you must iterate over the specific private key space and check each private key for balance. The narrower the key space, the greater the chance of finding the private key. Currently, it is better to focus on solving puzzle #71 (due to its narrower key space) or #135 (utilizing the Baby-step giant-step or Pollard's kangaroo algorithm because of the exposed public key).

To automate this process, you can utilize the following methods/tools:

• Use our GPU Cloud Search solution
• Browse private keys directory of the puzzle #71 (not highly effective)
• Generate random keys within the key space of the puzzle #71 (not highly effective)
• Use Private Key Finder to scan the range of the puzzle #71 in the browser (slow)
• Use KeyHunt for CPU search (example)

  71-bit puzzle search:

  ./keyhunt -m rmd160 -f 71.rmd -b 71 -l compress -R

  Contents of the input file 71.rmd:

  f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8

  135-bit puzzle (BSGS) search:

  ./keyhunt -m bsgs -f 135.txt -b 135 -R

  Contents of the input file 135.txt:

  16RGFo6hjq9ym6Pj7N5H7L1NR1rVPJyw2v

• Use Kangaroo for GPU search puzzles with exposed public key (limited to a 125bit interval search) (example)

  125-bit puzzle search:

  ./Kangaroo -gpu 125.txt

  Contents of the input file 125.txt:

  10000000000000000000000000000000
  1fffffffffffffffffffffffffffffff
  0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e

• Use or BitCrack for GPU search (example)

  71-bit puzzle search:

  xxBitCrack.exe --keyspace 400000000000000000:7fffffffffffffffff -c 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU

• Join one of the collective solving pools

Links

• BitcoinTalk topic #1
• BitcoinTalk topic #2
• BitcoinTalk topic #3
• Overview of key cracking tools for 32BTC puzzle

Related puzzles

• Mini-puzzle for puzzle #120 SOLVED
• 80-bit private key puzzle SOLVED
• Mini-puzzle for puzzle #125 SOLVED
• Mini-puzzle for puzzle #130 SOLVED
• Mini-puzzle #4 SOLVED
• Mini-puzzle #5 SOLVED

Addresses & Private Keys Table Export

• All
• Unsolved
• Solved

Top Solvers

Bitcoin Challenge Odds Calculator

Puzzle (bits)

Total Keys

Search Speed

Prefix Keys/s KKeys/s (10^3) MKeys/s (10^6) GKeys/s (10^9) TKeys/s (10^12) PKeys/s (10^15) EKeys/s (10^18) ZKeys/s (10^21) YKeys/s (10^24)

Calculate

The odds of finding a private key within:

Day

Week

Month

Year