Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 49.

brainless

member

Activity: 348

Merit: 34

Quote from: digitalbear on September 27, 2024, 08:23:13 AM

Quote from: brainless on September 26, 2024, 11:34:59 PM

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

viljy

hero member

Activity: 1736

Merit: 857

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.

digitalbear

newbie

Activity: 11

Merit: 0

Quote from: brainless on September 26, 2024, 11:34:59 PM

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

brainless

member

Activity: 348

Merit: 34

Quote from: kTimesG on September 27, 2024, 05:16:56 AM

Quote from: gygy on September 27, 2024, 04:44:29 AM

Quote from: brainless on September 26, 2024, 11:34:59 PM

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

kTimesG

member

Activity: 165

Merit: 26

Quote from: gygy on September 27, 2024, 04:44:29 AM

Quote from: brainless on September 26, 2024, 11:34:59 PM

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.

gygy

newbie

Activity: 20

Merit: 0

Quote from: brainless on September 26, 2024, 11:34:59 PM

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 **

brainless

member

Activity: 348

Merit: 34

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!!!

nomachine

member

Activity: 503

Merit: 38

Quote from: Akito S. M. Hosana on September 26, 2024, 04:02:10 PM

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

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 Grin

COBRAS

member

Activity: 873

Merit: 22

$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

pubkey new down....

...

cf4863281bb44f52677de8876600000000 10000

c1d204c36910280a6e0952c00000000000 111c80
bad8afea76b82aa806c0d19a8000000000 11c000
aeb619ed70bba24a4d8dd0000000000000 12fb9e <-
ae8dccc375a55045649fec3c2000000000 130000

...

a3379838c4438008c873a4000000000000 1451d8

...

up down ,up down... new down...up down ,up down...

to be continue Wink

ps needs stock of zero's for this manipulations Grin

Akito S. M. Hosana

jr. member

Activity: 42

Merit: 0

Quote from: nomachine on September 26, 2024, 08:34:44 PM

Quote from: kTimesG on September 26, 2024, 07:40:01 PM

We don't even know if there is yet some unpublished weakness in ECDSA that was exploited. Also why would one gather 1.7 million $ in a single script address and not touch it at all after more than a year and a half, assuming there was a high cost of solving, that needs to be paid...?

The public program on GitHub could serve as a honeypot, used to monitor those trying to solve cryptographic puzzles or who are interested in cracking ECDSA. It could act as a form of surveillance, watching who interacts with it, akin to government efforts to track those with knowledge of or interest in sensitive cryptographic topics.

The non-public solution could indicate that powerful entities (e.g., intelligence agencies, corporations) are exploiting vulnerabilities privately while letting the public chase dead ends or false leads.

The decision to not touch the funds could simply be a matter of operational security.

That's why I never downloaded the prebuilt binaries of these tools. It's VERY dangerous. And who knows what lies behind that Iceland Secp256k1. After all, look at the Wireshark logs to see what's happening. Lips sealed

mcdouglasx

member

Activity: 239

Merit: 53

New ideas will be criticized and then admired.

Quote from: kTimesG on September 26, 2024, 07:40:01 PM

Quote from: mcdouglasx on September 26, 2024, 04:27:43 PM

The source code is free, you can be thankful, but don't you think it's a little unfair to complain about someone for imperfect code or code that doesn't meet your own needs? Developers are not slaves nor are you paying them a subscription to demand "this isn't Netflix". Apart from complaining, the internet is also ideal for learning to program, and I see a lot of opinions and little code here, that sometimes it's lazy to read.

I don't think it's about complaining, it's about waking up people to the fact they're putting blind faith into an imperfect program, not an imperfect code, if you can understand the difference. And it's not just about some 125-bit self-developer-imposed limitation. You may very well have some great written code which doesn't work (i.e it seems to work since no one bothered to QA it and no tests exist), and spaghetti code that correctly controls a rocket landing on Mars. It's obvious by now the 130 solver (which might very well be an organization or some huge zombie botnet) did not use JLP's program, and likely not even for 120 or 125. Just because something is not revealed does not make it non-existent. In the same way, just because something happened, it does not mean it happened because of a specific reason. We don't even know if there is yet some unpublished weakness in ECDSA that was exploited. Also why would one gather 1.7 million $ in a single script address and not touch it at all after more than a year and a half, assuming there was a high cost of solving, that needs to be paid...?

