WO2020211461A1

WO2020211461A1 - Verifiable consensus method and system

Info

Publication number: WO2020211461A1
Application number: PCT/CN2019/129715
Authority: WO
Inventors: 吉建勋; 杨慧
Original assignee: 北京艾摩瑞策科技有限公司
Priority date: 2019-04-16
Filing date: 2019-12-30
Publication date: 2020-10-22
Also published as: CN110011814A; CN110011814B

Abstract

Disclosed in the present application are a verifiable DPoS consensus method and system. The system comprises super nodes, verification nodes and normal nodes, and at least one normal node selects N super nodes. The method comprises: a first super node receives request data sent by at least one normal node; packages the first request data in a preset time period into a first block, and verifies the first block; sends the first block to the remaining super nodes for verification after the verification of the first block succeeds; the remaining super nodes verify the first block by using PBFT; after the verification succeeds, the first super node randomly selects M verification nodes by means of a VRF algorithm, and the M verification nodes verify the first block by using a PBFT algorithm; after the verification succeeds, the first block is linked. The present application can improve the efficiency of block generation and the security of a blockchain system, and has a relatively high decentralization degree.

Description

A verifiable consensus method and its system

Technical field

This application relates to the field of blockchain technology, and in particular to a verifiable consensus method and system.

Background technique

At present, blockchain, Internet of Things, and artificial intelligence are among the three technologies of the future. Blockchain technology is based on a decentralized peer-to-peer network. It uses open source software to combine cryptographic principles, time series data, and consensus mechanisms to ensure the continuity and continuity of nodes in a distributed database, so that information can be verified and can be verified instantly. Traceability, but it is difficult to tamper with and cannot be shielded, thus creating a private, efficient and secure shared value system.

Consensus algorithm is the core component of blockchain technology, which mainly solves the problem of who is who constructs and inspects the block and how to maintain the unity of the blockchain. In a centralized structure system, the consensus algorithm of the entire system is determined by the center, and each participant only needs to obey this center. Therefore, in a centralized system, the establishment of the consensus algorithm is extremely efficient; and the blockchain Technology is a decentralized system. Every participating node in the system has equal status. When there is a disagreement, the consensus algorithm becomes an important method and means to solve such problems.

Currently, consensus algorithms commonly used in blockchain technology include Proof of Work (PoW), Proof of Stake (POS), Delegated Proof of Stake (DPoS), and Practical Byzantine Fault Tolerance (Practical). Byzantine Fault Tolerance, PBFT) etc.

However, the PoW algorithm has the highest degree of decentralization, requires a lot of hash calculations, wastes too much power and energy, and generates a new block in about 10 minutes, which is inefficient; the DPoS algorithm is an upgrade of the PoS algorithm and is voted by nodes Several agent nodes, several agent nodes perform verification and accounting, and generate a new block in about 30 seconds, which solves the problem of inefficiency of the PoW algorithm. However, the number of agent nodes is generally less than 100, the degree of centralization is low, and the agent node is easy Do evil, the security is lower than the PoW algorithm.

With the increasing application of blockchain scenarios, how to find a consensus method that can not only improve the efficiency of block generation, but also improve the decentralization and security of the blockchain system has become an urgent problem to be solved.

Summary of the invention

In order to solve the above problems, the present application provides a verifiable consensus method and system thereof, which can not only improve the efficiency of block generation, but also improve the decentralization and security of the blockchain system.

The first aspect of this application discloses a verifiable consensus method, which is applied to a verifiable DPoS consensus system. The system includes a super node, a verification node, and a common node. The super node is used to package blocks and Verify the block, the verification node is used to verify the block, the ordinary node is used to synchronize data on the blockchain; wherein at least one of the ordinary nodes selects N super nodes, where N is a positive integer, and the N The super nodes include the first super node; the method includes:

The first super node receives request data sent by at least one of the ordinary nodes, where the request data includes request information, addresses of both requesting parties, and a hash value of the request information;

The first super node packs the first request data within a preset time period into a first block, and verifies the first block;

