How Blocks Connect: Hashes and Cryptographic Linking

The cryptographic glue that holds blockchain together — hash functions, the avalanche effect, and why tampering with old blocks is practically impossible.

12 min · beginner · part of Blockchain: The Trust Machine

The Chain of Trust

You have heard that blockchain is a "chain of blocks." But what actually makes this chain unbreakable? The answer is a careful use of cryptographic hash functions, combined with the economic incentive structure of mining or staking. This lesson digs into the cryptography. Each block in a typical blockchain contains four core elements: a batch of transactions, a timestamp indicating when the block was created, a unique fingerprint (hash) of the previous block in the chain, and the block's own unique fingerprint. The previous-block hash is what creates the "chain" — every block points back to the one that came before, all the way to the very first block (the genesis block). The fingerprint, or hash, is the cryptographic primitive that does all the heavy lifting. Understanding hashes properly is the single biggest leap in understanding blockchain. Once you see how they work, the immutability and tamper-evidence of the chain stop seeming magical and start seeming inevitable.

Also in this lesson

Understanding Hash Functions
How Blocks Link Together
Merkle Trees: Compressing Many Transactions
For Deeper Reading

Key terms

Hash function: A mathematical function that converts any input into a fixed-size string of characters. Same input always produces same output (deterministic), tiny changes produce wildly different outputs (avalanche effect), and reversing the function is computationally infeasible (one-way).
SHA-256: Secure Hash Algorithm 256-bit, designed by the NSA and standardized by NIST in 2001. Produces a 256-bit (64 hex character) output. Used by Bitcoin for mining and transaction hashing.
Keccak-256: A variant of SHA-3 used by Ethereum. Produces 256-bit output like SHA-256 but with a different internal algorithm (sponge construction). Slightly different from official NIST SHA-3 due to historical timing.
Avalanche effect: A property of cryptographic hash functions where any change to the input, no matter how small, produces a completely different and unpredictable output. Critical for security.
Collision resistance: The property that it is computationally infeasible to find two different inputs producing the same hash output. SHA-256 has no known collisions.
Genesis block: The very first block in a blockchain. Bitcoin's genesis block was mined on January 3, 2009 and contains the message "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks."
Merkle tree: A binary tree of hashes invented by Ralph Merkle in 1979. Used in Bitcoin to compress all transactions in a block into a single Merkle root, enabling efficient inclusion proofs (Simplified Payment Verification).
Merkle root: The single hash at the top of a Merkle tree, included in the block header. Summarizes all transactions in the block in a way that allows efficient verification.
Simplified Payment Verification (SPV): A way for lightweight clients (like mobile wallets) to verify transactions without downloading the entire blockchain, using Merkle proofs from full nodes.
Block header: A small (80-byte for Bitcoin) summary of a block containing the previous block hash, Merkle root, timestamp, difficulty target, and nonce. Used for chain verification without full block data.
Immutability: The property that historical blockchain data cannot practically be changed. Not absolute — alteration requires redoing all proof-of-work since the change point, which is economically infeasible for major chains.
51% attack: An attack where a single entity controls more than half of a blockchain's computational power (or stake), potentially allowing them to rewrite recent history. Has happened to small chains; never successfully to Bitcoin or Ethereum.

Continue this lesson — 4 more sections in the CryptoBipto app.

Open lesson

Educational only — not financial advice.