BitFT: An Understandable, Performant and Resource-Efficient Blockchain Consensus

Blockchain technology has gained prominence for its potential to address security and privacy challenges in Internet-of-Things (IoT) services and Cyber-Physical Systems (CPS) due to its decentralized, traceable, and immutable nature. However, the considerable energy consumption associated with blockchain, exemplified by Bitcoin, has raised sustainability concerns. This paper introduces BitFT, a consensus protocol that combines the strengths of both lottery-based and voting-based mechanisms to offer a sustainable, comprehensible, and high-performance solution. BitFT dissects the block lifecycle into three phases: dissemination, and commitment phases, which correspond to the Bitcoin framework. It leverages a multiple-round sortition algorithm, a Reliable Broadcast (Rbc) protocol, and a Quorum Certificate (QC) mechanism to facilitate efficient protocol operation. The sortition algorithm functions like a lottery algorithm, while the Rbc protocol and $QC$ mechanism are implemented based on votes. In order to maximize network utilization and enhance system throughput, we further introduce a layered architecture to BitFT, which allows for concurrent commitment of multiple blocks at the same height. We perform a comprehensive analysis to verify the correctness of BitFT and conduct various experiments to demonstrate its high performance.