I am not talking that programm can found public key with criteria like 192 leading zeros or something.
If your program could actually do what you claimed-- evaluate 2.2 petakeys per second, then it could find keys whos pubkeys have 60-bit leading zeros quite quickly.
Read carefully!
I told that programm can brutforce keys to find public key with speed 2.2Ph on xeon.
if you know public key than YES program can found private key from this public key after some time...
But this time depends only how far the starting private key from the desired..
Do you see the difference in your task and what I write?
But instead you demand a starting point. Which means you cannot actually do what you claim, because you need to compute a point difference in order to use a precomputed table. One we consider that, instead what you claim is not impressive-- it is outright slow.