WO2019024631A1

WO2019024631A1 - Blockchain lightweight processing method, blockchain node and storage medium

Info

Publication number: WO2019024631A1
Application number: PCT/CN2018/093377
Authority: WO
Inventors: 阎军智
Original assignee: 中国移动通信有限公司研究院; 中国移动通信集团有限公司
Priority date: 2017-08-03
Filing date: 2018-06-28
Publication date: 2019-02-07
Also published as: CN109391643A; CN109391643B

Abstract

Provided are a blockchain lightweight processing method, a blockchain node, and a computer storage medium. The blockchain lightweight processing method applied to a first blockchain node comprises: according to block information about an original block to be deleted, generating and storing an optimized block comprising a block header and a block body; and after the optimized block is generated, deleting the original block to be deleted.

Description

Blockchain lightweight processing method, blockchain node and storage medium

Cross-reference to related applications

Priority is claimed on Japanese Patent Application No. 201710657350.9, filed on Jan. 3,,,,,,,,

Technical field

The present disclosure relates to the field of information technology, and in particular, to a blockchain lightweight processing method, a blockchain node, and a computer storage medium.

Background technique

Blockchain technology is a chained data structure that combines data blocks in a chronological order in a sequential manner, and cryptographically guarantees a non-tamperable and unforgeable distributed ledger. The core technology of blockchain is to use blockchain data structure to verify and store data, use distributed node consensus algorithm to generate and update data, and use cryptography to ensure data transmission and access security.

A big problem with blockchains is that they contain all the historical transactions. As the volume of transactions increases, the blocks in the blockchain will also increase, and the data of the entire blockchain will become larger and larger. The demand for storage and computing resources will increase.

Summary of the invention

The present disclosure provides a blockchain lightweight processing method, a blockchain node, and a non-volatile computer storage medium.

In a first aspect, the present disclosure provides a blockchain lightweight processing method, where the method is applied to a first blockchain node and includes: generating and storing a block header according to block information of an original block to be deleted. An optimized block of the block, wherein the optimized block is used to form an optimized chain; the block header of the optimized block includes at least: a first hash value of the parent block of the optimized block; The block body of the optimized block includes: a second hash value of the last block in the original block to be deleted; if the optimized block is the first optimized block in the optimization chain, The block header of the optimized block includes: a first hash value of the creation block of the optimization chain; if the optimized block is a non-first optimized block in the optimization chain, the new generation The block header of the optimized block includes: a second hash value of the previous optimized block; and after the generating the optimized block, deleting the original block to be deleted, wherein the optimized chain includes : at least one original block and the optimized block, wherein The at least one original block includes at least: the creation zone block; or the creation zone block and the remaining original block.

The method further includes: broadcasting the optimized block in a blockchain network; receiving a verification result returned by the second block chain node based on a consensus mechanism; and broadcasting the optimized block by verifying, wherein The optimized block is used for the second block chain node to replace the original block to be deleted in the blockchain.

After the generating the optimized block, deleting the original block to be deleted includes: when the verification result indicates that the optimized block passes the verification, deleting the original block to be deleted.

The method further includes determining whether the Mth original block meets a preset deletion condition. And generating, according to the block information of the original block to be deleted, the optimized block including the block header and the block body, including: if the Mth original block satisfies the preset deletion condition, extracting the The hash value of the block header of the Mth block constructs the block body of the optimized block. After the generating the optimized block, deleting the original block to be deleted includes: if the currently generated optimized block is the first optimized block, deleting the M+1 original block and the All original blocks between the world blocks; or if the currently generated optimized block is not the first optimized block, delete all original blocks between the M+1th original block and the previous optimized block .

The determining whether the Mth original block meets the preset deletion condition includes at least one of: determining whether the generation time of the Mth original block corresponds to an optimized time point of the optimized time interval; determining the Whether the Mth original block is an original block corresponding to the optimized quantity interval, wherein if the optimized quantity interval is N, if the optimized block is the first optimized block and the Mth block is the first block When the N+1 original blocks are used, the Mth original block satisfies the preset deletion condition; if the optimized block is the xth optimized block and the Mth block is the x*N +1 original block, the Mth original block satisfies the preset deletion condition; determining whether the transaction information recorded by the Mth original block has exceeded a validity period; when the Mth original area If the transaction information recorded in the block has exceeded the validity period, the Mth original block is considered to satisfy the preset deletion condition.

The block body of the optimized block further includes: at least one of a random number, a time stamp, and a Merkel root of the last original block to be deleted.

In a second aspect, the present disclosure provides a blockchain lightweight processing method, where the method is applied to a second blockchain node and includes: receiving an optimized block broadcasted by a first blockchain node, wherein the optimized block Used to form an optimized chain. The block header of the optimized block includes: a first hash value of the parent block of the optimized block; the block body of the optimized block includes at least: the last one of the original blocks to be deleted a second hash value of the block; if the optimized block is the first optimized block in the optimization chain, the block header of the optimized block includes: a section of the creation block of the optimization chain a hash value; if the optimized block is a non-first optimized block in the optimization chain, the newly generated block header of the optimized block includes: a second hash value of the previous optimized block Wherein the optimization chain includes: at least one original block and the optimized block, wherein the at least one original block includes at least: the creation zone; or the creation zone and remaining Original block. The method further includes: determining, according to the first hash value and the second hash value carried by the optimized block, a block to be deleted in the original blockchain; and storing the optimized block and deleting the to-be-deleted Block.

