Project Overview & Proposed Design

Status: design proposal, June 2026. Variant A (transparent stake lottery) is the primary mechanism; Variant B (ZK/anonymous) is a compatible upgrade, sketched in an appendix.


1. Problem statement

1.1 Channels today, and the cost of accredited keys

A channel is Bedrock’s ordered-log primitive: every CHANNEL_INSCRIBE carries a parent hash pointing at the previous message, threading a virtual chain across Bedrock blocks. Zones publish state updates through channels (and use them as a coordination bus between sequencers); bridges, clients, and other Zones read them. The parent-hash design enables reorg-resilience; honest messages re-thread correctly on whichever fork wins, so sequencers never wait for finality (which is often slow) to keep posting. [S1][S2]

Writing is gated by one comparison [C1]:

1. parent == channel.tip_message                                   (hash-chain integrity)
2. signer == accredited_keys[round_robin(block_slot)]              ← THE GATE
3. Ed25519_verify(signer, tx_hash, sig)

What round-robin earns [S1][C2]:

What it costs:

Terminology: the Zone SDK guide [S9] uses “decentralized sequencing” for this committee rotation; decentralized operation among a fixed set already ships. This project targets permissionless admission: a complement to that guide, not a competitor.