Bitcoin puzzle transaction ~32 BTC prize to who solves it

[AlanJohnson]

Well, there is no need to improve it forever, because you will simply get tired of doing it  
and whether it is useless and the idea itself, time will tell)

https://github.com/NoMachine1/Mutagen

Lots of improvements)) and I'm trying to make it work with avx2  

How many times faster it can be than a standard brute force ?  Cause if less than  million you will not solve anything new anyway ...

even if I don't solve it myself, maybe someone will solve it using this method, which will also be nice)

I could risk a thesis that no new puzzles will be solved with CPUs ... You would need millions of them... They are just not efficient enough to bother anymore.

I agree with you, but why not try?)

Cause it can't be done.  Like taking all the water from lake with a spoon. You are free to try, it's technically possible but you will die sooner than it will happen  

I've posted earlier my simple estimator http://jastrzeblu.cluster021.hosting.ovh.net/

When i put my speed of cpu (3570k) using cyclone (20 Mkeys/s) and check 68 bit puzzle ... it would take over 222000 years to find the keys... It's insane to believe that i will be so lucky i will hit the key in a resonable time.

[AlanJohnson]

Well, there is no need to improve it forever, because you will simply get tired of doing it  
and whether it is useless and the idea itself, time will tell)

https://github.com/NoMachine1/Mutagen

Lots of improvements)) and I'm trying to make it work with avx2  

How many times faster it can be than a standard brute force ?  Cause if less than  million you will not solve anything new anyway ...

even if I don't solve it myself, maybe someone will solve it using this method, which will also be nice)

I could risk a thesis that no new puzzles will be solved with CPUs ... You would need millions of them... They are just not efficient enough to bother anymore.

I agree with you, but why not try?)

Cause it can't be done.  Like taking all the water from lake with a spoon. You are free to try, it's technically possible but you will die sooner than it will happen  

I've posted earlier my simple estimator http://jastrzeblu.cluster021.hosting.ovh.net/

When i put my speed of cpu (3570k) using cyclone (20 Mkeys/s) and check 68 bit puzzle ... it would take over 222000 years to find the keys... It's insane to believe that i will be so lucky i will hit the key in a resonable time.

I get a little less years Years: 62393.86 you can start it and go into cryosleep 

When you finally wake up nobody will know what is bitcoin 

[nomachine]

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Searching Puzzle 25 (25-bit)
Base Key: 0000000000...0000DC2A04
Target HASH160: 2f396b29b2...1835bd3dbb
Predicted Flip Count: 12 bits
Total Combinations: 5200300
Using 8 workers...
Using AVX2 optimizations...
Progress: 11.345499% (590002/5200300)

Progress: 0.000001% (284400000/36565184442289825) [44.420601 Mkeys/s]

[b0dre]

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Searching Puzzle 25 (25-bit)
Base Key: 0000000000...0000DC2A04
Target HASH160: 2f396b29b2...1835bd3dbb
Predicted Flip Count: 12 bits
Total Combinations: 5200300
Using 8 workers...
Using AVX2 optimizations...
Progress: 11.345499% (590002/5200300)

Progress: 0.000001% (284400000/36565184442289825) [44.420601 Mkeys/s]

Changes?
 

[nomachine]

=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Searching Puzzle 25 (25-bit)
Base Key: 0000000000...0000DC2A04
Target HASH160: 2f396b29b2...1835bd3dbb
Predicted Flip Count: 12 bits
Total Combinations: 5200300
Using 8 workers...
Using AVX2 optimizations...
Progress: 11.345499% (590002/5200300)

Progress: 0.000001% (284400000/36565184442289825) [44.420601 Mkeys/s]

Changes?
 

Soon—if I survive poker in Las Vegas. 

[nomachine]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

[Akito S. M. Hosana]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

I studied combinatorics in college, so I understand this algorithm is good. However, I still don’t see the advantage over pure brute force or sequential search. It’s fast, but that alone doesn’t seem significant. To whoever can guess the flipped bits for 68—kudos to them!   

[nomachine]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

#include <array> missing

Done. 

[Denevron]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

oh, you did it quickly, I almost translated my version to avx2 too, but I have a problem with the verification somewhere, and the speeds are not the same as yours

Do you mind if I use your version?)

[Denevron]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

#include <array> missing

Done. 

Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 5 (override, default was 34)
Total combinations: 10424128
Using: 20 threads
Progress: 100.000000%
Processed: 344520300
Speed: 70.37 Mkeys/s
Elapsed Time: 00:00:39


She doesn't stop, she keeps working 

[nomachine]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

#include <array> missing

Done. 

Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 5 (override, default was 34)
Total combinations: 10424128
Using: 20 threads
Progress: 100.000000%
Processed: 344520300
Speed: 70.37 Mkeys/s
Elapsed Time: 00:00:39


She doesn't stop, she keeps working 

At the current speed, it would take ~36.85 years to reach 100% for puzzle 68 

[Denevron]

Mutagen AVX2 edition:

https://github.com/NoMachine1/Mutagen

#include <array> missing

Done. 

Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 5 (override, default was 34)
Total combinations: 10424128
Using: 20 threads
Progress: 100.000000%
Processed: 344520300
Speed: 70.37 Mkeys/s
Elapsed Time: 00:00:39


