WO2020073246A1

WO2020073246A1 - Blockchain-based transaction data processing method and device, and storage medium

Info

Publication number: WO2020073246A1
Application number: PCT/CN2018/109701
Authority: WO
Inventors: 王成
Original assignee: 王成
Priority date: 2018-10-10
Filing date: 2018-10-10
Publication date: 2020-04-16
Also published as: CN110692078A; CN110692078B

Abstract

A blockchain-based transaction data processing method and device, and a storage medium. Said method is applied to a first node corresponding to a first account group in a blockchain network, the blockchain network comprising G account groups and G x G blockchains, a blockchain correspondingly connecting any one of the account groups and another one of the account groups. Said method comprises: the first node receiving first transaction information formed by a transaction between accounts of the first account group and a second account group, the first account group or the second account group being any one of the account groups in the blockchain network; the first node generating a first block according to the first transaction information, and adding the first block to a first blockchain; and the first blockchain being the blockchain correspondingly connecting the first account group and the second account group (102). In said method, the first node only needs to save blocks of the blockchain that is associated with the first account group.

Description

Blockchain-based transaction data processing method, equipment and storage medium

Technical field

The present invention relates to the field of blockchain technology, and in particular to a blockchain-based transaction data processing method, device, and storage medium.

Background technique

The classic blockchain technology is a decentralized public ledger technology. A blockchain is generally composed of infinitely ordered transaction blocks arranged in time. Blockchain technology ensures that the ledger does not have double spending issues, the ledger cannot be changed, and all nodes in the network can reach a consensus and have a common ledger.

In the existing blockchain technology, a single blockchain structure is adopted. All transactions are recorded on a blockchain. Each node in the network needs to save a complete blockchain, that is, it needs to be saved. All historical transactions. Since the network capacity of each node is limited, this greatly limits the number of transactions per unit time of the current blockchain.

Summary of the invention

The invention provides a transaction data processing method, equipment and storage medium based on a blockchain to improve the transaction speed per unit time of the blockchain system.

In a first aspect, the present invention provides a blockchain-based transaction data processing method, including:

The method is applied to a first node. The first node is a node corresponding to a first account group in a blockchain network. The blockchain network includes G account groups and G × G blockchains. One account group to another any of the account groups corresponds to a blockchain, the first account group is any account group in the blockchain network, and G is an integer greater than 1; Methods include:

The first node receives first transaction information; the first transaction information is formed by a transaction between accounts in the first account group to a second account group; the second account group is the block Any account group in the chain network;

The first node generates a first block based on the first transaction information, and adds the first block to the first blockchain; the first blockchain sets the first account group to The blockchain corresponding to the second account group.

In a second aspect, an embodiment of the present invention provides an electronic device, including:

Processor; and

A memory for storing executable instructions of the processor;

Wherein, the processor is configured to execute the method of any one of the first aspects via execution of the executable instructions.

In a third aspect, an embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, the method according to any one of the first aspect is implemented.

In the blockchain-based transaction data processing method, device, and storage medium provided by the embodiments of the present invention, the first node receives first transaction information; the first transaction information is from the first account group to the second account group The transaction between the accounts is formed; the first account group and the second account group are any account groups in the blockchain network; the first node generates a first block based on the first transaction information, and converts The first block is added to the first blockchain; the first block is the block corresponding to the first account group to the second account group. Due to the account group, the first node is the first The node corresponding to the account group, the first node only needs to save the historical transactions related to it, and only needs to save all the transaction information related to the first account group to know the balance of all accounts in the first account group, that is, only need to save The blocks of the blockchain related to the first account group, and different blockchains can be traded in parallel. Under the condition of limited network capacity, the transaction time per unit time of the blockchain system is increased.

BRIEF DESCRIPTION

The drawings herein are incorporated into and constitute a part of this specification, show embodiments consistent with this disclosure, and are used together with the specification to explain the principles of this disclosure.

1 is a schematic flowchart of an embodiment of a transaction data processing method based on blockchain provided by the present invention;

2 is a block diagram of an embodiment of a transaction data processing method based on blockchain provided by the present invention;

3 is a block flow diagram of an embodiment of a transaction data processing method based on blockchain provided by the present invention;

4 is a block diagram of another embodiment of a blockchain-based transaction data processing method provided by the present invention;

5 is a schematic diagram of an embodiment of an electronic device provided by the present invention.

Through the above drawings, a clear embodiment of the present disclosure has been shown, which will be described in more detail later. These drawings and textual descriptions are not intended to limit the scope of the concept of the present disclosure in any way, but to explain the concept of the present disclosure to those skilled in the art by referring to specific embodiments.

detailed description

Exemplary embodiments will be described in detail here, examples of which are shown in the drawings. When the following description refers to the accompanying drawings, unless otherwise indicated, the same numerals in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Rather, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

The terms "including" and "having" and any variations thereof in the description and claims of the present invention and the accompanying drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally also includes Other steps or units inherent to these processes, methods, products or equipment.

First, the application scenarios involved in the present invention are introduced:

The transaction data processing method based on the blockchain provided in the embodiments of the present invention is applied to a blockchain network, which corresponds to a scalable decentralized cryptocurrency system. The blockchain network includes multiple nodes, G account groups and G × G blockchains. Any account group corresponds to at least one node, and any blockchain is an account from one account group to another account group. The blocks generated by the transaction between are linked. The above two account groups can be the same or different, and they are any of the G account groups, and G is an integer greater than 1.

The nodes corresponding to each account group only need to save 2G-1 block chain blocks, and for other chains only need to save the block header of the block.

The technical solutions of the present invention are described in detail below with specific examples. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments.

FIG. 1 is a schematic flowchart of an embodiment of a transaction data processing method based on a blockchain provided by the present invention. The execution subject of this embodiment is a first node, which is a node corresponding to a first account group in the blockchain network, and the first account group is any account group in the blockchain network. As shown in FIG. 1, the method provided in this embodiment includes:

Step 101: The first node receives first transaction information; the first transaction information is formed by a transaction between the accounts of the first account group and the second account group; the second account group is the area Any account group in the blockchain network.