After the first super node passes the verification of the first block, the first block is sent to the remaining super nodes for verification, and the remaining super nodes are the N super nodes except the first block. Super nodes other than super nodes;

The remaining super nodes use a practical Byzantine fault-tolerant algorithm to verify the first block;

After the remaining super nodes verify the first block, the first super node randomly selects M verification nodes through a verifiable random algorithm, and the M verification nodes use a practical Byzantine fault-tolerant algorithm to The first block is verified, and M is a positive integer;

After the M verification nodes pass the verification of the first block, the first block is uploaded to the chain.

In a possible implementation manner, the value range of the super node N is 10-100.

In a possible implementation manner, the request information includes transaction information and/or business information; wherein, the transaction information includes the transaction amount and the buyer's digital signature; the business information includes business data, and the business data includes Business attribute data, price data, and owner data.

In a possible implementation manner, the first request data includes all the request data between the first block and a block before the first block.

In a possible implementation manner, after the remaining super nodes pass verification of the first block, when the first super node determines that the bytes of the first block are greater than a preset byte threshold, The first super node divides the first block into at least two fragmented blocks; the first super node randomly selects at least two verification node groups through a verifiable random algorithm, the at least two verification node groups The at least two shard blocks are verified using a practical Byzantine fault-tolerant algorithm; wherein, one verification node group verifies one shard block; the first super node accepts the at least two verification node groups to verify the at least two shard blocks; And the first block is uploaded to the chain.

In a possible implementation manner, the N super nodes pack blocks in order, and after the first super node packs L blocks consecutively, the next super node packs blocks in order, and L is positive Integer; where the order of the N super nodes to pack the blocks is determined by the first super node after calculating the global path through the Dijkstra algorithm.

In a possible implementation manner, the first super node continuously packs L blocks, and the value range of L is 1-100.

In a possible implementation manner, when the first super node packs a first block and determines that the bytes of the first block are greater than a preset byte threshold, the first super node will The first block is divided into at least two fragmented blocks; wherein, the at least two fragmented blocks include a first fragmented block and the second fragmented block, and the first fragmented block is packaged by the first super node, The second fragmented block is packaged by the first super node randomly selecting one of the remaining super nodes through a verifiable random algorithm.

In a possible implementation, when the remaining super nodes verify the first block, and/or when M verification nodes verify the first block; the first block A super node packs the second request data within a preset time period into a second block, and verifies the second block.

In a possible implementation manner, after the remaining super nodes pass verification of the first block, the remaining super nodes randomly select M verification nodes through a verifiable random algorithm, and M The verification node verifies the first block, and M is a positive integer; or

After the remaining super nodes pass the verification of the first block, the first super node randomly selects m1 verification nodes through a verifiable random algorithm, and m1 verification nodes pass a verifiable random algorithm Randomly select m2 verification nodes, m1 and m2 are both positive integers, and m1+m2=M, and M verification nodes verify the first block.

In a possible implementation manner, the value of the verification node M is 20-200.

In a possible implementation manner, the verification of the first block includes hash verification of all requested data in the first block and identity verification of the requesting parties.

The second aspect of this application provides a verifiable DPoS consensus system. The system includes N super nodes, verification nodes, and ordinary nodes; wherein at least one of the ordinary nodes selects N super nodes, and N is a positive integer, so The N super nodes include the first super node;

The super node is used to package the block and the verification block, the verification node is used to verify the block, and the ordinary node is used to synchronize data on the blockchain;

The method of the present application can not only improve the efficiency of block generation, but also improve the security of the blockchain system; compared to the DPoS consensus mechanism, it increases the degree of decentralization.

Description of the drawings

The drawings described here are used to provide a further understanding of the application and constitute a part of the application. The exemplary embodiments and descriptions of the application are used to explain the application and do not constitute an improper limitation of the application.

FIG. 1 is a schematic flow diagram of a verifiable DPoS consensus method provided by an embodiment of the application;

Figure 2 is a schematic diagram of a verifiable DPoS consensus system structure provided by an embodiment of the application;

