HASBFT: A Byzantine Fault-Tolerant Consensus Algorithm with Transaction Hash Compression and Aggregated Signature Optimization

As the core mechanism of blockchain systems, distributed consensus algorithms are always constrained by the FLP impossibility theorem and the CAP theorem. The FLP theorem reveals the unattainability of deterministic consensus in asynchronous networks, while the CAP theorem requires systems to make trade-offs among consistency, availability, and partition tolerance. Traditional Byzantine Fault Tolerance (BFT) consensus algorithms achieve strong consistency through multi-round voting mechanisms, but they have high communication complexity and suffer from two major bottlenecks: transaction hash expansion and signature verification delay, which severely limit their practical performance in consortium chain scenarios. Therefore, this paper proposes a low-latency, high-throughput, and scalable BFT consensus algorithm HASBFT, which optimizes through transaction hash compression and aggregated signatures. Firstly, the algorithm achieves linear communication complexity by combining threshold signature technology with a chain structure. Secondly, the transaction hash compression module significantly enhances the communication speed during the consensus process. Finally, the aggregated signature optimization module makes signature verification more efficient. Experimental results show that HASBFT has lower communication latency and higher throughput compared to the classic HotStuff and PBFT algorithms.