WO2020220251A1

WO2020220251A1 - Data processing method for blockchain system and block generating method

Info

Publication number: WO2020220251A1
Application number: PCT/CN2019/085154
Authority: WO
Inventors: 郑桂珊
Original assignee: 厦门特华荣商贸有限公司
Priority date: 2019-04-30
Filing date: 2019-04-30
Publication date: 2020-11-05
Also published as: CN110235162B; CN110235162A

Abstract

Disclosed in embodiments of the present application are a data processing method for a blockchain system and a block generating method. The generating method comprises: acquiring a local chain identity, a pre-hash, a parent hash, a child hash and a not-yet-packaged transaction list, wherein the local chain identity is used for labeling a chain to which a local block belongs, the pre-hash is used for pointing to the previous block of the local chain, the parent hash is used for pointing to a block of a parent chain, the child hash is used for pointing to a block of a child chain, and a chain identity carried by each transaction in the not-yet-packaged transaction list is the local chain identity, so that the transaction list in each chain only contains transactions of the local chain; and filling the local chain identity, the pre-hash, the parent hash, the child hash and the not-yet-packaged transaction list in a block format so as to generate a new block. The data processing method comprises the described generating method. The present application may increase the processing capacity of the entire blockchain system, thereby improving the TPS of the system.

Description

Block chain system data processing method and block generation method

Technical field

This application relates to the field of blockchain technology, and in particular to a method for processing blockchain system data and a method for generating blocks.

Background technique

Blockchain technology, also known as distributed ledger technology, is a distributed Internet database technology. A network constructed based on blockchain technology can be called a blockchain network. The blockchain network (or blockchain technology) has the characteristics of decentralization, openness and transparency, immutability, and trustworthiness.

Blockchain technology has three basic concepts:

Transaction: An operation on the ledger, which leads to a change in the state of the ledger, such as adding a transfer record;

Block: Record all transactions and status results that occurred within a period of time, which is a consensus on the current ledger status;

Chain: A chain of blocks in the order of occurrence, which is a log record of changes in the state of the entire ledger.

The structure of the block includes the pre-Hash (Pre Hash), other information of the block (Meta Data) and the transaction list (Transactions). The data structure of the blockchain is a chain data structure.

The chained data structure facilitates data synchronization between nodes in a distributed system. The latest block contains the hash value of the previous block. Modifying any character in the middle will cause the hash to change. , Cannot be verified, so it is not tamperable. But because it is serial data, the data verification must be serial, which makes the processing capacity of the entire system limited; expansion can only be done by modifying the block time interval or block size, and the expansion capacity is limited; this restricts the blockchain Usage scenarios.

TPS (Transactions Per Second) is also called "system throughput", that is, "the number of transactions that the system can process per second."

In the current blockchain system, a system consists of a chain. The TPS value of such a blockchain system is too low. Based on historical data before 2018, the TPS of the three mainstream blockchain systems: Bitcoin's TPS is about 3 to 7, Ethereum's TPS is about 15 to 30, and EOS's TPS is about 1000 to 3000. pen. However, any single-threaded system has a processing power much higher than this value.

Summary of the invention

This application proposes a block chain system data processing method and a block generation method, which can support concurrent processing of data under the condition that the block chain technology is satisfied, thereby improving the processing capacity of the entire block chain system.

In the first aspect, a block generation method of the present application includes:

Get the chain ID, previous hash, parent hash, child hash and list of unpackaged transactions;

The local chain identifier is used to mark the chain to which this block belongs;

The previous hash is used to point to the previous block of this chain;

The parent hash is used to point to the block of the parent chain;

The sub-hash is used to point to the block of the sub-chain;

The chain identifier carried by each transaction of the unpackaged transaction list is the own chain identifier, so that the transaction list in each chain only contains transactions of the own chain;

The own chain identifier, the previous hash, the parent hash, the child hash, and the unpackaged transaction list are filled according to the block format to generate a new block.

In some preferred embodiments, obtaining the previous hash includes: selecting a chain, and obtaining the hash of the last block of the chain as the previous hash;

