MonadBFT Consensus Protocol
Explore MonadBFT, the pipelined Byzantine Fault Tolerant consensus protocol that enables 400ms block times and 800ms finality on Monad.
Overview
MonadBFT is a pipelined Byzantine Fault Tolerant consensus protocol derived from HotStuff. It is the consensus engine that powers Monad's 400ms block times and 800ms finality — making it one of the fastest BFT protocols in production.
Pipelined Consensus
Traditional BFT protocols complete one block before starting the next. MonadBFT overlaps multiple phases simultaneously:
- Round N: Propose a new block
- Round N: Vote on block from Round N-1
- Round N: Finalize block from Round N-2
This pipelining means the network is always doing useful work, enabling 400ms block times without sacrificing security. Full finality arrives at 800ms (2 blocks), with speculative finality at 400ms.
Tail-Fork Resistance
A novel innovation over standard HotStuff. When a leader misses their turn (crash, network issue), the next leader restores the prior leader's proposals rather than discarding them. This prevents "tail forks" where valid proposals are lost due to leader rotation.
Why This Matters
Tail-fork resistance ensures that honestly proposed blocks are never silently dropped. This is critical for MEV fairness and transaction inclusion guarantees.
RaptorCast Propagation
Monad uses RaptorCast instead of traditional gossip protocols for block propagation:
- Erasure coding — blocks are split into coded chunks, so any sufficient subset reconstructs the full block
- Two-level broadcast tree — reduces redundant data transmission
- Lower latency — fewer hops than gossip, better bandwidth efficiency
Validator Network
- Linear communication complexity — O(n) messages instead of O(n²), enabling 100-200+ validators
- Stake-weighted leader election — deterministic rotation with stake proportional to selection probability
- 50,000-block epochs — approximately 5.5 hours per epoch