Bitcoin puzzle transaction ~32 BTC prize to who solves it

[brainless]

I’ve been testing some of the older/easier puzzles using three different rigs with a VanitySearch mod one fast, one medium, and one painfully slow. What’s interesting is how big the luck component is once you’re searching large spaces. What I mean is the fast machine doesn't always solve the puzzle the fastest or even at a predictable lead or gap ahead than the others. Luck, for lack of a better word, seems to matter more then pure guesses once you get up to the larger spaces.

I highly disagree. If you run those puzzles over long runs (thousands of tries) you will find the solution sooner or later every single time, but, on average, it is very clear that what emerges is the expected average solve time (relative to a rig's speed of course) which is right at 50% of maximum work needed. And that expected average solve time will naturally double up for every incremental puzzle, it is not jumping all over the place, as you suggest. Thus, the "luck factor" as you call it, also halves every time the search space doubles.

Hi, do you scaning right now ? and if it's not secret, on which range you scanning ?

When brute force methods in development, I recommend batch jump for random  search, still after 7 years there is no development in this little tweak in all apps, still single digit random or wise versa,
Check and stride subject could by used with math for finding 71 and above
Still option available with little modified bitcrack and 5090 gpu and 71 could come out with 3 to 7 days
Think out of the box

i am using jumps with random, i just set first 2 symbols, for example 4f, all others is random + speed of my GPU * time of scanning
BUT you said 5090 and #71 3-7 days, its impossible, or need too much lucky.
OR it was means x5090 GPUs ?)))

I did not say random
I said numbers of key check and stride mean jump
Plus calc math methods

Ok, let's suppose you have a tool (a modified VanitySearch) that works with an option for stride, what would be you're search strategy, if I may ask?

Math + modified bitcrack + 5096 gpu

[Al-Kindi]

The inventor of this puzzles name is In this hash 41932e0d52a2b1e171d28f6b442981137790bcbf1d72201bea441f36fd7ba67b I just want to say, Hi, ⁤⁣⁤‍⁡‍‍⁣‍⁡‌⁢‍⁤⁡⁢⁡‍⁡‍⁢⁣‍‌‍⁢‍⁤⁡⁢⁡⁢⁡‍‌‌⁡‍‌‍⁢‍⁡‌⁡‌⁡⁤‍⁤⁡⁤⁣‌⁢‌⁡‍‍‌⁢‍⁤⁡⁢‍⁢⁡‍‌‌⁡‌⁡‌⁢‍⁤⁡⁢‍⁡⁢‍⁤⁡⁢⁡⁢⁡‍‍⁣‍⁡⁤‍⁤⁡⁢‍⁣‌⁡⁤‍‌‍Hello

Having that person be the author (big fan of him) kind of hurts the case of my pet project which had great potential - do you have hard evidence?

[Tshiwh]

Let me clarify
Ecc operations have 1 bit only
Your 1 move is 0, so you can't take step for reverse , mean if you step back or fw is 0
Example
If you give me any of your pubkey, I will extract 1 bit and give you back new pubkey
You can test yourself
My given pubkey by extract 1 bit
You will substract you key, , multiply by xxxxxx,
You will see new pubkey back at first pubkey
You repeats unlimited counts
Always you backed at 1st pubkey
Mean 1 bit loop never let you move anywhere

Tried to build X pubkey 135 using GX as started point, done the calculations manually for the whole 64byts, GX * I to get first 4bits of the pubkey, then i*16 (±31) * GX to get second 4bit .....
After ending with X1 wich is egal to X extended to 500±bits then (X1/64**16)/GX = exactly GX/X
So key that should be explored is the ±31 or maybe should be reduced to ±16 to get hex value from 0 to f

[fecell]

Let me clarify
Ecc operations have 1 bit only
Your 1 move is 0, so you can't take step for reverse , mean if you step back or fw is 0
Example
If you give me any of your pubkey, I will extract 1 bit and give you back new pubkey
You can test yourself
My given pubkey by extract 1 bit
You will substract you key, , multiply by xxxxxx,
You will see new pubkey back at first pubkey
You repeats unlimited counts
Always you backed at 1st pubkey
Mean 1 bit loop never let you move anywhere

Tried to build X pubkey 135 using GX as started point, done the calculations manually for the whole 64byts, GX * I to get first 4bits of the pubkey, then i*16 (±31) * GX to get second 4bit .....
After ending with X1 wich is egal to X extended to 500±bits then (X1/64**16)/GX = exactly GX/X
So key that should be explored is the ±31 or maybe should be reduced to ±16 to get hex value from 0 to f

nice try.

my result is (python with ice256):

[27,535] 0.00% S: 307492.2 p/s, E: 13:26:34, TE: 24d 17:28:25, ETA: 1596914983724989361460084736y 8m 6d 13:32:48

interesting. 27k iteration, with 24days, with 23m each reduce hugiiliard years. (was 176.... at start)

[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.

[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.