P-PBFT: An improved blockchain algorithm to support large-scale pharmaceutical traceability

Abstract

To solve the problems of high latency, high system overhead, and small supported scale in the current application of pharmaceutical traceability combined with blockchain technology, an algorithm called Pharmaceutical-Practical Byzantine Fault Tolerance (P-PBFT) based on PBFT, grouping, and credit voting is proposed. The algorithm combines the characteristics of a pharmaceutical supply chain, optimizes the consistency protocol in the original algorithm, divides large-scale network nodes into different consensus sets by response speed, and performs grouping consensus. The algorithm's credit model and voting mechanism dynamically updates user status according to the behavior of nodes in consensus, evaluates the reliability of users, and also serves as a basis for electing management nodes. Experimental results show that the improved P-PBFT consensus algorithm provides smaller latency and higher throughput for pharmaceutical traceability systems, supports larger-scale traceability, effectively alleviates the dramatic increase in communication among network nodes, and reduces the influence of malicious nodes.

Keywords: Blockchain; Credit model; Node grouping; Pharmaceutical traceability; Practical byzantine fault tolerance(PBFT); Voting mechanism.