An improved algorithm for practical byzantine fault tolerance to large-scale consortium chain

Highlights：

• A credit reward mechanism is proposed. This method divides the nodes in the group into committees and alternative committees. By introducing the credit calculation formula, the high credit master node is selected from the committee. It improves the efficiency of consensus in large consortium chains.

• A consensus node selection optimization scheme is proposed. The scheme introduces node index to number and sort nodes. Establish a replacement cycle to replace the high-credit nodes in the alternative committee with the low-credit nodes in the committee. It optimizes the consensus efficiency of the consortium chain.

摘要

•A node feature grouping model is proposed. Specifically, according to the node characteristics of the consortium chain, nodes with the same characteristics are grouped into an organization, and a feature organization and multi-feature organizations are formed into a group. There is independent consensus within the group, and consensus among groups can be reached at the same time without affecting each other. This model optimizes the node structure of large-scale consortium chain and simplifies the complexity of consensus.•A credit reward mechanism is proposed. This method divides the nodes in the group into committees and alternative committees. By introducing the credit calculation formula, the high credit master node is selected from the committee. It improves the efficiency of consensus in large consortium chains.•A consensus node selection optimization scheme is proposed. The scheme introduces node index to number and sort nodes. Establish a replacement cycle to replace the high-credit nodes in the alternative committee with the low-credit nodes in the committee. It optimizes the consensus efficiency of the consortium chain.