Pattern:* Pattern:** Style* Style** Zurich: Zurich*: Zurich**:
layer-2.wiki

layer-2.wiki

A structured knowledge base for Layer-2 scaling protocols

01
01.01 / definition

01 Rollups compress execution

Rollups execute transactions away from Layer 1, then publish enough information back to the settlement chain for anyone to reconstruct or challenge the resulting state. The scaling gain comes from batching many state transitions into one commitment.

Optimistic systems assume the batch is valid unless disputed during a challenge period. Validity systems attach cryptographic proofs that demonstrate the transition was computed correctly before the state is accepted.

01.02 / protocol diagram L1 inboxsequencerstate rootfraud / proof window
01.03

Optimistic

Economic security is expressed through bonds, watchers, and fraud proofs. Latency appears at withdrawal time because incorrect assertions must remain contestable.

01.04

Validity

Succinct proofs shift trust from social vigilance toward verifiable computation. The cost profile moves into proving infrastructure and circuit design.

01.05 / commitment
01 batchHash = keccak(transactions)
02 newRoot   = execute(previousRoot, batch)
03 publish(batchHash, newRoot, proof)
02
02.01 / bridge topology

02 Bridges are state machines

A canonical bridge records deposits, messages, exits, and finalized withdrawals. It is the accounting membrane between execution environments, not merely a token transporter.

02.02 / exit lifecycle
depositexecutecommitprovefinalize

Bridge safety depends on the finality assumptions of both layers. Fast liquidity bridges may hide latency through market makers, but canonical exits preserve the protocol's actual security boundary.

03
03.01 / availability

03 Data must be retrievable

Execution can move off-chain, but verification requires data. If transaction data disappears, independent reconstruction becomes impossible and the system degrades into an operator promise.

Modern designs separate execution, settlement, consensus, and data availability into explicit layers. This modularity creates a precise vocabulary for comparing systems.

03.02 / node graph
03.03

Calldata

Simple, expensive, and directly available to Ethereum nodes.

03.04

Blobs

Temporary data space optimized for rollup batches and sampling.

03.05

External DA

Independent availability networks trade direct settlement-chain publication for throughput and specialized verification assumptions.

04
04.01 / alternative constructions

04 Specialized systems remain instructive

State channels, plasma chains, and validiums reveal the design space around custody, liveness, data, and exit games. They are not historical footnotes; they are precise boundary cases.

04.02 / comparison table
SystemCore assumptionTypical use
Channelparticipants stay onlinerepeated payments
Plasmaexit data availabilityasset-specific chains
Validiumexternal data committeehigh-throughput apps