CN113761069B - A consensus method, system, node and electronic device for blockchain - Google Patents
A consensus method, system, node and electronic device for blockchain Download PDFInfo
- Publication number
- CN113761069B CN113761069B CN202111124489.XA CN202111124489A CN113761069B CN 113761069 B CN113761069 B CN 113761069B CN 202111124489 A CN202111124489 A CN 202111124489A CN 113761069 B CN113761069 B CN 113761069B
- Authority
- CN
- China
- Prior art keywords
- consensus
- data
- tendermintbft
- protocol
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000012795 verification Methods 0.000 claims abstract description 65
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 54
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012937 correction Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 description 11
- 230000008569 process Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1004—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's to protect a block of data words, e.g. CRC or checksum
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
- G06F11/1469—Backup restoration techniques
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Databases & Information Systems (AREA)
- Computer Security & Cryptography (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Hardware Redundancy (AREA)
Abstract
The embodiment of the specification provides a block chain consensus method, a system, a node and electronic equipment. When the common identification of the round is initiated, the common identification main node splits the proposal data of the common identification of the round into data blocks corresponding to the common identification backup node based on an erasure code algorithm, and a TendermintBFT Bayesian and busy protocol is adopted for common identification by the block chain. At Propose, the consensus master node sends the split data blocks to the corresponding consensus backup nodes through Propose messages. And the consensus backup node which receives the data blocks performs erasure code verification on the data blocks provided by the consensus master node, so that the data blocks which are successfully subjected to erasure code verification are broadcast to other consensus backup nodes through Pre-vot messages in the Pre-vot stage. The consensus backup node restores the data blocks in the Pre-vot messages with at least N-2f numbers to the proposal data based on the erasure coding algorithm, so as to execute consensus logic on the restored proposal data to complete consensus in the Pre-commit stage, wherein N is the number of consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes, and N is more than or equal to 3f+1.
Description
Technical Field
The present document belongs to the technical field of blockchain, and in particular relates to a blockchain consensus method, a blockchain consensus system, nodes and electronic equipment.
Background
At present, many blockchain system bases adopt the Bayesian fault tolerance (BFT, byzantine Fault Tolerant) algorithm to complete consensus. And TendermintBFT is one of the commonly used bayer fault-tolerance protocols. TendermintBFT protocol, the consensus master node needs to send proposal data (transaction set) to the consensus backup node before performing the consensus. To ensure that the transmission of the proposal data is fault tolerant, the consensus master node needs to send redundant proposal data. The redundant proposal data causes the consensus phase to occupy excessive network bandwidth and storage space of the consensus master node.
Therefore, there is a need for an optimization scheme for TendermintBFT protocols, which can effectively reduce the network bandwidth and the overhead of the storage space in the consensus process.
Disclosure of Invention
An embodiment of the present disclosure is directed to a blockchain consensus method, system, node, and electronic device, which can reduce network bandwidth and overhead of storage space in TendermintBFT protocol consensus process.
In order to achieve the above object, the embodiments of the present specification are implemented as follows:
in a first aspect, a method of consensus of a blockchain is provided, comprising:
splitting proposed data of the round of consensus into data blocks corresponding to consensus backup nodes of the block chain based on an erasure coding algorithm when the round of consensus is initiated, wherein the block chain performs consensus by adopting TendermintBFT Bayesian proprietary protocol;
The consensus master node sends the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of the TendermintBFT protocol;
The consensus backup node which receives the data blocks carries out erasure code verification on the data blocks provided by the consensus main node, so that the data blocks which are successfully subjected to erasure code verification are broadcast to other consensus backup nodes through Pre-vot messages in the Pre-vot stage of the TendermintBFT protocol;
And restoring the data blocks in the Pre-vot messages with at least N-2f numbers to the proposal data by the consensus backup node based on the erasure code algorithm so as to execute the consensus logic of the TendermintBFT protocol on the restored proposal data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
In a second aspect, a blockchain system is provided, comprising a consensus primary node and a consensus backup node, wherein:
When the local round of consensus is initiated, the consensus master node splits the proposal data of the local round of consensus into data blocks corresponding to the consensus backup nodes of the blockchain based on an erasure coding algorithm, wherein the blockchain performs consensus by adopting TendermintBFT Bayesian protocol;
The consensus master node sends the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of the TendermintBFT protocol;
The consensus backup node which receives the data blocks carries out erasure code verification on the data blocks provided by the consensus main node, so that the data blocks which are successfully subjected to erasure code verification are broadcast to other consensus backup nodes through Pre-vot messages in the Pre-vot stage of the TendermintBFT protocol;
and the consensus backup node restores the data blocks in the Pre-vot messages with at least N-2f numbers to the proposal data based on the erasure code algorithm, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposal data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
In a third aspect, there is provided a blockchain node comprising:
The erasure code correction module is used for splitting the proposed data of the round of consensus into data blocks corresponding to the consensus backup nodes of the block chains based on an erasure code correction algorithm when the round of consensus is initiated and if the affiliated block chain nodes are the consensus master nodes, wherein the block chains adopt TendermintBFT Bayesian protocol for consensus;
The sending module is used for sending the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of the TendermintBFT protocol if the affiliated blockchain node is the consensus master node;
The verification module is used for carrying out erasure code verification on the data block provided by the consensus master node if the affiliated blockchain node is the consensus backup node, so that the data block which is successfully subjected to erasure code verification is broadcasted to other consensus backup nodes through a Pre-volt message in the Pre-volt stage of the TendermintBFT protocol;
And the restoration module restores the data blocks in the Pre-vot messages with at least N-2f numbers to the proposed data based on the erasure coding algorithm if the block chain node is the consensus backup node, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
In a fourth aspect, an electronic device is provided comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being executable by the processor to:
When the local round of consensus is initiated, if the local round of consensus is used as a consensus master node, splitting proposed data of the local round of consensus into data blocks corresponding to a consensus backup node of the block chain based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian and busy-family protocols;
If the proposed data is used as a consensus backup node, in Propose stage of TendermintBFT protocol, the data blocks split by the proposed data are sent to the corresponding consensus backup node in the blockchain through Propose information;
if the data block is used as a consensus backup node, performing erasure code verification on the data block provided by the consensus master node, and broadcasting the data block successfully subjected to erasure code verification to other consensus backup nodes through a Pre-vot message in the Pre-vot stage of the TendermintBFT protocol;
if the data blocks are used as the consensus backup nodes, based on the erasure coding algorithm, restoring the data blocks in the Pre-vot messages with at least N-2f numbers to the proposed data, and executing the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
In a fifth aspect, there is provided a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
When the local round of consensus is initiated, if the local round of consensus is used as a consensus master node, splitting proposed data of the local round of consensus into data blocks corresponding to a consensus backup node of the block chain based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian and busy-family protocols;
If the proposed data is used as a consensus backup node, in Propose stage of TendermintBFT protocol, the data blocks split by the proposed data are sent to the corresponding consensus backup node in the blockchain through Propose information;
if the data block is used as a consensus backup node, performing erasure code verification on the data block provided by the consensus master node, and broadcasting the data block successfully subjected to erasure code verification to other consensus backup nodes through a Pre-vot message in the Pre-vot stage of the TendermintBFT protocol;
if the data blocks are used as the consensus backup nodes, based on the erasure coding algorithm, restoring the data blocks in the Pre-vot messages with at least N-2f numbers to the proposed data, and executing the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
Based on the scheme of the embodiment of the specification, when executing TendermintBFT consensus, the consensus master node of the blockchain splits the proposal data into data blocks corresponding to the consensus backup nodes by using an erasure coding algorithm, and sends the split data blocks to the corresponding consensus backup nodes. And then, the consensus backup node performs erasure code verification on the data blocks provided by the consensus master node based on erasure code technology, and forwards the data blocks to other consensus backup nodes after the verification is successful, so that each consensus backup node of the blockchain can restore the obtained data blocks to the proposal data through an erasure code algorithm after obtaining a certain number of data blocks, and the consensus logic is executed on the proposal data. In the whole scheme, the consensus master node only needs to send corresponding data blocks to the consensus backup nodes, and the consensus backup nodes mutually forward the respective data blocks, so that the transmission of the proposal data is shared, and the fault tolerance of the transmission of the proposal data is realized with smaller network bandwidth and memory space overhead.
Drawings
In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some of the embodiments described in the embodiments of the present description, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.
Fig. 1 is a flowchart of a block chain consensus method according to an embodiment of the present disclosure.
Fig. 2 is a schematic diagram of a blockchain system according to an embodiment of the present disclosure.
Fig. 3 is a schematic structural diagram of a blockchain node according to an embodiment of the present disclosure.
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
In order to make the technical solutions in the present specification better understood by those skilled in the art, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.
As previously described, under the consensus mechanism of the current TendermintBFT protocol, the consensus master node needs to send redundant proposal data to each consensus backup node, so that the consensus backup node performs consensus logic on the proposal data. Redundant proposal data may occupy excessive network bandwidth and memory space for the consensus master. Therefore, the present document aims to provide an optimization scheme of TendermintBFT protocol, which can effectively reduce the network bandwidth and the storage space occupied by the transmission proposal data of the consensus master node in the consensus process.
FIG. 1 is a flow chart of a method of consensus of blockchains in an embodiment of the present description. The method shown in fig. 1 may be performed by a corresponding apparatus, comprising the steps of:
s102, when the block chain consensus master node initiates the local round of consensus, the proposed data of the local round of consensus is split into data blocks corresponding to the block chain consensus backup node based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian proprietary protocol.
Erasure Coding (EC) is a method of fault-tolerant protection of data by dividing the data into segments, expanding, encoding, and storing redundant data blocks in different locations, such as disks, storage nodes, or other geographical locations. From a data function perspective, the protection afforded by erasure codes can be expressed by the following equation 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 symbol added after a fault that provides protection. The variable "n" represents the total value of the symbols created after the erasure coding process. For example, in one EC 10/16 configuration, there are 6 additional symbols (variable m) added to 10 original symbols (variable k). The 16 data segments (variable n) may be spread over 16 drives, nodes or geographic locations, and the original file may be reconstructed from 10 verification segments. That is, even if 6 drives, nodes, or geographic locations are lost or unavailable, the original file may be restored. It can be seen that erasure codes require only a small amount of redundancy to achieve data recovery.
In the embodiment of the present disclosure, the erasure coding technique is used to split the proposed data to be consensus into data blocks corresponding to the consensus backup node, and then the data blocks are saved by the consensus backup node.
And S104, the consensus master node transmits the data block divided by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of TendermintBFT protocol.
In the Propose phase of the conventional TendermintBFT protocol, the consensus master node sends a full amount of proposal data with redundancy to each consensus backup node via Propose messages. The transmission cost of the common-knowledge master node can be effectively reduced by only transmitting the corresponding data block to the common-knowledge backup node through the erasure coding algorithm.
It should be noted that the plurality of data blocks into which the proposed data is split may correspond to the common backup nodes of the blockchain one by one, or the number of the plurality of data blocks into which the proposed data is split is smaller than the number of the common backup nodes of the blockchain, and one common backup node corresponds to one data block at most. Thus, in this step, the consensus master node may, but need not, send a data block to each consensus backup node of the blockchain, depending on the algorithm settings of the erasure code.
And S106, the consensus backup node which receives the data blocks carries out erasure code verification on the data blocks provided by the consensus master node, so that the data blocks which are successfully subjected to erasure code verification are broadcast to other consensus backup nodes through Pre-vote messages in the Pre-vote stage of TendermintBFT protocols.
Specifically, the data block into which the proposal data is split corresponds to the merck tree path information obtained based on the erasure coding algorithm. The consensus master node also sends the merck tree path information matched with the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose messages. In the step, the common backup node which receives the data block carries out the merck tree reconstruction on the data block provided by the common main node based on the erasure code algorithm, if the merck tree path information provided by the common node is matched with the reconstructed merck tree, the erasure code verification is successful, otherwise, the erasure code verification fails.
In addition, as a preferred scheme, if the consensus of the round of consensus is initiated before the consensus of the previous round, the consensus backup node is indicated to have cached the proposal data when the consensus of the previous round is executed, and at this time, the step can directly perform faster matching check based on the cached proposal data consensus master node provided data blocks to replace erasure code check. If the proposal data of the round of consensus is not initiated in the previous round of consensus, the consensus backup node which receives the data blocks carries out erasure code verification on the data blocks provided by the consensus master node.
S108, the consensus backup node point restores the data blocks in the Pre-vot messages with at least N-2f numbers to the proposal data based on the erasure code algorithm, so as to execute the consensus logic of TendermintBFT protocol to the restored proposal data in the Pre-commit stage of TendermintBFT protocol, and complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by TendermintBFT protocol, and N is more than or equal to 3f+1.
Where N-2f reverts back to the minimum number of data blocks required to propose data.
Specifically, in this step, if the consensus backup node restores the extracted data based on the erasure coding algorithm, in the Pre-vot stage, a Pre-commit message is broadcasted to other consensus nodes of the blockchain, wherein when the present round of consensus generates N-f Pre-commit messages, the proposed data reaches a passing consensus.
Based on the consensus method shown in fig. 1, it can be known that in the scheme of the embodiment of the present disclosure, when the consensus master node of the blockchain performs the consensus of TendermintBFT, an erasure coding algorithm is used to split the proposed data into data blocks corresponding to the consensus backup nodes, and the split data blocks are sent to the corresponding consensus backup nodes. And then, the consensus backup node performs erasure code verification on the data blocks provided by the consensus master node based on erasure code technology, and forwards the data blocks to other consensus backup nodes after the verification is successful, so that each consensus backup node of the blockchain can restore the obtained data blocks to the proposal data through an erasure code algorithm after obtaining a certain number of data blocks, and the consensus logic is executed on the proposal data. In the whole scheme, the consensus master node only needs to send corresponding data blocks to the consensus backup nodes, and the consensus backup nodes mutually forward the respective data blocks, so that the transmission of the proposal data is shared, and the fault tolerance of the transmission of the proposal data is realized with smaller network bandwidth and memory space overhead.
The following describes the consensus method of the embodiments of the present specification in detail.
In the method of the embodiments of the present description, the blockchain performs consensus based on the TendermintBFT protocol. Let the number of common node of the block chain be N, the fault tolerance number of common node of the bayer is f, N > =3f+1. The corresponding consensus flow is as follows:
the proposed node in the blockchain initializes the height to be consensus hp, and other parameters, based on the current consensus block height. And initiating the round of consensus for the current height to be consensus. Consensus includes the following phases:
Stage Propose:
And each consensus node judges whether to be a consensus master node of the round of consensus according to the information consensus height hp and the consensus round roundp initiated by the round of consensus.
If the data block is used as a consensus master node, acquiring proposal data (firstly checking whether the previous round already has cache data, if yes, using the cache data, otherwise acquiring new proposal data), then performing (N-2 f, N) erasure coding on the proposal data to obtain data blocks corresponding to the consensus backup node and Merck path information (namely root hash value calculated by erasure coding) of the data blocks, and then in Propose stage, sending the data blocks split by the proposal data to the corresponding consensus backup node in a block chain through Propose messages < Propose, hp, roundp, r, bi, si, -1 >. Where i represents the i-th consensus backup node, si is a data block corresponding to the i-th consensus backup node, and bi is merck tree merkle path information for the i-th consensus backup node.
If the node is used as a consensus backup node, waiting to collect Propose data of the message, and checking Propose information in the message when receiving the message < Propose, hp, roundp, r, bi, si, -1> sent by the consensus master node. It should be appreciated that verifying the information in Propose messages includes performing erasure code verification based on si and bi.
Pre-vot stage:
If Propose messages pass the check, a Pre-vot message < Pre-vot, hp, roundp, r, bi, si > is broadcast to other consensus backup nodes, and if Propose messages do not pass the check, a Pre-vot nil message < Pre-vot, hp, roundp, nil, nil, nil > message is broadcast to other consensus backup nodes, where the Pre-vot nil message is used to vote for a null block.
When any consensus backup node receives N-F effective Pre-vot messages, performing erasure code calculation by using si in each Pre-vot message of at least N-2F, and restoring the proposal data.
Pre-commit phase:
If any consensus node gets valid proposal data, broadcasting Pre-commit message < Precommit, hp, roundp, r > to other consensus nodes, otherwise broadcasting Pre-commit nil message. The reason why the consensus backup node broadcasts the Pre-commit nil message may be that the consensus backup node does not collect the Pre-vot messages reaching N-F or the consensus backup node collects the Pre-vot messages reaching N-F, but the consensus backup node does not recover the valid proposal data through erasure code calculation.
Wherein, when the current round of consensus generates N-f Pre-commit messages, the proposal data reaches the passing consensus. When the present round of consensus generates f Pre-commit nil messages, the proposal data directly determines that failed consensus is reached.
In summary, the method of the embodiment of the present disclosure integrates the implementation of data fault-tolerant transmission based on erasure codes into TendermintBFT protocol, and compared with the conventional TendermintBFT protocol, the method does not increase extra signaling overhead, but obviously improves the transmission efficiency of the proposed data, and improves the consensus efficiency for TendermintBFT protocol consensus.
The above is an introduction to the method of the embodiments of the present specification. It will be appreciated that suitable modifications may be made without departing from the principles set forth herein above, and such modifications are intended to be considered within the scope of the embodiments of the present disclosure.
Corresponding to the consensus method shown in fig. 1, the embodiment of the present disclosure further provides a blockchain system. Fig. 2 is a block diagram of a blockchain system 200 of an embodiment of the present description, including a consensus primary node 210 and a plurality of consensus backup nodes 220. Wherein:
When the local round of consensus is initiated, the consensus master node 210 splits the proposed data of the local round of consensus into data blocks corresponding to the consensus backup nodes 220 of the blockchain based on an erasure coding algorithm, wherein the blockchain performs consensus by adopting TendermintBFT Bayesian and busy protocols;
At Propose stage of the TendermintBFT protocol, the consensus master node 210 sends the data block split by the proposal data to the corresponding consensus backup node 220 in the blockchain through Propose message;
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-vot stage of the TendermintBFT protocol, the data block that is successfully subjected to erasure code verification is broadcast to other consensus backup nodes 220 through a Pre-vot message;
The consensus backup node 220 restores the data blocks in the Pre-vot messages with at least N-2f numbers to the proposed data based on the erasure coding algorithm, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol, and complete the round of consensus, where N is the number of consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.
In the blockchain system of the present embodiment, when the consensus master node 210 performs the consensus of TendermintBFT, the proposed data is split into data blocks corresponding to the consensus backup node 220 using an erasure coding algorithm, and the split data blocks are sent to the corresponding consensus backup node 220. Then, the consensus backup node 220 performs erasure code verification on the data blocks provided by the consensus master node 210 based on erasure code technology, and forwards the data blocks to other consensus backup nodes 220 after the verification is successful, so that each consensus backup node 220 of the blockchain can restore the obtained data blocks to the proposal data through erasure code algorithm after obtaining a certain number of data blocks, so as to execute consensus logic on the proposal data. In the whole scheme, the consensus master node 210 only needs to send corresponding data blocks to the consensus backup nodes 220, and the consensus backup nodes 220 forward the respective data blocks to each other, so that the transmission of the proposal data is shared, and the fault tolerance of the transmission of the proposal data is realized with smaller network bandwidth and memory space overhead.
Optionally, if the erasure code verification fails, the consensus backup node 220 that receives the data block broadcasts a Pre-vot nil message to other consensus nodes in the Pre-vot stage of the TendermintBFT protocol, where the Pre-vot nil message is used for voting the empty block.
Optionally, the consensus backup node 220 restores the data block in the obtained Pre-vot message back to the proposed data based on the erasure coding algorithm in the Pre-vot stage of the TendermintBFT protocol, including that the consensus backup node 220 quickly restores the data in the obtained Prevote message to the proposed data based on the erasure coding algorithm after obtaining at least N-f Prevote messages including self-provided.
Optionally, the consensus backup node 220 executes the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-vote stage of the TendermintBFT protocol, including broadcasting a Pre-commit message to other consensus nodes of the blockchain in the Pre-vote stage of the TendermintBFT protocol if the consensus backup node 220 restores the proposed data based on the erasure coding algorithm, wherein when the current round of consensus generates N-f Pre-commit messages, the proposed data reaches a passing consensus.
Optionally, if the consensus backup node 220 fails to restore the extracted data, in the Pre-vot stage of the TendermintBFT protocol, a Pre-commit nil message is broadcasted to other consensus nodes of the blockchain, wherein when the present round of consensus generates f Pre-commit nil messages, the proposed data directly determines that failed consensus is reached.
Optionally, the data block split by the proposed data corresponds to merck tree path information obtained based on the erasure code algorithm, the common master node 210 further sends merck tree path information matched with the data block split by the proposed data to the corresponding common backup node 220 in the blockchain through Propose messages, the common backup node 220 receiving the data block performs erasure code verification on the data block provided by the common master node 210, and the method comprises that the common backup node 220 receiving the data block performs merck tree reconstruction on the data block provided by the common master node 210 based on the erasure code algorithm, if the merck tree path information provided by the common node is matched with the reconstructed merck tree, the erasure code verification is successful, otherwise, the erasure code verification fails.
Optionally, the receiving the data block consensus backup node 220 performs erasure code verification on the data block provided by the consensus master node 210, including performing erasure code verification on the data block provided by the consensus master node 210 by the receiving the data block consensus backup node 220 if the proposed data is not initiated in the previous round of consensus, or performing matching verification on the data block provided by the consensus master node 210 directly through the proposed data cached in the previous round of consensus to replace the erasure code verification.
It is obvious that the blockchain system of the embodiment of the present disclosure may be used as an execution body of the consensus method shown in fig. 1, so that the function implemented by the consensus method in fig. 1 can be implemented. Since the principle is the same, the description is not repeated here.
Corresponding to the consensus method shown in fig. 1, the embodiment of the present disclosure further provides a blockchain node. FIG. 3 is a block diagram of a blockchain node 300 of an embodiment of the present description, including:
The erasure code module 310 splits the proposed data of the round of consensus into data blocks corresponding to the consensus backup nodes of the blockchain based on an erasure code algorithm when the round of consensus is initiated and if the affiliated blockchain node is a consensus master node, wherein the blockchain performs consensus by adopting TendermintBFT Bayesian protocol;
The sending module 320, if the affiliated blockchain node is a consensus master node, sends the data block split by the proposed data to the corresponding consensus backup node in the blockchain through Propose message in Propose stage of the TendermintBFT protocol;
The verification module 330 performs erasure code verification on the data block provided by the consensus master node if the affiliated blockchain node is the consensus backup node, so that the data block successfully subjected to erasure code verification is broadcast to other consensus backup nodes through a Pre-vote message in the Pre-vote stage of the TendermintBFT protocol;
And the restoring module 340 restores the data blocks in the Pre-vot messages obtained by at least N-2f data blocks to the proposed data based on the erasure coding algorithm if the affiliated blockchain node is the consensus backup node, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is greater than or equal to 3f+1.
It is apparent that the blockchain node in the embodiments of the present disclosure may be a consensus master node or a consensus backup node in the consensus method shown in fig. 1, so that the function implemented by the consensus method in fig. 1 can be implemented. Since the principle is the same, the description is not repeated here.
Fig. 4 is a schematic structural view of an electronic device according to an embodiment of the present specification. Referring to fig. 4, at the hardware level, the electronic device includes a processor, and optionally an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory (non-volatile Memory), such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.
The processor, network interface, and memory may be interconnected by an internal bus, which may be an ISA (Industry Standard Architecture ) bus, a PCI (PERIPHERAL COMPONENT INTERCONNECT, peripheral component interconnect standard) bus, or EISA (Extended Industry Standard Architecture ) bus, among others. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 4, but not only one bus or type of bus.
And the memory is used for storing programs. In particular, the program may include program code including computer-operating instructions. The memory may include memory and non-volatile storage and provide instructions and data to the processor.
The processor reads the corresponding computer program from the nonvolatile memory to the memory and then runs the computer program to form a consensus device on a logic level, wherein the consensus device can be a consensus master node or a consensus backup node of the block chain system, or can be a component in the consensus master node or the consensus backup node of the block chain system. The processor is used for executing the programs stored in the memory and is specifically used for executing the following operations:
When the local round of consensus is initiated, if the local round of consensus is used as a consensus master node, splitting proposed data of the local round of consensus into data blocks corresponding to a consensus backup node of the block chain based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian and busy-family protocols;
If the proposed data is used as a consensus backup node, in Propose stage of TendermintBFT protocol, the data blocks split by the proposed data are sent to the corresponding consensus backup node in the blockchain through Propose information;
if the data block is used as a consensus backup node, performing erasure code verification on the data block provided by the consensus master node, and broadcasting the data block successfully subjected to erasure code verification to other consensus backup nodes through a Pre-vot message in the Pre-vot stage of the TendermintBFT protocol;
if the data blocks are used as the consensus backup nodes, based on the erasure coding algorithm, restoring the data blocks in the Pre-vot messages with at least N-2f numbers to the proposed data, and executing the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
The consensus method disclosed in the embodiment shown in fig. 1 of the present specification can be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or by instructions in the form of software. The Processor may be a general-purpose Processor including a central processing unit (Central Processing Unit, CPU), a network Processor (Network Processor, NP), etc., or may be a digital signal Processor (DIGITAL SIGNAL Processor, DSP), application SPECIFIC INTEGRATED Circuit (ASIC), field-Programmable gate array (Field-Programmable GATE ARRAY, FPGA) or other Programmable logic device, discrete gate or transistor logic device, discrete hardware components. The various methods, steps and logic blocks disclosed in the embodiments of this specification may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present specification may be embodied directly in hardware, in a decoded processor, or in a combination of hardware and software modules in a decoded processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.
It should be understood that the electronic device of the embodiments of the present disclosure may implement the functions of the embodiment of the above-described consensus method shown in fig. 1. Since the principle is the same, the description is not repeated here.
Of course, in addition to the software implementation, the electronic device in this specification does not exclude other implementations, such as a logic device or a combination of software and hardware, that is, the execution subject of the following process is not limited to each logic unit, but may also be hardware or a logic device.
Furthermore, the embodiments of the present specification also propose a computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable electronic device comprising a plurality of application programs, enable the portable electronic device to perform the method of the embodiment shown in fig. 1, and in particular to perform the method of:
When the local round of consensus is initiated, if the local round of consensus is used as a consensus master node, splitting proposed data of the local round of consensus into data blocks corresponding to a consensus backup node of the block chain based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian and busy-family protocols;
If the proposed data is used as a consensus backup node, in Propose stage of TendermintBFT protocol, the data blocks split by the proposed data are sent to the corresponding consensus backup node in the blockchain through Propose information;
if the data block is used as a consensus backup node, performing erasure code verification on the data block provided by the consensus master node, and broadcasting the data block successfully subjected to erasure code verification to other consensus backup nodes through a Pre-vot message in the Pre-vot stage of the TendermintBFT protocol;
if the data blocks are used as the consensus backup nodes, based on the erasure coding algorithm, restoring the data blocks in the Pre-vot messages with at least N-2f numbers to the proposed data, and executing the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-commit stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, and N is more than or equal to 3f+1.
It will be appreciated by those skilled in the art that embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, the present specification 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 can take the form of a computer program product 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 the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than 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. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
The foregoing is merely an example of the present specification and is not intended to limit the present specification. Various modifications and alterations to this specification will become apparent to those skilled in the art. Any modifications, equivalent substitutions, improvements, or the like, which are within the spirit and principles of the present description, are intended to be included within the scope of the claims of the present description. Moreover, all other embodiments obtained by those skilled in the art without making any inventive effort shall fall within the scope of protection of this document.
Claims (9)
1. A method of consensus of a blockchain, comprising:
splitting proposed data of the round of consensus into data blocks corresponding to consensus backup nodes of the block chain based on an erasure coding algorithm when the round of consensus is initiated, wherein the block chain performs consensus by adopting TendermintBFT Bayesian proprietary protocol;
The consensus master node sends the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of the TendermintBFT protocol;
The consensus backup node which receives the data blocks carries out erasure code verification on the data blocks provided by the consensus main node, so that the data blocks which are successfully subjected to erasure code verification are broadcast to other consensus backup nodes through Pre-vot messages in the Pre-vot stage of the TendermintBFT protocol;
The consensus backup node restores the data blocks in the Pre-notice messages with at least N-2f numbers to the proposal data based on the erasure code algorithm, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposal data in the Pre-notice stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1, if the consensus backup node fails to restore the restored proposal data, the Pre-notice messages are broadcasted to other consensus nodes of the TendermintBFT protocol in the Pre-notice stage of the block chain, and if the erasure code verification of the received data blocks fails, the Pre-notice messages are broadcasted to other consensus nodes in the Pre-notice stage of the TendermintBFT protocol, wherein when the round of consensus generates f Pre-notice messages, the Pre-notice messages are not directly used for the block notice messages.
2. The method according to claim 1,
The consensus backup node restores the data block in the obtained Pre-vot message back to the proposal data based on the erasure coding algorithm in the Pre-vot stage of the TendermintBFT protocol, and the method comprises the following steps:
after obtaining at least N-f Prevote messages including self-provided, the consensus backup node quickly restores the data in the obtained Prevote messages into the proposal data based on the erasure coding algorithm.
3. The method according to claim 2,
The consensus backup node 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 restores the proposed data based on the erasure coding algorithm, broadcasting a Pre-commit message to other consensus nodes of the blockchain in the Pre-vot stage of the TendermintBFT protocol, wherein when N-f Pre-commit messages are generated by the round of consensus, the proposed data achieves passing consensus.
4. The method according to claim 1 to 3,
The data blocks split by the proposal data correspond to the merck tree path information obtained based on the erasure coding algorithm, and the consensus master node also sends the merck tree path information matched with the data blocks split by the proposal data to the corresponding consensus backup node in the blockchain through Propose messages;
And the consensus backup node receiving the data block performs erasure code verification on the data block provided by the consensus master node, and the method comprises the following steps:
and the received consensus backup node of the data block carries out the Merck tree reconstruction on the data block provided by the consensus master node based on the erasure code algorithm, if the Merck tree path information provided by the consensus master node is matched with the reconstructed Merck tree, the erasure code verification is successful, otherwise, the erasure code verification fails.
5. A method according to any one of claims 1-3, further comprising:
And the consensus backup node receiving the data block performs erasure code verification on the data block provided by the consensus master node, and the method comprises the following steps:
and if the proposal data is not initiated in the common recognition of the previous round, the common recognition backup node which receives the data block carries out erasure code verification on the data block provided by the common recognition main node, otherwise, the data block provided by the common recognition main node is directly subjected to matching verification through the proposal data cached in the common recognition of the previous round so as to replace the erasure code verification.
6. A blockchain system comprises a consensus master node and a consensus backup node, wherein:
When the local round of consensus is initiated, the consensus master node splits the proposal data of the local round of consensus into data blocks corresponding to the consensus backup nodes of the blockchain based on an erasure coding algorithm, wherein the blockchain performs consensus by adopting TendermintBFT Bayesian protocol;
The consensus master node sends the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of the TendermintBFT protocol;
The consensus backup node which receives the data blocks carries out erasure code verification on the data blocks provided by the consensus main node, so that the data blocks which are successfully subjected to erasure code verification are broadcast to other consensus backup nodes through Pre-vot messages in the Pre-vot stage of the TendermintBFT protocol;
The consensus backup node restores the data blocks in the Pre-notice messages with at least N-2f numbers to the proposal data based on the erasure code algorithm, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposal data in the Pre-notice stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the blockchain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1, if the consensus backup node fails to restore the restored proposal data, the Pre-notice messages are broadcast to other consensus nodes of the TendermintBFT protocol in the Pre-notice stage of the blockchain, and if the erasure code verification fails to be received by the consensus backup node of the data blocks, the Pre-notice messages are broadcast to other consensus nodes in the Pre-notice stage of the TendermintBFT protocol, wherein f Pre-notice messages are generated in the round of consensus, and the Pre-notice messages are not used for the direct realization of the block-notice messages.
7. A blockchain node comprising:
The erasure code correction module is used for splitting the proposed data of the round of consensus into data blocks corresponding to the consensus backup nodes of the block chains based on an erasure code correction algorithm when the round of consensus is initiated and if the affiliated block chain nodes are the consensus master nodes, wherein the block chains adopt TendermintBFT Bayesian protocol for consensus;
The sending module is used for sending the data block split by the proposal data to the corresponding consensus backup node in the blockchain through Propose information in Propose stage of the TendermintBFT protocol if the affiliated blockchain node is the consensus master node;
The verification module is used for carrying out erasure code verification on the data block provided by the consensus master node if the affiliated blockchain node is the consensus backup node, so that the data block which is successfully subjected to erasure code verification is broadcasted to other consensus backup nodes through a Pre-volt message in the Pre-volt stage of the TendermintBFT protocol;
And a restoration module for restoring the data blocks in the Pre-notice messages with at least N-2f numbers based on the erasure coding algorithm when the block chain node is the consensus backup node, so as to execute the consensus logic of the TendermintBFT protocol on the restored proposed data in the Pre-notice stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1, if the consensus backup node fails to restore the proposed data, the Pre-notice message is broadcast to other consensus nodes of the block chain in the Pre-notice stage of the TendermintBFT protocol, and the Pre-notice message is broadcast to other consensus nodes in the Pre-notice stage of the TendermintBFT protocol if the erasure coding check fails to complete the consensus data blocks, wherein when the Pre-notice message is generated, the Pre-notice message is not used for determining that the block is directly reached.
8. An electronic device includes a memory, a processor, and a computer program stored on the memory and executable on the processor, the computer program being executed by the processor:
When the local round of consensus is initiated, if the local round of consensus is used as a consensus master node, splitting proposed data of the local round of consensus into data blocks corresponding to a consensus backup node of a block chain based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian and busy-family protocols;
If the proposed data is used as a consensus backup node, in Propose stage of TendermintBFT protocol, the data blocks split by the proposed data are sent to the corresponding consensus backup node in the blockchain through Propose information;
if the data block is used as a consensus backup node, performing erasure code verification on the data block provided by the consensus master node, and broadcasting the data block successfully subjected to erasure code verification to other consensus backup nodes through a Pre-vot message in the Pre-vot stage of the TendermintBFT protocol;
If the data block is taken as a consensus backup node, restoring the data block in the Pre-notice message with at least N-2f based on the erasure code algorithm to the proposal data, executing the consensus logic of the TendermintBFT protocol on the restored proposal data in the Pre-notice stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1, if the consensus backup node fails to restore the restored proposal data, broadcasting the Pre-notice message to other consensus nodes of the block chain in the Pre-notice stage of the TendermintBFT protocol, and receiving the Pre-notice message to other consensus nodes in the Pre-notice stage of the TendermintBFT protocol if the erasure code verification fails, and when the round of consensus generates f Pre-notice messages, directly determining that the block notice message is not passed through the empty.
9. A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
When the local round of consensus is initiated, if the local round of consensus is used as a consensus master node, splitting proposed data of the local round of consensus into data blocks corresponding to a consensus backup node of a block chain based on an erasure coding algorithm, wherein the block chain performs consensus by adopting TendermintBFT Bayesian and busy-family protocols;
If the proposed data is used as a consensus backup node, in Propose stage of TendermintBFT protocol, the data blocks split by the proposed data are sent to the corresponding consensus backup node in the blockchain through Propose information;
if the data block is used as a consensus backup node, performing erasure code verification on the data block provided by the consensus master node, and broadcasting the data block successfully subjected to erasure code verification to other consensus backup nodes through a Pre-vot message in the Pre-vot stage of the TendermintBFT protocol;
If the data block is taken as a consensus backup node, restoring the data block in the Pre-notice message with at least N-2f based on the erasure code algorithm to the proposal data, executing the consensus logic of the TendermintBFT protocol on the restored proposal data in the Pre-notice stage of the TendermintBFT protocol to complete the round of consensus, wherein N is the number of the consensus nodes of the block chain, f is the fault tolerance number of the consensus nodes set by the TendermintBFT protocol, N is greater than or equal to 3f+1, if the consensus backup node fails to restore the restored proposal data, broadcasting the Pre-notice message to other consensus nodes of the block chain in the Pre-notice stage of the TendermintBFT protocol, and receiving the Pre-notice message to other consensus nodes in the Pre-notice stage of the TendermintBFT protocol if the erasure code verification fails, and when the round of consensus generates f Pre-notice messages, directly determining that the block notice message is not passed through the empty.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111124489.XA CN113761069B (en) | 2021-09-24 | 2021-09-24 | A consensus method, system, node and electronic device for blockchain |
| PCT/CN2022/107791 WO2023045533A1 (en) | 2021-09-24 | 2022-07-26 | Consensus on blockchain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111124489.XA CN113761069B (en) | 2021-09-24 | 2021-09-24 | A consensus method, system, node and electronic device for blockchain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113761069A CN113761069A (en) | 2021-12-07 |
| CN113761069B true CN113761069B (en) | 2025-02-25 |
Family
ID=78797332
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111124489.XA Active CN113761069B (en) | 2021-09-24 | 2021-09-24 | A consensus method, system, node and electronic device for blockchain |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN113761069B (en) |
| WO (1) | WO2023045533A1 (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113761069B (en) * | 2021-09-24 | 2025-02-25 | 蚂蚁区块链科技(上海)有限公司 | A consensus method, system, node and electronic device for blockchain |
| CN114710512B (en) * | 2022-03-30 | 2023-09-29 | 蚂蚁区块链科技(上海)有限公司 | Method for distributing consensus result, node and blockchain system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109345386A (en) * | 2018-08-31 | 2019-02-15 | 阿里巴巴集团控股有限公司 | Transaction common recognition processing method and processing device, electronic equipment based on block chain |
| CN111526219A (en) * | 2020-07-03 | 2020-08-11 | 支付宝(杭州)信息技术有限公司 | Alliance chain consensus method and alliance chain system |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10984134B2 (en) * | 2017-07-14 | 2021-04-20 | Microsoft Technology Licensing, Llc | Blockchain system for leveraging member nodes to achieve consensus |
| CN109379397B (en) * | 2018-08-31 | 2019-12-06 | 阿里巴巴集团控股有限公司 | Transaction consensus processing method and device based on block chain and electronic equipment |
| CN109359223A (en) * | 2018-09-17 | 2019-02-19 | 重庆邮电大学 | Distributed storage technology of blockchain ledger based on erasure code |
| CN109871366B (en) * | 2019-01-17 | 2021-09-10 | 华东师范大学 | Block chain fragment storage and query method based on erasure codes |
| CN110012100B (en) * | 2019-04-09 | 2021-04-27 | 杭州秘猿科技有限公司 | Bandwidth-optimized block chain consensus method and device and electronic equipment |
| CN110351133B (en) * | 2019-06-28 | 2021-09-17 | 创新先进技术有限公司 | Method and device for main node switching processing in block chain system |
| CN111741121A (en) * | 2020-07-03 | 2020-10-02 | 支付宝(杭州)信息技术有限公司 | Method and system for processing junk information in block chain |
| CN111526217B (en) * | 2020-07-03 | 2020-10-09 | 支付宝(杭州)信息技术有限公司 | Consensus method and system in block chain |
| CN111526165B (en) * | 2020-07-03 | 2020-10-09 | 支付宝(杭州)信息技术有限公司 | Consensus method and system in alliance chain |
| CN113888168B (en) * | 2020-07-03 | 2024-07-26 | 支付宝(杭州)信息技术有限公司 | Method, device and system for consensus of alliance chains and method, device and system for data verification |
| CN113761069B (en) * | 2021-09-24 | 2025-02-25 | 蚂蚁区块链科技(上海)有限公司 | A consensus method, system, node and electronic device for blockchain |
-
2021
- 2021-09-24 CN CN202111124489.XA patent/CN113761069B/en active Active
-
2022
- 2022-07-26 WO PCT/CN2022/107791 patent/WO2023045533A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109345386A (en) * | 2018-08-31 | 2019-02-15 | 阿里巴巴集团控股有限公司 | Transaction common recognition processing method and processing device, electronic equipment based on block chain |
| CN111526219A (en) * | 2020-07-03 | 2020-08-11 | 支付宝(杭州)信息技术有限公司 | Alliance chain consensus method and alliance chain system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113761069A (en) | 2021-12-07 |
| WO2023045533A1 (en) | 2023-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111526219B (en) | Alliance chain consensus method and alliance chain system | |
| CN109885256B (en) | Data storage method, device and medium based on data slicing | |
| CN113849564B (en) | Block chain consensus method, consensus node and electronic equipment | |
| CN113761069B (en) | A consensus method, system, node and electronic device for blockchain | |
| CN113873030B (en) | A consensus method, consensus node and electronic device for blockchain | |
| US11531593B2 (en) | Data encoding, decoding and recovering method for a distributed storage system | |
| CN113852691B (en) | Block chain consensus method, consensus node and electronic equipment | |
| CN109783014B (en) | A method and device for storing data | |
| CN111240597B (en) | Method, apparatus, device and computer readable storage medium for storing data | |
| CN111786818A (en) | Block chain consensus node state monitoring method and device | |
| CN111522696B (en) | Downtime processing method, data persistence method and hardware of block chain common identification node | |
| CN117473020B (en) | Data access method, system, computer storage medium and terminal device | |
| CN113326006A (en) | Distributed block storage system based on erasure codes | |
| CN111522697B (en) | Restarting processing method of block chain consensus node, consensus node and block chain system | |
| CN112465515B (en) | Block chain consensus method, consensus node and electronic equipment | |
| CN113872961B (en) | Block chain consensus method, consensus node and electronic equipment | |
| CN115237680B (en) | Distributed data recovery system and method | |
| CN115756947A (en) | Data consistency verification method, device and system of distributed data storage system | |
| CN110728515A (en) | Service processing method and device based on block chain | |
| CN118540221A (en) | Data processing method, device, electronic equipment and storage medium | |
| HK40036324A (en) | Alliance chain consensus method and alliance chain system | |
| HK40036324B (en) | Alliance chain consensus method and alliance chain system | |
| CN112991066A (en) | Consensus method and device in alliance chain and electronic equipment | |
| CN118890129B (en) | Data transmission method and device of multi-carrier system and electronic equipment | |
| CN115642987B (en) | Coding method, device, computing equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20240919 Address after: Room 803, floor 8, No. 618 Wai Road, Huangpu District, Shanghai 200010 Applicant after: Ant blockchain Technology (Shanghai) Co.,Ltd. Country or region after: China Address before: 310000 801-11 section B, 8th floor, 556 Xixi Road, Xihu District, Hangzhou City, Zhejiang Province Applicant before: Alipay (Hangzhou) Information Technology Co.,Ltd. Country or region before: China Applicant before: Ant blockchain Technology (Shanghai) Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |