I think you misunderstood my point, if I was able to know the second character easily ecc would be broken.
just my script takes
pk1=20540573305730573
and convert it for example to
pk2= 3305730573
to know the first digits you would need to know pk2.
all this without the need to save millions of results.
my problem is that my computer basically runs out of power to reduce more. due to stress and hangs
I think everyone misunderstands what you are talking about because you have not given a clear and concise definition of what you are doing/talking about.
It would even be better if you can show an example. Not of your code, but an example of how your code works.
Example:
I start with private key x or public key b and do this
Then I do this
Next I do this
etc.
if I have a pub key that represents an unknown pk1
pk1=957273957373958372947
my script reduces the bits for example to
pk2=958372947
that is, remove the first 12 numbers for the example.
Among approximately 1500 keys there is one of them true that corresponds, I look for the key by brute force and once I get pk2 it is easy to deduce the private key of pk1