Hash
A fixed-size digest produced by a one-way function, used for data integrity, identifiers, signatures, and proof-of-work.
- Also known as
- cryptographic hashdigestmessage digest
A cryptographic hash function maps any input to a fixed-size output called a hash or digest. The same input always produces the same hash, while a tiny input change should produce an unrelated-looking result.
Useful hash functions are preimage-resistant, second-preimage-resistant, collision-resistant, fast to verify, and well distributed. Hashing is not encryption: a hash is designed for verification, not recovery of the original message.
Blockchains use hashes to link blocks, summarize transaction sets, derive identifiers, and define proof-of-work targets. Wallet software also hashes transaction data before signing it.
Related terms
3 linkedExplore connected entries beyond the alphabetical index.
Proof of Work (PoW)
→A consensus algorithm where computing power is used to solve complex problems, verify transactions, and create new blocks.
Hash rate
→The number of proof-of-work hash attempts performed per second by mining hardware or an entire network.
Entropy
→Entropy is the randomness used to generate secure wallet seeds, private keys, and nonces in cryptographic systems.
All terms and definitions may update as the Cryptionary improves.
