Overview
A hash is a fingerprint for data: feed in any text and you get back a fixed-length string that looks random but is completely determined by the input. Change one letter and the fingerprint changes beyond recognition; feed in the same text twice and you get the same fingerprint twice. Developers use them to verify downloads, store passwords safely, and spot when a file has been tampered with.
This page computes five of the best-known hash functions side by side — MD5, SHA-1, SHA-256, SHA-384 and SHA-512 — from whatever you type, instantly. Each digest can be copied on its own, shown in upper or lower case, and everything happens locally: the hashing runs in your browser, so even sensitive strings never cross the network.
Which hash should I actually use?
It depends on the job. SHA-256 is the modern workhorse: fast, widely supported, and with no practical attacks — the default for file verification, digital signatures and most new systems. SHA-384 and SHA-512 are its bigger siblings, used where longer digests are wanted. MD5 and SHA-1 are included for compatibility, but both are cryptographically broken for security purposes.
“Broken” has a precise meaning here: researchers can craft two different inputs with the same MD5 or SHA-1 digest, which kills their use for signatures and certificates. For non-security jobs like checksums and hash tables they still work fine. The rule of thumb: verifying a download's integrity — any of them will do; protecting anything that matters — SHA-256 or better, plus a salt for passwords.
Features
- Five algorithms at once: MD5, SHA-1, SHA-256, SHA-384 and SHA-512.
- Live recomputation — digests update with every keystroke.
- Individual copy buttons for each digest.
- Uppercase/lowercase toggle to match whatever format you need.
- Side-by-side layout for easy comparison across algorithms.
- Fully local hashing — safe for sensitive strings.
Benefits
- Verify downloads fast. Paste the published checksum, compare visually.
- Learn by playing. Watch the avalanche effect as one letter changes everything.
- No wrong choice. All five digests from one input, pick the one you need.
- Private by design. The text being hashed never leaves your machine.
Who can use it
Developers verifying file integrity against published checksums, students learning how cryptographic hashes behave, QA engineers generating test fixtures, and anyone comparing hash outputs across tools. System administrators checking that a downloaded ISO matches its SHA-256 sum will find this the fastest route.
How to use
- Type or paste your text into the input box.
- Watch all five digests appear instantly below.
- Toggle uppercase if the format you are matching uses capitals.
- Copy the digest you need with its individual copy button.
- Compare against the expected value — any difference means the input differs.
Frequently asked questions
What is the avalanche effect?
The property that a tiny input change produces a wildly different digest. Change one letter of your text and roughly half the bits of the hash flip — there is no way to predict which. Try it: hash a sentence, then hash it with one letter altered, and compare. This sensitivity is what makes hashes useful for detecting tampering.
Is MD5 safe to use?
For security, no — collision attacks against MD5 are practical, meaning attackers can forge matching digests. For non-security purposes like checksums or partitioning data, it remains fast and fine. SHA-1 sits in between: deprecated for certificates and signatures, still seen in legacy systems. For anything new, reach for SHA-256.
Can I hash a file, not just text?
This tool hashes text you type or paste. For files, the same algorithms apply — most operating systems ship a command-line tool (certutil on Windows, shasum on macOS/Linux) that reads the file and prints the digest. The comparison step is identical: match it against the published value.
Why do two different texts never share a hash?
In theory they can — there are infinitely many inputs and finitely many digests — but for SHA-256 the odds of an accidental collision are around 1 in 2^128, effectively zero. Deliberate collisions are a different story and are exactly what broke MD5 and SHA-1; no such attack exists for SHA-256.
Should passwords be stored as SHA-256 hashes?
Not directly. Fast hashes let attackers test billions of guesses per second, so password storage needs slow, salted functions designed for the job — bcrypt, scrypt or Argon2. A plain SHA-256 of a password falls to a GPU in short order. This tool is for learning and verification, not credential storage.
Conclusion
Five fingerprints, one keystroke, zero uploads. Hash the text, copy the digest, and trust the comparison — that is what hashes are for.