Step 102: The first node generates a first block according to the first transaction information and adds the first block to the first blockchain; the first blockchain is the first account group To the blockchain corresponding to the second account group.

Specifically, the method in the embodiment of the present invention may first define the number of account groups, for example, G account groups, and a hash algorithm may be used to divide the account addresses corresponding to the accounts into corresponding account groups. For example, modulo the hash of the account address and G can obtain the account group corresponding to the account. The blocks generated by transactions between accounts from one account group to another account group form a blockchain, with a total of G × G chains.

All transactions use the Unspent Transaction Output (UTXO) model, that is, each transaction consumes a UTXO as input and generates a new UTXO as output. As shown in Figure 2, every two account groups correspond to a blockchain (the relationship between the two account groups is an orderly account group pair, that is, from one account group to another account group corresponds to a blockchain, the two Account groups can be the same account group), the input in each block of this blockchain comes from the same account group UTXO, the account group UTXO comes from all accounts to this account group transaction . The node corresponding to each account group only needs to save all the input and output transactions related to this account group to know the balance of all accounts in the account group, so the node corresponding to each account group only needs to save some historical transaction records, that is Only need to save the block of the blockchain related to the account group. The related blockchain includes any other account group to the corresponding blockchain of the account group, and the account group to any other account group (can be removed This account group) corresponds to the blockchain, that is, 2G-1 blockchains.

For example, the account balance in account group A depends on 2G-1 blockchains, that is, G blockchains corresponding to transactions from all account groups to account group A, and transactions from account group A to all account groups except account group A Corresponding G-1 blockchain.

All G × G blockchains plus the dependencies between the blocks form a network flow-like structure, which is called a block flow in the embodiment of the present invention, as shown in FIG. 3. For example, G = 2, that is, there are two account groups, denoted as account group 0 and account group 1. In FIGS. 2 and 3, the chain L (0,0) represents the blockchain corresponding to account group 0 to account group 0. L (0,1) represents the blockchain corresponding to account group 0 to account group 1, chain L (1,0) represents the blockchain corresponding to account group 1 to account group 0, and chain L (1,1) represents the account Blockchain corresponding to Group 1 to Account Group 1. In Figure 3, the height 2 block is generated later than the height 1 block.

At the initial moment, the blockchain network has only G × G initial blocks, that is, each blockchain has an initial block. Then, the accounts in the blockchain network begin to form their own transactions and broadcast to the blockchain network. The nodes in the blockchain network package the transaction information into blocks on different blockchains according to the input account group and output account group of the transaction. Assuming that the transaction is a transaction between accounts in account group A and account group B, the input account group is account group A, and the output account group is account group B. These blocks are eventually broadcast to the entire blockchain network, and the nodes in the blockchain network will verify and then choose to receive new blocks or reject blocks that do not meet the protocol rules.

Taking G = 2 as an example, assume that all account addresses are natural numbers: 0, 1, 2, 3, 4 ... The account group corresponding to the account address n1 is n1% 2. There are 4 chains in total, L (0,0), L (0,1), L (1,0), L (1,1). A transaction from the account address n1 to the account address n2 needs to be submitted to the blockchain L (n1% 2, n2% 2). Account transactions in the blockchain network broadcast the transactions to the P2P network. There are a large number of mining nodes in the blockchain network, and these mining nodes cache the transaction information submitted by a certain node (corresponding to an account). The function of the mining node is to package the transaction information into blocks, and then add the input account group of the transaction information to the corresponding blockchain of the output account group.

The following takes the first node as a mining node for example:

The first node selects the blockchain corresponding to the first account group to the second account group (that is, the first blockchain) for mining. The first node packages the transaction information that has not been added to the first blockchain, namely the first The node receives the first transaction information, which is formed by the transaction between the accounts of the first account group and the second account group.

The first node generates a first block based on the first transaction information, and adds the first block to the first blockchain.

Optionally, after adding the first block to the first blockchain, the method further includes:

The first node broadcasts the block header of the first block to all nodes in the blockchain network, and broadcasts the block body of the first block to the first account group or The node corresponding to the second account group, so that other nodes in the blockchain network can verify the received block header and / or block body of the first block.

Specifically, after generating the first block, the first node may broadcast the first block to other nodes in the blockchain network, and may specifically broadcast the first block to the first account group or the second The node corresponding to the account group, for example, can split the block header and block body of the first block and broadcast it to the node corresponding to the first account group or the second account group, or the block head and block body as a whole For broadcasting, the block header may be broadcast before the block body, or the block header and the block body may be broadcast at the same time, which is not limited in the present invention.

Further, the block header of the first block may also be broadcast to other nodes, that is, nodes that are not corresponding to the first account group and the second account group.

In the method of this embodiment, the first node receives the first transaction information; the first transaction information is formed by transactions between the accounts of the first account group to the second account group; the first account group and the second The account group is any account group in the blockchain network; the first node generates a first block based on the first transaction information, and adds the first block to the first blockchain; The first blockchain is the blockchain corresponding to the first account group to the second account group. Due to the account group, the first node is the node corresponding to the first account group, and the first node only needs to save its related Of historical transactions, you only need to save all transaction information related to the first account group to know the balance of all accounts in the first account group, that is, only need to save the block of the blockchain related to the first account group, At the same time, different blockchains can be traded in parallel. In the case of limited network capacity, the transaction speed of the blockchain system per unit time is increased.

Based on the above embodiment, optionally, before step 102, it further includes:

The first node obtains the hash value of the block header that the first block depends on; the block header that the first block depends on is a block header that can determine all the blockchains in the blockchain network;

Correspondingly, step 102 can be implemented in the following manner:

The first node generates a first block based on the first transaction information and the hash value of the block header that the first block depends on.

Specifically, the block between the blockchain and the blockchain in the embodiment of the present invention is closely dependent, and each new block will depend on multiple blockchains, so it must include multiple previously generated The hash of the block header, that is, the generated first block contains the hash value of the block header of multiple dependent blockchains. Through these dependent block headers, the block headers of all blockchains in the blockchain network can be determined, that is, through the dependent block headers, all blockchains in the entire blockchain network can be determined. When determining the block header that the first block depends on, make sure that each newly generated block is as expected.

