A novel dynamic practical byzantine fault tolerance protocol based on node grouping

Abstract

The Practical Byzantine Fault Tolerance protocol (PBFT) has been widely deployed in the blockchain network. However, two main issues, the communication complexity and the inability of nodes to join/exit the network without restarting the system, significantly degrade consensus efficiency. To solve these problems, we propose a novel dynamic practical byzantine fault tolerance protocol based on node grouping (NG-PBFT), which is realized by grouping nodes into consensus and observation groups. The nodes in observation group preprocess nodes’ joining/exiting requests, while the nodes in consensus group reach con sensus about the preprocessed results. Furthermore, an adaptive three phases or two phases consensus mechanism that can effectively improve consensus efficiency is proposed. We provide theoretical complexity to show that our protocol reduces the communication complexity of con sensus and improves consensus efficiency significantly.

A Scalable Sharding Protocol Based on Cross-Shard Dynamic Transaction Confirmation for Alliance Chain in Intelligent Systems

“…The K-prototype clustering byzantine fault tolerance algorithm (KBFT) (Wu et al, 2023) adopts a consensus mechanism that combines Boneh-Lynn-Shacham multisignature and byzantine fault tolerance (BFT) algorithm, enabling swift transaction confirmation within shards. This scheme eliminates the design of state sharding, and transactions are managed by all shards, making it crucial to solving its node storage issue in practical scenarios (Tan et al, 2023). IGD-ScoreChain (Mehraein & Nourmohammadi, 2023) is a lightweight and scalable sharding protocol tailored for blockchain-based IoT.…”