Briefing
The core problem in high-throughput Byzantine Fault Tolerant (BFT) systems based on Directed Acyclic Graphs (DAGs) is the latency imposed by explicit block certification. This research introduces Mahi-Mahi, an asynchronous BFT protocol that fundamentally restructures the consensus process by utilizing an uncertified structured DAG alongside a novel commit rule that allows for the simultaneous commitment of multiple blocks per round. By eliminating the overhead of explicit certification, the protocol drastically reduces message complexity and CPU load, thereby pushing the theoretical and practical limits of consensus to achieve provably secure sub-second finality. This breakthrough fundamentally re-architects the trade-off between throughput and latency, making instantaneous economic finality a realistic goal for scalable decentralized networks.
Context
Traditional BFT protocols, including many modern DAG-based variants, are constrained by the necessity of explicit block certification. This process requires all validators to exchange and verify cryptographic proofs of agreement on every block, resulting in a high message complexity that, while guaranteeing security, introduces significant latency, typically in the range of several seconds. This high latency is the prevailing theoretical limitation that compromises user experience and prevents the deployment of low-latency, real-time decentralized applications.
Analysis
Mahi-Mahi’s breakthrough lies in decoupling block propagation from explicit consensus certification. The system is built on an uncertified DAG , where nodes continuously broadcast blocks without waiting for a formal, cryptographic certificate of the previous block’s finality. The new mechanism is a novel commit rule that analyzes the structure of the DAG itself.
A block is committed not by a single, expensive certificate, but when the DAG structure confirms a sufficient number of subsequent blocks have been created and seen by a Byzantine-majority of honest nodes. This structural commitment allows the protocol to batch the finality of multiple blocks in a single logical step, minimizing the number of message delays required for a transaction to achieve finality.
Parameters
- WAN Latency → Sub-second commitment time in a Wide Area Network setting.
- Throughput → Over 100,000 Transactions Per Second (TPS).
- Commit Delays → Commitment can be parametrized to occur within 4 or 5 message delays.
Outlook
This research establishes a new performance benchmark for asynchronous consensus, directly challenging the perceived limits of the latency-throughput trade-off in BFT systems. The ability to achieve sub-second finality in an asynchronous network model unlocks real-world applications requiring instantaneous economic settlement, such as high-frequency trading on-chain and global payment systems. Future research will focus on integrating this uncertified DAG architecture with decentralized sequencing and proposer-builder separation to ensure credible neutrality while maintaining this low-latency performance profile.
Verdict
Mahi-Mahi’s uncertified DAG architecture and novel commit rule provide a foundational advancement in distributed systems theory, proving that asynchronous Byzantine consensus can achieve practical, sub-second finality.
