CN109391645A - Block chain light-weight technologg method, block chain node and storage medium - Google Patents
Block chain light-weight technologg method, block chain node and storage medium Download PDFInfo
- Publication number
- CN109391645A CN109391645A CN201710657510.XA CN201710657510A CN109391645A CN 109391645 A CN109391645 A CN 109391645A CN 201710657510 A CN201710657510 A CN 201710657510A CN 109391645 A CN109391645 A CN 109391645A
- Authority
- CN
- China
- Prior art keywords
- block
- chain
- deleted
- parameter
- optimization
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000003860 storage Methods 0.000 title claims abstract description 69
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000005457 optimization Methods 0.000 claims abstract description 115
- 238000012217 deletion Methods 0.000 claims description 31
- 230000037430 deletion Effects 0.000 claims description 31
- 230000006870 function Effects 0.000 claims description 18
- 238000004590 computer program Methods 0.000 claims description 12
- 230000005540 biological transmission Effects 0.000 claims description 8
- 230000008859 change Effects 0.000 claims description 6
- 241000208340 Araliaceae Species 0.000 claims description 2
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 claims description 2
- 235000003140 Panax quinquefolius Nutrition 0.000 claims description 2
- 235000008434 ginseng Nutrition 0.000 claims description 2
- 239000004744 fabric Substances 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 16
- 238000012795 verification Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000009826 distribution Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000001419 dependent effect Effects 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 239000000284 extract Substances 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0609—Buyer or seller confidence or verification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/0823—Network architectures or network communication protocols for network security for authentication of entities using certificates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5681—Pre-fetching or pre-delivering data based on network characteristics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
Abstract
The embodiment of the invention discloses a kind of block chain light-weight technologg method, block chain node and computer storage mediums.Applied to the method block chain light-weight technologg method in the first block chain node, comprising: based on N number of block to be deleted continuously distributed in chain transaction, generate parameter block, wherein the N is positive integer；Delete N number of block in the chain transaction；Store the parameter block, wherein, optimization chain is collectively formed in not deleted block in the parameter block and the chain transaction, wherein, father's block of the parameter block are as follows: the previous block for the N number of block deleted in the chain transaction, the subregion of the parameter block are as follows: the latter region for the N number of block deleted in the chain transaction.
Description
Technical field
The present invention relates to information technology field more particularly to a kind of block chain light-weight technologg method, block chain node and
Computer storage medium.
Background technique
The block chain technology of rising in recent years be it is a kind of sequentially in time by data block in such a way that sequence is connected group
A kind of linked data structure of synthesis, and guarantee its distributed account book that can not be distorted and can not forge in a manner of cryptography.Area
The core technology of block chain is to verify to know together algorithm next life with storing data, using distributed node using block linked data structure
At the safety for guaranteeing data transmission and access with more new data, in the way of cryptography.
The very big problem of one of block chain is wherein can be comprising all historical tradings, with the increase of trading volume, area
Block in block chain will be also increasing, and the data of entire block chain can be increasing, to the need of node storage and computing resource
Asking can be higher and higher.
Summary of the invention
In view of this, an embodiment of the present invention is intended to provide a kind of block chain light-weight technologg method, block chain node and meters
Calculation machine storage medium at least partly solves the problems, such as that the resource consumptions such as storage resource are big in block chain technology.
In order to achieve the above objectives, the technical scheme of the present invention is realized as follows:
First aspect of the embodiment of the present invention provides kind of a block chain light-weight technologg method, is applied to the first block chain node
In, comprising:
Based on N number of block to be deleted continuously distributed in chain transaction, parameter block is generated, wherein the N is positive whole
Number；
Delete N number of block in the chain transaction；
Store the parameter block, wherein the parameter block is collectively formed with not deleted block in the chain transaction
Optimize chain, wherein father's block of the parameter block are as follows: the previous block for the N number of block deleted in the chain transaction, it is described
The subregion of parameter block are as follows: the latter region for the N number of block deleted in the chain transaction.
Based on above scheme, the method also includes:
Judge whether N number of block continuously distributed in chain transaction meets the preset deletion condition；
It is described based on N number of block to be deleted continuously distributed in chain transaction, generate parameter block, comprising:
If meeting the default deletion condition, parameter block is generated based on N number of block.
It based on above scheme, is included at least in the parameter block: head pointer and tail pointer；
The head pointer is directed toward previous block in the N number of block deleted in the chain transaction；
The tail pointer is directed toward the latter block in the N number of block deleted in the chain transaction.
Based on above scheme, the head pointer includes: the scattered of previous block in the N number of block deleted in the chain transaction
Train value；
The tail pointer includes: the hashed value of the latter block in the N number of region deleted in the chain transaction.
It is described that parameter block is generated based on N number of block to be deleted continuously distributed in chain transaction based on above scheme,
Include:
Using the hashed value of N number of block to be deleted, check value is calculated, wherein the parameter block further includes the school
Value is tested, the check value when for the optimization chain to be sent to the second block chain node, is used for the second block chain node
Verifying to the optimization chain.
Based on above scheme, the method also includes:
When have in the optimization chain increase block to be deleted newly when, according to the patch parameters for increasing block to be deleted newly, more
The new parameter block；Wherein, updated parameter block will be linked in the chain transaction and meet the default deletion condition
Block the latter block；
Delete newly-increased block to be deleted.
Second aspect of the embodiment of the present invention provides a kind of block chain light-weight technologg method, is applied to the second block chain node
In, comprising:
The duplicate requests of block chain are sent to the first block chain node；
When the first block chain node is optimization chain based on duplicate requests return, based in the optimization chain
Parameter block, to third block chain node send acquisition request, wherein the third block chain node be complete storage
State the block chain node of the corresponding chain transaction of optimization chain；The acquisition request has been deleted and has been connected in the optimization chain for obtaining
N number of block of continuous distribution, the N are positive integer；
Receive the patch parameters that the third block chain node returns；
The parameter block in the optimization chain is verified based on the patch parameters；
When the parameter block passes through verifying, the optimization block is stored to form the optimization chain.
Based on above scheme, described returned when the first block chain node based on the duplicate requests is optimization chain
When, based on the parameter block in the optimization chain, the N number of area for obtaining and deleting in the optimization chain is sent to third block chain node
The acquisition request of the patch parameters of block, comprising:
Block based on the parameter determines the first hashed value and the second hashed value, wherein first hashed value are as follows:
The hashed value of first block, second hashed value in the N number of block deleted continuously respectively are as follows: described to have deleted continuously
The hashed value of tail block in N number of block respectively；Wherein, the patch parameters, include at least: having deleted continuously distributed N
In a block the 2nd block to the N-1 block hashed value；In the parameter block further include: check value；
The acquisition for carrying first hashed value and second hashed value to third block chain node transmission is asked
It asks；
It is described that the parameter block in the optimization chain is verified based on the patch parameters, comprising:
Based on the hashed value of deleted continuously distributed N number of block, preset function generating function value is utilized；
The functional value of generation is matched with the check value；
If matching is consistent, it is determined that the parameter block passes through verifying.
Third party of the embodiment of the present invention provides a kind of block chain node, and the block chain node is the first block chain node,
Include:
Generation unit, for generating parameter block based on N number of block to be deleted continuously distributed in chain transaction, wherein
The N is positive integer；
Unit is deleted, for deleting N number of block in the chain transaction；
First storage unit, for storing the parameter block, wherein do not deleted in the parameter block and the chain transaction
Optimization chain is collectively formed in the block removed, wherein father's block of the parameter block are as follows: the N number of block deleted in the chain transaction
Previous block, the subregion of the parameter block are as follows: the latter region for the N number of block deleted in the chain transaction.
Fourth aspect of the embodiment of the present invention provides a kind of block chain node, and the block chain node is the second block chain link
Point, comprising:
Transmission unit, for sending the duplicate requests of block chain to the first block chain node；When the first block chain link
Point is when optimizing chain, based on the parameter block in the optimization chain, to third block chain link based on duplicate requests return
Point sends acquisition request, wherein the third block chain node is the area for completing to be stored with the corresponding chain transaction of the optimization chain
Block chain node；The acquisition request has been deleted and continuously distributed N number of block, the N are positive for obtaining in the optimization chain
Integer；
Receiving unit, the patch parameters returned for receiving the third block chain node；
Authentication unit, for being verified based on the patch parameters to the parameter block in the optimization chain；
Second storage unit is formed described for when the parameter block passes through verifying, storing the optimization block
Optimize chain.
The aspect of the embodiment of the present invention the 5th provides a kind of block chain node, comprising: transceiver, memory, processor and deposits
The computer program for storing up on the memory and being handled by the processor；
The processor is connect with the transceiver and the memory respectively, for by executing the computer journey
Sequence controls the information exchange of the transceiver, the storage of the information of the memory, and executes aforementioned any one or more technologies
The block chain light-weight technologg method that scheme provides.
The 5th aspect of the embodiment of the present invention provides a kind of computer storage medium, which is characterized in that the computer storage
After media storage has computer program, the computer program to be performed, it can be realized and execute aforementioned any one or more skills
The block chain light-weight technologg method that art scheme provides.
Block chain light-weight technologg method, block chain node and computer storage medium provided in an embodiment of the present invention are
The data volume of block chain is reduced, parameter block can be generated based on the patch parameters of block to be deleted, which can be with
The previous block and the latter block for linking the block deleted form the optimization chain of an optimization.The usually block of optimization chain
Number is less than the block counts for remaining the chain transaction of intact block, and the data volume of parameter block is usually less than in a chain transaction and wraps
The data volume of the block of Transaction Information is included, so that the data volume for optimizing chain on the whole is far less than trading volume.If block chain node
Only storage optimization chain, it is clear that block chain can be reduced and store consumed storage resource, while facilitating the institutes such as subsequent query operation
The computing resource of consumption, so as to save computing resource consumed by inquiry all subsequent operations such as inquiry operation of block chain.
To solve the problems, such as that the resource consumptions such as storage resource are big in existing block chain technology.
Detailed description of the invention
Fig. 1 is a kind of structural schematic diagram of block chain；
Fig. 2 is the structural schematic diagram of another block chain；
Fig. 3 is the flow diagram of the first block chain light-weight technologg provided in an embodiment of the present invention；
Fig. 4 is the flow diagram of second of block chain light-weight technologg provided in an embodiment of the present invention；
Fig. 5 is a kind of structural schematic diagram of chain transaction provided in an embodiment of the present invention；
Fig. 6 is the structural schematic diagram of the optimization chain formed after chain transaction shown in fig. 5 optimizes；
Fig. 7 is the flow diagram of the third block chain light-weight technologg provided in an embodiment of the present invention；
Fig. 8 is the structural schematic diagram of the optimization chain after suboptimization again on the basis of optimization chain shown in Fig. 6；
Fig. 9 is the flow diagram of the 4th kind of block chain light-weight technologg provided in an embodiment of the present invention；
Figure 10 is a kind of structural schematic diagram of first block chain node provided in an embodiment of the present invention；
Figure 11 is a kind of structural schematic diagram of second block chain node provided in an embodiment of the present invention；
Figure 12 is a kind of structural schematic diagram of block chain node provided in an embodiment of the present invention.
Specific embodiment
Technical solution of the present invention is further described in detail with reference to the accompanying drawings and specific embodiments of the specification.
The relevant information of the block of following chain transaction introduced below.
As shown in Figure 1, block successively generates one by one in chronological order and connects chaining in block chain technology, each
Block has recorded the Transaction Information generated during creation, obtains public affairs of each block chain node based on common recognition mechanism in block chain network
The transaction recognized will permanently store in block chain.As shown in Figure 1, the data structure of block is generally divided into block head and block body.
As shown in Fig. 2, the block head of each block contains the hashed value of previous block (i.e. father's block), to be formed from the area Chuan Shi
Block and has determined each block the location of in entire block chain to the chain of current block.Usual the latter block
Block head includes the hashed value of the block head memory storage of previous block.To prevent the transaction in block to be tampered, block chain makes
It is set with Merkel (Merkle) to conclude the All Activity in a block, Merkle root is then the abstract of All Activity, area
The change of any one transaction information can all change Merkle root in block.Block body then contains by verifying, block creation
The Transaction Information generated in the process.As shown in Fig. 2, the block head of block k includes the hashed value in the block head of block k-1；And
The information such as the timestamp in the block head of each block also comprising random number, generation time.One block may record more
Transaction Information, timestamp here are also possible to be that the exchange hour that each is traded stabs.
The embodiment of the present invention provides a kind of block chain light-weight technologg method, is applied in the first block chain node, such as Fig. 3
It is shown, comprising:
Step S110: based on N number of block to be deleted continuously distributed in chain transaction, parameter block is generated, wherein described
N is positive integer；
Step S120: N number of block in the chain transaction is deleted；
Step S130: the parameter block is stored, wherein not deleted block in the parameter block and the chain transaction
Optimization chain is collectively formed, wherein father's block of the parameter block are as follows: the N number of block deleted in the chain transaction it is previous
Block, the subregion of the parameter block are as follows: the latter region for the N number of block deleted in the chain transaction.
Block chain light-weight technologg method provided in this embodiment, the substantially method of the data volume of reduction block chain,
So that block chain is the characteristics of being presented light weight in data volume.
First block chain node described in the present embodiment can be any one accounting nodes in block chain network.In this implementation
In example, the data storage capacity of block chain and the computing resource of maintenance data storage is locally stored in order to save in the accounting nodes
Deng will be deleted the block that part in the original block chain (the i.e. described chain transaction) that is made of block meets deletion condition.At this
Continuously distributed N number of block in embodiment, preferably continuously distributed multiple blocks can reduce parameter to greatest extent in this way
The generation of block reduces the data volume of optimization chain.
But after deleting these blocks, therefore, to assure that the chain structure of block chain, meeting parameter block, the parameter block are
Deleted multiple blocks can be substituted, not deleted block in chain transaction is linked, formation data volume is far smaller than original
The optimization chain of chain transaction.In this case, the chain structure of block chain is still completely saved.
Such first block chain node can be by the deletion of corresponding block, and only storage optimization chain, subtracts so as to reach
The occupancy of the storage resource of few block chain, reduces the consumption of system resource needed for safeguarding these block chains.
In some embodiments, as shown in figure 4, the method also includes:
Step S100: judge whether N number of block continuously distributed in chain transaction meets the preset deletion condition；
The step S110 specifically may include step S111；The step S111 can include:
If meeting the default deletion condition, parameter block is generated based on N number of block.
Judge there are many modes that whether continuously distributed N number of block meets the preset deletion condition, it is presented below it is several can
Select mode.
Optional way one:
The step S100 can include:
Whether the transaction content for judging that continuously distributed N number of block is recorded is more than validity period；
When the transaction content that continuously distributed N number of block is recorded is more than validity period, then it is assumed that this N number of continuously distributed block
Meet the default deletion condition.
For example, being stored with the certificate information for distributing to corresponding user in the block body of each block in chain transaction, and demonstrate,prove
Letter breath has certain timeliness, and when the certificate information alreadys exceed validity period, i.e. timeliness has been lost, then it is believed that should
The certificate information stored in the block body of block is invalid, in order to save memory space, can delete the block.Then it is believed that
The information state of the block meets the default storage condition.Here certificate information can be one kind of aforementioned Transaction Information.This
In certificate information can include: the certificate of authority and the user information of the certificate of authority etc..
Optional way two:
The step S100 can include:
Extract in the chain transaction or optimize the timestamp of each block in chain；The timestamp includes the generation of corresponding block
Time；
Judge whether current time is more than preset time threshold apart from the time difference for generating the time；
If the time difference is more than preset time threshold, it is believed that corresponding block is the area for meeting the default deletion condition
Block.
For example, in some cases, although the validity for the design information that some blocks will not be rigid, in the block
The subsequent probability being queried of corresponding Transaction Information is almost nil, alternatively, being less than predetermined probabilities.For example, the generation time is more than
The block of one time threshold.The time threshold can be 1 year, 2 years or 5 years etc..
Optional way three:
The step S100 can include:
It extracts the chain transaction or optimizes the block that history block is spaced between the block that the last one is generated in chain
Number；
When the block number is more than number threshold value, then it is assumed that corresponding block be meet the preset deletion condition it is to be deleted
Block.
For example, currently isolation has the history block of predetermined number block to distance between newest block in chain transaction, for example,
It at present include 5.3 ten thousand blocks in chain transaction A, if the block before the predetermined number is the 10,000, the 4.3rd ten thousand block (is created
Except generation block) it is all the block that can be deleted.
It is worth noting that, deletable block does not include the wound generation block in chain transaction in the present embodiment, here
Create the first block that generation block is chain transaction.
In short, the missing of effective information caused by deleting block is avoided in the present embodiment, it only can be in chain transaction or excellent
Change the block that meets the preset deletion condition in chain to be deleted, to ensure to delete after the optimization block after corresponding block can satisfy
The demand of continuous information inquiry and/or verifying, it is as full as possible while reducing the storage resource and computing resource that data volume occupies
The demand of sufficient information inquiry.
The introducing for passing through step S100 in the present embodiment, satisfaction can only be deleted in advance in the first block chain node by being equivalent to
If the block of the condition of deletion, in some cases, the first block chain node can be according to the use of the storage resource of itself
Situation etc., the storage of the selective discarding Partial Block using above-mentioned technical proposal, and do not have to judge which block is to meet
Default deletion condition.For example, the utilization rate of block chain node A current storage resource is higher than most in a kind of application scenarios
Big utilization rate threshold value, in order to ensure the normal operation of block chain node, it is necessary to discharge part storage resource.It then can be according to random
Block Set in one or more chain transaction is block to be deleted by the selection modes such as algorithm, by the deletion of block and
Optimize the storage of chain, discharges part storage resource.
Optionally, it is included at least in the parameter block: head pointer and tail pointer；
The head pointer is directed toward previous block in the N number of block deleted in the chain transaction；
The tail pointer is directed toward the latter block in the N number of block deleted in the chain transaction.
For example, N number of block of deletion is i-th of block to j-th of block, then head pointer is directed toward transaction in chain transaction
(i-1)-th block in chain ,+1 block of jth that tail pointer is directed toward.Here head pointer and tail pointer can correspond to area to execute
Block it is block-identified, and/or, storage address etc. can with the unique identification block or the block position in area's chain information.?
In the present embodiment, it also may include introducing parameter region that the block chain, which may include: the chain transaction for completely including all blocks,
The optimization chain of block.
The structural schematic diagram of one shown in fig. 5 complete chain transaction.Preferably, the head pointer includes: the friendship
The hashed value of previous block in the N number of block deleted in easy chain；The tail pointer include: deleted in the chain transaction it is N number of
The hashed value of the latter block in region.
Fig. 6 show one kind and deletes in chain transaction shown in fig. 5, after multiple continuously distributed blocks and introduces ginseng
A kind of structural schematic diagram of the optimization chain of number block.Based on the example above, then the head pointer can be (i-1)-th block
Hashed value, the tail pointer are the hashed value of+1 block of jth.In Fig. 6, the head pointer of parameter block is hi-1；Wherein hi-
1 is the hashed value of the block head of block i-1；The tail pointer of the parameter block is hj+1；The hj+1 can be the area of block j+1
The hashed value of build.
Hashed value is the chain that two neighboring block is linked in block chain.The hashed value of usual sub-block is based on father's block
Hashed value generate, being can be with one of the information of position of the block in one chain transaction of unique identification.
Optionally, the step S110 can include:
Using the hashed value of N number of block to be deleted, check value is calculated, wherein the parameter block further includes the school
Value is tested, the check value when for the optimization chain to be sent to the second block chain node, is used for the second block chain node
Verifying to the optimization chain.
It can use the preset functions such as hash function in the present embodiment, the hashed value based on each block calculates
The check value.It in the present embodiment, can be according to distribution sequence of N number of block in chain transaction, from the 1st area to be deleted
The hashed value of block carries out logical operation with the hashed value of the 2nd block to be deleted, in short, the hash of i-th of block to be deleted
Value carries out logical operation with i+1 hashed value to be deleted, after completing N-1 logical operation, by the result of logical operation
As the dependent variable of the preset function, the functional value of available preset function, the functional value can be used as the check value,
A part as parameter block is stored in parameter block.Here logical operation, can be with: corresponding hashed value is converted into
After binary code, carry out between binary system with operation or operation, alternatively, repeatedly it is different types of with or it is non-etc. various
The operation result of logical operation.Certainly, the above is only a kind of modes for calculating check value may be used also during concrete implementation
To include in a manner of other operations.
For example, being successively input to preset function meter for corresponding hashed value as dependent variable according to the generation time of block
Calculation obtains functional value, and the functional operation that the preceding functional value once calculated carries out again with the functional value once calculated afterwards is obtained
Corresponding check value, circulation execute until the hashed value of all blocks to be deleted has been involved in calculating, also can in this way
Obtain corresponding check value.
Facilitate other blocks when corresponding optimization chain is copied into other block chain nodes by the introducing of check value
Verification of the chain node to parameter block reduces the wrong problem of the information for being tampered caused optimization chain storage of parameter block.
For example, parameter block can be made to be linked in the block chain of forgery by the head pointer or tail pointer of distorting parameter block, and
By the introducing of check value, the generation of this phenomenon can be avoided or reduced.
In some embodiments, method as shown in Figure 7, further includes:
Step S140: to be deleted according to increasing newly when having the block for meeting the default deletion condition in the optimization chain
Block patch parameters, update the parameter block；Wherein, updated parameter block will be linked in the chain transaction
Meet the latter block of the block of the default deletion condition；
Step S150: newly-increased block to be deleted is deleted.
Since the block in chain transaction was generated according to the time, block to be deleted, which may be also based on, generates time production
Raw, therefore an optimization chain comes temporarily after completing a suboptimization at next optimization moment, it can be in the more of original deletion
Multiple multiple newly-increased blocks to be deleted for meeting aforementioned default deletion condition are produced behind a block, then at this time, it is only necessary to
By updating the parameter block, without generating a completely new parameter block.Fig. 8 be based on optimization chain shown in fig. 6, then
It is secondary delete increase block to be deleted newly after formed again optimize chain structural schematic diagram.In obvious Fig. 8, the tail of parameter block refers to
Needle has been changing into hj+2 from hj+1；To which the block that parameter block tail portion is directed toward is block j+2.
Specifically such as, the step S140 can include:
Determine next block of newly-increased block to be deleted；
The block-identified of next block of newly-increased block to be deleted is extracted, for example, the hashed value of the block, revises institute
The content of tail pointer in parameter block is stated, then realizes the update of parameter block.
In further embodiments, the step S140 may also include that
According to the hashed value of newly-increased block to be deleted itself, check value etc. in undated parameter block,
In short, can realize optimization by the update of partial information in parameter block after once an optimization chain generates
The suboptimization again of chain generates the optimization chain again of effect of optimization more further.
In some cases, the corresponding parameter block of an optimization chain may only include one, in further embodiments
In, parameter block may include it is multiple, but multiple parameters block optimization chain in be non-conterminous distribution, if two parameter regions
Block adjacent distributions then can generate a parameter block, as far as possible based on the merging of the head and the tail pointer in two parameter blocks
Reduced parameter block.
In some embodiments, the method also includes: in order to distinguish optimization chain in parameter block and other be stored with
The block of actual transaction information is additionally provided with the type mark of parameter block in parameter block, then follow-up inquiry or multiple
During system, the different blocks in block chain can be distinguished by the quick comparison of the type mark of block.In some realities
It applies in example, the optimization chain can also facilitate the type classification of subsequent block by the storage respectively of different type block, and
To the different disposal of different types of block.
As shown in figure 9, the present embodiment also provides a kind of block chain light-weight technologg method, it is applied to the second block chain node
In, comprising:
Step S210: the duplicate requests of block chain are sent to the first block chain node；
Step S220: when the first block chain node is optimization chain based on duplicate requests return, it is based on institute
The parameter block in optimization chain is stated, sends acquisition request to third block chain node, wherein the third block chain node has been
At the block chain node for being stored with the corresponding chain transaction of the optimization chain；The acquisition request, for obtaining in the optimization chain
It has deleted and continuously distributed N number of block, the N is positive integer；
Step S230: the patch parameters that the third block chain node returns are received；
Step S240: the parameter block in the optimization chain is verified based on the patch parameters；
Step S250: when the parameter block passes through verifying, the optimization block is stored to form the optimization chain.
In some embodiments in block chain network, there is multiple distributed block chain nodes, between these nodes
The block chain of storage may mutually be replicated.
The generation for optimizing chain in the present embodiment, is all locally generating in a block chain node, if other areas
Block chain node copies the optimization chain of its storage, and in order to ensure optimizing the authenticity and reliability of chain, then other block chain nodes can
The optimization chain of copy can be needed to verify.
Other block chain nodes are referred to as distinguishing the second of the first block chain node for forming optimization chain in the present embodiment
Block chain node.
Second block chain node has sent a duplicate requests to the first block chain node.First block chain node receives
After the duplicate requests, due to deleting Partial Block before, causing the first block chain node to be locally stored in this way is only optimization
Chain, rather than complete chain transaction, therefore optimization chain can be sent to the second block chain node by the first block chain node.
After second block chain node receives optimization chain, pass through type identification and the statistics of block number etc., it is possible to find
The optimization chain being currently received, rather than complete chain transaction.
Second block chain node equally to the storage for carrying out block chain with storage resource as few as possible, that is, is only intended to store excellent
Change chain, then can lack the block information of block into the third block chain node request optimization chain for be stored with complete chain transaction.
In the present embodiment, usual first block chain node and the second block chain node all can be client node, and the
Three block chain nodes can be server node.Server node must store the complete friendship of at least a period of time class under normal conditions
Easy chain.Therefore the acquisition request can be sent to server node in step S220.In a block chain node system extremely
The server node of storage transaction chain including predetermined number less.Here predetermined number can be only one.Certainly this
It is only citing.In some cases, it if the validity based on the Transaction Information in chain transaction, has been lost for certain Transaction Informations
Effect, server node can also delete corresponding block, and the hashed value etc. for only storing corresponding block is verified for subsequent optimization chain
Information only exempted from by send that corresponding block deletes to whole system alternatively, the information being even used in conjunction in verification does not store
Verification indicates that the optimization chain duplication between subsequent block chain link point then carries out exempting to verify to corresponding part.
After sending the acquisition request, third block chain node can return to corresponding block information, be used for the secondth area
Verification of the block chain node to parameter block.In the present embodiment, it to the verification of parameter block, includes at least: in parameter block
The verification of tail pointer also includes: the verification to head pointer certainly.
May insure to be currently believable from the optimization chain that the first block chain node copies by verifying, it is ensured that block chain
The authenticity and confidence level of information.
Further, the step S220 can include:
Block based on the parameter determines the first hashed value and the second hashed value, wherein first hashed value are as follows:
The hashed value of first block, second hashed value in the N number of block deleted continuously respectively are as follows: described to have deleted continuously
The hashed value of tail block in N number of block respectively；
Wherein, the patch parameters, include at least: having deleted in continuously distributed N number of block the 2nd block to N-1
The hashed value of a block.
In some embodiments, mainly using hashed value as parameter block in head pointer and tail pointer, therefore in this implementation
It, can be by the first hashed value in parameter block as head pointer when sending acquisition request to third block chain node in example
It is carried in acquisition request with the second hashed value as tail pointer.
After third block chain node receives the first hashed value and the second hashed value, inquires chain transaction or inquiry is still wrapped
Include the optimization chain of corresponding block, obtain corresponding i-th of the block of the first hashed value and corresponding j-th of the block of the second hashed value it
Between i+1 to the hashed value of -1 block of jth, return to for these hashed values as the request of acquisition request response
Two block chain nodes.
It, can be based on the preset function negotiated in advance or based on common recognition after second block chain node receives these hashed values
The function that mechanism defines, at least one using these hashed values as dependent variable carry out function calculating, obtain functional value.
The check value carried in the functional value and corresponding parameter block is compared, the verification of parameter block is carried out.Specifically such as, described
Step S240 can include:
Based on the hashed value of deleted continuously distributed N number of block, preset function generating function value is utilized；
The functional value of generation is matched with the check value；
If matching is consistent, it is determined that the parameter block passes through verifying.
By the calculating of functional value and with the matching of check value, it can be ensured that the authenticity of information and reliable in parameter block
Property, so that it is guaranteed that the reliability and authenticity of currently received optimization chain.
What such second block chain node stored from the beginning is exactly to optimize chain, be greatly reduced consumed by block chain
The various resources such as storage resource, the book keeping operation processing for the block chain node for facilitating some storage resources few.
A kind of block chain light-weight technologg method applied to third block chain node is also provided in the embodiment of the present invention, is wrapped
It includes:
Receive the acquisition request of the second block chain transmission；
Chain transaction, or the optimization of the patch parameters including the corresponding block of acquisition request are inquired based on the acquisition request
Chain；
The patch parameters of inquiry are sent to the second block chain node, wherein the patch parameters are used for secondth area
Block chain node verification optimizes the parameter block in chain.
Here the associated description and difference of optimization chain and chain transaction, can be shown in previous embodiment, just not repeat again
?.
The patch parameters may include: to optimize the hashed value for the block being deleted in chain or other are block-identified.
First that the block of the 1st deletion of the N number of block deleted in optimization chain can be carried in the acquisition request dissipates
Second hashed value of the last one block in train value, and N number of block of deletion.
As shown in Figure 10, the present embodiment provides a kind of block chain node, the block chain node is the first block chain node,
Include:
Generation unit 110, for generating parameter block based on N number of block to be deleted continuously distributed in chain transaction,
In, the N is positive integer；
Unit 120 is deleted, for deleting N number of block in the chain transaction；
First storage unit 130, for storing the parameter block, wherein in the parameter block and the chain transaction
Optimization chain is collectively formed in not deleted block, wherein father's block of the parameter block are as follows: that deletes in the chain transaction is N number of
The previous block of block, the subregion of the parameter block are as follows: the latter area for the N number of block deleted in the chain transaction
Domain.
A kind of structural schematic diagram of block chain node provided in this embodiment.
The processing of physical node where the generation unit 110 and deletion unit 120 can correspond to block chain node
The connection structure of device and memory.The memory can be used for carrying out the storage of various information；The processor is based on integrated
The bus interface such as circuit bus are connect with the memory, by the execution of the executable codes such as computer program, can be optimized
Chain transaction generates the less optimization chain of data volume.
The processor can be central processing unit (CPU), microprocessor (MCU), digital signal processor (DSP), application
Processor (AP), programmable array (PLC) or specific integrated circuit (ASIC) etc. can carry out the structure of information processing.
First storage unit 130 can correspond to storage medium, can be used for the storage of the parameter block.
First block chain node described in the present embodiment will be deleted the block that part can delete in block chain, in order to ensure
The chain structure of block chain can generate corresponding parameter block, form the block chain of optimization.Usually optimization after optimization chain include
Block counts be less than the complete chain transaction block tree that includes, the data volume of parameter block, which is generally less than in a trading volume, includes
The data volume of the block of Transaction Information, therefore the data volume for optimizing chain on the whole is the data-link of far smaller than chain transaction.In this way,
If only storage optimization chain, relative to store transaction chain, it is clear that greatly save storage resource, save the calculating of subsequent query
Resource.For example, the information for the block storage usually deleted all is the very low information of the invalid or accessed frequency, if receiving
One inquiry request, if may need to compare M block if chain transaction includes M block based on hashed value inquiry chain transaction
Hashed value, and optimizing chain only includes M-N block, then matching times most in query process are M-N times, it is clear that are saved
Match query number.
Optionally, the first block chain node further include:
Whether judging unit, N number of block for judging continuously distributed in chain transaction meet the preset deletion condition；
The generation unit 110 meets the default deletion condition if being particularly used in, and is generated based on N number of block
Parameter block.
Here judging unit equally can correspond to processor or processing circuit.
Optionally, first storage unit 130, is particularly used in the head pointer for including using the parameter block, refers to
Previous block in the N number of block deleted into the chain transaction；The tail pointer for including using the parameter block, described in direction
The latter block in the N number of block deleted in chain transaction.
Further, the head pointer includes: the hash of previous block in the N number of block deleted in the chain transaction
Value；The tail pointer includes: the hashed value of the latter block in the N number of region deleted in the chain transaction.
In some embodiments, the generation unit 110 is particularly used in the hashed value using N number of block to be deleted,
Calculate check value, wherein the parameter block further includes the check value, the check value, for sending the optimization chain
Verifying when to the second block chain node, for the second block chain node to the optimization chain.
There are also in some implementations, first block connects node further include:
Updating unit, for when have in the optimization chain increase block to be deleted newly when, according to increasing block to be deleted newly
Patch parameters, update the parameter block；Wherein, updated parameter block will be linked in the chain transaction and meet institute
State the latter block of the block of default deletion condition；
The deletion unit is also used to delete newly-increased block to be deleted.
Here deletion unit, equally can correspond to processor or processing circuit.
As shown in figure 11, the present embodiment also provides a kind of block chain node, and the block chain node is the second block chain link
Point, comprising:
Transmission unit 210, for sending the duplicate requests of block chain to the first block chain node；When the first block chain
Node is when optimizing chain, based on the parameter block in the optimization chain, to third block chain based on duplicate requests return
Node sends acquisition request, wherein the third block chain node is to complete to be stored with the corresponding chain transaction of the optimization chain
Block chain node；The acquisition request has been deleted and continuously distributed N number of block, the N are for obtaining in the optimization chain
Positive integer；
Receiving unit 220, the patch parameters returned for receiving the third block chain node；
Authentication unit 230, for being verified based on the patch parameters to the parameter block in the optimization chain；
Second storage unit 240, for when the parameter block passes through verifying, storing the optimization block to be formed
State optimization chain.
A kind of second block chain node is provided in the present embodiment.The block chain node includes: transmission unit 210 and receives single
Member 220, the network interface etc. of physical node where can correspond to block chain node.The network interface can be cable interface, light
Cable interface and/or dual-mode antenna etc..The physical node can be various communication equipments, for example, network server, mobile phone or desk-top
Personal communication devices such as computer etc..
The authentication unit 230 can correspond to processor；The associated description of the processor may refer to previous embodiment,
It is not just repeated herein.
Second storage unit 240 can correspond to the local storage medium of the second block chain node, and the storage medium is excellent
It is selected as non-moment storage medium, can be used for non-moment storage optimization chain, by the optimization of chain transaction, reduces the resource of storage
Consumption, the consumption of the computing resource of other subsequent operations.
Optionally, the second block chain node, it may include equally can correspond to the determination unit of processor；The determination
Unit can be used for block based on the parameter, determine the first hashed value and the second hashed value, wherein first hashed value
Are as follows: the hashed value of first block, second hashed value are as follows: described to have deleted in the N number of block deleted continuously respectively
The hashed value of tail block in the N number of block continuously distinguished；Wherein, the patch parameters, include at least: having deleted continuously distributed
N number of block in the 2nd block to the N-1 block hashed value；In the parameter block further include: check value.
The transmission unit 210, can be used for the third block chain node send carry first hashed value and
The acquisition request of second hashed value；
The authentication unit 230 is particularly used in the hashed value based on deleted continuously distributed N number of block, utilizes
Preset function generating function value；The functional value of generation is matched with the check value；And if matching is consistent, it is determined that
The parameter block passes through verifying.
The second block chain node directly can copy from other block chain nodes or duplication optimizes chain in the present embodiment, with
It reduces block chain and stores consumed storage resource, or, computing resource consumed by subsequent operation etc..
As shown in figure 12, the present embodiment also provides a kind of block chain node, comprising: transceiver 310, memory 320, processing
Device 330 and the computer program for being stored on the memory 320 and being handled by the processor 330；
The processor 330 is connect with the transceiver 310 and the memory 320 respectively, for by described in execution
Computer program controls the information exchange of the transceiver 310, the storage of the information of the memory 320, and aforementioned one or more
The block chain light-weight technologg method that a technical solution provides.
For example, Fig. 3, Fig. 4, Fig. 7 and/or Fig. 9 can may be implemented by the execution of computer program in the processor 330
Shown in block chain light-weight technologg method.
Block chain node provided in this embodiment can be the first block chain node, the second block chain node and third block chain
The various block chain nodes such as node.
The processor 330 can be connect by integrated circuit (IIC) bus with the transceiver 310 and memory 320.
The transceiver 310 may include the various communication interfaces that physical node is connected to network, for example, cable interface, light
Cable interface and dual-mode antenna etc..
The embodiment of the present invention also provides a kind of computer storage medium, and the computer storage medium is stored with computer journey
Sequence after the computer program is performed, can be realized at the block chain lightweight that aforementioned one or more technical solutions provide
Reason method, such as, it can be achieved that Fig. 3, Fig. 4, Fig. 7 and/or block chain light-weight technologg method shown in Fig. 9.
Computer storage medium provided in an embodiment of the present invention include: movable storage device, read-only memory (ROM,
Read-Only Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. it is various
It can store the medium of program code.It is chosen as, the computer storage medium can be non-moment storage medium.
A specific example is provided below in conjunction with above-described embodiment:
Example 1:
This method be suitable for have a large amount of blocks that can delete scene, need local node record several groups parameter, every group
Corresponding one group of parameter can continuously delete block.Every group of parameter is made of following content:
Head pointer: one group of record can continuously delete father's block head hashed value of first block in block.
Tail pointer: one group of record can continuously delete the sub-district build hashed value of the last one block in block.
Check value: the hashed value that can continuously delete all block heads in block to one group carries out operation, by operation result
It is saved as check value.Calculation method is shown in following example.
For the block chain shown in Fig. 5, the hashed value of the block head of block k is denoted as hk, if necessary to delete block i to area
Block j, then node needs to calculate following parameter:
Head pointer: hi-1
Tail pointer: hj+1
Check value: H (H (... H (H (hi) | | hi+1) | | ... | | hj-1) | | hj), wherein H is one-way function.
After calculating above-mentioned parameter, node can delete block i, block j and all blocks between the two, utilize
Above-mentioned parameter connects block i-1 and block j+1, as shown in Figure 6.
It is advanced optimized on the basis of optimization chain shown in Fig. 6, if the block (block j+1) that tail pointer is identified can also
To delete, then can advanced optimize on the basis of the above, the block chain after optimizing is as shown in Figure 7.Wherein, head pointer is not
Become, the tail pointer of parameter block is directed toward block j+2, in addition, recalculating check value, it is only necessary to count on the basis of Fig. 6 check value h
Calculation H (h | | hj+10), to obtain optimization chain shown in Fig. 8.
Due to containing check value in parameter block, node can be by inquiring complete block head certificate parameter area
Block, so as to ensure the correctness of parameter block.
Scalability: this motion has scalability, illustrating in Fig. 5 and Fig. 6, if the block that tail pointer is identified is such as
Fruit can also delete, then only needing to calculate new parameter block using block information shown in existing parameter block and tail pointer
, without using other block datas.
Storage efficiency: one group of parameter can identify several continuous blocks, and multiple groups parameter can identify the continuous block of multiple groups,
So as to realize freely deleting for block.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through it
Its mode is realized.Apparatus embodiments described above are merely indicative, for example, the division of the unit, only
A kind of logical function partition, there may be another division manner in actual implementation, such as: multiple units or components can combine, or
It is desirably integrated into another system, or some features can be ignored or not executed.In addition, shown or discussed each composition portion
Mutual coupling or direct-coupling or communication connection is divided to can be through some interfaces, the INDIRECT COUPLING of equipment or unit
Or communication connection, it can be electrical, mechanical or other forms.
Above-mentioned unit as illustrated by the separation member, which can be or may not be, to be physically separated, aobvious as unit
The component shown can be or may not be physical unit, it can and it is in one place, it may be distributed over multiple network lists
In member；Some or all of units can be selected to achieve the purpose of the solution of this embodiment according to the actual needs.
In addition, each functional unit in various embodiments of the present invention can be fully integrated into a processing module, it can also
To be each unit individually as a unit, can also be integrated in one unit with two or more units；It is above-mentioned
Integrated unit both can take the form of hardware realization, can also realize in the form of hardware adds SFU software functional unit.
Those of ordinary skill in the art will appreciate that: realize that all or part of the steps of above method embodiment can pass through
The relevant hardware of program instruction is completed, and program above-mentioned can be stored in a computer readable storage medium, the program
When being executed, step including the steps of the foregoing method embodiments is executed.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain
Lid is within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.
Claims (12)
1. a kind of block chain light-weight technologg method, which is characterized in that be applied in the first block chain node, comprising:
Based on N number of block to be deleted continuously distributed in chain transaction, parameter block is generated, wherein the N is positive integer；
Delete N number of block in the chain transaction；
Store the parameter block, wherein optimization is collectively formed in not deleted block in the parameter block and the chain transaction
Chain, wherein father's block of the parameter block are as follows: the previous block for the N number of block deleted in the chain transaction, the parameter
The subregion of block are as follows: the latter region for the N number of block deleted in the chain transaction.
2. the method according to claim 1, wherein the method also includes:
Judge whether N number of block continuously distributed in chain transaction meets the preset deletion condition；
It is described based on N number of block to be deleted continuously distributed in chain transaction, generate parameter block, comprising:
If meeting the default deletion condition, parameter block is generated based on N number of block.
3. according to the method described in claim 1, its spy be,
It is included at least in the parameter block: head pointer and tail pointer；
The head pointer is directed toward previous block in the N number of block deleted in the chain transaction；
The tail pointer is directed toward the latter block in the N number of block deleted in the chain transaction.
4. according to the method described in claim 3, it is characterized in that,
The head pointer includes: the hashed value of previous block in the N number of block deleted in the chain transaction；
The tail pointer includes: the hashed value of the latter block in the N number of region deleted in the chain transaction.
5. method according to any one of claims 1 to 4, spy are,
It is described based on N number of block to be deleted continuously distributed in chain transaction, generate parameter block, comprising:
Using the hashed value of N number of block to be deleted, check value is calculated, wherein the parameter block further includes the check value,
The check value, when for the optimization chain to be sent to the second block chain node, for the second block chain node to institute
State the verifying of optimization chain.
6. method according to any one of claims 1 to 4, which is characterized in that the method also includes:
When have in the optimization chain increase block to be deleted newly when, according to the patch parameters for increasing block to be deleted newly, update institute
State parameter block；Wherein, updated parameter block will be linked to the area for meeting the default deletion condition in the chain transaction
The latter block of block；
Delete newly-increased block to be deleted.
7. a kind of block chain light-weight technologg method, which is characterized in that be applied in the second block chain node, comprising:
The duplicate requests of block chain are sent to the first block chain node；
When the first block chain node is optimization chain based on duplicate requests return, based on the ginseng in the optimization chain
Number block sends acquisition request to third block chain node, wherein the third block chain node is described excellent to complete to be stored with
Change the block chain node of the corresponding chain transaction of chain；The acquisition request has been deleted in the optimization chain for obtaining and has continuously been divided
N number of block of cloth, the N are positive integer；
Receive the patch parameters that the third block chain node returns；
The parameter block in the optimization chain is verified based on the patch parameters；
When the parameter block passes through verifying, the optimization block is stored to form the optimization chain.
8. the method according to the description of claim 7 is characterized in that
It is described when the first block chain node is optimization chain based on duplicate requests return, based in the optimization chain
Parameter block, the acquisition for obtaining the patch parameters of N number of block deleted in the optimization chain is sent to third block chain node
Request, comprising:
Block based on the parameter determines the first hashed value and the second hashed value, wherein first hashed value are as follows: described
The hashed value of first block in N number of block continuously respectively, second hashed value are as follows: described to have deleted continuous difference are deleted
N number of block in tail block hashed value；Wherein, the patch parameters, include at least: having deleted continuously distributed N number of area
In block the 2nd block to the N-1 block hashed value；In the parameter block further include: check value；
The acquisition request for carrying first hashed value and second hashed value is sent to the third block chain node；
It is described that the parameter block in the optimization chain is verified based on the patch parameters, comprising:
Based on the hashed value of deleted continuously distributed N number of block, preset function generating function value is utilized；
The functional value of generation is matched with the check value；
If matching is consistent, it is determined that the parameter block passes through verifying.
9. a kind of block chain node, which is characterized in that the block chain node is the first block chain node, comprising:
Generation unit, for generating parameter block, wherein described based on N number of block to be deleted continuously distributed in chain transaction
N is positive integer；
Unit is deleted, for deleting N number of block in the chain transaction；
First storage unit, for storing the parameter block, wherein the parameter block with it is not deleted in the chain transaction
Optimization chain is collectively formed in block, wherein father's block of the parameter block are as follows: before the N number of block deleted in the chain transaction
One block, the subregion of the parameter block are as follows: the latter region for the N number of block deleted in the chain transaction.
10. a kind of block chain node, which is characterized in that the block chain node is the second block chain node, comprising:
Transmission unit, for sending the duplicate requests of block chain to the first block chain node；When the first block chain node base
When duplicate requests return is optimization chain, based on the parameter block in the optimization chain, sent out to third block chain node
Send acquisition request, wherein the third block chain node is the block chain for completing to be stored with the corresponding chain transaction of the optimization chain
Node；The acquisition request has been deleted and continuously distributed N number of block, the N are positive whole for obtaining in the optimization chain
Number；
Receiving unit, the patch parameters returned for receiving the third block chain node；
Authentication unit, for being verified based on the patch parameters to the parameter block in the optimization chain；
Second storage unit, for when the parameter block passes through verifying, storing the optimization block to form the optimization
Chain.
11. a kind of block chain node characterized by comprising transceiver, memory, processor and be stored in the memory
Computer program that is upper and being handled by the processor；
The processor is connect with the transceiver and the memory respectively, for by executing the computer program control
Information exchange, the storage of the information of the memory of the transceiver are made, and perform claim requires any one of 1 to 8 area provided
Block chain light-weight technologg method.
12. a kind of computer storage medium, which is characterized in that the computer storage medium is stored with computer program, described
After computer program is performed, the block chain light-weight technologg method that any one of claim 1 to 8 provides can be realized.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710657510.XA CN109391645B (en) | 2017-08-03 | 2017-08-03 | Block chain lightweight processing method, block chain node and storage medium |
| PCT/CN2018/097415 WO2019024780A1 (en) | 2017-08-03 | 2018-07-27 | Light-weight processing method for blockchain, and blockchain node and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710657510.XA CN109391645B (en) | 2017-08-03 | 2017-08-03 | Block chain lightweight processing method, block chain node and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109391645A true CN109391645A (en) | 2019-02-26 |
| CN109391645B CN109391645B (en) | 2020-09-11 |
Family
ID=65233411
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710657510.XA Active CN109391645B (en) | 2017-08-03 | 2017-08-03 | Block chain lightweight processing method, block chain node and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109391645B (en) |
| WO (1) | WO2019024780A1 (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110222052A (en) * | 2019-05-20 | 2019-09-10 | 重庆金融资产交易所有限责任公司 | Block chain data processing method, device, computer equipment and storage medium |
| CN110362568A (en) * | 2019-06-03 | 2019-10-22 | 阿里巴巴集团控股有限公司 | A kind of compression method, device and equipment for block chain type account book |
| CN110490741A (en) * | 2019-08-13 | 2019-11-22 | 山大地纬软件股份有限公司 | Data validity and the apparatus and method of controllability management in a kind of block chain |
| CN110636042A (en) * | 2019-08-14 | 2019-12-31 | 阿里巴巴集团控股有限公司 | Method, device and equipment for updating verified block height of server |
| US10764062B2 (en) | 2019-06-03 | 2020-09-01 | Alibaba Group Holding Limited | Blockchain ledger compression |
| CN111913978A (en) * | 2020-09-02 | 2020-11-10 | 上海优扬新媒信息技术有限公司 | Block deleting method, device and system |
| CN111917572A (en) * | 2020-07-12 | 2020-11-10 | 中信银行股份有限公司 | Transaction request processing method and device, electronic equipment and readable storage medium |
| CN112153085A (en) * | 2019-06-26 | 2020-12-29 | 华为技术有限公司 | Data processing method, node and block chain system |
| CN112558557A (en) * | 2019-09-25 | 2021-03-26 | 施耐德电器工业公司 | Industrial process control |
| CN114331443A (en) * | 2022-03-10 | 2022-04-12 | 南京金宁汇科技有限公司 | Method and device for deleting block chain data |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110570196A (en) * | 2019-09-05 | 2019-12-13 | 腾讯科技（深圳）有限公司 | Transaction data processing method and device, terminal equipment and storage medium |
| US11941611B2 (en) * | 2019-12-11 | 2024-03-26 | Intuit Inc. | Shareable and nested transactions on hash chains |
| CN111611319A (en) * | 2020-06-08 | 2020-09-01 | 杭州复杂美科技有限公司 | Distributed data storage method, device and storage medium |
| CN111897826A (en) * | 2020-06-27 | 2020-11-06 | 中国建设银行股份有限公司 | Parameter information updating method and device, electronic equipment and readable storage medium |
| CN113592639B (en) * | 2021-05-21 | 2023-10-13 | 上海简苏网络科技有限公司 | Block chain transaction deleting method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015116998A3 (en) * | 2014-01-30 | 2015-11-05 | Gary Kremen | Electronic transfer and obligation enforcement system |
| US20160292048A1 (en) * | 2015-03-30 | 2016-10-06 | Western Digital Technologies, Inc. | Data deduplication using chunk files |
| CN106251216A (en) * | 2016-07-18 | 2016-12-21 | 恒宝股份有限公司 | A kind of method and system for alleviating node storage pressure |
| CN106503589A (en) * | 2016-10-26 | 2017-03-15 | 北京瑞卓喜投科技发展有限公司 | The method of calibration of block chain Transaction Information correctness, apparatus and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107615317A (en) * | 2015-03-31 | 2018-01-19 | 纳斯达克公司 | The system and method for block chain transaction record |
| CN106897352B (en) * | 2016-12-29 | 2020-09-15 | 北京瑞卓喜投科技发展有限公司 | Method and system for generating block chain modified in expansion |
-
2017
- 2017-08-03 CN CN201710657510.XA patent/CN109391645B/en active Active
-
2018
- 2018-07-27 WO PCT/CN2018/097415 patent/WO2019024780A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015116998A3 (en) * | 2014-01-30 | 2015-11-05 | Gary Kremen | Electronic transfer and obligation enforcement system |
| US20160292048A1 (en) * | 2015-03-30 | 2016-10-06 | Western Digital Technologies, Inc. | Data deduplication using chunk files |
| CN106251216A (en) * | 2016-07-18 | 2016-12-21 | 恒宝股份有限公司 | A kind of method and system for alleviating node storage pressure |
| CN106503589A (en) * | 2016-10-26 | 2017-03-15 | 北京瑞卓喜投科技发展有限公司 | The method of calibration of block chain Transaction Information correctness, apparatus and system |
Non-Patent Citations (1)
| Title |
|---|
| J.D.BRUCE: ""The Mini-Blockchain Scheme"", 《CRYPTONITE.INFO》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110222052A (en) * | 2019-05-20 | 2019-09-10 | 重庆金融资产交易所有限责任公司 | Block chain data processing method, device, computer equipment and storage medium |
| US10958440B2 (en) | 2019-06-03 | 2021-03-23 | Advanced New Technologies Co., Ltd. | Blockchain ledger compression |
| CN110362568A (en) * | 2019-06-03 | 2019-10-22 | 阿里巴巴集团控股有限公司 | A kind of compression method, device and equipment for block chain type account book |
| US10764062B2 (en) | 2019-06-03 | 2020-09-01 | Alibaba Group Holding Limited | Blockchain ledger compression |
| CN112153085B (en) * | 2019-06-26 | 2022-05-17 | 华为技术有限公司 | Data processing method, node and block chain system |
| CN112153085A (en) * | 2019-06-26 | 2020-12-29 | 华为技术有限公司 | Data processing method, node and block chain system |
| CN110490741A (en) * | 2019-08-13 | 2019-11-22 | 山大地纬软件股份有限公司 | Data validity and the apparatus and method of controllability management in a kind of block chain |
| CN110636042A (en) * | 2019-08-14 | 2019-12-31 | 阿里巴巴集团控股有限公司 | Method, device and equipment for updating verified block height of server |
| CN112558557A (en) * | 2019-09-25 | 2021-03-26 | 施耐德电器工业公司 | Industrial process control |
| CN111917572A (en) * | 2020-07-12 | 2020-11-10 | 中信银行股份有限公司 | Transaction request processing method and device, electronic equipment and readable storage medium |
| CN111917572B (en) * | 2020-07-12 | 2022-10-25 | 中信银行股份有限公司 | Transaction request processing method and device, electronic equipment and readable storage medium |
| CN111913978A (en) * | 2020-09-02 | 2020-11-10 | 上海优扬新媒信息技术有限公司 | Block deleting method, device and system |
| CN111913978B (en) * | 2020-09-02 | 2023-07-25 | 度小满科技(北京)有限公司 | Block deleting method, device and system |
| CN114331443A (en) * | 2022-03-10 | 2022-04-12 | 南京金宁汇科技有限公司 | Method and device for deleting block chain data |
| CN114331443B (en) * | 2022-03-10 | 2022-06-21 | 南京金宁汇科技有限公司 | Method and device for deleting block chain data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109391645B (en) | 2020-09-11 |
| WO2019024780A1 (en) | 2019-02-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109391645A (en) | Block chain light-weight technologg method, block chain node and storage medium | |
| US20220141018A1 (en) | Method and system for an efficient consensus mechanism for permissioned blockchains using audit guarantees | |
| US20220019503A1 (en) | Method and system for desynchronization recovery for permissioned blockchains using bloom filters | |
| CN110033243B (en) | Main chain evidence storing method, system and storage medium based on block chain intelligent contract | |
| US11177962B2 (en) | Optimizations for verification of interactions system and method | |
| WO2021032138A1 (en) | Consensus method and device based on blockchain system, and system | |
| CN106651332B (en) | Method for generating new block in block chain and block chain | |
| CN110572450B (en) | Data synchronization method and device, computer readable storage medium and computer equipment | |
| CN110399373A (en) | A kind of block chain account book storage system, storage querying method and delet method | |
| CN109508982A (en) | REPB common recognition based on the more subchains of block chain main chain adduction row | |
| US11468044B2 (en) | Optimizations for verification of interactions system and method using probability density functions | |
| CN110147684A (en) | For realizing the method and apparatus of block chain data-privacy protection | |
| CN112069550B (en) | Electronic contract evidence-storing system based on intelligent contract mode | |
| CN109194646A (en) | A kind of safety certification data access method based on block chain | |
| CN111935207A (en) | Block chain system consensus method based on improved C4.5 algorithm | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| CN109166040A (en) | Transaction auditing method, device, equipment and storage medium based on block chain | |
| CN105491078A (en) | Data processing method and device in SOA system, and SOA system | |
| CN111865595B (en) | Block chain consensus method and device | |
| CN113645278B (en) | Cross-chain message transmission method, device and storage medium of block chain | |
| CN109391643B (en) | Block chain lightweight processing method, block chain node and storage medium | |
| CN106302625B (en) | Data-updating method, device and related system | |
| CN110070361A (en) | Contract based on block chain deposits card method, equipment and storage medium | |
| CN114584326A (en) | Block chain data processing method and device, electronic equipment and storage medium | |
| KR20210127231A (en) | Energized Identity based blockchain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |