Cointegrity

Hash

Web3 / blockchain technology

The fixed-length output produced by applying a cryptographic hash function to data of any size—a fundamental building block of blockchain security and data integrity. A cryptographic hash function takes any input (a transaction, a block's contents, a document) and produces a deterministic fixed-length output (256 bits in SHA-256) that appears random and changes drastically with even the smallest input change. Hashes are one-way functions: it is computationally infeasible to derive the original input from the hash. In blockchains, each block contains the hash of the previous block, creating the chain structure that makes tampering detectable. In Bitcoin mining, miners compete to find a nonce that makes the block hash fall below a target value—'proof of work.' In Merkle trees, hashes of individual transactions are combined pairwise until a single Merkle root hash summarizes all transactions. Example: Bitcoin's block hash looks like '00000000000000000008a5c2d5fe01f... '—the leading zeros indicate how much computational work was performed to find this hash, as the probability of randomly finding a hash with that many leading zeros is astronomically low. Why it matters for Web3: Hash functions are the cryptographic primitive that enables immutability, proof of work, Merkle proofs, and content addressing in IPFS—essentially, they are the glue that holds blockchain's security model together.

Category: blockchain technology, privacy technology

Explore the full Web3 Glossary — 2,000+ expert-curated definitions. Need guidance? Talk to our consultants.