MonadBFT
MonadBFT is a high-performance consensus mechanism designed to achieve transaction ordering under partially synchronous conditions with Byzantine actors. It is derived from HotStuff, incorporating Jolteon/DiemBFT/Fast-HotStuff improvements. It is a pipelined, two-phase Byzantine Fault-Tolerant (BFT) algorithm with optimistic responsiveness. It has linear communication overhead in normal conditions and quadratic communication during timeouts. Communication in MonadBFT occurs in phases. The leader sends a signed message to voters, who then send signed responses to the subsequent leader. MonadBFT reduces the process from three rounds to two by utilizing quadratic communication complexity during leader timeouts.