CN109410055B - A blockchain consensus method based on computing power parasitism - Google Patents

Abstract

The invention discloses a blockchain consensus method based on computing power parasitism, which relates to the field of blockchain and includes: first, receiving at least one group of current business data in a first time period, and transferring the current business data to a hash The hash value of the first current business that matches the current business data is obtained by solving the arithmetic operation; then, it is detected whether the second transaction that is not confirmed by the first related chain is confirmed; then, the newly added confirmed by the first related chain is obtained. The second historical business hash value of the second transaction and the second block number where the second transaction is located; finally, record the first current business hash value, the second historical business hash value and the second block number on this blockchain network. In the present invention, the blockchain network relies on the computing power of the relevant blockchain, and only the defense computing power attack capability of the relevant blockchain is required to be high, and the defense computing power attack capability of the blockchain is also improved. Improve the ability of this blockchain to defend against computing power attacks.

Description

A blockchain consensus method based on computing power parasitism

technical field

The invention relates to the field of blockchain, in particular to a blockchain consensus method based on computing power parasitics.

Background technique

The non-computing blockchain network only hashes the block header containing the hash value of the previous block to obtain the hash value of this block, and uses the hash value as the composition of the next block header. part, and form a chain ledger structure, each block only executes the hash value solution once, if the overall number of blocks is 1 million, then the mining machine with a computing power of 1GH/s to break the non-computing blockchain network will only be It takes a second to break through.

According to BTC.com data, at the end of August this year, the computing power of the entire Bitcoin network was 50.13EH/s, the difficulty of the entire network was about 6.73T, and the number of unconfirmed transactions was 1,500, that is, the number of hash algorithms executed per second was 5× 10 ¹⁶ times. Even if you have 1‰ of the computing power of the blockchain network, you can easily break through the non-computing blockchain network.

With the development of blockchain technology, more and more blockchain projects appear, and each blockchain project has miners and mining machines responsible for mining. Then, major larger blockchain networks (such as Bitcoin, Ethereum), etc. have been created, which have gathered more computing resources. Compared with the computing power of large-scale blockchain networks, on the one hand, the computing power of small emerging blockchain projects has no defense against them. When attacked by large-scale blockchain networks, small blocks The chain network collapses instantly; on the other hand, if more and more small blockchain networks develop into large-scale blockchain networks, it will further consume social computing resources, resulting in waste of power resources and water resources.

SUMMARY OF THE INVENTION

In view of some defects of the prior art, the technical problem to be solved by the present invention is that in the prior art, building a stable blockchain network requires a large amount of computing resources, and there is a large computing power blockchain network. The attack is possible, and there is a risk of a computing power attack. The present invention aims to provide a blockchain consensus method based on computing power parasitics. The blockchain network formed based on the method can reduce the possibility of being broken by computing power attacks without requiring higher computing power infrastructure, and improve the The ability of chain network data to prevent tampering by computing power attacks.

In order to achieve the above purpose, a first aspect of the present invention provides a blockchain consensus method based on computing power parasitics, the method includes:

Receive at least one group of current business data within the first time period of the blockchain network, and obtain a first current business hash value matching the current business data by hashing the current business data; Wherein, the first current business hash value is used to generate a first transaction that matches the first current business hash value; the first transaction is used to be published on the first relevant chain and recorded in the on the main chain block of the first relevant chain;

According to each historical service hash value matching the historical service data, it is detected that the first correlation chain matches each of the historical service hash values within the first time period and is not matched by the first correlation chain Whether the confirmed second transaction is confirmed; wherein, the historical service hash value is obtained by solving the historical service data corresponding to the historical service hash value through a hash operation;

Obtain the newly added historical service hash value of the second transaction confirmed by the first related chain, and use the historical service hash value as the second historical service hash value; obtain the first 2. The second block number corresponding to the block where the transaction is located on the first relevant chain;

The first current service hash value, the second historical service hash value and the second block number are recorded on the current block of the blockchain network corresponding to the first time period.

In a specific embodiment, the first current service hash value, the second historical service hash value and the second block number are recorded in the current block corresponding to the first time period. On the current block of the chain network, including:

Mark the first current business hash value as unconsensus, mark the second historical business hash value as consensus, and record it in the current blockchain network corresponding to the first time period. on the block.

In a specific embodiment, the local chain block of the local blockchain network includes a block header, a first hash storage area, and a second hash storage area; the first hash storage area is used to store the The first current service hash value of the current service data newly packaged by the current block within the first time period, and the second hash storage area is used for storing the new service data within the first time period The second historical business hash value of the second transaction confirmed by the first related chain and the second block number corresponding to the second transaction are added.

In a specific embodiment, the receiving at least one set of current business data in the first time period of the blockchain network is performed, and the current business data is obtained through hash operation to match the current business data. The first current business hash value of , also includes:

Acquire each business unit of the blockchain network received within the first time period; the at least one group of current business data is composed of the business units;

Solve the unit hash value of each business unit;

