Hash Lab
Every hash, visualized.
An interactive reference for cryptographic, non-cryptographic, password, perceptual, and SNARK-friendly hash functions. Read it. Run it. Break it.
Hash families covered
Every family gets its own catalog page with specifications, internal-state visualizations, security status, attacks, and references.
Unkeyed cryptographic
MD/SHA/BLAKE/RIPEMD/Whirlpool/SM3/Streebog/Tiger/Skein/Grøstl, collision-resistant hashes for signatures, content addressing, integrity.
Keyed cryptographic (MACs)
HMAC, KMAC, Poly1305, CMAC, GMAC, UMAC/VMAC, produce a tag only the right key can verify.
Password hashing & KDFs
Argon2id, scrypt, bcrypt, PBKDF2, HKDF, deliberately slow / memory-hard hashes for password storage and key derivation.
Non-cryptographic
FNV, MurmurHash3, xxHash3, SipHash, CityHash, Jenkins, HighwayHash, t1ha, Pearson, BuzHash, fast distribution-focused hashes.
Cyclic redundancy checks
CRC-32, CRC-64, polynomial division over GF(2). Random-error detection in Ethernet, ZIP, gzip, XZ.
Checksums
Adler-32, Fletcher, Internet checksum, lightweight integrity verifiers for TCP/IP, zlib, OSPF.
What is here today
Multi-algorithm hasher
Paste text, see 27 algorithms compute simultaneously, every cryptographic, non-cryptographic, and checksum hash in hash-wasm, with security-status badges and family filters.
File hasher
Drop any file; nine algorithms compute in your browser via WebAssembly. Streaming with progress; gigabyte files supported.
Algorithm catalog
One page per algorithm: what it is, where it is used, security status, references. SHA-256 is live; more landing soon.
Glossary
Preimage, collision, avalanche, Merkle-Damgaard, sponge, HMAC, KDF - the terms that appear everywhere in the catalog, defined once.
Build your own hash function
Compose a toy hash from a construction (MD / HAIFA / sponge) and a primitive (XOR-rotate / S-box / mini-Keccak). Measure avalanche, hunt birthday collisions, mount length-extension on your own creation.
Hash image cipher
Encrypt an image with a hash-derived keystream + optional pixel permutation. Re-upload the encrypted image with the same key to decrypt.
Learn more
Background, history, and where this field is heading. Each algorithm page also has its own 10-question quiz for self-checking.
FAQ
The questions that come up most often, what's broken, which one to use, salt vs pepper, length-extension, and how to cite.
Interesting facts
Naming origins, weird constants, real-world incidents, and surprising uses of hash functions across the stack.
Timeline
When each algorithm was published, when each one broke, what replaced it. From the 1976 Diffie-Hellman paper to 2026.
Open problems
What we don't know yet, collisions on SHA-256, smaller SNARK-friendly hashes, adversarially-robust perceptual hashes.