WO2019024780A1

WO2019024780A1 - Light-weight processing method for blockchain, and blockchain node and storage medium

Info

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

Abstract

Disclosed are a light-weight processing method for a blockchain, and a blockchain node and a computer storage medium. The light-weight processing method for a blockchain applied to a first blockchain node comprises: based on N blocks to be deleted continuously distributed in a transaction chain, generating a parameter block, wherein N is a positive integer; deleting the N blocks in the transaction chain; and storing the parameter block, wherein the parameter block and undeleted blocks in the transaction chain together form an optimized chain, a father block of the parameter block is a block prior to the deleted N blocks in the transaction chain, and a sub-region of the parameter block is a region after the deleted N blocks in the transaction chain.

Description

Blockchain lightweight processing method, blockchain node and storage medium

Cross-reference to related applications

The present application claims priority to Chinese Patent Application No. 201710657510.X 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

The blockchain technology that has emerged in recent years is a chained data structure in which data blocks are sequentially connected in a chronological order, and cryptographically guaranteed non-tamperable and unforgeable distributed ledgers. 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

In view of this, embodiments of the present disclosure are expected to provide a blockchain lightweight processing method, a blockchain node, and a computer storage medium, at least partially solving the problem of large resource consumption such as storage resources in the blockchain technology.

To achieve the above object, the technical solution of the present disclosure is implemented as follows:

A first aspect of the embodiments of the present disclosure provides a blockchain lightweight processing method, which is applied to a first blockchain node, and includes:

Generating a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, where the N is a positive integer;

Deleting the N blocks in the transaction chain;

Storing the parameter block, wherein the parameter block and the undeleted block in the transaction chain form an optimization chain, wherein the parent block of the parameter block is: deleted in the transaction chain The previous block of the N blocks, the sub-area of the parameter block is: the latter area of the N blocks deleted in the transaction chain.

Optionally, the method further includes:

Determining whether the N blocks continuously distributed in the transaction chain satisfy the preset deletion condition;

Generating a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, including:

If the preset deletion condition is met, a parameter block is generated based on the N blocks.

Optionally, the parameter block includes at least: a head pointer and a tail pointer;

The head pointer points to a previous one of the N blocks deleted in the transaction chain;

The tail pointer points to the next one of the N blocks deleted in the transaction chain.

Optionally, the head pointer includes: a hash value of a previous one of the N blocks deleted in the transaction chain;

The tail pointer includes: a hash value of a subsequent block of the N regions deleted in the transaction chain.

Optionally, the generating the parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, including:

Calculating a check value by using a hash value of the N blocks to be deleted, where the parameter block further includes the check value, where the check value is used to send the optimized chain to the second The block chain node is used for verification of the optimized chain by the second block chain node.

Optionally, the method further includes:

When there is a newly added block to be deleted in the optimization chain, the parameter block is updated according to the block parameter of the newly added block; wherein the updated parameter block is linked to the a subsequent block of the block in the transaction chain that satisfies the preset deletion condition;

Delete the newly added block to be deleted.

A second aspect of the embodiments of the present disclosure provides a blockchain lightweight processing method, which is applied to a second blockchain node, and includes:

Sending a copy request of the blockchain to the first blockchain node;

And when the first block chain node returns an optimization chain based on the copy request, sending an acquisition request to the third block chain node, where the third area is based on the parameter block in the optimization chain a block chain node is a block chain node that stores a transaction chain corresponding to the optimization chain; the obtaining request is used to acquire N blocks that have been deleted and continuously distributed in the optimization chain, where the N is positive Integer

Receiving a block parameter returned by the third blockchain node;

Verifying the parameter block in the optimization chain based on the block parameter;

When the parameter block passes verification, the optimized block is stored to form the optimized chain.

Optionally, when the first blockchain node returns an optimized chain based on the replication request, sending, according to the parameter block in the optimization chain, the optimization to the third blockchain node. The request for obtaining the block parameters of the N blocks deleted in the chain includes:

Determining, according to the parameter block, a first hash value and a second hash value, wherein the first hash value is: a dispersion of the first block of the N consecutive blocks that have been deleted a column value, the second hash value is: a hash value of the last block of the N consecutive blocks that have been deleted; wherein the block parameter includes at least: N consecutively deleted a hash value of the second block to the N-1th block in the block; the parameter block further includes: a check value;

Sending an acquisition request carrying the first hash value and the second hash value to the third blockchain node;

The verifying, by the block parameter, the parameter block in the optimization chain, including:

Generating a function value using a preset function based on the hash values of the deleted N blocks that are continuously distributed;

Matching the generated function value with the check value;

If the matches are consistent, it is determined that the parameter block passes the verification.

The third embodiment of the present disclosure provides a blockchain node, where the blockchain node is a first blockchain node, including:

