What Is a Cryptographic Hash Function?
A cryptographic hash function maps any input to a fixed-size value — a digest — such that the same input always gives the same digest, a different input almost never collides with it, and the input cannot be recovered from the output. Those properties make it a tamper-evident fingerprint for data. Hashes are the building block beneath signatures, Merkle trees, content addressing, and every seal a verifier recomputes.
A fingerprint that cannot be forged
Because changing the input changes the digest unpredictably, a hash is a compact fingerprint: publish the digest, and anyone can later confirm they were handed the exact same bytes. Because it is one-way, the digest reveals nothing about the input, which is why hashes appear wherever data must be committed to without being disclosed.
The estate relies on exactly this: a sealed record’s identity is the hash of its canonical bytes, so a stranger re-derives it and confirms authenticity without trusting the source — the same property a Merkle tree and content addressing are built on.
Related standards
Questions
Is hashing the same as encryption?
No — hashing is one-way and has no key or decryption; encryption is reversible with a key. See the comparison.
What is a collision?
Two different inputs producing the same digest. A secure hash makes finding one computationally infeasible, which is what keeps it trustworthy.
Keep reading
By Michael Gord · published 2026-10-09 · part of the Agentic Encyclopedia. Dates are the day of publication; events are cited at their own dates.