FIG. 3 is a schematic diagram of a structure for packing or verifying block fragments according to an embodiment of the application.

detailed description

In order to explain the overall concept of the present application more clearly, a detailed description will be given below by way of example in conjunction with the accompanying drawings of the specification.

The terms "first", "second", etc. in the description and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific sequence or sequence. It should be understood that the order used in this way can be interchanged under appropriate circumstances so that the embodiments of the present invention described herein can be implemented in orders other than those illustrated or described herein.

In addition, the terms "including" and "having" and any variations of them are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to the clearly listed Those steps or units may include other steps or units that are not clearly listed or are inherent to these processes, methods, products, or equipment.

The node referred to in the embodiments of this application can be understood as an abstract machine that responds to specific external triggering conditions and performs state transitions according to certain rules. It can be a mobile phone, a tablet, a handheld computer, a personal PC, etc. It can be based on application software and can be Networked devices.

As shown in Figure 1, a verifiable DPoS consensus method is applied to the verifiable DPoS consensus system shown in Figure 2.

The system includes a super node, a verification node, and a normal node. The super node is used to pack and verify the block, the verification node is used to verify the block, and the normal node is used to synchronize data on the blockchain. ; Wherein, at least one of the ordinary nodes selects N super nodes, N is a positive integer, and the N super nodes include the first super node.

It should be noted that both super nodes and verification nodes have the functions of ordinary nodes; the above N super nodes can be voted by a number of stakeholders through a computer (without synchronizing the data on the blockchain), or by a number of stakeholders It is generated by voting by ordinary nodes (synchronized with data on the blockchain).

The method includes steps S101-S106.

S101: The first super node receives request data sent by at least one of the ordinary nodes, where the request data includes request information, addresses of both requesting parties, and a hash value of the request information.

In an example, the request information includes transaction information and/or business information; wherein, the transaction information includes the transaction amount and the buyer's digital signature; the business information includes business data, and the business data includes business attribute data, Price data and owner data.

In addition, the business data may be structured data, which may include one or more of the version information of the business data, price information, browsing times information, collection times information, data owner information, and data creator information; and, business data Time-stamped data is continuous data on the time axis. For example, version information includes version 1.0 and version 2.0, and price information includes initial price and change price.

S102. The first super node packs the first request data within a preset time period into a first block, and verifies the first block.

At this time, the preset time period refers to the time between the generation of two blocks.

In an example, the first request data includes all the transaction data between the first block and a block before the first block.

In an example, the N super nodes pack blocks in order, and after the first super node packs L blocks consecutively, the next super node packs blocks in order, and L is a positive integer; where, The order in which the N super nodes pack the blocks is determined by the first super node through a dynamic programming method.

In addition, before each round of packaging blocks mentioned above, it is necessary to determine the order of the super nodes that pack the blocks, so that the global path is the shortest in each round of packaging blocks for each super node; in this case, dynamic The planning method solves the Traveling Salesman Problem (TSP), that is, knowing the distance between any two nodes, how to traverse all nodes from one node with the shortest path. The dynamic programming method can use the shortest path Dijkstra algorithm, or the global shortest path Floyd-warshall algorithm.

It should also be noted that N super nodes form a P2P network, and data transmission between the N super nodes also adopts a dynamic programming method to improve data transmission efficiency. When each super node transmits data, it no longer directly communicates with another super node, but selects the shortest path between the two super nodes for communication through the dynamic programming method, which can reduce the data transmission time between the two super nodes, thereby Improve network efficiency.

This application does not limit the number of supernodes and the number of supernodes continuously packaged blocks. In an example, the value range of super node N is 10-100; the first super node continuously packs L blocks, and the value range of L is 1-100.

S103: After the first super node passes the verification of the first block, the first block is sent to the remaining super nodes for verification, and the remaining super nodes are the N super nodes except for the A super node other than the first super node.

S104: The remaining super nodes use a practical Byzantine fault-tolerant algorithm to verify the first block.

It should be noted that the Practical Byzantine Fault Tolerance (PBFT) algorithm can tolerate less than 1/3 invalid or malicious nodes, which is not described in detail in this embodiment of the application.

