Three properties make hashes useful. They are deterministic, so the same input always gives the same output. They are effectively one-way: from the fingerprint you cannot work back to the data. And they show the avalanche effect, where a single altered character produces an output with no visible relationship to the original. A hash is not encryption, because there is nothing to decrypt; it is a summary, not a container.
Blockchains lean on this constantly. Every <a href="/glossary/block/">block</a> includes the hash of the block before it, so the chain is literally a chain of fingerprints: alter an old transaction and its block’s hash changes, which invalidates every hash that followed. Individual transactions are identified by their own hash, and that is the string you paste into a block explorer to look one up. Addresses and public keys are put through hashing too.
Mining is hashing at scale. Under <a href="/glossary/proof-of-work/">proof of work</a>, miners repeatedly hash a candidate block with a changing number attached, hunting for an output below a difficulty target. There is no clever shortcut, only guessing at enormous speed, which is precisely why the work is costly and therefore meaningful. The combined guessing speed of a whole network is its <a href="/glossary/hash-rate/">hash rate</a>.
Key takeaways
- Hashing is one-way by design, which is why it is used to verify data rather than to store or conceal it.
- Because every block commits to the previous block's hash, rewriting old history means redoing everything that came after it.
- A transaction hash is the reference number for looking up any transfer in a block explorer.
Hash — frequently asked questions
Can two different inputs ever produce the same hash?
In theory yes — there are infinitely many possible inputs and a finite number of outputs, so collisions must exist. In practice a well-designed hashing function makes finding one computationally infeasible, and that assumption is what the security rests on. When weaknesses have been found in older functions, systems migrate to stronger ones rather than trying to patch around the problem.
Is a hash the same as encryption?
No. Encryption is reversible with the right key, because the whole point is getting the original data back. Hashing throws information away, so there is no key and no way back. That is a feature: a system can check whether data matches a known fingerprint without holding the data itself. Confusing the two leads to some genuinely dangerous design mistakes.
New to crypto, or filling in the gaps? Work through the essentials in Learn, browse every term A–Z, or see live prices for the coins these concepts power.