Obtaining the parent hash includes: if the chain to which this block belongs has a parent chain, obtaining the hash of the block pointing to the parent chain as the parent hash;

Obtaining the sub-hash includes: if there is a sub-chain in the chain to which the current block belongs, obtaining the hash of the block that the current block points to the sub-chain as the sub-hash.

In some preferred implementations, the obtaining the hash of the block whose current block points to the parent chain as the parent hash is specifically:

Use the hash of the last block of the parent chain as the parent hash;

Or, the hash of the block whose time stamp in the parent chain and the time stamp of the current block is within the threshold time difference is used as the parent hash.

In some preferred implementations, the obtaining the hash of the block pointing to the sub-chain of the current block as the sub-hash specifically includes:

The hash of the block whose time stamp in the sub-chain and the time stamp of the current block is within the threshold time difference is used as the sub-hash.

In some preferred embodiments, the method further includes: obtaining other information of the block, and filling the other information according to the block format to generate the new block.

In the second aspect, this application provides a blockchain system data processing method, including:

Verify that the hash of the new block is legal;

Verifying whether the previous hash of the new block is correct;

Verifying whether the parent hash and child hash of the new block meet the first verification condition;

Verify the transactions in the transaction list of the new block;

Query the parent chain according to the parent hash, if there is a transaction that transfers data from the parent chain, and the block to which the data transferred from the parent chain belongs is before the block to which the parent hash belongs, Modify the data of the specified account;

Query the sub-chain based on the sub-hash, if there is a transaction that transfers data from the sub-chain, and the block to which the data-transferred-in transaction from the sub-chain belongs is before the block to which the sub-hash belongs, Modify the data of the specified account.

In some preferred embodiments, the verifying whether the parent hash and the child hash of the new block meet the first verification condition includes:

Determine whether the difference between the time stamp of the block to which the parent hash belongs and the time stamp of the new block is within the threshold time difference; Whether the time stamp difference of the new block is within the threshold time difference.

In some preferred embodiments, the verification of the transaction in the transaction list of the new block includes: processing the transaction based on the operation code of the transaction.

In some preferred embodiments, the transaction-based operation code processing transaction includes transfer transactions, cross-chain data transfer transactions, and creation of new chain transactions.

In some preferred embodiments, the verifying the transaction list in the transaction list of the new block further includes:

Verify that the digital signature of the transaction is legal;

Verify whether the chain identifier carried in the transaction is consistent with the local chain identifier of the new block;

Verify whether the transaction operation code is supported;

Verify that the source of the digital currency is correct and the amount is correct.

In some preferred implementations, it further includes: if a certain block is discarded, also discarding the block with the certain block as the child hash or the parent hash.

In some preferred embodiments, the above-mentioned generating method is included.

In the third aspect, this application also provides a blockchain system data processing method, including: creating one or more sub-chains for a chain; the above-mentioned generating method.

In a fourth aspect, the present application provides a computer device, which includes:

One or more processors;

Memory, used to store one or more programs;

The one or more programs may be executed by the one or more processors to realize the above method.

In a fifth aspect, the present application provides a computer-readable storage medium in which program instructions are stored, and when the program instructions are executed by a processor of a computer, the processor executes the foregoing method.

Compared with the prior art, the beneficial effects of this application are:

The structure of the block is improved so that the block chain system includes multiple parallel chains. Parent hash and child hash can ensure the traceability of the blockchain system. In this way, according to the parent hash and child hash of the block, transactions of related blocks in the parent chain and the child chain can be queried respectively, and data can be modified according to the query result. Allows computing nodes to conduct concurrent transactions through different blocks, and can change the serial processing of data to parallel processing, which can improve the processing capacity of the entire blockchain system, thereby improving the TPS of the system.

Description of the drawings

FIG. 1 is a schematic diagram of the structure of the blockchain system of the first embodiment of the application;

Figure 2 is a diagram of the logical relationship between chains in the first embodiment of this application;

Figure 3 shows the block structure of the first embodiment of the present application;

4 is a flowchart of a block generation method according to the first embodiment of the application;

Fig. 5 shows the block chain data structure of the block chain system of the first embodiment of the present application;

Fig. 6 is a flowchart of a blockchain system data processing method according to the first embodiment of the application;

FIG. 7 shows another blockchain data structure of the blockchain system of the first embodiment of the present application;

FIG. 8 shows a third blockchain data structure of the blockchain system of the first embodiment of the present application;

9 is a flowchart of step S11 in the second embodiment of this application;

Fig. 10 is a schematic structural diagram of a computer device according to a third embodiment of the application.

Detailed ways

In order to make the technical problems, technical solutions, and beneficial effects to be solved by the embodiments of the present application clearer, the following further describes the present application in detail with reference to FIGS. 1 to 10 and embodiments. It should be understood that the specific embodiments described herein are only used to explain the application, and not used to limit the application.

The terms "first" and "second" are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined with "first" and "second" may explicitly or implicitly include one or more of these features. In the description of the embodiments of the present application, "plurality" means two or more, unless otherwise specifically defined.

First embodiment

The blockchain system of this embodiment includes multiple units. Referring to FIG. 1, it specifically includes a data synchronization unit 1, a transaction processing unit 2, a block generation unit 3, a block processing unit 4, a transaction generation unit 5, and a storage unit 6.

Data synchronization unit 1: used to share transactions or blocks with other computing nodes; or used to obtain new transactions and blocks from other computing nodes, and to transfer new blocks or transactions (including self-created or obtained from other nodes) To all connected computing nodes.

Transaction processing unit 2: Used to process transactions in the block when the block is legal.

Block generation unit 3: Used to generate new blocks. Block processing unit 4: used to verify whether the block is legal.

Transaction generating unit 5: used to create a specified transaction (such as a transfer operation) according to a user's operation, and send the transaction to other computing nodes through the data synchronization unit.

Storage unit 6: used to store block data, unpackaged transaction data, and data generated by system operation.

This embodiment provides a block chain system data processing method, which includes a block generation method. The block generation method can also be called the block chain expansion method. In this embodiment, the block generation method is executed by the block generation unit 3.

The blockchain system of this embodiment initially has only one chain, but this chain can add child chains as needed, so that there are parent chains and child chains in the system, and each chain can add child chains as needed, so that The blockchain system includes multiple chains. Specifically, if a certain chain a creates a new chain b, then chain a is called the parent chain of chain b, and chain b is called the child chain of chain a.

If a chain only allows one sub-chain, then in the entire system, the logical relationship diagram between the chain and the chain is in the shape of a linked list. Referring to Figure 2, if a chain can create two sub-chains, then the logical relationship diagram between the chain and the chain is in the shape of a binary tree. If a chain can create three sub-chains, then the logical relationship diagram between the chain and the chain is in the shape of a trigeminal tree.

In this embodiment, the structure of the blocks of the parent chain and the child chain is the same. Referring to FIG. 3, the block structure of this embodiment includes the own chain identifier, pre-hash (Pre Hash), parent hash (Parent Hash), child hash (Child Hash), other block information (Meta Data), and Transaction list (Transactions).

To generate a block with the above-mentioned block structure, referring to FIG. 4, the block generation method of this embodiment includes steps S1 to S7.

Step S1: Obtain the own chain identifier.

Chain ID (Chain ID) is the identifier of the chain in the blockchain system and is unique.

This chain identifier is used to identify the chain to which this block belongs. This block refers to the block to be added. The chain to which this block belongs refers to the chain to which the new block belongs, and a chain in the entire system can be randomly selected. The entire system can have multiple chains, and different chains have different chain identifiers. In this embodiment, this chain is the second chain of the system. In this way, this chain ID is the ID of the second chain of the system, where the second chain is a sub-chain of the first chain of the system.

In this embodiment, the chain identifier of the new chain is the parent chain ID*2 or ID*2+1. Regarding the number of sub-chains and ID generation rules, as long as the chain identifiers do not conflict. Referring to Fig. 5, the own chain ID of the first chain C1 is equal to 1, and the own chain ID of the second chain C2 is equal to 2.

Step S2, obtain the front hash.

The previous hash is used to point to the previous block of this chain. In this embodiment, this chain is the second chain of the system. Obtaining the previous hash is to use the hash of the last block of the second chain as the previous hash.

The value of the previous hash must point to the previous block, so its value is unique.

Step S3: Obtain the parent hash.

The parent hash is used to point to the block of the parent chain. The first chain of the system has no parent chain, and the value of the parent hash is empty. In addition, the parent hash of the first block of the chain can also be empty. In this embodiment, the chain to which this block belongs is the second chain, and there is a parent chain. The parent chain of the second chain is the first chain. This block points to the block of the first chain, it can point to the last block of the first chain, or it can point to the difference between the timestamp in the first chain and the timestamp of this block within the threshold time difference The block within the value. The threshold time difference is a value or a range. In this embodiment, the threshold time difference is less than or equal to 1 hour.

Therefore, to obtain the parent hash is to use the hash of the block pointing to the first chain as the parent hash.

Step S4: Obtain the sub-hash.

The sub-hash is used to point to the block of the sub-chain. This block can refer to a block in which the difference between the timestamp in the sub-chain and the timestamp of this block is within the threshold time difference. The threshold time difference is a value or a range. In this embodiment, the threshold time difference is less than or equal to 1 hour.

Therefore, if the chain to which this block belongs has a sub-chain, obtaining the sub-hash is to use the hash of the block pointing to the sub-chain as the sub-hash.

When this chain, that is, the second chain, has not created a child chain, the value of the child hash is empty.

For the first chain C1, referring to Figure 5, the first chain C1 creates a child chain, that is, the second chain C2. The first chain C1 includes block Bi, block Bi+1 and block Bi+2. The second chain C2 includes block B1, block B2, and block B3. The second chain C2 is created based on the block Bi of the first chain C1, and the sub-hash in the block Bi is the first block of the second chain C2. In the first chain C1, the value of the sub-hash of the block after the block Bi is non-empty.

Block verification: The sub-hash block is stored in the sub-chain. Referring to Figure 5, the block Bi+2 of the first chain C1 points to the block B2 of the second chain C2.

Block verification: The parent hash block is stored in the parent chain. Referring to Figure 5, the block B3 of the second chain C2 points to the block Bi+1 of the first chain C1.

Referring to Figure 5, the dashed lines are used for the direction of the child hash and the parent hash, indicating that its value is not unique. Specifically, the sub-hash of the block Block i+2 in the first chain can be the block Block1 in the second chain, or it can be the block Block2.

The limiting condition of the child hash and the parent hash is: the difference between the timestamp t1 of the current block and the timestamp t2 of the target block is within the threshold time difference; in this embodiment, the timestamp t1 and the timestamp t2 The time difference ranges from 0 to 1 hour. Different blocks will complete processing transactions at different times. The advantage of this is that different chains can process data concurrently in an efficient and orderly manner.

Step S5: Obtain a list of unpackaged transactions.

If there are transactions in the transaction list, each transaction carries the chain identifier of the chain to which it belongs. The chain identifier carried by each transaction in the unpackaged transaction list is the own chain identifier, that is, the chain identifier of the second chain, so that the transaction list in each chain only contains the transactions of this chain.

The chain ID in the transaction is equal to the chain ID of the block, so that the transaction clearly belongs to a different chain, and it is convenient to concurrently verify the validity of the transaction.

Step S6: Obtain other information of the block. That is, to obtain other information about the block to be generated. Other information includes but is not limited to version information and time stamps.

Other information of the block is optional for the block structure.

Step S7: Fill in the own chain ID, previous hash, parent hash, child hash, other information of the block, and unpackaged transaction list according to the block format to generate a new block. The new block can be the first block of the system or the block after the first block.

After a new block is generated, the new block is shared with all computing nodes.

In order to process the received new block, referring to FIG. 6, the block chain system data processing method of this embodiment further includes steps S8 to S13. In this embodiment, steps S8 to S13 are executed by the block processing unit 4.

Step S8, verify whether the hash of the new block is legal.

After the data synchronization unit 1 receives the new block, the block processing unit 4 verifies whether the hash of the block is legal. If the hash is illegal, the block is also illegal. The hash of each block needs to meet certain conditions, which can be set according to the needs of the system.

Step S9, verify whether the previous hash of the new block is correct.

That is, verify whether the hash of the previous block of the new block in the second chain is correct. If it is incorrect, the new block is illegal.

Step S10, verify whether the parent hash and child hash of the new block meet the first verification condition.

Step S10 specifically includes: whether the difference between the time stamp of the block to which the parent hash belongs and the time stamp of the new block is within the threshold time difference; if not, the verification fails; the time of the block to which the child hash belongs Whether the difference between the stamp and the timestamp of the new block is within the threshold time difference, if not, the verification fails. Then, the first verification condition is: whether the difference between the timestamp of the block to which the parent hash belongs and the timestamp of the new block is within the threshold time difference, and the timestamp of the block to which the child hash belongs and the new block Whether the difference between the timestamps of the block is within the threshold time difference.

The parent hash of the new block can also be verified as follows: whether the block to which the parent hash belongs is the last block of the parent chain of the block to which the parent hash belongs, if not, the verification fails. Then, for the parent hash of a new block, the first verification condition is: whether the block to which the parent hash belongs is the last block of the parent chain to which the block to which the parent hash belongs.

If the hash does not exist or the difference is not within the threshold time difference, the verification fails.

Step S11, verify the transactions in the transaction list of the new block.

The verification of the transaction is for the subsequent processing of the block transaction.

Step S12: Query the parent chain based on the parent hash. If there is a transaction that transfers data from the parent chain, and the block of the transaction that transfers data from the parent chain belongs to the block before the parent hash belongs, modify the designation Account data.

Specifically, the first chain is queried according to the parent hash of the new block. If there is a transaction that transfers data from the first chain, specifically there is a transfer from the first chain to this chain, and the transaction If the block belongs to before the block to which the parent hash belongs, the data of the specified account is modified, specifically, the specified digital currency is added to the specified account.

Step S13: Query the sub-chain according to the sub-hash. If there is a transaction that transfers data from the sub-chain, and the block of the transaction that transfers data from the sub-chain belongs to before the block to which the sub-hash belongs, modify the designation Account data.

Referring to Fig. 7, in this embodiment, the current chain, that is, the child chain of the second chain C2, is the third chain C3 of the system. Specifically, the third chain C3 is queried according to the sub-hash of the new block. If there is a transaction transferring data from the third chain C3, specifically, there is a transfer from the third chain C3 to this chain. And the block to which the transaction belongs is before the block to which the sub-hash belongs, the data of the specified account is modified, specifically, the specified digital currency is added to the specified account.

Although the existing blockchain is distributed, only the distribution of data is distributed, and data processing needs to be processed by each computing node. Because it is a single-chain structure, in order to ensure the consistency of the processing results of all nodes, data can only be processed serially. The TPS of the blockchain depends on the block size, block generation time and serial processing capabilities.

In order to improve the processing capacity of the blockchain system, the blockchain can be expanded in some way, such as changing the block size limit and accelerating the block generation speed, etc., to expand the blockchain. The traditional expansion method is only to adjust the block size limit and adjust the block generation time, and the performance improvement is limited.

In contrast, this embodiment improves the structure of the block, so that the block chain system includes multiple parallel chains. Parent hash and child hash can ensure the traceability of the blockchain system. In this way, according to the parent hash and child hash of the block, transactions of related blocks in the parent chain and the child chain can be queried respectively, and data can be modified according to the query result. Allows computing nodes to conduct concurrent transactions through different blocks, and can change the serial processing of data to parallel processing, which can improve the processing capacity of the entire blockchain system, thereby improving the TPS of the system.

