Output:Found: 5JjNVWPaRTPg1i4etqfPHPnsDZ1Js5qBYXFH9G4jC2Drb6kERsm
Awesome! And thanks.
(And also D'Oh! but of course

)
So if there is a single error and it's not in the checksum, we just test len(privkey)*58 candidates.
For 2 errors we would test (if I'm not mistaken
) [(len*(len-1))/2]*58, still under 100,000 candidates, nice.