Bitcoin puzzle transaction ~32 BTC prize to who solves it

[BlackAKAAngel]

He didn't give it to us. Since you don't know, I'll explain. When there's a transfer, the decompressed public key is revealed. Simple as that.

This question solved entire puzzle.... WHY THE CREATOR GIVE US THE PUBLIC KEYS OF EVRY 5 PUZZLE? THINK ABOUT THAT.

you dont understand....why evry 5 address.....

If you know, tell us. If you don't know, don't make us use our minds for your own satisfaction.

  If you want to know, I can help, but I will not provide the answer directly. It’s important to think critically to solve this puzzle. Remember, someone in the forum has solved 130 bits. It’s not feasible to brute force the entire key range. Consider how this could be possible.you have keys of evry 5 address.. good luck....

[0xastraeus]

Dear god there's no mysterious reason as to why the creator created outgoing transactions for those puzzles...

He knows there's multiple ways for solving these puzzles - Brute force and various pubkey algorithms (Pollard's Kangaroo has been around longer than the puzzle). He simply made it possible to test both scenarios.

And did you really just call RC "someone"... He is our lord and savior...

He didn't give it to us. Since you don't know, I'll explain. When there's a transfer, the decompressed public key is revealed. Simple as that.

This question solved entire puzzle.... WHY THE CREATOR GIVE US THE PUBLIC KEYS OF EVRY 5 PUZZLE? THINK ABOUT THAT.

you dont understand....why evry 5 address.....

If you know, tell us. If you don't know, don't make us use our minds for your own satisfaction.

  If you want to know, I can help, but I will not provide the answer directly. It’s important to think critically to solve this puzzle. Remember, someone in the forum has solved 130 bits. It’s not feasible to brute force the entire key range. Consider how this could be possible.you have keys of evry 5 address.. good luck....

[BlackAKAAngel]

Dear god there's no mysterious reason as to why the creator created outgoing transactions for those puzzles...

He knows there's multiple ways for solving these puzzles - Brute force and various pubkey algorithms (Pollard's Kangaroo has been around longer than the puzzle). He simply made it possible to test both scenarios.

And did you really just call RC "someone"... He is our lord and savior...

He didn't give it to us. Since you don't know, I'll explain. When there's a transfer, the decompressed public key is revealed. Simple as that.

This question solved entire puzzle.... WHY THE CREATOR GIVE US THE PUBLIC KEYS OF EVRY 5 PUZZLE? THINK ABOUT THAT.

you dont understand....why evry 5 address.....

If you know, tell us. If you don't know, don't make us use our minds for your own satisfaction.

  If you want to know, I can help, but I will not provide the answer directly. It’s important to think critically to solve this puzzle. Remember, someone in the forum has solved 130 bits. It’s not feasible to brute force the entire key range. Consider how this could be possible.you have keys of evry 5 address.. good luck....

  I dont have a lord or savior. No one for me...not one live person are lord not even death...i dont comment more... Good Luck

[kTimesG]

Remember, someone in the forum has solved 130 bits. It’s not feasible to brute force the entire key range.

RC wasn't even on the forums for years, even after he solved several puzzles. Just like out of a sudden some random account pops up and throws some advanced math out of nowhere. There are people working on.the problem, who never wrote a single word around here, and will most likely be the ones solving the next puzzle, all while we debunk the same repeating mystic BS strategies, between the posts with daily prefix catalog updates.

And it's totally feasible to brute-force the range. Feasible does not mean "cheap" or "for free on my garage PC during the weekend".

[SecretAdmirere]

I want to make a contribution to the daily prefix catalog:

PubAddress: 1PWo3JeBfSq2E613F9WLgQPRzKH4oQDBkC
Priv (WIF): p2pkh:KwcxmKEPUXsVfmbVBzdcUXDLxS2P8NLfe3tqmM95HaX2QrYfFHEZ
Priv (HEX): 0BF61DD51336CD5CB078AB940DEE9AE32C489DBBE2EE4F5BC1AAACC49DA368FC

PubAddress: 1PWo3JeBZy2RjasTjRUDporCoaDqsgMkUC
Priv (WIF): p2pkh:KwxCMMaA5zbXsDjDVXgW44vJvDabEkevAMGfkpm4itvopyFRv2Ak
Priv (HEX): 15DB316CED54BA97DBB9BA11DC0CEB4D7D25C1D5160512EA3E76BAC07F58069F

Who would have thought, so similar and yet so far away. Am i close?

[Jorge54PT]

I want to make a contribution to the daily prefix catalog:

PubAddress: 1PWo3JeBfSq2E613F9WLgQPRzKH4oQDBkC
Priv (WIF): p2pkh:KwcxmKEPUXsVfmbVBzdcUXDLxS2P8NLfe3tqmM95HaX2QrYfFHEZ
Priv (HEX): 0BF61DD51336CD5CB078AB940DEE9AE32C489DBBE2EE4F5BC1AAACC49DA368FC

PubAddress: 1PWo3JeBZy2RjasTjRUDporCoaDqsgMkUC
Priv (WIF): p2pkh:KwxCMMaA5zbXsDjDVXgW44vJvDabEkevAMGfkpm4itvopyFRv2Ak
Priv (HEX): 15DB316CED54BA97DBB9BA11DC0CEB4D7D25C1D5160512EA3E76BAC07F58069F

Who would have thought, so similar and yet so far away. Am i close?

No, my friend. You're not defining the range 4000000000000000000:7fffffffffffffffff. The private key only has 18 characters. The first character will be 4, 5, 6, 7 + 17 characters in HEX16 

[0xastraeus]

It's almost like he just proved that prefixes don't matter as you can find them anywhere on the curve like what many people have already been saying.

Once again they give ZERO indication how far or close you are to the target.

But people are set in their ways...

I want to make a contribution to the daily prefix catalog:

PubAddress: 1PWo3JeBfSq2E613F9WLgQPRzKH4oQDBkC
Priv (WIF): p2pkh:KwcxmKEPUXsVfmbVBzdcUXDLxS2P8NLfe3tqmM95HaX2QrYfFHEZ
Priv (HEX): 0BF61DD51336CD5CB078AB940DEE9AE32C489DBBE2EE4F5BC1AAACC49DA368FC

PubAddress: 1PWo3JeBZy2RjasTjRUDporCoaDqsgMkUC
Priv (WIF): p2pkh:KwxCMMaA5zbXsDjDVXgW44vJvDabEkevAMGfkpm4itvopyFRv2Ak
Priv (HEX): 15DB316CED54BA97DBB9BA11DC0CEB4D7D25C1D5160512EA3E76BAC07F58069F

Who would have thought, so similar and yet so far away. Am i close?

No, my friend. You're not defining the range 4000000000000000000:7fffffffffffffffff. The private key only has 18 characters. The first character will be 4, 5, 6, 7 + 17 characters in HEX16 

[Jorge54PT]

It's almost like he just proved that prefixes don't matter as you can find them anywhere on the curve like what many people have already been saying.

Once again they give ZERO indication how far or close you are to the target.

But people are set in their ways...

I want to make a contribution to the daily prefix catalog:

PubAddress: 1PWo3JeBfSq2E613F9WLgQPRzKH4oQDBkC
Priv (WIF): p2pkh:KwcxmKEPUXsVfmbVBzdcUXDLxS2P8NLfe3tqmM95HaX2QrYfFHEZ
Priv (HEX): 0BF61DD51336CD5CB078AB940DEE9AE32C489DBBE2EE4F5BC1AAACC49DA368FC

PubAddress: 1PWo3JeBZy2RjasTjRUDporCoaDqsgMkUC
Priv (WIF): p2pkh:KwxCMMaA5zbXsDjDVXgW44vJvDabEkevAMGfkpm4itvopyFRv2Ak
Priv (HEX): 15DB316CED54BA97DBB9BA11DC0CEB4D7D25C1D5160512EA3E76BAC07F58069F

Who would have thought, so similar and yet so far away. Am i close?

No, my friend. You're not defining the range 4000000000000000000:7fffffffffffffffff. The private key only has 18 characters. The first character will be 4, 5, 6, 7 + 17 characters in HEX16  

In the case of 71, being in the correct range is basic       Being close to the target is simple: and between 400000000000000000 to 700000000000000000    

[Cricktor]

In the case of 71, being in the correct range is basic       Being close to the target is simple: and between 400000000000000000 to 700000000000000000    

