Random Search Time Model
Estimate average exhaustive-search time from an assumed random search space.
Your numbers
Expected time at entered rate
Uniform search-space model only. Real password guessing, online rate limits, hashing cost, parallelism and compromise risk can differ greatly.
Scenario comparison
Up to three snapshots in this tab. Loading one replaces the current inputs.
Formula
Use t ≈ 2^(b−1)/g. b is search-space entropy in bits, g is assumed guesses per second, and t is expected search time in seconds.
Estimate average exhaustive-search time from an assumed random search space.
Worked example
- Random search-space entropy (bits)
- 40
- Assumed guesses per second
- 1000000
- Expected time at entered rate
- 549,755.813888 seconds
- Worst-case exhaustive time
- 1,099,511.62778 seconds
Scope and limitations
Uniform search-space model only. Real password guessing, online rate limits, hashing cost, parallelism and compromise risk can differ greatly.
Inputs are checked for missing values and allowed ranges. A result outside the finite numeric range is not displayed. Rounding affects display, while the calculation uses the model’s numeric precision.
Check your units and assumptions before relying on a result. Changing a label does not convert a currency or physical unit.
Formula version: cd920a000532 · Example checked: