WO2023045533A1

WO2023045533A1 - Consensus on blockchain

Info

Publication number: WO2023045533A1
Application number: PCT/CN2022/107791
Authority: WO
Inventors: 李帅
Original assignee: 蚂蚁区块链科技(上海)有限公司; 支付宝(杭州)信息技术有限公司
Priority date: 2021-09-24
Filing date: 2022-07-26
Publication date: 2023-03-30
Also published as: CN113761069A

Abstract

Provided in the embodiments of the present description are a consensus method for a blockchain, and a system, a node and an electronic device. The method comprises: when the present round of consensus is initiated, a consensus master node splitting, on the basis of an erasure coding algorithm, propose data of the present round of consensus into data blocks corresponding to consensus backup nodes, wherein a blockchain performs consensus by using a TendermintBFT protocol; the consensus master node sending, in a propose stage, the split data blocks to the corresponding consensus backup nodes by means of propose messages; the consensus backup nodes that receive the data blocks performing erasure coding checking on the data blocks provided by the consensus master node, so as to broadcast, to the other consensus backup nodes, in a pre-vote stage and by means of pre-vote messages, the data blocks, the erasure coding checking of which is successful; and the consensus backup nodes restoring the data blocks in at least N-2f obtained pre-vote messages to the propose data on the basis of the erasure coding algorithm, so as to execute, in a pre-commit stage, consensus logic on the restored propose data, thereby completing consensus, wherein N is the number of consensus nodes of the blockchain, f is the number of tolerable faults of the consensus nodes, and N is greater than or equal to 3f+1.

Description

Blockchain Consensus

technical field

This document belongs to the field of blockchain technology, and in particular relates to a blockchain consensus method, system, nodes and electronic equipment.

Background technique

At this stage, many blockchain systems basically use the Byzantine Fault Tolerant (BFT) algorithm to complete consensus. TendermintBFT is one of the commonly used Byzantine fault-tolerant protocols. In the TendermintBFT protocol, before the consensus is executed, the consensus master node needs to send the proposed data (transaction set) to the consensus backup node. In order to ensure that the transmission of proposed data is fault-tolerant, the consensus master node needs to send redundant proposed data. Redundant proposal data will cause the consensus stage to occupy too much network bandwidth and storage space of the consensus master node.

For this reason, there is an urgent need for an optimization scheme for the TendermintBFT protocol, which can effectively reduce the overhead of network bandwidth and storage space during the consensus process.

Contents of the invention

The purpose of the embodiments of this specification is to provide a blockchain consensus method, system, nodes and electronic equipment, which can reduce the overhead of network bandwidth and storage space during the consensus process of the TendermintBFT protocol.

In order to achieve the above purpose, the embodiments of this specification are implemented as follows.

In the first aspect, a blockchain consensus method is provided, including: when the consensus master node of the blockchain initiates the current round of consensus, based on the erasure code algorithm, the proposed data of the current round of consensus is split into The data block corresponding to the consensus backup node of the chain, wherein, the blockchain uses the TendermintBFT Byzantine protocol for consensus; the consensus master node splits the proposed data into The data block is sent to the corresponding consensus backup node in the blockchain; the consensus backup node that receives the data block performs erasure code verification on the data block provided by the consensus master node, so that it can be verified in the Pre In the -vote stage, broadcast the data block with successful erasure code verification to other consensus backup nodes through the pre-vote message; the consensus backup node will obtain at least N-2f pre-vote messages based on the erasure code algorithm The data block is restored back to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, the consensus logic of the TendermintBFT protocol is executed on the restored proposed data to complete the current round of consensus, where N is the The number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

In the second aspect, a blockchain system is provided, including: a consensus master node and a consensus backup node; wherein: the consensus master node splits the proposed data of the current round of consensus based on an erasure code algorithm when the current round of consensus is initiated into a data block corresponding to the consensus backup node of the block chain, wherein the block chain uses the TendermintBFT Byzantine protocol for consensus; the consensus master node passes the Propose message to the The data block divided into the proposed data is sent to the corresponding consensus backup node in the blockchain; the consensus backup node that receives the data block performs erasure code verification on the data block provided by the consensus master node, so as to In the Pre-vote stage of the TendermintBFT protocol, the data block whose erasure code verification is successful is broadcast to other consensus backup nodes through the pre-vote message; the consensus backup node will obtain at least N- The data blocks in the 2f pre-vote messages are restored to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, the consensus logic of the TendermintBFT protocol is executed on the restored proposed data to complete this round Consensus, where N is the number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

In the third aspect, a blockchain node is provided, including: an erasure code module. When the current round of consensus is initiated, if the blockchain node to which it belongs is the consensus master node, the proposal of this round of consensus will be converted based on the erasure code algorithm. The data is split into data blocks corresponding to the consensus backup nodes of the blockchain, wherein the blockchain adopts the TendermintBFT Byzantine protocol for consensus; the sending module, if the blockchain node it belongs to is the consensus master node, In the Propose phase of the TendermintBFT protocol, the proposed data is split into data blocks and sent to the corresponding consensus backup node in the blockchain through the Propose message; the verification module, if the blockchain node it belongs to is a consensus backup node , the erasure code verification is performed on the data block provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the data block whose erasure code verification succeeds is broadcast to other consensuses through the pre-vote message backup node; restore module, if the block chain node to which it belongs is a consensus backup node, based on the erasure code algorithm, restore the data blocks in the pre-vote messages obtained at least N-2f back to the proposed data, so as to In the Pre-commit phase of the TendermintBFT protocol, execute the consensus logic of the TendermintBFT protocol on the restored proposed data to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, and f is the The fault-tolerant number of consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1.

In a fourth aspect, an electronic device is provided including: a memory, a processor, and a computer program stored on the memory and operable on the processor, the computer program being executed by the processor: in this round of consensus At the time of initiation, if it is used as the consensus master node, the proposed data of the current round of consensus will be split into data blocks corresponding to the consensus backup nodes of the blockchain based on the erasure code algorithm, wherein the blockchain adopts TendermintBFT Byzantine protocol for consensus; if it is used as a consensus backup node, then in the Propose phase of the TendermintBFT protocol, the proposed data is split into data blocks and sent to the corresponding consensus backup node in the blockchain through the Propose message; If it is used as a consensus backup node, it will perform erasure code verification on the data blocks provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the data that has been successfully verified by the erasure code through the pre-vote message The block is broadcast to other consensus backup nodes; if it is used as a consensus backup node, based on the erasure code algorithm, the data blocks in the pre-vote messages obtained at least N-2f will be restored to the proposed data, so as to be used in the In the Pre-commit phase of the TendermintBFT protocol, the consensus logic of the TendermintBFT protocol is executed on the restored proposed data to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, and f is the TendermintBFT protocol The fault-tolerant number of consensus nodes set, N is greater than or equal to 3f+1.

In the fifth aspect, a computer-readable storage medium is provided. A computer program is stored on the computer-readable storage medium. When the computer program is executed by a processor, the following steps are implemented: when the current round of consensus is initiated, if the consensus When the master node, based on the erasure code algorithm, the proposed data of this round of consensus is split into data blocks corresponding to the consensus backup nodes of the blockchain, wherein the blockchain adopts the TendermintBFT Byzantine protocol for consensus; If it is used as a consensus backup node, in the Propose phase of the TendermintBFT protocol, the proposed data will be split into data blocks and sent to the corresponding consensus backup node in the blockchain through the Propose message; if it is used as a consensus backup node, Then perform erasure code verification on the data blocks provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the data blocks with successful erasure code verification are broadcast to other consensus backups through the pre-vote message Node; if it is a consensus backup node, based on the erasure code algorithm, the data blocks in the pre-vote messages obtained at least N-2f are restored back to the proposed data, so as to be used in the Pre-commit of the TendermintBFT protocol stage, execute the consensus logic of the TendermintBFT protocol on the restored proposed data, and complete the current round of consensus, where N is the number of consensus nodes in the blockchain, and f is the fault tolerance of the consensus nodes set by the TendermintBFT protocol Number, N greater than or equal to 3f+1.

Based on the scheme of the embodiment of this specification, when the consensus master node of the blockchain executes the consensus of TendermintBFT, it uses the erasure code algorithm to split the proposed data into data blocks corresponding to the consensus backup nodes, and the split data The block is sent to the corresponding consensus backup node. Afterwards, the consensus backup node performs erasure code verification on the data blocks provided by the consensus master node based on the erasure code technology, and forwards the data block to other consensus backup nodes after the verification is successful, so that each consensus backup node of the blockchain After obtaining a certain number of data blocks, the obtained data blocks can be restored back to the proposed data through the erasure code algorithm to perform consensus logic on the proposed data. In the whole scheme, the consensus master node only needs to send the corresponding data blocks to the consensus backup nodes, and the consensus backup nodes forward their respective data blocks to each other, so as to share the transmission of the proposed data, with a smaller network bandwidth and storage space Overhead, to achieve fault tolerance for transmitting proposed data.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of this specification or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only These are some embodiments described in the embodiments of this specification. For those skilled in the art, other drawings can also be obtained based on these drawings without any creative effort.

Fig. 1 is a schematic flow chart of the blockchain consensus method provided by the embodiment of this specification.

Fig. 2 is a schematic structural diagram of the blockchain system provided by the embodiment of this specification.

Fig. 3 is a schematic structural diagram of a blockchain node provided by an embodiment of this specification.

