First at all 'Hello!'. After reading the forum for some time, finally I opened the account.
I would like to share with you my WIF Solver - having some free time recently I made a small application for restoring damaged WIFs.
More information you may find on github: https://github.com/PawelGorny/WifSolver
I prepared 5 scenarios of solving problem, I am interested in your opinion - what could be added or improved?
Especially I would like to ask what do you think about the JUMP approach. I realized that knowing how hex format ends (after decryption of part of WIF) it is possible to calculate the minimum jump length - the number which added to our private key, if converted back to hex keeps the end 'untouched'. Of course there is still matter of wrong checksum, but this could be checked later, when trying to decode generated WIF. The idea was not to test each possible combination of WIF, but only the selected one.
Maybe I cannot clearly describe how this approach works, but please check the example.
If you have any comments or questions - I am glad to hear it.
Pawel

Dzień dobry!