The first node generates the first block based on the received first transaction information and the hash value of the block header that the first block depends on.

We hope that each new first block can determine the state of the G × G blockchain chain. The easiest way is to save the hash value of the latest block header of all blockchains in the newly generated block header of the first block, but this method is undoubtedly inefficient and requires the storage of G × G Hash value.

Among them, the latest block header may be the block header with the most determined blocks or the block header with the latest creation time, which is not limited in this embodiment of the present invention.

Further, as an optimized solution, if the first blockchain is L (i, j); the i and j are integers greater than or equal to 0 and less than or equal to G-1, respectively. i represents a first account group, j represents a second account group, and the first node obtains the hash value of the block header that the first block depends on, including:

The first node selects an initial block header from the verified block headers according to the first preset condition;

The first node selects an up-to-date second block header B (i, m) from the G blockchains L (i, m), so that the second block header B (i, m) determines The latest block header of each blockchain is compatible with the latest block header of the corresponding blockchain determined by the initial block header; the value of m is an integer from 0 to G-1; m represents any account group in the blockchain network;

For different k, the first node selects the latest third block header B (k, l_k) from the G blockchains L (k, l_k), so that the third block header B (k, l_k) The latest block header of each block chain determined is compatible with the latest block header of the corresponding block chain determined by the initial block header; the value range of k is an integer from 0 to G-1 , And k is not equal to i, the value range of l_k is an integer from 0 to G-1; the k represents any account group in the blockchain network except the first account group, the l_k represents any account group in the blockchain network;

The first node uses the initial block header, the second block header, and the third block header as the block header that the first block depends on, and calculates the block header that the first block depends on Hash value.

Specifically, the first node selects the block header that the first block depends on. First, it can obtain a verified block header as the initial block header and add it to the block header that the first block depends on.

The initial block header may be a block header that satisfies the first preset condition, and the first preset condition may be the maximum number of blocks determined based on the initial block header, or determined based on the initial block header The total block difficulty is the highest, which is not limited in the embodiment of the present invention.

Optionally, after the initial block header is determined, the latest fourth block header Z (r, s) of the blockchain L (r, s) is determined according to the initial block header; where r and s are respectively An integer greater than or equal to 0 and less than or equal to G-1;

Among them, the blockchain L (r, s) is any blockchain in the blockchain network.

After selecting the initial block header, the first node selects from L (i, 0), L (i, 1), ..., L (i, G-1), among the G blockchains L (i, m) Choose a newest second block header B (i, m), so that the latest block header and the initial block header of each blockchain determined by the second block header B (i, m) are determined The latest block header corresponding to the corresponding blockchain is compatible.

Select the latest second block header B (i, m) from the G blockchains L (i, m), which can be implemented in the following manner:

Step a. The first node selects a newest second block header B (i, m) from the blockchain L (i, m), so that the second block header B (i, m) determines the The latest fifth block header Z '(r, s) of the blockchain L (r, s) and the fourth block header Z (r, s) are the same in the blockchain L (r, s) On a fork, and if the fifth block header Z '(r, s) is newer than the fourth block header Z (r, s), then the latest of the blockchain L (r, s) The fourth block header Z (r, s) is updated to the fifth block header Z '(r, s);

Add one to m and repeat step a until m reaches G-1; where the initial value of m is 0.

Specifically, first select a newest second block header B (i, 0) from L (i, 0), so that the blockchain L (r, s determined by the second block header B (i, 0) ) 'S latest fifth block header Z' (r, s) and the fourth block header Z (r, s) determined by the initial block header are on the same fork of the blockchain L (r, s), if The fifth block header Z '(r, s) is newer than the fourth block header Z (r, s), then the latest fourth block header Z (r, s) of the blockchain L (r, s) is updated to The fifth block header Z '(r, s), if the fifth block header Z' (r, s) is older than the fourth block header Z (r, s), then the newest block chain L (r, s) The fourth block header Z (r, s) remains unchanged. The old and new here refers to the old and new in time, that is, the later the time generated on the same blockchain, the newer.

Add one to m, and repeat step a, that is, first select the latest second block header B (i, 1) from L (i, 1), so that the second block header B (i, 1) determines The latest fifth block header Z '(r, s) and fourth block header Z (r, s) of the blockchain L (r, s) are on the same fork of the blockchain L (r, s), If the fifth block header Z '(r, s) is newer than the fourth block header Z (r, s) (in this case, the fourth block header may be an updated block header), then the blockchain L (r, s) The latest fourth block header Z (r, s) is updated to the fifth block header Z '(r, s), if the fifth block header Z' (r, s) is higher than the fourth block header Z (r, s) Old, then the latest fourth block header Z (r, s) of the blockchain L (r, s) remains unchanged. Increase m by one and repeat step a until m reaches G-1.

At this time, select 1 (initial block header) + G block headers that the first block depends on.

Then, select G-1 block headers that the first block depends on.

For each k (k ≠ i), the first node starts from L (k, 0), L (k, 1), ..., L (k, G-1), and these G blockchains L (k , l_k) select the latest third block header B (k, l_k), so that the third block header B (k, l_k) determines the latest block header of each blockchain and the initial area The block header determines the latest block header compatible with the corresponding blockchain.

For different k, the first node selects the latest third block header B (k, l_k) from the G blockchains L (k, l_k), which can be implemented in the following manner:

Step b. The first node selects the latest third block header B (k, l_k) from the blockchain L (k, l_k), so that the third block header B (k, l_k) determines the The latest sixth block header Z ″ (r, s) of the blockchain L (r, s) and the fourth block header Z (r, s) are on the same blockchain L (r, s), And if the sixth block header Z ″ (r, s) is newer than the fourth block header Z (r, s), then the latest fourth block header of the blockchain L (r, s) Z (r, s) is updated to the sixth block header Z ″ (r, s);

Add one to k and repeat step b until k reaches G-1; where the initial value of k is 0 and k is not equal to i.

