Closed Mathematician09183 closed 2 years ago
It would be useful to add possibility to specify the set of potential candidates per missing character - for example to say that on position X could be only digit or any subset of base58.
That would be a bit complicated to implement with arbitrary number of chars missing in the current code. I'll see what I can do.
By the way - is the app smart enough to limit potential candidates from the top? For example, if WIF starts with L, then on 2nd could be max 5, if on 2nd is 5 then on 3rd could be max o etc.
No, it doesn't do that mainly because I'm not aware of such connections between each character except the first and second but not the rest, so it seemed like an overkill to add those conditions.
This issue solved by introducing Search Space in commit 46b251303ae934eb85015bfdc3a95252ac5ea411 and will be released in v. 0.15.0.
It would be useful to add possibility to specify the set of potential candidates per missing character - for example to say that on position X could be only digit or any subset of base58. By the way - is the app smart enough to limit potential candidates from the top? For example, if WIF starts with L, then on 2nd could be max 5, if on 2nd is 5 then on 3rd could be max o etc.