Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Niekko]

saatoshi_rising is not the creator of a puzzle. There is no indisputable evidence for that.

You are mistaken! saatoshi_rising is definitely the creator of this puzzle. First of all, he stated that he would remove addresses larger than 160 bits—and he did. Then he said he was considering increasing the reward by a factor of 10×, and he did that as well.


What other proof do you need?

[GrigoriyPerelman]

Guys
Whoever has the key starts with
1PWo3JeB9jrG
Can you send the keys via PM

1PWo3JeB9jrGwfJqVT99iRyva6kzmAaxTh
1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU

1XYouAreADigitaLFentAddictx13Mxjz

1XYouWontBeThe1ToFindTheKeyx7VfXN

1XxxStopWastingTimeAndMoneyx3WYWf

1XxxYoureALLSoDumBxxwzzzzzzxXcqnz

1XxxxxGiveUpALreadYxxxxwzzzxjo9QH

[whistle307194]

saatoshi_rising is not the creator of a puzzle. There is no indisputable evidence for that.

You are mistaken! saatoshi_rising is definitely the creator of this puzzle. First of all, he stated that he would remove addresses larger than 160 bits—and he did. Then he said he was considering increasing the reward by a factor of 10×, and he did that as well.


What other proof do you need?

The only one, unbeatable, transparent and legit prove should be looking this for instance;

///"Hi there,

My name is saatoshi_rising.
I have created a crypto puzzle for you

Rules:

Puzzle address : XXXX
Signed message by me : YYYY
The website where you can find all addresses linked to this puzzle : XYZ

Explanation: "you need to find a random private key for each address in a given search space, if you crack any address the prize is 100% yours"

Puzzle addresses were funded by me with bitcoins from a legal source, feel free to crack and get the prize!"\\\


Indeed, the user saatoshi_rising says "I am the creator" but that's all we can find.

I am not saying he or she isn't creator but because crucial details are missing it becomes instantly questionable.

Don't forget we're not talking about few hundreds here and the value will likely grow over a time.

It is about to have a legit explanation of funds source just in case.

Now it is a speculation of him/her to be a true creator.

Bitcoins exists that's for sure.

Are these coins legit? No idea.

[ilgizilgiz]

Hello Everyone

I've created a convenient Telegram Mini App for exploring the Bitcoin Puzzle Challenge.
No installation needed - just open it directly in Telegram!

