CN107566124A - Common recognition method for building up, block catenary system and storage medium based on lottery mechanism - Google Patents

Abstract

The invention discloses a consensus establishment method based on a lottery mechanism, a block chain system and a storage medium. The method includes: determining the bookkeeping node of the last block in the block chain, and determining the bookkeeping node based on the last block , to obtain a data packet, the data packet contains at least the transaction data of the block to be connected to the last block; based on the obtained data packet and the self-stored node data of the node, a hash operation is performed to obtain the first A candidate hash value; obtain a second candidate hash value broadcast by other nodes, select a target hash value from the first candidate hash value and the second candidate hash value according to a first preset rule, and the target hash value The node of is the accounting node to be connected to the block. The invention can ensure that each node in the block chain competes for bookkeeping rights completely and equally, can encourage more people to participate in the block chain, and is beneficial to the application and promotion of the block chain.

Description

Consensus establishment method, blockchain system and storage medium based on lottery mechanism

technical field

The invention relates to the technical field of block chains, in particular to a consensus establishment method based on a lottery mechanism, a block chain system and a storage medium.

Background technique

The blockchain is a distributed database system in which nodes participate. It can also be understood as an account book system, which is completed independently by all nodes in the blockchain network. The consensus mechanism is the core of the blockchain technology, which makes a decentralized ledger system such as the blockchain possible. The two core factors of the consensus mechanism and decentralization are the key to the expansion of the endogenous capabilities of the blockchain.

In a centralized structural system, the consensus of the system is determined by the center, and all participants only need to obey this center, so the establishment of consensus is extremely efficient. In a decentralized structural system, due to the various participants in the system If both parties are equal in status, how to reach a consensus when differences arise becomes a problem.

Currently commonly used blockchain consensus mechanisms include proof-of-work and proof-of-stake. Among them, the core implementation of proof of equity is as follows: when the bookkeeping node generates a new block, it attaches its own address to the block to prove the proportion of equity it occupies. The bookkeeping node also needs to use the private address corresponding to the address The key signs part of the block information to prove that it really owns the asset at the address. This consensus mechanism tends to occupy nodes with large rights and interests in the system, which can easily lead to corruption and is not conducive to attracting more groups to use the blockchain.

Contents of the invention

The main purpose of the present invention is to provide a consensus establishment method based on the lottery mechanism, which aims to solve the problem that the proof-of-stake consensus mechanism tends to occupy nodes with large rights and interests in the system, which is easy to cause corruption and is not conducive to attracting more groups to use the blockchain. technical problem.

In order to achieve the above object, the present invention provides a consensus establishment method based on a lottery mechanism, the method comprising:

Determine the bookkeeping node of the last block in the blockchain, and obtain a data packet based on the bookkeeping node of the last block, the data packet at least includes the transaction data of the block to be connected to the last block ;

Based on the obtained data packet and the self-stored node data of the node, perform a hash operation to obtain the first candidate hash value;

Obtain the second candidate hash value broadcast by other nodes, select a target hash value among the first candidate hash value and the second candidate hash value according to the first preset rule, and the node of the target hash value is all Describe the accounting nodes to be connected to the block.

In one of the embodiments, the step of selecting the target hash value from the first candidate hash value and the second candidate hash value according to preset rules includes:

A minimum candidate hash value is determined among the first candidate hash value and the second candidate hash value, and the minimum candidate hash value is a target hash value.

In one of the embodiments, the step of performing a hash operation to obtain the first candidate hash value based on the obtained data packet and the self-stored node data of the node includes:

Obtaining the transaction data of the block to be accessed in the data packet, and performing a hash operation based on the transaction data and the characteristic value of the last block to obtain a first hash value;

The first hash value is signed based on the self-stored private key, and a hash operation is performed on the signed first hash value to obtain a first candidate hash value.

In one of the embodiments, after the step of obtaining the data packet, it includes:

According to the historical transaction data in the block chain, verify whether all the transaction data in the block to be accessed in the data packet are valid;

If all the transaction data of the block to be accessed in the data packet are valid, perform a hash operation based on the obtained data packet and the node data stored by the node to obtain the first candidate hash value .

In one of the embodiments, after the step of acquiring the second candidate hash value broadcast by other nodes includes:

Based on the first candidate hash value and the second candidate hash value, determine whether the first candidate hash value satisfies a broadcast condition according to a second preset rule;

If the first candidate hash value satisfies the broadcast condition, broadcast the first candidate hash value to the blockchain network where the blockchain is located.

In one of the embodiments, the step of judging whether the first candidate hash value satisfies the broadcast condition according to the second preset rule includes:

Analyzing the second preset rule, when the parsing result is that the minimum candidate hash value among the candidate hash values is the target hash value, if the first candidate hash value is smaller than the second candidate hash value, then the The first candidate hash value satisfies the broadcast condition.

In one of the embodiments, before the step of determining the bookkeeping node of the last block in the blockchain, based on the bookkeeping node of the last block, the step of obtaining the data packet includes:

The accounting node of the last block determines the transaction data of the block to be connected to the last block;

The accounting node of the last block generates a data packet based on the transaction data of the block to be accessed, and broadcasts the data packet to the blockchain network where the blockchain is located.

In one of the embodiments, the accounting node of the last block generates a data packet based on the transaction data of the block to be accessed, and broadcasts the data packet to the block chain network where the block chain is located include:

The accounting node of the last block performs a hash operation to obtain a second hash value based on the transaction data and the characteristic value of the last block;

The accounting node of the last block generates a data packet based on the transaction data, the characteristic value and the second hash value, and broadcasts the data packet to the blockchain network where the blockchain is located.

In addition, in order to achieve the above object, the present invention also provides a block chain system, the block chain system includes a plurality of nodes, and the nodes include: a memory, a processor, and a A consensus establishment program based on the lottery mechanism running on the processor, when the consensus establishment program based on the lottery mechanism is executed by the processor, the steps of the aforementioned consensus establishment method based on the lottery mechanism are implemented.

