Paper 2025/134 Original: eprint.iacr.org/2025/134 ↗
TockOwl: Asynchronous Consensus with Fault and Network Adaptability
Abstract
BFT protocols usually have a waterfall-like degradation in performance in the face of crash faults. Some BFT protocols may not experience sudden performance degradation under crash faults. They achieve this at the expense of increased communication and round complexity in fault-free scenarios. In a nutshell, existing protocols lack the adaptability needed to perform optimally under varying conditions. We propose TockOwl, the first asynchronous consensus protocol with fault adaptability. TockOwl features quadratic communication and constant round complexity, allowing it to remain efficient in fault-free scenarios. TockOwl also possesses crash robustness, enabling it to maintain stable performance when facing crash faults. These properties collectively ensure the fault adaptability of TockOwl. Furthermore, we propose TockOwl+ that has network adaptability. TockOwl+ incorporates both fast and slow tracks and employs hedging delays, allowing it to achieve low latency comparable to partially synchronous protocols without waiting for timeouts in asynchronous environments. Compared to the latest dual-track protocols, the slow track of TockOwl+ is simpler, implying shorter latency in fully asynchronous environments.
Metadata
- Available format(s)
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-04-03: last updated
- 2025-01-28: published
- Short URL
- https://ia.cr/2025/134
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0/
BibTeX
@misc{cryptoeprint:2025/134,
author = {Minghang Li and Qianhong Wu and Zhipeng Wang and Bo Qin and Bohang Wei and Hang Ruan and Shihong Xiong and Zhenyang Ding},
title = {TockOwl: Asynchronous Consensus with Fault and Network Adaptability},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/134},
year = {2025},
url = {https://eprint.iacr.org/2025/134}
}