One of the reasons why it might be better to add and multiply and increase the range of the keys is that ecc works like a clock. If you do an addition or multiplication that is around the end,you would automatically get a key that reflects a low range. .
Remember that there are two pairs of keys that are the same but represented in different ranges, one starts with 02 and the other with 03 in the case of compressed pubkeys.
I know how it works. Did you even look at his example that I was referring to?
Also, 160 bit (the highest of these puzzles) with a known range (as all of the challenge/puzzle bits) are what most are focusing on here. To add sub div or mult to go around the clock (without knowing 100%) is not smart. But if you can reduce the ranges, closer to 0 and with 1 key or very few keys, thats where the money will be made.
I'm sorry, it has nothing to do with the example, I just point out that it is a better idea to add and multiply than to subtract and divide because the objective is unknown, with divisions or subtraction the probability of falling into negative or floating is immense, however by multiplying there will only be only one direction. therefore it is better to do random multiplications to the target, make a database and scan them (omitting 02 and 03) from 1-xxxxxxxxx (depending on your computing power, you choose how big the range is).
If the script does not find a match, it repeats in a loop creating another database.
If you find a match, "bingo."
you would automatically get a key that reflects a low range.
I swear I was starting to doubt my sanity, at least now I know I'm not totally insane.
Your understanding shows that you have worked with scalars and know what happens when you operate mod n.
Now have you tried to work with target and it's 1/16? Try divide & add/sub scalar.
One thing I noticed, even if you post a private key of a funded address, not all but some people would ask what is this, what should we do with it?😂
And say how is that going to help us solve a puzzle, while they think finding a way to partially break ECC is like planning for a family picnic or throwing a dice and get lucky to land on a key just like that.
To understand, you have to try any possibility until you find a solution, and since the group order is fixed, you can observe what happens when you divide different keys from different ranges, like sometimes you get 8 with some 0s after it, and when you divide by a larger number you'd get something like 67b with some trailing 0s, sometimes it goes like 8, c, 4, with trailing 0s.
You can understand what I say if you divide 0x1 by even or odd numbers, e.g, 2, 4, 6, 8 or 3, 5, 7 etc.
Something to work with:
Target: 1001, sub 200 to get 801, now if you divide 801 and 1001 by 200 you get 1, but do it using scalar, and set your range to 2:400, you will see 256 bit keys and in the middle only "1". Now how can we find an unknown key close to 200? And start by dividing and sub to land on one of the unknown key's divisor.
Let me explain, think of target as 1600, now if you divide and sub 1000 and 600, you'd get 400 being divided, now what if you work with 600 and 400, you'd get 200 divided, now imagine all the keys above are odd, how can we work with them by subtraction/addition only to get a composite number?
If you see that your idea makes sense, execute it and you will know if it is good or not, regardless of what the majority say, in the end we all ignore something.
Albert Einstein: he was not admitted to the university.
Marilyn vos Savant: questioned by mathematicians.
They are examples that the opinion of others does not matter.
