Dynamic Transaction Confirmation Double-chain System Based on Alliance Chain

Abstract

In recent years, the high performance, strong controllability and partial decentralization of the alliance chain make it have a wide range of application scenarios and development potential. However, restricted by the consensus algorithm, the alliance chain cannot fully meet the needs of practical applications at present. Aiming at the poor stability of the Byzantine Fault Tolerance (PBFT) consensus algorithm, this paper proposes a fast consensus algorithm, which reduces the message size by optimizing the transaction verification process and dynamically adjusting the number of verification nodes. Combined with the reward and punishment system of points, a dynamic transaction confirmation double-chain system is designed. Compared with the alliance chain system implemented by the PBFT algorithm, the system has stronger stability in the case of multiple nodes, and the TPS is increased by at least 21% under the same number of nodes. It is suitable for some nodes with frequent access and poor network.