Blockchain
The blockchain is a data structure consisting of cryptographically linked blocks, each containing a batch of timestamped transactions and a reference (hash) to the previous block. The chain is append-only: once a block is added, altering it requires recomputing all subsequent blocks, which is designed to be computationally infeasible in a properly functioning network.
Originally introduced as the ledger mechanism for Bitcoin, blockchain architecture has since been generalized to distributed systems beyond currency, including supply chain tracking, identity verification, and smart contract platforms. The core innovation is not the chain structure itself — linked lists with hashes are elementary — but the combination of the chain with a consensus mechanism that makes the append-only property enforceable without a trusted authority.
The relationship between blockchain structure and consensus mechanism is often misunderstood. The chain provides the data structure; the consensus mechanism provides the social agreement about which chain is canonical. A blockchain without consensus is merely a linked list. Consensus without a chain is merely agreement. The historical significance lies in their synthesis.
Technical Architecture
A blockchain is technically a linked list with cryptographic verification. Each block contains: a header with metadata (timestamp, version number, nonce for proof-of-work systems), a reference to the previous block's hash, a Merkle root summarizing the block's transactions, and the transaction data itself. The hash chain creates tamper evidence: changing any transaction in any block changes that block's hash, which breaks the link to the next block, making the alteration detectable to any node verifying the chain.
The Merkle tree structure within each block enables efficient verification. Rather than checking every transaction to verify the block, a node can verify the Merkle root, which cryptographically commits to all transactions in the block. This enables light clients — nodes that do not store the full blockchain — to verify transactions using only block headers and Merkle proofs. The design reflects a principle common in distributed systems: move computation to where the data is, but structure the data so that verification can be done with minimal information.
The append-only property is enforced not by the data structure alone but by the combination of the data structure with the consensus mechanism. In a permissioned blockchain with trusted validators, the append-only property is enforced by access control. In a permissionless blockchain like Bitcoin, it is enforced by economic incentives: rewriting history would require re-performing the proof-of-work for all subsequent blocks, which is computationally infeasible for an attacker with less than majority hash power.
Types of Blockchains
Blockchains are commonly categorized by their access model:
Public blockchains (Bitcoin, Ethereum) are open to anyone. Participation requires no permission; anyone can read the chain, submit transactions, and (in proof-of-work systems) attempt to mine blocks. The security model assumes that participants are mutually distrustful and potentially adversarial. Public blockchains achieve consensus through economic mechanisms rather than institutional trust.
Private blockchains restrict participation to known entities. They sacrifice decentralization for efficiency: with fewer validators and no need for economic consensus mechanisms, they can achieve higher throughput and lower latency. Private blockchains are used in supply chain tracking, internal record-keeping, and inter-organizational coordination where the participants are known but do not fully trust each other.
Consortium blockchains occupy a middle ground: participation is limited to a predefined set of organizations, but no single organization controls the network. This model is common in financial services, where groups of banks operate shared ledgers for settlement and clearing. The consortium model reflects a pragmatic recognition that full decentralization is unnecessary for many use cases and that institutional trust, while incomplete, is not zero.
Consensus Mechanisms
The consensus mechanism determines how the network agrees on the canonical chain. The two dominant approaches are:
Proof of Work (PoW), used by Bitcoin and (currently) Ethereum, requires miners to solve computationally difficult puzzles to create blocks. The difficulty adjusts to maintain a consistent block time despite varying total hash power. PoW is secure against Sybil attacks because creating multiple identities does not reduce the computational cost of attack; the security guarantee is economic — an attacker must control a majority of hash power, which requires owning or renting specialized hardware at enormous cost.
Proof of Stake (PoS), used by newer blockchains and planned for Ethereum, selects validators based on the amount of cryptocurrency they stake as collateral. Validators propose and attest to blocks; if they act maliciously, their stake is slashed (destroyed). PoS achieves the same security property as PoW — controlling the chain requires controlling a majority of the stake — but without the energy consumption. Critics argue that PoS creates centralization pressures (wealthier participants can stake more, earn more rewards, and become wealthier still) and that the slashing mechanism introduces new attack vectors.
Other mechanisms include Delegated Proof of Stake (DPoS, used by EOS and Cardano), where token holders vote for validators; Proof of Authority (PoA), where known validators rotate block production; and Byzantine Fault Tolerant (BFT) consensus, used in some permissioned blockchains. Each mechanism embeds a different theory of trust: PoW trusts computation, PoS trusts economic incentives, PoA trusts institutional reputation, BFT trusts mathematical guarantees within a known validator set.
Smart Contracts and Programmability
Smart contracts — self-executing programs stored on the blockchain — extend the blockchain from a ledger of transactions to a platform for decentralized computation. Introduced conceptually by Nick Szabo in the 1990s and implemented practically by Ethereum in 2015, smart contracts enable decentralized applications (dApps) that operate without centralized servers.
The programmability of smart contracts introduces new challenges. Code is law — the contract executes exactly as written, with no room for interpretation or remediation. Bugs in smart contracts have resulted in losses of hundreds of millions of dollars, and the immutability of the blockchain makes patching difficult. The 2016 DAO hack, in which an attacker exploited a recursive call vulnerability to drain funds, led to a controversial hard