FIG. 4 is a schematic structural diagram of an electronic device provided by an embodiment of this specification.

Detailed ways

In order to enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below in conjunction with the drawings in the embodiments of this specification. Obviously, the described The embodiments are only some of the embodiments in this specification, not all of them. Based on the embodiments in this specification, all other embodiments obtained by persons of ordinary skill in the art without creative efforts shall fall within the protection scope of this specification.

As mentioned earlier, under the current consensus mechanism of the TendermintBFT protocol, the consensus master node needs to send redundant proposal data to each consensus backup node, so that the consensus backup node can execute consensus logic on the proposed data. Redundant proposal data will occupy too much network bandwidth and storage space of the consensus master node. To this end, this document aims to provide an optimization scheme for the TendermintBFT protocol, which can effectively reduce the network bandwidth and storage space occupied by the consensus master node for transmitting proposed data during the consensus process.

Fig. 1 is a flow chart of the consensus method of the block chain in the embodiment of this specification. The method shown in FIG. 1 may be executed by corresponding devices below, and includes the following steps.

S102. When the current round of consensus is initiated, the consensus master node of the blockchain splits the proposed data of the current round of consensus into data blocks corresponding to the consensus backup nodes of the blockchain based on the erasure code algorithm. Adopt TendermintBFT Byzantine agreement for consensus.

Erasure coding (EC) is a data fault-tolerant protection method. It divides data into fragments, expands and encodes redundant data blocks, and stores them in different locations, such as disks, storage nodes or other geographic locations. Location. From the perspective of data functions, the protection provided by erasure codes can be expressed by the following formula: n=k+m. The variable "k" represents the value of the original data or symbol. The variable "m" represents the value of the extra or redundant symbols added after the failure to provide protection. The variable "n" represents the total value of symbols created after the erasure coding process. For example, in an EC 10/16 configuration, 6 additional symbols (variable m) are added to the 10 original symbols (variable k). These 16 pieces of data (variable n) can be spread across 16 drives, nodes or geographic locations, and the original file can be reconstructed from the 10 validation pieces. That is, even if 6 drives, nodes or geographic locations are lost or unavailable, the original file can still be recovered. It can be seen that the erasure code only requires a small amount of data redundancy to restore data.

In the embodiment of this specification, the erasure code technology is used to split the proposed data to be consensus into data blocks corresponding to the consensus backup nodes, which are subsequently stored by the consensus backup nodes.

S104. In the Propose phase of the TendermintBFT protocol, the consensus master node sends the data blocks into which the proposed data is split to the corresponding consensus backup node in the blockchain through the Propose message.

In the Propose phase of the traditional TendermintBFT protocol, the consensus master node will send a full amount of redundant proposal data to each consensus backup node through the Propose message. In this step, only the corresponding data block is sent to the consensus backup node through the erasure code algorithm, which can effectively reduce the transmission overhead of the consensus master node.

What needs to be explained here is that the multiple data blocks into which the proposed data is split can correspond to the consensus backup nodes of the blockchain; or, the number of multiple data blocks into which the proposed data is split is smaller than the consensus backup nodes of the blockchain The number of nodes, a consensus backup node corresponds to at most one data block. Therefore, in this step, the consensus master node can but not necessarily send data blocks to each consensus backup node of the blockchain, which depends on the algorithm settings of the erasure code.

S106, the consensus backup node that receives the data block performs erasure code verification on the data block provided by the consensus master node, so as to verify the successful erasure code of the data block through the pre-vote message in the Pre-vote stage of the TendermintBFT protocol Broadcast to other consensus backup nodes.

Specifically, the data blocks into which the proposed data is split correspond to the Merkle tree path information obtained based on the erasure code algorithm. The consensus master node also sends the Merkle tree path information matched by the data blocks that the proposed data is split into to the corresponding consensus backup node in the blockchain through the Propose message. In this step, the consensus backup node that receives the data block reconstructs the Merkle tree on the data block provided by the consensus master node based on the erasure code algorithm. If the Merkle tree path information provided by the consensus node matches the reconstructed Merkle tree , the erasure code verification succeeds, otherwise the erasure code verification fails.

In addition, as a preferred solution, if the proposed data of this round of consensus has been initiated in the previous round of consensus, it means that the consensus backup node has already cached the proposed data when executing the previous round of consensus. At this time, this step can directly Based on the cached proposed data consensus, the data blocks provided by the master node perform faster matching verification instead of erasure code verification. If the proposed data of this round of consensus has not been initiated in the previous round of consensus, the consensus backup node that receives the data block will perform erasure code verification on the data block provided by the consensus master node.

S108, based on the erasure code algorithm, the consensus backup node restores the data blocks in the pre-vote messages obtained at least N-2f back to the proposed data, so as to restore the proposed data in the Pre-commit phase of the TendermintBFT protocol The data executes the consensus logic of the TendermintBFT protocol to complete this round of consensus, where N is the number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

Among them, N-2f is the minimum number of data blocks required to restore the proposed data.

Specifically, in this step, if the consensus backup node restores the mentioned data based on the erasure code algorithm, then in the Pre-vote stage, broadcast the Pre-commit message to other consensus nodes of the blockchain; The round of consensus generates N-f Pre-commit messages, and the proposed data reaches a consensus.

Based on the consensus method shown in Figure 1, it can be known that in the scheme of the embodiment of this specification, when the consensus master node of the blockchain executes the TendermintBFT consensus, it uses the erasure code algorithm to split the proposed data into , and send the split data blocks to the corresponding consensus backup nodes. Afterwards, the consensus backup node performs erasure code verification on the data blocks provided by the consensus master node based on the erasure code technology, and forwards the data block to other consensus backup nodes after the verification is successful, so that each consensus backup node of the blockchain After obtaining a certain number of data blocks, the obtained data blocks can be restored back to the proposed data through the erasure code algorithm to perform consensus logic on the proposed data. In the whole scheme, the consensus master node only needs to send the corresponding data blocks to the consensus backup nodes, and the consensus backup nodes forward their respective data blocks to each other, so as to share the transmission of the proposed data, with a smaller network bandwidth and storage space Overhead, to achieve fault tolerance for transmitting proposed data.

The consensus method of the embodiment of this specification will be introduced in detail below.

In the method of the embodiment of this specification, the blockchain implements consensus based on the TendermintBFT protocol. Assuming that the number of consensus nodes in the blockchain is N, the number of fault-tolerant Byzantine consensus nodes is f, and N is greater than or equal to 3f+1. The corresponding consensus process is as follows: the proposed node in the blockchain initializes the consensus height hp and other parameters according to the current consensus block height. For the current consensus height, initiate this round of consensus. Consensus includes the following stages.

Propose stage: Each consensus node judges whether it is the consensus master node of this round of consensus according to the information consensus height hp and consensus round roundp initiated by this round of consensus.

If it is a consensus master node, get the proposed data (first check whether there is cached data in the previous round, if there is, use the cached data; if not, get new proposed data), and then do (N-2f, N) on the proposed data Erasure code to obtain the data block corresponding to the consensus backup node and the Merkle tree path information of the data block (that is, the root hash value calculated by the erasure code); then in the Propose stage, pass the Propose message <Propose,hp, roundp,r,bi,si,-1>Send the data blocks that the proposed data is divided into to the corresponding consensus backup nodes in the blockchain. Among them, i represents the i-th consensus backup node, si is the data block corresponding to the i-th consensus backup node, and bi is the Merkle tree merkle path information for the i-th consensus backup node.

If it is used as a consensus backup node, it waits to collect the data of the Propose message, and when it receives the <Propose, hp, roundp, r, bi, si, -1> message sent by the consensus master node, it corrects the information in the Propose message test. It should be understood that verifying the information in the Propose message includes: performing erasure code verification based on si and bi.

Pre-vote stage: If the Propose message passes the verification, broadcast the pre-vote message <Pre-vote, hp, roundp, r, bi, si> to other consensus backup nodes; if the Propose message fails the verification, broadcast the pre-vote message to other consensus backup nodes The backup node broadcasts the pre-vote nil message <Pre-vote, hp, roundp, nil, nil, nil> message, where the pre-vote nil message is used to vote for empty blocks.

Among them, when any consensus backup node receives N-F valid Pre-vote messages: use at least N-2f si in each Pre-vote message to perform erasure code calculation and restore the proposed data.

Pre-commit stage: If any consensus node obtains valid proposal data, it broadcasts a Pre-commit message <Precommit, hp, roundp, r> to other consensus nodes; otherwise, it broadcasts a Pre-commit nil message. Among them, the reason why the consensus backup node broadcasts the Pre-commit nil message may be that the consensus backup node has not collected N-F Pre-vote messages, or the consensus backup node has collected N-F Pre-vote messages, but through erasure code calculation Valid proposed data was not restored.

Among them, when the current round of consensus generates N-f Pre-commit messages, the proposed data reaches a consensus. When the current round of consensus generates f Pre-commit nil messages, the proposed data directly confirms that a failed consensus has been reached.

To sum up, the method in the embodiment of this specification integrates data error-tolerant transmission based on erasure codes into the TendermintBFT protocol. Compared with the traditional TendermintBFT protocol, no additional signaling overhead is added, but the proposed data transmission efficiency It has been significantly improved, and for the TendermintBFT protocol consensus, the consensus efficiency has been improved.

