Earth baseline
Earth = 100 ZB global storage baseline
Password Security · Storage Scale
Compare the theoretical storage needed for exhaustive password dictionaries as password length and character-set size increase.
Solid curves show password rules; dashed lines show familiar storage limits.
Move across the graph or use the slider to compare every line at one password length.
The chart could not load. Check the internet connection used to retrieve Chart.js, then refresh the page.
The same data on a reduced scale makes the practical storage threshold easier to see.
Move across the graph or use the slider to compare every line at one password length.
The chart could not load. Check the internet connection used to retrieve Chart.js, then refresh the page.
Earth represents an illustrative global aggregate storage baseline; the second body shows the exhaustive dictionary requirement.
In this model, Earth represents a configurable global storage capacity. Required body diameter grows by the cube root of the storage ratio because the comparison is based on spherical volume.
Earth = 100 ZB global storage baseline
76-character set, 14 characters
| Rule set | Storage required | Required diameter | Nearest comparison |
|---|
Visual diameters are logarithmically compressed so Moon-, planet-, star-, and orbit-scale comparisons remain visible together. Numeric labels show the true calculated values.
This is a simplified precomputed exhaustive-dictionary model. Real attackers rarely store every possible password, and salting, key stretching, and memory-hard hashing make precomputation less useful.
The question is no longer whether the attacker has enough storage. The question is whether the universe has enough convenient metaphors.
The y-axis uses familiar decimal storage units and large-number names. The spacing remains logarithmic: each major step represents 1,000 times more storage.
These are theoretical exhaustive dictionary sizes, not password-cracking time estimates. Real attacks use filtering and prioritisation rather than storing every possible candidate.