Specifically, if i is equal to 0, the initial value of k is 1.

Assuming that i is not equal to 0, for k = 0, the first node starts from L (0,0), L (0,1), ..., L (0, G-1), the G blockchains L ( 0, l_k) selects the latest third block header B (0, l_k), so that the third block header B (0, l_k) determines the latest sixth of the blockchain L (r, s) Block header Z ″ (r, s) and the fourth block header Z (r, s) (the fourth block header at this time may have been updated in step a) in the blockchain L (r, s) On the same fork, and if the sixth block header Z ″ (r, s) is newer than the fourth block header Z (r, s), then the blockchain L (r, s) The latest fourth block header Z (r, s) is updated to the sixth block header Z ″ (r, s), if the sixth block header Z ″ (r, s) is higher than the fourth block header Z (r, s ) Old, then the latest fourth block header Z (r, s) of the blockchain L (r, s) remains unchanged. Increase i by one and repeat step b until k reaches G-1.

Wherein, in some embodiments, if the block where the initial block header is located is block L (p, q), if i is equal to p, then m is not equal to q;

If the i is not equal to the p, k is not equal to p.

Specifically, in order to reduce the hash value of the dependent block header included in the block header of the first block, an optimized solution is to select 2G-1 block headers that the first block depends on, that is, in G In the process of selecting an up-to-date second block header B (i, m) in the blockchain L (i, m), the block where the original block header is located is removed, that is, if the block where the initial block header is located Is blockchain L (p, q), when i is equal to p, m is not equal to q, further, if L (i, m) does not include blockchain L (p, q), then for different k, When the first node selects the latest third block header B (k, l_k) from the G block chains L (k, l_k), the block where the initial block header is located is removed, that is, k does not Is equal to p, that is, the block header is not selected from the G blockchains of L (p, l_k).

It should be noted that the steps a and b are implemented in no particular order.

In the above specific embodiment, the hash value of the block header that the first block depends on is placed in the block header of the first block to determine the status of all blockchains in the blockchain network.

Based on the above embodiment, optionally, before step 102, the following operations may also be performed:

The first node determines whether the transaction input corresponding to the first transaction information is from the account of the third account group to the first account group according to the blockchain corresponding to the first account group from the third account group The transaction output corresponding to the transaction between;

If yes, the first node verifies the transaction output according to the blockchain corresponding to the first account group to the fourth account group. Use of transactions between; the third account group and the fourth account group are respectively any account group in the blockchain network;

If yes, it is determined that the first transaction information is valid.

Specifically, before generating the first block, it is necessary to verify whether the received first transaction information is valid, that is, whether the transaction corresponding to the first transaction information is valid.

Two points need to be verified: 1. Whether the transaction input corresponding to the first transaction information comes from a valid UTXO, and 2. There is no double spending.

Based on the selected block headers selected above, each block of the block chain in the block chain network can be determined, thereby determining all historical transactions, that is, determining a ledger.

First, according to the transaction information included in the block in the blockchain corresponding to the first account group from any account group, determine whether the transaction input corresponding to the first transaction information comes from another account group to the account of the first account group The transaction output corresponding to the transaction, that is, whether it came from the output of a previous transaction.

Then, according to the transaction information included in the block in the blockchain corresponding to the first account group to any account group, verify whether the transaction output is not used by the transaction between the accounts of the first account group and other account groups, that is, the The transaction output is not consumed by other transactions.

If the above two conditions are met, it means that the first transaction information is valid.

