Separation is good: A faster order-fairness Byzantine consensus
Order-fairness has been introduced recently as a new property for Byzantine Fault-Tolerant (BFT) consensus protocol to prevent unilaterally deciding the final order of transactions, which allows mitigating the threat of adversarial transaction order manipulation attacks (e.g., front-running) in blockchain networks and decentralized finance (DeFi). However, existing leader-based order-fairness protocols (which do not rely on synchronized clocks) still suffer from poor performance since they strongly couple fair ordering with consensus processes. In this paper, we propose SpeedyFair, a high-performance order-fairness consensus protocol, which is motivated by our insight that the ordering of transactions does not rely on the execution results of transactions in previous proposals (after consensus). SpeedyFair achieves its efficiency through a decoupled design that performs fair ordering individually and consecutively, separating from consensus. In addition, by decoupling fair ordering from consensus, SpeedyFair enables parallelizing the order/verify mode that was originally executed serially in the consensus process, which further speeds up the performance. We implement a prototype of SpeedyFair on the top of the Hotstuff protocol. Extensive experimental results demonstrate that SpeedyFair significantly outperforms the state-of-the-art order-fairness protocol (i.e., Themis), which achieves a throughput of 1.5×-2.45× greater than Themis while reducing latency by 35%-59%.
Funding
National Key R&D Program of China under Grant 2021YFF0900300
Key Talent Programs of Guangdong Province under Grant 2021QN02X166
National Natural Science Foundation of China (Project No. 72031003)
History
School
- Science
Department
- Computer Science
Published in
Proceedings 2024 Network and Distributed System Security SymposiumSource
Network and Distributed System Security SymposiumPublisher
Internet SocietyVersion
- VoR (Version of Record)
Rights holder
© The Author(s)Publisher statement
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (https://creativecommons.org/licenses/by-nc-nd/4.0/).Publication date
2024-03-01Copyright date
2024ISBN
1891562932Publisher version
Language
- en