S105: After the remaining super nodes pass the verification of the first block, the first super node randomly selects M verification nodes through a verifiable random algorithm, and the M verification nodes adopt practical Byzantine fault tolerance. The algorithm verifies the first block, and M is a positive integer.

In an example, when the remaining super nodes verify the first block, and/or when the M verification nodes verify the first block; the first super node pairs The second request data in the preset time period is packaged into a second block, and the second block is verified.

In other words, the rest of the above-mentioned super nodes verify the above-mentioned first block, and the process of generating the second block by packaging the second request data with the first super node can be carried out at the same time without waiting for the first block verification process to be completely completed. After that, the second block is generated, thereby improving the efficiency of block generation; at the same time, the above M verification nodes verify the first block, and the process of generating the second block by the first super node can also be performed at the same time get on.

At this time, using Verifiable Random Function (VRF) to select M verification nodes to verify the first block can prevent more than one third of the super nodes from doing evil; if there are more than one third of the super nodes The node is evil, the M verification nodes randomly selected by the first super node refuse to verify the first block, or the verification fails, the first block cannot be successfully uploaded to the chain.

Therefore, the first super node uses the VRF algorithm to verify the blocks on the chain, which can improve the security of the blockchain system; and the above discussion shows that the first super node uses the VRF algorithm to verify the blocks on the chain. , The first super node can also continue to package to generate the second block, which can also improve the block generation efficiency of the blockchain system.

It should be pointed out that the M verification nodes also use the PBFT algorithm to verify the first block.

In addition, since M verification nodes can store the entire blockchain, compared to the existing DPoS algorithm (in the DPoS algorithm, only about 100 proxy equity nodes have the function of verification), the blockchain system has been increased. Degree of centralization. When the verification node finds that the first block fails the verification, the first block is discarded, and the block generation and verification process is repeated from the previous block of the first block; and the first block is judged from the remaining super nodes The super node that has passed the block verification is regarded as a malicious node; then, the verification node pulls the malicious node into the blacklist, and a super node is added to replace the malicious super node. In the blockchain system of the present application, according to the above mechanism, any number of super nodes can be prevented from doing evil.

In an example, after the remaining super nodes pass the verification of the first block, the remaining super nodes randomly select M verification nodes through a verifiable random algorithm, and the M verification nodes The first block is verified, and M is a positive integer.

In an example, after the remaining super nodes verify the first block, the first super node randomly selects m1 verification nodes through a verifiable random algorithm, and m1 verification nodes pass A verifiable random algorithm randomly selects m2 verification nodes, m1 and m2 are all positive integers, and m1+m2=M, and M verification nodes verify the first block.

This application does not limit the value of the verification node. In an example, the value of the verification node M is 20-200.

S106: After the M verification nodes pass the verification of the first block, the first block is uploaded to the chain.

It should be pointed out that after any of the above-mentioned blocks is verified, the verified block is on the chain; after the block is on the chain, it does not become an irreversible block; only the on-chain block has multiple subsequent blocks (for example: subsequent There are 6 blocks) after it is confirmed to be on the chain, the block becomes an irreversible block.

In an example, the verification of the above-mentioned first block includes hash verification of all requested data in the first block and identity verification of the requesting parties.

The verification method is for example: in the transaction, the sender’s public key is used to verify whether the sender is signed with the private key, and the Merkle number root of the block header in the first block is used to verify whether the transaction data in the first block has been tampered with . It should be noted that the verification of the block is a conventional technical means of those skilled in the art, and this application will not describe this in detail.

In an example, after the remaining super nodes pass the verification of the first block, when the first super node determines that the bytes of the first block are greater than a preset byte threshold, the first super node The node divides the first block into at least two fragmented blocks; the first super node randomly selects at least two verification node groups through a verifiable random algorithm, and the at least two verification node groups adopt practical Byzantine fault tolerance The algorithm verifies the at least two shard blocks; wherein one verification node group verifies one shard block; the first super node accepts the at least two verification node groups to verify the at least two shard blocks If the verification message is passed, the first block is uploaded to the chain.