Features:
  • Browse the entire Bitcoin private key space (2^256 pages)
  • Real-time balance checking via blockchain API
  • Puzzle Mode - hunt for the famous BTC puzzles (#66-#160)
  • Multi-threaded WebAssembly search (~12,000 keys/sec on mobile!)
  • Search history saved locally
  • Works on any device with Telegram

  The puzzles have real BTC rewards ranging from 6.6 to 16 BTC each.
  Currently unsolved: #71, #72, #76-#160

Try it: @bitkeysapp on telegram

Open source, no fees, just for fun and education.
Good luck hunting! 🎯

[E36cat]

Hello Everyone

I've created a convenient Telegram Mini App for exploring the Bitcoin Puzzle Challenge.
No installation needed - just open it directly in Telegram!

Features:
  • Browse the entire Bitcoin private key space (2^256 pages)
  • Real-time balance checking via blockchain API
  • Puzzle Mode - hunt for the famous BTC puzzles (#66-#160)
  • Multi-threaded WebAssembly search (~12,000 keys/sec on mobile!)
  • Search history saved locally
  • Works on any device with Telegram

  The puzzles have real BTC rewards ranging from 6.6 to 16 BTC each.
  Currently unsolved: #71, #72, #76-#160

Try it: @bitkeysapp on telegram

Open source, no fees, just for fun and education.
Good luck hunting! 🎯

if every someone is finding something will be cleaned fast by your bot

[Niekko]

Are these coins legit? No idea.

Do you really know the origin of every single banknote in your wallet? Is it legitimate, or does it come from a robbery or a mugging?

I’d say the puzzle is legitimate: it’s been around for over ten years, and if there had been any issues with the origin of the funds, they would have come to light long ago.

[blankx4729]

if this thing was generated by some kind of logic and it is a puzzle than this should help

====================================================================================================
BITCOIN PUZZLE ADVANCED PATTERN ANALYSIS
====================================================================================================

📋 ALL PUZZLES - RANGE POSITIONS
----------------------------------------------------------------------------------------------------
Puzzle | Bits | Percentage | Private Key
----------------------------------------------------------------------------------------------------
     1 |    1 |      0.00% | 0x1
     2 |    2 |    100.00% | 0x3
     3 |    3 |    100.00% | 0x7
     4 |    4 |      0.00% | 0x8
     5 |    5 |     33.33% | 0x15
     6 |    6 |     54.83% | 0x31
     7 |    7 |     19.04% | 0x4C
     8 |    8 |     75.59% | 0xE0
     9 |    9 |     82.74% | 0x1D3
    10 |   10 |      0.39% | 0x202
    11 |   11 |     12.80% | 0x483
    12 |   12 |     31.02% | 0xA7B
    13 |   13 |     27.35% | 0x1460
    14 |   14 |     28.71% | 0x2930
    15 |   15 |     63.98% | 0x68F3
    16 |   16 |     57.19% | 0xC936
    17 |   17 |     46.21% | 0x1764F
    18 |   18 |     51.57% | 0x3080D
    19 |   19 |     36.38% | 0x5749F
    20 |   20 |     64.66% | 0xD2C55
    21 |   21 |     72.78% | 0x1BA534
    22 |   22 |     43.40% | 0x2DE40F
    23 |   23 |     33.48% | 0x556E52
    24 |   24 |     72.00% | 0xDC2A04
    25 |   25 |     97.80% | 0x1FA5EE5
    26 |   26 |     62.53% | 0x340326E
    27 |   27 |     66.81% | 0x6AC3875
    28 |   28 |     69.60% | 0xD916CE8
    29 |   29 |     49.27% | 0x17E2551E
    30 |   30 |     92.44% | 0x3D94CD64
    31 |   31 |     95.80% | 0x7D4FE747
    32 |   32 |     44.05% | 0xB862A62E
    33 |   33 |     66.18% | 0x1A96CA8D8
    34 |   34 |     64.53% | 0x34A65911D
    35 |   35 |     17.07% | 0x4AED21170
    36 |   36 |     23.36% | 0x9DE820A7C
    37 |   37 |     45.88% | 0x1757756A93
    38 |   38 |      6.93% | 0x22382FACD0
    39 |   39 |     17.77% | 0x4B5F8303E9
    40 |   40 |     82.56% | 0xE9AE4933D6
    41 |   41 |     32.62% | 0x153869ACC5B
    42 |   42 |     31.66% | 0x2A221C58D8F
    43 |   43 |     68.47% | 0x6BD3B27C591
    44 |   44 |     75.13% | 0xE02B35A358F
    45 |   45 |     13.66% | 0x122FCA143C05
    46 |   46 |     46.11% | 0x2EC18388D544
    47 |   47 |     70.05% | 0x6CD610B53CBA
    48 |   48 |     35.86% | 0xADE6D7CE3B9B
    49 |   49 |     45.34% | 0x174176B015F4D
    50 |   50 |      8.56% | 0x22BD43C2E9354
    51 |   51 |     82.85% | 0x75070A1A009D4
    52 |   52 |     87.25% | 0xEFAE164CB9E3C
    53 |   53 |     50.18% | 0x180788E47E326C
    54 |   54 |     10.73% | 0x236FB6D5AD1F43
    55 |   55 |     66.78% | 0x6ABE1F9B67E114
    56 |   56 |     22.73% | 0x9D18B63AC4FFDF
    57 |   57 |     91.85% | 0x1EB25C90795D61C
    58 |   58 |     38.76% | 0x2C675B852189A21
    59 |   59 |     82.17% | 0x7496CBB87CAB44F
    60 |   60 |     96.89% | 0xFC07A1825367BBE
    61 |   61 |     23.66% | 0x13C96A3742F64906
    62 |   62 |     69.49% | 0x363D541EB611ABEE
    63 |   63 |     95.00% | 0x7CCE5EFDACCF6808
    64 |   64 |     92.98% | 0xF7051F27B09112D4
    65 |   65 |     65.71% | 0x1A838B13505B26867
    66 |   66 |     25.62% | 0x2832ED74F2B5E35EE
    67 |   67 |     79.78% | 0x730FC235C1942C1AE
    68 |   68 |     49.00% | 0xBEBB3940CD0FC1491
    69 |   69 |      0.72% | 0x101D83275FB2BC7E0C
    70 |   70 |     64.39% | 0x349B84B6431A6C4EF1
    75 |   75 |     19.31% | 0x4C5CE114686A1336E07
    80 |   80 |     82.89% | 0xEA1A5C66DCC11B5AD180
    85 |   85 |      9.03% | 0x11720C4F018D51B8CEBBA8
    90 |   90 |     40.23% | 0x2CE00BB2136A445C71E85BF
    95 |   95 |     28.87% | 0x527A792B183C7F64A0E8B1F4
   100 |  100 |     36.98% | 0xAF55FC59C335C8EC67ED24826
   105 |  105 |     43.39% | 0x16F14FC2054CD87EE6396B33DF3
   110 |  110 |     67.97% | 0x35C0D7234DF7DEB0F20CF7062444
   115 |  115 |     51.49% | 0x60F4D11574F5DEEE49961D9609AC6
   120 |  120 |     38.32% | 0xB10F22572C497A836EA187F2E1FC23
   125 |  125 |     77.03% | 0x1C533B6BB7F0804E09960225E44877AC
   130 |  130 |     62.19% | 0x33E7665705359F04F28B88CF897C603C9
====================================================================================================

[ilgizilgiz]

Hello Everyone

I've created a convenient Telegram Mini App for exploring the Bitcoin Puzzle Challenge.
No installation needed - just open it directly in Telegram!

Features:
  • Browse the entire Bitcoin private key space (2^256 pages)
  • Real-time balance checking via blockchain API
  • Puzzle Mode - hunt for the famous BTC puzzles (#66-#160)
  • Multi-threaded WebAssembly search (~12,000 keys/sec on mobile!)
  • Search history saved locally
  • Works on any device with Telegram

  The puzzles have real BTC rewards ranging from 6.6 to 16 BTC each.
  Currently unsolved: #71, #72, #76-#160

Try it: @bitkeysapp on telegram

Open source, no fees, just for fun and education.
Good luck hunting! 🎯

if every someone is finding something will be cleaned fast by your bot

Good question 🙂

You can actually verify everything yourself.
The Telegram Mini App code is publicly available here:
https://bitkeys.netlify.app

It’s hosted on free static hosting — no backend servers.
All balance checks go through public blockchain explorers.
Key generation and search happen locally on the user’s device.

You can even test it safely — here’s a page with ~$1 on it (please don’t steal it 😄):
589284034642645449166087675675620370548692370485630793856887457283926786058

When something is found, nothing is sent anywhere automatically — the user explicitly triggers the balance check.
If needed, I can also open the full GitHub repo.

Honestly, the goal of this project is simple — to explore the Bitcoin key space, learn, and find like-minded people.
When I first showed it to friends, they were shocked too — but I’m just building what I genuinely enjoy.

Yesterday I pushed a major upgrade:
I moved key generation to Rust, which gave a several-times performance boost, and added multi-threading — the more CPU cores you have, the more keys are checked in puzzle mode.

https://i.ibb.co/fzTT0z5r/2026-01-04-11-22-11.png
https://i.ibb.co/FbhL1VRd/2026-01-04-11-22-16.png

[Error_xaM]

Hi, could you open the repository on GitHub? How does this code perform the search? Does it use some kind of algorithm, or is it completely random?

Hello Everyone

I've created a convenient Telegram Mini App for exploring the Bitcoin Puzzle Challenge.
No installation needed - just open it directly in Telegram!

Features:
  • Browse the entire Bitcoin private key space (2^256 pages)
  • Real-time balance checking via blockchain API
  • Puzzle Mode - hunt for the famous BTC puzzles (#66-#160)
  • Multi-threaded WebAssembly search (~12,000 keys/sec on mobile!)
  • Search history saved locally
  • Works on any device with Telegram

  The puzzles have real BTC rewards ranging from 6.6 to 16 BTC each.
  Currently unsolved: #71, #72, #76-#160

Try it: @bitkeysapp on telegram

Open source, no fees, just for fun and education.
Good luck hunting! 🎯

if every someone is finding something will be cleaned fast by your bot

Good question 🙂

You can actually verify everything yourself.
The Telegram Mini App code is publicly available here:
https://bitkeys.netlify.app

It’s hosted on free static hosting — no backend servers.
All balance checks go through public blockchain explorers.
Key generation and search happen locally on the user’s device.

You can even test it safely — here’s a page with ~$1 on it (please don’t steal it 😄):
589284034642645449166087675675620370548692370485630793856887457283926786058

When something is found, nothing is sent anywhere automatically — the user explicitly triggers the balance check.
If needed, I can also open the full GitHub repo.

Honestly, the goal of this project is simple — to explore the Bitcoin key space, learn, and find like-minded people.
When I first showed it to friends, they were shocked too — but I’m just building what I genuinely enjoy.

Yesterday I pushed a major upgrade:
I moved key generation to Rust, which gave a several-times performance boost, and added multi-threading — the more CPU cores you have, the more keys are checked in puzzle mode.

https://i.ibb.co/fzTT0z5r/2026-01-04-11-22-11.png
https://i.ibb.co/FbhL1VRd/2026-01-04-11-22-16.png

[ilgizilgiz]

Hi, could you open the repository on GitHub? How does this code perform the search? Does it use some kind of algorithm, or is it completely random?

Hi! The repository is now public:

https://github.com/IlgizIlgiz/bitkee

The search works in several modes:

  1. Manual mode - you select a specific page (position in the key space) and scan 128 addresses at once
  2. Auto mode - generates random pages automatically and checks balances via Blockchain.info API
  3. Puzzle mode - brute-force search within known key ranges for Bitcoin Puzzle addresses

The search is essentially random/brute-force — there's no smart algorithm to predict private keys (that would be cryptographically impossible). It's more of an educational/lottery-style tool to visualize how vast the Bitcoin key space is.

Each "page" contains 128 sequential private keys. The total key space is ~2^256, so finding a used address by random search is astronomically unlikely.

[ee1234ee]

I actually wrote and tested all the code for 135. Works quite well.
It’s the same dispatcher as for 67 and 68, with run parameters varying by GPU model.
There’s a central server accumulating all the DP. It was actually the most complex bit to write, because handling the load from tens of thousands of GPUs sending points there was quite the challenge.

135 is roughly as complex as 68, so with 20k GPUs like I had back then it’s a matter of a couple months.
Probably 300k ish investment for the 13.5Btc reward.

Hello expert
Since you have already written the program to solve problem 135, why not create a pool? Like btcpuzzle, this is a pool with exclusive bonus. How nice would you put the pool on the Internet and let everyone join? 
If you don't want to do it, can you open source the program on GitHub? Let's build a pool together to solve problem 135.

[kTimesG]

I actually wrote and tested all the code for 135. Works quite well.
It’s the same dispatcher as for 67 and 68, with run parameters varying by GPU model.
There’s a central server accumulating all the DP. It was actually the most complex bit to write, because handling the load from tens of thousands of GPUs sending points there was quite the challenge.

Since you have already written the program to solve problem 135, why not create a pool? Let's build a pool together to solve problem 135.

Unlike address puzzles, where each and every worker simply needs a key range from a server and that's basically all, ECDLP puzzles need significantly higher data transfers and lots of central I/O.

It's also extremely difficult to have an "interruptible" worker this way, because a full state must be saved as often as possible, and restored on restart (without crashes and without data corruption due to the sudden interruption). With address puzzles: only the progress reporting is ever needed, zero state saves, zero state restores, simply scan whatever range the server wants next.

What I'm saying here, is that the operations are very sensitive and complex, so I doubt you'll see a (serious) pool for 135 or above soon, simply because clients can disappear forever in the middle of some long task, and managing that case (on the server) is kinda chasing ghosts in a dark room, for the rest of your life.

I'd say the closest to a "pool" would be to invest $ and let the stuff silently run on fully-trusted workers that have a clear and controlled lifecycle, not on random PCs. It's the same level of trust, since the ECDLP can only ever be solved server-side, when (for the first time) some whatever DP is found again, but from a different walk type.

[Bram24732]

I actually wrote and tested all the code for 135. Works quite well.
It’s the same dispatcher as for 67 and 68, with run parameters varying by GPU model.
There’s a central server accumulating all the DP. It was actually the most complex bit to write, because handling the load from tens of thousands of GPUs sending points there was quite the challenge.

Since you have already written the program to solve problem 135, why not create a pool? Let's build a pool together to solve problem 135.

Unlike address puzzles, where each and every worker simply needs a key range from a server and that's basically all, ECDLP puzzles need significantly higher data transfers and lots of central I/O.

It's also extremely difficult to have an "interruptible" worker this way, because a full state must be saved as often as possible, and restored on restart (without crashes and without data corruption due to the sudden interruption). With address puzzles: only the progress reporting is ever needed, zero state saves, zero state restores, simply scan whatever range the server wants next.

What I'm saying here, is that the operations are very sensitive and complex, so I doubt you'll see a (serious) pool for 135 or above soon, simply because clients can disappear forever in the middle of some long task, and managing that case (on the server) is kinda chasing ghosts in a dark room, for the rest of your life.

I'd say the closest to a "pool" would be to invest $ and let the stuff silently run on fully-trusted workers that have a clear and controlled lifecycle, not on random PCs. It's the same level of trust, since the ECDLP can only ever be solved server-side, when (for the first time) some whatever DP is found again, but from a different walk type.

My main concern with a pool would be that verifying DPs are real and not forged is a computationally intensive task.

[kTimesG]

My main concern with a pool would be that verifying DPs are real and not forged is a computationally intensive task.

Unless you traverse each walk that produced a DP, you can never know if it was forged or not, because the walks may be forged as well.

The DP may be 100% valid, but the walk might not have jumped at all according to your params, which means the DP is useless (the real DP set is 100% dependent on the jump parameters).

[Bram24732]

My main concern with a pool would be that verifying DPs are real and not forged is a computationally intensive task.

Unless you traverse each walk that produced a DP, you can never know if it was forged or not, because the walks may be forged as well.

The DP may be 100% valid, but the walk might not have jumped at all according to your params, which means the DP is useless (the real DP set is 100% dependent on the jump parameters).

My thoughts exactly. So no way to be protected against a bad actor filling your DB with junk

[Niekko]

Hi! The repository is now public:

https://github.com/IlgizIlgiz/bitkee

The search works in several modes:

  1. Manual mode - you select a specific page (position in the key space) and scan 128 addresses at once
  2. Auto mode - generates random pages automatically and checks balances via Blockchain.info API
  3. Puzzle mode - brute-force search within known key ranges for Bitcoin Puzzle addresses

The search is essentially random/brute-force — there's no smart algorithm to predict private keys (that would be cryptographically impossible). It's more of an educational/lottery-style tool to visualize how vast the Bitcoin key space is.

Each "page" contains 128 sequential private keys. The total key space is ~2^256, so finding a used address by random search is astronomically unlikely.

really nice, thank you

[brainless]

"who buy me a coffee"
This sentence is begging in admin view and always face deleted post
But asking a script, program, app, developments,
These are not begging in admin views.....
Thinking.........😂

[optioncmdPR]

The keys in column, 4 per row.
I think it looks rather tidy. The question is, does this
structure mean anything
regarding the possibility of
deriving the next two  to finish  row # 18?


1378
15314ce0
1d3202483a7b
1460293068f3c936
1764f3080d5749fd2c55
1ba5342de40f556e52dc2a04
1fa5ee5340326e6ac3875d916ce8
17e2551e3d94cd647d4fe747b862a62e
1a96ca8d834a65911d4aed211709de820a7c
1757756a9322382facd04b5f8303e9e9ae4933d6
153869acc5b2a221c58d8f6bd3b27c591e02b35a358f
122fca143c052ec18388d5446cd610b53cbaade6d7ce3b9b
174176b015f4d22bd43c2e935475070a1a009d4efae164cb9e3c
180788e47e326c236fb6d5ad1f436abe1f9b67e1149d18b63ac4ffdf
1eb25c90795d61c2c675b852189a217496cbb87cab44ffc07a1825367bbe
13c96a3742f64906363d541eb611abee7cce5efdaccf6808f7051f27b09112d4
1a838b13505b268672832ed74f2b5e35ee730fc235c1942c1aebebb3940cd0fc1491
101d83275fb2bc7e0c349b84b6431a6c4ef1

[damiankopacz87]

I don't say it is illegal or scam either but from the other side our probable creator is missing since 2019 ...

Creator is not missing, he is reading Your posts from another account and spinning this blockchain gambling.

Mr Creator, please, confirm, are You here?

Is 256th address original, or was there 0 at the beginning of its key?

BR
Damian

[analyticnomad]

The keys in column, 4 per row.
I think it looks rather tidy. The question is, does this
structure mean anything
regarding the possibility of
deriving the next two  to finish  row # 18?


1378
15314ce0
1d3202483a7b
1460293068f3c936
1764f3080d5749fd2c55
1ba5342de40f556e52dc2a04
1fa5ee5340326e6ac3875d916ce8
17e2551e3d94cd647d4fe747b862a62e
1a96ca8d834a65911d4aed211709de820a7c
1757756a9322382facd04b5f8303e9e9ae4933d6
153869acc5b2a221c58d8f6bd3b27c591e02b35a358f
122fca143c052ec18388d5446cd610b53cbaade6d7ce3b9b
174176b015f4d22bd43c2e935475070a1a009d4efae164cb9e3c
180788e47e326c236fb6d5ad1f436abe1f9b67e1149d18b63ac4ffdf
1eb25c90795d61c2c675b852189a217496cbb87cab44ffc07a1825367bbe
13c96a3742f64906363d541eb611abee7cce5efdaccf6808f7051f27b09112d4
1a838b13505b268672832ed74f2b5e35ee730fc235c1942c1aebebb3940cd0fc1491
101d83275fb2bc7e0c349b84b6431a6c4ef1

No it does not mean anything. It takes awhile to admit to yourself that there is no secret, no structural sequence, and no hidden meaning in any of this. There is only straight up sequential scanning at a large scale. The sooner you choke on this hard to swallow truth, the better off you will be.