Bitcoin puzzle transaction ~32 BTC prize to who solves it

[nomachine]

Yes, there are some bugs. But the biggest stupidity is that such a program does not support all GPU cards. I mean AMD graphics. I have a pile of Radeon cards that are useless.  

You can run Nvidia CUDA applications natively on Radeon GPUs

https://github.com/vosen/ZLUDA/tree/9e56862ebb5a3273b9849eabbd3e0eac9548922c

The code that was previously here has been taken down at AMD's request but there are 597 forks of the repo  

[brainless]

Information!!!!
As per above discussion and blam on developers unfair
They provide you best freeware
Only mindset at public they want ready to eat
They don't have ability to create such app not able to apply math, nor able to apply brain
How they can use such app
Let me give u 1 more tip
Don't use start to end full bit range
Example
134bit to 135bit don't use
What to use
Split 135bit in parts of 70bit to 100 bits for run kangaroo in between, depand your gpu power
Or
Generate random number in 135 bit range and to set +100 bit for adjust range for checking key
A = 135 random generator
B = a+ 100bit range
Adjust a and b in your kangaroo command
Hope above small tips help you for use kangaroo and such app,
It's also help your mindset of kangaroo 125bit max etc
Enjoy!!!

[gygy]

Information!!!!
As per above discussion and blam on developers unfair
They provide you best freeware
Only mindset at public they want ready to eat
They don't have ability to create such app not able to apply math, nor able to apply brain
How they can use such app
Let me give u 1 more tip
Don't use start to end full bit range
Example
134bit to 135bit don't use
What to use
Split 135bit in parts of 70bit to 100 bits for run kangaroo in between, depand your gpu power
Or
Generate random number in 135 bit range and to set +100 bit for adjust range for checking key
A = 135 random generator
B = a+ 100bit range
Adjust a and b in your kangaroo command
Hope above small tips help you for use kangaroo and such app,
It's also help your mindset of kangaroo 125bit max etc
Enjoy!!!

Somewhat this approach can work (I was thinking about it too), but kangaroo is a probability algorithm, meaning it never finishes a range. You can never rule out a range. The only thing you can do is to search for a while and if you think you searched enough you try to search another range.

** diamond mining meme **

[kTimesG]

Information!!!!
As per above discussion and blam on developers unfair
They provide you best freeware
Only mindset at public they want ready to eat
They don't have ability to create such app not able to apply math, nor able to apply brain
How they can use such app
Let me give u 1 more tip
Don't use start to end full bit range
Example
134bit to 135bit don't use
What to use
Split 135bit in parts of 70bit to 100 bits for run kangaroo in between, depand your gpu power
Or
Generate random number in 135 bit range and to set +100 bit for adjust range for checking key
A = 135 random generator
B = a+ 100bit range
Adjust a and b in your kangaroo command
Hope above small tips help you for use kangaroo and such app,
It's also help your mindset of kangaroo 125bit max etc
Enjoy!!!

Somewhat this approach can work (I was thinking about it too), but kangaroo is a probability algorithm, meaning it never finishes a range. You can never rule out a range. The only thing you can do is to search for a while and if you think you searched enough you try to search another range.

Don't fall for that guy, first he tells us to use our brain, than he offers the most idiotic advice in the Universe, splitting the range.

Ops needed if range split in N parts: N * sqrt(rangeSize)
Ops needed if range not split: sqrt(N * rangeSize) == sqrt(N) * sqrt(rangeSize)
Runtime increase if range is split: N / sqrt(N) == sqrt(N)

If 135 range is split into parts of 100, then it's 185363 times slower than if the 135 range is searched without splitting.

[brainless]

