Blockchain

A replicated append-oriented ledger whose ordered blocks contain records and cryptographic links to prior blocks, with a distributed protocol coordinating which history participating nodes accept.

Version

v1 · 2026-09-28 · History

Domain-specific #

8230

Domain group

Applied Sciences & Engineering

Origin domain

Computer Science & Software Engineering

Subdomains

Distributed Systems, Cryptography → Computer Science & Software Engineering

Core Idea

A blockchain is a distributed ledger arranged as an ordered sequence of blocks. Each block commits cryptographically to its predecessor and contains records such as transactions, often summarized with Merkle structures. Changing an old record invalidates later commitments unless subsequent blocks are rebuilt. Network nodes validate proposed blocks and apply a consensus or fork-choice protocol to decide which history to accept. Network nodes validate proposed blocks and apply a consensus or fork-choice protocol to decide which history to accept.

How would you explain it like I'm…

The Matching-Stamp Notebook

A blockchain is like a notebook that many people keep copies of. Each new page has a special stamp that matches the page before it. If someone sneakily changes an old page, the stamps stop matching, so everyone can spot the change unless the cheater redoes every page after it.

Chained Record Book

A blockchain is a shared record book kept by many computers at once. Records, like payments, are grouped into blocks, and each block carries a special code, made with cryptography, that depends on the block before it, linking them in a chain. If anyone changes an old record, the codes in all later blocks stop matching unless those blocks are rebuilt. The computers check new blocks and follow agreed rules to decide which version of the chain everyone accepts. This makes cheating easy to notice and expensive, but not impossible. Blockchains became famous with Bitcoin, but blockchain and cryptocurrency are not the same thing.

Hash-Linked Distributed Ledger

A blockchain is a distributed ledger organized as an ordered sequence of blocks. Each block contains records such as transactions, often summarized using a Merkle tree, and includes a cryptographic commitment (a hash) to the previous block. Because of this chaining, altering an old record breaks every later commitment unless all following blocks are rebuilt. Network nodes validate proposed blocks and run a consensus or fork-choice protocol to agree on which history to accept. This makes unauthorized changes detectable and costly under stated assumptions, not impossible: forks, software governance decisions, collusion, stolen keys, or capture of the consensus process can change the accepted history. Bitcoin's 2008 design popularized blockchains as a decentralized way to prevent double-spending, but blockchain is not a synonym for cryptocurrency, and many distributed applications don't benefit from one.

 

A blockchain is a distributed ledger structured as an ordered sequence of blocks, each committing cryptographically, typically via a hash, to its predecessor and containing records such as transactions, often summarized with Merkle structures. The hash chain makes history tamper-evident: modifying an earlier record invalidates all subsequent commitments unless those blocks are recomputed. Participating nodes validate proposed blocks against protocol rules and apply a consensus or fork-choice mechanism to determine which chain of history is canonical. The resulting guarantee is conditional: revision of accepted history is made detectable and costly under specified assumptions about participants and resources, not impossible. Forks, protocol or software governance, collusion, private-key compromise, and consensus capture can all alter what the network accepts. Bitcoin's 2008 design popularized the construction for decentralized double-spending resistance, but the data structure and consensus architecture are distinct from cryptocurrency, and many distributed applications gain little from adopting one.

Scope of Application

Use blockchain with participant model, block structure, consensus, validation, permissions, finality, governance, and threat assumptions stated. Use blockchain with participant model, block structure, consensus, validation, permissions, finality, governance, and threat assumptions stated.

• Cryptocurrency. Records transfers and prevents double spending.
• Asset registries. Coordinates shared history.
• Smart-contract platforms. Replicates state transitions.
• Supply chains. Shares signed events cautiously.
• Distributed systems. Studies Byzantine agreement and forks.

Clarity

Tamper resistance concerns consistency of recorded history, not truth of input data or secrecy of public records. The closest near miss sets the boundary: A cryptographic transparency log is closest: it can be append-only and hash-linked, but may have one operator and no distributed block consensus. A positive case must satisfy this test: A system is a blockchain when replicated participants validate and extend an ordered ledger of blocks cryptographically committed to predecessors under a consensus or fork-choice protocol.

Manages Complexity

Security depends on consensus incentives, node diversity, software, cryptography, governance, and key custody. Throughput, latency, storage, privacy, reversibility, and operator trust should be compared with simpler databases. The central tamper resistance–governance revision tradeoff is this: History is costly to alter yet protocols and accepted forks can change. A second distributed trust–system cost tension matters because Removing one operator adds coordination and resource burdens.

Abstract Reasoning

Use three linked moves: define records, block commitments, and state transition; identify validators and admission rules; specify consensus and fork choice. As a collapse test, the case exits when there is no block-level predecessor commitment or no distributed rule for accepting ledger history. A fourth check is to state finality and adversary assumptions. A final check is to assess whether distributed trust benefits justify costs.

Knowledge Transfer

Replicated tamper-evident logs transfer across coordination, but blocks, predecessor hashes, consensus, and fork handling delimit blockchain. The nearest stopping boundary is explicit: A cryptographic transparency log is closest: it can be append-only and hash-linked, but may have one operator and no distributed block consensus. The inclusion test remains: A system is a blockchain when replicated participants validate and extend an ordered ledger of blocks cryptographically committed to predecessors under a consensus or fork-choice protocol. The structure no longer applies when the case exits when there is no block-level predecessor commitment or no distributed rule for accepting ledger history. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Blockchain is one block-linked form. Nodes coordinate accepted extensions.

Neighborhood in Abstraction Space

Blockchain sits in a moderately populated region (40^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (2551 abstractions)

Nearest neighbors

• Unit of Work — 0.89
• Dynamic Problem — 0.89
• Information exchange — 0.88
• Cooperative storage cloud — 0.88
• Patch management — 0.87

Computed from structural-signature embeddings · 2026-10-08