Quote from: digaran on Today at 01:36:15 PM

Speaking of spamming the topic with unimportant content!

When you guys realize that in order to find a key based on address alone, first you'd need to break rmd160, then sha256 to get the public key and then find the private key based on the public key, since only public key and private key are directly related mathematically.

What you should do instead now that you are using your time, you should find any relation between similar addresses and their public/ private keys with their sha256 hashes, at least this way you are one step closer to solving 66 etc, because you won't have to face rmd160.

However, trying to do that will require more power and time than solving the puzzle #160.

So don't waste your time on something that difficult, try finding ways to go around the EC rules and break/ bend them either completely or partially.

For example, this is a method to partially break EC :

Divide a point by e.g, 5, then divide n by 5, and then add the result of p/5 to n/5, if your point is not divisible by 5 depending on the last digit of the private key, the division result differs.

Demonstration :
823 / 5 = 164.6
Now all you need is to extract 0.6 of n in secp256k1 and keep it for next operation, then after dividing 823 by 5, you just divide n by 5 and add the result of 823/5 to n/5 + 6/10 of n = 164

But what happens if we divide 822 / 5 = 164.4, just follow the previous steps this time extract 4/10 of n to add to your second result.

We just broke EC by simple math operations, though when your key is large and unknown, the fraction could be any percentage of n, but if you divide by 2 up to 9, since any key can only have 0 up to 9 on it's last digit, 1 out of 10 division + n/th + n/remainder will work.

I could never find these things out if I was still working on addresses and hashes.😉

Quote

what I need to know is, how to get the checkpoints for the puzzle 130 and how many checkpoints do i need their x coordinates in the checkpoints? Also will the code print the target public key's equivalent private key or will it save it to a file? Thanks as we all learning...

You can use key subtracter by alberto, https://bitcointalk.org/index.php?topic=5360656.0

You could use a known public key and use -a - s with -r 0:f -n 30 to have 15 + and -15 of your known public key, however use -z and -x to have only x coordinates, then you can convert them all to decimal.

Your ideas are always nailing it bro, but for the sake of clarification, can we be sure which parts we need to work with? Puzzle 66 or 130? because at first you made mention of something quote "you should find any relation between similar addresses and their public/ private keys with their sha256 hashes"... with that said, what kind of relationship are you talking about? besides that, I thought hashes are one way and cannot be calculated the other way unlike the EC curve that is based solely on the SECP256K1 implementations, one point linking to another point on the curve... I might be wrong though. Can you expatiate how we can successfully find the relation between addresses and their hashes...

Anything is always possible and I always keep a good faith...