A High Performance Blockchain PGPBFT Consensus Algorithm in Integrated Circuit Protection Applications

Abstract

In the fierce global semiconductor Intellectual Property (IP) competition, there is an increasing risk of IP tampering, which hinders the efficiency of IP reuse. Therefore, the effective protection of IP is of great importance. Circuit IP protection chain, which is anonymous, traceable, and immutability, not only solve the security issues of traditional centralized IP transaction data centers but also improves the regulatory system for data misuse. Although the rapid development of IP protection chains is accompanied by higher design efficiency and shorter design cycles, it also imposes higher concurrency of applications and node load capacity requirements on the blockchain. Since blockchain performance can be limited by the lowest performing node, long waiting time or unresponsiveness will occur under high concurrency with node performance differences. Therefore, this paper proposes an improved practical byzantine fault tolerant consensus algorithm based on node performance grouping (PGPBFT). The algorithm utilizes the grouping strategy of the Mamdani fuzzy model to preferentially select high performance nodes to participate in consensus. The experimental results show that the algorithm has 12.23% higher throughput than the traditional algorithm in scenarios with node performance varies and high concurrency requirements, maximizing the utilization of node performance.