ZONE 01 // TRANSACTION POOL

ROLLUP.QUEST

UNCOMPRESSED STATE // PENDING BATCH

CAUTION: {transactions_pending: 2048, gas_overhead: critical, compression: null}
TX_BATCH 0xf7a2...3c91
STATE_DIFF 0x3b9c...01fe
CALLDATA 0xd4e8...7a20
NONCE_SET 0x91bc...f3d7
GAS_REFUND 0xa7f0...2e8b
ZONE 02 // COMPRESSION CHAMBER
PROOF_GENERATION

The sequencer ingests raw transaction data from the mempool, ordering operations by nonce and gas priority. Each transaction is decomposed into its constituent state transitions: storage slot modifications, balance transfers, contract deployments. The state diff is computed as the minimal delta between pre-state and post-state roots.

STATE_DIFF_ENCODING

State diffs are encoded using recursive length prefix serialization, then compressed via zlib deflation. The resulting byte array represents the complete state transition of the rollup chain for this batch window. Compression ratio: typically 8:1 against raw calldata.

BATCH_SUBMISSION

Compressed batch posted to L1 as calldata. The commitment includes the batch header, the state root delta, and the compressed transaction payload.

DATA_AVAILABILITY

Data availability is guaranteed by the L1 consensus layer. Any full node can reconstruct the rollup state by replaying the calldata posted in batch submission transactions. The rollup inherits the security guarantees of the base layer while operating at a fraction of the gas cost. This is the fundamental value proposition: security without sacrifice.

VALIDITY_CIRCUIT

The proving circuit accepts the pre-state root, the batch of transactions, and the claimed post-state root. It re-executes every transaction within the ZK arithmetic circuit, verifying that the claimed post-state is the correct result of applying the batch to the pre-state.

RECURSIVE_PROOF

Proofs are recursively composed: each batch proof verifies the previous batch proof, creating an ever-growing chain of verified state transitions.

COMPRESSION_PIPELINE

The compression pipeline operates in three stages: transaction ordering, state diff computation, and byte-level encoding. Each stage reduces the data footprint while preserving the cryptographic commitment to the full batch contents.

PROVER_NETWORK

Decentralized prover networks compete to generate validity proofs for each batch. The proving process is computationally intensive but economically incentivized: provers earn fees proportional to the gas saved by the rollup. This creates a market for compression. The network converges on optimal proving strategies through economic natural selection.

FINALITY_WINDOW

Proof verification on L1 provides instant finality. No challenge period. No fraud disputes. Mathematical certainty.

ESCAPE_HATCH

Users retain the unconditional right to exit the rollup by submitting a withdrawal proof directly to the L1 bridge contract. The rollup cannot censor, delay, or modify withdrawal requests. Sovereignty is preserved through cryptographic guarantees.

ZONE 03 // THE PROOF
VALIDITY_PROOF // VERIFIED
{
  "protocol": "rollup.quest/zkp-v1",
  "batch_index": 847293,
  "pre_state_root": "0x1a2b3c4d5e6f...",
  "post_state_root": "0x7f8e9d0c1b2a...",
  "transactions_compressed": 2048,
  "compression_ratio": "8.42:1",
  "proof_type": "PLONK",
  "verification_gas": 285000,
  "status": "VERIFIED",
  "finality": "INSTANT"
}
ZONE 04 // SETTLEMENT
BATCH #847293 SETTLED
L1 // BASE LAYER