a generating unit, configured to generate a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, where the N is a positive integer;

a deleting unit, configured to delete the N blocks in the transaction chain;

a first storage unit, configured to store the parameter block, wherein the parameter block and the unremoved block in the transaction chain form an optimization chain, wherein the parent block of the parameter block is: The previous block of the N blocks deleted in the transaction chain, and the sub-area of the parameter block is: the latter area of the N blocks deleted in the transaction chain.

A fourth aspect of the embodiments of the present disclosure provides a blockchain node, where the blockchain node is a second blockchain node, including:

a sending unit, configured to send a copy request of the blockchain to the first blockchain node; when the first blockchain node returns an optimized chain based on the copy request, based on the parameter region in the optimized chain a block, sending an acquisition request to the third blockchain node, wherein the third blockchain node is a blockchain node that completes a transaction chain corresponding to the optimized chain; the obtaining request is used to acquire Deleting and continuously distributing N blocks in the optimization chain, where N is a positive integer;

a receiving unit, configured to receive a block parameter returned by the third blockchain node;

a verification unit, configured to verify a parameter block in the optimization chain based on the block parameter;

And a second storage unit, configured to: when the parameter block passes the verification, store the optimized block to form the optimized chain.

A fifth aspect of an embodiment of the present disclosure provides 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 respectively connected to the transceiver and the memory, for controlling information exchange of the transceiver, storing information of the memory by executing the computer program, and performing any one or more of the foregoing technologies The blockchain lightweight processing method provided by the scheme.

A fifth aspect of the embodiments of the present disclosure provides a computer storage medium, wherein the computer storage medium stores a computer program, and after the computer program is executed, can implement a blockchain provided by any one or more of the foregoing technical solutions. Lightweight processing method.

The blockchain lightweight processing method, the blockchain node, and the computer storage medium provided by the embodiments of the present disclosure generate a parameter block based on the block parameter of the block to be deleted, in order to reduce the data amount of the blockchain. The parameter block can link the previous block and the next block of the deleted block to form an optimized optimization chain. Usually, the number of blocks in the optimization chain is smaller than the number of blocks in the transaction chain that retains the complete block, and the data volume of the parameter block is usually smaller than the data volume of the block including the transaction information in one transaction chain, thereby optimizing the chain as a whole. The amount of data is far less than the volume of transactions. If the blockchain node only stores the optimized chain, it is obvious that the storage resources consumed by the blockchain storage can be reduced, and the computing resources consumed by the subsequent query operations are facilitated, thereby saving the subsequent operations such as the query operation of the blockchain of the query. The computing resources consumed. Therefore, the problem of large resource consumption such as storage resources in the blockchain technology in the related art is solved.

DRAWINGS

1 is a schematic structural view of a blockchain;

2 is a schematic structural view of another blockchain;

FIG. 3 is a schematic flowchart of a first blockchain lightweighting process according to an embodiment of the present disclosure;

FIG. 4 is a schematic flowchart of a second blockchain lightweighting process according to an embodiment of the present disclosure;

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

6 is a schematic structural diagram of an optimization chain formed after the optimization of the transaction chain shown in FIG. 5;

FIG. 7 is a schematic flowchart of a third blockchain lightweighting process according to an embodiment of the present disclosure;

8 is a schematic structural diagram of an optimization chain re-optimized on the basis of the optimization chain shown in FIG. 6;

FIG. 9 is a schematic flowchart of a fourth blockchain lightening process according to an embodiment of the present disclosure;

FIG. 10 is a schematic structural diagram of a first blockchain node according to an embodiment of the present disclosure;

FIG. 11 is a schematic structural diagram of a second blockchain node according to an embodiment of the present disclosure;

FIG. 12 is a schematic structural diagram of a blockchain node according to an embodiment 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 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 embodiment of the present disclosure provides a blockchain lightweight processing method, which is applied to a first blockchain node, as shown in FIG. 3, and includes:

Step S110: Generate a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, where the N is a positive integer;

Step S120: deleting the N blocks in the transaction chain;

Step S130: The parameter block is stored, wherein the parameter block and the undeleted block in the transaction chain form an optimization chain, wherein the parent block of the parameter block is: the transaction chain The previous block of the N blocks deleted, the sub-area of the parameter block is: the latter area of the N blocks deleted in the transaction chain.

The blockchain lightweight processing method provided in this embodiment 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 first blockchain node in this embodiment may be any one of the billing nodes in the blockchain network. In this embodiment, the accounting node deletes the original blockchain composed of the blocks (ie, the transaction chain) in order to save the data storage capacity of the local storage blockchain and the computing resources for maintaining the data storage. The middle part of the block that meets the deletion condition. The N blocks that are continuously distributed in this embodiment are preferably a plurality of blocks that are continuously distributed, so that the generation of parameter blocks can be minimized and the amount of data of the optimized chain can be reduced.

