Research on Consensus Algorithm for Intellectual Property Authentication Based on PBFT

Traditional intellectual property authentication relies on centralized intermediaries, which makes it difficult to address issues such as forgery, lack of trust, and opaque information. Combined with the characteristics of blockchain, such as decentralization, tampering, and traceability, these challenges can be effectively dealt with. Aiming at the shortcomings of traditional consensus algorithms in intellectual property authentication, such as high communication overhead and low efficiency, the improved PBFT (Practical Byzantine Fault Tolerance) algorithm (MBFT algorithm) is proposed and combined with the distributed database IPFS (Inter Planetary File System) to alleviate the pressure of blockchain data storage and enhance operational efficiency. The algorithm first adopts the evaluation system in the hierarchical mechanism, invokes the Fibonacci series incremental law to update the Score value of the nodes and sort them, and divides the nodes into the classification consensus layer, the consensus confirmation layer, and the supervision layer. Secondly, the Maglev algorithm is used to generate a lookup table and design a classification consensus strategy, which is divided into four consensus groups based on the characteristics of intellectual property categories, namely, the patent authentication consensus group, the trademark authentication consensus group, the copyright authentication consensus group, and the other types of authentication consensus group. Then, the algorithm optimizes the consistency protocol, carries out PBFT consensus once in each of the classification consensus layers and consensus confirmation layers, according to the consensus situation, and realizes the nodes’ dynamic update to ensure the consensus’s accuracy and reliability. The experiments show that the MBFT algorithm performs better in terms of communication complexity and throughput. As the number and size of files increase, the execution time of IPFS progressively lengthens. However, the overall performance still meets the actual demand. Compared with the traditional PBFT, MBFT improves the communication complexity by about 50% or more, the throughput is about 3 times the traditional PBFT, and the scalability and response speed of the system are significantly improved when the number of nodes increases.