The above is the introduction to the method in the embodiment of this specification. It should be understood that appropriate changes can also be made without departing from the above-mentioned principles herein, and these changes should also be regarded as the protection scope of the embodiments of this specification.

Corresponding to the consensus method shown in FIG. 1 above, the embodiment of this specification also provides a blockchain system. FIG. 2 is a structural diagram of a blockchain system 200 according to an embodiment of this specification, including: a consensus master node 210 and multiple consensus backup nodes 220 . Wherein: when the consensus master node 210 initiates the current round of consensus, based on the erasure code algorithm, the proposal data of the current round of consensus is split into data blocks corresponding to the consensus backup node 220 of the blockchain, wherein the The block chain adopts the TendermintBFT Byzantine protocol for consensus; the consensus master node 210 sends the data blocks into which the proposed data is split to the corresponding block in the block chain through the Propose message in the Propose phase of the TendermintBFT protocol Consensus backup node 220; the consensus backup node 220 that receives the data block performs erasure code verification on the data block provided by the consensus master node 210, so that in the Pre-vote stage of the TendermintBFT protocol, the pre-vote message will The data block with successful erasure code verification is broadcast to other consensus backup nodes 220; the consensus backup node 220 restores the data blocks in the pre-vote messages obtained at least N-2f based on the erasure code algorithm to the The proposed data is used to execute the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit phase of the TendermintBFT protocol to complete the current round of consensus, where N is the consensus node of the blockchain Number, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

In the blockchain system of this embodiment, when executing the TendermintBFT consensus, the consensus master node 210 uses an erasure code algorithm to split the proposed data into data blocks corresponding to the consensus backup node 220, and split the The data block is sent to the corresponding consensus backup node 220. Afterwards, the consensus backup node 220 performs erasure code verification on the data block provided by the consensus master node 210 based on the erasure code technology, and forwards the data block to other consensus backup nodes 220 after the verification is successful, so that each block chain After obtaining a certain number of data blocks, the consensus backup node 220 can restore the obtained data blocks back to the proposed data through an erasure code algorithm, so as to execute consensus logic on the proposed data. In the whole scheme, the consensus master node 210 only needs to send the corresponding data block to the consensus backup node 220, and the consensus backup nodes 220 forward their respective data blocks to each other, so as to share the transmission of the proposed data, with a small network bandwidth and storage space overhead to achieve fault tolerance for transmitting proposed data.

Optionally, if the consensus backup node 220 that receives the data block fails to verify the erasure code, it will broadcast a pre-vote nil message to other consensus nodes during the Pre-vote phase of the TendermintBFT protocol, and the pre-vote nil Messages are used to vote for empty blocks.

Optionally, in the Pre-vote phase of the TendermintBFT protocol, the consensus backup node 220 restores the obtained data block in the pre-vote message back to the mentioned data based on the erasure code algorithm, including: consensus backup After the node 220 obtains at least N-f Prevote messages including those provided by itself, based on the erasure code algorithm, the data in the obtained Prevote messages are quickly restored to the proposed data.

Optionally, the consensus backup node 220 executes the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-vote phase of the TendermintBFT protocol, including: if the consensus backup node 220 is based on the erasure code algorithm To restore the mentioned data, broadcast Pre-commit messages to other consensus nodes of the blockchain during the Pre-vote phase of the TendermintBFT protocol; wherein, when the current round of consensus generates N-f Pre-commit messages, then The proposed data reaches a consensus of adoption.

Optionally, if the consensus backup node 220 fails to restore the mentioned data, then in the Pre-vote phase of the TendermintBFT protocol, broadcast a Pre-commit nil message to other consensus nodes of the blockchain; wherein, When the current round of consensus generates f Pre-commit nil messages, the proposed data directly confirms that a failed consensus has been reached.

Optionally, the data block into which the proposed data is split corresponds to the Merkle tree path information obtained based on the erasure code algorithm, and the consensus master node 210 also splits the proposed data into The Merkle tree path information matched by the data block is sent to the corresponding consensus backup node 220 in the blockchain; the consensus backup node 220 that receives the data block performs erasure on the data block provided by the consensus master node 210 Code verification, including: the consensus backup node 220 that receives the data block performs Merkel tree reconstruction on the data block provided by the consensus master node 210 based on the erasure code algorithm, if the Merkle tree provided by the consensus node If the path information matches the reconstructed Merkle tree, the erasure code verification succeeds, otherwise the erasure code verification fails.

Optionally, the consensus backup node 220 that receives the data block performs erasure code verification on the data block provided by the consensus master node 210, including: if the proposed data is not initiated in the previous round of consensus, then receiving The consensus backup node 220 of the data block performs erasure code verification on the data block provided by the consensus master node 210; Data blocks are checked for matching instead of erasure code checking.