Therefore, the node corresponding to each account group only needs to save all input and output transactions related to this account group to know the balance of all accounts in the account group, so the node corresponding to each account group only needs to save some historical transaction records , That is, only the blocks of the blockchain related to the account group need to be saved. The related blockchain includes any other account group to the corresponding blockchain of the account group, and the account group to any other account group ( The corresponding blockchain of the account group can be removed, that is, 2G-1 blockchains. For the blockchain that is not related to the account group, only the block header needs to be saved.

Further, the first node generates the first block according to the first transaction information and the hash value of the block header that the first block depends on, which may be specifically implemented as follows:

The first node determines the random number by using the proof-of-work algorithm according to the second preset condition;

The first node generates the block header of the first block according to the preset block header data structure according to the hash value of the block header that the first block depends on and the random number;

The first node generates the block body of the first block according to the preset data structure of the block body of the valid first transaction information;

The first node combines the block header and the block body to form the first block.

The first block includes a block header and a block body. Optionally, the block header of the first block further includes: the hash value of the previous block in the first block chain, the first area The hash value and time stamp of the block body of the block.

Specifically, when generating the first block, the first node needs to find a random number through a proof-of-work algorithm, and the random number satisfies the second preset condition. For example, the hash value of the block generated by the random number satisfies certain conditions, such as less than a preset threshold.

Then the random number, the hash value of the selected dependent block header, the timestamp (that is, the first block creation time), the hash value of the previous block of the blockchain, the block of the first block The hash value of the main body (ie, payload) and other information constitute the block header of the first block.

The validated first transaction information is used to generate the block body of the first block, and then the block header and block body are generated into the final first block.

The block header can also include the following information: description information (such as: version information, payload size, hash of all dependent block header hashes, the hash value of the root node of the transaction Merkle tree, the target value of the proof of work algorithm, etc. ).

The block body (that is, the payload) can also include any other data that can be stored.

The above hash can be calculated by any hash function, including MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-512, SHA-512 / 224, SHA-512 / 256, SHA- 3 etc.

In the above specific embodiment, it is necessary to verify whether the received first transaction information is valid before generating the first block. The first block of the first blockchain is related to 2G-1 blockchains, that is, all account groups G blockchains corresponding to transactions in the first account group, G-1 blockchains corresponding to transactions in all account groups except the first account group, so according to the The transaction information of the account group, that is, the blockchain related to the first blockchain, can determine whether the first transaction information is valid.

Based on the above embodiment, optionally, the method in this embodiment further includes:

The first node receives a block body on the second blockchain sent by a node corresponding to the fifth account group, the block body includes: second transaction information associated with the first account group; the second The blockchain is the blockchain corresponding to the first account group from the fifth account group; the second transaction information is formed by the transaction between the accounts of the fifth account group and the first account group ;

The first node verifies whether the data format of the block body is correct;

If it is correct, the block body is added to the second block chain stored by the first node.

Specifically, the first node receives the block body sent by other nodes, for example, the block body on the second block chain sent by the node corresponding to the fifth account group. The block body includes second transaction information related to the first account group, and the second transaction information is formed by transactions between the fifth account group and the accounts of the first account group. The second blockchain is the corresponding blockchain from the fifth account group to the first account group.

In actual applications, it is necessary to determine whether the block header corresponding to the block body is received. If it is not received, after receiving the block header, the first node verifies whether the data format of the block is correct; if it is correct, add In the second blockchain stored by the first node, the block body is forwarded to the nodes corresponding to the fifth account group and the first account group in the P2P network, and then the block header is forwarded to other nodes in the blockchain network. All nodes; if it is incorrect, the block is discarded without any processing.

Further, it can also be verified whether the random number in the block header meets the preset conditions of the proof of work POW, that is, whether the hash value of the block meets the preset requirements.

Further, the method of this embodiment further includes:

The first node receives a block body on a third blockchain sent by a node corresponding to the first account group, the block body includes: third transaction information associated with the first account group; the third The blockchain is the blockchain corresponding to the first account group to the sixth account group; the third transaction information is formed by transactions between the accounts of the first account group to the sixth account group;

The first node verifies whether the third transaction information is valid;

If the third transaction information is valid, the block body is added to the third block chain stored by the first node.

Specifically, the first node receives the block body sent by other nodes, for example, the block body on the third block chain sent by other nodes corresponding to the first account group. The block body includes third transaction information related to the first account group, and the second transaction information is formed by transactions between the accounts of the first account group to the sixth account group. The third blockchain is the blockchain corresponding to the first account group to the sixth account group.

In practical applications, it is necessary to determine whether the block header corresponding to the block body is received. If it is not received, after receiving the block header, the first node verifies that the data format of the block body is correct; if it is correct, and If the third transaction information is valid, it is added to the third blockchain stored by the first node, and the block body is forwarded to the nodes corresponding to the sixth account group and the first account group in the P2P network, and then the block header is forwarded Forward to all other nodes in the blockchain network to other nodes in the P2P network; if it is not correct, the block is discarded without any processing.

Optionally, the first node verifies whether the third transaction information is valid, which may be specifically implemented as follows:

The first node determines whether the transaction input corresponding to the third transaction information is from the seventh account group to the first account group according to the blockchain corresponding to the first account group from the seventh account group The transaction output corresponding to the transaction between the accounts;

If yes, the first node verifies the transaction output according to the blockchain corresponding to the first account group to the eighth account group, and is not used by the transaction between the accounts of the first account group to the eighth account group ; The seventh account group and the eighth account group are respectively any account group in the blockchain network;

If yes, it is determined that the third transaction information is valid.

The process of verifying whether the third transaction information is valid is similar to the process of verifying whether the first transaction information is valid in the foregoing embodiment, and details are not described here.

In the above specific embodiment, after receiving the block, it is necessary to verify whether the transaction information of the block body of the block is valid, and according to other blockchains related to the blockchain where the block is located, it can be determined whether the transaction information effective.

The first node receives the block header in the fourth blockchain sent by the second node, the block header includes: a hash value of the latest block that the block header depends on; the fourth blockchain is a zone Any blockchain in the blockchain network;

The first node verifies whether the block dependency of the block header in the fourth block chain is reasonable;

If the block dependency of the block header in the fourth block chain is reasonable, the block header is added to the fourth block chain stored by the first node.

Specifically, in addition to receiving other block bodies that rely on the blockchain, the first node will also receive all the block headers of the blockchain, specifically the block headers in the fourth blockchain sent by the second node. The second node may be a node corresponding to any account group in the blockchain network. The fourth blockchain is any blockchain in the blockchain network.

The block header includes: the hash value of the latest block header that the block header depends on.

The first node needs to verify whether the block dependency of the block header is reasonable; if it is reasonable, the block header is added to the fourth block chain stored by the first node and forwarded to other nodes in the P2P network; if unreasonable, Discard this block header without doing anything.

Optionally, assuming that the fourth blockchain is L (i1, j1), the block header of the received fourth blockchain is L (i1, j1) is B (i1, j1); the i1 j1 is an integer greater than or equal to 0 and less than or equal to G-1, the i1 and the j1 represent any account group in the blockchain network, and the first node verifies the fourth block Whether the block dependency of the block header in the chain is reasonable can be achieved in the following ways:

Step c. The first node determines the latest seventh block header Z (r1, s1) of any block chain L (r1, s1) according to the block header B (i1, j1); wherein, the r1 and s1 are integers greater than or equal to 0 and less than or equal to G-1;

Step d: The first node determines the blockchain L (r1, according to the block header B _i2 corresponding to the hash value of the i2th block header B _i2 included in the block header B (i1, j1) s1) the latest eighth block header Z '(r1, s1);

Step e. The first node determines whether the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are the same in the blockchain L (r, s) Bifurcation

If yes, when the eighth block header Z '(r1, s1) is newer than the seventh block header Z (r1, s1), update the seventh block header Z (r1, s1) to the The eighth block header Z '(r1, s1);

Increase i2 by one and repeat step de until i2 reaches 2G or the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are not in the blockchain L (r , s) stops execution on the same fork; where, the initial value of i2 is 1;

If all the eighth block header Z '(r1, s1) determined by the block header B _i2 are on the same blockchain L (r, s) as the seventh block header Z (r1, s1), then it is determined The block dependency of the block header in the fourth block chain is reasonable.

Specifically, first, the first node determines the latest seventh block header Z (r1, s1) of any blockchain L (r1, s1) according to the block header B (i1, j1), and then header B (i1, j1) includes a first header region B corresponding to the hash value of _a header region B _1, determining that the block chains L (r1, s1) of the latest header eighth region Z '( r1, s1), determine whether the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are on the same fork of the blockchain L (r, s); Block header B _{1 is} reasonable. If the eighth block header Z '(r1, s1) is newer than the seventh block header Z (r1, s1), update the seventh block header Z (r1, s1) to the eighth block header Z '(r1, s1);

Then, add 1 to i2, and then continue to perform the above steps until i2 reaches 2G or the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are not in the blockchain L (r, s) Stop execution on the same fork.

If the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are not on the same fork of the blockchain L (r, s), it means that the block header's dependence is problematic and cannot be When a correct ledger is formed, the verification is interrupted and the verification fails.

If all the eighth block header Z '(r1, s1) determined by the block header B _i2 are on the same blockchain L (r, s) as the seventh block header Z (r1, s1), the third The block dependency of the block header in the blockchain is reasonable.

The final determined Z (r1, s1) is the latest block of the blockchain, that is, each blockchain is finally determined.

Among them, if 2G-1 block headers are selected when selecting the block header that the first block depends on, the maximum value of i2 is 2G-1.

As shown in Figure 4, the fork of a blockchain is determined by the latest block. Generally, there is only one fork and no fork. During the formation of the blockchain, short forks are eventually abandoned , Keep the longest fork as the blockchain.

In the above specific embodiment, after receiving the block header of the block, it is necessary to verify whether the latest block header included in the block header is reasonable.

An embodiment of the present invention also provides a transaction data processing device based on a blockchain. The device is provided at a first node. The first node is a node corresponding to a first account group in a blockchain network. The blockchain The network includes G account groups and G × G blockchains, any one of the account groups to another any of the account groups corresponds to a blockchain, and the first account group is the blockchain For any account group in the network, G is an integer greater than 1; the transaction data processing device based on the blockchain includes:

A receiving module, configured to receive first transaction information; the first transaction information is formed by a transaction between accounts in the first account group to a second account group; the second account group is the block Any account group in the chain network;

The processing module is configured to generate a first block according to the first transaction information and add the first block to the first blockchain; the first blockchain is the first account group to The blockchain corresponding to the second account group.

Optionally, the processing module is specifically used for:

Before generating the first block according to the first transaction information, obtain the hash value of the block header that the first block depends on; the block header that the first block depends on can determine the blockchain Block headers of all blockchains in the network;

Optionally, if the first blockchain is L (i, j); i and j are integers greater than or equal to 0 and less than or equal to G-1, respectively, and i represents the first account group , J represents a second account group, and the processing module is specifically used to:

According to the first preset condition, select an initial block header from the verified block headers;

Choose one of the latest second block header B (i, m) from the G blockchains L (i, m), so that each block chain determined by the second block header B (i, m) The latest block header of is compatible with the latest block header of the corresponding blockchain determined by the initial block header; the value of m is an integer from 0 to G-1; the m represents the area Any account group in the blockchain network;

For different k, select the latest third block header B (k, l_k) from the G blockchains L (k, l_k), so that each item determined by the third block header B (k, l_k) The latest block header of the blockchain is compatible with the latest block header of the corresponding blockchain determined by the initial block header; the value of k is an integer from 0 to G-1, and k is not equal to i, l_k is an integer ranging from 0 to G-1; the k represents any account group except the first account group in the blockchain network, and the l_k represents the area Any account group in the blockchain network;

The initial block header, the second block header, and the third block header are used as the block header that the first block depends on, and the hash value of the block header that the first block depends on is calculated.

Optionally, if the block where the initial block header is located is block L (p, q), if i is equal to p, then m is not equal to q;

If the i is not equal to the p, k is not equal to p.

Optionally, the processing module is specifically used to perform the following steps:

After selecting an initial block header from the verified block headers according to the first preset condition, the latest fourth block header Z (r of the blockchain L (r, s) is determined according to the initial block header , s); wherein, r and s are integers greater than or equal to 0 and less than or equal to G-1, respectively;

Step a. Select a newest second block header B (i, m) from the block chain L (i, m), so that the second block header B (i, m) determines the block chain L ( r, s) the latest fifth block header Z '(r, s) and the fourth block header Z (r, s) are on the same fork of the blockchain L (r, s), and If the fifth block header Z '(r, s) is newer than the fourth block header Z (r, s), then the latest fourth block header Z of the blockchain L (r, s) (r, s) is updated to the fifth block header Z '(r, s);

Add one to m and repeat step a until m reaches G-1; where the initial value of m is 0;

Step b. Select the latest third block header B (k, l_k) from the block chain L (k, l_k), so that the block chain L () determined by the third block header B (k, l_k) r, s) The latest sixth block header Z ″ (r, s) and the fourth block header Z (r, s) are on the same fork of the blockchain L (r, s), and If the sixth block header Z ″ (r, s) is newer than the fourth block header Z (r, s), then the latest fourth block header Z of the blockchain L (r, s) (r, s) is updated to the sixth block header Z ″ (r, s);

