Technology calculators

Hash Value Calculator

Updated Aug 10, 2026 By Jehan Wadia
Rate Formulas
Input
0 characters · 0 bytes
Bytes are produced with this encoding before hashing.
Line Ending Style
Newline bytes change the digest, so pick the style your file uses.
Output & Keying Options
Default is lowercase (a3f5…).
Same input + different key = different output.
Algorithms
0 algorithms selected

Hash Results

Step-by-Step Solution
Digest Size & Compute Time by Algorithm

Introduction

This free hash value calculator turns any text, hex bytes, or file into a hash. A hash is a short string of letters and numbers, like a fingerprint for data. The same input always gives the same hash. Change one letter, and the hash looks completely different.

You can pick from over 30 algorithms, including MD5, SHA-1, SHA-256, SHA-512, SHA-3, BLAKE2b, RIPEMD, Whirlpool, and CRC32. Check many at once and compare them side by side. Turn on HMAC mode if you want to add a secret key. If you only need a checksum for error detection, the dedicated CRC Calculator covers that job on its own.

People use hashes to check that a download is not broken or changed, to compare two files, and to keep records for audits. Paste an expected hash in the Verify box, and the tool tells you right away if it is a Match or a Mismatch.

Everything runs inside your browser. Your text and files never get uploaded, so even large files stay private. When you are done, you can copy a hash or export a report as PDF, CSV, JSON, HTML, or plain text.

How to use our Hash Value Calculator

Pick your input (text, hex bytes, or a file), choose the hash algorithms you want, and the tool shows the hash value for each one. You can also check a hash against one you already have, and save a report.

Input tab: Click Text to type words, Hex Bytes to paste raw bytes, or File to hash a file from your device.

Text to hash: Type or paste the words you want to hash. The box counts your characters and bytes as you type. If you need a plain character or word tally instead, try the Word Count Calculator.

Character encoding: Choose how your text turns into bytes, like UTF-8 or Latin-1. Different encodings give different hash values.

Line ending style: Pick LF, CRLF, or CR to match the file you are checking. Line breaks change the hash.

Hexadecimal bytes: Paste hex digits like DEADBEEF. Spaces, commas, colons, and 0x are ignored. To convert or do math on those values first, use the Hex Calculator or the Binary Calculator.

File: Drag files onto the box or click to browse. Files up to 500 MB work, and they stay in your browser. Hashing a big file after a download? The Download Time Calculator estimates how long the transfer itself takes.

Uppercase hash output: Turn this on to show the hash in capital letters instead of small ones.

Enable HMAC / Keyed Hashing: Turn this on if you want a keyed hash instead of a plain hash.

Secret key: Type your key here when HMAC is on. The same text with a different key gives a different hash.

Search algorithms: Type a name like sha3 or crc to find an algorithm fast.

Algorithm list: Check the boxes for the hashes you want, such as MD5, SHA-256, SHA3-256, or CRC32. Use Select all, Deselect all, or Recommended set to change many at once.

Calculate Hash: Click this to get your results, the step-by-step math, and the chart of digest sizes and speed.

Verify box: Paste a hash you already have next to any result. The tool says Match or Mismatch.

Report metadata: Add a title, your name, your organization, and a purpose if you want them in your report. Your secret key is never saved.

Export buttons: Save your results as a PDF, CSV, JSON, HTML, or plain text file.

What Is a Hash Value?

A hash value is a short code made from data. You feed in text, bytes, or a whole file, and a hash function gives back a fixed-length string of letters and numbers, like 9e107d9d372bb6826bd81d3542a419d6. That code is called a hash, a digest, or a fingerprint.

The same input always gives the same hash. But change one letter, one space, or one bit, and the hash changes completely. That is why hashes are great for checking if data is exactly what you expect.

How Hash Functions Work

A hash function does not care how big your data is. A one-word message and a 400 MB video both come out the same length. Most hash functions do this in a few steps:

  • Convert to bytes: text is turned into raw bytes using an encoding like UTF-8.
  • Pad the data: extra bytes are added so the total splits into equal blocks (often 64 or 128 bytes).
  • Mix each block: a compression function scrambles each block into a running state, usually with rotations, additions, and XOR operations.
  • Output the digest: the final state is written out as hex digits.

Hashing only works one way. You cannot take a hash and turn it back into the original data. There is no "unhash" button.

Common Hash Algorithms

