Calculator Inputs
The calculator uses 3 columns on large screens, 2 on smaller screens, and 1 on mobile.
Example Data Table
| Input Text | Salt | Iterations | SHA1 Hex Result |
|---|---|---|---|
| (empty string) | None | 1 | da39a3ee5e6b4b0d3255bfef95601890afd80709 |
| hello | None | 1 | aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d |
| OpenAI | None | 1 | a19ee5a9fdc191092796cd9bfa97c55fe5631695 |
| Math Example | None | 1 | c2166dc903fb8928019e257332bd52d1e06f7385 |
Formula Used
SHA1 is a 160-bit hashing process. The calculator first prepares the text, applies optional salt, then computes a digest over 512-bit blocks.
The compression stage uses five working registers, eighty rounds, bitwise rotation, logical functions, and modulo 232 addition.
Digest flow: H = SHA1(salted_text). For repeated hashing, Hn = SHA1(binary(Hn-1)). The final digest is shown in hexadecimal and Base64 formats.
How to Use This Calculator
- Enter or paste the source text into the input field.
- Add an optional salt and choose whether it goes before, after, or around the text.
- Select iteration count, output case, grouping size, and delimiter style.
- Use trim or line-ending normalization when you need consistent hashing across copied content.
- Optionally paste a reference digest to compare against the generated value.
- Press the submit button to display the result card, graph, and export controls above the form.
FAQs
1. What does this SHA1 generator calculate?
It converts your input text into a 160-bit SHA1 digest. The page can also apply optional salt, repeated hashing, formatting controls, and comparison checks.
2. Why does changing one character alter the whole result?
Hash functions show the avalanche effect. A tiny input change produces a very different digest, which helps detect edits and transmission differences.
3. What is the purpose of the salt field?
The salt field adds extra text before hashing. It changes the digest and helps differentiate otherwise identical inputs in demonstrations or controlled workflows.
4. What do iterations do here?
Iterations repeat the hashing process. After the first round, this calculator hashes the previous binary digest again, creating a different final result.
5. Is SHA1 suitable for password storage?
No. SHA1 is considered outdated for password protection and strong security use. Modern password hashing methods such as bcrypt, scrypt, or Argon2 are better choices.
6. Why are there hexadecimal and Base64 outputs?
Hexadecimal is the common readable representation for hashes. Base64 is shorter and useful when compact transport or storage formats are preferred.
7. What does the Plotly graph show?
The graph shows how often each hexadecimal character appears in the final digest. It is a quick visual aid for pattern inspection and demonstrations.
8. Why might copied hashes fail to compare?
Mismatches often come from hidden spaces, line endings, different salt settings, uppercase formatting, or using a different number of iterations during hashing.