Tendermint-family BFT
A bonded validator set proposes, prevotes and precommits blocks. Finality depends on weighted quorum certificates.
A proof-of-stake ledger whose consensus, data layout and execution are explicitly designed around post-quantum authentication.
The paper evaluates consensus families in the absence of practical post-quantum signature aggregation.
A bonded validator set proposes, prevotes and precommits blocks. Finality depends on weighted quorum certificates.
Weighted round-robin proposer selection avoids adding a post-quantum verifiable random function to the initial design.
Signed consensus messages support equivocation evidence and proposed accountability mechanisms.
The design does not rely on practical aggregation of ML-DSA signatures; bandwidth is explicitly modeled.
The first release favors auditable native modules over a general-purpose virtual machine.
Sparse Merkle authentication supports state proofs, alongside block storage, snapshots and indices.
Accounts and transfers, staking, governance, suite registry, DID registry, credential registry and verification market.
VM selection is deferred to a post-mainnet research item, OP11, rather than promised for initial release.
The draft describes encodings, domain separation, validity rules and state transitions for interoperable implementations.
Separating authorization witnesses from canonical transaction bodies is central to the storage strategy.
The ~95% history-growth figure is an analytical model in the paper, not an observed network benchmark.