In addition, in order to achieve the above object, the present invention also provides a storage medium, on which a consensus establishment program based on a lottery mechanism is stored, and when the consensus establishment program based on a lottery mechanism is executed by a processor, the aforementioned The steps of the consensus establishment method of the mechanism.

In the embodiment of the present invention, based on the accounting node of the last block, the transaction data of the block to be accessed is determined to form a data packet. Since the accounting node of the last block is determined, the transaction data of the block to be accessed The data has a certain uniqueness and certainty, which makes the block to be accessed uniquely determined, which facilitates the smooth creation of the block to be accessed; each node in the blockchain network performs hashing based on its own node data and the data packet. Candidate hash values (the first candidate hash value and the second candidate hash value) are obtained by the Greek operation. Because the hash algorithm is irreversible, it can ensure that the candidate hash values are completely unpredictable in one direction, even if the data packet is based on the last bit area It is determined by the bookkeeping node of the last block, and the bookkeeping node of the last block cannot therefore adjust its own node data to make its candidate hash value become the target hash value by cheating, thus excluding the bookkeeping node of the last block. At the same time, the candidate hash value is completely unpredictable in one direction, which can further enhance the randomness of the candidate hash value, that is, to ensure that the accounting nodes to be connected to the block are randomly generated, so that in the blockchain Each node will not be in a disadvantaged position due to other factors such as computing power or rights and interests when competing for bookkeeping rights, ensuring that all nodes in the blockchain compete for bookkeeping rights completely and equally, which can encourage more people to participate in the blockchain, which is beneficial The promotion and application of the blockchain; due to the irreversibility of the hash operation and the unpredictability of the hash value, the selection of the accounting node is similar to a lottery mechanism, so the name of the main body of this scheme is the consensus establishment method based on the lottery mechanism; The unique target hash value is determined among the candidate hash values, and then the node that broadcasts the unique target candidate hash value is determined to be the accounting node of the block to be accessed, thereby reaching a blockchain consensus.

Description of drawings

Fig. 1 is a block chain system schematic diagram of the embodiment of the present invention;

FIG. 2 is a schematic structural diagram of a node terminal according to an embodiment of the present invention;

FIG. 3 is a schematic flow diagram of the first embodiment of the consensus establishment method based on the lottery mechanism of the present invention;

FIG. 4 is a schematic flow diagram of the third embodiment of the consensus establishment method based on the lottery mechanism of the present invention;

FIG. 5 is a schematic flow diagram of the fifth embodiment of the consensus establishment method based on the lottery mechanism of the present invention;

FIG. 6 is a schematic flow diagram of step S51 in FIG. 5 in an embodiment of the present invention;

FIG. 7 is a schematic diagram of the scene of the sixth embodiment of the consensus establishment method based on the lottery mechanism in the present invention;

FIG. 8 is a schematic flowchart of the sixth embodiment of the consensus establishment method based on the lottery mechanism of the present invention;

FIG. 9 is a schematic flowchart of a seventh embodiment of the consensus establishment method based on the lottery mechanism in the present invention.

The realization of the purpose of the present invention, functional characteristics and advantages will be further described in conjunction with the embodiments and with reference to the accompanying drawings.

detailed description

It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

In the following description, use of suffixes such as 'module', 'part' or 'unit' for denoting elements is only for facilitating description of the present invention and has no specific meaning by itself. Therefore, 'module', 'part' or 'unit' may be used in combination.

As shown in FIG. 1, FIG. 1 is a schematic diagram of a blockchain system according to an embodiment of the present invention.

The blockchain system includes a plurality of nodes. When creating a new block, one or some nodes execute a specific program or specific function, which is recorded as an accounting node in the embodiment of the present invention. Other nodes in the blockchain system For ordinary nodes, each created block has its own definite bookkeeping node. Bookkeeping nodes and ordinary nodes are not fixed and specific nodes, but will change according to the consensus algorithm of the blockchain.

The bookkeeping node is used for:

Determine the transaction data of the block to be connected to the last block;

Based on the transaction data of the block to be accessed, a data packet is generated, and the data packet is broadcast to the blockchain network where the blockchain is located.

The bookkeeping node or ordinary node is used for:

Determine the bookkeeping node of the last block in the blockchain, and obtain a data packet based on the bookkeeping node of the last block, the data packet at least includes the transaction data of the block to be connected to the last block ;

Based on the obtained data packet and the self-stored node data of the node, perform a hash operation to obtain the first candidate hash value;

Obtain the second candidate hash value broadcast by other nodes, select a target hash value among the first candidate hash value and the second candidate hash value according to the first preset rule, and the node of the target hash value is all Describe the accounting nodes to be connected to the block.

Described node terminal can be server, PC, also can be smart mobile phone, panel computer, e-book reader, MP3 (Moving Picture Experts Group Audio Layer III, moving picture expert compression standard audio level 3) player, MP4 (Moving Picture Experts Group Audio Layer IV, dynamic image expert compression standard audio layer 3) Players, portable computers and other mobile terminal devices with display functions.

As shown in FIG. 2 , the node may include: a processor 1001 , such as a CPU, a communication bus 1002 , a user interface 1003 , a network interface 1004 , and a memory 1005 . Wherein, the communication bus 1002 is used to realize connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. Optionally, the network interface 1004 may include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 can be a high-speed RAM memory, or a stable memory (non-volatile memory), such as a disk memory. Optionally, the memory 1005 may also be a storage device independent of the aforementioned processor 1001 .

Those skilled in the art can understand that the system components shown in Figure 1 and the node terminal structure shown in Figure 2 do not constitute a limitation on the system or node terminals, and may include more or less components than those shown in the illustration , or combinations of certain components, or different arrangements of components.

As shown in FIG. 2 , in this embodiment, the node terminal includes a processor 1001 , a communication bus 1002 , a user interface 1003 , a network interface 1004 , and a memory 1005 . The memory 1005 as a computer storage medium includes a consensus establishment program based on a lottery mechanism.

In the terminal shown in FIG. 2 , the network interface 1004 is mainly used to connect to the background server and perform data communication with the background server; the user interface 1003 is mainly used to connect to the client (client) and perform data communication with the client.

The processor 1001 can be used to call the consensus establishment program based on the lottery mechanism stored in the memory 1005, and perform the following operations:

Determine the bookkeeping node of the last block in the blockchain, and obtain a data packet based on the bookkeeping node of the last block, the data packet at least includes the transaction data of the block to be connected to the last block ;

Based on the obtained data packet and the self-stored node data of the node, perform a hash operation to obtain the first candidate hash value;

Obtain the second candidate hash value broadcast by other nodes, select a target hash value among the first candidate hash value and the second candidate hash value according to the first preset rule, and the node of the target hash value is all Describe the accounting nodes to be connected to the block.

The step of selecting a target hash value from the first candidate hash value and the second candidate hash value according to preset rules includes:

A minimum candidate hash value is determined among the first candidate hash value and the second candidate hash value, and the minimum candidate hash value is a target hash value.

The step of performing a hash operation to obtain the first candidate hash value based on the obtained data packet and the self-stored node data of the node includes:

Obtaining the transaction data of the block to be accessed in the data packet, and performing a hash operation based on the transaction data and the characteristic value of the last block to obtain a first hash value;

The first hash value is signed based on the self-stored private key, and a hash operation is performed on the signed first hash value to obtain a first candidate hash value.

After the step of obtaining the data packet, it also includes:

According to the historical transaction data in the block chain, verify whether all the transaction data in the block to be accessed in the data packet are valid;

If all the transaction data of the block to be accessed in the data packet are valid, then execute the hash operation based on the obtained data packet and the self-stored node data of the node to obtain the first candidate hash value. one step.

After the step of obtaining the second candidate hash value broadcast by other nodes, it also includes:

Based on the first candidate hash value and the second candidate hash value, determine whether the first candidate hash value satisfies a broadcast condition according to a second preset rule;

If the first candidate hash value satisfies the broadcast condition, broadcast the first candidate hash value to the blockchain network where the blockchain is located.

The step of judging whether the first candidate hash value satisfies the broadcast condition according to the second preset rule includes:

Analyzing the second preset rule, when the parsing result is that the minimum candidate hash value among the candidate hash values is the target hash value, if the first candidate hash value is smaller than the second candidate hash value, then the The first candidate hash value satisfies the broadcast condition.

Described to determine the bookkeeping node of the last block in the blockchain, based on the bookkeeping node of the last block, the step of obtaining the data packet includes:

The accounting node of the last block determines the transaction data of the block to be connected to the last block;

The accounting node of the last block generates a data packet based on the transaction data of the block to be accessed, and broadcasts the data packet to the blockchain network where the blockchain is located.

The accounting node of the last block generates a data packet based on the transaction data of the block to be accessed, and the step of broadcasting the data packet to the blockchain network where the blockchain is located includes:

The accounting node of the last block performs a hash operation to obtain a second hash value based on the transaction data and the characteristic value of the last block;

The accounting node of the last block generates a data packet based on the transaction data, the characteristic value and the second hash value, and broadcasts the data packet to the blockchain network where the blockchain is located.

Referring to Fig. 3, in the first embodiment of the consensus establishment method based on the lottery mechanism of the present invention, the consensus establishment method based on the lottery mechanism includes:

Step S10, determine the bookkeeping node of the last block in the blockchain, and obtain a data packet based on the bookkeeping node of the last block, the data packet at least includes a block to be connected to the last block transaction data;

In order to facilitate the understanding of the solution of the present invention, the following briefly introduces the relevant characteristics of the blockchain.

Broadly speaking, blockchain technology uses block chain data structures to verify and store data, uses distributed node consensus algorithms to generate and update data, uses cryptography to ensure the security of data transmission and access, and uses automated scripts to A new distributed infrastructure and computing paradigm for programming and manipulating data through smart contracts composed of code.

In a narrow sense, a blockchain is a series of data blocks associated with each other using cryptographic methods. It is a chained data structure that combines data blocks in a sequential manner in chronological order. Each data block contains transaction information, and each transaction in the blockchain is connected in series with two adjacent blocks through cryptographic methods, so it can be traced back to the history of any transaction, so the validity of information can be achieved. Validate and generate the next block.

The blockchain network is an end-to-end network composed of many nodes. Each device can be used as a node. Based on a set of consensus mechanisms, the nodes jointly maintain the entire blockchain through competitive calculations. Nodes can obtain a complete copy of the blockchain (blockchain in a narrow sense, which is equivalent to a database). This kind of node is generally a relay node, or only a partial copy of the blockchain can be obtained. For example, only the block header information is saved, through P2P (Point-to-point) way to find the relay node according to the map, so as to search for the required information.

All data information in the blockchain is public, and all transactions on the blockchain are visible to all nodes. Each block of the blockchain has its own accounting node.

The blockchain in this embodiment is a blockchain in a narrow sense, that is, a chained data structure in which data blocks are sequentially connected in a chronological order. The last block refers to the latest block generated by the blockchain. From the chain structure of the blockchain, the last block refers to the last block of the blockchain. The block to be accessed in this embodiment refers to a new block that is about to be created but has not yet been created.

The accounting node in the prior art refers to the node that creates the block, and the node can be single or multiple (in the case of multiple, it is in the form of a group). However, in this embodiment, the accounting node of the last block does not refer to the node that determines the transaction data of the last block, but refers to the node that determines the transaction data of the block to be accessed and has a nominal bookkeeping node with the last block. The node of the relationship, the last block is determined, and the accounting node of the last block is also determined. Determine the accounting node of the last block in the blockchain, including but not limited to the following methods: it can be determined by querying the signature information on the last block, for example, if there is a node’s private key signature, the node is the accounting node of the last block.

