Paper 2024/132 Original: eprint.iacr.org/2024/132 ↗
SimpleFT: A Simple Byzantine Fault Tolerant Consensus
Abstract
Although having been popular for a long time, Byzantine Fault Tolerance (BFT) consensus under the partially-synchronous network is denounced to be inefficient or even infeasible in recent years, which calls for a more robust asynchronous consensus. On the other hand, almost all the existing asynchronous consensus are too complicated to understand and even suffer from the termination problem. Motivated by the above problems, we propose SimpleFT in this paper, which is a simple asynchronous consensus and is mainly inspired by the simplicity of the Bitcoin protocol. With a re-understanding of the Bitcoin protocol, we disassemble the life cycle of a block into three phases, namely proposal, dissemination, and confirmation. Corresponding to these phases, we devise or introduce the sortition algorithm, reliable broadcast algorithm, and quorum certificate mechanism in SimpleFT, respectively. To make full use of the network resources and improve the system throughput, we further introduce the layered architecture to SimpleFT, which enables multiple blocks to be confirmed at the same height. Comprehensive analysis is made to validate the correctness of SimpleFT and various experiments are conducted to demonstrate its efficient performance.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2024-01-30: last updated
- 2024-01-30: published
- Short URL
- https://ia.cr/2024/132
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/132,
author = {Rui Hao and Chenglong Yi and Weiqi Dai and Zhaonan Zhang},
title = {SimpleFT: A Simple Byzantine Fault Tolerant Consensus},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/132},
year = {2024},
url = {https://eprint.iacr.org/2024/132}
}