LAYER·2·WIKI

Scientia Stratorum — The Knowledge of Layers

Folio II — The Architecture of Layers

The architecture of blockchain scaling is, at its foundation, an architecture of trust delegation. When Satoshi Nakamoto published the Bitcoin whitepaper in 2008, the system described therein was monolithic: every node validated every transaction, every block contained the complete record of computational work, and the security of the entire network rested on the assumption that honest participants would always command a majority of computational power. This monolithic design achieved its goal of trustless consensus but at a profound cost — throughput was constrained by the slowest honest node.

Layer 2 solutions emerged from the recognition that not every interaction requires the full weight of base-layer consensus. Just as medieval banking evolved from carrying physical gold to issuing letters of credit — instruments that derived their value from the gold but moved far more efficiently than the metal itself — Layer 2 protocols derive their security from the base chain while processing transactions at orders of magnitude greater speed and lower cost.

The fundamental insight is one of compression and delegation: complex computations are performed off-chain, in environments where participants can interact rapidly and cheaply, while the base layer serves as the ultimate arbiter of truth. When disputes arise, or when parties wish to finalize their interactions, the compressed results are submitted to the base chain for verification and permanent recording.

This architectural pattern — execute off-chain, verify on-chain — manifests in several distinct forms, each making different tradeoffs between security, speed, cost, and complexity. The taxonomy of these solutions reveals a rich intellectual landscape where cryptographic proof systems, game-theoretic incentive structures, and distributed systems engineering converge.

Folio III — The Taxonomy

Layer 2 Scaling
RollupsBatch execution, on-chain data
State ChannelsOff-chain messaging
SidechainsIndependent consensus
PlasmaChild chain framework
ValidiumOff-chain DA
OptimisticFraud proofs
ZK-RollupsValidity proofs
PaymentLightning, Raiden
VirtualCounterfactual
EVMPolygon PoS
Non-EVMRonin, Loom
MVPMinimal Viable
CashPlasma Cash
StarkExApp-specific
VolitionHybrid DA
Arbitrum
Optimism
zkSync
StarkNet

Layer 2 Scaling Solutions

Rollups

Batch execution with on-chain data availability

Optimistic Rollups

Fraud proof based — Arbitrum, Optimism

ZK-Rollups

Validity proof based — zkSync, StarkNet

State Channels

Off-chain messaging with on-chain settlement

Payment Channels

Lightning Network, Raiden

Virtual Channels

Counterfactual instantiation

Sidechains

Independent consensus mechanisms

EVM-Compatible

Polygon PoS

Non-EVM

Ronin, Loom Network

Plasma

Child chain frameworks

Plasma MVP

Minimal Viable Plasma

Plasma Cash

Non-fungible token exits

Validium

Off-chain data availability with validity proofs

StarkEx

Application-specific validium

Volition

Hybrid data availability

Folio IV — The Mechanism

Validity Proofs

Zero-knowledge validity proofs provide cryptographic certainty that a batch of off-chain transactions was executed correctly. The prover generates a succinct proof — a mathematical certificate — that can be verified on-chain in constant time regardless of the number of transactions in the batch. Systems such as zk-SNARKs and zk-STARKs differ in their trust assumptions: SNARKs require a trusted setup ceremony, while STARKs achieve transparency through hash-based commitments.

Fraud Proofs

Optimistic rollups operate on an assumption of honesty: state transitions are presumed valid unless challenged. During a dispute window — typically seven days — any observer may submit a fraud proof demonstrating that a posted state root is incorrect. The on-chain contract then re-executes the disputed transaction to adjudicate. This optimistic approach trades latency for simplicity, requiring cryptographic verification only when disputes arise.

Data Availability

The data availability problem asks: how can we ensure that the data needed to reconstruct the Layer 2 state is accessible to all participants? Rollups post transaction data to the base layer, ensuring that anyone can independently verify state transitions. Validiums and off-chain DA solutions trade this guarantee for lower costs, relying on data availability committees or erasure coding with data availability sampling.

Sequencing

The sequencer is the entity responsible for ordering transactions within a Layer 2 system. Centralized sequencers offer speed and simplicity but introduce censorship risks and single points of failure. Shared sequencing, decentralized sequencer sets, and based sequencing (where the L1 proposer orders L2 transactions) represent the frontier of research aimed at preserving the censorship resistance properties of the base layer.

Bridging

Cross-layer bridges mediate the movement of assets between the base chain and Layer 2 systems. Canonical bridges — native to the rollup protocol — inherit the security of the proving system. Third-party bridges offer speed at the cost of additional trust assumptions. The design of bridge mechanisms intersects deeply with questions of finality, dispute resolution, and the economic security of the underlying proof system.

Interoperability

As the Layer 2 ecosystem proliferates, composability between rollups becomes paramount. Cross-rollup communication protocols, shared bridges, and universal settlement layers aim to recreate the seamless composability of Layer 1 DeFi across fragmented execution environments. The vision of a unified rollup-centric future depends on solving this coordination problem without sacrificing the sovereignty of individual Layer 2 systems.

LAYER·2·WIKI

Printed in the year MMXXVI

A Digital Encyclopedic Codex
on the Architecture of Blockchain Scaling

✺ FINIS ✺