Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback

Gelashvili, Rati; Kokoris-Kogias, Lefteris; Sonnino, Alberto; Spiegelman, Alexander; Xiang, Zhuolun

doi:10.1007/978-3-031-18283-9_14

Cited by 27 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These protocols employ semisynchronous BFT as the primary, high-speed lane, while utilizing asynchronous BFT as the secondary, slower backup. Recent research contributions, exemplified by BDT [14] and Jolteon and Ditto [15], aim to optimize this approach. Gelashvili and colleagues [15] combined the deterministic HotStuff with a recently proposed MVBA [31] to achieve robust randomization-based view change in asynchronous network.…”

Section: Optimistic Asynchronous Bft Protocolsmentioning

confidence: 99%

“…Recent research contributions, exemplified by BDT [14] and Jolteon and Ditto [15], aim to optimize this approach. Gelashvili and colleagues [15] combined the deterministic HotStuff with a recently proposed MVBA [31] to achieve robust randomization-based view change in asynchronous network. Therefore, Ditto accomplishes handling failures in views caused by asynchronous networks or faults through MVBA, striving to minimize the overhead associated with switching during failures.…”

Section: Optimistic Asynchronous Bft Protocolsmentioning

confidence: 99%

“…To address the performance limitations of asynchronous protocols, researchers have recently introduced optimistic asynchronous protocols [12][13][14][15]. These algorithms typically incorporate two distinctive paths: an optimistic path, reliant on multicast communication, and a pessimistic path, founded on complete asynchronous consensus.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT Protocol

Song,

Zhou

2024

Applied Sciences

View full text Add to dashboard Cite

Currently, integrating partially synchronous Byzantine-fault-tolerant protocols into asynchronous protocols as fast lanes represents a trade-off between robustness and efficiency, a concept known as optimistic asynchronous protocols. Existing optimistic asynchronous protocols follow a fixed path order: they execute the fast lane first, switch to the slow lane after a timeout failure, and restart the fast lane after the slow lane execution is completed. However, when confronted with prolonged network fluctuations, this fixed path sequence results in frequent failures and fast lane switches, leading to overhead that diminishes the efficiency of optimistic asynchronous protocols compared with their asynchronous counterparts. In response to this challenge, this article introduces FlexBFT, a novel and flexible optimistic asynchronous consensus framework designed to significantly enhance overall consensus performance. The key innovation behind FlexBFT lies in the persistence of slow lanes. In the presence of persistent network latency, FlexBFT can continually operate round after round within the slow lane—the current optimal path—until the network conditions improve. Furthermore, FlexBFT offers the flexibility to combine consensus modules adaptively, further enhancing its performance. Particularly in challenging network conditions, FlexBFT’s experimental outcomes highlight its superiority across a range of network scenarios compared with state-of-the-art algorithms. It achieves a performance with 31.6% lower latency than BDT, effectively merging the low latency characteristic of deterministic protocols with the robustness inherent in asynchronous protocols.

show abstract

Section: Optimistic Asynchronous Bft Protocolsmentioning

confidence: 99%

Section: Optimistic Asynchronous Bft Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT Protocol

Song,

Zhou

2024

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…The aforementioned dual-mode protocols are proposed based on the number of honest nodes in the system and the identity of nodes that assume certain roles. In contrast, protocols such as Bolt-Dumbo [29], Jolteon-Ditto [30], and Flexico [31] are proposed based on synchronous and asynchronous environments. When the designated nodes are in a synchronous or weakly synchronous state, the fast protocol is used.…”

Section: Protocolmentioning

confidence: 99%

CF-BFT: A Dual-Mode Byzantine Fault-Tolerant Protocol Based on Node Authentication

Zhang,

Wang,

Liu

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

