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

Thank you for your answers to my posts, they've been helpful I'm curious how many of these you've solved with this method of seeding the random with specific values; was it only #50?

I'd like to review all your posts (and some other users' too) but whenever I go to your profile and click either "Show the last posts of this person" or "Show the last topics started by this person" I don't get any results


This is me NGL

Really, this is your discovery? Lol.

I found many like this, in decimal format; it is AMAZING:


9=1, 8=2, 7=3, 6=4, etc
After someone solves #130 through #160, I would appreciate a tip, to me, for showing and explaining this extremely, thoroughly etcly.

Another angle to work on #130, there are many ways to manipulate the ranges, I'm just providing the easiest ones.
The second and the third keys above could be considered as #130, look what happens when we subtract each of them from the end range, they are the reverse of each other in hex like 8 turns to 7, a=5, b=4, c=3, d=2, e=1, f=0 etc.

What that means, is that if you could find a definitive mathematical/modular relation between such keys, then you could theoretically solve any keys by doing the same subtractions as above.
They are like when added, they generate a composite number divisible by powers of 2.  Only thing you have to figure, is to find a way either by +, -, /, and *, to land on a constant key, for example it doesn't matter what your key is, if you add 10  to 50 and divide by 2, you can get 30 which has a distance of 10 from half of 30(15) to 25 aka half of target.
I mean some relation like that, find that then you can solve any keys.
Let me show you, if you divide both keys and subtract their results, you can have:

Now if you add the results, you will have these :
Now remember you can always know the second offsets, when you divide and add, if you are interested, try to find a relation between the first 8 offsets and the second 8 offsets, and note that they are only divided by 2 through 8, you can go beyond 2^100 and study the results carefully.

---

🦟🦟, who let these flies in?

Yeah, this is pointless for higher ranges. Unless you have RAM in the Terabytes.
I don't think most know how Kangaroo actually works.

Please everyone, just stop feeding the troll. The ignore button on your left is very useful. I have used it for a long time, but it doesn't work well when others are quoting the troll and prompting more garbage.

Seriously what is there to learn from random keys? When you go random on rmd160/addresses, it's like being in a gun fight and shoot blindly with your fingers, not a real gun.

Let me give you something to work with public keys through +, - only, it's best to use key subtracter.
First select a range and do subtractions in bulk, then pick one of the offsets and perform the same subtraction on it, then pick one of the second offsets and add it to your original target, if you see the distance between your original target and second offset was added to your original target, it means the second offset is not -n, but if you see the distance was subtracted after trying to do addition, it means the 2nd offset is -n, which indicates your second attempt at bulk subtraction, subtracted a larger number than your original key.

Now since you have your ranges saved, you can conclude the size of your target.

Let me explain more...I use a trial-and-error method a problem-solving approach where you systematically try different options or solutions until you find one that works or achieves the desired result.
It involves a process of experimentation and learning from your attempts, and it's often used when you don't have a straightforward or known solution to a problem.

You start by making an attempt or trying a particular option, strategy, or input.
In this case it is a random seed.
After your attempt, you carefully observe the results and outcomes. You gather information about what worked and what didn't. You analyze the results to determine if your attempt was successful or not. If it was unsuccessful, you analyze why it didn't work. If something is nonsense, you reject it immediately and move on further. You are NOT holding back like some of the above.

Based on your analysis, you make adjustments to your approach, such as trying a different option, changing a parameter, or using a new strategy.

You repeat the process, trying the adjusted approach or a new option. You continue this cycle until you achieve the desired result or solve the problem. This cycle can last for years.

You lower the value of this thread so much by just using it as your personal diary.

I meant the actual BIG GUNS, not some wannabes, I mean someone like "MinghuaQu" who apparently worked for NSA
And evidence suggest he might be the one generating secp256k1 curve, and I would like to ask him about his selection of N the group order, why this specific value? Why so many leading Fs?
Especially to ask him if he knows that the following keys posses  any unique properties such as some kind of backdoor etc.?

What the fuck! No they are not here! They do not care about this silly thread where lately only a bunch of newbies divide some public keys.

If someone is interested in more detail,  start here from page 33
https://riunet.upv.es/bitstream/handle/10251/185866/Andreu%20-%20Kangaroo%20configuration%20for%20criptoanalysis%20of%20public%20key%20protocols.pdf?sequence=1&isAllowed=y
 



They are here. You don't have to believe me. it's just that they won't write in their papers that they are directly dealing with solving the Puzzles from this topic. .   

I imagined if you use Gaudry Schost method (re-place a kangaroo at a new random point as soon as you hit a distinguished point) that you could have an advantage.
Especially when using tame points in the target bitrange and wild points where one or many might not be in the target bit-range (e.g. when having many targets while experimenting with division).

You would kind of saturate the tame DPs more and more while the chance to hit a DP with the wild range increases.

But today I don't think it is of much use.

You are right. To be more precise, we use the van Oorschot and Weiner Method of kangaroos.
The van Oorshot and Weiner method of was the fastest kangaroo method for
over 15 years. In this method, there is one ’Tame’ kangaroo (labelled T), and one ’Wild’
kangaroo (labelled W).
I don't even use files (for Tame & Wild) in my script. Everything happens in RAM. (with a bunch of caching and memoization)

Sure, for the example you provided:

23785778
         -10
23785768

But none of this matters when you do not know the ending of the actual private key; nor does knowing the last digit of a private key help you in determining anything with regards to what a public key will look like when subtracting from it.

1 person claims to understand what you mean but you should write this in your personal diary instead of here.

The problem with this, is that 1582856285957395958375836588 is such a small number in the scheme of what we are dealing with.

I have done something similar to speed up search times for a different project.

Ok, since I just learned THE SECRET, I'm gonna continue as usual. 😉 because if you stop, you can never know what could have happened if you had continued to work harder.

---

So, does anyone here knows a way to always find 2 keys 1 being +n, the other 1 being -n without their last digit ever changing?
For example, if +n is 23785778 and -n is something like 678789915549,  do you know how to get 2 other keys ending with 8 and 9? And only by subtraction, not division.

Lets mind storm about this idea, and discuss how could knowing your target's last digit help in solving a key.

It is so simple: They did not find something better so they stopped wasting their time. The secret is to know when you have to stop.
Noone here will find something better than BSGS, Pollard-*. I am 100% sure.

Prove me wrong .

I'm not sure where to start. It looks like you are running keyhunt, CPU only, and comparing that to running a GPU on Bitcrack. Is that correct?

There is a keyhunt for GPU, which is better than bitcrack, speed wise, and for the fact that all GPUs can work together.

Yes, 5 GPUs bump your chances up, but why stop at 5? 

Cool story bro! Where is this mathematician right now? Is he working on these puzzles? I wonder where are the BIG GUNS of mathematics, there are millions of $ for the grab, why don't they join the party?
I don't think the world knows about this puzzle, at least  they should spread the word so everyone can join, I mean come on, the most active member here is a notorious but harmless forum troll.

---

Maybe they are already working on this but silently? Well they should know that keeping knowledge to yourself won't give you more knowledge, that's why they won't get anything promising.😉