The data packet in this embodiment at least includes the transaction data of the block to be connected to the last block determined by the accounting node of the last block, and the data packet includes but is not limited to the following composition methods: The data packet may only contain the transaction data of the block to be accessed; it may be a set of a hash value obtained by hashing the transaction data of the block to be accessed and the transaction data of the block to be accessed; It can also be a set of the transaction data of the block to be connected and other data, such as the characteristic value of the last block and the disturbance factor, which are obtained by hashing, and the transaction data of the block to be connected, The characteristic value of the last block may refer to a hash value obtained by hashing the transaction data of the last block.

In this embodiment, each node in the blockchain network obtains a data packet based on the accounting node of the last block, and the accounting node of the last block can also obtain the data packet and participate in the block to be accessed. The election of the bookkeeping node (at this time, the bookkeeping node of the last block can directly perform the next operation on the data packet), or it can be excluded from the election. The common node directly receives the data packet broadcast by the accounting node of the last block.

Step S11, based on the obtained data packet and the self-stored node data of the node, perform a hash operation to obtain a first candidate hash value;

In this embodiment, the node data is certain, the node cannot be changed in a short time, and the data that belongs to the node to a certain extent can be the node private key or other node identification information.

After each node of the block chain receives the data packet (if the bookkeeping node of the last block participates in the election, the bookkeeping node of the last block directly performs follow-up operations on the data packet stored locally), according to the The data content contained in the data packet determines the next operation. If the data packet only contains the transaction data of the block to be accessed, certain operations can be directly performed on the transaction data of the block to be accessed. If the data packet includes Including other values in addition to the transaction data of the block to be accessed, all or part of the content in the data packet can be subjected to a certain operation, and hash operation can be performed with the self-stored node data.

Based on the data packet and the self-stored node data, the hash operation can be directly performed on all the content contained in the data packet and the respective node data, or the node data or the data packet After relevant processing, hash operation is performed.

The related processing may include but not limited to:

If the data packet only contains the transaction data of the block to be accessed, the transaction data can be hashed to obtain a hash value, and the hash value and node data can be hashed again to obtain the first candidate hash value (hereinafter referred to as HASH1); or perform a hash operation on the transaction data to obtain a hash value, and perform a hash operation on the hash value + the transaction data + node data again to obtain HASH1.

If the data packet contains the transaction data of the block to be accessed and the hash value of the transaction data, only the transaction data can be selected, and the hash value and the node data are hashed again to obtain HASH1; or The transaction data and the hash value of the transaction data are hashed to obtain a secondary hash value, and the secondary hash value + node data are hashed to obtain HASH1.

If the data packet contains not only the transaction data of the block to be accessed and the hash value of the transaction data, but also other data, such as the characteristic value of the last block, some of the data can be hashed , and then perform a hash operation on the hash result and the node data to obtain HASH1.

It is also possible to perform some operations on the node data and the data packet, and then perform hash operations on the operation results to obtain HASH1. For example, if the node data is a private key, the private key can be used to sign the data packet, and then the signed information can be hashed.

The first candidate hash value (ie HASH1) in this embodiment refers to the hash value generated by the nodes in the blockchain network for competing for bookkeeping rights.

Step S12, obtain the second candidate hash value broadcast by other nodes, select the target hash value among the first candidate hash value and the second candidate hash value according to the first preset rule, the target hash value The node is the accounting node of the block to be accessed.

The second candidate hash value (hereinafter referred to as HASH2) in this embodiment refers to the hash value generated by other nodes relative to the current node. For example, there are four nodes A, B, C, and D in the blockchain network. From the perspective of A, the candidate hash value generated by A itself is the first candidate hash value (HASH1), and the candidate hash value generated by B, C, and D The hash value is the second candidate hash value (HASH2), but from the perspective of B, the candidate hash value generated by B itself is HASH1, and the candidate hash values generated by A, C, and D are HASH2. Candidate hash value refers to the hash value generated by each node in the blockchain network in order to compete for bookkeeping rights. The first and second in this embodiment are only for distinguishing the candidate hash values generated by this node and other nodes. HASH2 can have multiple.

The first preset rule in this embodiment is a rule for determining the target hash value, which can be stored in a specific address of the blockchain, and can be directly invoked when an accounting node needs to be elected.

According to the first preset rule, it should be possible to select a unique hash value (i.e. the target hash value) among the plurality of candidate hash values, which may be the maximum value among the candidate hash values, or may be based on The size sequence number determined by a specific algorithm, such as sorting all candidate hash values by size, and determining the Nth candidate hash value as the target hash value according to a specific algorithm. The node of the target hash value refers to the node broadcasting the target hash value.

Each node in the blockchain can obtain the broadcast candidate hash value, so when determining the target hash value, each node in the blockchain can select the target from all candidate hash values according to the first preset rule hash value.

Optionally, the step of selecting a target hash value from the first candidate hash value and the second candidate hash value according to preset rules in step S12 includes:

Step S13, determining the minimum candidate hash value among the first candidate hash value and the second candidate hash value, the minimum candidate hash value being a target hash value.

In this embodiment, the first preset rule stipulates that the minimum candidate hash value is the target hash value.

Each node in the blockchain compares all the second candidate hash values (more than one HASH2) received with the first candidate hash value (HASH1) generated by the respective nodes (including the comparison between HASH2), and selects one of them The smallest hash value, which is the target hash value.

In this embodiment, the minimum candidate hash value is determined as the target hash value, because the size judgment is easy to implement, so the amount of calculation is not large, and this embodiment is easier to implement. At the same time, this embodiment clarifies the determination rules of the target hash value. Further determine the accounting node to be connected to the block.

In this embodiment, based on the accounting node of the last block, the transaction data of the block to be accessed is determined to form a data packet. Since the accounting node of the last block is determined, the block to be accessed The transaction data has a certain uniqueness and certainty, which makes the block to be connected uniquely determined, which facilitates the smooth creation of the block to be connected;

