Open AccessPosted Content
Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR
Oded Naor,Idit Keidar +1 more
Reads0
Chats0
TLDR
In this paper, the authors present an algorithm that achieves round synchronization with expected linear message complexity and expected constant latency, which is the first time for Byzantine state machine replication protocols with expected latency.Abstract:
State Machine Replication (SMR) solutions often divide time into rounds, with a designated leader driving decisions in each round. Progress is guaranteed once all correct processes synchronize to the same round, and the leader of that round is correct. Recently suggested Byzantine SMR solutions such as HotStuff, Tendermint, and LibraBFT achieve progress with a linear message complexity and a constant time complexity once such round synchronization occurs. But round synchronization itself incurs an additional cost. By Dolev and Reischuk's lower bound, any deterministic solution must have $\Omega(n^2)$ communication complexity. Yet the question of randomized round synchronization with an expected linear message complexity remained open.
We present an algorithm that, for the first time, achieves round synchronization with expected linear message complexity and expected constant latency. Existing protocols can use our round synchronization algorithm to solve Byzantine SMR with the same asymptotic performance.read more
Citations
More filters
Proceedings ArticleDOI
Making Byzantine Consensus Live
TL;DR: 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.
Journal ArticleDOI
Making Byzantine consensus live
TL;DR: 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.
Proceedings ArticleDOI
Internet Computer Consensus
TL;DR: The Internet Computer Consensus (ICC) family of protocols for atomic broadcast (a.k.a., consensus), which underpin the Byzantine fault-tolerant replicated state machines of the Internet Computer, are presented.
Journal Article
RandChain: Decentralised Randomness Beacon from Sequential Proof-of-Work.
TL;DR: This paper proposes RANDCHAIN, a new family of (permissioned) DRB protocols that applies Nakamoto consensus so that nodes agree on a unique blockchain and produces strongly unpredictable randomness and remains energy-efficient and decentralised.
Posted Content
Tenderbake -- A Solution to Dynamic Repeated Consensus for Blockchains
Lăcrămioara Aştefanoaei,Pierre Chambart,Antonella Del Pozzo,Thibault Rieutord,Sara Tucci,Eugen Zălinescu +5 more
TL;DR: This paper proposes a formalization of the Dynamic Repeated Consensus problem and provides generic procedures to solve it in the context of blockchains, and presents a complete solution, called Tenderbake, which works in a Byzantine and partially synchronous system model with eventually synchronous clocks.
References
More filters
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Book ChapterDOI
Short Signatures from the Weil Pairing
Dan Boneh,Ben Lynn,Hovav Shacham +2 more
TL;DR: A short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves is introduced, designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.
Proceedings ArticleDOI
Practical Byzantine fault tolerance
Miguel Castro,Barbara Liskov +1 more
TL;DR: A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Proceedings ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem.
Journal ArticleDOI
Consensus in the presence of partial synchrony
TL;DR: Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models that allow partially synchronous processors to reach some approximately common notion of time.