Bitcoin puzzle transaction ~32 BTC prize to who solves it

[mcdouglasx]

If this challenge never existed, I would have never tried out the elliptic curve cryptography, SHA-256, RIPEMD-160, C/C++, CUDA.  And knowing the odds are against you with limited hardware or unlimited hardware, it makes it even more thrilling.  So the fun and learning aspects with a very very tiny possibility of finding a private key to some address, it is worth it.

So at least to me, it is very much "alive".

If you look at it from a pedagogical point of view, yes, but if you look at it from a competitive point of view, to increase your chances, you need a huge financial investment, like RC or others. But most people here talk about top speeds, kernels, achievements, and don't publish code, which makes me think they're still stuck in the competitive trap of blind hope, and not in sharing their ideas.

Let's be honest, if you use farms, sharing fast code puts you at a disadvantage, but if you're here purely for leisure, I don't see the point in not sharing the code for those supposed "achievements".

[SecretAdmirere]

If you look at it from a pedagogical point of view, yes, but if you look at it from a competitive point of view, to increase your chances, you need a huge financial investment, like RC or others. But most people here talk about top speeds, kernels, achievements, and don't publish code, which makes me think they're still stuck in the competitive trap of blind hope, and not in sharing their ideas.

Let's be honest, if you use farms, sharing fast code puts you at a disadvantage, but if you're here purely for leisure, I don't see the point in not sharing the code for those supposed "achievements".

True, very true.  To increase the chance, it is either a huge financial investment for computing power, a mathematical-algorithmic advantage that still requires a huge financial investment for computing power, or one GPU luck - highly unlikely, by an order of magnitude unlikely, like throwing a dart from the moon and aiming to hit a grain of sand on Earth unlikely.  But anyway, we all know that.

In my case, the code I am working on is not ready for publishing, and I am not even confident enough to publish it.  No matter how many tests I run, I am not confident enough that it is good and correct.  Even now, when it passes all of the tests I can think of, I am always thinking "What if that, when this, will give the expected result".  So for now, it is only for personal use and development.  Also, I am new to all of this.  I would not even know where to begin.  It would require a lot of work to make it somewhat widely usable and not architectural and CUDA version specific.  What runs great on one GPU architecture does not necessarily run the best on a different one.  The use of newer CUDA versions will not compile for older CUDA versions, and I am working with CUDA 13 and using features like "enable_smem_spilling" that were introduced in CUDA 13, which is useless for me since I have a compute capability 8.6 compile to 122 registers used and 0 spills while everything is fully inlined, but that is just an example of how newer CUDA features would require rewriting to make it compilable in older CUDA versions.  Or I could simply publish it as "Ampere specific CUDA 13 - this is the performance".  I would also need access to a lot of different GPUs, which I cannot have at the moment (financially, I cannot have them), so I am stuck with compute capability 8.6, more specifically, a 3070 Ti.

So I do not know, maybe one day.  Or maybe I am just complaining too much now?  You are correct on all of the things you mentioned.  But I still enjoy coding, gaining knowledge, and looking at those Mkey/s numbers.

[WanderingPhilospher]

...

When creator or whoever topped up puzzles #1, #066-#160 with 872.19BTC, worth around ~26.4 million $$, that's an exchange rate of ~30,286$/BTC, their investment to amplify puzzle's prizes was already quite huge.

And you guys seriously hope or ask for more, at now a little more than double the exchange rate? Hilarious...

I took the liberty to fix the topic's text, at least for my own post.

and PKH is
F6E712D61FD09E6B7FF56D659CB37B0CE27070BA

How does this hex private key fall in the 2⁷⁰ bit range for puzzle #71?

Maybe I had too much bear already, but I can't even get your public key from this PK.

If you considering puzzle 70 fund with 7.0 and puzzle 71 with 7.1, remember it's symbolically assign, in actual puzzle 71 have double bit range then puzzle 70,
2nd if see behind solved puzzle 115 by zeiller and JLP, they used 1000 gpu 2080ti,  that time to now , new hardware 5090ti and prices hike more then 10x, electricity cost and other expenses also hike more then 10x , and same time example unsolved 135 from 130 bit range 32x
If we assume puzzle 130 solved by 1000 gpu 4090ti , at same level 32x hardware's approximately 32000 gpu cost and time and electricity etc all more then 32x,
Please reconsider calculate, these facts in my view effect for finding and making distance between people's and puzzle

Where did you come up with 135 from 130 bit range is 32x? If you are using brute force, sure, but using kangaroo, it's more like 5.65x, no?

[brainless]

...

When creator or whoever topped up puzzles #1, #066-#160 with 872.19BTC, worth around ~26.4 million $$, that's an exchange rate of ~30,286$/BTC, their investment to amplify puzzle's prizes was already quite huge.

And you guys seriously hope or ask for more, at now a little more than double the exchange rate? Hilarious...

I took the liberty to fix the topic's text, at least for my own post.