You apparently don't want to see that you're wrong again with the range yourself. Mindless full-quoting, little brain use and filling up the thread with noise (not only you).

How hard is it to get the puzzle #71's range right? Dudes, it's simple and precisely (trailing hex zeroes removed)
400000000000000000...7FFFFFFFFFFFFFFFFF

And SecretAdmirere failing to even search in the correct range is cherry poop on the cake, stupid worthless noise contribution here. I wonder if it's even worth to rant about it.

[IlhamCung23]

Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force.

The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key.
https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharing
Create a bin file for the KeyHunt-Cuda program:
py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin
BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin
Launching KeyHunt-Cuda
KeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin
Launching keyhunt
keyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff

The file xyz135_address.txt can be used to find the address.
https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharing

If you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally.

Let's find #135 together!

I may also have a public key database that's been reduced from 135 bits to 95 bits—yes, within the 95-bit range.
https://drive.google.com/file/d/1hrJYQ6fb-jmvbgeWCCQ_k_9XT_E_t1yK/view?usp=sharing
Send me a private message if you find the key.

[kind_user]

VanitySearch_extreme VanitySearch_extreme
Warning: 128 CPU threads may cause oversubscription and hurt performance.
Typical optimal range: 4-256 threads (physical cores).
Difficulty: 888446610539
Search: 1TESTFIX [Compressed]
Start Sat Mar 28 15:58:55 2026
Base Key: D54D37F739CD8C547E870D15D9F6727EA608F03932923089079FE8629DA8B8C1
Number of CPU thread: 8
GPU: GPU #0 NVIDIA GeForce RTX 3070 Ti (48x128 cores) Grid(3072x128)
GPU: GPU #1 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(2432x128)
[4961.99 Mkey/s][GPU 4598.27 Mkey/s][Total 2^37.09][Prob 15.1%][50% in 00:01:34][Found 0]

This is the code from anyone_future_again that he published for 5 min

As i see is working very good. Starting from 7500 Mkey/s and decrease until 4961Mkey/s. Is not perfect but as i tested is giving the best speed ever! I think i can tune the code, but i still test. So a range of 40 bits is finishing in 4 min.
Thanks anyone_future_again

[Jorge54PT]

In the case of 71, being in the correct range is basic       Being close to the target is simple: and between 400000000000000000 to 700000000000000000    

You apparently don't want to see that you're wrong again with the range yourself. Mindless full-quoting, little brain use and filling up the thread with noise (not only you).

How hard is it to get the puzzle #71's range right? Dudes, it's simple and precisely (trailing hex zeroes removed)
400000000000000000...7FFFFFFFFFFFFFFFFF

And SecretAdmirere failing to even search in the correct range is cherry poop on the cake, stupid worthless noise contribution here. I wonder if it's even worth to rant about it.

I didn't make a mistake in the range 4000000000000000000 to 7fffffffffffffffff ahahhahahahah , But I also got distracted by putting ....700000... in place the end 7fffffff.... ...... lolol ahahahahh. The guy is possibly using a program like Jean Luc's Vanity Search, which in the original doesn't have the option to set the range, or he's distracted like me. The leading zeros don't matter whether they exist or not  

[ik316m]

Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force.

The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key.
https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharing
Create a bin file for the KeyHunt-Cuda program:
py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin
BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin
Launching KeyHunt-Cuda
KeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin
Launching keyhunt
keyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff

The file xyz135_address.txt can be used to find the address.
https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharing

If you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally.

Let's find #135 together!

I may also have a public key database that's been reduced from 135 bits to 95 bits—yes, within the 95-bit range.
https://drive.google.com/file/d/19Fp1oBU9nPTqkztKlEdTV7CJYecam8Hl/view?usp=sharing
Send me a private message if you find the key.

How?? earlier you posted 67M Keys and the range was 105-108, and now 1.04M Keys and range is 95. Share your method of key subtraction.

[IlhamCung23]

Hello everyone! I've reduced the public key for puzzle #135 and created a database of 67 million public keys/addresses. I think I'm not the first, but no one has posted a database of public keys. This database contains two public keys/addresses in the 105-108 bit range (100000000000000000000000000:fffffffffffffffffffffffffffffff). This range is easier to brute-force.