However, after deleting these blocks, it is necessary to ensure the chain structure of the blockchain, which will be a parameter block. This parameter block can replace the deleted multiple blocks and link the undeleted blocks in the transaction chain to form data. The amount is much smaller than the optimized chain of the original trading chain. In this case, the chain structure of the blockchain is still completely preserved.

In this way, the first blockchain node can only store the optimized chain by deleting the corresponding block, thereby reducing the occupation of the storage resources of the blockchain and reducing the consumption of system resources required for maintaining the blockchain.

In some embodiments, as shown in FIG. 4, the method further includes:

Step S100: determining whether the N blocks that are continuously distributed in the transaction chain meet the preset deletion condition;

The step S110 may specifically include step S111; the step S111 may include:

There are various ways to determine whether the continuously distributed N blocks satisfy the preset deletion condition. Several alternative methods are provided below.

Optional one:

The step S100 may include:

Determining whether the transaction content recorded in the N blocks continuously distributed exceeds the validity period;

When the transaction content recorded by the N blocks continuously distributed exceeds the validity period, the N consecutively distributed blocks are considered to satisfy the preset deletion condition.

For example, the block body of each block in the transaction chain stores the certificate information allocated to the corresponding user, and the certificate information has a time-effectiveness. When the certificate information has exceeded the validity period, the immediate effect has been lost. The certificate information stored in the block of the block is considered invalid. In order to save storage space, the block can be deleted. Then, the information state of the 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.

Option 2:

The step S100 may include:

Extracting a timestamp of each block in the transaction chain or in the optimization chain; the timestamp includes a generation time of the corresponding block;

Determining whether the time difference between the current time and the generation time exceeds a preset time threshold;

If the time difference exceeds the preset time threshold, the corresponding block may be considered as a block that satisfies the preset deletion condition.

For example, in some cases, although some blocks do not have the validity of the hard design information, the probability that the corresponding transaction information in the block can be subsequently queried is almost zero, or is less than the preset probability. For example, a block that is generated for more than one time threshold is generated. The time threshold may be 1 year, 2 years or 5 years, and the like.

Option 3:

The step S100 may include:

Extracting the number of blocks in the transaction chain or the optimization block from the last block generated by the historical block;

When the number of the blocks exceeds the threshold, the corresponding block is considered to be the block to be deleted that meets the preset deletion condition.

For example, a historical block in the transaction chain is separated from the current latest block by a predetermined number of blocks. For example, the transaction chain A currently includes 53,000 blocks, and if the predetermined number is 10,000, then The blocks before the 43,000th block (except the creation block) are all blocks that can be deleted.

It should be noted that the block that can be deleted in this embodiment does not include the creation block in the transaction chain, where the creation block is the first block of the transaction chain.

In summary, in this embodiment, the deletion of the valid information caused by deleting the block is avoided, and only the block in the transaction chain or in the optimized chain that meets the preset deletion condition is deleted, so as to ensure that the optimized block after the corresponding block is deleted. It can meet the requirements of subsequent information query and/or verification, and reduce the storage resources and computing resources occupied by the data amount as much as possible to meet the needs of information query.

In the embodiment, by the introduction of step S100, it is equivalent to deleting only the block that meets the preset deletion condition in the first blockchain node, and in some cases, the first blockchain node may be based on its own The storage condition of the storage resource, etc., selectively uses the storage of the discarded partial blocks of the above technical solution without determining which blocks satisfy the preset deletion condition. For example, in an application scenario, the current storage resource usage rate of the blockchain node A is higher than the maximum usage threshold. To ensure the normal operation of the blockchain node, some storage resources must be released. Then, according to a random algorithm or the like, the block in one or more transaction chains is set as the block to be deleted, and part of the storage resource is released through the deletion of the block and the storage of the optimized chain.

For example, in the transaction chain, the deleted N blocks are the i-th block to the j-th block, and the head pointer points to the i-1th block in the transaction chain, and the j+1 is pointed to by the tail pointer. Blocks. Here, the head pointer and the tail pointer may be block identifiers for executing corresponding blocks, and/or a storage address or the like may uniquely identify the block or the location of the block in the link chain. In this embodiment, the blockchain may include: a transaction chain that completely includes all the blocks, and may also include an optimized chain that introduces the parameter blocks.

Figure 5 is a schematic diagram of the structure of a complete transaction chain. Preferably, the head pointer includes: a hash value of a previous one of the N blocks deleted in the transaction chain; the tail pointer includes: a latter one of the N areas deleted in the transaction chain The hash value of the block.