According to each of the unit hash values and the Merkle tree algorithm, a Merkle tree top hash value is generated, and the Merkle tree top hash value is used as the first current service hash value.

In a specific embodiment, according to each historical service hash value matched with historical service data, it is detected that the first correlation chain matches each of the historical service hash values within the first time period. and whether the second transaction that is not confirmed by the first relevant chain is confirmed, further including:

Communicate with the main chain nodes of at least three different networks on the first related chain, and regularly detect whether the second transaction of the main chain nodes of at least three different networks is confirmed; wherein, the main chain The number of nodes is an odd number;

Among all the main chain nodes, if the second transaction is confirmed by more than half of the main chain nodes, the second transaction is considered to be confirmed.

In a specific embodiment, it also includes:

After the second transaction is confirmed, collect the third block number of the block corresponding to the second historical business hash value of the second transaction;

In response to the third block number being different from the second block number, a first modifying operation is performed; the first modifying operation includes: deleting a block originally on the first local chain on the local blockchain network For the second historical business hash value and the second block number recorded by the second exchange, the second local chain on the local blockchain network corresponding to the third block number The block records the second historical service hash value and the third block number.

In a specific embodiment, the method further includes:

After the second transaction is confirmed, collect the third block number of the block corresponding to the second historical business hash value of the second transaction;

In response to the third block number being different from the second block number, send a chain data change request to the own chain node of the blockchain network; wherein the own chain node receives the chain data change request Then, according to the second historical service hash value, request the third block number of the second transaction from the main chain node of the first related chain corresponding to the local chain node, and respond Since the third block number is not the same as the second block number, delete the second historical business that was originally recorded on the first local chain block for the second exchange on this blockchain network Hash value and the second block number, record the second historical business hash value and the The third block number.

In a specific embodiment, the hash value of the previous block of the blockchain network is used as an input parameter for solving the hash value of the next block; after performing the first modification operation, the method further includes:

comparing the size of the block serial numbers of the first local chain block and the second local chain block;

Starting from the smaller of the block serial number of the first local chain block and the second local chain block, the hash value of each block of this blockchain network is re-solved one by one, so that this blockchain network The various blocks of the chain form a chain connection.

In a specific embodiment, several nodes of the local blockchain network are also connected to the network of the first related chain while connecting to the local blockchain network.

In a specific embodiment, the method further includes:

Store the business hash value matching the unconsensus business data in the first hash list;

And/or the business hash value matching the consensus business data is stored in the second hash list.

The beneficial effects of the present invention are: the beneficial effects of the present invention are: this block chain network is attached to another related block chain network, and the hash value of the business data of this block is recorded in the relevant block in the form of a transaction On the chain, and after the transaction is confirmed, the node of the blockchain network receives the confirmation information of the transaction, and writes the transaction information of the business into the blockchain, so that the business data is confirmed and a consensus is achieved. ; This blockchain network relies on the computing power of the relevant blockchains. As long as the relevant blockchains have higher defensive computing power attack capabilities, the blockchain’s defensive computing power attack capabilities will also be improved. The chain's ability to defend against computing power attacks. In addition, the blockchain technology provided by the present invention does not require its own network to build a computing power foundation, thereby saving social costs.

Description of drawings

1 is a schematic flowchart of a blockchain consensus method based on computing power parasitism in a specific embodiment of the present invention;

FIG. 2 is a schematic diagram of data transmission of a blockchain consensus method based on computing power parasitics in a specific embodiment of the present invention;

3 is a schematic diagram of generating a business hash value based on a Merkle tree based on a blockchain consensus method based on computing power parasitics in a specific embodiment of the present invention;

Fig. 4 is the association structure diagram of the first relevant chain network and the current blockchain network in a specific embodiment of the present invention;

FIG. 5 is a schematic diagram of data transmission when block data is changed in a blockchain consensus method based on computing power parasitics in an embodiment of the present invention.

FIG. 6 is a structural block diagram of a blockchain consensus device based on parasitic computing power in an embodiment of the present invention.

Detailed ways

Below in conjunction with accompanying drawing and embodiment, the present invention will be further described:

As shown in Figures 1-6, in the first embodiment of the present invention, a blockchain consensus method based on parasitic computing power is provided, and the method includes:

Step S1: Receive at least one group of current business data in the first time period of the blockchain network, and solve the current business data through hash operation to obtain the first current business data that matches the current business data. value; wherein, the first current business hash value is used to generate a first transaction matching the first current business hash value; the first transaction is used to publish on the first relevant chain, and so as to be recorded on the main chain block of the first relevant chain;

It is worth mentioning that the generation of the first current business hash value may be a hash operation on one or more groups of business data as a whole; the generation of the first current business hash value may also be in the form of a Merkle tree. After hash operation is performed on each business data, the upper-level hash value is generated in pairs, until the top hash value of the Merkle tree is solved, and the top hash value of the Merkle tree is the first current business. hash value;

In this embodiment, the length of the first time period of the current blockchain network is not limited. Optionally, the first time period is the block generation period of the current blockchain network; optionally, the first time period It has nothing to do with the block generation cycle of this blockchain network.

