Hash Rate
Calculate hashing throughput and time required to compute a given number of hashes.
About Hash Rate
Hash rate measures the speed at which a system can compute cryptographic hash functions. The time to compute a target number of hashes is simply the target count divided by the rate. This is relevant for password cracking estimates, proof-of-work mining calculations, and sizing hardware for hash-intensive workloads.
Formula
Time to compute
time_seconds = target_hashes / hash_rate
- N
- Target number of hashes
- R
- Hash rate (hashes per second)
Worked example
With the default values below, Hash Rate returns Time to Compute Target Hashes of 1,000.0000. Change any input above and every figure here is recalculated in your browser.
Inputs used
- Hash Rateminimum 1 H/s
- 1,000,000,000 H/s
- Target Number of Hashesminimum 1
- 1,000,000,000,000
Results
- Time to Compute Target Hashes
- 1,000.0000 seconds
- Time in Days
- 0.011574 days
- Hash Rate (formatted)
- 1 GH/s
Step by step
- 1Hash rate= 1 GH/s
- 2Time to complete= 1000 seconds
- 3Time in human units= 16.6667 minutes
Assumptions and limits
- The result is derived only from the 2 inputs listed above. Anything not among them is not part of the calculation.
- In particular, this calculator does not take inflation, tax, fees or charges or compounding frequency into account.
- Figures are rounded for display to 6 decimal places, so totals built from several rounded parts can differ slightly from the unrounded arithmetic.
How these calculators are built and tested is described on the Methodology page. If a figure looks wrong, please report it.
Frequently Asked Questions
What is a typical hash rate for modern hardware?
A modern GPU can compute billions of SHA-256 hashes per second (GH/s). Dedicated ASICs for cryptocurrency mining reach into TH/s (trillions per second). CPU-based rates are typically in the MH/s range for fast algorithms.
How does hash rate relate to password security?
Higher attacker hash rates mean passwords can be cracked faster. A password whose keyspace would take centuries to exhaust at 1 MH/s might fall in days at 10 TH/s — which is why modern password hashing uses deliberately slow algorithms like bcrypt or Argon2.