Bitcoin puzzle transaction ~32 BTC prize to who solves it

[brainless]

Still I have bid option to the 99.9 percent logic or 99 percent Logic
Start from 1 Btc

Unable to compute that remaining Logic achieving me huge trillion difference


Trust the math's . It never disappoint u

im still waiting for my BTC  BTC

I am also still waiting my btc too from BTC-E.com 1 acct 1733 btc 2nd acct 87 btc3rd acct 40+, any news related to victim of btc-e, as heared owner backed to Russia in Feb 2025, but still no announcement.....

[Garys27]

Anyone willing to share their best hash160 prefix matches?

I have
f6f5431d25bbed54360606f002ab373b8ac542c8 KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3rBinyJ7SyJ1aHWsGeWtv
f6f5431d25bbef7104e408a6d529af82ed8db72e KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3rA4qGp3FwkWn5ioNAdA2

[k2laci]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

[Frequence]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

I don't trust this pool - and also the app is very slow!

[ee1234ee]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

I don't trust this pool - and also the app is very slow!

Do you know of any better pools? Thank you

[Frequence]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

I don't trust this pool - and also the app is very slow!

Do you know of any better pools? Thank you

No, tthere are some out there, but honestly, don’t trust them at all,, it’s really hard to rely on them.

[FrozenThroneGuy]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

I don't trust this pool - and also the app is very slow!

Do you know of any better pools? Thank you

Of course:) My small pool is better:)
Best speed on Rtx 5090 is near 9.1 Gkeys/s (600 watt power consumption card, not 450 watt!).
The pool is completely transparent, and payouts upon key discovery are simple.
Link to the pool statistics with instructions how to participate: https://t.me/+t9Ss2oR3O_cwMmEy

[k2laci]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

The issue mentioned above has been resolved.
I’ve been reading up on this topic, and I still can’t tell whether there’s a consensus on what the safest method is if someone eventually gets lucky and obtains the private key from the puzzle. I know most people swear by MARA, but are there any other secure methods? Of course, my interest is purely theoretical!

[kTimesG]

Today is the historical day I finally discovered the secret behind this puzzle.

Simply post a matching SHA256 of an unsolved address puzzle's pubKey, otherwise you're just the bored bullshitter of page 594.

[ee1234ee]

[2025-10-11-14:40:33] [Info] [v1.4.1.0] [vanitysearch] starting... Puzzle: [71]
[2025-10-11-14:40:33] [Info] Target address: 1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU
[2025-10-11-14:40:33] [Info] Test mode is passive.
[2025-10-11-14:40:33] [Info] Custom range: [none]
[2025-10-11-14:40:33] [Info] API share: False / Telegram share: False
[2025-10-11-14:40:33] [Info] Untrusted computer: False
[2025-10-11-14:40:33] [Info] Progress: Visit the [btcpuzzle.info] for statistics.
[2025-10-11-14:40:33] [Info] Worker name: worker7539
------------------------------------------------------------------------------------------------------------------------
[2025-10-11-14:40:40] [Info] App [vanitysearch] exited with [-1073741676] code.
                                                                                 


What is the problem ?

I don't trust this pool - and also the app is very slow!

Do you know of any better pools? Thank you

Of course:) My small pool is better:)
Best speed on Rtx 5090 is near 9.1 Gkeys/s (600 watt power consumption card, not 450 watt!).
The pool is completely transparent, and payouts upon key discovery are simple.
Link to the pool statistics with instructions how to participate: https://t.me/+t9Ss2oR3O_cwMmEy

If there is a free GPU, or if you can use a free GPU for your own work, you can give it a try. If you have to spend all your money on GPUs, there's really no need to try them out. It takes 100 4090 graphics cards a year to scan 1%, and the probability is too low. There's no need to try them out.

[teguh54321]

Today is the historical day I finally discovered the secret behind this puzzle.

Simply post a matching SHA256 of an unsolved address puzzle's pubKey, otherwise you're just the bored bullshitter of page 594.

Yea , or just solve puzzle 160😅,  transfer without mara safe 😅

[mjojo]

@Teguh, basic of masking private key to public key used point doubling 1 2 4 8 16 32 and more, for masking keep secure must be combine with point addition scalar 1. You can try with script from gpt and the some private keys and reduce by division 2 with iteration match with the bits of private key. Example if bits of private key on 100 bits you must division until 99 times. If you not sure compare with the pvkey in binary number than check with the result 0 is doubling 1 is addition

[SRG02289]

1PWo3JeB9jz3qpSyRdgAenuYKrJHRHCJ1e  4770A32225DDC255BA
violation of the above logic?

[Blabla1000]

Today is the historical day I finally discovered the secret behind this puzzle.

I will reply whenever the creator of this puzzle replies to the Threat .

I am not lying and whenever I get a replay I will prove it to everyone I don't want to ruined this beautiful puzzle I want to keep it going.

Interesting claim, Bitcoin71 glad to hear someone’s making progress.
But “discovered the secret” sounds big can you at least share how you approached it or what made you realize it without revealing the full solution? It’d keep the spirit of the puzzle alive while giving everyone a glimpse of your reasoning.

[BlackAKAAngel]

How pathetic are most people here? Everybody announces that they have the key pattern or I don’t know what else, but nobody collects the prize.

[optioncmdPR]

Here. I shall give you a glimpse of hope that these keys are designed to be solved with both logic and bruting . Including a starter formula for #70. Also:  The second half of each puzzle key is simply the first half inverted and mirrored but with the digits on the inverted side to summed if it doesnt exceed 10 in the process . so, you will notice for example if 9 is present on the left half it will almost always followed by or preceded by 81, 18, 27,72 , 45,54 as its inverted counterpart on the right half. If you can think of it as the left half of the key is the
right half compressed , sqeezed so that any two numbers next to each other will add and become as one new number representing them both (as long as it doesnt exceed 10 )That is frustrating but if you stare angrily enough at these problems, solutions will surface.  This will have to be studied for needed extra precision when the puzzle keys are larger. As of right now, a mere 21 digit key like for puzzle 70 is quicky bruteforced in minutes, that is if you could just correctly calculate the first half of it, of course.
 Perhaps, even, with a formula like this:
 2^70^.0071×47.5027
 
 ....which happens to calculate to 97.043621153516297713.

[shakal256]

Here. I shall give you a glimpse of hope that these keys are designed to be solved with both logic and bruting . Including a starter formula for #70. Also:  The second half of each puzzle key is simply the first half inverted and mirrored but with the digits on the inverted side to summed if it doesnt exceed 10 in the process . so, you will notice for example if 9 is present on the left half it will almost always followed by or preceded by 81, 18, 27,72 , 45,54 as its inverted counterpart on the right half. If you can think of it as the left half of the key is the
right half compressed , sqeezed so that any two numbers next to each other will add and become as one new number representing them both (as long as it doesnt exceed 10 )That is frustrating but if you stare angrily enough at these problems, solutions will surface.  This will have to be studied for needed extra precision when the puzzle keys are larger. As of right now, a mere 21 digit key like for puzzle 70 is quicky bruteforced in minutes, that is if you could just correctly calculate the first half of it, of course.
 Perhaps, even, with a formula like this:
 2^70^.0071×47.5027
 
 ....which happens to calculate to 97.043621153516297713.

Hi, didn't you notice? Someone else posted after you. They deleted their message, and unfortunately, I didn't have time to copy it to check the logic behind the reverse sha256 conversion. Maybe you saved it? The person who posted it said they didn't have much time to finish this theory.

[skedarve]

Here. I shall give you a glimpse of hope that these keys are designed to be solved with both logic and bruting . Including a starter formula for #70. Also:  The second half of each puzzle key is simply the first half inverted and mirrored but with the digits on the inverted side to summed if it doesnt exceed 10 in the process . so, you will notice for example if 9 is present on the left half it will almost always followed by or preceded by 81, 18, 27,72 , 45,54 as its inverted counterpart on the right half. If you can think of it as the left half of the key is the
right half compressed , sqeezed so that any two numbers next to each other will add and become as one new number representing them both (as long as it doesnt exceed 10 )That is frustrating but if you stare angrily enough at these problems, solutions will surface.  This will have to be studied for needed extra precision when the puzzle keys are larger. As of right now, a mere 21 digit key like for puzzle 70 is quicky bruteforced in minutes, that is if you could just correctly calculate the first half of it, of course.
 Perhaps, even, with a formula like this:
 2^70^.0071×47.5027
 
 ....which happens to calculate to 97.043621153516297713.

