Protocol Parameters

Every parameter the protocol runs on, with its value, its unit, where it is fixed, and what it would take to change it. Devnet values are labelled.

A parameter with no stated unit and no stated owner is a number in marketing copy. This page gives each one its value, where it is fixed, and how it could change. Devnet values are labelled devnet.

Settlement and disputes

ParameterValueFixed whereHow it changes
Challenge window48 hours: 172,800 seconds of wall-clock time, with 432,000 slots kept as the dispute game's budgetA constant in the settlement core, read at chain initialization; since ADR-0016's amendment of 22 September 2026 the window counts secondsA new chain carries both. A running chain is moved to seconds by a one-shot administrative migration after its program is upgraded — done on the current chain on 22 September 2026 (slot 502,261,356; roots 1 to 292 keep the slot rule)
Air gap between proof and payout24 hours by the mainnet design; 3,600 s on the devnet portalThe portal's configuration at initializationPortal configuration
Total exitWindow plus air gap, about three daysDerivedQuote this, never the window alone
Minimum response window per dispute move1,500 slots, 600 s at the targetDispute core constant, enforced as a floorRedeploy
Moves in a dispute2 × ceil(log2(steps)) + 1; 35 for a 131,072-step traceDerivedNot a setting
Worst-case game duration5.8 hours at the floor, 35 hours at one-hour roundsDerivedA dispute that cannot finish inside the window is refused at open
Proposer bond100,000 lamports, a devnet placeholderSettlement configurationMust be re-derived against value at risk before real deposits, with an automated review trigger as TVL grows
Largest disputable trace131,072 steps, the ceiling the proposer bond impliesDerived from the bondMoves with the bond
Compute allowance for a witnessed step700,000 CU of a transaction's 1,400,000Dispute programRedeploy

The window and every dispute deadline are denominated in slots, not seconds. A halted chain produces no slots, so a move deadline freezes, an honest party cannot be timed out, and the window cannot run out while nobody could have challenged.

Devnet slots measure about 166 ms, not 400, and mainnet slots have been 300 ms since 25 August 2026, so a 432,000-slot window ran about 20 hours of wall clock on devnet and 36 on mainnet. That drift is why the window now counts seconds: 48 hours means 48 hours. Slot-denominated durations quoted in hours in this paper are at the 400 ms target and say so.

Sequencing

ParameterValueNotes
Block cadence2 seconds, and only when there is workAn idle chain produces no blocks and costs nothing
Ordering ruleFirst-come, first-served by admissionCheckable against receipts and published batches
Forced-inclusion delay3,600 s on the devnet chain's queue; at most 86,400 s, 24 hours, on any queueThe ceiling is the inbox program's MAX_INCLUSION_DELAY_CEILING_SECS, which refuses a larger configuration; the devnet value was read from the queue account on 1 October 2026. In the derivation rule a batch that leaves an entry behind past its deadline is a fault; the node's verifier does not apply that rule yet
Minimum inclusion fee10,000 lamports on the devnet chain's queueHeld on the entry: the sequencer claims it for an on-time inclusion, the submitter reclaims it otherwise
Cost of one forced entry5,887,480 lamports: 5,872,480 of entry rent, the 10,000 fee and a 5,000 signatureSimulated against the devnet chain's inbox on 30 September 2026. The rent never comes back: no instruction closes an entry
Inclusion-mark retry30 s, doubling to 600 s; 600 s at once when the queue names another keyNode constants. The entry is consumed once either way; a refused mark is owed and raises an alarm
Blockhash validity window150 blocks of L2 historyThe same replay guard wallets already understand
Sequencer minimum bond0.1 SOL on devnetMainnet value is a governance decision, sized to exceed what reordering inside one window could gain
Reporter's share of a slashed bond50 percent, remainder to the incineratorPermissionless reporting, no allowlist
Unbonding delay604,800 secondsIntended to exceed the challenge window, so a receipt from the last batch stays slashable while that batch is disputable

Fees and rent

ParameterValueNotes
User fee5,000 lamports, flat, in SOL on the rollup; 5,000 base units of SEU on a coin chain, half burnedA placeholder for a composed fee, not a market price
Fee destinationBurned before a per-chain activation height, credited to the genesis sequencer after itThe current chain crossed at block 100 on 10 September 2026; each block reports which rule it used
Composed fee margin and floorZero, bothThe absence of a published price rather than a price. Computed today, charged by nothing
Priority feesNot honouredAn auction is planned
Settlement cost per block3,520,360 lamports sunk if no rent comes back, plus a 100,000 bond returnedMeasured by the current chain's node for a one-transaction block on 30 September 2026, at devnet's 5,080 lamports per byte. Rent is about 703 times the fee such a block earns
Break-even fillAbout 705 transactions per block at the flat fee with no rent returned; about 452 with batch rent returned, as on the current chain today; 3 with both records reclaimed, counting the two close transactionsBelow it the chain is subsidised
Measured data-availability floorAbout 280 lamports per transaction on modelled sustained trafficSparse traffic compresses worse and costs more
Root retention before rent reclaim1,000 newer final roots and 6,480,000 slots, about thirty daysDeployed on the current chain and on 9232; no root has been closed, because none has 1,000 newer final roots. It is a proving deadline, so both bounds apply
Batch retention before rent reclaim3,240,000 slots, about fifteen days from seal at the 400 ms target; 7.7 to 8.7 days at devnet's measured slot rateDeployed; the current chain has closed batch records since 18 September 2026. Longer than the window, shorter than root retention