The candidate hash values (the first candidate hash value and the second candidate hash value) are obtained by each node in the blockchain network based on the respective node data and the data packet. Because of the irreversible characteristics of the hash algorithm, It can guarantee that the candidate hash value is completely unpredictable in one direction. Even if the data packet is determined based on the accounting node of the last block, the accounting node of the last block cannot adjust its own node data to make its own The candidate hash value becomes the target hash value, thus eliminating the possibility of the accounting node of the last block doing evil. At the same time, the candidate hash value is completely unpredictable in one direction, which can further enhance the randomness of the candidate hash value, that is, guarantee The bookkeeping nodes to be connected to the block are randomly generated, so that each node in the blockchain will not be in a weak position due to other factors such as computing power or rights and interests when competing for bookkeeping rights, ensuring that all nodes in the blockchain are completely equal Competing for bookkeeping rights can encourage more people to participate in the blockchain, which is conducive to the promotion and application of the blockchain; due to the irreversibility of the hash operation and the unpredictable hash value, the selection of bookkeeping nodes is similar to a A lottery mechanism, so the name of the main body of this scheme is the consensus establishment method based on the lottery mechanism;

The unique candidate hash value is determined among the selected hash values, and then the node broadcasting the unique candidate hash value is determined as the accounting node of the block to be accessed, thereby reaching a block chain consensus.

In the second embodiment of the consensus establishment method based on the lottery mechanism in the embodiment of the present invention, based on the first embodiment of the method, step S11 includes:

Step S20, obtaining the transaction data of the block to be accessed in the data packet, and performing a hash operation based on the transaction data and the characteristic value of the last block to obtain a first hash value;

Step S21: Sign the first hash value based on the self-stored private key, and perform a hash operation on the signed first hash value to obtain a first candidate hash value.

In order to determine the uniqueness of the block to be connected, its transaction data needs to be determined by a specific node. In this embodiment, the transaction data of the current block is determined by the accounting node of the previous block, that is, the block to be connected The transaction data of the last block is determined by the bookkeeping node of the last block. After the bookkeeping node of the last block determines the transaction data of the block to be connected, it sends the data packet containing at least the transaction data of the block to be connected to Blockchain webcast.

In this embodiment, the feature value of the last block refers to the hash value obtained by hashing all the content contained in the last block or the hash value obtained by hashing the transaction data set of the last block hash value.

Performing a hash operation based on the transaction data of the block to be connected and the characteristic value of the last block may refer to directly performing a hash operation on the transaction data of the block to be connected and the characteristic value of the last block, or It may refer to performing pre-processing on the transaction data of the block to be connected and the characteristic value of the last block before performing a hash operation, and the pre-processing may refer to performing a hash operation on the transaction data of the block to be connected to.

Each node in the blockchain network can obtain a copy of the blockchain, so the characteristic value of the last block can be obtained by itself. Because the first hash value is obtained by performing hash operations based on the transaction data of the access block and the characteristic value of the last block, the first hash values generated by all nodes in the blockchain network are equal.

After obtaining the first hash value, each node in the blockchain network uses its own private key to sign the first hash value, and then performs hash operation on the signed first hash value to obtain HASH1.

In this embodiment, each node generates a first hash value based on the transaction data of the block to be accessed in the data packet, and then generates a candidate hash value for election based on the signature result of the first hash value by the private key. Hash value, because of the irreversibility of the hash operation, two hash operations can further enhance the unpredictability of the hash value, which can prevent the accounting nodes of the last block from doing evil, and can also ensure the random generation of candidate hash values. The election bookkeeping nodes can be completely random, and each node can run fairly and have equal opportunities to attract more people to use the blockchain and promote the development of the blockchain.

Referring to FIG. 4, in the third embodiment of the consensus establishment method based on the lottery mechanism of the present invention, based on the first embodiment or the second embodiment of the method, after step S10, it also includes:

Step S30, query the historical transaction data in the block chain;

Step S31, according to the historical transaction data in the block chain, verify whether all the transaction data in the block to be accessed in the data packet are valid;

Step S32, if all the transaction data of the blocks to be accessed in the data packet are valid, execute the hash operation based on the obtained data packet and the node data stored by the node to obtain the first candidate hash Hash steps;

Step S33, if there is invalid transaction data in the transaction data of the block to be accessed in the data packet, the data packet is invalid, and the accounting node of the last block is re-determined.

To analyze the data packet, first verify whether the transaction data of the blocks to be accessed are all valid, because each block contains transaction information, and each transaction in the block chain is cryptographically linked to two adjacent blocks. Therefore, it can be traced back to the history of any transaction, so each participating node can verify the pending transactions in the data through the historical transaction data stored in the self-stored complete blockchain or part of the blockchain. Whether all the transaction data entered into the block is valid.

If all the transaction data is valid, hash operation is performed based on the data packet and the self-stored node data, and the hash operation can be directly performed on all the content in the data packet and the self-stored node data, or the Part of the content in the data packet and the self-stored node data can be hashed, or the data packet and the self-stored node data can be pre-processed and then hashed, for example, to obtain the pending data in the data packet The transaction data into the block, the transaction data in the data packet to be connected to the block is hashed to obtain the hash value, each node uses the private key to sign the hash value, and the signature result is hashed operation.

If there is invalid transaction data in the transaction data of the block to be accessed in the data packet, because the transaction data of the block to be accessed is obtained based on the accounting node of the last block, an invalid transaction occurs, It shows that there is a possibility that the bookkeeping node of the last block is an evil node. In order to reduce the evil of the evil node, a certain penalty is imposed on the bookkeeping node of the last block. Punishment measures can be fined or deprived of bookkeeping rights, and the bookkeeping nodes of the last block need to be re-determined.

