What is Hashing?. Hashing turns any input into a fixed‑length fingerprint. A tiny change in input yields a completely different hash.
How it works
Functions like SHA‑256 map data to hashes that are easy to compute but infeasible to reverse. Chains use hashing to link blocks and verify integrity.
Why it matters
Hashes let nodes check data quickly and detect tampering without reading everything from scratch.
Common pitfalls
- Thinking a hash encrypts data—it does not
- Relying on weak or deprecated hash functions
- Confusing checksums with signatures
Quick example
A wallet verifies the block header hash matches network difficulty before trusting the chain tip.
See also
- Merkle Tree
- Proof of Work
- Block Explorer
TL;DR: What is Hashing? defined in plain English with practical next steps.
Add comment
You must be logged in to post a comment.