If you can do that, congratulations because you just partially broke elliptic curve.
No, i mean I can reduce a generator range to skip not random values, so time to bruteforce reduced too.
For example, 23 bit key fot test (python 3.11 + ice_secp256k1.dll).
with secret algo:
GOT: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rVkthFNsQ6i7
10.363348245620728 s
with usual range (2^22 ... 2^23-1)
GOT: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rVkthFNsQ6i7
16.832353353500366 swith big values, like 66 bit, a lot of values just skiped as NOT random binary values, because cant be randomly generated by author (by wallet software).
for example, first value for 66-bit range is 100000100100100101010011001011000111000111001011000111000111001011, all values less is fail.
this value give gererator as first value applyed with random's rules
anyway, pure python not a good instrument to get result. wanna use numba cuda.jit, but still learning how.