Simplex BFT at a glance
- ~1-second blocks, ~2-second finality. Finality is on commit, not after a long probabilistic wait.
- Message types — the underlying commonware Simplex protocol uses
Notarize(vote on a proposal),Nullify(view-change), andFinalize. - Votes aggregate via threshold BLS12-381 with buffered batch verification — a quorum certificate is a single group signature reconstructed from a t-of-n quorum of partial signatures, not N signatures.
block_hash, height,
round) and a single BLS12-381 threshold signature over the block_hash || height || round domain, reconstructed from a t-of-n quorum of validator partial
signatures. A threshold scheme yields one group signature and carries no
per-signer bitmap (unlike plain aggregate BLS). Cowboy uses
commonware_consensus::simplex::scheme::bls12381_threshold.
Mandatory proposer rotation (VRF)
Unlike stable-leader BFT, the proposer rotates every block via the VRF beacon. Each block header MUST carry the proposer’s VRF output + proof for the current height, and validators MUST verify it against the epoch seed. This is a deliberate MEV-resistance choice: no single validator observes transaction flow across consecutive blocks. The same VRF beacon also drives deterministic intra-block transaction ordering (whitepaper §6), so a proposer can’t strategically place its own transactions.Finality — the two-chain commit rule
A blockB_h is final when its direct child has a QC: if QC(B_{h+1}) exists
and B_h is the parent of B_{h+1}, then B_h is finalized. Implementations may
expose “committed” and “finalized” as distinct states. The chain never reorgs
past finality, which is what makes ~2s finality a hard guarantee rather than a
heuristic.
View change
On timeout, validators broadcastNullify carrying their highest known QC,
and the next proposer MUST build on the highest-QC block. The timeouts are
compiled into the validator (not runtime-configurable):
A node that has fallen behind catches up via state-sync; while syncing it is
granted a 10× longer activity timeout so it isn’t dropped mid-catch-up.
Networking
- Transport: QUIC over TLS 1.3 (required).
- Gossip: transactions flood to all peers; blocks are relayed by validators; votes go directly to the proposer.
- Peer discovery: DHT-based with bootstrap nodes.
- NAT traversal is out of protocol scope at genesis — operators own reachability (see whitepaper §6.2 / the deployment guide).
Block-space lanes
Per-block compute (the cycle gas meter) is partitioned into dedicated lanes so autonomous-actor work (timers, runner results) can’t be starved by user-transaction spam. The lanes sum to the 80M-cycle block cap (4× the 20M EIP-1559BLOCK_CYCLES_TARGET); the reserved shares below are from
types/src/constants.rs (LANE_*_CYCLES):
Unused capacity is never reassigned between lanes. Within a lane,
proposers select by highest effective fee (ties broken by
tx_hash) up to lane
capacity, then apply VRF ordering to the selected set. As proposer-local
anti-starvation policy, user-lane selection holds at most one aging claim at a
time for the longest-waiting account front (whitepaper §6.4); fee ordering is
authoritative for all other user selections.
Fee rates depend on the execution path. Ordinary transactions use the global
Cycle/Cell/Access basefees; natural timer fires use the separate timer cycle
basefee and the global cell/access rates:
For each rate in the table,
effective_basefee = floor(basefee × lane_fee_mult_ppm / 1_000_000).
The natural-timer row uses the Timer-lane multiplier for all three resources,
in both pre-charge and actual-cost settlement
(CIP-5 §6.3).
The separate timer cycle curve uses learning denominator 1, a ±12.5%
per-block clamp, and a target of 4,400,000 cycles (half the Timer lane).
The updated timer basefee is clamped to
MIN_BASEFEE ..= MAX_BASEFEE.
Natural-timer usage is excluded from the
global basefee update inputs.
All four lane multipliers default to 1.0× at genesis and are Tier-0
governance-tunable. See the fee model.