As shown in Figure 3, the number of bytes of the block is greater than the byte threshold, and the block is divided into fragment block 1, fragment block 2, fragment block 3, fragment block n, and use the VRF algorithm to randomly select the verification node group 6. The verification node group 3 and the verification node group 8 verify the block.

In an example, when the first super node packs the first block, and it is determined that the bytes of the first block are greater than a preset byte threshold, the first super node packs the first block Divided into at least two shard blocks; wherein, at least two shard blocks include a first shard block and the second shard block, the first shard block is packaged by the first super node, and the second shard block The fragmented block is packaged by the first super node randomly selecting one of the remaining super nodes through a verifiable random algorithm.

As shown in Figure 3, the block byte is greater than the byte threshold. The block is divided into fragment block 1, fragment block 2, fragment block 3, and fragment block n. The first super node randomly selects it through the VRF algorithm Super node VRF packs shard block 1, super node 2 packs shard block 2, and super node 9 packs shard block 3.

It should be noted that the byte count threshold can be set as required.

As shown in Figure 2, a verifiable DPoS consensus system includes N super nodes, verification nodes and ordinary nodes.

At least one of the ordinary nodes selects N super nodes, where N is a positive integer, and the N super nodes include the first super node.

The super node is used to package the block and the verification block, the verification node is used to verify the block, and the ordinary node is used to synchronize data on the blockchain; and receive request data sent by at least one of the ordinary nodes , The request data includes request information, the addresses of the requesting parties, and the hash value of the request information; and the first request data within a preset time period is packaged into a first block, and the first block is processed Verification; and after the first block is verified, the first block is sent to the remaining super nodes for verification, and the remaining super nodes are the N super nodes except the first super node Super node.

The remaining super nodes use a practical Byzantine fault-tolerant algorithm to verify the first block; after the remaining super nodes verify the first block, the first super node randomly selects M through a verifiable random algorithm The verification nodes, M verification nodes verify the first block using a practical Byzantine fault-tolerant algorithm, and M is a positive integer.

In an example, the request information includes transaction information and/or business information; wherein, the transaction information includes transaction amount and digital signatures of both parties to the transaction; the business information includes business data, and the business data includes business attribute data , Price data, and owner data.

The method of the present application can not only improve the efficiency of block generation, but also improve the security of the blockchain system; compared with the DPoS consensus mechanism, the degree of decentralization is increased.

The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, as for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for related parts, please refer to the part of the description of the method embodiment.

Professionals should also be further aware that the units and algorithm steps of the examples described in the embodiments disclosed in this article can be implemented by electronic hardware, computer software or a combination of both, in order to clearly illustrate the hardware and software Interchangeability. In the above description, the composition and steps of each example have been generally described in terms of function. Whether these functions are executed by hardware or software depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

The above descriptions are only examples of this application and are not used to limit this application. For those skilled in the art, this application can have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this application shall be included in the scope of the claims of this application.

Claims

A verifiable DPoS consensus method, characterized in that it is applied to a consensus system based on a verifiable DPoS consensus mechanism. The system includes a super node, a verification node, and a common node. The super node is used to package blocks and Verify the block, the verification node is used to verify the block, the ordinary node is used to synchronize data on the blockchain; wherein at least one of the ordinary nodes selects N super nodes, where N is a positive integer, and the N The super nodes include the first super node; the method includes:

The first super node receives request data sent by at least one of the ordinary nodes, where the request data includes request information, addresses of both requesting parties, and a hash value of the request information;

The first super node packs the first request data within a preset time period into a first block, and verifies the first block;

After the first super node passes the verification of the first block, the first block is sent to the remaining super nodes for verification, and the remaining super nodes are the N super nodes except the first block. Super nodes other than super nodes;

The remaining super nodes use a practical Byzantine fault-tolerant algorithm to verify the first block;

After the remaining super nodes verify the first block, the first super node randomly selects M verification nodes through a verifiable random algorithm, and the M verification nodes use a practical Byzantine fault-tolerant algorithm to The first block is verified, and M is a positive integer;