Optionally, the processing module is also used to:

Before generating the first block according to the first transaction information, determine whether the transaction input corresponding to the first transaction information comes from the third account group according to the blockchain corresponding to the first account group from the third account group Transaction output corresponding to the transaction between the accounts of the first account group;

If so, verify that the transaction output is not used by transactions between the accounts of the first account group and the fourth account group according to the blockchain corresponding to the first account group to the fourth account group; The third account group and the fourth account group are respectively any account group in the blockchain network;

If yes, it is determined that the first transaction information is valid.

Optionally, the processing module is specifically used for:

Optionally, the receiving module is also used to:

Receiving the block body on the second blockchain sent by the node corresponding to the fifth account group, the block body including: second transaction information associated with the first account group; the second block chain is the first Blockchain corresponding to the first account group from the five account groups; the second transaction information is formed by transactions between the accounts of the fifth account group and the first account group;

The processing module is also used to:

The first node verifies whether the data format of the block body is correct;

Optionally, the receiving module is also used to:

The processing module is also used to:

The first node verifies whether the third transaction information is valid;

Optionally, the processing module is specifically used for:

Determining whether the transaction input corresponding to the third transaction information comes from the transaction output corresponding to the transaction between the accounts of the seventh account group and the first account group;

If yes, verify whether the transaction output is not used by transactions between the accounts of the first account group to the eighth account group; the seventh account group and the eighth account group are the blocks respectively Any account group in the chain network;

