✳flâneur — a map of the web's best reading

MonadBFT | Monad Developer Documentation

docs.monad.xyz · 5,174 words · saved by 1 readers

Important: This page describes the current version of consensus running on the Monad testnet. For the future version of MonadBFT, check out the blog post and paper by Category Labs. MonadBFT is a consensus mechanism that supports high throughput, fast finality, and a large number of participants. MonadBFT allows globally distributed nodes to reach agreement on a single ordering of transactions. Like other BFT algorithms, MonadBFT operates under the assumptions of partial synchrony and a maximum 33% Byzantine stake weight. MonadBFT is a derivative of HotStuff with improvements proposed in Jolteon/DiemBFT/Fast-HotStuff, which include introducing a quadratic-complexity timeout mechanism that allows the protocol to reduce from three rounds to two, and pipelining block proposals with response certificates so that a new block can be proposed each round. Some notable features of MonadBFT, described herein, include: Path from proposal to finality for block N in MonadBFT in the happy path. Comm

MonadBFT - Monad Documentation Documentation Index Fetch the complete documentation index at: /llms.txt Use this file to discover all available pages before exploring further. Skip to main content ​ Summary MonadBFT represents a major leap in Byzantine Fault Tolerant (BFT) consensus. It is responsible for ensuring that the Monad network aligns on valid proposed blocks efficiently and securely, while supporting 10,000+ tx/s and sub-second time-to-finality, while also supporting a large consensus node set. MonadBFT combines all of these properties while also being resilient to tail-forking , a c

Explore this link on the map →

saved by

related reading