Abstract: Blockchain technology is widely used in distributed supply chain management because of its security, transparency, and traceability characteristics. However, with the extensive growth of data scale, its core consensus mechanism called the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm faces challenges such as low consensus security, insufficient node enthusiasm, and high communication costs. To meet the application requirements of supply chain big data scenarios, an improved algorithm called Node Budding and Reputation Practical Byzantine Fault Tolerance (NBR-PBFT), based on node bidding and reputation mechanisms, is proposed. First, the node bidding mechanism is used to improve the local reputation value calculation method, which relies on the interaction history between nodes in the Eigen Trust recommendation reputation model. The node's own basic resource configuration is incorporated into its reliability assessment, and the consensus group is constructed by calculating the node's global reputation value, which dynamically filters out the nodes with better resource configuration and stronger performance to participate in the consensus, to improve the consensus efficiency and security. Second, a reputation reward and punishment mechanism is introduced to encourage high-performance nodes to participate in consensus. Following this, the Byzantine nodes in the network are eliminated, and the degree of system centralization is reduced. Finally, by optimizing the consistency protocol process, the primary node introduces a determination mechanism to determine the system status during the preparation and confirmation stages of the consensus, thereby reducing consensus latency and improving throughput. Simulation experiments show that this scheme can effectively reduce the probability of Byzantine nodes committing crimes, reduce network communication overheads, improve system efficiency and fault tolerance, and can be applied to supply chain big data scenarios.

Key words: blockchain, Practical Byzantine Fault Tolerance (PBFT) algorithm, bidding strategy, reputation mechanism, reward—punishment mechanism

摘要： 区块链技术因其安全透明和可追溯等特性被广泛应用于供应链分布式管理中。然而，随着数据规模的爆炸式增长，其核心共识机制——实用拜占庭容错(PBFT)共识算法面临共识安全性低、节点积极性不足、通信成本过高等问题。为满足供应链大数据场景的应用需求，提出一种基于节点竞价和信誉机制的改进算法(NBR-PBFT)。首先，采用节点竞价机制改进Eigen Trust推荐信誉模型中依赖节点间交互历史的局部信誉值计算方法，将节点的自身基础资源配置纳入其可靠性评估中，通过计算节点全局信誉值构建共识组，动态筛选出资源配置更优、性能更强的节点参与共识，提升共识效率和安全性。其次，引入信誉奖惩机制，激励高性能节点参与共识，剔除网络中的拜占庭节点，降低系统中心化程度；最后，优化一致性协议过程，在主节点中引入判定机制，在共识的准备和确认阶段对系统状态进行判定，减少共识延迟，提高吞吐量。仿真实验表明，该方案能够有效降低拜占庭节点作恶概率，减少网络通信开销，提高系统效率和容错能力，可适用于供应链大数据场景。

关键词: 区块链, 实用拜占庭容错算法, 竞价策略, 信誉机制, 奖惩机制

CLC Number: 

• TP311