If yes, it is determined that the third transaction information is valid.

Optionally, the receiving module is also used to:

Receiving the block header in the fourth blockchain sent by the second node, the block header including: the hash value of the latest block header that the block header depends on; the fourth blockchain is any of the blockchain networks A blockchain;

Optionally, the processing module is specifically used for:

Verify whether the block dependency of the block header in the fourth blockchain is reasonable;

Optionally, assuming that the fourth blockchain is L (i1, j1), the block header of the received fourth blockchain is L (i1, j1) is B (i1, j1); the i1 j1 is an integer greater than or equal to 0 and less than or equal to G-1, the i1 and the j1 represent any account group in the blockchain network, and the processing module is specifically used to perform the following steps:

If the eighth block header Z '(r1, s1) determined by all block headers B _i2 is the same as the seventh block header Z (r1, s1) in the same blockchain L (r, s) On the above, it is determined that the block dependency of the block header in the fourth block chain is reasonable.

Optionally, the block header of the first block further includes: a hash value of the previous block in the first block chain, a hash value of the block body of the first block, and a time stamp .

Optionally, the processing module is also used to:

After adding the first block to the first blockchain, the block header of the first block is broadcast to all nodes in the blockchain network, and the block body of the first block Broadcast to the node corresponding to the first account group or the second account group, so that other nodes in the blockchain network can perform the received block header and / or block body of the first block verification.

The device of this embodiment may be used to execute the technical solutions of the above method embodiments, and its implementation principles and technical effects are similar, and are not repeated here.

FIG. 5 is a structural diagram of an embodiment of an electronic device provided by the present invention. As shown in FIG. 5, the electronic device includes:

A processor 501, and a memory 502 for storing executable instructions of the processor 501.

Optionally, it may further include: a communication interface 503 for communicating with other devices.

The above components can communicate through one or more buses.

The processor 501 is configured to execute the corresponding method in the foregoing method embodiments by executing the executable instructions. For the specific implementation process, reference may be made to the foregoing method embodiments, and details are not described herein again.

An embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the corresponding method in the foregoing method embodiment is implemented. For the specific implementation process, refer to the foregoing method implementation For example, the implementation principles and technical effects are similar, and will not be repeated here.

Those skilled in the art will easily think of other embodiments of the present disclosure after considering the description and practicing the invention disclosed herein. The present invention is intended to cover any variations, uses, or adaptive changes of the present disclosure that follow the general principles of the present disclosure and include common general knowledge or common technical means in the technical field not disclosed in the present disclosure. . The description and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are pointed out by the following claims.

It should be understood that the present disclosure is not limited to the precise structure that has been described above and shown in the drawings, and that various modifications and changes can be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

A blockchain-based transaction data processing method, characterized in that the method is applied to a first node, the first node is a node corresponding to a first account group in a blockchain network, and the blockchain network Includes G account groups and G × G blockchains, any one of the account groups to another any of the account groups corresponds to a blockchain, and the first account group is the blockchain network In any account group in G, G is an integer greater than 1; the method includes:

The first node receives first transaction information; the first transaction information is formed by a transaction between accounts in the first account group to a second account group; the second account group is the block Any account group in the chain network;

The first node generates a first block based on the first transaction information, and adds the first block to the first blockchain; the first blockchain sets the first account group to The blockchain corresponding to the second account group.
The method according to claim 1, wherein before the first node generates the first block according to the first transaction information, the method further comprises:

The first node obtains the hash value of the block header that the first block depends on; the block header that the first block depends on is a block header that can determine all the blockchains in the blockchain network;

The first node generating the first block according to the first transaction information includes:

The first node generates a first block based on the first transaction information and the hash value of the block header that the first block depends on.
The method according to claim 2, wherein if the first blockchain is L (i, j); i and j are integers greater than or equal to 0 and less than or equal to G-1, respectively , The i represents a first account group, the j represents a second account group, and the first node obtains the hash value of the block header that the first block depends on, including:

The first node selects an initial block header from the verified block headers according to the first preset condition;

The first node selects an up-to-date second block header B (i, m) from the G blockchains L (i, m), so that the second block header B (i, m) determines The latest block header of each blockchain is compatible with the latest block header of the corresponding blockchain determined by the initial block header; the value of m is an integer from 0 to G-1; m represents any account group in the blockchain network;

For different k, the first node selects the latest third block header B (k, l_k) from the G blockchains L (k, l_k), so that the third block header B (k, l_k) The latest block header of each block chain determined is compatible with the latest block header of the corresponding block chain determined by the initial block header; the value range of k is an integer from 0 to G-1 , And k is not equal to i, the value range of l_k is an integer from 0 to G-1; the k represents any account group in the blockchain network except the first account group, the l_k represents any account group in the blockchain network;

The first node uses the initial block header, the second block header, and the third block header as the block header that the first block depends on, and calculates the block header that the first block depends on Hash value.
The method according to claim 3, characterized in that, if the initial block header block chain is the block chain L (p, q), then if the i is equal to the p, the m Not equal to q;

If the i is not equal to the p, k is not equal to p.
The method according to claim 4, wherein after the first node selects an initial block header from the verified block headers according to the first preset condition, the method further includes:

Determine the latest fourth block header Z (r, s) of the blockchain L (r, s) according to the initial block header; wherein, r and s are respectively greater than or equal to 0 and less than or equal to G An integer of -1;

Correspondingly, the first node selects the latest second block header B (i, m) from the G blockchains L (i, m), including:

Step a. The first node selects a newest second block header B (i, m) from the blockchain L (i, m), so that the second block header B (i, m) determines the The latest fifth block header Z '(r, s) of the blockchain L (r, s) and the fourth block header Z (r, s) are the same in the blockchain L (r, s) On a fork, and if the fifth block header Z '(r, s) is newer than the fourth block header Z (r, s), then the latest of the blockchain L (r, s) The fourth block header Z (r, s) is updated to the fifth block header Z '(r, s);