FIG. 6 is a schematic structural diagram of an optimization chain in which a plurality of consecutively distributed blocks in the transaction chain shown in FIG. 5 are deleted and a parameter block is introduced. Based on the above example, the head pointer may be a hash value of the i-1th block, and the tail pointer is a hash value of the j+1th block. In FIG. 6, the head pointer of the parameter block is hi-1; wherein hi-1 is the hash value of the block header of block i-1; the tail pointer of the parameter block is hj+1; +1 may be the hash value of the block header of block j+1.

A hash value is a chain in a blockchain that links two adjacent blocks. Usually the hash value of a sub-block is generated based on the hash value of the parent block, and is one of the information that can uniquely identify the location of the block in a transaction chain.

Optionally, the step S110 may include:

In this embodiment, a preset function such as a hash function may be utilized to calculate the check value based on the hash value of each block. In this embodiment, the hash value of the first block to be deleted and the hash value of the second block to be deleted may be logically operated according to the distribution order of the N blocks in the transaction chain. In summary, the hash value of the i-th block to be deleted is logically operated with the i+1th hash value to be deleted, and after the N-1 logical operations are completed, the result of the logical operation is taken as the preset function. The dependent variable can obtain the function value of the preset function, and the function value can be used as the check value and stored in the parameter block as part of the parameter block. Here, the logical operation can: convert the corresponding hash value into a binary code, perform an AND operation or an operation between the binary, or a plurality of different types of operation results of various logical operations such as AND, NAND, and the like. . Of course, the above is only a way of calculating the check value, and other operations may be included in the specific implementation process.

For example, according to the generation time of the block, the corresponding hash value is sequentially input as a dependent variable to the preset function to calculate the function value, and the function value of the previous calculation and the function value of the latter calculation are again subjected to a function operation. The corresponding check value is executed cyclically until all the hash values of the block to be deleted participate in the calculation, so that the corresponding check value is also obtained.

Through the introduction of the check value, when the corresponding optimization chain is copied to other blockchain nodes, it is convenient for other blockchain nodes to check the parameter block, and the optimized chain storage information caused by the tampering of the parameter block is reduced. Wrong question. For example, by tampering with the head pointer or the tail pointer of the parameter block, the parameter block can be linked into the forged blockchain, and the occurrence of this phenomenon can be avoided or reduced by the introduction of the check value.

In some embodiments, the method shown in FIG. 7 further includes:

Step S140: When there is a block in the optimization chain that satisfies the preset deletion condition, the parameter block is updated according to the block parameter of the newly added block to be deleted; wherein the updated parameter block is updated. Linking to the next block of the block in the transaction chain that satisfies the preset deletion condition;

Step S150: Delete the newly added block to be deleted.

Since the blocks in the transaction chain are generated according to time, the blocks to be deleted may also be generated based on the generation time. Therefore, after completing an optimization, an optimization chain may be deleted at the next optimization time. A plurality of newly added blocks to be deleted are generated after the block is generated. In this case, only the parameter block needs to be updated, and a new parameter block is not generated. FIG. 8 is a schematic structural diagram of a re-optimization chain formed after the newly added block to be deleted is deleted again based on the optimization chain shown in FIG. 6. Obviously, in Figure 8, the tail pointer of the parameter block is changed from hj+1 to hj+2; thus the block pointed to by the tail of the parameter block is block j+2.

Specifically, the step S140 may include:

Determine the next block of the newly added block to be deleted;

Extracting the block identifier of the next block of the newly deleted block, for example, the hash value of the block, and modifying the content of the tail pointer in the parameter block, thereby realizing the update of the parameter block.

In some embodiments, the step S140 may further include:

Update the check value in the parameter block according to the hash value of the newly added block to be deleted,

In short, once an optimization chain is generated, the optimization chain can be re-optimized by updating part of the information in the parameter block, and a re-optimization chain with a further optimization effect can be generated.

In some cases, the parameter block corresponding to one optimization chain may include only one. In some embodiments, the parameter block may include multiple, but multiple parameter blocks are not adjacently distributed in the optimization chain. If two parameter blocks are adjacently distributed, a parameter block can be generated based on the combination of the first and last pointers in the two parameter blocks, and the parameter block is simplified as much as possible.

In some embodiments, the method further includes: in order to distinguish the parameter block in the optimization chain from the other block in which the actual transaction information is stored, the type tag of the parameter block is also set in the parameter block, and the subsequent information is During the query or copy process, different blocks in the blockchain can be distinguished by a quick comparison of the type tags of the blocks. In some embodiments, the optimization chain may also be separately stored by different types of blocks, facilitating the type distinction of subsequent blocks, and different processing of different types of blocks.

As shown in FIG. 9, the embodiment further provides a blockchain lightweight processing method, which is applied to a second blockchain node, and includes:

Step S210: Send a copy request of the blockchain to the first blockchain node;

