CN107566124B - Hash operation-based consensus establishing method, block chain system and storage medium - Google Patents

Abstract

The invention discloses a consensus building method based on a lottery mechanism, a blockchain system and a storage medium. The method includes: determining an accounting node of the last block in the blockchain, and an accounting node based on the last block , obtain a data packet, the data packet contains at least the transaction data of the block to be accessed that is prepared to be connected with the last block; a candidate hash value; obtain a second candidate hash value broadcast by other nodes, and select a target hash value from 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 invention can ensure that each node in the blockchain competes for the bookkeeping right completely and equally, and can encourage more people to participate in the blockchain, which is beneficial to the application and promotion of the blockchain.

Description

Consensus establishment method, blockchain system and storage medium based on hash operation

technical field

The present invention relates to the technical field of blockchain, in particular to a consensus establishment method based on hash operation, a blockchain system and a storage medium.

Background technique

The blockchain is a distributed database system participated by nodes, which can also be understood as a ledger system, which is completed by all nodes in the blockchain network through independent competition. Consensus mechanism is the core of blockchain technology, which makes a decentralized ledger system like blockchain possible. The two core factors of consensus mechanism and decentralization are the key to the expansion of blockchain's endogenous capabilities.

In a centralized structural system, the consensus of the system is determined by the center, and each participant only needs to obey the center, so the establishment of consensus is extremely efficient, while in a decentralized structural system, due to the various participation of the system The status of each party is equal, and how to reach a consensus when there is a disagreement becomes a problem.

At present, the commonly used blockchain consensus mechanisms include workload proof, equity proof and so on. Among them, the core implementation of the proof of stake is as follows: when the accounting node generates a new block, it attaches its own address to the block to prove the proportion of equity it occupies, and the accounting node also needs to use the private address corresponding to the address. The key signs part of the block information to prove that it actually owns the assets of the address. This consensus mechanism tends to hold nodes with large stakes in the system, which can easily lead to corruption and is not conducive to attracting more groups to use the blockchain.

SUMMARY OF THE INVENTION

The main purpose of the present invention is to provide a consensus building method based on hash operation, which aims to solve the problem that the proof-of-stake consensus mechanism tends to hold large stakes in the system, which is easy to lead to corruption and is not conducive to attracting more groups to use the blockchain. technical issues.

In order to achieve the above object, the present invention provides a consensus establishment method based on hash operation, the method includes:

Determine the accounting node of the last block in the blockchain, and obtain a data packet based on the accounting node of the last block, and the data packet at least contains the transaction data of the block to be accessed that is to be connected to the last block. ;

Based on the acquired data packet and the node data stored by the node, a hash operation is performed to obtain a first candidate hash value;

Obtain the 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 the first preset rule, and the node of the target hash value is the Describe the accounting node of the block to be accessed.

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 a preset rule includes:

The smallest candidate hash value is determined among the first candidate hash value and the second candidate hash value, and the smallest candidate hash value is the 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 acquired data packet and the node data stored by the node itself includes:

Obtain the transaction data of the block to be accessed in the data packet, and perform 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 the signed first hash value is subjected to a hash operation to obtain a first candidate hash value.

In one of the embodiments, the step of acquiring the data packet includes:

According to the historical transaction data in the blockchain, verify whether the transaction data of the block to be accessed in the data packet is all 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 acquired data packet and the node data stored by the node itself to obtain the first candidate hash value .

In one of the embodiments, the step of obtaining 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 the 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 embodiment, the step of judging whether the first candidate hash value satisfies the broadcast condition according to the second preset rule includes:

Parse 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 embodiment, the determining the accounting node of the last block in the blockchain, based on the accounting node of the last block, before the step of acquiring the data packet includes:

The accounting node of the last block determines the transaction data of the block to be accessed that is to be connected with 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 embodiment, 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. include:

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

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 blockchain system, the blockchain system includes a plurality of nodes, and the nodes include: a memory, a processor, and storage on the memory and available in the A consensus establishment program based on hash operation running on the processor, when the consensus establishment program based on hash operation is executed by the processor, the steps of the above consensus establishment method based on hash operation 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 hash operation is stored, and when the consensus establishment program based on hash operation is executed by a processor, the above-mentioned Steps of a hash-based consensus building method.

In the embodiment of the present invention, the transaction data of the block to be accessed is determined based on the accounting node of the last block to form a data packet. Because the accounting node of the last block is determined, the transaction of the block to be accessed is determined. The data has a certain uniqueness and certainty, so that the block to be accessed is uniquely determined, which facilitates the smooth creation of the block to be accessed; each node in the blockchain network conducts hashing based on their own node data and the data packet. The candidate hash value (the first candidate hash value and the second candidate hash value) is obtained by the hash operation. Because of the irreversible characteristics of the hash algorithm, the candidate hash value can be guaranteed to be completely one-way unpredictable, even if the data packet is based on the last bit area. It is determined by the accounting node of the block, and the accounting node of the last block cannot adjust its own node data to cheat so that its candidate hash value becomes the target hash value, thus excluding the accounting node of the last block. It is possible for the account node to do evil, and at the same time, the candidate hash value is completely one-way unpredictable, which can further enhance the randomness of the candidate hash value, that is, to ensure that the account nodes to be connected to the block are randomly generated, making the blockchain Each node is not in a disadvantaged position due to other factors such as computing power or rights when competing for accounting rights, ensuring that all nodes in the blockchain compete for accounting rights completely and equally, which can encourage more people to participate in the blockchain, which is beneficial to The promotion and application of blockchain; because the hash operation is irreversible and the hash value is unpredictable, the selection of accounting nodes is similar to a lottery mechanism, so the main name of this scheme is the consensus establishment method based on hash operation; A 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 as the billing node of the block to be accessed, thereby reaching a blockchain consensus.

Description of drawings

1 is a schematic diagram of a blockchain system according to an embodiment of the present invention;

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

3 is a schematic flowchart of a first embodiment of a method for establishing a consensus based on hash operation according to the present invention;

4 is a schematic flowchart of a third embodiment of a method for establishing a consensus based on hash operation according to the present invention;

5 is a schematic flowchart of a fifth embodiment of a consensus building method based on hash operation of the present invention;

FIG. 6 is a schematic flowchart of the refinement of step S51 in FIG. 5 according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of a scenario of a sixth embodiment of a hash operation-based consensus building method according to the present invention;

8 is a schematic flowchart of a sixth embodiment of a method for establishing a consensus based on hash operation according to the present invention;

FIG. 9 is a schematic flowchart of a seventh embodiment of a method for establishing a consensus based on hash operation according to the present invention.

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

Detailed ways

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

In the following description, suffixes such as 'module', 'component' or 'unit' used to represent elements are used only to facilitate the description of the present invention and have no specific meaning per se. Thus, "module", "component" or "unit" may be used interchangeably.

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 multiple nodes. When a new block is created, one or some nodes execute a specific program or a specific function, which is recorded as an accounting node in the embodiment of the present invention, and other nodes in the blockchain system. For ordinary nodes, each created block has its own accounting node. Accounting nodes and ordinary nodes are not fixed and specific nodes, but will change according to the consensus algorithm of the blockchain.

The accounting node is used for:

Determine the transaction data of the block to be accessed that is 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 accounting node or common node is used for:

Determine the accounting node of the last block in the blockchain, and obtain a data packet based on the accounting node of the last block, and the data packet at least contains the transaction data of the block to be accessed that is to be connected to the last block. ;

Based on the acquired data packet and the node data stored by the node, a hash operation is performed to obtain a first candidate hash value;

Obtain the 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 the first preset rule, and the node of the target hash value is the Describe the accounting node of the block to be accessed.

The node terminal can be a server, a PC, or a smart phone, a tablet computer, an e-book reader, an MP3 (Moving Picture Experts Group Audio Layer III, moving picture expert compression standard audio layer 3) player, an MP4 (Moving Picture Experts Group Audio Layer IV, moving image expert compression standard audio layer 3) Players, portable computers and other portable 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 . Among them, the communication bus 1002 is used to realize the 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 (eg, a WI-FI interface). The memory 1005 may be high-speed RAM memory, or may be non-volatile memory, such as 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 FIG. 1 and the node terminal structure shown in FIG. 2 do not constitute a limitation on the system or the node terminal, and may include more or less components than those shown in the drawings , or a combination of certain components, or a different arrangement 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, which is a computer storage medium, includes a hash operation-based consensus building program.

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.

And the processor 1001 can be used to call the hash operation-based consensus establishment program stored in the memory 1005, and perform the following operations:

Determine the accounting node of the last block in the blockchain, and obtain a data packet based on the accounting node of the last block, and the data packet at least contains the transaction data of the block to be accessed that is to be connected to the last block. ;

Based on the acquired data packet and the node data stored by the node, a hash operation is performed to obtain a first candidate hash value;

Obtain the 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 the first preset rule, and the node of the target hash value is the Describe the accounting node of the block to be accessed.

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

The smallest candidate hash value is determined among the first candidate hash value and the second candidate hash value, and the smallest candidate hash value is the target hash value.

The step of performing a hash operation to obtain the first candidate hash value based on the acquired data packet and the node data stored by the node itself includes:

Obtain the transaction data of the block to be accessed in the data packet, and perform 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 the signed first hash value is subjected to a hash operation 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 blockchain, verify whether the transaction data of the block to be accessed in the data packet is all valid;

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

The step of obtaining the second candidate hash value broadcast by other nodes further includes:

Based on the first candidate hash value and the second candidate hash value, determine whether the first candidate hash value satisfies the 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:

Parse 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 determining the accounting node of the last block in the blockchain, based on the accounting node of the last block, before the step of acquiring the data packet includes:

The accounting node of the last block determines the transaction data of the block to be accessed that is to be connected with 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 billing node of the last block generates a data packet based on the transaction data of the block to be accessed, and the steps of broadcasting the data packet to the blockchain network where the blockchain is located include:

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

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 method for establishing consensus based on hash operation of the present invention, the method for establishing consensus based on hash operation includes:

Step S10, determining the accounting node of the last block in the blockchain, and obtaining a data packet based on the accounting node of the last block, the data packet at least containing the block to be accessed that is 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 features of the blockchain.

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

In a narrow sense, a blockchain is a series of data blocks that are associated using cryptographic methods. Each data block contains transaction information, and each transaction in the blockchain is concatenated with two adjacent blocks through cryptographic methods, so it can be traced back to the history of any transaction, so it can realize the validity of information. 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 consensus mechanism, the nodes jointly maintain the entire blockchain through competitive computing. Nodes can obtain a complete copy of the blockchain (blockchain in the narrow sense, 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, and the P2P (Peer-to-peer) 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 chain data structure formed by combining data blocks in a sequential manner according to time sequence. 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 to be created but not yet created.

An accounting node in the prior art refers to a node that creates a block, and the node may be single or multiple (in the case of multiple, the node is in the form of a small 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 nominal accounting 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. Determining the accounting node of the last block in the blockchain includes but is not limited to the following methods: It can be determined by querying the signature information on the last block. For example, if the last block has a 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 accessed that is determined by the accounting node of the last block and is prepared to be connected to the last block, and the data packet includes but is not limited to the following several composition modes: The data packet may only contain the transaction data of the block to be accessed; it may be a collection of a hash value obtained by performing a hash operation on 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 hash values obtained by hashing the transaction data of the block to be accessed and other data, such as the characteristic value of the last block and the disturbance factor, and the transaction data of the block to be accessed, 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 the 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 accounting node (at this time, the accounting node of the last block can directly perform the next operation on the data packet), or it can be excluded from the election. The ordinary node directly receives the data packet broadcast by the accounting node of the last block.

Step S11, based on the acquired data packet and the node data stored by the node itself, perform a hash operation to obtain a first candidate hash value;

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

After each node of the blockchain receives the data packet (if the accounting node of the last block participates in the election, the accounting node of the last block directly performs subsequent operations on the data packet stored locally), it can be 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, a certain operation can be directly performed on the transaction data of the block to be accessed. If other values are included in addition to the transaction data of the block to be accessed, all or part of the content in the data packet may be subjected to a certain operation, and then a hash operation may be performed with the self-stored node data.

The hash operation is performed based on the data packet and the self-stored node data, which may be to directly perform a hash operation on all the contents contained in the data packet and the respective node data, or to perform a hash operation on the node data or the data packet. After the relevant processing is performed, the hash operation is performed.

The relevant processing may include, but is 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 the 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 hash value of the transaction data in the data packet can be selected, and the hash value and the node data can be hashed again to obtain HASH1; or the transaction data and the hash value of the transaction data can be hashed to obtain a secondary hash value, and the secondary hash value + node data can be hashed to obtain HASH1.

If the data packet includes 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 after , and then perform a hash operation on the hash result and the node data to obtain HASH1.

After some operations are performed on the node data and the data packet, a hash operation may be performed on the operation result 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 a hash value generated by nodes in the blockchain network competing for the accounting right.

Step S12: Obtain the second candidate hash value broadcasted by other nodes, and select a target hash value from the first candidate hash value and the second candidate hash value according to the first preset rule. 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 a hash value generated by other nodes relative to this 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 is the first candidate hash value (HASH1). 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 value generated by A, C, and D is HASH2. The candidate hash value refers to the hash value generated by each node in the blockchain network in order to compete for the accounting rights. The first and second in this embodiment are only candidate hash values generated by distinguishing this node from other nodes. HASH2 can have more than one.

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 the first preset rule 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 (that is, 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 according to the specific algorithm as the target hash value. The node of the target hash value refers to the node that broadcasts 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 the candidate hash values according to the first preset rule hash value.

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

Step S13: Determine the smallest candidate hash value among the first candidate hash value and the second candidate hash value, where the smallest candidate hash value is the target hash value.

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

Each node in the blockchain compares the size of all the second candidate hash values (more than one HASH2) received with the first candidate hash value (HASH1) generated by their respective nodes (including the comparison between HASH2), and selects one of them. The smallest hash value, 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, the amount of calculation is not large. This embodiment is relatively easy to implement. At the same time, this embodiment clarifies the determination rules for the target hash value. Further determine the accounting node of the block to be accessed.

In this embodiment, the transaction data of the block to be accessed is determined based on the accounting node of the last block to form a data packet. Because the accounting node of the last block is determined, the block to be accessed is determined. The transaction data has certain uniqueness and certainty, so that the block to be accessed is uniquely determined, which is convenient for the smooth creation of the block to be accessed;

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 by performing hash operations. Because of the irreversible characteristics of the hash algorithm, It can ensure that the candidate hash value is completely one-way unpredictable. 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 cheat its own node data. The candidate hash value becomes the target hash value, thus eliminating the possibility of malicious acts by the accounting node of the last block. At the same time, the candidate hash value is completely one-way unpredictable, which can further enhance the randomness of the candidate hash value, that is, guarantee The accounting 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 when competing for accounting rights, and ensure that all nodes in the blockchain are completely equal. Competing for the right to bookkeeping 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 unpredictability of the hash value, the selection of accounting nodes is similar to that of a A lottery mechanism, so the name of the main body of this scheme is a consensus building method based on hash operation;

A unique candidate hash value is determined among the candidate hash values, and then the node that broadcasts the unique candidate hash value is determined as the billing node of the block to be accessed, thereby reaching a blockchain consensus.

In the second embodiment of the hash operation-based consensus establishment method according to the embodiment of the present invention, based on the first embodiment of the method, step S11 includes:

Step S20, acquiring 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 accessed, 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 accessed. The transaction data of the last block is determined by the accounting node of the last block. After the accounting node of the last block determines the transaction data of the block to be accessed, it sends the data packet containing at least the transaction data of the block to be accessed to the Blockchain webcast.

In this embodiment, the characteristic value of the last block refers to a hash value obtained by performing a hash operation on all the contents contained in the last block or a hash value obtained by performing a hash operation on the set of transaction data of the last block. hash value.

Performing a hash operation based on the transaction data of the block to be accessed 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 accessed and the characteristic value of the last block, or It can refer to pre-processing the transaction data of the block to be accessed and the characteristic value of the last block and then performing a hash operation, and the pre-processing can refer to performing a hash operation on the transaction data of the block to be accessed.

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 a hash operation 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 signs the first hash value with its own private key, and then performs a 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 result of signing the first hash value with 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, prevent the accounting node of the last block from doing evil, and also ensure the random generation of candidate hash values. The election bookkeeping node can be completely random, each node is fair and has equal opportunities, attracting more people to use the blockchain and promoting the development of the blockchain.

Referring to FIG. 4 , in the third embodiment of the hash operation-based consensus establishment method of the present invention, based on the first embodiment or the second embodiment of the method, after step S10, the method further includes:

Step S30, query the historical transaction data in the blockchain;

Step S31, according to the historical transaction data in the blockchain, verify whether the transaction data of the block to be accessed in the data packet is all valid;

Step S32, if all the transaction data of the to-be-accessed block in the data packet are valid, execute the hash operation based on the acquired data packet and the node data stored by the node itself, and obtain the first candidate hash. the value of the steps;

Step S33, if invalid transaction data exists 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.

Parse the data packet, first verify whether the transaction data of the block to be accessed is all valid, because each block contains transaction information, and each transaction in the blockchain is encrypted with the adjacent two through the cryptographic method. Each block is connected in series, so it can be traced back to the history of any transaction, so each participating node can verify the pending transaction data in the data through the self-stored complete blockchain or historical transaction data stored in the partial blockchain. Whether the transaction data entered into the block is all valid.

If all the transaction data are valid, hash operation is performed based on the data packet and the self-stored node data, and all contents in the data packet and the self-stored node data can be directly hashed, or all the data in the data packet can be directly hashed. Hash operation is performed on part of the content in the data packet and the self-stored node data, or the data packet and the self-stored node data can also be pre-processed and then hashed, for example, to obtain the pending data in the data packet. Enter the transaction data of the block, hash the transaction data of the block to be accessed in the data packet to obtain a hash value, and each node uses the private key to sign the hash value, and then hash the signature result. 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 means that there is a possibility that the accounting node of the last block is an evil node. In order to reduce the evil of the evil node, the accounting node of the last block will be punished to a certain extent. Penalties can be fined or deprived of the accounting right, and the accounting node of the last block needs to be re-determined.

This embodiment verifies whether the transaction data of the block to be accessed in the data packet is all valid. If the transaction data of the block to be accessed in the data packet is all valid, the data packet is digitally signed, and then the data packet is digitally signed. 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, 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 billing node of the last block is an evil node, so the data packet determined by the billing node of the last block is invalid, and the billing node of the last block is re-determined, so that by verifying all The validity of the transaction data described above can eliminate the possibility of malicious nodes doing evil, and can also increase the cost of malicious nodes, so as to reduce the possibility of malicious nodes and maintain the normal operation of the blockchain; at the same time, based on the data packets and the The unique node data stored in the hash operation can be guaranteed to obtain a unique first candidate hash value, which can ensure the subsequent determination of the unique target hash value, and then successfully determine the accounting node of the block to be accessed.

In the fourth embodiment of the hash operation-based consensus establishment method of the present invention, based on the first embodiment or the second embodiment or the third embodiment of the method, the second candidate hash value broadcast by other nodes is obtained in step S12 The steps also include:

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

The second preset rule in this embodiment refers to a rule for determining the target hash value. The second preset rule can be stored on a specific address of the blockchain, and the second preset rule can be directly invoked when the billing node needs to be determined. The second preset rule may be, but is not limited to: selecting the largest candidate hash value among the candidate hash values; selecting the smallest candidate hash value; and the only candidate hash value obtained according to a certain algorithm.

The broadcast conditions in this embodiment need 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, parsing 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 , the first candidate hash value satisfies the broadcast condition.

Parse 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 smaller than the second candidate hash value. hash value. Because the preset 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 of the first candidate hash value cannot successfully compete for the target hash value. Accounting right, so the first candidate hash value does not need to be broadcast. (The amount of data is reduced, and computing resources are saved) If the first candidate hash value is smaller than the second candidate hash value, the node of the first candidate hash value may still compete for the accounting right. At this time, it is necessary to broadcast the first candidate hash value. 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 each node in the blockchain can first perform a round of comparison, when the first candidate hash value is is smaller than the second candidate hash value, because the nodes of the first candidate hash value still have the possibility of successful competition, so the first candidate hash value can be broadcast, the first candidate hash value satisfies the broadcast conditions, and the determination can be The calculation amount of the target hash value is shared among the nodes in the blockchain to improve the campaign efficiency.

Step S42, 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.

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, it is necessary to send the first candidate hash value to the block The blockchain network where the chain is located broadcasts to participate in the election of the accounting node. If the first candidate hash value does not meet the broadcast conditions, 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 the nodes that are promising candidates for the block accounting node to be accessed are broadcast, which can reduce the amount of calculation and improve the Efficiency of the election campaign, as soon as possible to select the accounting node to be connected to the block.

5 , in the fifth embodiment of the hash operation-based consensus establishment method 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 :

Step S50, the accounting node of the last block determines the transaction data of the block to be accessed that is to be connected with 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 blockchain is located.

In this embodiment, the accounting node of the last block determines the transaction data of the block to be accessed and the connection sequence of each transaction, and generates a data packet based on the transaction data of the block to be accessed. In this embodiment, a data packet is generated based on the transaction data of the block to be accessed, and 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 modes: the The data packet may only contain the transaction data of the block to be accessed; it may be a collection of a hash value obtained by performing a hash operation on the transaction data of the block to be accessed and the transaction data of the block to be accessed; or It is a collection of the hash value obtained by hashing the transaction data of the block to be accessed and other data, such as the characteristic value or disturbance factor of the last block, and the transaction data of the block to be accessed, where the last The feature value of the bit block may refer to the hash value obtained by hashing the transaction data of the last 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 accessed and the connection sequence 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 accessed, and make the block to be accessed smoothly Generated; based on the transaction data of the block to be accessed, a data packet is generated and broadcast to the blockchain network, and the election of the billing node of the block to be accessed can be initiated, so as to successfully select the billing node of the block to be accessed.

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

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

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 transaction data of the block to be accessed, the characteristic value of the last block, and the second hash value. The second hash value refers to a hash value obtained by hashing the transaction data of the block to be accessed and the characteristic value of the last block.

In this embodiment, a hash operation is performed on 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, and the hash operation value is combined with the last block. The eigenvalues and transaction data are combined into a packet broadcast. It enables each node in the blockchain to perform a second hash operation based on the hash value containing one hash operation. Because of the irreversibility of the hash operation, the two hash operations can further enhance the unpredictability of the hash value. It can prevent the billing node of the last block from doing evil; at the same time, in this embodiment, the characteristic value of the last block is used as the content of the data packet, and the connection between the last block and the block to be accessed can be established, thereby ensuring the waiting The connection between the incoming block and the blockchain, the transaction data of the to-be-connected block is taken as part of the data package, which can ensure the smooth generation of the to-be-connected block.

Further, in order to facilitate the understanding of this solution, a sixth embodiment of a consensus building method based on hash operation 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 7, A, B, C, and D are all online nodes in the blockchain network. Both A and B have transaction data input, D inputs the disturbance factor, and C has no input. FIG. 7 only shows some nodes (A\B\C\D), and also includes other nodes not shown.

The Nth block shown in FIG. 7 is the last block, the N+1th block behind is the block to be accessed, and the data inputs of A, B, C, and D in the middle are the transactions of the block to be accessed. data.

First determine the accounting node of the Nth block, determine the transaction data of the block to be accessed by the accounting node of the Nth block (data input of A, B, C, and D in Figure 6), and put the Nth block The characteristic value of the block is the hash value of the Nth block plus the transaction data of the block to be accessed to perform a hash operation to obtain the first hash result, which is signed by the accounting node of the Nth block. The first hash result and the transaction data of the block to be accessed are broadcast to the blockchain network where nodes A, B, C, and D 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 accessed, it verifies whether the transaction data of the block to be accessed is all valid. Then, each node signs the first hash result with its own private key, and performs hash operation on the signature result again, and each node obtains a second hash result (denoted as 2HASH).

Each node conducts a 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, broadcast 2HASH-B, otherwise no broadcast means (B node) lottery election failure;

4. Other nodes make similar judgments as node B, and finally elect N+1 block accounting nodes.

Further, referring to FIG. 9 , in order to facilitate understanding of the present solution, a seventh embodiment of a consensus establishment method based on hash operation is proposed.

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

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

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, determining the accounting node of the last block in the blockchain, and obtaining a data packet based on the accounting node of the last block, the data packet at least containing the block to be accessed that is to be connected to the last block transaction data;

Step S30, query the historical transaction data in the blockchain;

Step S31, according to the historical transaction data in the blockchain, verify whether the transaction data of the block to be accessed in the data packet is all valid;

Step S32, if the transaction data of the block to be accessed in the data packet is all valid, then step S20 is performed;

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, acquiring 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, based on the first candidate hash value and the second candidate hash value, parse the second preset rule, when the analysis result is that the minimum candidate hash value in the candidate hash value is the target hash value, if If the first candidate hash value is smaller than the second candidate hash value, then the first candidate hash value satisfies the broadcast condition;

Step S42, 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;

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

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

In addition, an embodiment of the present invention also provides a storage medium, where a consensus establishment program based on hash operation is stored on the storage medium, and when the consensus establishment program based on hash operation is executed by a processor, the implementation is as described in the above embodiments. the steps described. Since the specific embodiments of the storage medium of the present invention are basically the same as the above-mentioned embodiments of the identity authentication method, the details are not repeated here.

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

As used herein, the terms "comprising", "comprising" or any other variation thereof are intended to encompass a non-exclusive inclusion such that a process, method, article or system comprising a series of elements includes not only those elements, but also includes no explicit Other elements listed, or those inherent to such a process, method, article or system. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in the process, method, article or system that includes the element.

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

From the description of the above embodiments, those skilled in the art can clearly understand that the method of the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is better implementation. Based on such understanding, the technical solutions of the present invention can be embodied in the form of software products in essence or the parts that make contributions to the prior art, and the computer software products are 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, a computer, a server, an air conditioner, or a network device, etc.) execute the methods described in the various embodiments of the present invention.

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

Claims (9)

1. a consensus building method based on hash operation, is characterized in that, comprises: Determine the accounting node of the last block in the blockchain, and obtain a data packet based on the accounting node of the last block, and the data packet at least contains the transaction data of the block to be accessed that is to be connected to the last block. , the billing node of the last block is a node that determines the transaction data of the block to be accessed and has a nominal billing relationship with the last block; Based on the acquired data packet and the node data stored by the node itself, perform a hash operation to obtain a first candidate hash value, and the node data includes the node private key or node identification information; Obtain the second candidate hash value broadcast by other nodes; Based on the first candidate hash value and the second candidate hash value, determine whether the first candidate hash value satisfies the broadcast condition according to a second preset rule, and the second preset rule is to select a candidate hash value The largest candidate hash value or the smallest candidate hash value or the only candidate hash value obtained according to a certain algorithm; 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; According to the first preset rule, a target hash value is selected from the first candidate hash value and the second candidate hash value, and the node of the target hash value is the billing node of the block to be accessed, so The first preset rule is to select the largest candidate hash value or the smallest candidate hash value or the target hash value obtained according to the size sequence number determined by a specific algorithm among the candidate hash values. 2. The method for establishing consensus based on hash operation according to claim 1, wherein the step of selecting the target hash value from the first candidate hash value and the second candidate hash value according to a preset rule include: The smallest candidate hash value is determined among the first candidate hash value and the second candidate hash value, and the smallest candidate hash value is the target hash value. 3. The consensus establishment method based on hash operation as claimed in claim 1, characterized in that, based on the acquired data packet and self-existing node data of this node, hash operation is performed to obtain the first candidate hash Value steps include: Obtain the transaction data of the block to be accessed in the data packet, perform a hash operation based on the transaction data and the characteristic value of the last block to obtain a first hash value, and the characteristic value of the last block is The hash value obtained by hashing the transaction data of the last block; The first hash value is signed based on the self-stored private key, and the signed first hash value is subjected to a hash operation to obtain a first candidate hash value. 4. The consensus building method based on hash operation as claimed in claim 1, characterized in that, after the step of obtaining the data packet, the method further comprises: According to the historical transaction data in the blockchain, verify whether the transaction data of the block to be accessed in the data packet is all valid; If all the transaction data of the to-be-accessed block in the data packet are valid, then perform the hash operation based on the acquired data packet and the node data stored by the node itself, and perform a hash operation to obtain the first candidate hash value. one step. 5. The consensus establishment method based on hash operation according to claim 1, wherein the step of judging whether the first candidate hash value satisfies the broadcast condition according to the second preset rule comprises: Parse 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. 6. The consensus building method based on hash operation as claimed in claim 1, wherein, the accounting node for determining the last block in the blockchain is determined based on the accounting node of the last block to obtain data The steps of the package include: The accounting node of the last block determines the transaction data of the block to be accessed that is to be connected with 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. 7. The consensus building method based on hash operation as claimed in claim 6, wherein the accounting node of the last block generates a data packet based on the transaction data of the block to be accessed, and the The steps of broadcasting a data packet to the blockchain network where the blockchain resides include: The billing node of the last block performs a hash operation based on the transaction data and the characteristic value of the last block to obtain a second hash value, and the characteristic value of the last block is the value of the last block. The hash value obtained by hashing the transaction data; The accounting node of the last block generates a data packet based on the transaction data, the characteristic value of the last block and the second hash value, and sends the data packet to the blockchain network where the blockchain is located. broadcast. 8. A blockchain system, characterized in that the blockchain system includes a plurality of nodes, and the nodes include: a memory, a processor, and a system stored in the memory and running on the processor. A hash operation-based consensus establishment program, which when executed by the processor implements the steps of the method according to any one of claims 1 to 7. 9. A computer-readable storage medium, characterized in that a consensus building program based on hash operation is stored on the computer-readable storage medium, and when the consensus building program based on hash operation is executed by a processor, The steps of the hash operation-based consensus building method according to any one of claims 1 to 7.

Images