After the M verification nodes pass the verification of the first block, the first block is uploaded to the chain.
The method according to claim 1, wherein the request information includes transaction information and/or business information; wherein,

The transaction information includes the transaction amount and the buyer's digital signature;

The business information includes business data, and the business data includes business attribute data, price data, and owner data.
The method of claim 1, wherein the method further comprises:

After the remaining super nodes pass the verification of the first block, when the first super node determines that the bytes of the first block are greater than a preset byte threshold, the first super node will A block is divided into at least two fragmented blocks;

The first super node randomly selects at least two verification node groups through a verifiable random algorithm, and the at least two verification node groups use a practical Byzantine fault-tolerant algorithm to verify the at least two shard blocks; among them, one verifies The node group verifies a fragmented block correspondingly;

The first super node accepts the verification message of the at least two shard blocks from the at least two verification node groups, and the first block is uploaded to the chain.
The method according to claim 1, wherein the N super nodes pack blocks in order, and after the first super node packs L blocks consecutively, the next super node packs blocks in order , L is a positive integer; where,

The order in which the N super nodes pack the blocks is determined by the first super node through a dynamic programming method; and/or

After the packing sequence is determined in each round, the data transmission path between the N super nodes is determined by a dynamic programming method.
The method according to claim 1 or 4, wherein when the remaining super nodes verify the first block, and/or

When the M verification nodes verify the first block; the first super node packs the second request data within the preset time period into a second block, and compares the second block authenticating.
The method according to claim 1, wherein, after the remaining super nodes verify the first block, the remaining super nodes randomly select M verification nodes through a verifiable random algorithm, The M verification nodes verify the first block, and M is a positive integer; or

After the remaining super nodes pass the verification of the first block, the first super node randomly selects m1 verification nodes through a verifiable random algorithm, and m1 verification nodes pass a verifiable random algorithm Randomly select m2 verification nodes, m1 and m2 are both positive integers, and m1+m2=M, and M verification nodes verify the first block.
The method of claim 1, wherein the method further comprises:

When the first super node packs the first block and it is determined that the bytes of the first block are greater than the preset byte threshold, the first super node divides the first block into at least two Fragment block; wherein at least two fragment blocks include a first fragment block and the second fragment block, the first fragment block is packaged by the first super node, and the second fragment block is composed of The first super node randomly selects one of the remaining super nodes to package by using a verifiable random algorithm.
A verifiable DPoS consensus system, characterized in that the system includes N super nodes, verification nodes and ordinary nodes; wherein at least one of the ordinary nodes selects N super nodes, where N is a positive integer, and the N Each super node includes the first super node;

The super node is used to package the block and the verification block, the verification node is used to verify the block, and the ordinary node is used to synchronize data on the blockchain;

The first super node receives request data sent by at least one of the ordinary nodes, where the request data includes request information, addresses of both requesting parties, and a hash value of the request information;

The first super node packs the first request data within a preset time period into a first block, and verifies the first block;

After the first super node passes the verification of the first block, the first block is sent to the remaining super nodes for verification, and the remaining super nodes are the N super nodes except the first block. Super nodes other than super nodes;

The remaining super nodes use a practical Byzantine fault-tolerant algorithm to verify the first block;

After the remaining super nodes verify the first block, the first super node randomly selects M verification nodes through a verifiable random algorithm, and the M verification nodes use a practical Byzantine fault-tolerant algorithm to The first block is verified, and M is a positive integer;

After the M verification nodes pass the verification of the first block, the first block is uploaded to the chain.
The system according to claim 8, wherein the request information includes transaction information and/or business information; wherein,

The transaction information includes the transaction amount and the digital signatures of both parties to the transaction;

The business information includes business data, and the business data includes business attribute data, price data, and owner data.
The system according to claim 8, wherein when the remaining super nodes verify the first block, and/or when the M verification nodes verify the first block ；

The first super node packs the second request data within a preset time period into a second block, and verifies the second block.