She doesn't stop, she keeps working 

At the current speed, it would take ~36.85 years to reach 100% for puzzle 68 

Well, 5 bits, only 10 million) I understand that the speed is not the same as yours, but the program will work in the background, and I will continue to look for other options for improvement 

[Akito S. M. Hosana]

At the current speed, it would take ~36.85 years to reach 100% for puzzle 68 

.\mutagen.exe -p 68
=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 34
Total combinations: 47478523248093572
Using: 16 threads
Progress: 0.000001%
Interrupt received, shutting down...
Progress: 0.000001%
Processed: 445838012
Speed: 40.53 Mkeys/s
Elapsed Time: 00:01:32


0.000001%. I won't be on the planet anymore when it reaches 100% 

[Denevron]

and will we see gpu farm doing it in less than a day?

maybe someone will do it on a GPU, and someone will run it on 10-20 cards  

At the current speed, it would take ~36.85 years to reach 100% for puzzle 68 

.\mutagen.exe -p 68
=======================================
== Mutagen Puzzle Solver by Denevron ==
=======================================
Starting puzzle: 68 (68-bit)
Target HASH160: e0b8a2baee...7451fc8cfc
Base Key: 0x730FC235C1942C1AE
Flip count: 34
Total combinations: 47478523248093572
Using: 16 threads
Progress: 0.000001%
Interrupt received, shutting down...
Progress: 0.000001%
Processed: 445838012
Speed: 40.53 Mkeys/s
Elapsed Time: 00:01:32


0.000001%. I won't be on the planet anymore when it reaches 100% 

I have a version in the repository with less output updates, it affects the speed, and after all combinations a stop is added 

[nomachine]

I have a version in the repository with less output updates, it affects the speed, and after all combinations a stop is added 

That’s what I meant—you can’t do it alone. For any puzzle project, you need more than one person. Ideally, about 10 contributors forking, iterating, and peer-correcting in parallel. 

[Jorge54PT]

Hello everyone,

I’m writing today to share some news that has completely blown my mind: I’ve discovered a formula that can derive the private keys for the remaining addresses in the bitcoin puzzle. And the craziest part is that it’s been right under our noses the entire time, hidden in the one and only post from the puzzle’s creator on this forum!

I’m a mathematician by training, and until recently, I knew practically nothing about blockchain. But I got involved in this treasure hunt purely out of curiosity, after combing through that old post line by line, which at first seemed to be nothing more than an ordinary message yet there was more to it…

One evening, almost by accident, I noticed a pattern of nearly invisible symbols in the text. By cross-referencing them with some advanced algebra theorems, I managed to reconstruct the formula that unlocks the private keys still undiscovered to this day. To confirm my findings, I wrote a simple script (thanks to ChatGPT, ironically), and the test confirmed that I could extract all the remaining keys!

Naturally, I’m completely lost when it comes to the legal aspects of this. I’ve contacted a lawyer to find out how to transfer these funds safely, because I don’t want to break any laws or take any unnecessary risks. I’ll likely have to follow their advice to the letter before doing anything, and I’ll also be calling on a professional to move the funds securely in order to avoid any front-running.

Since I’m still in the middle of all these steps, I can’t share the exact formula or the script just yet. I know it’s frustrating, but I’d rather protect myself before moving any funds.

So there you have it I just wanted to let you know. I’m convinced this puzzle was the missing piece of a much bigger mystery.

And then… before I forget… oh, yes… happy April 1st, everyone!

Of course, you’ve probably guessed it: this is nothing but an April Fool’s joke. But who knows? Maybe the real solution really is hidden in that famous post.

Best of luck to everyone continuing this incredible treasure hunt!

Hi
so extract everything as quickly as possible and this way we save our time and equipment.
Congratulations on the discovery

[Denevron]

I have a version in the repository with less output updates, it affects the speed, and after all combinations a stop is added 

That’s what I meant—you can’t do it alone. For any puzzle project, you need more than one person. Ideally, about 10 contributors forking, iterating, and peer-correcting in parallel. 

I completely agree with you! The more people, the more productive the process is 

[nomachine]

maybe someone will do it on a GPU, and someone will run it on 10-20 cards  

20 GPUs could reach ~40,000 Mkeys/s   

[Akito S. M. Hosana]

maybe someone will do it on a GPU, and someone will run it on 10-20 cards  

20 GPUs could reach ~40,000 Mkeys/s   

First, let’s agree on whether it takes 34, 35, 36, or 37 flips. 

[Denevron]

maybe someone will do it on a GPU, and someone will run it on 10-20 cards  

20 GPUs could reach ~40,000 Mkeys/s   

I noticed something, let's say if the speed is 75 million per second, then in theory we should go through 50 billion in 15 minutes, but now it takes more time)

maybe someone will do it on a GPU, and someone will run it on 10-20 cards  

20 GPUs could reach ~40,000 Mkeys/s   

First, let’s agree on whether it takes 34, 35, 36, or 37 flips. 

Number of mutation options for 68 bit of 34: 28453041475240576740
Number of mutation options for 68 bit of 35: 27640097433090845976
Number of mutation options for 68 bit of 36: 25336755980333275478
Number of mutation options for 68 bit of 37: 21912870037044995008