Chronos: An Efficient Asynchronous Byzantine Ordered Consensus

• Published in: Computer journal Vol. 67; no. 3; pp. 1153 - 1162
• Main Authors: Zhang, Zongyang, Zhang, Lingyue, Wang, Zhuo, Li, Yichen, Lu, Rongxing, Yu, Yong
• Format: Journal Article
• Language: English
• Published: Oxford University Press 14.04.2024
• Subjects: Asynchronous Network; Byzantine Ordered Consensus; Digital Signature; Blockchain
• ISSN: 0010-4620; 1460-2067
• DOI: 10.1093/comjnl/bxad048

Byzantine ordered consensus, introduced by Zhang et al. (OSDI 2020), is a new consensus primitive that additionally guarantees a correctness specification of transaction order, allowing nodes to assign fairly an ordering indicator to the committed transaction. Zhang et al. also presented a concrete Byzantine ordered consensus protocol called Pompē in the partially synchronous network model. However, Pompē cannot prevent an adversary from manipulating message delivery time. In this paper, we present Chronos, the first Byzantine ordered consensus protocol in the asynchronous network model, where an adversary can arbitrarily manipulate message delivery time. To construct Chronos, we propose a variant of asynchronous common subset called signal asynchronous common subset protocol, which guarantees the liveness of Chronos. We implement both Chronos and its baseline HoneyBadgerBFT using Go language and deploy them on 100 Amazon t3.medium instances distributed throughout 10 regions across the world. The experimental results show that Chronos is more efficient than HoneyBadgerBFT for small network, achieving peak throughput of 59 368 tx/s when the batch size is 100 000 and the number of nodes is 4, while the peak of HoneyBadgerBFT is 57 077 tx/s.