In this embodiment, some or all of the business data in the first time period are packaged as a whole into hash values, and published in the form of transactions on the first related chain (such as Bitcoin network, Ethereum); wherein, The first time period has nothing to do with the block generation period of the first related chain. In this embodiment, it is only necessary to publish the first transaction on the first related chain, and the confirmation time of the transaction is related to the settings of the first related chain itself. , the blockchain network only needs to wait for the confirmation of the transaction. For example, in the Bitcoin network, a Bitcoin transaction is initiated, and after waiting for a certain period of time, the transaction can be recorded and confirmed by the miners of the Bitcoin network, and written into the blockchain.

Step S2, according to each historical service hash value matching the historical service data, detect that the first correlation chain matches each of the historical service hash values within the first time period and is not detected by the first correlation chain. Whether the second transaction confirmed by a related chain is confirmed; wherein, the historical business hash value is obtained by solving the historical business data corresponding to the historical business hash value through a hash operation;

For the blocks of this blockchain network, when the business data is published in the first relevant chain in the form of transactions, the transactions previously published in the first relevant chain are also detected, and in the corresponding business data After the transaction is confirmed, it is written into the block of this blockchain network;

It is worth mentioning that the transaction is considered to be confirmed when it is written to the main chain block of the first related chain for the first time; That is, the transaction is considered to be confirmed.

Step S3: Obtain the newly added historical service hash value of the second transaction confirmed by the first associated chain, and use the historical service hash value as the second historical service hash value; obtain the second block number corresponding to the block where the second transaction is located on the first relevant chain;

Step S4, recording the first current service hash value, the second historical service hash value and the second block number in the current block of the blockchain network corresponding to the first time period superior.

Optionally, in this embodiment, the first current service hash value, the second historical service hash value, and the second block number are recorded in a time period corresponding to the first time period. On the current block of this blockchain network, including:

Mark the first current business hash value as unconsensus, mark the second historical business hash value as consensus, and record it in the current blockchain network corresponding to the first time period. on the block.

Optionally, in this embodiment, the local chain block of the local blockchain network includes a block header, a first hash storage area, and a second hash storage area; the first hash storage area is used for storing the first current service hash value of the current service data newly packaged by the current block in the first time period, and the second hash storage area is used to store the first time The second historical business hash value of the second transaction confirmed by the first related chain and the second block number corresponding to the second transaction newly added in the cycle.

It is worth mentioning that, optionally, identifiers are set in the first hash storage area and the second hash storage area to determine the partition; optionally, by fixing the first hash storage area and the second hash storage area The size or number of bytes of the storage area to determine the relative partitions.

Optionally, in this embodiment, the receiving at least one group of current business data in the first time period of the blockchain network is performed, and the current business data is obtained by hashing the current business data. The first current business hash value that matches the data, also includes:

Acquire each business unit of the blockchain network received within the first time period; the at least one group of current business data is composed of the business units;

Solve the unit hash value of each business unit;

According to each of the unit hash values and the Merkle tree algorithm, a Merkle tree top hash value is generated, and the Merkle tree top hash value is used as the first current service hash value.

The common Merkle tree algorithm is to generate the upper-level hash value by pairing the unit hash values, and until the top hash value of the Merkle tree is solved.

Optionally, in this embodiment, according to each historical service hash value matching the historical service data, it is detected that the first correlation chain is associated with each of the historical service hashes within the first time period. whether a second transaction whose value matches and is not confirmed by the first associated chain is confirmed, further comprising:

Communicate with the main chain nodes of at least three different networks on the first related chain, and regularly detect whether the second transaction of the main chain nodes of at least three different networks is confirmed; wherein, the main chain The number of nodes is an odd number;

Among all the main chain nodes, if the second transaction is confirmed by more than half of the main chain nodes, the second transaction is considered to be confirmed.

In fact, this blockchain network only communicates with one main chain node on the first related chain to obtain information on whether the transaction is confirmed; and by communicating with multiple main chain nodes, the fork rate is reduced. In practical application scenarios, the main chain nodes of the first related chain can be set in different mining farms. Since the same mining farm generally mines collectively, and the network delay is small, the data in the mining farm is relatively consistent, so different main chain nodes of different mining farms can be selected to obtain the transaction record information of the first transaction.

Optionally, in this embodiment, the method further includes:

After the second transaction is confirmed, collect the third block number of the block corresponding to the second historical business hash value of the second transaction;

In response to the third block number being different from the second block number, a first modifying operation is performed; the first modifying operation includes: deleting a block originally on the first local chain on the local blockchain network For the second historical business hash value and the second block number recorded by the second exchange, the second local chain on the local blockchain network corresponding to the third block number The block records the second historical service hash value and the third block number.

It is worth mentioning that in the blockchain technology based on the consensus of computing power, such as the Bitcoin block, it is generated by the continuous mathematical operation of miners, and each block must refer to its previous block, so The longest chain is also the most difficult to overthrow and tamper with, so nodes always think that the longest chain is an effective blockchain, and only miners who mine on the longest chain can get rewards, which is what we often call Bitcoin The longest chain principle. When two or more nodes book accounts at almost the same time, a fork occurs. At this time, two bookkeeping methods are temporarily reserved, and the blockchain of the longer chain is finally used as the final bookkeeping book.

In an optional case, when a fork occurs in the first related chain and the nodes of this blockchain network record according to whether the first transaction is confirmed, one of the forks will be followed, and then if the first related chain chooses another A fork causes the transaction record information of the first transaction of the blockchain network to change. At this time, it can be modified, and the blockchain after modification can be correspondingly modified.

Optionally, in this embodiment, the method further includes:

After the second transaction is confirmed, collect the third block number of the block corresponding to the second historical business hash value of the second transaction;

In response to the third block number being different from the second block number, send a chain data change request to the own chain node of the blockchain network; wherein the own chain node receives the chain data change request Then, according to the second historical service hash value, request the third block number of the second transaction from the main chain node of the first related chain corresponding to the local chain node, and respond Since the third block number is not the same as the second block number, delete the second historical business that was originally recorded on the first local chain block for the second exchange on this blockchain network Hash value and the second block number, record the second historical business hash value and the The third block number.

In a typical blockchain example, the hash value of the previous block of the blockchain of this network is used as the input parameter for solving the hash value of the next block, so as to solve the hash value of the next block.

Optionally, in this embodiment, the hash value of the previous block of the blockchain network is used as an input parameter for solving the hash value of the next block; after the first modification operation is performed, the method further include:

comparing the size of the block serial numbers of the first local chain block and the second local chain block;

Starting from the smaller of the block serial number of the first local chain block and the second local chain block, the hash value of each block of this blockchain network is re-solved one by one, so that this blockchain network The various blocks of the chain form a chain connection.

Due to factors such as computing power competition and network delay, the first related chain will fork and retain several block generation cycles, and the longest chain will be selected as the final ledger; this blockchain network will also be affected by the first related chain. A fork is formed, but with the operation of the main chain, the block chain network updates the block data, and the fork problem of the block chain network can also be solved by itself as the main chain solves the fork problem.

It is worth mentioning that when the blocks of this blockchain are connected in a chain, that is, when the hash value of the previous block is stored in the next block, the first transaction record information should be changed. It is necessary to re-solve the block hash value and modify the hash value at the same time. It is worth mentioning that, for example, the Bitcoin network requires 6 confirmations to ensure that the blockchain data is not tampered with. Therefore, it is only necessary to modify the first block. The chain connection between the blocks of this blockchain network within 6 block cycles of a related chain does not require high computing power.

Optionally, in this embodiment, the block header of this blockchain network includes but is not limited to the block serial number, the first current service hash value, the second historical service hash value, the timestamp, the current block The hash value of the previous block.

Optionally, several nodes of this blockchain network will monitor the data of the first related chain, so as to know whether the first transaction and the second transaction are confirmed; optionally, several nodes of this blockchain network While connecting to this blockchain network, it also connects to the first related chain network;

Optionally, in this embodiment, several nodes of the local blockchain network are also connected to the network of the first related chain while connecting to the local blockchain network.

Optionally, in this embodiment, the method further includes:

Store the business hash value matching the unconsensus business data in the first hash list;

And/or the business hash value matching the consensus business data is stored in the second hash list.

By setting the first hash management module and/or the second hash management module, it is convenient to manage the initiation, confirmation and tracking of the consensus of the relevant business data on the first relevant chain.

In addition, since the first initiator of the first transaction receives the confirmation information of the first transaction, it is relatively timely. Optionally, receive first confirmation information about the confirmation of the first transaction from the first initiator of the first transaction; the first initiator is connected to the network of this block, and the first initiator is connected to the first transaction. A related chain network connection;

This example provides a blockchain consensus technology. When the hash value of the relevant business data is confirmed on the first relevant chain, it is considered that the relevant business data can not be easily tampered with, and thus can be agreed upon. At the same time, after the first transaction is confirmed, the relevant transaction information, such as the first current business hash value of the business data, can be confirmed in which block of the blockchain.

In practical applications, the amount of business data packaged at one time is set according to the amount of business data in this blockchain, the transaction fee and the throughput capacity of the first related chain network; it is worth mentioning that when a higher value is set When the number of business data is packaged in a single time, the handling fee for publishing the first transaction or the second transaction on the first related blockchain can be reduced, and the load of the first related blockchain can be reduced. When the number is small, it can effectively improve the confirmation speed of the transaction.

It is worth mentioning that, as shown in FIG. 2, after the completion of the block XGL1000 of the first related chain network 200, within a period of time, the business data initiated by the client of the blockchain network 100 is collected, and the business is generated. Hash value 1, and generate transaction 1 on the first related chain network 200; and further initiate transaction 2 and transaction 3 on the first related chain network 200; and, transaction 1 and transaction 2 in the first related chain network 200 The block XGL1001 is confirmed, and finally, transaction 1 (matched business hash value), transaction 2 (matched business hash value) and the block serial number of block XGL1000 on the relevant chain are recorded in this block On the block BQKL1001-1 of the chain network 100, that is, the consensus of the business hash value 1 and the business hash value 2 is completed. It is worth mentioning that, for the block BQKL1001-1 of this blockchain network, on the one hand, the transaction 4 corresponding to the business hash value 4 is the first transaction of the block, and the transaction 1 and transaction 2 are handled by the master. Chain block XGL1001 confirms that transaction 1 and transaction 2 are the second transactions of block BQKL1001-1. At this time, the above-mentioned first and second transactions are recorded on block BQKL1001-1 of this blockchain network.

As shown in FIG. 3 , the service data 1-7 are paired to generate an upper-level service hash value, and finally a first current service hash value is formed.

As shown in FIG. 4 , the present blockchain network 100 and the first associated chain network 200 have two common nodes.

As shown in Figure 5, there is a fork in the first related chain in the figure. When the blockchain network records business data for the first time, the accounting results in the upper half of the diagram are used. Later, because the first related chain forks and re-consensus, and Changed to the accounting result in the lower half of the figure. First, the block XGL1001 of the first related chain changes, and the confirmation of the original first transaction 3 is changed from the block XGL1001 to the block XGL1002. Therefore, the input of the network block BQKL1001-1 in this block is changed, so that the second historical business hash value of the original input transaction 3 needs to be eliminated first, and then, the block of the block BQKL1001-1 needs to be solved again. The hash value can be re-used as the input of block BQKL1001-2 and modified accordingly. It is worth mentioning that other subsequent blocks are not modified because the original block does not record this information, and the subsequent records are new data.

As shown in FIG. 6 , in the second embodiment of the present invention, a blockchain consensus device based on computing power parasitics is provided, and the device includes:

The first hash obtaining module 101 is configured to receive at least one group of current business data in the first time period of the blockchain network, and obtain the current business data that is consistent with the current business data through hash operation. The matching first current service hash value; wherein, the first current service hash value is used to generate a first transaction matching the first current service hash value; the first transaction is used in the first transaction Published on a related chain and recorded on the main chain block of the first related chain;

It is worth mentioning that the generation of the first current business hash value may be a hash operation on one or more groups of business data as a whole; the generation of the first current business hash value may also be in the form of a Merkle tree. After hash operation is performed on each business data, the upper-level hash value is generated in pairs, until the top hash value of the Merkle tree is solved, and the top hash value of the Merkle tree is the first current business. hash value;

In this embodiment, the length of the first time period of the blockchain network is not limited. Optionally, the first time period is the block generation period of the blockchain network; optionally, the first time period It has nothing to do with the block generation cycle of this blockchain network.

In this embodiment, some or all of the business data in the first time period are packaged as a whole into hash values, and published in the form of transactions on the first related chain (such as Bitcoin network, Ethereum); wherein, The first time period has nothing to do with the block generation period of the first related chain. In this embodiment, it is only necessary to publish the first transaction on the first related chain, and the confirmation time of the transaction is related to the settings of the first related chain itself. , the blockchain network only needs to wait for the confirmation of the transaction. For example, in the Bitcoin network, a Bitcoin transaction is initiated, and after waiting for a certain period of time, the transaction can be recorded and confirmed by the miners of the Bitcoin network, and written into the blockchain.

The transaction monitoring module 102 is configured to detect that the first correlation chain matches each of the historical business hash values within the first time period according to the respective historical business hash values that match the historical business data and does not Whether the second transaction confirmed by the first related chain is confirmed; wherein, the historical business hash value is obtained by hashing the historical business data corresponding to the historical business hash value;

For the blocks of this blockchain network, when the business data is published in the first relevant chain in the form of transactions, the transactions previously published in the first relevant chain are also detected, and in the corresponding business data After the transaction is confirmed, it is written into the block of this blockchain network;

It is worth mentioning that the transaction is considered to be confirmed when it is written to the main chain block of the first related chain for the first time; That is, the transaction is considered to be confirmed.

The second hash obtaining module 103 is configured to obtain the new historical service hash value of the second transaction confirmed by the first related chain, and use the historical service hash value as the second historical business hash value; obtain the second block number corresponding to the block where the second transaction is located on the first related chain;

The data recording module 104 is configured to record the first current service hash value, the second historical service hash value and the second block number in the local blockchain network corresponding to the first time period on the current block.

Optionally, in this embodiment, the data recording module 104 includes:

a first marking unit, configured to mark the first current service hash value as unconsensus;

a second marking unit, configured to mark the second historical service hash value as consensus;

A data recording unit, configured to record the first current service hash value and the second historical service hash value on the current block of the blockchain network corresponding to the first time period.

Optionally, in this embodiment, the local chain block of the local blockchain network includes a block header, a first hash storage area, and a second hash storage area; the first hash storage area is used for storing the first current service hash value of the current service data newly packaged by the current block in the first time period, and the second hash storage area is used to store the first time The second historical business hash value of the second transaction confirmed by the first related chain and the second block number corresponding to the second transaction newly added in the cycle.

It is worth mentioning that, optionally, identifiers are set in the first hash storage area and the second hash storage area to determine the partition; optionally, by fixing the first hash storage area and the second hash storage area The size or number of bytes of the storage area to determine the relative partitions.

Optionally, in this embodiment, the first hash obtaining module 101 further includes:

a service acquisition unit, configured to acquire each service unit of the blockchain network received within the first time period; the at least one group of current service data is composed of the service units;

The business hash solving unit is used to solve the unit hash value of each business unit;

The first hash solving unit is used to generate the top hash value of the Merkle tree according to each of the unit hash values and the Merkle tree algorithm, and use the top hash value of the Merkle tree as the first hash value. A current business hash value.

The common Merkle tree algorithm is to generate the upper-level hash value by pairing the unit hash values, and until the top hash value of the Merkle tree is solved.

Optionally, in this embodiment, the transaction monitoring module 102 further includes:

A multi-node detection unit, configured to communicate with the main chain nodes of at least three different networks on the first correlation chain, and regularly detect whether the second transaction of the main chain nodes of at least three different networks is confirmed ; Wherein, the number of the main chain nodes is an odd number;

The multi-node transaction confirmation unit is used for, among all the main chain nodes, if the second transaction is confirmed by more than half of the main chain nodes, the second transaction is considered to be confirmed.

In fact, this blockchain network only communicates with one main chain node on the first related chain to obtain information on whether the transaction is confirmed; and by communicating with multiple main chain nodes, the fork rate is reduced. In practical application scenarios, the main chain nodes of the first related chain can be set in different mining farms. Since the same mining farm generally mines collectively, and the network delay is small, the data in the mining farm is relatively consistent, so different main chain nodes of different mining farms can be selected to obtain the transaction record information of the first transaction.

Optionally, in this embodiment, the device further includes:

The transaction continuous monitoring module 105 is configured to collect the third block number of the block in which the second transaction is located corresponding to the second historical service hash value after the second transaction is confirmed;

The first transaction modification module 106 is configured to perform a first modification operation in response to the third block number being different from the second block number; the first modification operation includes: deleting the data on the blockchain network The second historical business hash value and the second block number originally recorded on the first local chain block for the second exchange are in the local area corresponding to the third block number The second local chain block on the blockchain network records the second historical business hash value and the third block number.

It is worth mentioning that in the blockchain technology based on the consensus of computing power, such as the Bitcoin block, it is generated by the continuous mathematical operation of miners, and each block must refer to its previous block, so The longest chain is also the most difficult to overthrow and tamper with, so nodes always think that the longest chain is an effective blockchain, and only miners who mine on the longest chain can get rewards, which is what we often call Bitcoin The longest chain principle. When two or more nodes book accounts at almost the same time, a fork occurs. At this time, two bookkeeping methods are temporarily reserved, and the blockchain of the longer chain is finally used as the final bookkeeping book.

In an optional case, when a fork occurs in the first related chain and the nodes of this blockchain network record according to whether the first transaction is confirmed, one of the forks will be followed, and then if the first related chain chooses another A fork causes the transaction record information of the first transaction of the blockchain network to change. At this time, it can be modified, and the blockchain after modification can be correspondingly modified.

Optionally, in this embodiment, the device further includes:

The transaction continuous monitoring module 105 is configured to collect the third block number of the block in which the second transaction is located corresponding to the second historical service hash value after the second transaction is confirmed;

The second transaction modification module 107 is configured to, in response to the third block number being different from the second block number, send a chain data modification request to the own chain node of the own blockchain network; After the chain node receives the chain data change request, according to the second historical service hash value, it requests the main chain node of the first related chain corresponding to the own chain node for the information of the second transaction. the third block number, and in response to the third block number being different from the second block number, delete the second transaction originally on the first local chain block on the local blockchain network The recorded hash value of the second historical service and the second block number are recorded in the second local chain block on the local blockchain network corresponding to the third block number. 2. Historical business hash value and the third block number.

In a typical blockchain example, the hash value of the previous block of the blockchain of this network is used as the input parameter for solving the hash value of the next block, so as to solve the hash value of the next block.

Optionally, in this embodiment, the hash value of the previous block of the blockchain network is used as an input parameter for solving the hash value of the next block; the first transaction modification module 106 further includes a block reconstruction unit. ;

The block reconstruction unit is used to compare the size of the block serial numbers of the first home chain block and the second home chain block;

The block reconstruction unit is also used to re-solve the block sequence numbers of each block of this blockchain network one by one starting from the smaller of the block serial numbers of the first local chain block and the second local chain block. The hash value makes each block of the blockchain network form a chain connection.

Due to factors such as computing power competition and network delay, the first related chain will fork and retain several block generation cycles, and the longest chain will be selected as the final ledger; this blockchain network will also be affected by the first related chain. A fork is formed, but with the operation of the main chain, the block chain network updates the block data, and the fork problem of the block chain network can also be solved by itself as the main chain solves the fork problem.

It is worth mentioning that when the blocks of this blockchain are connected in a chain, that is, when the hash value of the previous block is stored in the next block, the first transaction record information should be changed. It is necessary to re-solve the block hash value and modify the hash value at the same time. It is worth mentioning that, for example, the Bitcoin network requires 6 confirmations to ensure that the blockchain data is not tampered with. Therefore, it is only necessary to modify the first block. The chain connection between the blocks of this blockchain network within 6 block cycles of a related chain does not require high computing power.

Optionally, in this embodiment, the block header of this blockchain network includes but is not limited to the block serial number, the first current service hash value, the second historical service hash value, the timestamp, the current block The hash value of the previous block.

Optionally, several nodes of this blockchain network will monitor the data of the first related chain, so as to know whether the first transaction and the second transaction are confirmed; optionally, several nodes of this blockchain network While connecting to this blockchain network, it also connects to the first related chain network;

Optionally, in this embodiment, several nodes of the local blockchain network are also connected to the network of the first related chain while connecting to the local blockchain network.

Optionally, in this embodiment, the device further includes:

The first hash management module 108 is configured to store the service hash value matching the unconsensus service data in the first hash list;

and/or the second hash management module 109, configured to store the service hash value matching the consensus service data in the second hash list.

By setting the first hash management module 108 and/or the second hash management module 109, it is convenient to manage the initiation, confirmation and tracking of the consensus of the relevant business data on the first relevant chain.

In addition, since the first initiator of the first transaction receives the confirmation information of the first transaction, it is relatively timely. Optionally, receive first confirmation information about the confirmation of the first transaction from the first initiator of the first transaction; the first initiator is connected to the network of this block, and the first initiator is connected to the first transaction. A related chain network connection;

This example provides a blockchain consensus technology. When the hash value of the relevant business data is confirmed on the first relevant chain, it is considered that the relevant business data can not be easily tampered with, and thus can be agreed upon. At the same time, after the first transaction is confirmed, the relevant transaction information, such as the first current business hash value of the business data, can be confirmed in which block of the blockchain.

In practical applications, the amount of business data packaged at one time is set according to the amount of business data in this blockchain, the transaction fee and the throughput capacity of the first related chain network; it is worth mentioning that when a higher value is set When the number of business data is packaged in a single time, the handling fee for publishing the first transaction or the second transaction on the first related blockchain can be reduced, and the load of the first related blockchain can be reduced. When the number is small, it can effectively improve the confirmation speed of the transaction.

It is worth mentioning that, as shown in FIG. 2, after the completion of the block XGL1000 of the first related chain network 200, within a period of time, the business data initiated by the client of the blockchain network 100 is collected, and the business is generated. Hash value 1, and generate transaction 1 on the first related chain network 200; and further initiate transaction 2 and transaction 3 on the first related chain network 200; and, transaction 1 and transaction 2 in the first related chain network 200 The block XGL1001 is confirmed, and finally, transaction 1 (matched business hash value), transaction 2 (matched business hash value) and the block serial number of block XGL1000 on the relevant chain are recorded in this block On the block BQKL1001-1 of the chain network 100, that is, the consensus of the business hash value 1 and the business hash value 2 is completed. It is worth mentioning that for the block BQKL1001-1 of this blockchain network, on the one hand, the transaction 4 corresponding to the business hash value 4 is the first transaction of the block, and the transaction 1 and transaction 2 are processed by the master. Chain block XGL1001 confirms that transaction 1 and transaction 2 are the second transactions of block BQKL1001-1. At this time, the above-mentioned first and second transactions are recorded on block BQKL1001-1 of this blockchain network.

As shown in FIG. 3 , the service data 1-7 are paired to generate an upper-level service hash value, and finally a first current service hash value is formed.

As shown in FIG. 4 , the present blockchain network 100 and the first associated chain network 200 have two common nodes.

As shown in Figure 5, there is a fork in the first related chain in the figure. When the blockchain network records business data for the first time, the accounting results in the upper half of the diagram are used. Later, because the first related chain forks and re-consensus, and Changed to the accounting results in the lower half of the figure. First, the block XGL1001 of the first related chain changes, and the confirmation of the original first transaction 3 is changed from the block XGL1001 to the block XGL1002. Therefore, the input of the network block BQKL1001-1 in this block is changed, so that the second historical business hash value of the original input transaction 3 needs to be eliminated first, and then, the block of the block BQKL1001-1 needs to be solved again. The hash value can be re-used as the input of block BQKL1001-2 and modified accordingly. It is worth mentioning that other subsequent blocks are not modified because the original block does not record this information, and the subsequent records are new data.

The preferred embodiments of the present invention have been described in detail above. It should be understood that those skilled in the art can make many modifications and changes according to the concept of the present invention without creative efforts. Therefore, all technical solutions that can be obtained by those skilled in the art through logical analysis, reasoning or limited experiments on the basis of the prior art according to the concept of the present invention shall fall within the protection scope determined by the claims.

