Leaderless Consensus

Antoniadis, Karolos; Desjardins, Antoine; Gramoli, Vincent; Guerraoui, Rachid; Zablotchi, Igor

doi:10.1109/icdcs51616.2021.00045

Cited by 17 publications

(10 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, for every epoch e, P i sends (at most) O(n) view-core messages associated with views that belong to e (by Lemma 40). 9 As each , and view-core message contains a single word and P i sends at most O(n) words during the certi cation phase (by Lemma 42), we have that P i sends (at most) epochs The theorem holds. 9 Note that lemmas 22,23,24,25,26,39 and 40, which we use to prove the theorem, assume that all correct processes have started executing R S and by GST .…”

Section: Sq : Proof Of Correctness and Complexitymentioning

confidence: 84%

“…9 As each , and view-core message contains a single word and P i sends at most O(n) words during the certi cation phase (by Lemma 42), we have that P i sends (at most) epochs The theorem holds. 9 Note that lemmas 22,23,24,25,26,39 and 40, which we use to prove the theorem, assume that all correct processes have started executing R S and by GST . In Theorem 43, this might not be true as some processes might start executing R S after GST (since t last > GST ).…”

Section: Sq : Proof Of Correctness and Complexitymentioning

confidence: 84%

“…It might be worthwhile highlighting some connections between the view synchronization abstraction and the leader election abstraction Ω [17,18], capturing the weakest failure detection information needed to solve consensus (and extended to the Byzantine context in [34]). Leaderless partially synchronous Byzantine consensus protocols have also been proposed [9], somehow indicating that the notion of a leader is not necessary in the mechanisms of a consensus protocol, even if Ω is the weakest failure detector needed to solve the problem. Clock synchronization [24, 54] and view synchronization are orthogonal problems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]

Civit¹,

Ayaz²,

Gilbert³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether a consensus protocol with quadratic communication complexity can be obtained in partial synchrony. Until now, the most e cient known solutions for Byzantine consensus in partially synchronous settings had cubic communication complexity (e.g., HotStu , binary DBFT).This paper closes the existing gap by introducing S , a partially synchronous Byzantine consensus protocol with quadratic worst-case communication complexity. In addition, S is optimally-resilient and achieves linear worst-case latency complexity. The key technical contribution underlying S lies in the way we solve view synchronization, the problem of bringing all correct processes to the same view with a correct leader for su ciently long. Concretely, we present R S , a view synchronization protocol with quadratic communication complexity and linear latency complexity, which we utilize in order to obtain S .

show abstract

Section: Sq : Proof Of Correctness and Complexitymentioning

confidence: 84%

Section: Sq : Proof Of Correctness and Complexitymentioning

confidence: 84%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]

Civit¹,

Ayaz²,

Gilbert³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…It might be worthwhile highlighting some connections between the view synchronization abstraction and the leader election abstraction Ω [49,50], capturing the weakest failure detection information needed to solve consensus (and extended to the Byzantine context in [51]). Leaderless partially synchronous Byzantine consensus protocols have also been proposed [52], somehow indicating that the notion of a leader is not necessary in the mechanisms of a consensus protocol, even if Ω is the weakest failure detector needed to solve the problem. Clock synchronization [53,54] and view synchronization are orthogonal problems.…”

Section: Related Workmentioning

confidence: 99%

Byzantine Consensus is Θ(n2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

Civit

Ayaz

Gilbert

et al. 2023

Preprint

View full text Add to dashboard Cite

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether a consensus protocol with quadratic communication complexity can be obtained in partial synchrony. Until now, the most efficient known solutions for Byzantine consensus in partially synchronous settings had cubic communication complexity (e.g., HotStuff, binary DBFT). This paper closes the existing gap by introducing SQuad, a partially synchronous Byzantine consensus protocol with quadratic worst-case communication complexity. In addition, SQuad is optimally-resilient and achieves linear worst case latency complexity. The key technical contribution underlying SQuad lies in the way we solve view synchronization, the problem of bringing all correct processes to the same view with a correct leader for sufficiently long. Concretely, we present RareSync, a view synchronization protocol with quadratic communication complexity and linear latency complexity, which we utilize in order to obtain SQuad.

show abstract

“…In this work, we consider a subset of blockchain protocol models that incorporate leader election, block dissemination and consensus rules operating under partial synchrony. Our work excludes leaderless consensus algorithms [29] and leaderless blockchain models such as Avalanche [30].…”

Section: System Model and Objectivesmentioning

confidence: 99%

ALDER: Unlocking blockchain performance by multiplexing consensus protocols

Korkmaz¹,

Bruneau-Queyreix²,

Mokthar³

et al. 2022

Preprint

View full text Add to dashboard Cite

Most of today's online services (e.g., social networks, search engines, market places) are centralized, which is recognized as unsatisfactory by a majority of users for various reasons (e.g., centralized governance, censorship, loss of control over personal data). Blockchain technologies promise a new Web revolution (Web 3.0) through the decentralization of online services. However, one of the key limitations for this revolution to happen at a planetary scale is the poor performance of today's blockchains. We propose in this paper ALDER, a solution for unlocking the performance of off-the-shelf leaderbased blockchains by multiplexing their consensus protocol. Our solution leverages the existence of multiple potential leaders to alleviate the bottleneck that exists at different levels of consensus protocols. To illustrate the benefits it brings to Blockchain performance, we apply ALDER to three representative blockchains, namely Algorand (Proof-of-Stake), RapidChain (Sharding-based) and Bitcoin (Proof-of-Work). Our evaluation, involving up to 10,000 nodes deployed on 100 physical machines, shows that using ALDER can provide up to a 300% improvement in both throughput and latency reduction.

show abstract

Leaderless Consensus

Cited by 17 publications

References 27 publications

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version]

Byzantine Consensus is Θ(n2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!

ALDER: Unlocking blockchain performance by multiplexing consensus protocols

Contact Info

Product

Resources

About