Overview
A hash is a fingerprint for data. Feed it a word, a paragraph, or a whole file, and it returns a fixed-length string that represents the input. Change a single letter and the fingerprint transforms completely — which is why hashes show up everywhere from verifying downloads to deduplicating files. This page computes five of the most widely referenced hashes side by side, updating live with every keystroke, so you can compare them without running anything locally.
MD5 and SHA-1 are here because older software, documentation and checksums still quote them constantly — not because they're recommended for new security work. SHA-256, SHA-384 and SHA-512 are the modern SHA-2 family members to reach for today. Unusually, even the MD5 is computed locally in your browser here, where many tools quietly send it to a server instead. Your text never leaves the tab.
What is a hash function?
A hash function is a one-way recipe: any amount of input goes in, a fixed-size string comes out — 128 bits for MD5, 256 for SHA-256, and so on. It has three useful properties. It's deterministic: the same input always yields the same output, on any machine, forever. It's effectively irreversible: a hash reveals nothing practical about its input, though you can always test a guess by hashing it and comparing. And it's sensitive: near-identical inputs produce wildly different outputs.
That last property, called the avalanche effect, is what makes hashes good integrity checks — one flipped byte and the fingerprint is unrecognisable. But hashes are not encryption: there's no key, nothing to decrypt, and a fast hash alone is a poor way to store passwords. Password storage needs slow, salted schemes designed for the job, like bcrypt or Argon2. Knowing which tool fits which task is most of practical security.
Features
- Five algorithms side by side. MD5, SHA-1, SHA-256, SHA-384 and SHA-512 computed from the same input at once.
- Live as you type. Every keystroke recomputes all five hashes instantly — no buttons to press.
- Uppercase toggle. Display the hex digests in capitals for systems that expect that style.
- One-click copy per hash. Grab any single fingerprint without selecting text by hand.
- Fully local computation. Even MD5 is calculated in your browser; your text is never uploaded.
- Bit lengths labelled. Each algorithm shows its digest size so you always know what you're looking at.
- Honest guidance. Legacy algorithms are marked as such, so you don't reach for MD5 in new work by accident.
Benefits
- Verify downloads fast. Compare a published checksum against your file's hash in seconds.
- Spot any change. The avalanche effect means even a one-byte difference is immediately visible.
- Safe for sensitive text. Local computation means snippets you'd never paste into a stranger's server are fine here.
- Learn by comparing. Seeing all five digests together builds intuition no textbook table can.
Who can use it
Developers checking that a downloaded library matches its published checksum, sysadmins verifying backups, and students learning how hash functions behave all reach for this page. Writers and researchers use it to fingerprint drafts and prove a document hasn't changed. Support engineers compare hashes to confirm two customers really have the same file version. Anyone who's ever been handed a checksum string and wondered 'what do I do with this?' will find the answer is: paste your text here and compare.
How to use
- Click into the text box and type or paste whatever you want to fingerprint.
- Watch all five hashes appear and update live as you type.
- Toggle uppercase if the checksum you're comparing against uses capital letters.
- Press the copy button next to any hash to grab that digest.
- Compare it against the expected value — an exact match means the content is identical.
Frequently asked questions
Which hash algorithm should I use?
For anything new, SHA-256 — it's the everyday standard with no practical attacks against it. SHA-384 and SHA-512 are stronger on paper and fine when a system asks for them specifically. MD5 and SHA-1 survive on this page only for compatibility: old software, legacy documentation and existing checksums still quote them. Never choose MD5 or SHA-1 for security decisions in new work; collision attacks against both are practical and well documented.
Can a hash be reversed to reveal my text?
No — that's the point of a one-way function. A hash tells you nothing useful about its input; there's no decryption key because nothing was encrypted. The only attack is guessing: hash candidate inputs and see if any match. That's why short, predictable inputs (like common passwords) can be 'reversed' via dictionaries, while long random inputs cannot. Hashing is for integrity and identification, never for hiding secrets on its own.
Why do two nearly identical texts produce totally different hashes?
That's the avalanche effect, and it's deliberate. A good hash function is designed so that flipping a single input bit changes roughly half the output bits, unpredictably. Without it, attackers could inch toward a target hash by making small tweaks and watching the output creep closer. With it, similar inputs give no foothold at all — which is exactly what makes hashes reliable fingerprints.
Can I hash a whole file, or just text?
This page hashes text you type or paste — perfect for code snippets, JSON blobs and short documents. For whole files, the same algorithms apply, but you'd use a local command-line tool or your operating system's built-in checksum utility, since uploading a large file to any website just to hash it would be slow and, for private files, unwise. The maths is identical; only the delivery vehicle differs.
Is it safe to check a download's checksum here?
Yes, with one honest caveat: pasting the checksum string from the download page is completely safe, and comparing it against a hash you computed locally is the right workflow. What you should not do is paste an entire huge or sensitive file's contents here — use your OS checksum tool for that instead. For the common case of 'does this short string match?', this page is exactly the right tool.
Why is my text never uploaded?
Because it doesn't need to be. Your browser already contains everything required to compute these hashes — the algorithms are just maths. Many hash websites send your input to their server out of habit (or to log it), but there's no technical reason for it. Keeping the computation local means your snippets stay yours, the page works offline once loaded, and there's no waiting on a network round trip for every keystroke.
Conclusion
Hashes are the fingerprints of the digital world, and now you can take them without installing anything. Type, compare, copy — five algorithms, zero uploads, and the honest labelling to know which one each job deserves. For quick integrity checks and curiosity alike, that's the whole errand in one tab.