Information!!!!
As per above discussion and blam on developers unfair
They provide you best freeware
Only mindset at public they want ready to eat
They don't have ability to create such app not able to apply math, nor able to apply brain
How they can use such app
Let me give u 1 more tip
Don't use start to end full bit range
Example
134bit to 135bit don't use
What to use
Split 135bit in parts of 70bit to 100 bits for run kangaroo in between, depand your gpu power
Or
Generate random number in 135 bit range and to set +100 bit for adjust range for checking key
A = 135 random generator
B = a+ 100bit range
Adjust a and b in your kangaroo command
Hope above small tips help you for use kangaroo and such app,
It's also help your mindset of kangaroo 125bit max etc
Enjoy!!!

Somewhat this approach can work (I was thinking about it too), but kangaroo is a probability algorithm, meaning it never finishes a range. You can never rule out a range. The only thing you can do is to search for a while and if you think you searched enough you try to search another range.

Don't fall for that guy, first he tells us to use our brain, than he offers the most idiotic advice in the Universe, splitting the range.

Ops needed if range split in N parts: N * sqrt(rangeSize)
Ops needed if range not split: sqrt(N * rangeSize) == sqrt(N) * sqrt(rangeSize)
Runtime increase if range is split: N / sqrt(N) == sqrt(N)

If 135 range is split into parts of 100, then it's 185363 times slower than if the 135 range is searched without splitting.

Dear
Without experiment speak is unfair,
First I explain for problem inside kangaroo where 125bit ...
Ihow to use.. for those who really want use kangaroo
2nd question
Rule out of range
For your test experiment
Generate 41 bit range public key
Set kangaroo command in between 39 to 40 bit range
You will found 41 bit range key out of range

Here in my view when you set command as per my said example above message
You set command is small portion of between 134bit to 135 bit and her your 125 bit problem will solve also your out of range is still under 134 to 135bit,
Don't worry you are not jumping out of 135bit range
Think again or get experience advice from senior developers those have these kind of tests
Don't be judged to quick 

[digitalbear]

Dear
Without experiment speak is unfair,
First I explain for problem inside kangaroo where 125bit ...
Ihow to use.. for those who really want use kangaroo

Can you please provide a script that is solving for example a random 2^35 range and adding 100 bits to check 2^135 key for puzzle 135?
But ((2^135)-(2^134))/2^35 = 633825300114114700748351602688 ranges of 2^35

I tried with chatgpt but did not got a good script, also speed was only about 2000 hops/s from original script where I have about 180000 h/s
Or you can send me to PM if you don't want to share public and I promise to reward you if I'll be able to solve the key using your idea

Thank you

[viljy]

I have more and more doubts that some geniuses are solving the puzzle. In my opinion, starting from the 120bit solution, the creator does all this. To keep the interest in his mystery alive. If you compare the sequence of events (dates of decisions, increase in the prize), then everything adds up to a logical picture. Now it is more profitable to use computing power for the inference of neural networks, for their training, rather than for searching for a needle in a haystack with an unknown result. And here you need very large computing power, which will cost a lot to rent.

[brainless]

Dear
Without experiment speak is unfair,
First I explain for problem inside kangaroo where 125bit ...
Ihow to use.. for those who really want use kangaroo

Can you please provide a script that is solving for example a random 2^35 range and adding 100 bits to check 2^135 key for puzzle 135?
But ((2^135)-(2^134))/2^35 = 633825300114114700748351602688 ranges of 2^35

I tried with chatgpt but did not got a good script, also speed was only about 2000 hops/s from original script where I have about 180000 h/s
Or you can send me to PM if you don't want to share public and I promise to reward you if I'll be able to solve the key using your idea

Thank you

I will post script, in few hours, I am faraway from my desktop system, upon reach I will post

[AlanJohnson]

Dear
Without experiment speak is unfair,
First I explain for problem inside kangaroo where 125bit ...
Ihow to use.. for those who really want use kangaroo

Can you please provide a script that is solving for example a random 2^35 range and adding 100 bits to check 2^135 key for puzzle 135?
But ((2^135)-(2^134))/2^35 = 633825300114114700748351602688 ranges of 2^35