Different algorithms give different digest sizes and different safety levels:

  • SHA-256 and SHA-512: the modern standard. Safe and widely used for files, downloads, and signatures.
  • SHA-3 family: a newer design built on a "sponge" instead of the older block method.
  • BLAKE2b: very fast and strong, popular in newer software.
  • SHA-1, MD5, MD4, MD2: broken for security. People have made two different files with the same MD5 or SHA-1 hash. Still fine for spotting simple file errors, never for passwords or signatures.
  • RIPEMD and Whirlpool: older cryptographic options, still used in some tools and in Bitcoin addresses (RIPEMD-160). If you are tracking coin holdings too, see the Bitcoin Calculator.
  • CRC32, Adler-32, xxHash, MurmurHash, FNV, JOAAT: not cryptographic. They are built for speed, used in hash tables, ZIP files, and error checks. Do not use them for security.

Why Encoding and Line Endings Matter

Hashing works on bytes, not letters. So the same words can give two different hashes if the encoding changes. "café" in UTF-8 is not the same bytes as "café" in Latin-1. Line endings matter too: Windows uses \r\n while Linux and macOS use \n. That single hidden byte changes the whole digest. If your hash does not match what you expected, check these settings first. For other byte-level system tasks, the Chmod Calculator and the Subnet Calculator follow the same bits-and-bytes thinking.

What Hashes Are Used For

  • File integrity: software sites publish a SHA-256 hash. You hash your download and compare. If the codes match, the file is unchanged.
  • Digital signatures and certificates: the hash is signed instead of the whole file.
  • Version control: Git names every commit and file by its hash.
  • Blockchains: blocks are chained together by hashes.
  • Forensics and audits: hashes prove evidence files were not tampered with.
  • Duplicate detection: two files with the same hash are almost certainly the same file. Handy when you are planning storage with the RAID Calculator or moving data with the Data Transfer Calculator.

HMAC: Hashing With a Secret Key

A plain hash proves data did not change, but anyone can compute it. HMAC adds a secret key, so only people who know the key can make or check the code. It works by hashing the message twice, mixing the key in both times:

HMAC = H((key XOR opad) || H((key XOR ipad) || message))

HMAC is used for API request signing, webhooks, and secure cookies. The same message with two different keys gives two totally different results. HMAC needs a block-based hash, so it does not work with CRC32 or other simple checksums.

Hashing Is Not Password Storage

Do not store passwords with plain SHA-256 or MD5. They are too fast, so attackers can guess billions per second. Real password storage uses slow, salted functions built for the job, like bcrypt, scrypt, or Argon2. General hash functions are for integrity, not for hiding secrets.

Collisions and Digest Size

A collision is when two different inputs share the same hash. Since hashes are a fixed length, collisions must exist in theory. A good algorithm makes them practically impossible to find. Bigger digests give more room: a 256-bit hash has about 2256 possible values. You can explore numbers that large with the Big Number Calculator or work the odds with the Probability Calculator. Because of the birthday problem, an attacker needs roughly 2128 tries to find a collision in SHA-256, which is far beyond any computer today. MD5 collisions, by contrast, can be made in seconds on a laptop.


Formulas used

Byte and bit length of input
n = \text{bytes},\qquad \text{bits} = 8n
Merkle-Damgård padded length and block count
L = n + 1 + \ell_{\text{len}} + z,\qquad B = \frac{L}{b} = \left\lceil \frac{n + 1 + \ell_{\text{len}}}{b} \right\rceil
Sponge (SHA-3) block count at rate r
B = \left\lfloor \frac{n}{r} \right\rfloor + 1,\qquad r = 200 - 2d_{\text{bytes}}
Iterated compression function
H_i = f(H_{i-1}, M_i),\qquad i = 1 \dots B
HMAC keyed hash
\text{HMAC}(K, M) = H\big((K \oplus \text{opad}) \, \| \, H((K \oplus \text{ipad}) \, \| \, M)\big)
Digest size relations
d_{\text{bits}} = 8 \cdot d_{\text{bytes}} = 4 \cdot (\text{hex digits})
MD5 round constants
K_i = \left\lfloor \left| \sin(i+1) \right| \cdot 2^{32} \right\rfloor,\qquad i = 0 \dots 63
Adler-32 checksum
A = 1 + \sum_{i=1}^{n} b_i \bmod 65521,\quad S = \sum_{i=1}^{n} A_i \bmod 65521,\quad \text{Adler32} = 65536 \cdot S + A

Frequently asked questions

Why does my hash not match the one the website posted?

Check these things in order:

  • The download may be broken or incomplete. Download it again.
  • You may be comparing the wrong algorithm. A SHA-256 hash never matches an MD5 hash.
  • For text, your encoding or line ending setting may be different.
  • Extra spaces or a hidden newline at the end of your text change the result.