The method further includes: receiving an optimized block to be verified broadcasted by the first blockchain; verifying the optimized block based on a consensus mechanism; and returning the verification result to the first blockchain node. And receiving, by the first blockchain node, an optimized block, including receiving the optimized block that is verified.

In a third aspect, the present disclosure provides a blockchain node, which is a first blockchain node and includes an optimization unit and a deletion unit, and the optimization unit is configured to use the block information of the original block to be deleted. And generating, and storing, an optimized block including a block header and a block body, wherein the optimized block is used to form an optimization chain; and the block header of the optimized block includes at least: a parent block of the optimized block The first hash value of the optimized block includes: a second hash value of the last block in the original block to be deleted; if the optimized block is the optimized chain The first optimized block in the block, the block header of the optimized block includes: a first hash value of the creation block of the optimization chain; if the optimized block is a non-first in the optimization chain The optimized block, the newly generated block header of the optimized block includes: a second hash value of the previous optimized block. The deleting unit is configured to delete the original block to be deleted after the generating the optimized block, where the optimization chain includes: the creation block and the optimized block and/or remaining original blocks Optimization chain.

In a fourth aspect, the disclosure provides a blockchain node, where the blockchain node is a second blockchain node and includes a receiving unit and a determining unit, where the receiving unit is configured to receive an optimized region broadcast by the first blockchain node a block, wherein the optimized block is used to form an optimization chain; the block header of the optimized block includes at least: a first hash value of a parent block of the optimized block; and an area of the optimized block The block includes at least: a second hash value of the last block in the original block to be deleted; and if the optimized block is the first optimized block in the optimization chain, the optimized block The block header includes: a first hash value of the creation block of the optimization chain; if the optimization block is a non-first optimization block in the optimization chain, the newly generated optimization block The block header includes: a second hash value of the previous optimized block. And a determining unit, configured to determine, according to the first hash value and the second hash value carried by the optimized block, the original block chain to be deleted.

In a fifth aspect, the present disclosure provides a blockchain node, the blockchain node comprising: a transceiver, a memory, a processor, and a computer program stored on the memory and processed by the processor; wherein the processing Connecting to the transceiver and the memory, and for controlling information exchange of the transceiver, storing information of the memory by executing the computer program, and executing a block provided by one or more of the foregoing technical solutions Chain lightweight processing method.

In a sixth aspect, the present disclosure provides a non-volatile computer storage medium, wherein the computer storage medium stores a computer program, and after the computer program is executed by a processor, the processor can implement the foregoing first aspect or The second aspect provides a blockchain lightweight processing method.

The blockchain lightweight processing method, the blockchain node and the computer storage medium provided by some embodiments of the present disclosure generate an optimized block of the original block in the substitute blockchain, and the optimized block and the remaining in the blockchain The original block forms an optimized chain of optimization. The data volume of the optimization chain is much smaller than the original transaction chain. Compared with the transaction chain that retains the complete original block, the storage optimization chain greatly saves the computing resources of storage resources and subsequent queries, and solves the related technology. The problem of large resource consumption such as blockchain storage resources has the characteristics of low resource consumption.

DRAWINGS

1 is a schematic structural view of an example of a blockchain;

2 is a schematic structural view of another example of a blockchain;

FIG. 3 is a schematic flowchart diagram of a method for processing a blockchain lightweight according to some embodiments of the present disclosure;

4 is another schematic flowchart of a method for processing a blockchain lightweight according to some embodiments of the present disclosure;

FIG. 5 is a schematic structural diagram of a transaction chain according to some embodiments of the present disclosure;

6 is a schematic diagram of the comparison of the transaction chain shown in FIG. 5 and the optimized chain formed after optimization;

FIG. 7 is a schematic structural diagram of an optimized chain according to some embodiments of the present disclosure;

FIG. 8 is still another schematic flowchart of a method for processing a blockchain lightweight according to some embodiments of the present disclosure;

FIG. 9 is a schematic structural diagram of a first blockchain node according to some embodiments of the present disclosure;

FIG. 10 is a schematic structural diagram of a second blockchain node according to some embodiments of the present disclosure;

FIG. 11 is a schematic structural diagram of a blockchain node according to some embodiments of the present disclosure.

Detailed ways

The technical solutions of the present disclosure are further elaborated below in conjunction with the drawings and specific embodiments.

The blockchain lightweight processing method, the blockchain node and the non-volatile computer storage medium provided by the present disclosure can at least partially solve the problem of large resource consumption such as storage resources in the blockchain technology.

The following describes the information about the blocks in the following trading chains.

As shown in FIG. 1 , in the blockchain technology, blocks are sequentially generated in chronological order and connected into chains, and each block records transaction information generated during creation, and is obtained based on each block chain node in the blockchain network. A recognized transaction of the consensus mechanism will be permanently stored in the blockchain. As shown in Figure 1, the data structure of the block is generally divided into a block header and a block body.