I think Kangaroo has already fulfilled its purpose, it is a purely probabilistic algorithm and for future puzzles it is not profitable to use it, it is better to mine blocks, I think it is time for new things that do not depend only on computing power, I am sure there are some things cooking out there: logic + strength.
but I do not think there will be a back door, new techniques yes, after all the keys to the puzzles are insecure it is not surprising that they are deciphered and if the prizes are large, even faster.

nomachine

member

Activity: 503

Merit: 38

Quote from: kTimesG on September 26, 2024, 07:40:01 PM

We don't even know if there is yet some unpublished weakness in ECDSA that was exploited. Also why would one gather 1.7 million $ in a single script address and not touch it at all after more than a year and a half, assuming there was a high cost of solving, that needs to be paid...?

The public program on GitHub could serve as a honeypot, used to monitor those trying to solve cryptographic puzzles or who are interested in cracking ECDSA. It could act as a form of surveillance, watching who interacts with it, akin to government efforts to track those with knowledge of or interest in sensitive cryptographic topics.

The non-public solution could indicate that powerful entities (e.g., intelligence agencies, corporations) are exploiting vulnerabilities privately while letting the public chase dead ends or false leads.

The decision to not touch the funds could simply be a matter of operational security.

kTimesG

member

Activity: 165

Merit: 26

Quote from: mcdouglasx on September 26, 2024, 04:27:43 PM

The source code is free, you can be thankful, but don't you think it's a little unfair to complain about someone for imperfect code or code that doesn't meet your own needs? Developers are not slaves nor are you paying them a subscription to demand "this isn't Netflix". Apart from complaining, the internet is also ideal for learning to program, and I see a lot of opinions and little code here, that sometimes it's lazy to read.

I don't think it's about complaining, it's about waking up people to the fact they're putting blind faith into an imperfect program, not an imperfect code, if you can understand the difference. And it's not just about some 125-bit self-developer-imposed limitation. You may very well have some great written code which doesn't work (i.e it seems to work since no one bothered to QA it and no tests exist), and spaghetti code that correctly controls a rocket landing on Mars. It's obvious by now the 130 solver (which might very well be an organization or some huge zombie botnet) did not use JLP's program, and likely not even for 120 or 125. Just because something is not revealed does not make it non-existent. In the same way, just because something happened, it does not mean it happened because of a specific reason. We don't even know if there is yet some unpublished weakness in ECDSA that was exploited. Also why would one gather 1.7 million $ in a single script address and not touch it at all after more than a year and a half, assuming there was a high cost of solving, that needs to be paid...?

CY4NiDE

member

Activity: 63

Merit: 14

I'd like to add here that it was announced from the very beginning that his program was limited to a 125bit interval. lol.

Code:

Pollard's kangaroo for SECPK1

A Pollard's kangaroo interval ECDLP solver for SECP256K1 (based on VanitySearch engine).
This program is limited to a 125bit interval search.

So yeah, for the people that ran it against #130; this stupidity is entirely on you. Instead of complaining that someone else did not hand out to you a perfect implementation go and actually create your own.

Otherwise you will end up with 0 Bitcoins AND 0 knowledge. And knowledge is the only thing that most of us here might ever gain from this challenge. Wink

mcdouglasx

member

Activity: 239

Merit: 53

New ideas will be criticized and then admired.

Quote from: Akito S. M. Hosana on September 26, 2024, 04:02:10 PM

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

The source code is free, you can be thankful, but don't you think it's a little unfair to complain about someone for imperfect code or code that doesn't meet your own needs? Developers are not slaves nor are you paying them a subscription to demand "this isn't Netflix". Apart from complaining, the internet is also ideal for learning to program, and I see a lot of opinions and little code here, that sometimes it's lazy to read.