Claims (10)

1. A blockchain consensus method based on computing power parasitics, wherein the method comprises: Receive at least one group of current business data in the first time period of the blockchain network, and obtain a first current business hash value matching the current business data by hashing the current business data; Wherein, the first current business hash value is used to generate a first transaction that matches the first current business hash value; the first transaction is used to publish on the first relevant chain, and is recorded in the on the main chain block of the first relevant chain; According to each historical service hash value matching the historical service data, it is detected that the first correlation chain matches each of the historical service hash values within the first time period and is not matched by the first correlation chain Whether the confirmed second transaction is confirmed; wherein, the historical service hash value is obtained by solving the historical service data corresponding to the historical service hash value through a hash operation; Obtain the newly added historical service hash value of the second transaction confirmed by the first related chain, and use the historical service hash value as the second historical service hash value; obtain the first 2. The second block number corresponding to the block where the transaction is located on the first relevant chain; The first current service hash value, the second historical service hash value and the second block number are recorded on the current block of the blockchain network corresponding to the first time period. 2. A blockchain consensus method based on computing power parasitism according to claim 1, wherein the first current service hash value, the second historical service hash value and the first The second block number is recorded on the current block of the blockchain network corresponding to the first time period, including: Mark the first current business hash value as unconsensus, mark the second historical business hash value as consensus, and record it in the current blockchain network corresponding to the first time period. on the block. 3. The blockchain consensus method based on computing power parasitism according to claim 1, wherein the local chain block of the local blockchain network comprises a block header, a first hash storage area, a first Two hash storage areas; the first hash storage area is used to store the first current service hash value of the current service data newly packaged by the current block within the first time period, and the The second hash storage area is used to store the second historical business hash value of the second transaction confirmed by the first related chain added within the first time period and the first The second block number corresponding to the second exchange. 4. A blockchain consensus method based on computing power parasitism according to claim 1, wherein the receiving at least one group of current business data in the first time period of the blockchain network, and the The current service data is obtained through a hash operation to obtain a first current service hash value matching the current service data, further comprising: Acquire each business unit of the blockchain network received within the first time period; the at least one group of current business data is composed of the business units; Solve the unit hash value of each business unit; According to each of the unit hash values and the Merkle tree algorithm, a Merkle tree top hash value is generated, and the Merkle tree top hash value is used as the first current service hash value. 5. The blockchain consensus method based on computing power parasitism according to claim 1, wherein the first correlation chain is detected according to each historical business hash value matched with historical business data. Whether the second transaction that matches each of the historical business hash values and is not confirmed by the first correlation chain within the first time period is confirmed, further comprising: Communicate with the main chain nodes of at least three different networks on the first related chain, and regularly detect whether the second transaction of the main chain nodes of at least three different networks is confirmed; wherein, the main chain The number of nodes is an odd number; Among all the main chain nodes, if the second transaction is confirmed by more than half of the main chain nodes, the second transaction is considered to be confirmed. 6. The blockchain consensus method based on computing power parasitism according to claim 1, wherein the method further comprises: After the second transaction is confirmed, collect the third block number of the block corresponding to the second historical business hash value of the second transaction; In response to the third block number being different from the second block number, a first modifying operation is performed; the first modifying operation includes: deleting a block originally on the first local chain on the local blockchain network For the second historical business hash value and the second block number recorded by the second exchange, the second local chain on the local blockchain network corresponding to the third block number The block records the second historical service hash value and the third block number. 7. The blockchain consensus method based on computing power parasitics according to claim 1, wherein the method further comprises: After the second transaction is confirmed, collect the third block number of the block corresponding to the second historical business hash value of the second transaction; In response to the third block number being different from the second block number, send a chain data change request to the own chain node of the blockchain network; wherein the own chain node receives the chain data change request Then, according to the second historical service hash value, request the third block number of the second transaction from the main chain node of the first related chain corresponding to the local chain node, and respond Since the third block number is not the same as the second block number, delete the second historical business originally recorded on the first local chain block for the second exchange on the blockchain network Hash value and the second block number, record the second historical business hash value and the The third block number. 8. A blockchain consensus method based on computing power parasitism as claimed in claim 6, wherein the hash value of the previous block of this blockchain network is used as the input for solving the hash value of the next block parameters; after performing the first modification operation, the method further includes: comparing the size of the block serial numbers of the first local chain block and the second local chain block; Starting from the smaller of the block serial number of the first local chain block and the second local chain block, the hash value of each block of this blockchain network is re-solved one by one, so that this blockchain network The various blocks of the chain form a chain connection. 9. A blockchain consensus method based on computing power parasitism according to claim 1, characterized in that, when several nodes of the blockchain network are connected to the blockchain network, they are also connected to all nodes of the blockchain network. Describe the network of the first associated chain. 10. The blockchain consensus method based on computing power parasitics according to claim 1, wherein the method further comprises: Store the business hash value matching the unconsensus business data in the first hash list; And/or the business hash value matching the consensus business data is stored in the second hash list.

Images