If the file still does not match after a fresh download, do not open it.

Does the file name change the file hash?

No. Only the bytes inside the file are hashed. You can rename a file and the hash stays the same. But if you edit even one byte inside it, the hash changes completely.

Can I hash several files at one time?

Yes. Drop or pick many files at once. Each file gets its own result card with every algorithm you checked. This is a fast way to spot two files that are really the same, since matching hashes mean matching content.

Why do some algorithms say Not applicable for HMAC?

HMAC needs a hash that works in fixed blocks, like MD5, SHA-256, or SHA-512. Simple checksums such as CRC32, Adler-32, xxHash, MurmurHash, FNV, and JOAAT do not have blocks, so they cannot be used with a key. They still work fine in normal mode.

Does turning on uppercase change the hash?

No. It only changes how the hash looks. a3f5 and A3F5 are the same value. The Verify box ignores case too, so you can paste a hash in either style and still get a Match.

What can I paste into the Verify box?

Paste the hash you were given. Spaces and colons are ignored, and capital letters are fine. The tool shows Match in green or Mismatch in red right away. Nothing is sent anywhere while it checks.

Why are there three different CRC32 options?

CRC32 comes in versions that use different math, so they give different answers for the same data.

  • CRC32b (IEEE) is the common one used in ZIP files, PNG images, and most tools.
  • CRC32c (Castagnoli) is used in some storage and network systems.
  • CRC32 (BZIP2) is used by bzip2.

If a tool just says CRC32, try CRC32b first.

Why do I get an error on my hex input?

Two things cause it. First, a letter that is not 0-9 or A-F. Second, an odd number of digits, since every byte needs exactly two. Spaces, commas, colons, and 0x are fine and get stripped out.

Will two computers give the same hash for the same file?

Yes. Hash algorithms are standard, so the same bytes always give the same digest on any device, browser, or operating system. That is what makes hashes useful for checking downloads and proving files did not change.

Is my secret key saved or included in a report?

No. The key stays in the box in your browser only. Exported PDF, CSV, JSON, HTML, and text reports say whether HMAC was on, but they never contain the key itself. Nothing is uploaded.

Does this tool work without internet?

Once the page has loaded, all the hashing runs on your own device. Your text, hex bytes, and files never leave the browser. That makes it safe for private or sensitive documents.

Why is my hash different after I pasted text from Word or a web page?

Word processors often add curly quotes, long dashes, or hidden spaces. Those are different bytes than plain quotes and dashes, so the hash changes. Paste into a plain text editor first if you need an exact match.

What does the Recommended set button pick?

It checks a balanced group: MD5, SHA-1, SHA-256, SHA-384, SHA-512, SHA3-256, BLAKE2b-512, RIPEMD-160, Adler-32, and CRC32b. SHA-256 carries the Recommended badge because it is the safest common choice for checking files today.

Why do the compute times change each time I click Calculate?

Times come from your own device, so they shift with browser load, other tabs, and background tasks. Use them to compare speed between algorithms, not as exact benchmarks. Digest size never changes.

What is the difference between a checksum and a cryptographic hash?

A checksum like CRC32 or Adler-32 is built for speed. It catches accidental damage, such as a bad download or a flipped bit. A cryptographic hash like SHA-256 also stops someone from making a fake file on purpose. Use a checksum for errors, a cryptographic hash for security.

Can I hash an empty input?

Yes. Every hash function has a set answer for zero bytes. For example, MD5 of nothing is d41d8cd98f00b204e9800998ecf8427e. It is a handy way to test that a tool is working right.

Why did my text turn into question marks with Latin-1 or ASCII?

Those encodings cannot hold every character. Emoji, accented letters, and other symbols get replaced with ?, and the hash reflects that swap. A warning shows under the encoding box when this happens. Use UTF-8 to keep all characters.

My big file is slow. Is something wrong?

No. Large files are read in 2 MB chunks and the bar shows progress. Speed depends on your device and how many algorithms you checked. Pick fewer algorithms to finish faster. Files over 500 MB are skipped.

What does the step-by-step section show?

It walks through the first algorithm in your list: turning your input into bytes, padding it into blocks, running the compression rounds, adding HMAC if it is on, and the final digest size. It is a quick way to see why byte count and block size matter.

Which export format should I choose?

  • PDF for audits and paperwork.
  • CSV for spreadsheets.
  • JSON for code and scripts.
  • HTML for a shareable page.
  • Plain text to paste into notes or docs.

Every export includes a report ID, a timestamp, and any Match or Mismatch results.