Step S220: When the first blockchain node returns an optimization chain based on the copy request, sending an acquisition request to the third blockchain node based on the parameter block in the optimization chain, where a third block chain node is a block chain node that stores a transaction chain corresponding to the optimized chain; the obtaining request is used to acquire N blocks that have been deleted and continuously distributed in the optimization chain, N is a positive integer;

Step S230: Receive a block parameter returned by the third blockchain node.

Step S240: Verify parameter blocks in the optimization chain based on the block parameters.

Step S250: When the parameter block passes the verification, the optimized block is stored to form the optimized chain.

In some embodiments, in a blockchain network, there are a plurality of distributed blockchain nodes, which may duplicate the stored blockchains between the nodes.

In this embodiment, the optimization chain generation is locally generated in a blockchain node. If other blockchain nodes copy their stored optimization chains, in order to ensure the authenticity and reliability of the optimized chain, other Blockchain nodes may need to verify the optimized chain of copies.

In the present embodiment, other block chain nodes are collectively referred to as a second block chain node that distinguishes the first block chain node forming the optimized chain.

The second blockchain node sends a copy request to the first blockchain node. After the first blockchain node receives the copy request, since the partial block is deleted before, the local storage of the first block chain node is only an optimization chain, not a complete transaction chain, so the first block chain node The optimization chain is sent to the second blockchain node.

After receiving the optimization chain, the second blockchain node can find the currently received optimization chain instead of the complete transaction chain by type identification and statistics of the number of blocks.

The second blockchain node also stores the blockchain with as few storage resources as possible, that is, only wants to store the optimized chain, and then requests the third blockchain node that stores the complete transaction chain to request the missing in the optimized chain. Block information for the block.

In this embodiment, usually the first blockchain node and the second blockchain node may both be client nodes, and the third blockchain node may be a server node. Typically, a server node must store a complete transaction chain for at least a period of time. Therefore, the acquisition request can be sent to the server node in step S220. At least a predetermined number of server nodes storing a complete transaction chain are included in a blockchain node system. The predetermined number here can be only one. Of course, this is only an example. In some cases, if the transaction information has expired based on the validity of the transaction information in the transaction chain, the server node may also delete the corresponding block, store only the hash value of the corresponding block, and the like for the subsequent optimization chain. The verified information, or even the information used for verification, is not stored, and only the verification-free indication corresponding to the block deletion is sent to the entire system, and the optimized chain replication between the subsequent blockchain nodes corresponds to Partially exempt from verification.

After transmitting the acquisition request, the third blockchain node returns corresponding block information for the second blockchain node to check the parameter block. In this embodiment, the verification of the parameter block includes at least: checking the tail pointer in the parameter block, and of course including: checking the head pointer.

The verification can ensure that the optimized chain currently copied from the first blockchain node is trusted, ensuring the authenticity and credibility of the blockchain information.

Further, the step S220 may include:

Determining, according to the parameter block, a first hash value and a second hash value, wherein the first hash value is: a dispersion of the first block of the N consecutive blocks that have been deleted a column value, the second hash value is: a hash value of the last block of the N consecutive blocks that have been deleted;

The block parameter includes at least: a hash value of the second block to the N-1th block among the N blocks that are continuously distributed.

In some embodiments, the hash value is mainly used as the head pointer and the tail pointer in the parameter block. Therefore, in the embodiment, when the acquisition request is sent to the third block chain node, the parameter block may be used as the parameter block. The first hash value of the head pointer and the second hash value as the tail pointer are carried in the acquisition request.

After the third block chain node receives the first hash value and the second hash value, the query transaction chain or the query still includes the optimization chain of the corresponding block, and obtains the i-th block corresponding to the first hash value and the first block. a hash value of the i+1th to j-1th blocks between the jth blocks corresponding to the two hash values, and returning the hash values as the request response of the fetch request to the second block Chain node.

After receiving the hash values, the second block chain node performs function calculation and obtains a function based on the pre-negotiated preset function or a function defined by the consensus mechanism, using the hash values as at least one of the dependent variables. value. The function value is compared with the check value carried in the corresponding parameter block, and the parameter block is verified. Specifically, the step S240 may include:

Matching the generated function value with the check value;

Through the calculation of the function value and the matching with the check value, the authenticity and reliability of the information in the parameter block can be ensured, thereby ensuring the reliability and authenticity of the currently received optimization chain.

In this way, the second block chain node stores the optimized chain from the beginning, which greatly reduces various resources such as storage resources consumed by the blockchain, and facilitates accounting processing of blockchain nodes with less storage resources.

The embodiment of the present disclosure further provides a blockchain weighting processing method applied to a third blockchain node, including:

Receiving an acquisition request sent by the second blockchain;

Querying the transaction chain based on the acquisition request, or including an optimization chain of the block parameters of the block corresponding to the acquisition request;

Transmitting the queried block parameter to the second blockchain node, wherein the block parameter is used by the second blockchain node to verify the parameter block in the optimization chain.

