BYZANTINE FAULT-TOLERANT REWARD- AND PUNISHMENT-BASED METHOD FOR AUTHORIZING A DATA BLOCK CHAIN TO PARTICIPATE IN CONSENSUS, AND REWARD AND PUNISHMENT METHOD THEREFOR

摘要

A Byzantine fault-tolerant reward- and punishment-based method for authorizing a data block chain to participate in consensus, and a reward and punishment method therefor, which relate to fault-tolerant technology for a data block chain. A node reward and punishment algorithm is used to ensure the integrity of commands sent by nodes in a Byzantine fault-tolerant data block chain authorized to participate in consensus. The Byzantine fault-tolerant method comprises: step 1: electing consensus nodes in a data block chain, wherein the number of consensus nodes is less than the total number of nodes in the data block chain; step 2: allowing the consensus nodes to carry out consensus games to reach a consensus on the authenticity determination of a command sent by the nodes in the data block chain; and step 3: rewarding or punishing the nodes in the block chain based on a result of the consensus reached by the consensus nodes.