and PKH is
F6E712D61FD09E6B7FF56D659CB37B0CE27070BA

How does this hex private key fall in the 2⁷⁰ bit range for puzzle #71?

Maybe I had too much bear already, but I can't even get your public key from this PK.

If you considering puzzle 70 fund with 7.0 and puzzle 71 with 7.1, remember it's symbolically assign, in actual puzzle 71 have double bit range then puzzle 70,
2nd if see behind solved puzzle 115 by zeiller and JLP, they used 1000 gpu 2080ti,  that time to now , new hardware 5090ti and prices hike more then 10x, electricity cost and other expenses also hike more then 10x , and same time example unsolved 135 from 130 bit range 32x
If we assume puzzle 130 solved by 1000 gpu 4090ti , at same level 32x hardware's approximately 32000 gpu cost and time and electricity etc all more then 32x,
Please reconsider calculate, these facts in my view effect for finding and making distance between people's and puzzle

Where did you come up with 135 from 130 bit range is 32x? If you are using brute force, sure, but using kangaroo, it's more like 5.65x, no?

No
Let me explain you again
70 bit  10 people's run kangaroo, everyone get key on same hardware gpu but find times are different even in millisecond
That's not fixed, exact,
Bc kangaroo finding depand on hope, same you extend bit range too 100 bit and same 10 people's same 10 hardware, everyone calc in different time frame
Finally we will calculate time zone by complete bit range
Next example
70 bit could find by kangaroo in 1 min reward is 7.0 btc
And 140 bit rewards is 14.0 btc but bit range is multibillions size more then 70 bit range
In previous finding 115 to 130
Solver claimed used 1000 and more gpu farms to run months for finding definitely use kangaroo type formulation
But no one can say their exact time for completetion of kangaroo jobs, but can tell calculate time after finding
At currently puzzle 71 and puzzle 135 in front of all
Kangaroo can't apply to 71, next calc 71 reward is 7.1btc not a double from puzzle 70 rewards, (but range double then 70 bit range) and doest not matter creator funded 1000 btc,
99 % people will follow, brute force, like lottery winning, it's kill soul of btc cracking strength by community words
1% will apply strategy inside brute force, by calc some areas of total bit range to find by scanning specific areas
Could write more in all aspects but hope these words have meaning

[kTimesG]

Where did you come up with 135 from 130 bit range is 32x? If you are using brute force, sure, but using kangaroo, it's more like 5.65x, no?

No
Let me explain you again

Yes. Because c * sqrt(x * 32) / (c * sqrt(x)) is always going to end up as 5.65.

[brainless]

Where did you come up with 135 from 130 bit range is 32x? If you are using brute force, sure, but using kangaroo, it's more like 5.65x, no?

No
Let me explain you again

Yes. Because c * sqrt(x * 32) / (c * sqrt(x)) is always going to end up as 5.65.

Equation is fixed if we need answer of equation, but when finding by hope first it's need complete the 5.65, (100%) then it will take 500% till to generate hope and finding
Example
81 /9 both have same sqrt for... Every one could do it in 1/1000 sec
If it's
81 / 13 every one get different time zone for result, due to floating point also takes times to process
Simple open your installed kangaroo tool search 70bit 3 different pubkeys
Counts every searched pubkey with 3 data, total time, total hope, total %  in +- 2^35
You will get answer in practical in your hand

[brainless]

Where did you come up with 135 from 130 bit range is 32x? If you are using brute force, sure, but using kangaroo, it's more like 5.65x, no?

No
Let me explain you again

Yes. Because c * sqrt(x * 32) / (c * sqrt(x)) is always going to end up as 5.65.

Equation is fixed if we need answer of equation, but when finding by hope first it's need complete the 5.65, (100%) then it will take 500% till to generate hope and finding
Example
81 /9 both have same sqrt for... Every one could do it in 1/1000 sec
If it's
81 / 13 every one get different time zone for result, due to floating point also takes times to process
Simple open your installed kangaroo tool search 70bit 3 different pubkeys
Counts every searched pubkey with 3 data, total time, total hope, total %  in +- 2^35
You will get answer in practical in your hand

More
If 5.65 fixed result
Example RC use 1000 gpu 4090ti for 3 month get result for 13.0 btc and save 3 btc after all expence
Now 5650 gpu for 3 month if resulted and get 13.5 btc, could you calc cost of operation
Hope you understand operation and reward,
For these reason we request Creator to build up some better reward,

[kTimesG]

If 5.65 fixed result...

It's not an "if", it's the square root of the value 32 (the result of the proportion of difficulties).

Hope is an exact number, it's exactly "c * sqrt(space)" to reach 50% chance of success (also called "on average"). This number reaches infinity as you approach 100% (which is never reachable for a non-deterministic algorithm).

It doesn't matter if you do the computations on paper, on 1 GPU, on 10.000 ASICs, or in your brain. The difficulty increase factor, on average, between two keyspaces having a proportion of 32, is the square root.