Technology calculators

Checksum Calculator

Updated Nov 17, 2026 By Infinity Calculator Formulas Sources
Rate
Algorithm Selection
Changing the algorithm clears the previous result.
Quick pick — supported algorithms
Input Data
Input format
Size: 0 bytes | 0 characters

Read as binary in your browser; contents are not shown in the text box.

Checksum Result
Output Size: 0 bytes | 0 characters
Verify Checksum
Comparison ignores letter case, spaces, colons and a leading 0x.
Output Representations
RepresentationValue
Step-by-Step Solution
Output Byte Values

Introduction

A checksum is a short code made from data. If even one bit of the data changes, the code changes too. That makes checksums a fast way to check if a file or message is still correct.

This free online checksum calculator makes that code for you. Type text, paste hex bytes, upload a file, or load a URL. Then pick an algorithm and get the result right away. Everything runs in your browser, so your data stays on your computer.

You can choose from many hash and checksum types:

  • Cryptographic hashes: MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-512, SHA3, and RIPEMD-160
  • Simple checksums: Adler-32, Fletcher-16, and Fletcher-32
  • CRC codes: CRC-8, CRC-16, CRC-32, CRC-32C, and more

The tool also does more than just print a hash. You can turn on HMAC to add a secret key, paste a known checksum to verify a download, and view the result in hex or Base64, plus decimal and binary for the shorter checksums. A step-by-step section shows how the answer was found, and a chart shows each byte of the digest.

How to use our Checksum Calculator

Pick an algorithm, enter your text, file, or hex data, and the calculator shows the checksum or hash value in hex, Base64, and more, plus the steps used to get it.

Hash Algorithms tab: Click this tab to use a hash function like MD5, SHA-1, SHA-256, SHA-512, SHA-3, RIPEMD-160, Adler-32, or Fletcher.

Hash / checksum algorithm: Choose the hash you need from the drop-down list. SHA-256 is the default and is a safe pick for most files.

CRC Algorithms tab: Click this tab to use a CRC check instead, such as CRC-8, CRC-16, or CRC-32.

CRC variant: Pick the exact CRC type, like CRC-32, CRC-32C, or CRC-16-CCITT. Each one has its own set of settings: polynomial, start value, bit order and final XOR.

Polynomial representation: Leave this on the preset choice to match the standard CRC value. Change it to Normal, Reversed, or Reversed reciprocal only if you need a different bit order.

Quick pick buttons: Tap any button in the list to jump straight to that algorithm.

Input format: Choose Text if you are typing words, or Hex String if you are pasting hex bytes like 54 68 65.

Data to hash: Type or paste the data here. The box below shows how many bytes and characters you entered.

Upload a file: Pick a file from your device to hash it. Files up to 32 MB work, and they stay in your browser.

Load from URL: Paste a web address and click Load URL to fetch a file and hash it. Some sites block this, so upload the file if it fails.

Auto-Calculate: Leave this on to get results as you type. Turn it off if you want to press Calculate yourself.

Enable HMAC: Turn this on to make a keyed hash, then type your secret key in the box. Use the eye button to show or hide the key.

Calculate and Reset: Press Calculate to run the hash, or Reset to go back to the sample values.

Lowercase / Uppercase: Switch the letter case of the hex result to match the format you need.

Expected checksum: Paste the known checksum from the file's source, then click Verify. The tool says MATCH or NO MATCH, and ignores case, spaces, colons, and a leading 0x.

Copy and Download: Use Copy Output to copy the result, or Download Result to save it as a text file.

What Is a Checksum?

A checksum is a short code made from a file or a piece of text. You run the data through a math formula, and it gives back a fixed-length string of numbers and letters. If even one bit of the data changes, the checksum changes too. That makes it an easy way to check if a file arrived whole and unchanged.

Why People Use Checksums

  • Check downloads. Many websites post a SHA-256 value next to a file. You hash the file you downloaded and compare the two codes. A match means the file is good.
  • Find errors. Networks and storage devices use CRC codes to spot bits that flipped by accident.11 The ZIP format requires data integrity for each file using CRC32.9
  • Compare files. Two files with the same hash are almost always the same file.
  • Store passwords safely. Apps save a hash instead of the real password. NIST's digital identity guidelines say passwords shall be salted and hashed using a suitable password hashing scheme.7

Hash Functions vs. CRC

Cryptographic hashes like SHA-256, SHA-512, SHA-3, and RIPEMD-160 are built to be hard to fake. It should be impossible, in practice, to make two different files share one hash. Use these when security matters.

CRC codes like CRC-32 and CRC-16 are fast but not secure. They catch random mistakes, not attacks.10 Anyone can change a file and fix the CRC to match.12 Use CRC for error checking only.

Simple checksums like Adler-32 and Fletcher-16/32 add up the data in two running sums. They are very fast, and Adler-32 is the checksum inside the zlib format.6 They miss more accidental errors than a CRC does, and they are also easy to fool.10