The related descriptions and differences between the optimization chain and the transaction chain can be seen in the foregoing embodiment, and will not be repeated again.

The block parameter may include a hash value or other block identification of the deleted block in the optimization chain.

The obtaining request may carry a first hash value of the first deleted block of the N blocks deleted in the optimization chain, and a second hash value of the last block of the deleted N blocks.

As shown in FIG. 10, the embodiment provides a blockchain node, where the blockchain node is a first blockchain node, and includes:

The generating unit 110 is configured to generate a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, where the N is a positive integer;

a deleting unit 120, configured to delete the N blocks in the transaction chain;

a first storage unit 130, configured to store the parameter block, where the parameter block and the undeleted block in the transaction chain form an optimization chain, wherein a parent block of the parameter block is The previous block of the N blocks deleted in the transaction chain, and the sub-area of the parameter block is: the latter area of the N blocks deleted in the transaction chain.

A schematic structural diagram of a blockchain node provided by this embodiment.

Both the generating unit 110 and the deleting unit 120 may correspond to a connection structure of a processor and a memory of a physical node where the block chain 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.

The first storage unit 130 may correspond to a storage medium and may be used for storage of the parameter block.

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 blockchain. Usually, the optimized optimization chain includes fewer blocks than the block tree included in the complete transaction chain. The data volume of the parameter block is generally less than the data volume of the block including transaction information in one transaction volume, so the overall optimization is performed. The amount of data in the chain is much smaller than the data chain of the transaction chain. In this way, if only the optimization chain is stored, the storage resource is obviously saved compared with the storage transaction chain, and the computing resources of subsequent queries are saved. For example, the information stored in the normally deleted block is invalid or the frequency of the accessed is very low. If a query request is received, if the transaction chain is queried based on the hash value, if the transaction chain includes M blocks, then It may be necessary to compare the hash values of the M blocks, and the optimization chain only includes MN blocks, and the maximum number of matches in the query process is MN times, which obviously saves the number of query matching.

Optionally, the first blockchain node further includes:

a determining unit, configured to determine whether the N blocks that are continuously distributed in the transaction chain meet the preset deletion condition;

The generating unit 110 is specifically configured to generate a parameter block based on the N blocks if the preset deletion condition is met.

The judging unit here may also correspond to a processor or a processing circuit.

Optionally, the first storage unit 130 is specifically configured to use a head pointer included in the parameter block to point to a previous one of the N blocks deleted in the transaction chain; The included tail pointer points to the next block in the N blocks deleted in the transaction chain.

Further, the head pointer includes: a hash value of a previous one of the N blocks deleted in the transaction chain; the tail pointer includes: a latter area of the N areas deleted in the transaction chain The hash value of the block.

In some embodiments, the generating unit 110 is specifically configured to calculate a check value by using a hash value of the N blocks to be deleted, where the parameter block further includes the check value, a check value, configured to be used by the second block chain node to verify the optimized chain when the optimized chain is sent to the second block chain node.

In still other implementations, the first block connection node further includes:

And an update unit, configured to update the parameter block according to the block parameter of the newly added block when the block to be deleted is newly added in the optimization chain; wherein the updated parameter block, Linking to the next block of the block in the transaction chain that satisfies the preset deletion condition;

The deleting unit is further configured to delete the newly added block to be deleted.

The deletion unit here can also correspond to a processor or a processing circuit.

As shown in FIG. 11, the embodiment further provides a blockchain node, where the blockchain node is a second blockchain node, including:

The sending unit 210 is configured to send a copy request of the blockchain to the first blockchain node; when the first blockchain node returns an optimized chain based on the copy request, based on parameters in the optimized chain a block, sending an acquisition request to the third blockchain node, wherein the third blockchain node is a blockchain node that stores a transaction chain corresponding to the optimized chain; the obtaining request is used to obtain N blocks that have been deleted and continuously distributed in the optimization chain, and the N is a positive integer;

The receiving unit 220 is configured to receive a block parameter returned by the third blockchain node;

The verification unit 230 is configured to verify the parameter block in the optimization chain based on the block parameter;

The second storage unit 240 is configured to store the optimized block to form the optimized chain when the parameter block passes the verification.

A second blockchain node is provided in this embodiment. The blockchain node includes: a sending unit 210 and a receiving unit 220, which may correspond to a network interface of a physical node where the blockchain node is located. The network interface can be a cable interface, a fiber optic cable interface, and/or a transceiver antenna. The physical node may be various communication devices, such as a personal communication device such as a web server, a mobile phone, or a desktop computer.

The verification unit 230 may correspond to a processor; a related description of the processor may refer to the foregoing embodiment, and is not repeated here.