I tried with chatgpt but did not got a good script, also speed was only about 2000 hops/s from original script where I have about 180000 h/s
Or you can send me to PM if you don't want to share public and I promise to reward you if I'll be able to solve the key using your idea

Thank you

I will post script, in few hours, I am faraway from my desktop system, upon reach I will post

Digaran strikes again !

[kTimesG]

Dear
Without experiment speak is unfair,
First I explain for problem inside kangaroo where 125bit ...
Ihow to use.. for those who really want use kangaroo

Do you even understand what you are talking about? Anyway, good luck with your plan, I'm not gonna bother making drawings for you!

[karrask]

Good afternoon, friends. I have one question - in which programming language is there the fastest algorithm for obtaining a non-compression public key from a hexadecimal value? Can someone share it? it is needed for speed like kangaroo or keyhant. exactly, only obtaining a non-compression public key without any other functions. and yet - any interval can be reduced by 20-30%, perhaps more, I have succeeded so far.

[COBRAS]

28cde60e3110e002321ce9000000000000 514760
27560a1669d5ee086d36112e0000000000 545000
19e90c65037689ea4cefbd10ecc0000000 800000
183a40986d2205014dc12a580000000000 88e400
175b15fd4ed7055500d81a335000000000 8e0000
15d6c33dae17744949b1ba000000000000 97dcf0
15d1b9986eb4aa08ac93fd878400000000 980000
1466f30718887001190e74800000000000 a28ec0
13ab050b34eaf704369b08970000000000 a8a000

126402baad8d039c0829e0000000000000 b4565d,  85 priv - new low



0x33d218ca06ed13d499df7a21d98,  105 priv

my target 2^60

... to be continue

[Gord0nFreeman]

I have more and more doubts that some geniuses are solving the puzzle. In my opinion, starting from the 120bit solution, the creator does all this. To keep the interest in his mystery alive. If you compare the sequence of events (dates of decisions, increase in the prize), then everything adds up to a logical picture. Now it is more profitable to use computing power for the inference of neural networks, for their training, rather than for searching for a needle in a haystack with an unknown result. And here you need very large computing power, which will cost a lot to rent.

I've been saying this for a long time, but people keep rushing blindly, like a donkey chasing a carrot! Puzzles 120, 125, 130 have all been emptied by the creator, and possibly Puzzle 66 as well, intercepted by him to cover his tracks. Puzzle 66 was broadcast just moments before the next block was mined.

[nomachine]

Good afternoon, friends. I have one question - in which programming language is there the fastest algorithm for obtaining a non-compression public key from a hexadecimal value? Can someone share it? it is needed for speed like kangaroo or keyhant. exactly, only obtaining a non-compression public key without any other functions. and yet - any interval can be reduced by 20-30%, perhaps more, I have succeeded so far.

There is no programming language on planet Earth or trick that can drastically speed up Bitcoin key generation or hashing (SHA-256, RIPEMD-160) .
Any perceived speed improvements, like in kangaroo or KeyHunt, come from optimization techniques for specific tasks, not from changing the core cryptographic functions.
Reducing the search interval (as mentioned above) can help focus efforts, but it doesn't change the time it takes to compute each key or hash.
Using multiple threads or GPUs (parallelization) can improve the throughput of key generation but not the speed of individual computations. To make a long story short, at least 600 GPUs are required for puzzles with three digits.

[karrask]

Good afternoon, friends. I have one question - in which programming language is there the fastest algorithm for obtaining a non-compression public key from a hexadecimal value? Can someone share it? it is needed for speed like kangaroo or keyhant. exactly, only obtaining a non-compression public key without any other functions. and yet - any interval can be reduced by 20-30%, perhaps more, I have succeeded so far.

