Type text or add a file and the tool computes MD5, SHA-1, SHA-224, SHA-256, SHA-384 and SHA-512 together. Text is hashed as UTF-8; files are read in chunks inside your browser, so even large downloads can be checked without uploading them.
Switch to the Verify tab, put the file or text in ①, and paste the checksum from the download page into ② Expected hash. A bare hash, a full sha256sum or openssl line, Base64 and SRI values like sha384-… all work; the algorithm is recognised from the length. When text does not match, the tool tries the usual culprits, such as the extra line break added by echo, names the cause and offers a one-click fix.
What changed this time compares the hash with the previous input. Change a single character and roughly half of the bits flip; that is why a hash cannot be reversed and why a slightly altered file never passes a checksum.
A plain hash proves the content is intact, not who sent it. Switch to the HMAC tab, paste the raw request body in ① and the signing secret in ②, and the results become HMAC, the scheme webhooks use for signatures. Paste the signature you received in ③ to check it in the same place.
Common questions and answers about this topic.
Use whatever the other side publishes; to choose yourself, SHA-256 is the safe default. MD5 and SHA-1 are fine for spotting accidental corruption, but collisions can be crafted, so they cannot prove a file was not tampered with.
A hash covers bytes, not how text looks. The usual causes are a trailing line break (echo adds one), Windows versus Unix line breaks, extra spaces, or a different encoding. Paste the expected value and the tool checks these for you.
No. Everything, including large files and HMAC keys, is computed in your browser and never leaves your device.
No, hash functions are one-way. Sites that claim to decrypt MD5 only look up hashes of common words they computed in advance.
No. General hashes are designed to be fast, which makes guessing passwords fast too. Use a password hashing algorithm such as bcrypt, scrypt or Argon2.