REVIEW 2 cited by
Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in the WAN while processing over 100,000 transactions per second. We accomplish this remarkable performance by building Mahi-Mahi on an uncertified structured Directed Acyclic Graph (DAG). By forgoing explicit certification, we significantly reduce the number of messages required to commit and minimize CPU overhead associated with certificate verification. Mahi-Mahi introduces a novel commit rule that allows committing multiple blocks in each DAG round, while ensuring liveness in the presence of an asynchronous adversary. Mahi-Mahi can be parametrized to either attempt to commit within 5 message delays, maximizing the probability of commitment under a continuously active asynchronous adversary, or within 4 message delays, which reduces latency under a more moderate and realistic asynchronous adversary. We demonstrate the safety and liveness of Mahi-Mahi in a Byzantine context. Subsequently, we evaluate Mahi-Mahi in a geo-replicated setting and compare its performance against state-of-the-art asynchronous consensus protocols, showcasing Mahi-Mahi's significantly lower latency.
Forward citations
Cited by 2 Pith papers
-
Byzantine Consensus in the Random Asynchronous Model
Random message scheduling makes Byzantine consensus possible at n=2f+1 and n=f+2 with probabilistic safety, with matching impossibility results.
-
Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted Components
Fides proposes a TEE-assisted asynchronous DAG BFT consensus with n=2f+1 and low commit latency, but its liveness proof relies on an unsupported set-intersection claim.
Discussion (0). Continue with ORCID to comment.