Research on Consensus Algorithm for Intellectual Property Transactions Based on Practical Byzantine Fault Tolerant (PBFT) Algorithm

Aiming at the problems of significant communication overheads, the low reliability of primary nodes, and the insufficient dynamic adaptability of traditional consensus algorithms in intellectual property transaction scenarios, an Improved Practical Byzantine Fault Tolerant (IPBFT) algorithm based on the Chord algorithm and entropy weight method is proposed. Firstly, the Chord algorithm is employed to map nodes onto a hash ring, enabling dynamic grouping. Secondly, an entropy-based dynamic reputation model is constructed, quantifying the evaluation of node behaviors and calculating the overall reputation value. A three-level reputation classification mechanism is used to dynamically select primary and supervisory nodes, thereby reducing the probability of Byzantine nodes being elected. Then, a three-phase monitoring strategy for supervisory nodes is developed, which includes collection, review, and blackout. This improves the Raft consensus process, enhancing the detection and fault tolerance against malicious leaders. Finally, a grouped dual-layer consensus architecture is proposed. The lower layer uses an improved Raft algorithm for efficient consensus within groups, while the upper layer uses the PBFT algorithm for cross-group global consistency verification. Experimental findings demonstrate that the IPBFT algorithm is able to balance security, scalability, and consensus efficiency in a dynamic network environment, providing a better consensus solution for intellectual property transactions.