Byzantine fault-tolerant consensus algorithm based on local temporary consensus and global confirmation

Aiming at the Byzantine fault-tolerant consensus algorithm when the number of nodes is too large, there are problems such as a large amount of data exchange, slow consensus speed, and security degradation caused by proxy nodes, based on threshold signatures, a new Byzantine fault-tolerant consensus algorithm based on local temporary consensus and global confirmation is proposed. Nodes divide into different zones based on their geographical location, the algorithm conducts temporary consensus among zones in parallel, and all nodes participate in global confirmation together, reducing the amount of network data exchange during the consensus process while improving consensus speed and security.