Password Crack Time Estimator
Calculate a mathematical guessing range for a declared finite random space and your own guess rate.
Candidates are uniformly likely. Alphabet positions are independent and uniform. Guesses are distinct, without replacement, at a constant user rate; the first guess completes after 1/r. This model does not describe human passwords or real attacks. No password input or hardware assumptions. Alphabet exponent: 0–10000; candidate count must be positive. A zero rate means no attempts; a zero probability needs zero guesses. Empty candidate spaces are rejected. This is a finite search; refilling guesses is not modeled.
Exact fractions preserve full precision. Inputs stay in this browser. Maximum 30 scenarios, 100 event rows, 200 digits per decimal, 1000 result digits.
Report
A QUICK WALKTHROUGH
How to use this tool
- Enter named scenarios using the schema.
- Declare a rate and success probability.
- Calculate and export every scenario.
Model and formulas
Each line: name | mode (alphabet or finite) | alphabet size or space N | length (alphabet only) | guesses per time unit | unit (s/min/h/d) | probability (0–1). Candidates are uniformly likely. Alphabet positions are independent and uniform. Guesses are distinct, without replacement, at a constant user rate; the first guess completes after 1/r. This model does not describe human passwords or real attacks. No password input or hardware assumptions. Alphabet exponent: 0–10000; candidate count must be positive. A zero rate means no attempts; a zero probability needs zero guesses. Empty candidate spaces are rejected. This is a finite search; refilling guesses is not modeled.
Report
Exact fractions preserve full precision. Inputs stay in this browser. Maximum 30 scenarios, 100 event rows, 200 digits per decimal, 1000 result digits.
GOOD TO KNOW
Common questions
Does this predict an actual attack?
No. It evaluates only the declared uniform candidate model and rate.