Bitcoin puzzle transaction ~32 BTC prize to who solves it

[E36cat]

Where can I rent 500 GPUs for 3 months for this puzzle? Don't suggest providers like vast or clore or salad. I am interested in private deals only. Will pay in BTC or USDT.

if you would have money to rent 500 GPU`s for 3 months you would not be here trying to hunt a puzzle =)

[Raoufbelaalia]

Hi everyone,

I’m looking for some help studying two public keys that appear to be from the same reduced range (1 to 2¹³³). One of the keys has a known private key, while the second one doesn’t. Both public keys end with the same last five characters, which made me think there might be some relation worth looking into.

Here are the keys:

Public Key #1:
02881b5ee7e6d228c83465f8b8ae8cd7c745b75017fc3eb491a600c12936d9ae52
Private Key:
000000000000000000000000000000033e7665705359f04f28b88cf897c607c8

Public Key #2:
0257e0e2394b485de330d15bdf8c051c13565c0068005e68ba20ed091eee19ae52


I’m trying to understand whether there could be any mathematical connection between them, or if the second private key might be recoverable given the limited range. Any guidance or pointers from people experienced in key analysis would be appreciated.

Thanks in advance.

[kTimesG]

I’m trying to understand whether there could be any mathematical connection between them, or if the second private key might be recoverable given the limited range.

Exactly the same mathematical connection as the one between a carrot and a potato (they're both vegetables).

If you definitely 100% know that the second private key is in some contiguous range, and the range is 133 bits in size, it can be recovered. But if you are not 1000000% sure that its in a specific exact correct range, you will waste resources in vain, since a yes/no search in 133 bits is not possible, and the probabilistic one will outlive the human civilization (unless you stop it, but you'll never know if it was just about to find the solution).

[Raoufbelaalia]

I’m confident that the missing public key, or its inverse, lies somewhere inside this same range (1 to 2¹³³).

[kTimesG]

I’m confident that the missing public key, or its inverse, lies somewhere inside this same range (1 to 2¹³³).

Great, so now the interval is 134 bits, because you'd need to know whether you're dealing with range [1, 2**133) or (-2**133, 1] to pretend that it's a 133 bits range.

Let me guess: now you'd like to know how to quickly find its private key, correct?

[Raoufbelaalia]

Yes, i try bsgs and xpoint mode but i dont find anything

[kTimesG]

Yes, i try bsgs and xpoint mode but i dont find anything

That might probably happen because trying to solve such a problem, with the best known algorithms (RetiredCoder's approach) costs hundreds of thousands of $ just for the computational capacity, to reach 90% chances of success.

e.g. - in reality you need thousands of GPUs running non-stop for many months. Nevermind the orchestration party.

BSGS requires 2**67 items (key, indices) to be stored in RAM, and since that would take more than the total amount of storage on Earth, I'm doubtful that what you've done can even be called as running BSGS. Maybe more like "how to waste time on something that can never finish and for which resources cannot exist to even run, but better than brute-force".

[Torin Keepler]

🔥 A $200 Challenge Is Starting!

A competition is being launched.
The idea is very simple:

🔹 One of the Bitcoin addresses 1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy has been funded with $200.

🔹 In the near future, provided there are enough participants, a range will be announced within which the private key to this address is located.

🔹 The task for participants is to find this key.

The range is selected in such a way that, with a sufficient number of participants, the task can be solved fairly quickly through joint effort.

🎯 The purpose of the challenge is to test the efficiency of the software.

https://t.me/puzzle135/14976/15004

Has anyone heard anything about this puzzle challenge? Do you know what software will be used, whether the search is planned by address or by public key, and if this will be a solo attempt or a group effort?


The essence of this challenge is to use the most advanced software available today in open access. The core of the process is the Pollard algorithm. The work will be organized jointly. Each participant can search for the private key independently, but the program saves all progress into a file.

To increase the chances of finding the private key, participants are encouraged to upload their result files to this group. These files will be processed by a separate program, KeyAuditor, which is capable of calculating the private key even in the case of failure of an individual participant, by combining the progress of different users. This significantly increases the overall chance of finding the key.

You can also search for the private key directly using KeyAuditor if you carefully collect and save the files of other participants.

The main idea is to unite a large number of people to solve one puzzle while preserving the decentralization of the system and the absence of a single controlling center.

[Kermits Froggy]

Where can I rent 500 GPUs for 3 months for this puzzle? Don't suggest providers like vast or clore or salad. I am interested in private deals only. Will pay in BTC or USDT.

if you would have money to rent 500 GPU`s for 3 months you would not be here trying to hunt a puzzle =)

Sorry but I'm serious. Could provide proof of funds to GPU farms once we establish some terms. I have contacted Bram who solved couple of puzzles earlier and he mentioned in this thread that he'd connect with GPU farms he has used. But no reply from him on DMs.

Any help/connection would be much appreciated and could pay a finders fee after a successful sizeable deal.

[brainless]

Where can I rent 500 GPUs for 3 months for this puzzle? Don't suggest providers like vast or clore or salad. I am interested in private deals only. Will pay in BTC or USDT.

if you would have money to rent 500 GPU`s for 3 months you would not be here trying to hunt a puzzle =)

Sorry but I'm serious. Could provide proof of funds to GPU farms once we establish some terms. I have contacted Bram who solved couple of puzzles earlier and he mentioned in this thread that he'd connect with GPU farms he has used. But no reply from him on DMs.

Any help/connection would be much appreciated and could pay a finders fee after a successful sizeable deal.

Are you looking more cheap solution then vast rates ?
Vast don't offer big farm deals,

[Mushai]

🔥 A $200 Challenge Is Starting!

A competition is being launched.
The idea is very simple:

🔹 One of the Bitcoin addresses 1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy has been funded with $200.

🔹 In the near future, provided there are enough participants, a range will be announced within which the private key to this address is located.

🔹 The task for participants is to find this key.

The range is selected in such a way that, with a sufficient number of participants, the task can be solved fairly quickly through joint effort.

🎯 The purpose of the challenge is to test the efficiency of the software.

https://t.me/puzzle135/14976/15004

Has anyone heard anything about this puzzle challenge? Do you know what software will be used, whether the search is planned by address or by public key, and if this will be a solo attempt or a group effort?

For $200 who cares?

[Ovixx]

🔥 A $200 Challenge Is Starting!

A competition is being launched.
The idea is very simple:

🔹 One of the Bitcoin addresses 1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy has been funded with $200.

🔹 In the near future, provided there are enough participants, a range will be announced within which the private key to this address is located.

🔹 The task for participants is to find this key.

The range is selected in such a way that, with a sufficient number of participants, the task can be solved fairly quickly through joint effort.

🎯 The purpose of the challenge is to test the efficiency of the software.

https://t.me/puzzle135/14976/15004

Has anyone heard anything about this puzzle challenge? Do you know what software will be used, whether the search is planned by address or by public key, and if this will be a solo attempt or a group effort?

For $200 who cares?

Do you know what the stingy man does when he sees a quarter of a dollar coin on the sidewalk? he says: -It's not worth bending over for such a small gain. He takes a $10 bill out of his pocket, throws it on the floor next to the coin, and says, "For $10.25, it's worth!"

[Kermits Froggy]

Where can I rent 500 GPUs for 3 months for this puzzle? Don't suggest providers like vast or clore or salad. I am interested in private deals only. Will pay in BTC or USDT.

if you would have money to rent 500 GPU`s for 3 months you would not be here trying to hunt a puzzle =)

Sorry but I'm serious. Could provide proof of funds to GPU farms once we establish some terms. I have contacted Bram who solved couple of puzzles earlier and he mentioned in this thread that he'd connect with GPU farms he has used. But no reply from him on DMs.

Any help/connection would be much appreciated and could pay a finders fee after a successful sizeable deal.

Are you looking more cheap solution then vast rates ?
Vast don't offer big farm deals,

Yes. People who cracked earlier puzzles mentioned bulk private deals as cheap as vast interruptible prices. For 3090/4090 GPUs. On vast, it's easier to get 50-100 of them at that prices. Getting more would need us to increase bid value. All enterprise deals on vast are priced and discounted based on on-demand price.

[Torin Keepler]

🔥 A $200 Challenge Is Starting!

A competition is being launched.
The idea is very simple:

🔹 One of the Bitcoin addresses 1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy has been funded with $200.

🔹 In the near future, provided there are enough participants, a range will be announced within which the private key to this address is located.

🔹 The task for participants is to find this key.

The range is selected in such a way that, with a sufficient number of participants, the task can be solved fairly quickly through joint effort.

🎯 The purpose of the challenge is to test the efficiency of the software.

https://t.me/puzzle135/14976/15004

Has anyone heard anything about this puzzle challenge? Do you know what software will be used, whether the search is planned by address or by public key, and if this will be a solo attempt or a group effort?

For $200 who cares?

The point of this challenge is not the $200 itself, but the approach behind it.
I want to demonstrate what I believe is currently the most effective publicly available method for working on Puzzle #135. The reward is simply a way to motivate participation, while the real goal is to showcase the efficiency of the technique.

[kTimesG]

The point of this challenge is not the $200 itself, but the approach behind it.
I want to demonstrate what I believe is currently the most effective publicly available method for working on Puzzle #135. The reward is simply a way to motivate participation, while the real goal is to showcase the efficiency of the technique.

Post some numbers, otherwise for $200 no one (serious) cares.

A faster speed with a higher complexity is not always better than a lower speed with lower complexity. Pollard Rho is not adequate for solving an IDLP, so usually one would stop reading when this gets mentioned as "efficient". Because it's not.

[Torin Keepler]

The point of this challenge is not the $200 itself, but the approach behind it.
I want to demonstrate what I believe is currently the most effective publicly available method for working on Puzzle #135. The reward is simply a way to motivate participation, while the real goal is to showcase the efficiency of the technique.

Post some numbers, otherwise for $200 no one (serious) cares.

A faster speed with a higher complexity is not always better than a lower speed with lower complexity. Pollard Rho is not adequate for solving an IDLP, so usually one would stop reading when this gets mentioned as "efficient". Because it's not.

This will be a modified version of the RCKangaroo program with several efficiency improvements, including saving the traversal path and checkpoint data for further analysis. I have also developed a separate tool, KeyAuditor, which analyzes these checkpoint files and calculates the private key if a collision is detected.

Later we will test my version; I will announce the public key and the range a bit later — the range will not be too difficult, so we can properly test my fork within this challenge. I would also like to warn that using other programs will not allow you to claim the prize. I will explain the reason for that later.

In this way, we can significantly increase the probability of finding the private key by detecting collisions between different participants. Moreover, the collision analysis can be performed in a decentralized manner by any participant. All that is required is to maintain a parallel database of checkpoint files.
I would also like to note that the search range for the private key is not very large, so the search process will not take long.

The DP value will be set to 30, which means the size of the checkpoint database will not be too large.

https://www.blockchain.com/explorer/addresses/btc/1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy
https://t.me/puzzle135/14976

[brainless]

The point of this challenge is not the $200 itself, but the approach behind it.
I want to demonstrate what I believe is currently the most effective publicly available method for working on Puzzle #135. The reward is simply a way to motivate participation, while the real goal is to showcase the efficiency of the technique.

Post some numbers, otherwise for $200 no one (serious) cares.

A faster speed with a higher complexity is not always better than a lower speed with lower complexity. Pollard Rho is not adequate for solving an IDLP, so usually one would stop reading when this gets mentioned as "efficient". Because it's not.

This will be a modified version of the RCKangaroo program with several efficiency improvements, including saving the traversal path and checkpoint data for further analysis. I have also developed a separate tool, KeyAuditor, which analyzes these checkpoint files and calculates the private key if a collision is detected.