State and proofs

ParameterValueNotes
State commitmentSparse Merkle tree, depth 256, keyed by the hash of the public keyAccounts and withdrawal leaves in one tree
Proof sizeA 256-bit bitmap plus non-empty siblings: 321 bytes, 8 siblings over a 256-account chainNon-inclusion is provable, which insertion witnesses require
Hash calls257 per proof; 1,020 for a two-account witnessed step
One-step verification, system transfer19,216 CUMeasured against the compiled program
One-step verification, SPL token transfer20,408 CUMeasured
Interpreter memory commitmentPage tree of 32-byte pages at depth 59, covering the full 64-bit address spaceA proof is 59 hashes, about 9,000 CU
Interpreter instruction commitmentMerkle tree over the instruction stream: 16 hashes for a 65,536-instruction programBinds index, instruction count and padding
Deposit record94 bytesDomain tag, sequence, depositor, recipient, amount

Chain identity

Current chain (gamma)Beta, stopped 12 SeptemberAlpha, stopped
Chain id779077897788
Challenge window172,800 seconds, 48 hours of wall clock, from root 293; roots 1 to 292 under 432,000 slots432,000 slots, 48 hoursSeven days, as created
State treeSparse, from block 0Sparse, from block 0Sorted-leaf
State commitmentVersion 2: account data committed by its page-tree root, so a slice of an account can be proven without carrying the accountVersion 1: account data hashed inlineVersion 1
Dispute authorityThe dispute program's enforcer address, so verdicts enforceThe enforcer addressA plain key, so a verdict does not enforce

Renumbering a chain produces a different chain: the genesis hash covers the Layer 1 program ids, so the identity and the deployment are bound together. A change to what the state commits is a new genesis for the same reason, which is why gamma exists: it was cut on 12 September 2026 from a node that records its commitment version in genesis, so a node built for another version refuses the chain by name instead of diverging at replay. Beta stopped the same day with all 158 of its blocks final and all four of its withdrawals paid; alpha's limitations were exactly why beta was created. Both are kept as history, not run.

Keys

ParameterValueNotes
Upgrade-authority timelockNone today: one key holds the upgrade authority of every program the current chain settles toMainnet design: a multisig whose timelock outlasts the whole exit (ADR-0013 D4). The floor is window plus air gap, 259,200 s on the mainnet design and 176,400 s on the devnet chain. The choice is a Squads v4 2-of-3 multisig with a timelock of 176,400 s on devnet and 604,800 s, seven days, on mainnet. None of it is in use yet: no multisig exists and no authority has moved
Moving the portal admin, the data-availability admin or the inbox's sequencerNo instruction in the deployed programsset_admin on the portal and on data availability and set_sequencer on the inbox are in the source with their tests passing, not deployed. Until they are, those powers move only by a program upgrade
Root-denial marker rent777,240 lamports, paid by the guardian128 + 25 bytes at devnet's 5,080 lamports per byte. The devnet chain's guardian held 0 on 1 October 2026

The programs on Solana devnet

ProgramAddress
Settlement7yH9bTF9s6d86pW6stgVdfxaSkxiCDNBQR1HvTk399YW
Data availabilityDYyVbACxqDH77DSApL2dcwfZrGzNLujQi21bKehZC1Pr
Forced-inclusion inbox9pVAsoaCm9uU7jzGgPB3AqHuXs7LKWtqkZCCeZXwmkxq
Dispute gameBrHfePzDnV7oSTd4c4T7f7WDwz8H9zwxYe1nJ8e3rqeA
Bridge portal8hsKk9nDsXN7JMRH1tj5RYdXs12ohrvduGBkgwEwGqVM
Sequencer bond6KQdRji1ZKg3tGLUczeUyX9ywxnivXKbSSAM3hbzzY4L

Which of these a coin vote could ever change

Governable, because they are economic: fee margins and floors, the bridge fee, fast-exit fee caps, reward schedules, retention windows within a floor the code enforces, treasury spending, and admission to a staked sequencer set.

Not governable, because they are the security of the chain: the challenge window and its unit, the air gap and who may deny a root, the dispute authority, the one-step classes and their boundaries, the state commitment, and the supply rule. Those live in code and change by redeploy. A vote that could move them would make the coin the security, which is what it must not be.