Add the case that location of missing characters is not known. about finderouter HOT 3 CLOSED

73e8596 solves this for a special case (compressed key missing 3 chars).
We can add more code for a couple more small cases (3 missing is already 4 billion keys to check).

from finderouter.

305a535 solves this for special case (both compressed and uncompressed keys missing 1 char).

from finderouter.

8d13be8 solves this for special case (both compressed and uncompressed keys missing 2 chars) which closes this issue.

We can add the case for >= 4 chars missing but the number of keys to check grows fast and the colde also becomes very slow 2.9k -> 4.2 mil -> 4.0 bil -> 2.8 tril -> 1.5 quad.
I prefer postponing any additional work on this to after code including SHA got more optimized (eg. using SIMD) and GPU support is added.

from finderouter.