The file xyz135rew_pub.txt can be used with keyhunt-Cuda and keyhunt in "xpoints" mode to find the public key.
https://drive.google.com/file/d/1OZQAwZjMUkfiySSr1GlQaYivY76uAUc3/view?usp=sharing
Create a bin file for the KeyHunt-Cuda program:
py pubkeys_to_xpoint.py xyz135rew_pub.txt xyz135rew_pub.bin
BinSort.exe 32 xyz135rew_pub.bin xyz135rew_pub_sort.bin
Launching KeyHunt-Cuda
KeyHunt-Cuda.exe -t 0 -r 400000 -g --gpui 0 --gpux 256,256 -m xpoints --coin BTC --range 100000000000000000000000000:fffffffffffffffffffffffffff -i xyz135rew_pub_sort.bin
Launching keyhunt
keyhunt.exe -m xpoint -R -f xyz135rew_pub.txt -n 65536 -t 32 -r 100000000000000000000000000:fffffffffffffffffffffffffff

The file xyz135_address.txt can be used to find the address.
https://drive.google.com/file/d/1HvlzxWtziYY4Ewd1GsDHplaG851KqrqC/view?usp=sharing

If you find the private key from the database, send me a message to email ciktaa@mail.ru or write me a private message on this website to find out how to contact you, and I'll recalculate it back into puzzle #135, and the funds will be split equally.

Let's find #135 together!

I may also have a public key database that's been reduced from 135 bits to 95 bits—yes, within the 95-bit range.
https://drive.google.com/file/d/1hrJYQ6fb-jmvbgeWCCQ_k_9XT_E_t1yK/view?usp=sharing
Send me a private message if you find the key.

How?? earlier you posted 67M Keys and the range was 105-108, and now 1.04M Keys and range is 95. Share your method of key subtraction.

I use key division, I'm pretty sure key #135 is an even number that can be divided by 2.

and earlier is not my post

[Cricktor]

I didn't make a mistake in the range 4000000000000000000 to 7fffffffffffffffff ahahhahahahah...

Yes, you did. Try counting zeroes and you'll realize that your range start already exceeds the end bound. It's not really important because if someone is serious, I'd expect and assume to get the range bounds right and use the proper tools. End of story for me...

If you need visual proof

Code:

4000000000000000000  (your range start)
7fffffffffffffffff   (your range end)

[clashroyalegrp]

Using a start point for searching a puzzle restricts us to the same bit range.

But using a constant end point and searching the rest sequentially gives us the advantage to stepping out multiple ranges.

This visualization shows puzzles 71 to 75 using the same constant end point.

Since we're relying almost on luck   , I prefer this approach… lol.

https://www.talkimg.com/images/2026/03/26/UvjKRq.gif

can you share the code?

[Jorge54PT]

I didn't make a mistake in the range 4000000000000000000 to 7fffffffffffffffff ahahhahahahah...

Yes, you did. Try counting zeroes and you'll realize that your range start already exceeds the end bound. It's not really important because if someone is serious, I'd expect and assume to get the range bounds right and use the proper tools. End of story for me...

If you need visual proof

Code:

4000000000000000000  (your range start)
7fffffffffffffffff   (your range end)

Yes, there's an extra zero. Oops. I apologize. I already said at the beginning of my posts that it would be the 1st character, 4, 5, 6, 7 plus 17 characters in HEX16. It was indeed my mistake how to expose the range  

//--------------------------------------------------------------------------------------------------------------------------------------------------
It's almost like he just proved that prefixes don't matter as you can find them anywhere on the curve like what many people have already been saying.

Once again they give ZERO indication how far or close you are to the target.

But people are set in their ways...

Quote from: Jorge54PT on March 28, 2026, 09:47:39 AM
Quote from: SecretAdmirere on March 28, 2026, 02:22:18 AM
I want to make a contribution to the daily prefix catalog:

PubAddress: 1PWo3JeBfSq2E613F9WLgQPRzKH4oQDBkC
Priv (WIF): p2pkh:KwcxmKEPUXsVfmbVBzdcUXDLxS2P8NLfe3tqmM95HaX2QrYfFHEZ
Priv (HEX): 0BF61DD51336CD5CB078AB940DEE9AE32C489DBBE2EE4F5BC1AAACC49DA368FC

