• Corpus ID: 238259821

Be Aware of Your Leaders

@article{Cohen2021BeAO,
  title={Be Aware of Your Leaders},
  author={Shir Cohen and Rati Gelashvili and Lefteris Kokoris-Kogias and Zekun Li and Dahlia Malkhi and Alberto Sonnino and Alexander Spiegelman},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.00960}
}
. Advances in blockchains have influenced the State-Machine-Replication (SMR) world and many state-of-the-art blockchain-SMR so-lutions are based on two pillars: Chaining and Leader-rotation . A prede-termined round-robin mechanism used for Leader-rotation, however, has an undesirable behavior: crashed parties become designated leaders infinitely often, slowing down overall system performance. In this paper, we provide a new Leader-Aware SMR framework that, among other desir-able properties… 
1 Citations

Figures from this paper

Cordial Miners: A Family of Simple, Efficient and Self-Contained Consensus Protocols for Every Eventuality
TLDR
The Cordial Miners protocols are self-contained, using simple all-to-all block communication to realize blocklace-based dissemination and equivocations exclusion, and can reduce the supermajority required for finality and eventually enjoy equivocation-free execution.

References

SHOWING 1-10 OF 21 REFERENCES
DiemBFT v4: State Machine Replication in the Diem Blockchain
  • Computer Science
  • 2021
TLDR
This report describes the 4 version of the algorithmic core of Diem consensus, named DiemBFT, which is responsible for forming agreement on ordering and finalizing transactions among a configurable set of validators, and formalizes the “safety isolation” guarantees.
ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication
TLDR
Evaluation shows that while ACE is outperformed by HotStuff in the optimistic, synchronous, failure-free case, ACE has absolute superiority during network asynchrony and attacks.
In Search for a Linear Byzantine Agreement
TLDR
This paper designs an optimistic protocol that first tries to reach an agreement via an efficient deterministic algorithm that relies on synchrony for termination, and then uses a randomized asynchronous algorithm for fallback that guarantees termination with probability $1.
Making Byzantine Consensus Live
TLDR
This work presents a formal specification of a view synchronizer and its implementation under partial synchrony, which runs in bounded space despite tolerating message loss during asynchronous periods, and shows that the synchronizer specification is strong enough to guarantee liveness for single-shot versions of several well-known Byzantine consensus protocols.
Streamlet: Textbook Streamlined Blockchains
TLDR
An extremely simple and natural paradigm called Streamlet for constructing consensus protocols that is inspired by the core techniques that have been uncovered in the past five years of work on consensus partly driven by the cryptocurrency community and how remarkably simple the new generation of consensus protocols has become in comparison with classical mainstream approaches such as PBFT and Paxos.
Order-Fairness for Byzantine Consensus
TLDR
This paper focuses on the problem of state machine replication, also known as Byzantine consensus, and how to ensure against adversarial manipulation the actual ordering of transactions in the log.
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains
TLDR
Tendermint modernizes classic academic work on the subject to provide a secure consensus protocol with accountability guarantees, as well as an interface for building arbitrary applications above the consensus.
Hyperledger fabric: a distributed operating system for permissioned blockchains
TLDR
This paper describes Fabric, its architecture, the rationale behind various design decisions, its most prominent implementation aspects, as well as its distributed application programming model, and shows that Fabric achieves end-to-end throughput of more than 3500 transactions per second in certain popular deployment configurations.
Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR
TLDR
This work presents an algorithm that, for the first time, achieves round synchronization with expected linear message complexity and expected constant latency, and existing protocols can use this algorithm to solve Byzantine SMR with the same asymptotic performance.
Cogsworth: Byzantine View Synchronization.
TLDR
The Byzantine View Synchronization problem is defined, which is responsible for eventually bringing all nodes to the same view for a sufficiently long time, and a third protocol is introduced, named Cogsworth, that has optimistically linear communication complexity and constant latency, and faced with benign failures, has expected linear communication and constantLatency.
...
...