you pass the exact rule pls

[kTimesG]

Hi, didn't you notice? Someone else posted after you. They deleted their message, and unfortunately, I didn't have time to copy it to check the logic behind the reverse sha256 conversion. Maybe you saved it? The person who posted it said they didn't have much time to finish this theory.

Do you have the smallest understanding of what a hash function even is? Hash functions do not revert back to anything, as there's an infinite amount of inputs that hash back to a given hash (or none at all, at the same time - impossible to prove until someone brings up a full on complete 256-bit sized rainbow table).

99% of the posts in this thread deserve to be deleted, as they're plain out idiotic non-sense.

[brainless]

Here. I shall give you a glimpse of hope that these keys are designed to be solved with both logic and bruting . Including a starter formula for #70. Also:  The second half of each puzzle key is simply the first half inverted and mirrored but with the digits on the inverted side to summed if it doesnt exceed 10 in the process . so, you will notice for example if 9 is present on the left half it will almost always followed by or preceded by 81, 18, 27,72 , 45,54 as its inverted counterpart on the right half. If you can think of it as the left half of the key is the
right half compressed , sqeezed so that any two numbers next to each other will add and become as one new number representing them both (as long as it doesnt exceed 10 )That is frustrating but if you stare angrily enough at these problems, solutions will surface.  This will have to be studied for needed extra precision when the puzzle keys are larger. As of right now, a mere 21 digit key like for puzzle 70 is quicky bruteforced in minutes, that is if you could just correctly calculate the first half of it, of course.
 Perhaps, even, with a formula like this:
 2^70^.0071×47.5027
 
 ....which happens to calculate to 97.043621153516297713.

Hi, didn't you notice? Someone else posted after you. They deleted their message, and unfortunately, I didn't have time to copy it to check the logic behind the reverse sha256 conversion. Maybe you saved it? The person who posted it said they didn't have much time to finish this theory.

Are u looking below message
Copied...
 the order is not random. then there must be a structure that is embedded in the order of pkeys that can potentially be used  to unlock the big-ol Ripemd(Sha256(secp256k1(Key))  topology, Ripemd has 160 fixed point of 2^32 evaluation points. secp256k1 is dynamic. logically I would have embedded the structure in the earliest steps of secp256k1 one example would be, if the first step is implemented as below

code:
x1=str2sym('0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798');
y1=str2sym('0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8');
G(:,1)= [2*y1;p]
G(:,2)= [1;0]
G(:,3)= [0;1]
i=1;
while  (G(i,1)>2) % GCD
i=i+1;
G(i+1,1) = G(i-1,1) - G(i,1)*fix(G(i-1,1)/G(i,1));
G(i+1,2) = G(i-1,2) - G(i,2)*fix(G(i-1,1)/G(i,1));
G(i+1,3) = G(i-1,3) - G(i,3)*fix(G(i-1,1)/G(i,1));
end

x2=mod(mod(3*x1*x1*G(1:i,2),p).^2-x1-x1,p);
y2=mod(mod(3*x1*x1*G(1:i,2),p).*(x1-G1)-y1,p);

it can be embedded in the G's as mod(G(2),2^70 -1 ) or a combination of the Gs ..1,2 and 3. but the values in the Keys are dense so I am guessing it could be a more involved function of Gs

Another approach that I made a huge progress with involves implementing sha256 in complex .. then there is a map of  real(W) -> Ripemd and  imag(W)-> secp256k1. W can be computed in reverse from the sha256 hash. I am able to find the map to Ripemd but the other leg has become a bit tricky . I am throwing the towels at this point but I will give it a go again when I get the time. I have a few other promising approach's but I don't have luxury of time. But I know