Akito S. M. Hosana

jr. member

Activity: 42

Merit: 0

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

nomachine

member

Activity: 503

Merit: 38

Quote from: kTimesG on September 26, 2024, 09:19:08 AM

Who cares if it might not work correctly.

Every fork I've tested so far displays unreliable and unrealistically high performance counter rates, often showing values in the trillions or billions of MKeys/sec.

I like nice figures in MKeys/sec, but not so much that I get addicted to them. Grin

kTimesG

member

Activity: 165

Merit: 26

Quote from: ?? on ??

110 and 115 were solved with his software so it "works". I can imagine 125 and 130 were also solved with JLP base.
He worked for CERN so he should be used to good coding practices.
I myself, as an amateur coder, have a harder time to read JLP code compared to brichards bitcrack code.

Well, there are no coding practices at all to speak of, so what does working for whomever matter, vs. what we see? A good practice starts by putting a space after every comma, if you intend not to annoy to hell anyone trying to read your code.

I can only encourage everyone to keep using it, since it "works" as you say. Who cares if it might not work correctly. For the kind of number of operations we're dealing with, it's crucial that some bit flipping or not handling input validation doesn't result in a disaster, or useless work.

COBRAS

member

Activity: 873

Merit: 22

$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Quote from: ?? on ??

Quote from: kTimesG on September 26, 2024, 04:43:51 AM

Quote from: nomachine on September 26, 2024, 04:26:16 AM

Quote from: Akito S. M. Hosana on September 26, 2024, 03:44:51 AM

....a program that can't solve puzzle 130. Embarrassed

So, think about it again. It’s not even intended for that. You can reduce the range to a smaller one. It’s written in bold: 'This program is limited to a 125-bit interval search.' Have you ever wondered why it's exactly 125? Why not 120, 128, or 135? Grin

It's called bad coding / written in a hurry. I think 99% of everyone that used his application are not aware of all the bugs and general mess of the source code. A few here are defending it in godly ways as if JLP is some sort of a genius who discovered fire or something. In reality his code would not pass a first filter of QA.

110 and 115 were solved with his software so it "works". I can imagine 125 and 130 were also solved with JLP base.
He worked for CERN so he should be used to good coding practices.
I myself, as an amateur coder, have a harder time to read JLP code compared to brichards bitcrack code.

why you so like kangaroo ? kangaroo is a probability algorithm - he can find and can not find. BSGS for ex has no sach bug.

Kamoheapohea

jr. member

Activity: 47

Merit: 12

gmaxwell creator of 1000 BTC puzzl + Pinapple fund

Quote from: brainless on September 26, 2024, 05:31:51 AM

Who buy me coffee for 3 months, I will reward with coffee, lunch, dinner for 7 days in Dubai Cheesy

Would send but I don't wanna go to dubai.

Quote from: kTimesG on September 26, 2024, 04:43:51 AM

Quote from: nomachine on September 26, 2024, 04:26:16 AM

Quote from: Akito S. M. Hosana on September 26, 2024, 03:44:51 AM

....a program that can't solve puzzle 130. Embarrassed

So, think about it again. It’s not even intended for that. You can reduce the range to a smaller one. It’s written in bold: 'This program is limited to a 125-bit interval search.' Have you ever wondered why it's exactly 125? Why not 120, 128, or 135? Grin

It's called bad coding / written in a hurry. I think 99% of everyone that used his application are not aware of all the bugs and general mess of the source code. A few here are defending it in godly ways as if JLP is some sort of a genius who discovered fire or something. In reality his code would not pass a first filter of QA.

110 and 115 were solved with his software so it "works". I can imagine 125 and 130 were also solved with JLP base.
He worked for CERN so he should be used to good coding practices.
I myself, as an amateur coder, have a harder time to read JLP code compared to brichards bitcrack code.

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 49. (Read 245170 times)