.png){kind=icon}
.png){kind=icon}
Return
Dolphin: Efficient Non-Blocking Consensus via Concurrent Block Generation
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2024.3399772.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Blockchain technology has become a research hotspot in distributed systems, aiming to sustain a decentralized ledger via consensus. Traditional consensus solutions exhibit slow processing speed and response time, resulting in poor performance. To address this issue, several consensus protocols have been proposed. One such popular protocol is HotStuff, a Byzantine fault-tolerant consensus (BFT) that achieves high throughput at the cost of latency. However, its throughput suffers from a proportional decrease with the increase in latency, posing a significant challenge. In this paper, we propose a new protocol called Dolphin that builds upon HotStuff. It operates in a partially synchronous network with n replicas, up to $f byzantine faults, where n >= 3f+1, and achieves higher throughput in high-latency environments by leveraging non-blocking concurrent block generation. Specifically, we formalize our strategy as a generic Asynchronization Procedure Patch and prove that it does not affect the execution process of the original protocol. Theoretical analysis validates that Dolphin preserves the safety, liveness, and responsiveness properties while enhancing the throughput. The evaluation demonstrates that Dolphin typically achieves more than 10x higher throughput in Wide Area Network (WAN) environments with lower latency compared to HotStuff and its variants, and exhibits similar bandwidth utilization to DAG-based protocols such as Narwhal.
Keywords:
Protocols
Throughput
Dolphins
Complexity theory
Mobile computing
Wide area networks
Safety
Blockchain
Byzantine fault-tolerant
consensus
high-latency environments
non-blocking
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W