Distributed Sequencer Network
While the cryptographic approach ensures the trustlessness of the sequencer, the problem of single point of failure (SPOF) still remains. To address this issue, Radius implements a distributed sequencer network where multiple sequencers will operate simultaneously. This ensures that even if a sequencer fails, the remaining sequencers can continue to operate.
Radius proposes a secret single leader election mechanism as a way to ensure liveness guarantee. By changing the sequencer secretly in each round, attackers are unable to acquire information about the prearranged sequencer.
Radius is exploring the use of sharding for sequencer groups who will include transactions in a block. This approach allows the selected sequencers to evenly divide the blockspace.
Radius is considering the implementation of Sequential Ordering (Proof of Concept). When a user submits encrypted transactions to the sequencer, the sequencer provides the following to the user:
- epoch number
- block height of the rollup where the transaction will be sent
- current transaction hash chain
- order of the transaction
Users can verify transaction inclusion by referencing the rollup's block height and confirming their specified order position. Using the current transaction hash chain, they can also ensure that no other transactions have been inserted before their own. In case of any discrepancies or the need to make a claim, users receive the sequencer's signature as a safeguard.
Last modified 2mo ago