Pillar III of IX — Protocol Reference

Technical & Protocol

The engineering layer of the ABCDE encyclopedia. Smart contracts, consensus algorithms, cryptographic primitives, Layer 2 scaling solutions, and the protocol-level architecture that powers decentralized networks.

200+Entries
A–ZIndexed
Pillar IIICategory
2025Edition

⌬ Technical & Protocol

Pillar III · 200+ Entries · Protocol Reference
B
TEC-001
Byzantine Fault Tolerance (BFT)
/ˈbɪz.ən.tiːn fɔːlt ˈtɒl.ər.əns/  ·  abbr: BFT
noun phrase  ·  Consensus Theory  ·  Distributed Systems

1. A property of a distributed computing system that enables it to continue operating correctly even when some nodes fail or act maliciously — sending conflicting or incorrect information to different parts of the network. Named after the Byzantine Generals Problem, a thought experiment formalized by Lamport, Shostak, and Pease in their 1982 paper.

2. A system is Byzantine Fault Tolerant if it can reach consensus despite up to ⌊(n−1)/3⌋ faulty or malicious nodes, where n is the total number of nodes. Bitcoin's proof-of-work achieves a probabilistic form of BFT; classical BFT protocols (PBFT, Tendermint, HotStuff) achieve deterministic finality.

TECHNICAL NOTE: The Byzantine Generals Problem asks: how can geographically separated generals coordinate an attack when some generals may be traitors sending false messages? The solution requires that loyal generals represent more than two-thirds of the total — the mathematical basis for the ⅔ honest-majority assumption in most BFT protocols.

See also: Consensus Mechanism · Proof of Stake · Validator

TEC-001  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-04-10 Permalink ¶
D
TEC-002
Directed Acyclic Graph (DAG)
/dɪˈrek.tɪd eɪˈsaɪ.klɪk ɡræf/  ·  abbr: DAG
noun phrase  ·  Data Structure  ·  Alternative DLT Architecture

1. A graph data structure in which edges have a defined direction and no cycles exist — meaning it is impossible to traverse the graph and return to the starting node. In distributed ledger technology, DAGs are used as an alternative to linear blockchain architecture, allowing transactions to reference multiple prior transactions rather than a single previous block.

2. DAG-based ledgers theoretically offer higher throughput and lower fees than traditional blockchains by enabling parallel transaction processing. Notable implementations include IOTA's Tangle, Hedera Hashgraph, Nano, and Avalanche's consensus (which uses a DAG for its primary network).

TRADE-OFFS: While DAGs offer scalability advantages, they introduce complexity in achieving global consensus ordering and have historically faced challenges with security under low-traffic conditions. IOTA's original Tangle required a centralized "Coordinator" node for security — a significant decentralization compromise that the project worked to eliminate through its IOTA 2.0 protocol.

See also: Distributed Ledger Technology · Blockchain · Layer 2

TEC-002  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-03-15 Permalink ¶
E
TEC-003
Ethereum Virtual Machine (EVM)
/ɪˈθɪər.i.əm ˈvɜː.tʃu.əl məˈʃiːn/  ·  abbr: EVM
noun phrase  ·  Runtime Environment  ·  Smart Contract Execution

1. The decentralized computation engine that executes smart contracts on the Ethereum network. The EVM is a quasi-Turing-complete, stack-based virtual machine that processes bytecode compiled from high-level languages such as Solidity and Vyper. Every Ethereum full node runs an identical instance of the EVM, ensuring deterministic execution across the network.

2. The EVM has become the dominant smart contract execution standard, with EVM compatibility adopted by dozens of alternative networks including Polygon, BNB Chain, Avalanche C-Chain, Arbitrum, Optimism, and Base — creating a vast ecosystem of interoperable tooling, developer libraries, and deployed contracts.

GAS MECHANISM: EVM execution is metered in gas — a unit measuring computational work. Each opcode has a defined gas cost; users specify a gas limit and gas price (in gwei) per transaction. The EIP-1559 upgrade (August 2021) introduced a base fee that is burned plus a priority tip to validators, fundamentally changing Ethereum's fee market dynamics.

See also: Smart Contract · Gas & Gas Fees · Layer 2 · Ethereum Launch

TEC-003  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-05-01 Permalink ¶
L
TEC-004
Layer 2 (L2)
/ˈleɪ.ər tuː/  ·  abbr: L2  ·  also: scaling solution, off-chain scaling
noun  ·  Scaling Architecture  ·  Protocol Layer

1. A secondary protocol or network built on top of an existing Layer 1 blockchain (the "base layer") that processes transactions off-chain and periodically settles state to the Layer 1 for final security. Layer 2 solutions are designed to increase transaction throughput and reduce fees while inheriting the security guarantees of the underlying Layer 1.

2. The primary L2 architectures are: Optimistic Rollups (Arbitrum, Optimism, Base) — assume transactions are valid by default with a fraud-proof challenge window; ZK-Rollups (zkSync, StarkNet, Polygon zkEVM) — use zero-knowledge proofs to cryptographically verify batch validity; State Channels (Lightning Network) — bilateral off-chain payment channels; Plasma — child chains with periodic checkpoints.

ROLLUP DISTINCTION: Optimistic Rollups have a 7-day withdrawal delay (the fraud-proof challenge window), while ZK-Rollups achieve near-instant finality once a validity proof is verified on L1. ZK-Rollups are computationally more expensive to generate but offer stronger security guarantees and faster finality — making them the dominant long-term scaling paradigm as ZK proof generation costs decline.

See also: Zero-Knowledge Proof · Blockchain · Blockchain Trilemma