As shown in Figure 2, the block header of each block contains the hash value of the previous block (ie, the parent block), thereby forming a chain from the creation block to the current block, and determining each area. The location of the block in the entire blockchain. Usually the block header of the latter block includes the hash value stored in the block header of the previous block. In order to prevent the transactions in the block from being tampered with, the blockchain uses the Merkle tree to summarize all the transactions in a block, and the Merkle root is a summary of all transactions, any transaction information in the block. Changes will change the Merkle root. The block body contains the verified transaction information generated during the block creation process. As shown in FIG. 2, the block header of the block k includes the hash value in the block header of the block k-1; and the block header of each block further includes information such as a random number, a time stamp of the generation time, and the like. A block may record multiple transaction information, and the timestamp here may also be the transaction timestamp for each transaction.

The original block is an original block in which one or more pieces of transaction information are stored in the block body; and the optimized block is a block for generating an optimized chain in which transaction information is not stored.

As shown in FIG. 3, FIG. 3 provides a blockchain lightweight processing method, which is applied to a first blockchain node and includes steps S110-S120.

Step S110: Generate and store an optimized block including the block header and the block body according to the block information of the original block to be deleted. The optimization block is configured to form an optimization chain; the block header of the optimization block includes at least: a first hash value of a parent block of the optimized block; and a block body of the optimized block And at least comprising: a second hash value of the last block in the original block to be deleted; if the optimized block is the first optimized block in the optimization chain, the area of the optimized block The block header includes: a first hash value of the creation block of the optimization chain; if the optimization block is a non-first optimized block in the optimization chain, the newly generated region of the optimized block The block header includes: a second hash value of the previous optimized block.

Step S120: After generating the optimized block, deleting the original block to be deleted. The optimization chain includes: at least one original block and the optimized block, wherein the at least one original block includes at least: the creation zone; or the creation zone and remaining originals Block.

The blockchain lightweight processing method provided in FIG. 3 is essentially a method for reducing the data amount of the blockchain, so that the blockchain exhibits a lightweight feature in the amount of data.

The blockchain node in Figure 3 can be any one of the blockchain networks, such as a billing node.

In this embodiment, the first blockchain node first determines a block that can be deleted in the current blockchain. The blockchain here can be a transaction chain that retains a complete block, or an optimized chain of optimization.

In the embodiment, the optimized block and the block structure of the original block are consistent, and both include: a block header and a block body. The block headers are hash values that include the parent block to link between the blocks by hash values. The block of the optimized block does not store the transaction information, but stores the hash value of the currently deleted one block, or the hash value of the block generated by the last one of the deleted plurality of blocks. In this way, other blocks can be linked to the optimized block. In this embodiment, a hash value stored in the block body of the optimized block is also used as a hash value of the optimized block itself, and is used for linking in other blocks.

In this embodiment, one or more optimization blocks may be included in one optimization chain. The first optimized block is directly linked to the creation block of the trading chain. The creation block is the first block of a trading chain. The non-first optimized block (for example, the second optimized block) is linked to the previous optimized block. Therefore, the block header of the latter optimized block is the hash value stored in the block body including the previous optimized block.

After generating an optimized block, the original block to be deleted can be deleted correspondingly, and the correlation of the hash values is equivalent to realizing the optimization of the blockchain, and the optimized chain is generated based on the transaction chain or generated based on the optimized chain. Optimized chain for optimization again.

Thus, at least the optimization chain stored in the first block chain node includes: a creation block and an optimization block, or includes: a creation block, an optimization block, and a remaining undeleted original block. In this case, the optimization chain provided in this embodiment is a hybrid chain in which mixed blocks are linked.

In summary, the deletion of the original block and the introduction of the optimized block reduce the amount of data in the blockchain, thereby reducing the amount of data required for the amount of memory blocks, while optimizing the introduction of blocks, maintaining the chain of blockchains. The structure is convenient for subsequent data operations based on chain structure.

Optionally, as shown in FIG. 4, the method further includes: step S111: broadcasting the optimized block in a blockchain network; step S112: receiving a verification result returned by the second blockchain node based on a consensus mechanism; And step S130: broadcasting the optimized block that passes verification, wherein the optimized block is used by the second block chain node to replace the original block to be deleted in the blockchain.

The step S120 may include step S121.

The step S121 may include deleting the original block to be deleted when the verification result indicates that the optimized block passes the verification.

The generation of the optimized block in this embodiment is also based on a consensus mechanism of the blockchain network. After the first blockchain node generates an optimized block, it can be used only to optimize the locally stored blockchain, but in this embodiment, it will not only be used to optimize the blockchain of local storage, but also used for Optimize blockchains in other blockchain nodes. In this case, the generated optimized block needs to be verified.

In this embodiment, after the first blockchain node generates the optimized block, the optimized block is broadcasted to the entire blockchain network, so that the second block chain node is different from the first blockchain node. The optimized block will be received. In this case, the second block chain node can perform optimization of the optimized block based on the voting mode of the consensus mechanism, and form a corresponding verification result.

In this way, the first blockchain node receives the verification result, and the verification result can be verified by more than half of the blockchain nodes in the blockchain network, or at least a predetermined number of blockchain nodes. When the optimized block is authenticated, the optimized block is the verified block and can be used to replace some of the original blocks in the relevant block.

After an optimized block passes the verification, the first block chain node broadcasts the optimized block again. At this time, after receiving the optimized block, the other block chain node performs optimization of the blockchain, and utilizes the optimized area. The block replaces the original block to be deleted in the associated optimized block to optimize the transaction chain or re-optimize the optimized chain of optimization to reduce the amount of data in the blockchain.

The optimized block in this embodiment is generated based on the consensus mechanism of the blockchain network. In this case, the optimized block can be used for optimization of the corresponding blockchain in the entire blockchain network, so that if the zone is All the blockchain nodes in the blockchain network receive the optimized block, and the entire network stores the optimized chain instead of the transaction chain. Obviously, for the entire blockchain network, the amount of data stored and the computing resources required to maintain the blockchain are reduced.

In some embodiments, the method further includes deleting the optimized block that failed the verification when it is determined that the corresponding optimized block fails the verification based on the verification result returned by the second block chain node.

Figure 5 shows a transaction chain that includes all of the original blocks.

Figure 6 shows an alignment of an optimization chain and a transaction chain including optimized blocks. The optimization chain includes: a creation block and an inter-optimized block 1 and an optimized block 2. All blocks in the trading chain are original blocks.

Optionally, the method further includes: determining whether the Mth original block meets a preset deletion condition. The step S110 may include: if the Mth original block satisfies the preset deletion condition, extract a hash value of the block header of the Mth block to construct a block body of the optimized block.

In some embodiments, the step S120 may include deleting all the original blocks between the M+1th original block and the creation zone if the currently generated optimized block is the first optimized block. .

In this embodiment, substantially one optimized block corresponds to one original block. For example, the current optimized block corresponds to the Mth original block, and the two cases are treated substantially, if the currently generated optimized block is a block. The first optimized block in the chain, the creation block is the first original block in the blockchain, and the second original block to the Mth original block are deleted. If M is equal to 10,000, the second original block is deleted to the 10,000th original block, and an optimized block is replaced. The block header of the optimized block stores at least a hash value of the creation block, and the block body stores at least a hash value of the Mth original block.

In other embodiments, the step S120 may include deleting all the originals between the M+1 original block and the previous optimized block if the currently generated optimized block is not the first optimized block. Block.

For example, the currently generated optimized block is not the first optimized block, for example, the Nth optimized block, and the deleted original block includes: the Mth original block, the Mth original block, and the Nth -1 optimizes all original blocks between blocks. In essence, it also deletes the current Mth original block, and all the original blocks between the Mth original block and the creation block.

FIG. 7 is a schematic diagram of an optimization chain in which only one optimized block is generated. The original block included in the optimization chain shown in FIG. 7 includes optimization blocks such as the original block n and other optimization blocks in addition to the creation block. The remaining original blocks after the block. The optimization chain shown in Figure 6 is an optimized chain that includes at least two optimized blocks. It can be seen from Fig. 6 that the original block is not inserted between the two optimized blocks.

In this embodiment, the method further includes: determining which original blocks are deletable blocks, that is, determining which blocks satisfy the preset deletion condition. Since the blocks including the transaction information are generated in chronological order, the attributes in terms of information utility are also related to the generation time. If a subsequent original block can be deleted, the corresponding previous original block can also be deleted. Based on this feature, the following provides several alternative ways to determine whether the Mth original block is a block that meets the preset condition.

Optional one:

The determining whether the Mth original block meets the preset deletion condition comprises: determining whether the generation time of the Mth original block is an optimized time point corresponding to the optimized time interval.

For example, blockchain optimization is performed at certain optimization time intervals, for example, periodic optimization of blockchains. For example, blockchain optimization is performed for one month or one year as an optimization cycle. The original block with the optimized time point corresponding to the optimization time interval may be the last original block optimized at one time. For example, if the optimization interval is 1 year, the original block that was generated 1 year ago can be deleted, and then an original block whose time point is closest to the current time point one year ago is generated, that is, the Mth Original block. And the original block generated before the block can be the original block deleted.

Option 2:

Determining whether the Mth original block satisfies the preset deletion condition, the method includes: determining whether the Mth original block is an original block corresponding to the optimized quantity interval, where, if the optimized quantity interval is N, If the optimized block is the first optimized block and the Mth block is the N+1th original block, the Mth original block satisfies the preset deletion condition; The block is the xth optimized block and the Mth block is the x*N+1th original block, and the Mth original block satisfies the preset deletion condition.

In this mode, if each of the N original blocks is generated in the blockchain, the blockchain is optimized once. For example, if N is equal to 10,000, then for each 10,000 original blocks, a blockchain optimization is performed to generate an optimized block, and the corresponding 10,000 original blocks are deleted to generate at least: creation The optimized chain of blocks and optimized blocks.

Option 3:

Determining whether the Mth original block satisfies the preset deletion condition comprises: determining whether the transaction information recorded by the Mth original block has exceeded a validity period; and when the transaction information recorded in the Mth original block has been If the validity period is exceeded, the Mth original block is considered to satisfy the preset deletion condition.

For example, in each block of the original block in the transaction chain, the certificate information assigned to the corresponding user is stored, and the certificate information is time-efficient. When the certificate information has exceeded the validity period, the immediate effect has been lost. The certificate information stored in the block of the original block may be considered invalid. To save storage space, the block may be deleted. Then, the information state of the original block can be considered to satisfy the preset storage condition. The certificate information here may be one of the aforementioned transaction information. The certificate information here may include: an authorization certificate and user information of an authorization certificate.

Further, the block body of the optimized block further includes: at least one of a random number, a time stamp, and a Merkel root of the last original block to be deleted. The information of the block header of the last block that can be directly deleted in step S110 is included in the block body of the optimized block.