In the blockchain system of this embodiment, if the number of bits of the chain identification is 64 bits, the entire system can have 2^64 chains. If the TPS of a chain is 7, then the TPS limit of the entire system is 7*2^64. The TPS limit of the system increases exponentially as the number of chain identification bits increases. If the system uses optimization technologies such as Ethereum and EOS (Enterprise Operation System, commercial distributed design blockchain operating system), the TPS limit can continue to increase.

In this embodiment, the consensus algorithm of the blockchain is superimposed and enhanced.

The verification of invalid blocks is explained.

As shown in Figure 8, block B2' of the second chain C2 was also a valid block when it was first generated, but over time, it was finally abandoned based on consensus, resulting in block Bi+2 of the first chain C1 It is an unrecognized block. The sub-hash of block Bi+2 is block B2' in the second chain C2, so block Bi+2 is also discarded. If the parent hash of a block in the second chain C2 is block Bi+2, then this block will also be discarded.

Second embodiment

Referring to FIG. 9, step S11 to verify the transactions in the transaction list of the new block specifically includes steps S111 to S115. In this embodiment, step S11 is executed by the transaction processing unit 2.

Step S111, verify whether the digital signature of the transaction is legal.

Step S112: It is verified whether the chain identifier carried in the transaction is consistent with the local chain identifier of the new block. That is, verify whether the chain ID of the transaction is consistent with the chain ID of the block.

Step S113, verify whether the transaction operation code is supported.

Each transaction has corresponding information such as digital signature and operation code. Opcodes are used to process transactions. The default operation code is the transfer transaction code. If supported, the transaction is processed based on the opcode.

Step S114, verify whether the source of the digital currency is correct and whether the amount is correct.

Step S115: Process the transaction based on the operation code of the transaction.

The operation codes in this embodiment include, but are not limited to, transfer transaction codes, cross-chain transfer data codes, and create sub-chain codes. Correspondingly, transactions that can be processed include transfer transactions, cross-chain data transfer transactions, and creation of new chain transactions.

Transfer transactions: modify the amount of digital currency transferred into and out of the account.

For cross-chain transfer of data transactions, take cross-chain transfer as an example:

Verify whether the chain identity of the target chain is legal. If the target chain does not exist yet, it is an illegal operation;

Deduct the digital currency transferred out of the account;

In the target chain (parent chain or child chain), add a record of transferred data and wait for the target chain to process the record.

The cross-chain transfer data transaction in this embodiment will be specifically described.

The user creates a transaction to transfer the tokens on the first chain C1 to the second chain C2. Referring to Figure 5, the transaction is confirmed and included in block Bi+1, and the user's corresponding tokens are deducted. The block B3 of the second chain C2 points to the block Bi+1 of the first chain C1, and it is found that there is a transaction to the second chain C2, and the system automatically adds corresponding tokens to the user on the second chain C2 . Block B2 of the second chain C2 only relies on block Bi, so in block B2, the user does not have tokens, and only when it reaches block B3, will there be tokens. In this way, data is transferred across chains.

The creation of a new chain transaction specifically includes:

Verify whether the conditions are met; in this embodiment, it takes a certain amount of digital currency to allow the creation of a new chain;

Verify whether the chain ID of the new chain is legal; in this embodiment, the chain ID of the new chain divided by 2 must be equal to the chain ID of this chain;

Verify whether the chain identity of the new chain already exists, and ignore the transaction if it exists;

If the above verifications are passed, the specified new chain is created.

The third embodiment

Referring to FIG. 10, this embodiment provides a computer device. The computer device includes: one or more processors 7 and a memory 8. The memory 8 is used to store one or more programs.

One or more programs may be executed by one or more processors 7 to realize the methods of the above-mentioned embodiments.

A person of ordinary skill in the art can understand that all or part of the procedures in the method of the embodiment can be completed by a computer program instructing the relevant hardware. The program can be stored in a computer readable storage medium. When the program is executed, it can include the implementation of various methods. Example process. The aforementioned storage media include: ROM or random storage RAM, magnetic disks or optical discs and other media that can store program codes.

