Research on blockchain consensus algorithm based on grouping

In order to solve the problem of high communication cost of the alliance blockchain with authorization and access mechanism, according to the actual application scenario, this paper proposes a blockchain consensus algorithm based on grouping to reduce the block acknowledgement time, reduce the number of interactions in the consensus course, eliminate the resource consumption problem, and reduce the communication cost in the consensus course. At the identical time, Prism is used to test the PBFT algorithm. The experimental results show that the PBFT algorithm can reduce the transaction acknowledgement time and communication overhead. The analysis of fault-tolerance capability and the comparison of consensus schemes show that the PBFT algorithm not only retains the security of the original algorithm, but also makes up for the defects of its high performance and availability. Therefore, the blockchain consensus algorithm based on grouping can be applied to the larger alliance blockchain system.