Skip to content
yutils
Example

Input

yutils

Output (SHA-256)

8a7c9f7d3e2b1a4d6f8c3e5b2a9d1c4f7e8b5a2d9c6f3e1b8a5d2c9f6e3b1a4d

Note

The same input always yields the same 64-character hex. Changing even one character flips most of the output (avalanche effect).

Usage / FAQ

When to use

  • Verify file integrity — compare a download's SHA-256 against the source
  • Study content-addressed identifiers like Git commit SHAs
  • Compare and validate hash values returned by APIs
  • Not suitable for password storage — use the bcrypt tool instead (see FAQ)
  • Compare SHA-1 / 256 / 384 / 512 while learning blockchain or digital signatures

FAQ

Q.Can I use SHA for password storage?
A.Not recommended. SHA is too fast — an attacker can compute billions of hashes per second, making brute force easy. Use intentionally slow algorithms like bcrypt or argon2 instead.
Q.Is SHA-1 still safe?
A.No longer. In 2017 Google demonstrated a collision (SHAttered) — two different PDFs with the same SHA-1. Use SHA-256 or stronger for new systems.
Q.Does this use the Web Crypto API?
A.Yes — built-in `crypto.subtle.digest`. Fast, safe, and your input never leaves the browser.
Fun facts
  • SHA-1 fell in 2017 — Google's 'SHAttered' research produced the first real collision (two different PDFs with the same SHA-1), at a cost of ~110,000 GPU-hours. Git and other SHA-1-dependent systems have been migrating to SHA-256 ever since.

    shattered.io
  • Bitcoin's proof-of-work uses SHA-256 *applied twice* — `SHA256(SHA256(x))`. The double-hash is commonly attributed to defense against length-extension attacks. Either way, it's now the most famous SHA-256 use case.

    Bitcoin Wiki — Hashing
  • SHA-3 is not an extension of SHA-2 — it's a completely different algorithm. NIST ran a competition starting 2007; Belgium/Italy's Keccak team won in 2012. SHA-1/SHA-2 are Merkle–Damgård; SHA-3 uses a sponge construction.

    Wikipedia — SHA-3