TEC-004  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-04-28 Permalink ¶
M
TEC-005
Merkle Tree
/ˈmɜː.kəl triː/  ·  also: hash tree, Merkle root
noun  ·  Data Structure  ·  Cryptographic Primitive

1. A binary tree data structure in which every leaf node contains the cryptographic hash of a data block, and every non-leaf node contains the hash of its two child nodes. The single hash at the top — the Merkle root — cryptographically summarizes all data in the tree. Any modification to any leaf node produces a completely different Merkle root, providing tamper-evidence for the entire dataset.

2. In Bitcoin, the Merkle root of all transactions in a block is included in the block header. This enables Simplified Payment Verification (SPV) — light nodes can verify that a specific transaction is included in a block by requesting only the relevant branch of the Merkle tree (a "Merkle proof"), without downloading the entire block.

INVENTOR: Named after Ralph Merkle, who patented the concept in 1979 (U.S. Patent 4,309,569). Merkle trees are foundational to certificate transparency logs, Git version control, distributed file systems (IPFS), and virtually all blockchain implementations.

See also: Hash Function · Blockchain · SPV Verification

TEC-005  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-03-20 Permalink ¶
P
TEC-006
Proof of Stake (PoS)
/pruːf əv steɪk/  ·  abbr: PoS
noun phrase  ·  Consensus Mechanism  ·  Validator Economics

1. A consensus mechanism in which validators are selected to propose and attest to new blocks in proportion to the amount of cryptocurrency they have staked as collateral. Validators who act dishonestly risk having their staked funds slashed (partially or fully destroyed) — aligning economic incentives with honest behavior without requiring energy-intensive computation.

2. Ethereum transitioned from Proof of Work to Proof of Stake in The Merge (September 15, 2022), reducing the network's energy consumption by approximately 99.95%. Ethereum's PoS requires validators to stake a minimum of 32 ETH to operate a validator node, with slashing conditions for double-signing or prolonged inactivity.

SECURITY MODEL: PoS security is economic rather than physical. A successful 51% attack requires acquiring a majority of staked tokens — at Ethereum's scale, this would cost tens of billions of dollars and would simultaneously destroy the value of the attacker's own stake. Critics argue this creates plutocratic tendencies; proponents argue the economic cost exceeds PoW's energy cost at equivalent security levels.

See also: Proof of Work · Validator · The Merge · Staking

TEC-006  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-05-01 Permalink ¶
S
TEC-007
Smart Contract
/smɑːt ˈkɒn.trækt/  ·  also: self-executing contract, on-chain program
noun  ·  Protocol  ·  Programmable Blockchain

1. A self-executing program stored on a blockchain whose terms are directly written in code. Smart contracts automatically enforce and execute predefined conditions when triggered by transactions, without requiring intermediaries. Once deployed, the code is immutable and executes deterministically across all nodes in the network.

2. The term was coined by cryptographer and legal scholar Nick Szabo in 1994 — predating Bitcoin by 15 years. Szabo's canonical example was a vending machine: a mechanical device that automatically executes a contract (dispense item) upon receiving the correct input (payment), without requiring a trusted third party.

LEGAL NOTE: Smart contracts are not "contracts" in the traditional legal sense in most jurisdictions — they are code that may or may not implement legally enforceable agreements. The legal enforceability of smart contract outputs varies significantly by jurisdiction. Several U.S. states (Arizona, Tennessee, Wyoming) have passed legislation recognizing smart contracts as legally enforceable, while most jurisdictions have not yet addressed the question directly.
IMMUTABILITY RISK: The immutability of deployed smart contracts is a double-edged sword. While it prevents unauthorized modification, it also means bugs and vulnerabilities cannot be patched without deploying an entirely new contract. The 2016 DAO hack exploited a reentrancy vulnerability in an immutable smart contract, resulting in the loss of 3.6 million ETH.

See also: Ethereum Virtual Machine · The DAO Hack · Smart Contract Law

TEC-007  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-04-15 Permalink ¶
Z
TEC-008
Zero-Knowledge Proof (ZKP)
/ˈzɪər.oʊ ˈnɒl.ɪdʒ pruːf/  ·  abbr: ZKP, ZK-proof  ·  variants: zk-SNARK, zk-STARK
noun phrase  ·  Cryptographic Primitive  ·  Privacy & Scaling

1. A cryptographic method by which one party (the prover) can prove to another party (the verifier) that a statement is true without revealing any information beyond the truth of the statement itself. A ZKP must satisfy three properties: completeness (a true statement can always be proven), soundness (a false statement cannot be proven), and zero-knowledge (the verifier learns nothing beyond the statement's validity).

2. In blockchain applications, ZKPs serve two primary functions: privacy (proving transaction validity without revealing amounts or parties — as in Zcash's zk-SNARKs) and scaling (proving the validity of thousands of transactions in a single compact proof — as in ZK-Rollups). The latter application has become the dominant scaling paradigm for Ethereum Layer 2 networks.

ZK-SNARK vs. ZK-STARK: zk-SNARKs (Succinct Non-interactive ARguments of Knowledge) require a trusted setup ceremony — a potential security vulnerability if the setup is compromised. zk-STARKs (Scalable Transparent ARguments of Knowledge) require no trusted setup and are quantum-resistant, but produce larger proofs. StarkNet uses zk-STARKs; zkSync and Polygon zkEVM use zk-SNARKs.

See also: Layer 2 · Privacy Coins · Rollup

TEC-008  ·  Pillar III  ·  Added: 2025-01-01  ·  Updated: 2025-05-01 Permalink ¶