Recovering a Bitcoin Key Made From Rolling Dice So a few years ago I created a private key by rolling dice.  Following the instructions from bitaddress.org, I rolled a dice 99 times and entered the string into the bitaddress.org.  Rather than storing the private key in WIF or HEX, I wrote the 99 digit string of dices rolls.  However, I changed some of the dice rolls to obfuscate the true private key if someone else stumbled upon the 99 digit numbers.  Now I can't remember which digit(s) I changed.  

Using Python libraries, I've been trying different combinations/permutations of the 99 digit number.  Stuff like what if I swapped two positions or straight replacement of one or two digits.  No luck.  

Any ideas?  How fast can I create keys and check if my key matches my bitcoin address?  Python libraries that I have found let me check about 10 permutations a second.  How much faster can I do with C?
A 6 sided die rolled 99 times gives 6^99 = 1.088864372500119e77 possible combinations. This is almost exactly the same key space of a 256 bit private key (roughly 2^256), in other words, without knowing how many digits you changed, it is impossible.

Let's see, if my math is correct, I believe if you changed 1 digit, then you have to try each number 6 times, or 99 x 6 = 594 tries. If you changed 2 digits, then you have to try 594^2 = 352836. If you changed 3, 594^3 = 209584584. That is much more doable and will have less to do with what language you use, and more to do with how you implement it. You can generate the private key, and then the public key and encode it to see if the address matches (assuming you still have the address).