Add one to m and repeat step a until m reaches G-1; where the initial value of m is 0;

Correspondingly, for different k, the first node selects the latest third block header B (k, l_k) from the G blockchains L (k, l_k), including:

Step b. The first node selects the latest third block header B (k, l_k) from the blockchain L (k, l_k), so that the third block header B (k, l_k) determines the The latest sixth block header Z ″ (r, s) of the blockchain L (r, s) and the fourth block header Z (r, s) are the same in the blockchain L (r, s) On a fork, and if the sixth block header Z ″ (r, s) is newer than the fourth block header Z (r, s), then the latest of the blockchain L (r, s) The fourth block header Z (r, s) is updated to the sixth block header Z ″ (r, s);

Add one to k and repeat step b until k reaches G-1; where the initial value of k is 0 and k is not equal to i.
The method according to any one of claims 2-5, wherein before the first node generates the first block according to the first transaction information, the method further includes:

The first node determines whether the transaction input corresponding to the first transaction information is from the account of the third account group to the first account group according to the blockchain corresponding to the first account group from the third account group The transaction output corresponding to the transaction between;

If yes, the first node verifies the transaction output according to the blockchain corresponding to the first account group to the fourth account group. Use of transactions between; the third account group and the fourth account group are respectively any account group in the blockchain network;

If yes, it is determined that the first transaction information is valid.
The method according to claim 6, wherein the first node generates the first block based on the first transaction information and the hash value of the block header that the first block depends on, including:

The first node determines the random number by using the proof-of-work algorithm according to the second preset condition;

The first node generates the block header of the first block according to the preset block header data structure according to the hash value of the block header that the first block depends on and the random number;

The first node generates the block body of the first block according to the preset data structure of the block body of the valid first transaction information;

The first node combines the block header and the block body to form the first block.
The method according to any one of claims 1-5, further comprising:

The first node receives a block body on the second blockchain sent by a node corresponding to the fifth account group, the block body includes: second transaction information associated with the first account group; the second The blockchain is the blockchain corresponding to the first account group from the fifth account group; the second transaction information is formed by the transaction between the accounts of the fifth account group and the first account group ;

The first node verifies whether the data format of the block body is correct;

If it is correct, the block body is added to the second block chain stored by the first node.
The method according to any one of claims 1-5, further comprising:

The first node receives a block body on a third blockchain sent by a node corresponding to the first account group, the block body includes: third transaction information associated with the first account group; the third The blockchain is the blockchain corresponding to the first account group to the sixth account group; the third transaction information is formed by transactions between the accounts of the first account group to the sixth account group;

The first node verifies whether the third transaction information is valid;

If the third transaction information is valid, the block body is added to the third block chain stored by the first node.
The method according to claim 9, wherein the first node verifies whether the third transaction information is valid, including:

The first node determines whether the transaction input corresponding to the third transaction information is from the seventh account group to the first account group according to the blockchain corresponding to the first account group from the seventh account group The transaction output corresponding to the transaction between the accounts;

If yes, the first node verifies whether the transaction output is not based on the accounts from the first account group to the eighth account group according to the blockchain corresponding to the first account group to the eighth account group Use of transactions between; the seventh account group and the eighth account group are respectively any account group in the blockchain network;

If yes, it is determined that the third transaction information is valid.
The method according to any one of claims 1-5, further comprising:

The first node receives the block header in the fourth blockchain sent by the second node, the block header includes: a hash value of the latest block header that the block header depends on; the fourth blockchain is a zone Any blockchain in the blockchain network;

The first node verifies whether the block dependency of the block header in the fourth block chain is reasonable;

If the block dependency of the block header in the fourth block chain is reasonable, the block header is added to the fourth block chain stored by the first node.
The method according to claim 11, characterized in that, assuming that the fourth blockchain is L (i1, j1), the received fourth blockchain is L (i1, j1) and the block header is B ( i1, j1); i1, j1 are integers greater than or equal to 0 and less than or equal to G-1, respectively, i1 and j1 represent any account group in the blockchain network, the A node verifies whether the block dependency of the block header in the fourth blockchain is reasonable, including:

Step c. The first node determines the latest seventh block header Z (r1, s1) of any block chain L (r1, s1) according to the block header B (i1, j1); wherein, the r1 and s1 are integers greater than or equal to 0 and less than or equal to G-1;

Step d: The first node determines the blockchain L (r1, according to the block header B i2 corresponding to the hash value of the i2th block header B i2 included in the block header B (i1, j1) s1) the latest eighth block header Z '(r1, s1);

Step e. The first node determines whether the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are the same in the blockchain L (r, s) Bifurcation

If yes, when the eighth block header Z '(r1, s1) is newer than the seventh block header Z (r1, s1), update the seventh block header Z (r1, s1) to the The eighth block header Z '(r1, s1);

Increase i2 by one and repeat step de until i2 reaches 2G or the seventh block header Z (r1, s1) and the eighth block header Z '(r1, s1) are not in the blockchain L (r , s) stops execution on the same fork; where, the initial value of i2 is 1;

If the eighth block header Z '(r1, s1) determined by all block headers B i2 is the same as the seventh block header Z (r1, s1) in the same blockchain L (r, s) On the above, it is determined that the block dependency of the block header in the fourth block chain is reasonable.
The method according to any one of claims 1-5, wherein after adding the first block to the first blockchain, the method further comprises:

The first node broadcasts the block header of the first block to all nodes in the blockchain network, and broadcasts the block body of the first block to the first account group or The node corresponding to the second account group, so that other nodes in the blockchain network can verify the received block header and / or block body of the first block.
A computer-readable storage medium on which a computer program is stored, characterized in that, when the computer program is executed by a processor, the method according to any one of claims 1-13 is implemented.
An electronic device, characterized in that it includes:

Processor; and

A memory for storing executable instructions of the processor;

Wherein, the processor is configured to execute the method of any one of claims 1-13 via executing the executable instructions.