Introduction to Blockchain: Core Concepts, Value Propositions, and Application Scenarios

The evolution of blockchain technology is deeply intertwined with the long-standing quest for a decentralized, trustless electronic cash system, a pursuit that dates back to the early days of the internet and the rise of the cypherpunk movement in the 1980s. Cypherpunks, a collective of cryptographers, privacy advocates, and software engineers, were fundamentally skeptical of centralized institutions’ ability to safeguard digital value and personal privacy, a skepticism that was amplified by the 2008 global financial crisis, which exposed widespread malfeasance and systemic risk in the traditional financial system. This chapter traces the historical origins of blockchain, defines its core technical definition and structural components, elaborates on its three defining technical characteristics, compares its technical and economic value propositions against traditional centralized systems, and surveys real-world application scenarios across finance, supply chain, digital identity, and public services, building a complete foundational cognitive framework for beginners.

1.1 Historical Background: From Digital Cash Dreams to Bitcoin and Ethereum

The earliest conceptualization of digital cash can be traced to 1982, when cryptographer David Chaum proposed the blind signature protocol, a cryptographic primitive that enabled anonymous, untraceable digital transactions without revealing the sender’s identity. In 1990, Chaum founded DigiCash, the first commercial electronic cash system, which used blind signatures to issue e-cash tokens that could be spent anonymously, similar to physical cash. While DigiCash demonstrated the technical feasibility of digital cash, it ultimately failed in 1998 due to its reliance on a centralized issuing authority: users had to trust DigiCash as the sole issuer and custodian of e-cash, and when the company faced financial distress, user funds were at risk of total loss. This inherent flaw highlighted a core contradiction of early digital cash systems: the tradeoff between usability and decentralization.

Between 1998 and 2008, multiple attempts were made to build decentralized digital cash systems. In 1998, cryptographer Wei Dai proposed b-money, a system that used a distributed ledger and proof-of-work to enable peer-to-peer transactions without a central issuer, but it lacked a robust solution to the double-spending problem, a critical flaw in decentralized systems where the same digital asset could be spent multiple times without a central authority to validate transactions. In 2004, Hal Finney proposed Reusable Proof of Work (RPOW), the first implementation of a proof-of-work-based digital cash system, but it still relied on a centralized server to track transaction history, limiting its decentralization.

The breakthrough came in 2008, when an anonymous individual or group using the pseudonym Satoshi Nakamoto published the Bitcoin whitepaper titled *Bitcoin: A Peer-to-Peer Electronic Cash System*[^1]. The whitepaper proposed a fully decentralized electronic cash system that solved the double-spending problem using a public, immutable, distributed ledger (the blockchain) and a consensus mechanism called proof-of-work (PoW). On January 3, 2009, Nakamoto mined the first Bitcoin block, known as the Genesis Block, which embedded the headline of that day’s *The Times*: "Chancellor on brink of second bailout for banks", a clear critique of the centralized financial system’s failures during the 2008 crisis. Bitcoin was the first successful implementation of blockchain technology, proving that a decentralized, trustless monetary system could operate at scale without a central issuing authority.

For the first four years of its existence, blockchain technology was almost exclusively associated with Bitcoin and cryptocurrency use cases. The paradigm shifted in 2013, when Vitalik Buterin, a 19-year-old programmer and co-founder of *Bitcoin Magazine*, published the Ethereum whitepaper, which proposed extending blockchain functionality beyond simple peer-to-peer payments to support programmable smart contracts: self-executing contracts with the terms of the agreement directly written into code. Smart contracts enabled developers to build decentralized applications (dApps) on top of the blockchain, opening up use cases far beyond digital cash, from decentralized finance (DeFi) to supply chain tracking to digital identity. The Ethereum mainnet launched in July 2015, marking the beginning of the “blockchain 2.0” era, and sparking widespread interest in the technology’s potential across industries.

1.2 Core Definition and Basic Structural Components

At its most fundamental level, a blockchain is a distributed, append-only, cryptographically linked ledger that records transactions in a way that is transparent, immutable, and verifiable by all participants in the network. Unlike traditional ledgers maintained by a single central entity (such as a bank or government agency), a blockchain is replicated across thousands of independent nodes (computers) in a peer-to-peer (P2P) network, with no single point of control or failure.

The basic structural unit of a blockchain is the *block*, which consists of two core components: 1. Block Header: A 80-byte metadata section that contains critical information linking the block to the rest of the chain:

• *Previous Block Hash*: A 256-bit cryptographic hash of the header of the immediately preceding block, forming the cryptographic link that makes the chain immutable.
• *Merkle Root*: A 256-bit hash of all transactions included in the block, generated using a Merkle tree data structure, which enables efficient verification of transaction authenticity without needing to download the entire block.
• *Timestamp*: The Unix timestamp of when the block was mined/validated, recording the chronological order of transactions.
• *Nonce*: A 32-bit arbitrary number used in the proof-of-work consensus process to generate a valid block hash that meets the network’s difficulty target.
• *Consensus Data*: Additional metadata specific to the consensus mechanism used (e.g., block height, validator signature for proof-of-stake chains).

2. Block Body: A variable-length section that contains the list of transactions included in the block, typically ordered by transaction fee priority.

The cryptographic link between blocks is the foundation of blockchain’s immutability: any modification to the data in a block will change its hash, which will break the link to the next block, making the tampering immediately detectable by all network nodes. For example, if an attacker modifies a single transaction in Block #100, the hash of Block #100 will change completely, invalidating the “Previous Block Hash” stored in Block #101, which in turn invalidates Block #101’s hash, and so on for all subsequent blocks. To successfully tamper with a block, an attacker would need to recalculate the hash of the tampered block and all subsequent blocks, and control over 51% of the network’s consensus power (e.g., hash rate for PoW chains, staked tokens for proof-of-stake chains) to make the tampered chain the longest valid chain accepted by the network.

A Merkle tree is a binary tree data structure used to efficiently verify that a specific transaction is included in a block without needing to download and process all transactions in the block. For a block containing $n$ transactions, the Merkle tree is constructed by first hashing each transaction to create $n$ leaf nodes. Pairs of leaf nodes are then hashed together to create parent nodes, and this process is repeated recursively until a single root hash (the Merkle root) is generated. To verify that a transaction is included in a block, a user only needs the transaction hash, the hashes of the sibling nodes along the path to the Merkle root, and the Merkle root itself, rather than the full list of transactions. For a block with 1 million transactions, this redu