The second storage unit 240 may correspond to a local storage medium of the second blockchain node, and the storage medium is preferably a non-transitory storage medium, which can be used for a non-instantaneous storage optimization chain, and reduces the stored resources through optimization of the transaction chain. Consumption, the consumption of computing resources for subsequent operations.

Optionally, the second blockchain node may include a determining unit that may also correspond to the processor; the determining unit may be configured to determine the first hash value and the second hash based on the parameter block a column value, wherein the first hash value is: a hash value of the first block of the successive N blocks that have been deleted, and the second hash value is: the deleted consecutive respectively The hash value of the last block in the N blocks; wherein the block parameter includes at least: the second block to the N-1th block of the N blocks that have been continuously distributed are deleted Column value; the parameter block further includes: a check value.

The sending unit 210 is configured to send, to the third blockchain node, an acquisition request that carries the first hash value and the second hash value;

The verification unit 230 is specifically configured to generate a function value by using a preset function based on the hash value of the deleted N blocks that are continuously distributed; and matching the generated function value with the check value; If the matches are consistent, it is determined that the parameter block passes the verification.

In this embodiment, the second blockchain node may directly copy or copy the optimized chain from other blockchain nodes to reduce the storage resources consumed by the blockchain storage, or the computing resources consumed by subsequent operations.

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

The processor 330 is connected to the transceiver 310 and the memory 320, respectively, for controlling the information interaction of the transceiver 310 and the information storage of the memory 320 by executing the computer program, and the foregoing one or A blockchain lightweight processing method provided by a plurality of technical solutions.

For example, the processor 330 can implement the blockchain lightening processing method shown in FIG. 3, FIG. 4, FIG. 7, and/or FIG. 9 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.

The embodiment of the present disclosure further provides a computer storage medium, where the computer storage medium stores a computer program, and after the computer program is executed, the blockchain lightweight processing method provided by one or more of the foregoing technical solutions can be implemented, for example, The blockchain weighting processing method shown in FIG. 3, FIG. 4, FIG. 7, and/or FIG. 9 can be implemented.

The computer storage medium provided by the embodiment of the present disclosure includes: a mobile storage device, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. Medium. Optionally, the computer storage medium can be a non-transitory storage medium.

A specific example is provided below in conjunction with the above embodiments:

Example 1:

The method is applicable to a scenario in which a large number of blocks can be deleted, and the local node needs to record a plurality of group parameters, and each group of parameters corresponds to a group of consecutive deletable blocks. Each set of parameters consists of the following:

Header Pointer: Records the parent block header hash value of the first block in a consecutive set of deletable blocks.

Tail pointer: Records the sub-block header hash value of the last block in a consecutive set of deletable blocks.

Check value: Calculate the hash value of all block headers in a group of consecutive deletable blocks, and save the operation result as a check value. The calculation method is shown in the following example.

Taking the blockchain shown in Figure 5 as an example, the hash value of the block header of block k is recorded as hk. If block i to block j needs to be deleted, the node needs to calculate the following parameters:

Head pointer: hi-1

Tail pointer: hj+1

Check value: H(H(...H(H(hi)||hi+1)||...||hj-1)||hj), where H is a one-way function.

After calculating the above parameters, the node can delete block i, block j, and all blocks between the two, and use the above parameters to connect block i-1 with block j+1, as shown in FIG. 6.

Further optimized on the basis of the optimization chain shown in FIG. 6, if the block identified by the tail pointer (block j+1) can also be deleted, it can be further optimized on the basis of the above, and the optimized blockchain is as shown in FIG. 7. Shown. Where the head pointer is unchanged, the tail pointer of the parameter block is pointed to the block j+2, and in addition, the check value is recalculated, and only H(h||hj+10) needs to be calculated on the basis of the check value h of FIG. Thus, the optimized chain shown in Fig. 8 is obtained.

Since the parameter block contains the check value, the node can verify the parameter block by querying the complete block header, thereby ensuring the correctness of the parameter block.

Scalability: This proposal is extensible. The examples in Figure 5 and Figure 6 show that if the block identified by the tail pointer can also be deleted, then only the parameter block in the related art and the area indicated by the tail pointer need to be utilized. The block information can be used to calculate a new parameter block without using other block data.

Storage efficiency: A set of parameters can identify several consecutive blocks, and multiple sets of parameters can identify multiple sets of consecutive blocks, so that the block can be freely deleted.

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.

A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by using hardware related to the program instructions. The foregoing program may be stored in a computer readable storage medium, and the program is executed when executed. The steps of the above method embodiments are included.

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 is applied to a first blockchain node, including:

Generating a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, where the N is a positive integer;

Deleting the N blocks in the transaction chain;

Storing the parameter block, wherein the parameter block and the undeleted block in the transaction chain form an optimization chain, wherein the parent block of the parameter block is: deleted in the transaction chain The previous block of the N blocks, the sub-area of the parameter block is: the latter area of the N blocks deleted in the transaction chain.
The method of claim 1 further comprising:

Determining whether the N blocks continuously distributed in the transaction chain satisfy the preset deletion condition;

Generating a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, including:

If the preset deletion condition is met, a parameter block is generated based on the N blocks.
The method of claim 1 characterized in that

The parameter block includes at least: a head pointer and a tail pointer;

The head pointer points to a previous one of the N blocks deleted in the transaction chain;

The tail pointer points to the next one of the N blocks deleted in the transaction chain.
The method of claim 3, wherein

The head pointer includes: a hash value of a previous one of the N blocks deleted in the transaction chain;

The tail pointer includes: a hash value of a subsequent block of the N regions deleted in the transaction chain.
A method according to any one of claims 1 to 4, characterized in that

Generating a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, including:

Calculating a check value by using a hash value of the N blocks to be deleted, where the parameter block further includes the check value, where the check value is used to send the optimized chain to the second The block chain node is used for verification of the optimized chain by the second block chain node.
A method according to any one of claims 1 to 4, further comprising:

When there is a newly added block to be deleted in the optimization chain, the parameter block is updated according to the block parameter of the newly added block; wherein the updated parameter block is linked to the a subsequent block of the block in the transaction chain that satisfies the preset deletion condition;

Delete the newly added block to be deleted.
A blockchain lightweight processing method is applied to a second blockchain node, including:

Sending a copy request of the blockchain to the first blockchain node;

And when the first block chain node returns an optimization chain based on the copy request, sending an acquisition request to the third block chain node, where the third area is based on the parameter block in the optimization chain a block chain node is a block chain node that stores a transaction chain corresponding to the optimization chain; the obtaining request is used to acquire N blocks that have been deleted and continuously distributed in the optimization chain, where the N is positive Integer

Receiving a block parameter returned by the third blockchain node;

Verifying the parameter block in the optimization chain based on the block parameter;

When the parameter block passes verification, the optimized block is stored to form the optimized chain.
The method of claim 7 wherein

And when the first blockchain node returns an optimized chain based on the copy request, sending, according to the parameter block in the optimization chain, the third blockchain node to obtain the deleted in the optimized chain. The request for obtaining the block parameters of the N blocks includes:

Determining, according to the parameter block, a first hash value and a second hash value, wherein the first hash value is: a dispersion of the first block of the N consecutive blocks that have been deleted a column value, the second hash value is: a hash value of the last block of the N consecutive blocks that have been deleted; wherein the block parameter includes at least: N consecutively deleted a hash value of the second block to the N-1th block in the block; the parameter block further includes: a check value;

Sending an acquisition request carrying the first hash value and the second hash value to the third blockchain node;

The verifying, by the block parameter, the parameter block in the optimization chain, including:

Generating a function value using a preset function based on the hash values of the deleted N blocks that are continuously distributed;

Matching the generated function value with the check value;

If the matches are consistent, it is determined that the parameter block passes the verification.
A blockchain node, wherein the blockchain node is a first blockchain node, including:

a generating unit, configured to generate a parameter block based on the N blocks to be deleted that are continuously distributed in the transaction chain, where the N is a positive integer;

a deleting unit, configured to delete the N blocks in the transaction chain;

a first storage unit, configured to store the parameter block, wherein the parameter block and the unremoved block in the transaction chain form an optimization chain, wherein the parent block of the parameter block is: The previous block of the N blocks deleted in the transaction chain, and the sub-area of the parameter block is: the latter area of the N blocks deleted in the transaction chain.
A blockchain node, wherein the blockchain node is a second blockchain node, including:

a sending unit, configured to send a copy request of the blockchain to the first blockchain node; when the first blockchain node returns an optimized chain based on the copy request, based on the parameter region in the optimized chain a block, sending an acquisition request to the third blockchain node, wherein the third blockchain node is a blockchain node that completes a transaction chain corresponding to the optimized chain; the obtaining request is used to acquire Deleting and continuously distributing N blocks in the optimization chain, where N is a positive integer;

a receiving unit, configured to receive a block parameter returned by the third blockchain node;

a verification unit, configured to verify a parameter block in the optimization chain based on the block parameter;

And a second storage unit, configured to: when the parameter block passes the verification, store the optimized block to form the optimized chain.
A blockchain node comprising: a transceiver, a memory, a processor, and a computer program stored on the memory and processed by the processor;

The processor is respectively connected to the transceiver and the memory, for controlling information exchange of the transceiver, storing information of the memory by executing the computer program, and performing any one of claims 1 to 8 The blockchain lightweight processing method provided by the item.
A computer storage medium, wherein the computer storage medium stores a computer program, and after the computer program is executed, the blockchain lightening processing method according to any one of claims 1 to 8 can be implemented.