Later we will test my version; I will announce the public key and the range a bit later — the range will not be too difficult, so we can properly test my fork within this challenge. I would also like to warn that using other programs will not allow you to claim the prize. I will explain the reason for that later.

In this way, we can significantly increase the probability of finding the private key by detecting collisions between different participants. Moreover, the collision analysis can be performed in a decentralized manner by any participant. All that is required is to maintain a parallel database of checkpoint files.
I would also like to note that the search range for the private key is not very large, so the search process will not take long.

The DP value will be set to 30, which means the size of the checkpoint database will not be too large.

https://www.blockchain.com/explorer/addresses/btc/1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy
https://t.me/puzzle135/14976

In short words
You are trying to collect from 100s gpu holder, work of dp for your database, where you check privatekey for 135 puzzle and try to win 13.5 btc against 200 $
May I right ?

[Torin Keepler]

The point of this challenge is not the $200 itself, but the approach behind it.
I want to demonstrate what I believe is currently the most effective publicly available method for working on Puzzle #135. The reward is simply a way to motivate participation, while the real goal is to showcase the efficiency of the technique.

Post some numbers, otherwise for $200 no one (serious) cares.

A faster speed with a higher complexity is not always better than a lower speed with lower complexity. Pollard Rho is not adequate for solving an IDLP, so usually one would stop reading when this gets mentioned as "efficient". Because it's not.

This will be a modified version of the RCKangaroo program with several efficiency improvements, including saving the traversal path and checkpoint data for further analysis. I have also developed a separate tool, KeyAuditor, which analyzes these checkpoint files and calculates the private key if a collision is detected.

Later we will test my version; I will announce the public key and the range a bit later — the range will not be too difficult, so we can properly test my fork within this challenge. I would also like to warn that using other programs will not allow you to claim the prize. I will explain the reason for that later.

In this way, we can significantly increase the probability of finding the private key by detecting collisions between different participants. Moreover, the collision analysis can be performed in a decentralized manner by any participant. All that is required is to maintain a parallel database of checkpoint files.
I would also like to note that the search range for the private key is not very large, so the search process will not take long.

The DP value will be set to 30, which means the size of the checkpoint database will not be too large.

https://www.blockchain.com/explorer/addresses/btc/1NYgvjFGSCZvb7RELypgEocYRLGCa7LyHy
https://t.me/puzzle135/14976

In short words
You are trying to collect from 100s gpu holder, work of dp for your database, where you check privatekey for 135 puzzle and try to win 13.5 btc against 200 $
May I right ?

You understood the general idea, but not entirely correctly. I am only aiming for a small fraction of the 135-puzzle reward. The main share will go to the participants whose checkpoints collide, as well as to those who contribute a large amount of work even if they are not part of the final collision.

And to answer your next question in advance: yes, the large pool for Puzzle 135 already exists, and the database is substantial. However, this does not affect your ability to win the $200 challenge, which—according to my estimates—will take around seven days.

I would also like to emphasize that the core idea is decentralization. There is no central server and no central authority controlling the process. Anyone can maintain their own copy of the challenge database and independently check it for collisions in parallel.

Yes, there are certain mechanisms in place to protect all participants from the risk of someone attempting to steal the private key the moment it is discovered. But that is a separate topic for discussion.

[BlackAKAAngel]

To all puzzle hunters of Puzzle 71: It starts with the number 7 and consists of 4 letters and 5 numbers—2 small numbers and 3 larger numbers. If you have strong equipment, you have the key for a couple of days.Don't ask how i know that just try and don't forget me if this help you just say Hallo.....

[Torin Keepler]

To all puzzle hunters of Puzzle 71: It starts with the number 7 and consists of 4 letters and 5 numbers—2 small numbers and 3 larger numbers. If you have strong equipment, you have the key for a couple of days.Don't ask how i know that just try and don't forget me if this help you just say Hallo.....

Puzzle #71 is at least four times more difficult than Puzzle #135.
Because of that, there is no practical reason to focus on solving #71, especially considering that its reward is much smaller.
It makes far more sense to work on Puzzle #135 first.