Password Pattern Checker
Inspect password length, distinct characters and some common patterns locally in your browser.
Enter a finite value within the formula’s domain and supported numeric range.
Calculation and assumptions
H=L·log₂(A).
The estimate assumes independent uniform draws from an inferred alphabet: ASCII lower/upper letters, digits, punctuation, space and observed distinct non-ASCII characters. It is not measured password entropy or crack time. Checks cover a small word list, repeated blocks and common four-character sequences; they miss many guessable patterns. Unicode code points are counted, not visual graphemes. The tool sends or saves no password and performs no breach lookup.
Values must satisfy the formula’s domain. Nonzero results too small or too large for reliable representation are rejected.
Frequently asked questions
How is the result calculated?
H=L·log₂(A).
What assumptions apply?
The estimate assumes independent uniform draws from an inferred alphabet: ASCII lower/upper letters, digits, punctuation, space and observed distinct non-ASCII characters. It is not measured password entropy or crack time. Checks cover a small word list, repeated blocks and common four-character sequences; they miss many guessable patterns. Unicode code points are counted, not visual graphemes. The tool sends or saves no password and performs no breach lookup.
How precise are the results?
Results show up to ten significant digits. Display precision does not improve the accuracy of the measurements or model. Values must satisfy the formula’s domain. Nonzero results too small or too large for reliable representation are rejected.