The Math of Cracking Missing Seed Words

I recently released a new free and Creative Commons licensed tutorial on the math of cracking missing seed words. I created a tool for calculating the number of missing bits, possible combinations, and estimated cracking times for pros and consumers.

One of the interesting things that I found is that the last word being included in the missing words makes a decent difference in the overall combinations and crack times for up to around 3 missing words, since the 4 to 8 checksum bits aren't included in the cracking operations.

TL;DR for about 1-3 missing words, cracking/recovering is possible and fairly likely. Once you get to 4-5 words, it becomes impractical or impossible. Anything above 6 and definitely a full seed is impossible.

These are tables I generated using my code to show the viability of cracking a certain amount of words, with and without the last word included.