As shown in FIG. 8, FIG. 8 provides a blockchain weighting processing method applied to a second block chain node and including steps S210-S230.

Step S210: Receive an optimized block broadcast by the first blockchain node. The optimization block is configured to form an optimization chain; the block header of the optimization block includes at least: a first hash value of a parent block of the optimized block; and a block body of the optimized block And at least comprising: a second hash value of the last block in the original block to be deleted; if the optimized block is the first optimized block in the optimization chain, the area of the optimized block The block header includes: a first hash value of the creation block of the optimization chain; if the optimization block is a non-first optimized block in the optimization chain, the newly generated region of the optimized block The block header includes: a second hash value of the previous optimized block.

Step S220: Determine, according to the first hash value and the second hash value carried in the optimized block, the block to be deleted in the original blockchain.

Step S230: Store the optimized block and delete the block to be deleted.

In the blockchain lightweight processing method provided in this embodiment, the optimized block generated by the first blockchain can be used not only for the weight reduction processing of its own blockchain, but also for the block of other blockchain nodes. Chain optimization processing.

In this embodiment, the second blockchain node may live in the first blockchain node to read the optimized block, or receive the blockchain node actively sent by the first blockchain node.

After receiving the optimized block, deleting the hash value stored in the block header and the block body in the optimized block, that is, the first hash value and the second hash value, deleting the block chain to be optimized Corresponding original block, by storing the optimized block, thereby forming a mixed chain including at least one original block and an optimized block (ie, the optimized chain), where at least one original block includes at least: Block. In other embodiments, the at least one original block may further include: other original blocks other than the creation block that have not been deleted.

In some embodiments, to ensure the authenticity and reliability of the blockchain, the generation of optimized blocks is also based on a consensus mechanism of the blockchain network. The method further includes: receiving an optimized block to be verified broadcasted by the first blockchain; verifying the optimized block based on a consensus mechanism; and returning the verification result to the first blockchain node. The step S210 may include: receiving the optimized block that is verified.

For example, based on the optimized block verified by the voting method in the consensus mechanism, the first block chain node will be broadcast to the second block chain node. In this case, the blockchain received in step S210 must be an optimized block that passes the verification. By optimizing the broadcast of the block, this allows most of the blockchain nodes of the entire network to store the same optimized chain, or the same optimized chain that is ultimately stored, thereby reducing the blockchain of the entire blockchain network. Resource consumption such as data volume and storage resources.

As shown in FIG. 9, FIG. 9 provides a blockchain node, which is a first blockchain node and includes an optimization unit 110 and a deletion unit 120. The optimization unit 110 is configured to generate and store an optimized block including a block header and a block body according to the block information of the original block to be deleted, where the optimized block is used to form an optimized chain; The block header of the block includes at least: a first hash value of the parent block of the optimized block; the block body of the optimized block includes at least: a first block of the original block in the original block to be deleted a second hash value; if the optimized block is the first optimized block in the optimization chain, the block header of the optimized block includes: a first hash value of the creation block of the optimized chain If the optimized block is a non-first optimized block in the optimization chain, the newly generated block header of the optimized block includes: a second hash value of the previous optimized block.

The deleting unit 120 is configured to delete the original block to be deleted after the generating the optimized block, where the optimization chain includes: the creation block and the optimized block and/or remaining original area The optimized chain of blocks.

Both the optimization unit 110 and the deletion unit 120 may correspond to a connection structure of a processor and a memory of a physical node where the blockchain node is located. The memory can be used to store various information; the processor is connected to the memory based on a bus interface such as an integrated circuit bus, and the execution of the executable code by a computer program can optimize the transaction chain and generate less data. Optimization chain.

The processor may be a central processing unit (CPU), a microprocessor (MCU), a digital signal processor (DSP), an application processor (AP), a programmable array (PLC), or an application specific integrated circuit (ASIC). The structure for information processing.

In the embodiment, the first blockchain node deletes some blocks that can be deleted in the blockchain. To ensure the chain structure of the blockchain, corresponding parameter blocks are generated to form an optimized optimization chain. The optimization block stores a hash value of a previous block (ie, a parent block) in the optimization chain. The negative block here can be a creation block or a previous optimization block.

Optionally, the first blockchain node further includes: a broadcasting unit, configured to broadcast the optimized block in a blockchain network; and a receiving unit, configured to receive the second blockchain node and return based on a consensus mechanism And the broadcast unit is further configured to broadcast the optimized block that is verified by using, wherein the optimized block is used by the second block chain node to replace the original block to be deleted in the blockchain .

The deleting unit 120 is specifically configured to: when the verification result indicates that the optimized block passes the verification, delete the original block to be deleted.

In this embodiment, the broadcast unit and the receiving unit may correspond to a communication interface of a physical node where the first blockchain node is located, and the communication interface may be a network interface, for example, a cable interface, an optical cable interface, a transceiver antenna, and the like. .

Optionally, the first blockchain node further includes: a determining unit, configured to determine whether the Mth original block meets a preset deletion condition. The optimization unit 110 may be specifically configured to: if the Mth original block satisfies the preset deletion condition, extract a hash value of a block header of the Mth block to construct a block of the optimized block body. The deleting unit 120 is specifically configured to: if the currently generated optimized block is the first optimized block, delete all the original blocks between the M+1 original block and the creation zone; or If the currently generated optimized block is not the first optimized block, all the original blocks between the M+1th original block and the previous optimized block are deleted.