Obviously, the blockchain system in the embodiment of this specification can be used as the executive body of the consensus method shown in Figure 1 above, so it can realize the functions realized by the consensus method in Figure 1 . Since the principle is the same, this article will not repeat them.

Corresponding to the consensus method shown in FIG. 1 above, the embodiment of this specification also provides a blockchain node. FIG. 3 is a structural diagram of a block chain node 300 in the embodiment of this specification, including: an erasure code module 310. When the current round of consensus is initiated, if the block chain node to which it belongs is the consensus master node, the erasure code algorithm will The proposed data of this round of consensus is split into data blocks corresponding to the consensus backup nodes of the blockchain, wherein the blockchain uses the TendermintBFT Byzantine protocol for consensus; the sending module 320, if the blockchain node it belongs to is When the consensus master node is in the Propose stage of the TendermintBFT protocol, the proposed data is split into data blocks and sent to the corresponding consensus backup node in the block chain through the Propose message; When the block chain node is a consensus backup node, the erasure code verification is performed on the data block provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the erasure code verification is successful through the pre-vote message The data block broadcast to other consensus backup nodes; the restore module 340, if the block chain node it belongs to is a consensus backup node, based on the erasure code algorithm, it will obtain at least N-2f data blocks in the pre-vote message Restore the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, execute the consensus logic of the TendermintBFT protocol on the restored proposed data to complete the current round of consensus, where N is the blockchain The number of consensus nodes, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

