I think yo do not understand what are you talking...
Clearly you're looking to fool people who don't, sadly for you I'm not one of them. Though the fact that you don't recognize that I do is odd...Quote
Give me public key what ever you whant and give me start private key with whom I can find public key for 1 day with speed 1Ph/s
This is exactly the same as what you offered above-- you just offset the starting position of the interior step.In what you describe, I choose x and y so that their difference is 60-ish bits. Then I give you y and xG. You would compute yG - xG and begin adding steps of the 2 x table_size * G to it and looking up the result in the table. Once you find a hit, you add the table position, the loop offset, and the y value to yield x.
What I described to you -- finding a private key whos pubkey begins with a long fixed string is an actual test of performance. To make it a better test, instead of zeros (which you could have precomputed over weeks or months) it would be better to use the hash of a recent block hash to bound the starting time.
But zeros would be good enough for the discussion here.I'm sure if you got anywhere near a 68 bit chosen prefix in two days you'd be setting a world record in "purebasic" computation for sure.
I talk about brutforce (you know what is this?) and you are trying to impose a search for an incomprehensible pubkey that I can look for years.
look at fist post, i talk about brutforce speed, i am not talking that i can found ANY public key for 1hour or 1day
and what does 60 bit have to do with it?
1 day with speed 1ph it is 10^15*86400 points total = 86400000000000000000
2^60 it is 1152921504606846976 you see difference between numbers?
86400000000000000000 79 times bigger than 2^60