Wordlist Analyzer
Analyze a diceware or password wordlist: unique words, duplicates, length stats, entropy per word, words needed for 60–128 bits and prefix checks.
Empty lines and surrounding spaces are ignored.
Entropy per word is log2(number of unique words), valid when each word is chosen uniformly at random (for example with dice). The unique-prefix length is the smallest number of first letters that identifies every word.
Runs entirely in your browser. Your data is never uploaded.
What is Wordlist Analyzer?
Paste a wordlist, one word per line, to check whether it is suitable for passphrases: how many unique words it has, duplicates, word lengths, entropy per word, how many words you need for a target strength, and whether words can be joined without separators.
How to use Wordlist Analyzer
- Paste the list into Wordlist (one word per line), or click Load EFF large wordlist.
- Read the statistics: total, unique, duplicates, entropy per word and length stats.
- Check the prefix result and the words needed for 60, 80 and 128 bits.
- Click Download without duplicates to save a cleaned list.
Example
EFF large wordlist (7,776 words)
Unique 7,776, entropy per word 12.9 bits, 5 words for 60 bits, 7 for 80 bits, 10 for 128 bits; prefix-free
When to use Wordlist Analyzer
Use it when building or reviewing a custom diceware list, for example in another language, or when cleaning wordlists for games and tools. Entropy figures only hold if words are picked uniformly at random.
How Wordlist Analyzer works
Lines are trimmed and empty lines ignored. Entropy per word = log2(unique words), and words needed = ceil(bits ÷ entropy per word). The list is prefix-free if no word is the start of another (checked on the sorted list); the unique-prefix length is the smallest k for which the first k characters of every word are distinct. Duplicates are counted and listed; the cleaned list keeps the first occurrence of each word.
Common Use Cases
- Validating a translated diceware wordlist
- Checking whether passphrase words can be concatenated safely
- Removing duplicates from a word list
- Comparing the EFF large and short lists
FAQs
Why does prefix-freeness matter?
If 'app' and 'apple' are both in the list, 'apple' + 'ton' and 'app' + 'leton' could produce the same joined string, lowering entropy when no separator is used.
How big should a passphrase wordlist be?
7,776 words (6^5) is standard for five dice and gives 12.9 bits per word; smaller lists need more words per passphrase.
Is the list uploaded?
No. The analysis runs entirely in your browser.