The consensus protocol is one of the core technologies in blockchain, which plays a crucial role in ensuring the block generation rate, consistency, and safety of the blockchain system. Blockchain systems mainly adopt the Byzantine Fault Tolerance (BFT) protocol, which often suffers from slow consensus speed and high communication consumption to prevent Byzantine nodes from disrupting the consensus. In this paper, this paper proposes a new dual-mode consensus protocol based on node identity authentication. It divides the consensus process into two subprotocols: Check_BFT and Fast_BFT. In Check_BFT, the replicas authenticate the primary's identity by monitoring its behaviors. First, assume that the system is in a pessimistic environment, Check_BFT protocol detects whether the current environment is safe and whether the primary is an honest node; Enter the fast consensus stage after confirming the environmental safety, and implement Fast_BFT protocol. It is assumed that there are 3f + 1 nodes in total. If more than 2f + 1 nodes identify that the primary is honest, it will enter the Fast_BFT process. In Fast_BFT, the primary is allowed to handle transactions alone, and the replicas can only receive the messages sent by the primary. The experimental results show that the CF-BFT protocol significantly reduces the communication overhead and improves the throughput and scalability of the consensus protocol. Compared with the SAZyzz protocol, the throughput is increased by 3 times in the best case and 60% in the worst case. KEYWORDSBlockchain; consensus protocol; dual-mode; Byzantine fault tolerance; distributed system Hence, BFT protocols make different "sacrifices" to prevent attacks, which can result in issues such as low consensus performance and high resource overhead. Proof of Work (PoW) uses computational competition for ledger rights and rewards to prevent malicious behavior and blockchain fork problems, but it results in excessive resource consumption. Proof of Stake (PoS) [15], on the other hand, uses stake competition and "Coin Days" to measure node rights but sacrifices fair competition and decentralization characteristics of the blockchain. Practical Byzantine Fault Tolerance (PBFT) protocol [16] uses cryptographic technology and mutual voting to maintain consistency, but its communication complexity and high demand have limited its scalability.To solve these issues, this paper presents a dual-mode consensus protocol based on node identity authentication. The protocol divides the consensus process into two subprotocols: Check_BFT and Fast_BFT. By monitoring the behavior of the primary in Check_BFT to verify the primary's identity, the Fast_BFT protocol is initiated if appropriate to allow the primary node to handle transactions alone. The protocol greatly improves consensus efficiency and reduces communication costs without relying on extensive resource consumption, while ensuring consistency and security. The particular contributions of this paper are:• This paper introduces a node identity verification pro...

show abstract

“…Therefore, certain protocols attempt to maintain improved performance in a synchronous network environment while also achieving robustness against asynchronous networks. Accordingly, several systems have adopted this idea by utilizing a dual-mode consensus protocol [ 12 – 15 , 35 , 36 ]. The characteristics of such protocols are summarized in Table 2 .…”

Section: Introductionmentioning

confidence: 99%

Flexico: An efficient dual-mode consensus protocol for blockchain networks

et al. 2022

View full text Add to dashboard Cite

Blockchain is a Byzantine fault tolerant (BFT) system wherein decentralized nodes execute consensus protocols to drive the agreement process on new blocks added to a distributed ledger. Generally, two-round communications among 3 f + 1 nodes are required to tolerate up to f faults in BFT-based consensus networks. This communication pattern corresponds to the worse-case scenario of consensus achievement, even under asynchronous network conditions. Nevertheless, it is not uncommon for a network to operate under better conditions, where a consensus can be reached with a lower communication cost. Hence, with the addition of a faster optimistic path toward an agreement, the idea of dual-mode consensus has been proposed as a promising approach to enhance the performance of asynchronous BFT protocols. However, this opportunity is not completely exploited by existing dual-mode protocols as the fast path can be followed only in a nonfaulty and synchronous network. This article presents a novel dual-mode protocol consisting of fast and backup subprotocols. To create different consensus committees for fast and backup-mode operations, the network contains both active and passive nodes. A consensus can be expedited through a fast-mode operation when majority of the active nodes can communicate synchronously. Under non-ideal conditions, the backup protocol takes over the agreement process from its fast-mode counterpart without starting over the suspended round. The safety and liveness of the proposed protocol are guaranteed with lower communication costs, which balance the trade-off between protocol efficiency and availability.

show abstract

Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback

Cited by 27 publications

References 19 publications

FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT Protocol

FlexBFT: A Flexible and Effective Optimistic Asynchronous BFT Protocol

CF-BFT: A Dual-Mode Byzantine Fault-Tolerant Protocol Based on Node Authentication

Flexico: An efficient dual-mode consensus protocol for blockchain networks

Contact Info

Product

Resources

About