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?