The determining unit may be configured to: perform at least one of: determining whether an occurrence time of the Mth original block corresponds to an optimized time point of the optimized time interval; and determining whether the Mth original block is an optimized quantity An original block corresponding to the interval, wherein, if the optimized number interval is N, if the optimized block is the first optimized block and the Mth block is the N+1th original block, The Mth original block satisfies the preset deletion condition; if the optimized block is the xth optimized block and the Mth block is the x*N+1th original block, the The Mth original block satisfies the preset deletion condition; determining whether the transaction information recorded by the Mth original block has exceeded a validity period; when the transaction information recorded in the Mth original block has exceeded the For the validity period, the Mth original block is considered to satisfy the preset deletion condition.

Further, the block body of the optimized block further includes: at least one of a random number, a time stamp, and a Merkel root of the last original block to be deleted.

As shown in FIG. 10, FIG. 10 provides a block chain node, which is a second block chain node and includes a receiving unit 210, a determining unit 220, and a storage unit 230.

The receiving unit 210 is configured to receive an optimized block that is broadcast by the first block chain node, where the optimized block is used to form an optimized chain; the block header of the optimized block includes at least: the optimized block a first hash value of the parent block; the block body of the optimized block includes: a second hash value of the last block in the original block to be deleted; if the optimized block is The first optimized block in the optimization chain, the block header of the optimized block includes: a first hash value of the creation block of the optimization chain; if the optimized block is in the optimization chain The non-first optimized block, the newly generated block header of the optimized block includes: a second hash value of the previous optimized block.

The determining unit 220 is configured to determine, according to the first hash value and the second hash value carried by the optimized block, the original block to be deleted.

The storage unit 230 is configured to store the optimized block and delete the block to be deleted.

The blockchain node here is a second blockchain node, and may be any one of the billing nodes in the blockchain network.

The receiving unit 210 corresponds to a transceiver, and can be used for information interaction between the blockchain node and other blockchain nodes.

The determining unit 220 herein may also correspond to a processor, and the related description of the processor herein may be referred to the description of the corresponding portion of the foregoing processor.

In this implementation, the second blockchain node may be based on the optimized block provided by the first blockchain node to delete the original block corresponding to the optimized block, optimize the locally stored blockchain, and generate a larger amount of data. Less optimization chains or re-optimizing the chain.

The receiving unit 210 is further configured to receive an optimized block to be verified that is broadcast by the first blockchain. The second blockchain node may further include: a verification unit, configured to verify the optimized block based on a consensus mechanism; and a sending unit that returns the verification result to the first blockchain node. The receiving unit 210 is specifically configured to receive the optimized block that is verified.

In this embodiment, the optimized block directly received by the receiving unit 210 is an optimized area that passes verification, so that the authenticity and reliability of the blockchain optimized by the optimized block can be ensured.

As shown in FIG. 11, FIG. 11 also provides a blockchain node including: a transceiver 310, a memory 320, a processor 330, and a computer stored on the memory 320 and processed by the processor 330. program.

The processor 330 is connected to the transceiver 310 and the memory 320, respectively, and is configured to control information exchange of the transceiver 310, information storage of the memory 320 by executing the computer program, and the foregoing Or a blockchain lightweight processing method provided by multiple technical solutions.

For example, the processor 330 can implement the blockchain lightweight processing method illustrated in FIG. 3, FIG. 4, and/or FIG. 8 by execution of a computer program.

The blockchain node provided in this embodiment may be various blockchain nodes such as a first blockchain node, a second blockchain node, and a third blockchain node.

The processor 330 can be coupled to the transceiver 310 and the memory 320 via an integrated circuit (IIC) bus.

The transceiver 310 can include various communication interfaces to which physical nodes are connected to the network, such as cable interfaces, fiber optic cable interfaces, and transceiver antennas.

Some embodiments of the present disclosure also provide a computer storage medium that can be volatile or non-volatile and that stores a computer program that, when executed by a processor, is capable of The blockchain lightweight processing method provided by one or more of the foregoing technical solutions is implemented, for example, the blockchain lightweight processing method shown in FIG. 3, FIG. 4, and/or FIG.

The computer storage medium provided by some embodiments of the present disclosure includes: a removable storage device, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. The medium of the program code. Optionally, the computer storage medium may be a non-book storage medium.

A specific example is provided below:

This example provides a way to generate an optimized chain. The transaction chain is shown in Figure 7, which corresponds to the optimized chain of the transaction chain. The transaction chain and optimization chain here can be collectively referred to as a blockchain. After the optimization chain is generated, the corresponding transaction chain can be deleted.

The transaction chain uses the associated blockchain technique to generate each original block containing the transaction information, and the original block link constitutes the transaction chain. If the historical block before a original block in the transaction chain is no longer used, or the probability of use is very small, then it can be optimized at the block chain node to form the optimization chain. The optimization chain mainly stores the block part information in the storage optimization chain, and then by storing the optimization chain, all the blocks between the block and the founding block can be deleted.

Each block of the optimization chain corresponds to an original block in the transaction chain, and the blocks between the corresponding original block and the creation block in the transaction chain can be deleted and not stored. For example, in FIG. 6, the optimized chain block 1 corresponds to the transaction chain block M, and the optimized chain block 2 corresponds to the transaction chain block N, and the values of M and N can be set as needed. If every 10,000 blocks are optimized once, then M = 10000 and N = 20000.