Obviously, the blockchain node in the embodiment of this specification can be the consensus master node or the consensus backup node in the consensus method shown in Figure 1, so it can realize the functions realized by the consensus method in Figure 1. Since the principle is the same, this article will not repeat them.

Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present specification. Please refer to FIG. 4 , at the hardware level, the electronic device includes a processor, and optionally also includes an internal bus, a network interface, and a memory. Wherein, the memory may include a memory, such as a high-speed random-access memory (Random-Access Memory, RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory. Of course, the electronic device may also include hardware required by other services.

The processor, the network interface and the memory can be connected to each other through an internal bus, which can be an ISA (Industry Standard Architecture, industry standard architecture) bus, a PCI (Peripheral Component Interconnect, peripheral component interconnection standard) bus or an EISA (Extended Industry Standard Architecture, extended industry standard architecture) bus, etc. The bus can be divided into address bus, data bus, control bus and so on. For ease of representation, only one double-headed arrow is used in FIG. 4 , but it does not mean that there is only one bus or one type of bus.

Memory for storing programs. Specifically, the program may include program code, and the program code includes computer operation instructions. Storage, which can include internal memory and nonvolatile storage, provides instructions and data to the processor.

The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it to form a consensus device on the logical level. The consensus device can be the consensus master node or the consensus backup node of the above-mentioned blockchain system, or it can It is a component in the consensus master node or consensus backup node of the blockchain system. The processor executes the program stored in the memory, and is specifically used to perform the following operations: when the current round of consensus is initiated, if it is used as the consensus master node, based on the erasure code algorithm, the proposed data of the current round of consensus is split into The data block corresponding to the consensus backup node of the blockchain, wherein, the blockchain adopts the TendermintBFT Byzantine protocol for consensus; if it is used as a consensus backup node, in the Propose stage of the TendermintBFT protocol, the Propose message will pass the The data block into which the proposed data is split is sent to the corresponding consensus backup node in the block chain; if it is used as a consensus backup node, the data block provided by the consensus master node is verified by erasure code to In the Pre-vote stage of the TendermintBFT protocol, the data blocks whose erasure code verification is successful are broadcast to other consensus backup nodes through the pre-vote message; if used as a consensus backup node, based on the erasure code algorithm, at least N- The data blocks in the 2f pre-vote messages are restored to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, the consensus logic of the TendermintBFT protocol is executed on the restored proposed data to complete this round Consensus, where N is the number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

The above-mentioned consensus method disclosed in the embodiment shown in FIG. 1 of this specification can be applied to or implemented by a processor. A processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The above-mentioned processor can be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; it can also be a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array (Field-Programmable GateArray, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of this specification can be realized or executed. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like. The steps of the method disclosed in the embodiments of this specification may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, register. The storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.

It should be understood that the electronic device in the embodiment of this specification can implement the functions of the above-mentioned consensus method shown in the embodiment shown in FIG. 1 . Since the principle is the same, this article will not repeat them.

Of course, in addition to the software implementation, the electronic equipment in this specification does not exclude other implementations, such as logic devices or the combination of software and hardware, etc., that is to say, the execution subject of the following processing flow is not limited to each logic unit, It can also be a hardware or logic device.

In addition, the embodiment of this specification also proposes a computer-readable storage medium, where the computer-readable storage medium stores one or more programs, and the one or more programs include instructions. When the electronic device executes, it can make the portable electronic device execute the method of the embodiment shown in Figure 1, and is specifically used to perform the following method: when the current round of consensus is initiated, if it is used as the consensus master node, based on the erasure code algorithm, the The proposed data of this round of consensus is split into data blocks corresponding to the consensus backup nodes of the blockchain, wherein the blockchain adopts the TendermintBFT Byzantine protocol for consensus; In the Propose phase of the protocol, the proposed data is split into data blocks and sent to the corresponding consensus backup node in the blockchain through the Propose message; if it is used as a consensus backup node, the data blocks provided by the consensus master node Perform erasure code verification, so that in the Pre-vote stage of the TendermintBFT protocol, broadcast the data block with successful erasure code verification to other consensus backup nodes through the pre-vote message; if it is used as a consensus backup node, based on the The erasure code algorithm is used to restore the data blocks in at least N-2f pre-vote messages back to the proposed data, so as to execute the restored proposed data in the Pre-commit phase of the TendermintBFT protocol The consensus logic of the TendermintBFT protocol completes this round of consensus, where N is the number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.

Those skilled in the art should understand that the embodiments of this specification may be provided as methods, systems or computer program products. Accordingly, this description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.

The foregoing describes specific embodiments of this specification. Other implementations are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in an order different from that in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. Multitasking and parallel processing are also possible or may be advantageous in certain embodiments.

The above are only examples of this specification, and are not intended to limit this specification. For those skilled in the art, various modifications and changes may occur in this description. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of this specification shall be included within the scope of the claims of this specification. In addition, all other embodiments obtained by persons of ordinary skill in the art without creative efforts shall fall within the scope of protection of this document.

Claims

A blockchain consensus method, comprising:

When the consensus master node of the blockchain initiates the current round of consensus, based on the erasure code algorithm, the proposed data of the current round of consensus is split into data blocks corresponding to the consensus backup nodes of the blockchain. The block chain adopts TendermintBFT Byzantine agreement for consensus;

In the Propose phase of the TendermintBFT protocol, the consensus master node sends the data blocks into which the proposed data is split to the corresponding consensus backup node in the block chain through a Propose message;

The consensus backup node that received the data block performs erasure code verification on the data block provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the pre-vote message will pass the erasure code verification success The data block is broadcast to other consensus backup nodes;

Based on the erasure code algorithm, the consensus backup node restores the data blocks in the pre-vote messages obtained at least N-2f back to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, the restored The proposed data executes the consensus logic of the TendermintBFT protocol to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f +1.
The method according to claim 1, further comprising:

If the consensus backup node that receives the data block fails to verify the erasure code, it will broadcast a pre-vote nil message to other consensus nodes in the Pre-vote phase of the TendermintBFT protocol, and the pre-vote nil message is used to vote empty blocks.
The method of claim 2,

In the Pre-vote phase of the TendermintBFT protocol, the consensus backup node restores the data block in the obtained pre-vote message back to the proposed data based on the erasure code algorithm, including:

After the consensus backup node obtains at least N-f Prevote messages including those provided by itself, based on the erasure code algorithm, quickly restore the data in the obtained Prevote messages to the proposed data.
The method according to claim 3,

In the Pre-vote phase of the TendermintBFT protocol, the consensus backup node executes the consensus logic of the TendermintBFT protocol on the restored proposed data, including:

If the consensus backup node restores the proposed data based on the erasure code algorithm, then in the Pre-vote phase of the TendermintBFT protocol, broadcast a Pre-commit message to other consensus nodes of the blockchain; A round of consensus generates N-f Pre-commit messages, and the proposed data reaches a consensus.
The method according to claim 3, further comprising:

If the consensus backup node fails to restore the proposed data, it will broadcast the Pre-commit nil message to other consensus nodes of the blockchain during the Pre-vote phase of the TendermintBFT protocol; If there are f Pre-commit nil messages, the proposed data will directly determine that a failed consensus has been reached.
The method according to any one of claims 1-5,

The data blocks into which the proposed data is split correspond to the Merkle tree path information obtained based on the erasure code algorithm, and the consensus master node also matches the data blocks into which the proposed data is split through the Propose message The Merkle tree path information is sent to the corresponding consensus backup node in the blockchain;

The consensus backup node that receives the data block performs erasure code verification on the data block provided by the consensus master node, including:

The consensus backup node that receives the data block performs Merkle tree reconstruction on the data block provided by the consensus master node based on the erasure code algorithm. If the Merkle tree path information provided by the consensus node is consistent with the reconstructed Merkle tree If the trees match, the erasure code verification succeeds, otherwise the erasure code verification fails.
The method according to any one of claims 1-5, further comprising:

The consensus backup node that receives the data block performs erasure code verification on the data block provided by the consensus master node, including:

If the proposed data is not initiated in the consensus of the previous round, the consensus backup node that received the data block will perform erasure code verification on the data block provided by the consensus master node, otherwise, it will directly pass the consensus cache of the previous round The proposed data of the consensus master node performs a matching check on the data block provided by the consensus master node to replace the erasure code check.
A blockchain system, including: a consensus master node and a consensus backup node; wherein:

When the consensus master node initiates the current round of consensus, based on the erasure code algorithm, the proposed data of the current round of consensus is split into data blocks corresponding to the consensus backup nodes of the blockchain, wherein the blockchain Adopt TendermintBFT Byzantine agreement for consensus;

In the Propose phase of the TendermintBFT protocol, the consensus master node sends the data blocks into which the proposed data is split to the corresponding consensus backup node in the block chain through a Propose message;

The consensus backup node that received the data block performs erasure code verification on the data block provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the pre-vote message will pass the erasure code verification success The data block is broadcast to other consensus backup nodes;

Based on the erasure code algorithm, the consensus backup node restores the data blocks in the pre-vote messages obtained at least N-2f back to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, the restoration The proposed data returned executes the consensus logic of the TendermintBFT protocol to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, f is the fault-tolerant number of consensus nodes set by the TendermintBFT protocol, and N is greater than It is equal to 3f+1.
A blockchain node, comprising:

The erasure code module, when the current round of consensus is initiated, if the blockchain node to which it belongs is the consensus master node, then based on the erasure code algorithm, the proposed data of the current round of consensus is split into consensus backup nodes with the blockchain Corresponding data blocks, wherein, the blockchain adopts TendermintBFT Byzantine agreement for consensus;

The sending module, if the block chain node to which it belongs is the consensus master node, in the Propose phase of the TendermintBFT protocol, send the data blocks into which the proposed data is split to the corresponding consensus backup in the block chain through the Propose message node;

The verification module, if the block chain node to which it belongs is a consensus backup node, performs erasure code verification on the data block provided by the consensus master node, so as to pass the pre-vote message in the Pre-vote stage of the TendermintBFT protocol Broadcast the data block with successful erasure code verification to other consensus backup nodes;

The restoration module, if the block chain node to which it belongs is a consensus backup node, based on the erasure code algorithm, restores the data blocks in the pre-vote messages obtained at least N-2f back to the proposed data, so as to In the Pre-commit phase of the TendermintBFT protocol, the consensus logic of the TendermintBFT protocol is executed on the restored proposed data to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, and f is the TendermintBFT protocol The fault-tolerant number of consensus nodes set, N is greater than or equal to 3f+1.
An electronic device includes: a memory, a processor, and a computer program stored on the memory and operable on the processor, the computer program being executed by the processor:

When this round of consensus is initiated, if it is used as the consensus master node, the proposed data of this round of consensus will be split into data blocks corresponding to the consensus backup nodes of the blockchain based on the erasure code algorithm, wherein the block The chain adopts TendermintBFT Byzantine agreement for consensus;

If it is used as a consensus backup node, in the Propose phase of the TendermintBFT protocol, the proposed data is split into data blocks and sent to the corresponding consensus backup node in the blockchain through a Propose message;

If it is used as a consensus backup node, it will perform erasure code verification on the data blocks provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the data that has been successfully verified by the erasure code through the pre-vote message The block is broadcast to other consensus backup nodes;

If it is used as a consensus backup node, based on the erasure code algorithm, the data blocks in the pre-vote messages obtained at least N-2f will be restored to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, Execute the consensus logic of the TendermintBFT protocol on the restored proposed data to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, f is the fault tolerance number of consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1.
A computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the following steps are implemented:

When this round of consensus is initiated, if it is used as the consensus master node, the proposed data of this round of consensus will be split into data blocks corresponding to the consensus backup nodes of the blockchain based on the erasure code algorithm, wherein the block The chain adopts TendermintBFT Byzantine agreement for consensus;

If it is used as a consensus backup node, in the Propose phase of the TendermintBFT protocol, the proposed data is split into data blocks and sent to the corresponding consensus backup node in the blockchain through a Propose message;

If it is used as a consensus backup node, it will perform erasure code verification on the data blocks provided by the consensus master node, so that in the Pre-vote stage of the TendermintBFT protocol, the data that has been successfully verified by the erasure code through the pre-vote message The block is broadcast to other consensus backup nodes;

If it is used as a consensus backup node, based on the erasure code algorithm, the data blocks in the pre-vote messages obtained at least N-2f will be restored to the proposed data, so that in the Pre-commit phase of the TendermintBFT protocol, Execute the consensus logic of the TendermintBFT protocol on the restored proposed data to complete the current round of consensus, where N is the number of consensus nodes in the blockchain, f is the fault tolerance number of consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1.