Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus

We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in a wide-area network setting while processing over 100,000 transactions per second. Mahi-Mahi achieves such high performance by leveraging an uncertified structured Directed Acyclic Graph (DAG) to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the International Conference on Distributed Computing Systems S. 549 - 559
Hauptverfasser: Jovanovic, Philipp, Kokoris-Kogias, Lefteris, Kumara, Bryan, Sonnino, Alberto, Tennage, Pasindu, Zablotchi, Igor
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 21.07.2025
Schlagworte:
ISSN:2575-8411
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in a wide-area network setting while processing over 100,000 transactions per second. Mahi-Mahi achieves such high performance by leveraging an uncertified structured Directed Acyclic Graph (DAG) to forgo explicit certification. This reduces the number of messages required to commit and the CPU overhead for certificate verification, significantly. Mahi-Mahi introduces a novel commit rule that enables committing multiple blocks in each asynchronous DAG round. Mahi-Mahi can be parametrized either with a 5 network hops commit delay, maximizing the commit probability under a continuously active asynchronous adversary, or with a 4 network hops commit delay, reducing latency under a more moderate and realistic asynchronous adversary. We demonstrate safety and liveness of Mahi-Mahi in a Byzantine context for all of these parametrizations. Finally, we evaluate Mahi-Mahi in a geo-replicated setting and compare its performance to state-of-the-art asynchronous consensus protocols, showcasing Mahi-Mahi's significantly lower latency.
AbstractList We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in a wide-area network setting while processing over 100,000 transactions per second. Mahi-Mahi achieves such high performance by leveraging an uncertified structured Directed Acyclic Graph (DAG) to forgo explicit certification. This reduces the number of messages required to commit and the CPU overhead for certificate verification, significantly. Mahi-Mahi introduces a novel commit rule that enables committing multiple blocks in each asynchronous DAG round. Mahi-Mahi can be parametrized either with a 5 network hops commit delay, maximizing the commit probability under a continuously active asynchronous adversary, or with a 4 network hops commit delay, reducing latency under a more moderate and realistic asynchronous adversary. We demonstrate safety and liveness of Mahi-Mahi in a Byzantine context for all of these parametrizations. Finally, we evaluate Mahi-Mahi in a geo-replicated setting and compare its performance to state-of-the-art asynchronous consensus protocols, showcasing Mahi-Mahi's significantly lower latency.
Author Zablotchi, Igor
Jovanovic, Philipp
Kumara, Bryan
Sonnino, Alberto
Kokoris-Kogias, Lefteris
Tennage, Pasindu
Author_xml – sequence: 1
  givenname: Philipp
  surname: Jovanovic
  fullname: Jovanovic, Philipp
  organization: UCL,London,United Kingdom
– sequence: 2
  givenname: Lefteris
  surname: Kokoris-Kogias
  fullname: Kokoris-Kogias, Lefteris
  organization: Mysten Labs,Athens,Greece
– sequence: 3
  givenname: Bryan
  surname: Kumara
  fullname: Kumara, Bryan
  organization: The Alan Turing Institute,London,United Kingdom
– sequence: 4
  givenname: Alberto
  surname: Sonnino
  fullname: Sonnino, Alberto
  organization: UCL,Mysten Labs,London,United Kingdom
– sequence: 5
  givenname: Pasindu
  surname: Tennage
  fullname: Tennage, Pasindu
  organization: EPFL,Lausanne,Switzerland
– sequence: 6
  givenname: Igor
  surname: Zablotchi
  fullname: Zablotchi, Igor
  organization: Mysten Labs,Zurich,Switzerland