Each block in the optimization chain is also divided into a block header and a block body, and the block header includes a hash value of the parent block header, so that the block is connected to form a chain structure, and further includes a Merkle root, a random number, and a time stamp. And other information. The block body contains the hash value of the block header of the corresponding block in the transaction chain. For example, the block header hash value of the transaction chain block M is included in the block body in the optimized chain block 1, and the block header hash value of the transaction chain block N is included in the block body in the optimized chain block 2.

If the operation of deleting the original block needs to be performed, firstly, the original block in the transaction chain corresponding to the latest optimization block of the optimization chain needs to be found, and the corresponding original block in the transaction chain and the original of the transaction chain can be deleted. All blocks between the block and the found block. The optimization chain of the optimized chain node only needs to store the creation block, the optimized block, and the transaction chain after the original partition block (ie, the remaining original block), and the optimized transaction chain is still a chain structure.

Figure 6 is a schematic diagram of the structure of the optimized chain after optimization. In this example, the latest optimized block in the optimization chain corresponds to the original block M of the transaction chain, and then the block chain node can delete all the blocks between the storage creation block and the original block M+1, and only need to be stored. The creation block, the optimization block, and the original block after the original block M in the transaction chain.

The block header of the original block M+1 of the transaction chain contains the block header hash value of the block M, and the optimized block 2 also contains the block header hash value of the block M. Therefore, the optimized block 2 and the transaction chain are optimized. A chain structure can still be formed between the blocks M+1.

Security: Each block in the optimization chain corresponds to an original block in the transaction chain, so all users can verify it. In addition, the block header of each block in the optimization chain contains the hash value of the parent block header and contains the block header hash value of the corresponding block in the transaction chain. Therefore, after the original block corresponding to the corresponding transaction chain is deleted, the optimized optimization chain is formed together with the initial block and the optimized block. The optimized chain still has a chain structure, and all nodes can participate in the verification.

To prevent counterfeiting of the optimized chain, the latest nodes of the storage optimization chain can be restricted, that is, the history blocks that can be deleted are limited. For example, you can only delete blocks generated one year ago or blocks before the latest 10,000 blocks. Thus, if the optimization chain is forged, it is necessary to forge all the blocks in the year or the latest 10,000 blocks, which is almost impossible to complete in the blockchain technology.

Storage efficiency: each block in the optimization chain corresponds to an original block in the transaction chain, and the original block in the transaction chain and the block between the original block and the creation block can be deleted. storage. The storage efficiency and the value of m and n, if optimized every 10,000 blocks, then m = 10000, n = 20000, in theory, the optimized blockchain only needs to occupy the original 1 / 10000.

In summary, the present disclosure provides an optimization chain: each block in the optimization chain corresponds to an original block of the transaction chain, and each block of the optimized block contains a block header hash corresponding to the transaction chain block. value. The present disclosure also provides a blockchain lightweight storage method: finding the original block of the transaction chain corresponding to the latest block of the optimized chain, the original block of the transaction chain amount, and the transaction chain block and the founding area can be deleted. All blocks between blocks. In this way, the blockchain node only needs to store the creation block, the storage optimization chain, and the transaction chain after deleting some blocks, and the optimized transaction chain is still a chain structure.

In the several embodiments provided by the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner, such as: multiple units or components may be combined, or Can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, or direct coupling, or communication connection of the components shown or discussed may be indirect coupling or communication connection through some interfaces, devices or units, and may be electrical, mechanical or other forms. of.

The units described above as separate components may or may not be physically separated, and the components displayed as the unit may or may not be physical units, that is, may be located in one place or distributed to multiple network units; Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing module, or each unit may be separately used as one unit, or two or more units may be integrated into one unit; The unit can be implemented in the form of hardware or in the form of hardware plus software functional units.

It will be understood by those skilled in the art that all or part of the steps of implementing the foregoing method embodiments may be performed by hardware related to the program instructions. The foregoing program may be stored in a computer readable storage medium, and the program is executed by the processor. The processor executes the steps comprising the above described method embodiments. The foregoing storage medium may be volatile or non-volatile, and includes: a mobile storage device, a read-only memory (ROM), a random access memory (RAM), and a magnetic memory. A variety of media that can store program code, such as a disc or a disc.

The above is only the specific embodiment of the present disclosure, but the scope of the present disclosure is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the disclosure. It should be covered within the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be determined by the scope of the claims.

Claims

A blockchain lightweight processing method, the processing method being applied to a first blockchain node and comprising:

And generating, according to the block information of the original block to be deleted, an optimized block including a block header and a block body, wherein the optimized block is used to form an optimized chain; and the block header of the optimized block is at least And including: a first hash value of the parent block of the optimized block; the block body of the optimized block at least: a second hash value of the last block in the original block to be deleted; If the optimized block is the first optimized block in the optimization chain, the block header of the optimized block includes: a first hash value of the creation block of the optimization chain; The block is a non-first optimized block in the optimization chain, and the block header of the newly generated optimized block includes: a second hash value of the previous optimized block;

Deleting the original block to be deleted after the generating the optimized block, where the optimization chain includes: at least one original block and the optimized block, wherein the at least one original block includes at least : the creation block; or the creation zone and the remaining original block.
The method of claim 1 further comprising:

Broadcasting the optimized block in a blockchain network;

Receiving a verification result returned by the second blockchain node based on the consensus mechanism;

Broadcasting the optimized block by verification, wherein the optimized block is used by the second block chain node to replace the original block to be deleted in the blockchain;

After the generating the optimized block, deleting the original block to be deleted includes: when the verification result indicates that the optimized block passes the verification, deleting the original block to be deleted.
The method of claim 1 or 2, further comprising:

Determining whether the Mth original block satisfies a preset deletion condition;

And generating, according to the block information of the original block to be deleted, the optimized block including the block header and the block body, including: if the Mth original block meets the preset deletion condition, Extracting a hash value of the block header of the Mth block to construct a block body of the optimized block;

After the generating the optimized block, deleting the original block to be deleted includes: if the currently generated optimized block is the first optimized block, deleting the M+1 original block and the All original blocks between the world blocks; or if the currently generated optimized block is not the first optimized block, delete all original blocks between the M+1th original block and the previous optimized block .
The method according to claim 3, wherein the determining whether the Mth original block satisfies a preset deletion condition comprises at least one of the following:

Determining whether the generation time of the Mth original block corresponds to an optimized time point of the optimization time interval;

Determining whether the Mth original block is an original block corresponding to the optimized quantity interval, wherein if the optimized quantity interval is N, if the optimized block is the first optimized block and the Mth area When the block is the N+1th original block, the Mth original block satisfies the preset deletion condition; if the optimized block is the xth optimized block and the Mth block is the first block x*N+1 original blocks, wherein the Mth original block satisfies the preset deletion condition;

Determining whether the transaction information recorded in the Mth original block has exceeded a validity period; and when the transaction information recorded in the Mth original block has exceeded the validity period, the Mth original block is considered to be satisfied Preset delete conditions.
The method according to any one of claims 1 to 4, wherein

The block body of the optimized block further includes: at least one of a random number, a time stamp, and a Merkel root of the last original block to be deleted.
A blockchain lightweight processing method, the processing method being applied to a second blockchain node and comprising:

Receiving, by the first blockchain node, an optimized block, wherein the optimized block is used to form an optimized chain; the block header of the optimized block includes at least: a first block of the optimized block a hash value, where the block body of the optimized block includes: a second hash value of the last block in the original block to be deleted; if the optimized block is the first one in the optimization chain The optimized block, the block header of the optimized block includes: a first hash value of the creation block of the optimization chain; if the optimized block is a non-first optimization region in the optimization chain a block header, the block header of the newly generated optimized block includes: a second hash value of the previous optimized block; wherein the optimization chain includes: at least one original block and the optimized block, where The at least one original block includes at least: the creation zone block; or the creation zone block and remaining original blocks;

Determining, according to the first hash value and the second hash value carried by the optimized block, the original block to be deleted; and

The optimized block is stored and the block to be deleted is deleted.
The method of claim 6 further comprising:

Receiving, by the first blockchain broadcast, an optimized block to be verified;

Validating the optimized block based on a consensus mechanism;

Returning the verification result to the first blockchain node;

The receiving the optimized block broadcast by the first block chain node includes: receiving the optimized block that passes the verification.
A blockchain node, the blockchain node being a first blockchain node and comprising:

And an optimization unit, configured to generate and store an optimized block including a block header and a block body according to the block information of the original block to be deleted, where the optimized block is used to form an optimized chain; The block header of the block includes at least: a first hash value of the parent block of the optimized block; the block body of the optimized block includes at least: a first block of the original block in the original block to be deleted a second hash value; if the optimized block is the first optimized block in the optimization chain, the block header of the optimized block includes: a first hash value of the creation block of the optimized chain If the optimized block is a non-first optimized block in the optimization chain, the newly generated block header of the optimized block includes: a second hash value of the previous optimized block;

a deleting unit, configured to delete the original block to be deleted after generating the optimized block, where the optimization chain includes: the creation block and the optimized block and/or remaining original area The optimized chain of blocks.
A blockchain node, the blockchain node being a second blockchain node and comprising:

a receiving unit, configured to receive an optimized block broadcast by the first blockchain node, where the optimized block is used to form an optimized chain; the block header of the optimized block includes at least: a parent region of the optimized block a first hash value of the block; the block body of the optimized block includes: a second hash value of the last block in the original block to be deleted; if the optimized block is the optimized The first optimized block in the chain, the block header of the optimized block includes: a first hash value of the creation block of the optimization chain; if the optimized block is a non-in the optimization chain a first optimized block, the block header of the newly generated optimized block includes: a second hash value of the previous optimized block;

a determining unit, configured to determine, according to the first hash value and the second hash value carried by the optimized block, a block to be deleted in the original blockchain;

And a storage unit, configured to store the optimized block and delete the block to be deleted.
A blockchain node, including:

a transceiver, a memory, a processor, and a computer program stored on the memory and processed by the processor;

The processor is coupled to the transceiver and the memory, and configured to control information exchange of the transceiver, information storage of the memory, and execute any one of claims 1 to 7 by executing the computer program A blockchain lightweight processing method is provided.
A non-volatile computer storage medium comprising:

a computer program stored on the non-volatile computer storage medium, the computer processor capable of implementing the blockchain lightening processing method according to any one of claims 1 to 7 after the computer program computer processor is executed .