This embodiment verifies whether all the transaction data of the blocks to be accessed in the data packet are valid. If all the transaction data of the blocks to be accessed in the data packet are valid, the data packet is digitally signed, and then the The signed data packet is hashed to obtain the first candidate hash value and participate in the election; if there is invalid transaction data in the data packet, it is because the transaction data in the data packet is determined by the accounting node of the last block , therefore, there is a possibility that the bookkeeping node of the last block is an evil node, so the data packet determined by the bookkeeping node of the last block is invalid, and the bookkeeping node of the last block is re-determined. The validity of the above transaction data can eliminate the possibility of evil nodes doing evil, and can also increase the cost of evil nodes to reduce the possibility of nodes doing evil and maintain the normal operation of the blockchain; at the same time, based on the data packets and the nodes themselves The stored unique node data can be hashed to ensure that the only first candidate hash value can be obtained, and the subsequent unique target hash value can be determined, and then the accounting node to be connected to the block can be successfully determined.

In the fourth embodiment of the consensus establishment method based on the lottery mechanism of the present invention, based on the first embodiment or the second embodiment or the third embodiment of the method, in step S12, obtain the second candidate hash value broadcast by other nodes After the steps also include:

Step S40, based on the first candidate hash value and the second candidate hash value, judge whether the first candidate hash value satisfies the broadcast condition according to a second preset rule;

The second preset rule in this embodiment refers to a rule for determining the target hash value. The second preset rule can be stored in a specific address of the block chain, and the second preset rule can be directly invoked when the accounting node needs to be determined. The second preset rule may be, but not limited to: select the largest candidate hash value among the candidate hash values; select the smallest candidate hash value; obtain the unique candidate hash value according to a certain algorithm.

The broadcast condition in this embodiment needs to be determined according to the second preset rule. For example, if the second preset rule is to obtain the largest candidate hash value among the candidate hash values, the broadcast condition may be: the first candidate hash value is greater than the second candidate hash value.

Specifically, the step of judging whether the first candidate hash value satisfies the broadcast condition according to the second preset rule in step S40 includes:

Step S41, analyzing the second preset rule, when the analysis result is that the minimum candidate hash value among the candidate hash values is the target hash value, if the first candidate hash value is smaller than the second candidate hash value , then the first candidate hash value satisfies the broadcast condition.

Analyze the second preset rule. In this embodiment, the second preset rule is: the smallest candidate hash value among the candidate hash values is the target hash value, and the broadcast condition is that the first candidate hash value is less than the second candidate hash value hash value. Because the default rule stipulates that the minimum candidate hash value is the target hash value, when the first candidate hash value is greater than the second candidate hash value, the node with the first candidate hash value cannot successfully compete to Bookkeeping rights, so the first candidate hash value does not need to be broadcast. (The amount of data is reduced, saving computing resources) If the first candidate hash value is smaller than the second candidate hash value, the node of the first candidate hash value may also compete for the accounting right, and at this time the first candidate hash value needs to be broadcast Candidate hash value.

In this embodiment, the preset rule determines that the broadcast condition is that the first candidate hash value is smaller than the second candidate hash value, so that a round of comparison can be performed at each node in the blockchain first, and when the first candidate hash value is smaller than the second candidate hash value, because the node of the first candidate hash value still has the possibility of winning the competition, so the first candidate hash value can be broadcast, the first candidate hash value meets the broadcast condition, and the determination can be made The calculation of the target hash value is distributed to each node in the blockchain to improve the efficiency of the election.

Step S42, if the first candidate hash value satisfies the broadcast condition, then broadcast the first candidate hash value to the blockchain network where the blockchain is located.

If the first candidate hash value satisfies the broadcast condition, indicating that the first candidate hash value may compete to become the accounting node of the block to be accessed, the first candidate hash value needs to be sent to the block The blockchain network where the chain is located broadcasts to participate in the election of bookkeeping nodes. If the first candidate hash value does not meet the broadcast condition, there is no need to broadcast the first candidate hash value to the blockchain network where the blockchain is located

In this embodiment, by setting the broadcast conditions, the first round of screening is performed at each node of the blockchain, and the candidate hash values of nodes that are promising nodes to be entered into the block accounting node are broadcast, which can reduce the amount of calculation and improve Election efficiency, select the accounting nodes to be connected to the block as soon as possible.

Referring to FIG. 5, in the fifth embodiment of the consensus establishment method based on the lottery mechanism of the present invention, based on the first embodiment or the second embodiment or the third embodiment or the fourth embodiment of the method, before step S10 includes:

Step S50, the accounting node of the last block determines the transaction data of the block to be connected to the last block;

Step S51, the accounting node of the last block generates a data packet based on the transaction data of the block to be accessed, and broadcasts the data packet to the blockchain network where the block chain is located.

In this embodiment, the accounting node of the last block determines the transaction data of the block to be connected and the connection sequence of each transaction, and generates a data packet based on the transaction data of the block to be connected. In this embodiment, a data packet is generated based on the transaction data of the block to be accessed. The data packet should at least contain the transaction data of the block to be accessed. The data packet includes but is not limited to the following composition methods: The data packet may only contain the transaction data of the block to be accessed; it may be a set of the hash value obtained by hashing the transaction data of the block to be accessed and the transaction data of the block to be accessed; or It is a set of the hash value obtained by hashing the transaction data of the block to be connected and other data, such as the characteristic value or disturbance factor of the last block and the transaction data of the block to be connected, where the last The feature value of a bit block may refer to a hash value obtained by hashing the transaction data of the last bit block.

After the data packet is generated, it needs to be broadcast to the blockchain network so that other nodes can obtain it.

In this embodiment, the transaction data of the block to be connected and the connection order of each transaction are determined by the accounting node of the last block, so as to ensure the uniqueness of the transaction data of the block to be connected, so that the block to be connected can be processed smoothly. Generate; generate a data packet based on the transaction data of the block to be connected, broadcast to the blockchain network, and initiate the election of the bookkeeping node of the block to be connected, so as to successfully select the bookkeeping node of the block to be connected.

Specifically, referring to FIG. 6, step S51 includes:

Step S52, the accounting node of the last block performs a hash operation to obtain a second hash value based on the transaction data and the characteristic value of the last block;

Step S53, the accounting node of the last block generates a data packet based on the transaction data, the characteristic value and the second hash value, and broadcasts the data packet to the blockchain network where the blockchain is located.

In this embodiment, a composition mode of the data packet is determined, that is, the data packet includes the transaction data of the block to be accessed, the characteristic value of the last block, and the second hash value. Wherein, the second hash value refers to a hash value obtained by hashing the transaction data of the aforementioned block to be accessed and the feature value of the last block.

In this embodiment, the transaction data of the block to be accessed obtained by the accounting node based on the last block and the characteristic value of the last block are hashed, and the hash operation value and the last block The eigenvalues and transaction data are combined into a data packet broadcast. Each node in the blockchain can perform a second hash operation based on the hash value that includes one hash operation. Because of the irreversibility of the hash operation, two hash operations can further enhance the unpredictability of the hash value. It can prevent the accounting node of the last block from doing evil; at the same time, this embodiment uses the characteristic value of the last block as the content of the data packet, and can establish the connection between the last block and the block to be connected, thereby ensuring the The connection between the input block and the blockchain, and the transaction data of the block to be accessed as part of the data package can ensure the smooth generation of the block to be accessed.

Further, in order to facilitate the understanding of this solution, a sixth embodiment of the consensus establishment method based on the lottery mechanism is proposed. FIG. 7 is a schematic diagram of a scene of the sixth embodiment, and FIG. 8 is a schematic flowchart of the sixth embodiment.

In the blockchain network, as long as the node is online, it can submit the transaction data recorded by itself, or submit the disturbance factor or do nothing. In Figure 6, A, B, C, and D are all online nodes in the blockchain network. Both A and B have transaction data input, D has an input disturbance factor, and C has no input. Fig. 6 only shows some nodes (A\B\C\D), and also includes other nodes not shown.

The Nth block shown in Figure 6 is the last block, the following N+1th block is the block to be connected, and the data input of A, B, C, and D in the middle is the transaction of the block to be connected data.

First determine the bookkeeping node of the Nth block, and the transaction data of the block to be accessed is determined by the bookkeeping node of the Nth block (as shown in A, B, C, D data input in Figure 6), and the Nth block The characteristic value of the block is the hash value of the Nth block plus the transaction data to be connected to the block for hash operation, and the first hash result is obtained. After being signed by the bookkeeping node of the Nth block, the all The first hash result and the transaction data of the block to be accessed are broadcast to the blockchain network where the A, B, C, and D nodes are located.

After each node in the blockchain network receives the hash value broadcast by the accounting node of the Nth block and the transaction data of the block to be connected, it verifies whether all the transaction data of the block to be connected are valid, if all are valid, Then each node signs the first hash result with its own private key, and performs a hash operation on the signature result again, and each node obtains a second hash result (denoted as 2HASH).

Each node conducts lottery election based on the 2HASH, and the implementation process is as follows:

1. Any node (such as A) first broadcasts itself to calculate 2HASH-A;

2. Other nodes (such as B) calculate their own result 2HASH-B and compare it with 2HASH-A;

3. If 2HASH-B<2HASH-A, then broadcast 2HASH-B, otherwise no broadcast means (B node) lottery election failure;

4. Other nodes make similar judgments as Node B, and finally select N+1 accounting nodes.

Further, referring to FIG. 9 , in order to facilitate understanding of this solution, a seventh embodiment of a method for establishing a consensus based on a lottery mechanism is proposed.

Step S50, the accounting node of the last block determines the transaction data of the block to be connected to the last block;

Step S52, the accounting node of the last block performs a hash operation to obtain a second hash value based on the transaction data and the characteristic value of the last block;

Step S53, the accounting node of the last block generates a data packet based on the transaction data, the characteristic value and the second hash value, and broadcasts the data packet to the blockchain network where the blockchain is located;

Step S10, determine the bookkeeping node of the last block in the blockchain, and obtain a data packet based on the bookkeeping node of the last block, the data packet at least includes a block to be connected to the last block transaction data;

Step S30, query the historical transaction data in the block chain;

Step S31, according to the historical transaction data in the block chain, verify whether all the transaction data in the block to be accessed in the data packet are valid;

Step S32, if all the transaction data of the blocks to be accessed in the data packet are valid, execute step S20;

Step S33, if there is invalid transaction data in the transaction data of the block to be accessed in the data packet, the data packet is invalid, and the accounting node of the last block is re-determined;

Step S20, obtaining the transaction data of the block to be accessed in the data packet, and performing a hash operation based on the transaction data and the characteristic value of the last block to obtain a first hash value;

Step S21, signing the first hash value based on the self-stored private key, and performing a hash operation on the signed first hash value to obtain a first candidate hash value;

Step S121, obtaining the second candidate hash value broadcast by other nodes,

Step S41, analyzing the second preset rule based on the first candidate hash value and the second candidate hash value, when the result of the analysis is the target hash value of the minimum candidate hash value among the candidate hash values, if If the first candidate hash value is smaller than the second candidate hash value, the first candidate hash value satisfies the broadcast condition;

Step S42, if the first candidate hash value satisfies the broadcast condition, then broadcast the first candidate hash value to the blockchain network where the blockchain is located;

Step S13, determining the smallest candidate hash value among the first candidate hash value and the second candidate hash value, the smallest candidate hash value being a target hash value;

Step S123, the node of the target hash value is the accounting node of the block to be accessed.

In addition, the embodiment of the present invention also proposes a storage medium, on which a consensus establishment program based on a lottery mechanism is stored, and when the consensus establishment program based on a lottery mechanism is executed by a processor, the above-mentioned embodiment can be implemented. step. Since the specific embodiments of the storage medium of the present invention are basically the same as the embodiments of the above-mentioned identity authentication method, details are not described here.