BookMark eNotjNFOwjAUQKvRRED-QJP9QPHedm3v9GkMQZIZH9w7KeUuzGhnKMTs79XoyzkvJ2csLmIfWYhbhBkiFHfralG9Wg2kZwqUmQGAhTMxLVxBWqNBp7Q9FyNlnJGUI16JcUpvP5khq0fi4dnvO_mL-6zuv2TtjxzDkJVpiGF_6GN_Stl82WSLciXnPvEuq_qYOKZTuhaXrX9PPP33RDTLx6Z6kvXLal2VtewKfZStp9CCDTtv2RgiSzlvtwXxts1zUtbm5MBbaxyGHVgDFNCzZwcmICitJ-Lmb9sx8-bz0H34w7BBRNJOWf0N_OdIiA
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICDCS63083.2025.00060
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9798331517236
EISSN 2575-8411
EndPage 559
ExternalDocumentID 11183726
Genre orig-research
GroupedDBID 29G
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i93t-fa8cf06cda6e5588684ebb98ebf4482664870a66571cd06508c1aeae705c10233
IEDL.DBID RIE
IngestDate Wed Oct 15 14:20:52 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i93t-fa8cf06cda6e5588684ebb98ebf4482664870a66571cd06508c1aeae705c10233
PageCount 11
ParticipantIDs ieee_primary_11183726
PublicationCentury 2000
PublicationDate 2025-July-21
PublicationDateYYYYMMDD 2025-07-21
PublicationDate_xml – month: 07
  year: 2025
  text: 2025-July-21
  day: 21
PublicationDecade 2020
PublicationTitle Proceedings of the International Conference on Distributed Computing Systems
PublicationTitleAbbrev ICDCS
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0005863
Score 2.3115368
Snippet We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in a wide-area network setting while processing over...
SourceID ieee
SourceType Publisher
StartPage 549
SubjectTerms Asynchronous Consensus
BFT
Blockchain
Certification
Consensus protocol
Delays
Directed acyclic graph
Distributed computing
Low latency communication
Robustness
Safety
Throughput
Title Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus
URI https://ieeexplore.ieee.org/document/11183726
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED7RioGpPIp4ywOraVIntgNTHxSQSlWJDt2qs2OLLinqA9R_j-2mlIWBxYq8RDrL_u47-7sP4NZKZkVqU8o0SprksaYZU4JGbjpJlJWJxWA2IQYDOR5nw1KsHrQwxpjw-Mzc-c9wl5_P9MqXyhpuXzo-1eQVqAghNmKt3XsOyVkp0YmjrPHS6XbeOHMZhiOBTV84iXwbyl8WKgFBerV__vsQ6jstHhn-oMwR7JniGGpbMwZS7s0TeHjF9yn1wz3pz75oH302vCatxbrQvgOuo_ik3RuRbuuJth125cSbdXqni0UdRr3HUeeZls4IdJqxJbUotY24zpGbNJWSy8QolUmjrGNbDnIdC4nQ36nEOg85mI7RoBFRqn2rBnYK1WJWmDMgAqVimCiWOaAXFhGtMS7Fyt1JyDER51D3sZh8bHpfTLZhuPhj_hIOfLh99bMZX0F1OV-Za9jXn8vpYn4TVuwbm2KV6g
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED5BQYKpPIp444HVNImdxIGpD0or0qoSGbpVF8cWXVLUB6j_HjtNKQsDixV5iXSW_d139ncfwL0WTIe-9imTKCjPXEkjlobUMdOcp1pwjYXZRDgYiNEoGpZi9UILo5QqHp-pB_tZ3OVnU7m0pbK62ZeGT3nBLuz5nHvuWq61fdEhAlaKdFwnqvda7dZbwEyOYWigZ0snjm1E-ctEpcCQTvWffz-C2laNR4Y_OHMMOyo_gerGjoGUu_MUnvr4PqF2eCTx9IvGaPPhFWnMV7m0PXANySfNTkLajRfaNOiVEWvXab0u5jVIOs9Jq0tLbwQ6idiCahRSO4HMMFC-L0QguErTSKhUG75lQNfwEAftrYorsyILky4qVKHjS9usgZ1BJZ_m6hxIiCJlyFMWGagPNSJqpUySlZmzMEAeXkDNxmL8se5-Md6E4fKP-Ts46Cb9eBz3Bq9XcGhDb2uhnnsNlcVsqW5gX34uJvPZbbF635tQmTE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+International+Conference+on+Distributed+Computing+Systems&rft.atitle=Mahi-Mahi%3A+Low-Latency+Asynchronous+BFT+DAG-Based+Consensus&rft.au=Jovanovic%2C+Philipp&rft.au=Kokoris-Kogias%2C+Lefteris&rft.au=Kumara%2C+Bryan&rft.au=Sonnino%2C+Alberto&rft.date=2025-07-21&rft.pub=IEEE&rft.eissn=2575-8411&rft.spage=549&rft.epage=559&rft_id=info:doi/10.1109%2FICDCS63083.2025.00060&rft.externalDocID=11183726