Common Algorithms and Digest Sizes

AlgorithmOutput sizeGood for
MD5128 bits (32 hex chars)Old file checks only (broken for security)
SHA-1160 bits (40 hex chars)Legacy systems (no longer safe)
SHA-256256 bits (64 hex chars)Most uses today, including downloads
SHA-384 / SHA-512384 or 512 bits (96 or 128 hex chars)Extra strength, long-term use
SHA-3224 to 512 bits (56 to 128 hex chars)A backup to SHA-2, built a different way
CRC-3232 bits (8 hex chars)ZIP files, Ethernet, quick error checks

The sizes in the table come from the standards that define each algorithm. MD5 produces a 128-bit message digest.3 SHA-1 produces a 160-bit digest, and SHA-224, SHA-256, SHA-384 and SHA-512 produce digests of 224, 256, 384 and 512 bits.1 The four SHA-3 hash functions, SHA3-224, SHA3-256, SHA3-384 and SHA3-512, are named for their digest lengths in bits.2

A Warning About MD5 and SHA-1

Both MD5 and SHA-1 are broken for security. The published attacks against MD5 show that it is not prudent to use MD5 when collision resistance is required.3 For SHA-1, NIST says collision attacks have been used to undermine it, and that SHA-1 should be phased out by December 31, 2030.4 They still work for spotting accidental damage, but never trust them for signatures or proof that a file is safe. Pick SHA-256 or better for those jobs. Passwords need a password hashing scheme instead, which takes a password, a salt, and a cost factor to make each guess more expensive for an attacker.7

CRC Polynomial Forms

Every CRC is based on a polynomial written as a hex number.12 The same polynomial can be written three ways: normal (as written, bits shift left), reversed (bits flipped, used by CRC-32 and CRC-16-IBM), and reversed reciprocal (Koopman form). The math result depends on which form and bit order you use, so a CRC-32 in normal form will not match the value your ZIP program shows. Each CRC variant has one standard form, and that is the one you almost always want. A CRC is the remainder of a polynomial division, which works like modulo arithmetic except that adding bits is the same as XOR.12

What HMAC Adds

HMAC mixes a secret key into the hash, so a message authentication code checks both where a message came from and that it was not changed.5 Without the key, no one can create a matching code, even if they have the message. APIs and web tokens use HMAC to prove a message came from the right sender and was not edited on the way. Plain hashes cannot do this, because anyone can hash anything.

Hex, Base64, and Case

A hash is really just a string of bytes. Hexadecimal is the usual way to show it, with two characters per byte.13 Base64 packs the same bytes into fewer characters, which some tools prefer.13 Upper and lower case hex mean the exact same value, so A3FF and a3ff match.13

Tips for Comparing Checksums

  • Make sure both codes come from the same algorithm. A SHA-256 will never match a SHA-1.
  • Check the length. 32 hex characters is MD5, 40 is SHA-1 or RIPEMD-160, and 64 is SHA-256 or SHA3-256.
  • Spaces, colons, and a leading 0x do not change the value.
  • Text hashes depend on encoding and on hidden characters. An extra newline at the end changes the whole result.

Formulas used

Adler-32 checksum 6
A = \left(1 + \sum_{i=1}^{L} b_i\right) \bmod 65521,\quad B = \left(\sum_{i=1}^{L} A_i\right) \bmod 65521,\quad \text{Adler-32} = B \times 65536 + A
Fletcher checksum (16-bit: mod 255; 32-bit: mod 65535)
s_1 = \left(\sum_i d_i\right) \bmod m,\quad s_2 = \left(\sum_i s_{1,i}\right) \bmod m,\quad \text{Fletcher} = s_2 \times (m+1) + s_1
CRC register update (normal, MSB-first) 12
\text{crc} \leftarrow \big((\text{crc} \ll 1) \oplus (\text{poly} \cdot \text{msb}(\text{crc}))\big) \wedge \text{mask}
CRC register update (reflected, LSB-first) 12
\text{crc} \leftarrow \big((\text{crc} \gg 1) \oplus (\text{poly}_{rev} \cdot (\text{crc} \wedge 1))\big) \wedge \text{mask}
Final CRC value 12
\text{CRC} = (\text{crc}_{\text{raw}} \oplus \text{xorout}) \wedge \text{mask}
Reversed reciprocal (Koopman) polynomial form 11
\text{poly}_{\text{recip}} = \left(\left(\text{poly} \gg 1\right) \vee 2^{w-1}\right) \wedge \text{mask}
Merkle-Damgard padding block count 1
k = \left\lceil \frac{L + 9}{64} \right\rceil \ \text{(64-byte blocks)},\qquad k = \left\lceil \frac{L + 17}{128} \right\rceil \ \text{(128-byte blocks)}
HMAC keyed hash 5
\text{HMAC}(K, M) = H\big((K' \oplus \text{opad}) \parallel H((K' \oplus \text{ipad}) \parallel M)\big),\quad K' = \begin{cases} H(K) \parallel 0^{B-L} & |K| > B \\ K \parallel 0^{B-|K|} & \text{otherwise} \end{cases}