There is no programming language on planet Earth or trick that can drastically speed up Bitcoin key generation or hashing (SHA-256, RIPEMD-160) .
Any perceived speed improvements, like in kangaroo or KeyHunt, come from optimization techniques for specific tasks, not from changing the core cryptographic functions.
Reducing the search interval (as mentioned above) can help focus efforts, but it doesn't change the time it takes to compute each key or hash.
Using multiple threads or GPUs (parallelization) can improve the throughput of key generation but not the speed of individual computations. In short, at least 600 GPUs are required.

I don't need no SHA-256, no RIPEMD-160. what is needed is an optimized algorithm that works with non-compression public keys.

[AlanJohnson]

Good afternoon, friends. I have one question - in which programming language is there the fastest algorithm for obtaining a non-compression public key from a hexadecimal value? Can someone share it? it is needed for speed like kangaroo or keyhant. exactly, only obtaining a non-compression public key without any other functions. and yet - any interval can be reduced by 20-30%, perhaps more, I have succeeded so far.

There is no programming language on planet Earth or trick that can drastically speed up Bitcoin key generation or hashing (SHA-256, RIPEMD-160) .
Any perceived speed improvements, like in kangaroo or KeyHunt, come from optimization techniques for specific tasks, not from changing the core cryptographic functions.
Reducing the search interval (as mentioned above) can help focus efforts, but it doesn't change the time it takes to compute each key or hash.
Using multiple threads or GPUs (parallelization) can improve the throughput of key generation but not the speed of individual computations. In short, at least 600 GPUs are required.

I don't need no SHA-256, no RIPEMD-160. what is needed is an optimized algorithm that works with non-compression public keys.

No... What is needed is massive computational power or quantum computers. Everything else at this point is wasting time and electricity.

[karrask]

Good afternoon, friends. I have one question - in which programming language is there the fastest algorithm for obtaining a non-compression public key from a hexadecimal value? Can someone share it? it is needed for speed like kangaroo or keyhant. exactly, only obtaining a non-compression public key without any other functions. and yet - any interval can be reduced by 20-30%, perhaps more, I have succeeded so far.

There is no programming language on planet Earth or trick that can drastically speed up Bitcoin key generation or hashing (SHA-256, RIPEMD-160) .
Any perceived speed improvements, like in kangaroo or KeyHunt, come from optimization techniques for specific tasks, not from changing the core cryptographic functions.
Reducing the search interval (as mentioned above) can help focus efforts, but it doesn't change the time it takes to compute each key or hash.
Using multiple threads or GPUs (parallelization) can improve the throughput of key generation but not the speed of individual computations. In short, at least 600 GPUs are required.

I don't need no SHA-256, no RIPEMD-160. what is needed is an optimized algorithm that works with non-compression public keys.

No... What is needed is massive computational power or quantum computers. Everything else at this point is wasting time and electricity.

What does that have to do with it? I asked if there is an algorithm that is comparable in speed to kangaroo or keyhant

[nomachine]

I don't need no SHA-256, no RIPEMD-160. what is needed is an optimized algorithm that works with non-compression public keys.

The fastest approach to this is not tied to a specific programming language but rather to how well ECC scalar multiplication is optimized. Libraries such as secp256k1 in C or Rust's secp256k1 crate are already highly optimized for this task.

[Akito S. M. Hosana]

No major shortcuts exist for ECC due to the huge math involved. 

[COBRAS]

I don't need no SHA-256, no RIPEMD-160. what is needed is an optimized algorithm that works with non-compression public keys.

The fastest approach to this is not tied to a specific programming language but rather to how well ECC scalar multiplication is optimized. Libraries such as secp256k1 in C or Rust's secp256k1 crate are already highly optimized for this task.

Rng generators is more faster then simple range brute or kangaroo range brute. Kangaroo not provide result with 100% garanty, why people continue use and talk about kangaroo. I think kangaroo and  bsgs not specialisation on crack, for ex they not provide option for replace base point, replace scale of range etc