The above content is a further detailed description of the application in combination with specific/preferred implementations, and it cannot be considered that the specific implementation of the application is limited to these descriptions. For those of ordinary skill in the technical field to which this application belongs, without departing from the concept of this application, they can also make several substitutions or modifications to the described implementations, and these substitutions or modifications should be regarded as It belongs to the protection scope of this application.

Claims

A block generation method, which is characterized in that it includes:

Get the chain ID, previous hash, parent hash, child hash and list of unpackaged transactions;

The local chain identifier is used to mark the chain to which this block belongs;

The previous hash is used to point to the previous block of this chain;

The parent hash is used to point to the block of the parent chain;

The sub-hash is used to point to the block of the sub-chain;

The chain identifier carried by each transaction of the unpackaged transaction list is the own chain identifier, so that the transaction list in each chain only contains transactions of the own chain;

The own chain identifier, the previous hash, the parent hash, the child hash, and the unpackaged transaction list are filled according to the block format to generate a new block.
The generating method according to claim 1, wherein:

Obtaining the previous hash includes: selecting a chain, and acquiring the hash of the last block of the chain as the previous hash;

Obtaining the parent hash includes: if the chain to which this block belongs has a parent chain, obtaining the hash of the block pointing to the parent chain as the parent hash;

Obtaining the sub-hash includes: if there is a sub-chain in the chain to which the current block belongs, obtaining the hash of the block that the current block points to the sub-chain as the sub-hash.
The generating method according to claim 2, wherein:

The obtaining the hash of the block whose current block points to the parent chain as the parent hash is specifically:

Use the hash of the last block of the parent chain as the parent hash;

Or, use the hash of the block whose time stamp in the parent chain and the time stamp of the current block is within the threshold time difference as the parent hash;

The obtaining the hash of the block that the current block points to the sub-chain as the sub-hash specifically includes:

The hash of the block whose time stamp in the sub-chain and the time stamp of the current block is within the threshold time difference is used as the sub-hash.
A data processing method for blockchain system, which is characterized in that it comprises:

Verify that the hash of the new block is legal;

Verifying whether the previous hash of the new block is correct;

Verifying whether the parent hash and child hash of the new block meet the first verification condition;

Verify the transactions in the transaction list of the new block;

Query the parent chain according to the parent hash, if there is a transaction that transfers data from the parent chain, and the block to which the data transferred from the parent chain belongs is before the block to which the parent hash belongs, Modify the data of the specified account;

Query the sub-chain based on the sub-hash, if there is a transaction that transfers data from the sub-chain, and the block to which the data-transferred-in transaction from the sub-chain belongs is before the block to which the sub-hash belongs, Modify the data of the specified account.
The blockchain system data processing method according to claim 4, wherein said verifying whether the parent hash and the child hash of the new block meet the first verification condition comprises:

Determine whether the difference between the time stamp of the block to which the parent hash belongs and the time stamp of the new block is within the threshold time difference; Whether the time stamp difference of the new block is within the threshold time difference.
The block chain system data processing method according to claim 4 or 5, wherein the verification of the transaction list in the transaction list of the new block comprises: processing the transaction based on the operation code of the transaction; Transaction-based opcode processing transactions include transfer transactions, cross-chain transfer data transactions, and creation of new chain transactions.
The block chain system data processing method according to claim 4, characterized by comprising the generating method according to any one of claims 1 to 3.
A data processing method for blockchain system, which is characterized in that it comprises:

Create one or more sub-chains for a chain;

The production method according to any one of claims 1 to 3.
A computer device, characterized in that the computer device includes:

One or more processors;

Memory, used to store one or more programs;

The one or more programs may be executed by the one or more processors to implement the method according to any one of claims 1 to 7.
A computer-readable storage medium, characterized in that: the computer-readable storage medium stores program instructions, and when the program instructions are executed by a processor of a computer, the processor executes any one of claims 1 to 7 The method described in the item.