Frequently asked questions

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

Check these things:

  • Both codes must use the same algorithm.
  • Hashing text is not the same as hashing a file. A file often ends with a newline.
  • Extra spaces or hidden characters change the result.
  • For CRC, the polynomial form must match the standard one.

Which algorithm should I pick?

SHA-256 for most jobs, including checking downloads. SHA-512 or SHA3-512 if you want extra strength.2 CRC-32 only for quick error checks.10 Avoid MD5 and SHA-1 for anything about security.

Can I use HMAC with CRC or Adler-32?

No. HMAC needs a real cryptographic hash. The tool hides the HMAC switch on the CRC tab and shows a note if you try it with Adler-32 or Fletcher. Pick SHA-256 or another hash instead.

Does uppercase or lowercase hex matter?

No. A3FF and a3ff are the same value.13 The case buttons only change how it looks so you can match another tool's format. The Verify box ignores case too.

Why does the same text give different sizes in bytes and characters?

Plain letters take one byte each. UTF-8 encodes each character with 1 to 4 bytes, so accented letters, emoji, and other symbols take 2 to 4 bytes.8 The hash works on bytes, so byte count is what matters.

Can two different files have the same checksum?

Yes, that is called a collision. With CRC-32 or MD5 it is easy to force. The IETF says it is not prudent to use MD5 when collision resistance is required.3 With SHA-256 no one has found one, and the odds by chance are near zero. Finding one on purpose is computationally infeasible.1

How can I tell which hash a checksum came from?

Count the hex characters: 8 is a 32-bit checksum such as CRC-32, CRC-32C, Adler-32 or Fletcher-32, 32 is MD5, 40 is SHA-1 or RIPEMD-160, 56 is SHA-224 or SHA3-224, 64 is SHA-256 or SHA3-256, 96 is SHA-384 or SHA3-384, and 128 is SHA-512 or SHA3-512. A length narrows the choice, but two algorithms with the same output size look alike.


Sources

  1. Secure Hash Standard (SHS) (FIPS PUB 180-4). National Institute of Standards and Technology. 2015;§1 Figure 1; §5.1 Padding the message. Accessed September 29, 2026.
  2. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions (FIPS PUB 202). National Institute of Standards and Technology. 2015;§1 Introduction. Accessed September 29, 2026.
  3. Turner S, Chen L. Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms (RFC 6151). Internet Engineering Task Force. 2011;§1 Introduction. Accessed September 29, 2026.
  4. NIST Retires SHA-1 Cryptographic Algorithm. National Institute of Standards and Technology. 2022. Accessed September 29, 2026.
  5. The Keyed-Hash Message Authentication Code (HMAC) (FIPS PUB 198-1). National Institute of Standards and Technology. 2008;§3; §4. Accessed September 29, 2026.
  6. Deutsch P, Gailly J-L. ZLIB Compressed Data Format Specification version 3.3 (RFC 1950). Internet Engineering Task Force. 1996;§2.2 (ADLER32); §9 Appendix. Accessed September 29, 2026.
  7. Digital Identity Guidelines: Authentication and Authenticator Management (SP 800-63B-4). National Institute of Standards and Technology. §3.1.1.2 Password Verifiers. Accessed September 29, 2026.
  8. Yergeau F. UTF-8, a transformation format of ISO 10646 (RFC 3629). Internet Engineering Task Force. 2003;§3 UTF-8 definition. Accessed September 29, 2026.
  9. APPNOTE.TXT - .ZIP File Format Specification. PKWARE. 4.1.5 and 4.4.7. Accessed October 8, 2026.
  10. Sheinwald D, Satran J, Thaler P, Cavanna V. Internet Protocol Small Computer System Interface (iSCSI) Cyclic Redundancy Check (CRC)/Checksum Considerations (RFC 3385). Internet Engineering Task Force. 2002;§10 Security Considerations. Accessed November 17, 2026.
  11. Koopman P. 32-Bit Cyclic Redundancy Codes for Internet Applications. International Conference on Dependable Systems and Networks (DSN) 2002. Carnegie Mellon University. 2002;§1 Introduction (p. 1); §2 Background (p. 2). Accessed November 17, 2026.
  12. Stigge M, Plötz H, Müller W, Redlich J-P. Reversing CRC: Theory and Practice. HU Berlin Public Report SAR-PR-2006-05. Humboldt University Berlin. 2006;§2 How CRC(32) Works and §2.1 Notation (pp. 3-6); §6 Conclusion (p. 17); Appendix A.2 (p. 18). Accessed November 17, 2026.
  13. Josefsson S. The Base16, Base32, and Base64 Data Encodings (RFC 4648). Internet Engineering Task Force. 2006;§4 Base 64 Encoding; §8 Base 16 Encoding. Accessed November 17, 2026.