PubAddress: 1PWo3JeBZy2RjasTjRUDporCoaDqsgMkUC
Priv (WIF): p2pkh:KwxCMMaA5zbXsDjDVXgW44vJvDabEkevAMGfkpm4itvopyFRv2Ak
Priv (HEX): 15DB316CED54BA97DBB9BA11DC0CEB4D7D25C1D5160512EA3E76BAC07F58069F

Who would have thought, so similar and yet so far away. Am i close? Shocked Huh Cool

No, my friend. You're not defining the range 4000000000000000000:7fffffffffffffffff. The private key only has 18 characters. The first character will be 4, 5, 6, 7 + 17 characters in HEX16  Grin

//---------------------------------------------------------------------------------------------------------------------------------------

[L_u_x]

[SELL/SWAP] 100M "Shared Net" DP Database for Puzzle #135 (DP28)

Hi hunters,

I have accumulated a database of 100,000,000 (100M) unique Distinguished Points for Puzzle #135 (Range 2¹³⁴ to 2¹³⁵).

Technical Specifications:

• Volume: 100,000,000 unique tame paths.
  
• Density: DP 28 (avg. 268M steps between points).
  
• Coverage: ~26.8 Quadrillion keys (8.5 quadrillion unique paths).
  
• Hardware: Generated on a 4x5090 Blackwell cluster.
  
• Compatibility: Standard binary format (40 bytes). Works with Etarkangaroo, Kangaroo, BitCrack.
  

Why you need this: The Multiplier Effect
Don't just mine. Multiply.
When you merge this 100M database into your local work, you are instantly expanding your "capture net."

The N² Math:
Every step your GPU makes is now checked against my 100,000,000 pre-calculated paths. You aren't just adding points; you are multiplying the effectiveness of your hardware. If you have your own 50M points, merging this will boost your total probability by 4x-9x instantly, without spending a single watt on electricity.


The "Shared Net" Strategy
I am selling this same file to multiple hunters for a low price.

• Skip the Grind: You bypass 200 days of 24/7 work on an RTX 4090.
  
• The Race: If your unique wild kangaroo hits one of these shared tame paths — you win the full 13.5 BTC prize.
  
• The Jackpot: If a collision was already found during generation, the first person to set the highest fee in the mempool wins. It’s the "Fastest Finger" game.
  

Price: $25 USDT/BTC
Swap: 1:1 for any unique 50M+ DP28 database.
Verification: I can provide a 10k point sample for verification (dist * G = X).

Stop digging with a spoon. Use a industrial-sized net.

PM me if interested.

[kTimesG]

I have accumulated a database of 100,000,000 (100M) unique Distinguished Points for Puzzle #135 (Range 2¹³⁴ to 2¹³⁵).

Your DPs are totally useless, unless one uses the exact same jump function as you did, and the exact same parameters for the jump table, range, and so on.

Spoiler alert: most likely one will never use the same parameters as you did, because from what you've hinted at, you used software that is not on-par with current, state of the art methods, so only someone who is mentally challenged would ever have any need for your DPs.

[L_u_x]

I have accumulated a database of 100,000,000 (100M) unique Distinguished Points for Puzzle #135 (Range 2¹³⁴ to 2¹³⁵).

Your DPs are totally useless, unless one uses the exact same jump function as you did, and the exact same parameters for the jump table, range, and so on.

Spoiler alert: most likely one will never use the same parameters as you did, because from what you've hinted at, you used software that is not on-par with current, state of the art methods, so only someone who is mentally challenged would ever have any need for your DPs.

You are absolutely right about the technical side — compatibility of jump functions and parameters is everything. That’s exactly why I stuck to the standard Pons jump function, which is the backbone of almost all current tools.

However, I’m a bit confused about your "state of the art" comment. I took that "old software," recompiled and optimized it specifically for the Blackwell architecture.

The result? A stable 40,000 MKeys/s (40 GKeys/s) on just 4x RTX 5090s.

If you know of any "state of the art" software that performs significantly better on this hardware, I’d be genuinely interested to learn. So, what are your speeds? Or are you just here to discuss my mental health?


If anyone has managed to push Blackwell even further than 10 GKeys/s per card, I’d be happy to discuss the implementation. I’m here for the math and the hunt, not for the drama. If you have a faster 'state of the art' setup, show us the numbers. It would be a great lesson for everyone."