A hash pointer is a data structure that combines two elements: a pointer to where specific data is stored (its location in memory or on a network), and a cryptographic hash of that data (a digest that verifies the data's integrity). Hash pointers are the structural innovation that makes blockchain's chain of immutable data possible.
THE CONCEPT: POINTER + VERIFICATION
A regular pointer in computer science simply tells you where data is located like a street address telling you where a house is. A hash pointer does more: it tells you where the data is AND lets you verify that the data hasn't been changed since the pointer was created. If the data at the location has been modified in any way, the hash you compute from it will differ from the hash stored in the pointer immediately revealing tampering.
HOW HASH POINTERS CREATE THE BLOCKCHAIN
Each block in a blockchain contains a hash pointer to the previous block specifically, the cryptographic hash of the previous block's entire content (including its own hash pointer to the block before it, and so on recursively). This recursive structure means: altering transaction data in block 100 changes that block's hash, breaking the hash pointer in block 101, which changes block 101's hash, breaking the pointer in block 102... all the way to the current block. An attacker would need to recompute valid hashes for every subsequent block to make the chain appear consistent computationally infeasible at Bitcoin's hash rate.
HASH POINTERS IN MERKLE TREES
Merkle Trees (used to organise transactions within a block) also rely on hash pointers. Each non-leaf node in the Merkle Tree is a hash pointer combining the hashes of its two children. The root of the tree (Merkle Root) is stored in the block header and acts as a hash pointer to all transactions in the block. This structure enables efficient verification: prove a transaction is in a block using only O(log n) hash values rather than downloading all transactions.
SIGNIFICANCE FOR BLOCKCHAIN INTEGRITY
Hash pointers are what transform a simple linked list of data into an append-only, tamper-evident blockchain. They are elegant in their simplicity: a single mathematical function (cryptographic hashing) applied recursively through a data structure creates security properties that protect billions of dollars in value.