It should be noted that some of the technical features described in all the embodiments of the present invention can be combined with each other.

As used herein, the terms "comprises," "comprises," or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, article, or system that includes a set of elements includes not only those elements, but also includes the elements not expressly included. other elements listed, or also include elements inherent in such a process, method, article, or system. Without further limitations, an element defined by the phrase "comprising a..." does not preclude the presence of additional identical elements in the process, method, article or system comprising that element.

The serial numbers of the above embodiments of the present invention are for description only, and do not represent the advantages and disadvantages of the embodiments.

Through the description of the above embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus a necessary general-purpose hardware platform, and of course also by hardware, but in many cases the former is better implementation. Based on such an understanding, the technical solution of the present invention can be embodied in the form of a software product in essence or in other words, the part that contributes to the prior art, and the computer software product is stored in a storage medium (such as ROM/RAM) as described above. , magnetic disk, optical disk), including several instructions to make a terminal device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) execute the method described in each embodiment of the present invention.

The above are only preferred embodiments of the present invention, and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made by using the description of the present invention and the contents of the accompanying drawings, or directly or indirectly used in other related technical fields , are all included in the scope of patent protection of the present invention in the same way.

Claims (10)

1. A kind of 1. common recognition method for building up based on lottery mechanism, it is characterised in that including：

   The accounting nodes of last position block in block chain are determined, based on the accounting nodes of last position block, obtain packet, the data Bag comprises at least the transaction data for the block to be accessed for preparing to be connected with last position block；

   The packet and this node based on acquisition carry out Hash operation and obtain first candidate's Hash from the node data deposited Value；

   Second candidate's cryptographic Hash of other node broadcasts is obtained, according to the first preset rules in the first candidate cryptographic Hash and Selection target cryptographic Hash in two candidate's cryptographic Hash, the node of the target cryptographic Hash are the accounting nodes of the block to be accessed.
2. 2. the common recognition method for building up based on lottery mechanism as claimed in claim 1, it is characterised in that described according to preset rules Include in first candidate's cryptographic Hash and second candidate's cryptographic Hash the step of selection target cryptographic Hash：

   Candidate's cryptographic Hash of minimum, minimum candidate's Hash are determined in the first candidate cryptographic Hash and second candidate's cryptographic Hash It is worth for target cryptographic Hash.
3. 3. the common recognition method for building up based on lottery mechanism as claimed in claim 1, it is characterised in that the institute based on acquisition Packet and this node are stated from the node data deposited, carrying out the step of Hash operation obtains first candidate's cryptographic Hash includes：

   The transaction data of block to be accessed in the packet is obtained, is carried out based on the characteristic value of the transaction data and last position block Hash operation, obtain the first cryptographic Hash；

   First cryptographic Hash is signed based on the private key deposited certainly, first cryptographic Hash after signature is subjected to Hash fortune Calculate, obtain first candidate's cryptographic Hash.
4. 4. the common recognition method for building up based on lottery mechanism as claimed in claim 1, it is characterised in that the acquisition packet Also include after step：

   Whether according to the historical trading data in block chain, verifying the transaction data of block to be accessed in the packet all has Effect；

   If the transaction data of block to be accessed is all effective described in the packet, the data based on acquisition are performed Bag and this node carry out the step for Hash operation obtains first candidate's cryptographic Hash from the node data deposited.
5. 5. the common recognition method for building up based on lottery mechanism as claimed in claim 1, it is characterised in that described other nodes of acquisition Also include after the step of second candidate's cryptographic Hash of broadcast：

   Based on the first candidate cryptographic Hash and second candidate's cryptographic Hash, judge that first candidate breathes out according to the second preset rules Whether uncommon value meets broadcast conditional；

   If the first candidate cryptographic Hash meets broadcast conditional, by where the first candidate cryptographic Hash to the block chain Block chain network is broadcasted.
6. 6. the common recognition method for building up based on lottery mechanism as claimed in claim 5, it is characterised in that described default according to second The step of whether first candidate's cryptographic Hash meets broadcast conditional described in rule judgment includes：

   The second preset rules are parsed, when analysis result is that minimum candidate's cryptographic Hash in candidate's cryptographic Hash is target cryptographic Hash, If the first candidate cryptographic Hash is less than the second candidate cryptographic Hash, the first candidate cryptographic Hash meets broadcast conditional.
7. 7. the common recognition method for building up based on lottery mechanism as claimed in claim 1, it is characterised in that in the determination block chain The accounting nodes of last position block, based on the accounting nodes of last position block, include before the step of obtaining packet：

   The accounting nodes of the last position block determine the transaction data for the block to be accessed that preparation is connected with last position block；

   The transaction data of the accounting nodes of last position block based on the block to be accessed, packet is generated, by the packet Broadcasted to the block chain network where block chain.
8. 8. the common recognition method for building up based on lottery mechanism as claimed in claim 7, it is characterised in that the note of the last position block Transaction data of the account node based on the block to be accessed, packet is generated, by the packet to the block chain where block chain The step of Web broadcast, includes：

   Characteristic value of the accounting nodes of the last position block based on the transaction data and last position block, carry out Hash operation and obtain Second cryptographic Hash；

   The accounting nodes of the last position block are based on the transaction data, characteristic value and the second cryptographic Hash generation packet, and will The packet is broadcasted to the block chain network where the block chain.
9. 9. a kind of block catenary system, it is characterised in that the block catenary system includes multiple nodes, and the node includes：Storage Device, processor and it is stored in the common recognition based on lottery mechanism that can be run on the memory and on the processor and establishes journey Sequence, the common recognition based on lottery mechanism are established program and realized during the computing device such as any one of claim 1 to 8 The step of described method.
10. 10. a kind of storage medium, it is characterised in that the common recognition based on lottery mechanism is stored with the storage medium and establishes journey Sequence, the common recognition based on lottery mechanism are established and realized when program is executed by processor as any one of claim 1 to 8 The common recognition method for building up based on lottery mechanism the step of.