DROPS

Document

Brief Announcement

DOI: 10.4230/LIPIcs.DISC.2025.59

Brief Announcement: Carry the Tail in Consensus Protocols

Authors: Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi

Published in: LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025)

Abstract

We present Carry-the-Tail, the first deterministic atomic broadcast protocol in partial synchrony that, after GST, simultaneously guarantees two desirable properties: (i) a constant fraction of commits are proposed by non-faulty leaders against tail-forking attacks, and (ii) optimal, worst-case quadratic communication under a cascade of faulty leaders. The solution also guarantees linear amortized communication, i.e., the steady-state is linear. Combining these two desirable properties was not simultaneously achieved previously: on one hand, prior atomic broadcast solutions achieve per-view linear word communication complexity. However, they face a significant degradation in throughput under tail-forking attack. On the other hand, existing solutions to tail-forking attacks require either quadratic communication steps or computationally-prohibitive SNARK generation. The key technical contribution is Carry, a practical drop-in mechanism for streamlined protocols in the HotStuff family. Carry guarantees good performance against tail-forking and removes most leader-induced stalls, while retaining linear traffic and protocol simplicity. Carry-the-Tail implements the Carry mechanism on HotStuff-2.

Cite as

Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi. Brief Announcement: Carry the Tail in Consensus Protocols. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 59:1-59:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{gupta_et_al:LIPIcs.DISC.2025.59,
  author =	{Gupta, Suyash and Kang, Dakai and Malkhi, Dahlia and Sadoghi, Mohammad},
  title =	{{Brief Announcement: Carry the Tail in Consensus Protocols}},
  booktitle =	{39th International Symposium on Distributed Computing (DISC 2025)},
  pages =	{59:1--59:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-402-4},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{356},
  editor =	{Kowalski, Dariusz R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.59},
  URN =		{urn:nbn:de:0030-drops-248759},
  doi =		{10.4230/LIPIcs.DISC.2025.59},
  annote =	{Keywords: Consensus, Blockchain, BFT}
}

Document

Brief Announcement

DOI: 10.4230/LIPIcs.DISC.2019.44

Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization

Authors: Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi

Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)

Abstract

In this brief announcement, we propose a protocol-agnostic approach to improve the design of primary-backup consensus protocols. At the core of our approach is a novel wait-free design of running several instances of the underlying consensus protocol in parallel. To yield a high-performance parallelized design, we present coordination-free techniques to order operations across parallel instances, deal with instance failures, and assign clients to specific instances. Consequently, the design we present is able to reduce the load on individual instances and primaries, while also reducing the adverse effects of any malicious replicas. Our design is fine-tuned such that the instances coordinated by non-faulty replicas are wait-free: they can continuously make consensus decisions, independent of the behavior of any other instances.

Cite as

Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 44:1-44:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{gupta_et_al:LIPIcs.DISC.2019.44,
  author =	{Gupta, Suyash and Hellings, Jelle and Sadoghi, Mohammad},
  title =	{{Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{44:1--44:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Suomela, Jukka},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.44},
  URN =		{urn:nbn:de:0030-drops-113514},
  doi =		{10.4230/LIPIcs.DISC.2019.44},
  annote =	{Keywords: Consensus, primary-backup, high-performance, wait-free parallelization}
}

Search Results

Documents authored by Gupta, Suyash

Brief Announcement: Carry the Tail in Consensus Protocols

Abstract

Cite as

Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization

Abstract

Cite as

Thanks for your feedback!

Could not send message