CN108681900A - The method of light node verification transaction - Google Patents
The method of light node verification transaction Download PDFInfo
- Publication number
- CN108681900A CN108681900A CN201810789962.8A CN201810789962A CN108681900A CN 108681900 A CN108681900 A CN 108681900A CN 201810789962 A CN201810789962 A CN 201810789962A CN 108681900 A CN108681900 A CN 108681900A
- Authority
- CN
- China
- Prior art keywords
- transaction
- block
- hash
- state
- height
- 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.)
- Pending
Links
Classifications
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
Abstract
One aspect of the present invention provides a kind of method that light node obtains the data that verification is merchandised, including：Obtain the data in the designated blocks of full node, wherein the data in acquired designated blocks include the specified transaction Hash in the height and designated blocks of designated blocks；Specified transaction Hash in designated blocks is handled, to obtain corresponding data acquisition system；When the height of the transaction Hash of subject to confirmation and designated blocks is less than in specified altitude assignment threshold value and designated blocks that there are the proof paths for when transaction Hash to be confirmed, generating transaction Hash to be confirmed in light node.Another aspect of the present invention provides a kind of method of light node verification transaction, including：Obtain the first transaction Hash and specified altitude assignment threshold value；The state of the first transaction corresponding with the first transaction Hash is determined with the comparison result of the transaction Hash in light node according to the first transaction Hash.Storage redundant data is greatly decreased in the present invention, and full node is helped to mitigate the pressure of verification transaction.
Description
Technical field
The present invention relates to block chain technologies, more particularly to the method that light node verification is merchandised.
Background technology
Block chain is to know together algorithm using distributed node to generate and update the data, ensure number in the way of cryptography
According to transmission and the safety accessed, the distributed account book that can not be distorted and can not forge is generated, the data network trusted each other is established.
The account book data of block chain have identical backup in each node, it is not possible to deleting history data, as time goes by data
Amount can continue to increase.Such as faster PBFT algorithms of knowing together, even if do not merchandise but in order to keep with the communication of each node and
Data are consistent, and a block can be all stored every the fixed cycle.
Ability store transaction information of reaching common understanding, the people for initiating transaction is needed not to know immediately between node in block chain
Whether road Transaction Information has successfully been packaged into block, so needing to be inquired by certain mode after having executed transaction.
Since block chain itself is chain structure, traversal can expend for a long time.
Since the cost of deployment block chain ancestor node is larger, so in order to be provided in reliable inquiry transaction to enterprise
The service of chain situation, and server resource is preferably utilized, produce light node.Relative to light node, the mesomere of block chain
Point is referred to as full node.
For existing public chain due to being that miner is packaged transaction, miner's folk prescription is assured that the number of transaction and transaction in the block
Amount and sequence, it is possible to very easily generate SPV (simple payment verification), that is, the Merkel for generating transaction proves path, then
Return to the user for sending transaction.For alliance's chain, in order to accelerate the response speed of full node, transaction is not waited for mostly and is beaten
Being generated after packet proves to return again to user.
Therefore, it is necessary to a kind of to be rapidly completed the method that the light node verification of Transaction Inquiries is merchandised in alliance's chain.
Invention content
In view of the above-mentioned problems, one aspect of the present invention provides a kind of method that light node obtains the data that verification is merchandised, it is special
Sign is, including：Obtain the data in the designated blocks of full node, wherein the data packet in the acquired designated blocks
Include the specified transaction Hash in the height and the designated blocks of the designated blocks；To specified in the designated blocks
Transaction Hash is handled, to obtain corresponding data acquisition system；Transaction Hash when subject to confirmation in light node and the finger
The height for determining block is less than in specified altitude assignment threshold value and the designated blocks there are when the transaction Hash to be confirmed, generates
The proof path of the transaction Hash to be confirmed.
In one embodiment, the data in the acquired designated blocks further include root Hash.
In one embodiment, the method further includes：When the transaction Hash of subject to confirmation in light node and described
The height of designated blocks is less than in specified altitude assignment threshold value and the designated blocks there are when the transaction Hash to be confirmed, will
The status indication of transaction corresponding with the transaction Hash to be confirmed is first state.
In one embodiment, the method further includes：When the transaction Hash of subject to confirmation in light node and described
When the height of designated blocks is more than or equal to specified altitude assignment threshold value, by the shape of transaction corresponding with the transaction Hash to be confirmed
State is labeled as the second state.
In one embodiment, the specified transaction Hash in the designated blocks is handled by filter,
To obtain corresponding data acquisition system.
In one embodiment, the transaction Hash to be confirmed is generated by light node when receiving transaction request.
Another aspect of the present invention additionally provides a kind of method of light node verification transaction, the method includes：
Obtain the first transaction Hash and specified altitude assignment threshold value；It is breathed out with the transaction in light node according to the first transaction Hash
Uncommon comparison result come determine with it is described first transaction Hash it is corresponding first transaction state.
In one embodiment, the method further includes：It is identical as the first transaction Hash when existing in light node
The second transaction Hash when, if the state of the second transaction corresponding with the second transaction Hash is labeled, further
Determine whether second stateful transaction is first state；If the shape of the second transaction corresponding with the second transaction Hash
State is not labeled, then the state of first transaction is confirmed as the third state.
In one embodiment, the method further includes：If further determining that the state of second transaction is institute
First state is stated, then will be combined with the proof path of the second transaction Hash and the second transaction Hash to generate root Kazakhstan
It is uncommon；If further determining that the state of second transaction is not the first state, the state of first transaction is true
It is set to the second state.
In one embodiment, the method further includes：When identical of the root Hash for existing corresponding to and being generated
When the block of Hash, the state of first transaction is confirmed as the first state；When there is no corresponding to generated
When the block of identical Hash of root Hash, the state of first transaction is confirmed as the 4th state.
In one embodiment, the method further includes：When in light node be not present and it is described first transaction Hash phase
The height of same the second transaction Hash and the first block of the current data therefrom of light node has reached the specified height
When spending threshold value, history block is accessed one by one with determination first transaction Kazakhstan by sequence of highly successively decreasing since first block
It is uncommon to whether there is in the history block accessed, wherein first block is in full node, and acquired data packet
Include height, firstth area specified the transaction Hash and root Hash in the block of first block.
In one embodiment, the method further includes：When the first transaction Hash is present in going through for current accessed
It is raw when in the filter of history block and in the partial data of the first transaction Hash history block for being present in current accessed
It is confirmed as first state at the proof path of the first transaction Hash and the state of first transaction；Or when described
In the filter for the history block that first transaction Hash is present in current accessed and the first transaction Hash is not present in working as
In the partial data of the history block of preceding access and when the history block of current accessed is height minimum block, described first
The state of transaction is confirmed as the second state；Or when the first transaction Hash is not present in the history block of current accessed
In filter and when the history block of current accessed is height minimum block, the state of first transaction is confirmed as the
Two-state.
In one embodiment, the method further includes：When in light node be not present and it is described first transaction Hash phase
The height of same the second transaction Hash and the first block of the current data therefrom of light node is not up to the specified altitude assignment
When threshold value, history block is accessed one by one with determination the first transaction Hash by sequence of highly successively decreasing since first block
With the presence or absence of in the history block accessed, wherein for first block on full node, acquired data include described
The height of first block, firstth area specified transaction Hash and root Hash in the block.
In one embodiment, the method further includes：When the first transaction Hash is present in going through for current accessed
It is raw when in the filter of history block and in the partial data of the first transaction Hash history block for being present in current accessed
At it is described first merchandise Hash proof path and the state that described first merchandises is determined as first state.
In one embodiment, the method further includes：If the first transaction Hash is present in current accessed
In the filter of history block and the first transaction Hash is not present in the partial data of history block of current accessed,
Or if the first transaction Hash is not present in the filter of history block of current accessed, it is determined that light node is from height
It whether spends when the height of first block obtains data to the second block between the specified altitude assignment threshold value to described the
One transaction is marked.
In one embodiment, the method further includes：If light node from height first block height
First transaction is marked when obtaining data to the second block between specified altitude assignment threshold value and described first merchandises
State be marked as first state, then it is described first transaction state be confirmed as first state.
In one embodiment, the method further includes：If light node from height first block height
Second transaction is marked when obtaining data to the second block between specified altitude assignment threshold value but described second merchandises not
Be marked as first state, or if light node from height first block height between specified altitude assignment threshold value
Second transaction is not marked when second block obtains data, then whether the history block based on current accessed is height
Minimum history block determines the state of first transaction.
In one embodiment, the method further includes：It is gone through if the history block of current accessed is that height is minimum
When history block and the height of second block is more than or equal to the specified altitude assignment threshold value, then the state of first transaction is true
Determine the third state；If when the history block of current accessed is height minimum history block but the height of second block is small
In the specified altitude assignment threshold value, then the state of first transaction is confirmed as the second state.
Another aspect of the present invention additionally provides a kind of device, including：Memory, for storing instruction；And processor,
It is coupled to the memory, and described instruction makes described device execute described in any of the above-described when being executed by the processor
Method.
Another aspect of the invention additionally provides a kind of computer readable storage medium, and the storage medium includes instruction, institute
It states instruction to be performed so that the processor of the computer executes method described in any one of the above embodiments.
The present invention solves the problems, such as alliance's chain transaction asynchronous verification of cochain, under the premise of ensureing that verification result is believable substantially
Storage redundant data is reduced, full node is helped to mitigate the pressure of verification transaction.
Description of the drawings
Fig. 1 is the flow chart 100 of the transaction request of light node monitoring users；
Fig. 2 light nodes according to an embodiment of the invention obtain the flow chart of the method for the data of verification transaction from full node
200；
The flow chart 300 of the method for Fig. 3 light node verification transaction according to an embodiment of the invention；
Fig. 4 is the schematic diagram of a branch 300a of Fig. 3；
Fig. 5 is the schematic diagram of another branch 300b of Fig. 3；
Fig. 6 is the schematic diagram of devices in accordance with embodiments of the present invention 600.
Specific implementation mode
Below with reference to each exemplary embodiment of attached drawing detailed description of the present invention.Flow chart and block diagram in attached drawing are shown
The architecture, function and operation in the cards of method and system according to various embodiments of the present invention.It should be noted that
Each box in flowchart or block diagram can represent a part for a module, program segment, or code, the module, program
Section or a part for code may include one or more being held for realizing the logic function of defined in each embodiment
Row instruction.It should also be noted that in some alternative implementations, the function of being marked in box can also be according to different from attached
The sequence marked in figure occurs.For example, two boxes succeedingly indicated can essentially be basically executed in parallel or it
Can also execute in a reverse order sometimes, this depend on involved function.It should also be noted that flow chart
And/or the combination of each box in block diagram and the box in flowchart and or block diagram, work(as defined in executing can be used
Can or the dedicated hardware based system of operation realize, or can make using a combination of dedicated hardware and computer instructions to combine and
It realizes.
Term as used herein "include", "comprise" and similar terms are understood to open term, i.e.,
" including/including but not limited to ", expression can also include other content.Term "based" is " being based at least partially on ".Term
" one embodiment " expression " at least one embodiment "；Term " another embodiment " expression " at least one other embodiment ",
Etc..
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as part of specification.For between each unit in attached drawing
Line, it is only for convenient for explanation, indicate that the unit at least line both ends is in communication with each other, it is not intended that limitation does not connect
It can not be communicated between the unit of line.
Below in conjunction with attached drawing, the present invention will be described in detail, and necessary explanation is carried out to some terms before narration.
Term is explained：
Light node：The node of partial information on memory block chain.
Full node：The node of all information on memory block chain.
The height of block：Position of the block in block chain highly increases to continuous with the continuous progress of packing process
Add.
Elevation：The height threshold of transaction to be confirmed, when reaching elevation, the transaction is not identified also, is considered as
This than merchandise it is eternal can not be packed into block, can not cochain.
History block：Using the block of the current data therefrom of light node as boundary, highly it is less than the area of current block height
Block.
Fig. 1 is the flow chart 100 of the transaction request of light node monitoring users.
Step S101：Light node obtains the elevation (i.e. height threshold) of transaction request and user setting from user.
Step S101：Light node generates transaction Hash corresponding with the Transaction Information that user asks by hash algorithm.
Step S103：The transaction Hash that light node storage generates is merchandised for inquiring, and stores the elevation of acquisition.
Step S104：The Transaction Information obtained from user is sent to full node by light node, and full node is waited for believe transaction
Breath is packaged into block.
Fig. 2 light nodes according to an embodiment of the invention obtain the flow chart of the method for the data of verification transaction from full node
200。
Step S201：Light node obtains area's data in the block since the first block of full node by increasing height mode,
The data may include the height of block, area specified transaction Hash and root Hash etc. in the block.In one embodiment,
Light node synchronizes area's data in the block of full node.It should be understood that specified transaction Hash may include one or more friendships
Easy Hash, in one embodiment, the transaction Hash specified in block are transaction Hash all in block.
Step S202：If not having Transaction Information in the block of light node data therefrom, S203 is thened follow the steps, it is no
Then follow the steps S204.
Step S203：The block for abandoning not Transaction Information, i.e., will not store on light node from the block in full node
The data of middle acquisition.
Step S204：Area's specified transaction Hash in the block to obtaining data is handled to form corresponding data set
It closes.In one embodiment, by Bloom filter to obtain data area's All Activity Hash in the block handled with
Form corresponding data acquisition system.It should be understood that can be by other filters or other suitable modes to specified friendship
Easy Hash is handled to form corresponding data acquisition system.
Step S205：If storing the transaction Hash of subject to confirmation in light node, S206 is thened follow the steps, step is otherwise executed
Rapid S210.
Step S206：If the cut-off that the height of the block of the current data therefrom of light node is more than transaction to be confirmed is high
It spends (height threshold that i.e. user specifies), thens follow the steps S207, it is no to then follow the steps S209.
Step S207：If held there are transaction Hash to be confirmed in the block of the current data therefrom of light node
Row step S208, it is no to then follow the steps S210.
Step S208：Light node generates and preserves the proof path of Hash of merchandising to be confirmed, by with transaction to be confirmed
The status indication of the corresponding transaction to be confirmed of Hash is cochain success (first state) and preserves the state.
Step S209：Light node fails the status indication of transaction corresponding with transaction Hash to be confirmed for cochain
(the second state).
Step S210：Preserve the height of the block of current data therefrom, the root Hash of transaction, specified transaction Hash
The data acquisition system of formation.
By the process of Fig. 2, light node store completes the minimal amount of data needed for Transaction Inquiries for user.
It should be understood that absolute chronological order is not present in process described in Fig. 1 and Fig. 2, user can first initiate to hand over
Easily request is so that light node stores the transaction Hash of generation, and then light node obtains block by increasing height mode from full node
In data, can also be light node while obtaining area's data in the block from full node by increasing height mode, user initiates
Transaction request can also be that light node first obtains area's data in the block by increasing height mode from full node and then user just initiates
Transaction request.
The process of the cochain state of light node monitoring users requesting query transaction is described below in conjunction with Fig. 3, Fig. 4 and Fig. 5.
Step S301：Light node receives the first transaction Hash (transaction Hash i.e. to be confirmed) input by user and cut-off is high
Degree.
Step S302：If being stored with the second transaction Hash identical with the first transaction Hash in light node, step is executed
Rapid S303, it is no to then follow the steps S311.
Step S303：If the state of the first transaction corresponding with the first transaction Hash is labeled, then follow the steps
S304, it is no to then follow the steps S310.
Step S304：If the state of the second transaction corresponding with the second transaction Hash is cochain success (the first shape
State), S305 is thened follow the steps, it is no to then follow the steps S309.
Step S305：The proof path of stored in light node second transaction Hash is combined into generation with the second transaction Hash
Root Hash.
Step S306：(exist and give birth in i.e. light node if there is the block of identical with the root Hash of generation Hash
At identical Hash of root Hash, and light node can be found and obtain block corresponding to the root Hash from full node
Data), S307 is thened follow the steps, it is no to then follow the steps S308.
Step S307：The state of the first transaction is returned as cochain success.
Step S308：Return to light node check errors (the 4th state).
Step S309：The state for returning to the first transaction is that cochain fails (the second state).
Step S310：The state for returning to the first transaction is non-cochain (third state).
Step S311：If the height for currently obtaining the block of data has reached elevation, S312 is thened follow the steps,
It is no to then follow the steps S320.
Step S312：Since the first block of the current data therefrom of light node, gone through by highly successively decreasing to access one by one
History block, to determine that the first transaction Hash whether there is in the history block accessed, wherein the first block is in full node
In, and acquired data include the height of the first block, the firstth area specified transaction Hash and root Hash in the block.
Step S313：If the first transaction Hash is present in the filter of history block of current accessed, step is executed
Rapid S314, it is no to then follow the steps S318.
Step S314：Partial data (i.e. all numbers included in history block of the history block are obtained from full node
According to).
Step S315：If the first transaction Hash is present in the partial data of the acquired history block, execute
Step S316, it is no to then follow the steps S317.
Step S316：The proof path of the first transaction Hash is generated, and returns to the state of the first transaction as cochain success.
Step S317：If the history block is the history block of height minimum, S318 is thened follow the steps, step is otherwise executed
Rapid S319.
Step S318：The previous history block being located next to that height is less than the history block is accessed, and repeats step
S313。
Step S319：The state for returning to the first transaction fails for cochain.
Step S320：Light the first transaction Hash of node storage and elevation.
Step S321：Since the first block of the current data therefrom of light node, gone through by highly successively decreasing to access one by one
History block is (for example, the height of the first block of current data therefrom is 10, then back accessing height since height 10
History block between 10 to highly 1), to determine that the first transaction Hash whether there is in the history block accessed, wherein
First block is in full node, and acquired data include the height of the first block, the specified transaction in the block of the firstth area
Hash and root Hash.
Step S322：If the first transaction Hash is present in the filter of history block of current accessed, step is executed
Rapid S323, it is no to then follow the steps S326.
Step S323：Partial data (i.e. all numbers included in history block of the history block are obtained from full node
According to).
Step S324：If the first transaction Hash is present in the partial data of the history block, S325 is thened follow the steps,
It is no to then follow the steps S326.
Step S325：The proof path of the first transaction Hash is generated, and is cochain success by the status indication of the first transaction,
And the state of the first transaction is returned as cochain success.
Step S326：If light node from height the first block of current data therefrom height to elevation
Between the second block obtain data (for example, input first transaction Hash when, light node from height for 10 block in obtain
Data, elevation 20, light node still can obtain number from height in query process in the block between 10 to 20
According to.) when, the first transaction is marked, S327 is thened follow the steps, it is no to then follow the steps S329.
Step S327：If the state of the first transaction is cochain success by light vertex ticks, S328 is thened follow the steps, otherwise
Execute step S329.
Step S328：The state of the first transaction is returned as cochain success.
Step S329：If the history block is the history block of height minimum, S330 is thened follow the steps, step is otherwise executed
Rapid S331.
Step S330：The previous history block being located next to that height is less than the history block is accessed, and repeats step
S322。
Step S331：If elevation is less than the height of the second block, S332 is thened follow the steps, it is no to then follow the steps
S333。
Step S332：The state for returning to the first transaction fails for cochain.
Step S333：The state for returning to the first transaction is non-cochain.
It should be understood that when the proof path of this paper is Merkel proof path, root Hash is Merkel's root Hash, it was demonstrated that
Path can be any other suitable proof path, and root Hash may be any other suitable Hash.It should manage simultaneously
Solution, the filter of this paper can be Bloom filter, or any other suitable filter.
The method of light node verification transaction provided by the invention, can help full node to mitigate the pressure of verification transaction.
Fig. 6 shows the schematic diagram of devices in accordance with embodiments of the present invention 600.Device 600 may include：Memory
601 and it is coupled to the processor 602 of memory 601.For storing instruction, processor 602 is configured as being based on depositing memory 601
Reservoir 601 store instruction come realize for described in Fig. 2 to Fig. 5 the step of method in any step in one or more
It is a.
As shown in fig. 6, device 600 can also include communication interface 603, for carrying out information exchange with miscellaneous equipment.This
Outside, device 600 can also include bus 604, and memory 601, processor 602 and communication interface 603 are by bus 604 come each other
It is communicated.
Memory 601 may include volatile memory, can also include nonvolatile memory.Processor 602 can be with
It is central processing unit (CPU), microcontroller, application-specific integrated circuit (ASIC), digital signal processor (DSP), field-programmable
Gate array (FPGA) or other programmable logic device or the one or more collection for being configured as realization the embodiment of the present invention
At circuit.
Alternatively, the method that above-mentioned light node obtains the method for the data of verification transaction and light node verification is merchandised can
By computer program product, i.e., tangible computer readable storage medium embodies.Computer program product may include meter
Calculation machine readable storage medium storing program for executing, containing the computer-readable program instructions for executing various aspects of the invention.Computer
Readable storage medium storing program for executing can be the tangible device that can keep and store the instruction used by instruction execution equipment.It is computer-readable
Storage medium can for example be but not limited to storage device electric, magnetic storage apparatus, light storage device, electromagnetism storage device, partly lead
Body storage device or above-mentioned any appropriate combination.The more specific example of computer readable storage medium is (non exhaustive
List) include：Portable computer diskette, hard disk, random access memory (RAM), read-only memory (ROM), erasable type can be compiled
Journey read-only memory (EPROM or flash memory), static RAM (SRAM), Portable compressed disk read-only memory (CD-
ROM), digital versatile disc (DVD), memory stick, floppy disk, mechanical coding equipment, the punch card for being for example stored thereon with instruction or
Groove internal projection structure and above-mentioned any appropriate combination.Computer readable storage medium used herein above is not solved
It is interpreted as instantaneous signal itself, such as electromagnetic wave of radio wave or other Free propagations passes through waveguide or other transmission mediums
The electromagnetic wave (for example, the light pulse for passing through fiber optic cables) of propagation or the electric signal transmitted by electric wire.
It should be noted that the above list is only specific embodiments of the present invention, it is clear that the present invention is not limited to above real
Example is applied, there are many similar variations therewith.If those skilled in the art directly exports or associates from present disclosure
All deformations arrived, are within the scope of protection of the invention.
Claims (20)
1. a kind of method that light node obtains the data of verification transaction, which is characterized in that including：
Obtain the data in the designated blocks of full node, wherein the data in the acquired designated blocks include the finger
Determine the specified transaction Hash in the height and the designated blocks of block；
Specified transaction Hash in the designated blocks is handled, to obtain corresponding data acquisition system；
When the transaction Hash of subject to confirmation in light node and the height of the designated blocks is less than specified altitude assignment threshold value and institute
State in designated blocks that there are the proof paths for when the transaction Hash to be confirmed, generating the transaction Hash to be confirmed.
2. according to the method described in claim 1, it is characterized in that, the data in the acquired designated blocks further include root
Hash.
3. according to the method described in claim 1, it is characterized in that, further including：
When the transaction Hash of subject to confirmation in light node and the height of the designated blocks is less than specified altitude assignment threshold value and institute
It states in designated blocks there are when the transaction Hash to be confirmed, by transaction corresponding with the transaction Hash to be confirmed
Status indication is first state.
4. according to the method described in claim 1, it is characterized in that, further including：
When in light node subject to confirmation transaction Hash and the designated blocks height be more than or equal to specified altitude assignment threshold value when,
Status indication by transaction corresponding with the transaction Hash to be confirmed is the second state.
5. according to the method described in claim 1, it is characterized in that, by filter to the specified friendship in the designated blocks
Easy Hash is handled, to obtain corresponding data acquisition system.
6. according to the described method of any one of claim 1-4, which is characterized in that the transaction Hash to be confirmed is by gently saving
Point is generated when receiving transaction request.
7. a kind of method of light node verification transaction, which is characterized in that the method includes：
Obtain the first transaction Hash and specified altitude assignment threshold value；
The comparison result for merchandising Hash and the transaction Hash in light node according to described first is breathed out to determine with first transaction
The state of uncommon corresponding first transaction.
8. the method according to the description of claim 7 is characterized in that further including：
When there is the second transaction Hash identical with the first transaction Hash in light node,
If the state of the second transaction corresponding with the second transaction Hash is labeled, further determine that described second hands over
Whether easy state is first state；
If the state of the second transaction corresponding with the second transaction Hash is not labeled, the state of first transaction
It is confirmed as the third state.
9. according to the method described in claim 8, it is characterized in that, further including：
If further determining that the state of second transaction is the first state, by the card with the second transaction Hash
Bright path and the second transaction Hash are combined to generate root Hash；
If further determining that the state of second transaction is not the first state, the state of first transaction is true
It is set to the second state.
10. according to the method described in claim 9, it is characterized in that, further including：
When existing, when corresponding to the block of the identical Hash of root Hash generated, the state of first transaction is determined
For the first state；
When there is no corresponding to the block of the identical Hash of root Hash generated, the state of first transaction is true
It is set to the 4th state.
11. the method according to the description of claim 7 is characterized in that further including：
When in light node there is no with it is described first transaction Hash it is identical second transaction Hash and light node currently therefrom obtain
When the height of the first block for evidence of fetching has reached the specified altitude assignment threshold value, by highly successively decreasing since first block
Sequence is accessed history block and whether there is in the history block accessed with determination the first transaction Hash one by one, wherein
First block is in full node, and acquired data include in the height of first block, first block
Specified transaction Hash and root Hash.
12. according to the method for claim 11, which is characterized in that further include：
In the filter of the first transaction Hash history block that is present in current accessed and the first transaction Hash
When being present in the partial data of the history block of current accessed, the first transaction proof path of Hash and described is generated
The state of first transaction is confirmed as first state；Or
In the filter of the first transaction Hash history block that is present in current accessed and the first transaction Hash
It is not present in the partial data of the history block of current accessed and the history block of current accessed is the minimum block of height
When, the state of first transaction is confirmed as the second state；Or
In the filter of the first transaction Hash history block that is not present in current accessed and the history of current accessed
When block is height minimum block, the state of first transaction is confirmed as the second state.
13. the method according to the description of claim 7 is characterized in that further including：
When in light node there is no with it is described first transaction Hash it is identical second transaction Hash and light node currently therefrom obtain
It is suitable by highly successively decreasing since first block when the height of first block of evidence of fetching is not up to the specified altitude assignment threshold value
Sequence is accessed history block and whether there is in the history block accessed with determination the first transaction Hash one by one, wherein institute
The first block is stated on full node, acquired data, which include the height of first block, firstth area is in the block specifies
Transaction Hash and root Hash.
14. according to the method for claim 13, which is characterized in that further include：
In the filter of the first transaction Hash history block that is present in current accessed and the first transaction Hash
When being present in the partial data of the history block of current accessed, the proof path of generation the first transaction Hash simultaneously will be described
The state of first transaction is determined as first state.
15. according to the method for claim 13, which is characterized in that further include：
If in the filter for the history block that the first transaction Hash is present in current accessed and first transaction is breathed out
It is uncommon to be not present in the partial data of history block of current accessed, or
If the first transaction Hash is not present in the filter of history block of current accessed,
Then determine that height to the second block specified altitude assignment threshold value between of the light node from height in first block obtains
Access according to when whether to it is described first transaction be marked.
16. according to the method for claim 15, which is characterized in that further include：
If height to second block specified altitude assignment threshold value between of the light node from height in first block obtains data
When to it is described first transaction be marked and it is described first transaction state be marked as first state, then it is described first transaction
State be confirmed as first state.
17. according to the method for claim 15, which is characterized in that further include：
If height to second block specified altitude assignment threshold value between of the light node from height in first block obtains data
When to it is described second transaction be marked but it is described second transaction be not labeled as first state, or
If height to second block specified altitude assignment threshold value between of the light node from height in first block obtains data
Second transaction is marked in Shi Wei, then whether the history block based on current accessed is that the minimum history block of height is true
The state of fixed first transaction.
18. according to the method for claim 17, which is characterized in that further include：
If when the history block of current accessed is height minimum history block and the height of second block is more than or equal to
The specified altitude assignment threshold value, then it is described first transaction state be determined the third state；
If when the history block of current accessed is height minimum history block but the height of second block is less than described
Specified altitude assignment threshold value, then it is described first transaction state be confirmed as the second state.
19. a kind of device, which is characterized in that including：
Memory, for storing instruction；And
Processor, is coupled to the memory, and described instruction makes described device execute root when being executed by the processor
According to the method described in any one of claim 1-18.
20. a kind of computer readable storage medium, the storage medium includes instruction, and described instruction is performed so that described
The processor of computer executes the method described in any one of described claim 1-18.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810789962.8A CN108681900A (en) | 2018-07-18 | 2018-07-18 | The method of light node verification transaction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810789962.8A CN108681900A (en) | 2018-07-18 | 2018-07-18 | The method of light node verification transaction |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108681900A true CN108681900A (en) | 2018-10-19 |
Family
ID=63814063
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810789962.8A Pending CN108681900A (en) | 2018-07-18 | 2018-07-18 | The method of light node verification transaction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108681900A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110022345A (en) * | 2018-12-28 | 2019-07-16 | 阿里巴巴集团控股有限公司 | Request processing method, system, device and equipment in alliance's chain |
| CN110049087A (en) * | 2018-12-28 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of reliability verification method, system, device and the equipment of alliance's chain |
| CN110046901A (en) * | 2018-12-28 | 2019-07-23 | 阿里巴巴集团控股有限公司 | Reliability verification method, system, device and the equipment of alliance's chain |
| CN110442448A (en) * | 2019-07-04 | 2019-11-12 | 杭州复杂美科技有限公司 | Block generation method, equipment and storage medium |
| CN110503558A (en) * | 2019-08-29 | 2019-11-26 | 深圳前海微众银行股份有限公司 | A kind of processing method and processing device based on block catenary system |
| CN110889729A (en) * | 2019-11-29 | 2020-03-17 | 腾讯科技（深圳）有限公司 | Data verification method and device based on block chain network |
| CN111242617A (en) * | 2020-01-02 | 2020-06-05 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for performing transaction correctness verification |
| CN111418183A (en) * | 2019-11-27 | 2020-07-14 | 支付宝(杭州)信息技术有限公司 | Asynchronous processing of blockchain blocks |
| CN111666582A (en) * | 2019-03-08 | 2020-09-15 | 深圳市网安计算机安全检测技术有限公司 | Data cleaning method, device and equipment based on block chain and storage medium |
| CN111680049A (en) * | 2020-05-15 | 2020-09-18 | 杭州趣链科技有限公司 | Block chain-based processing method and processing device for Internet of things data |
| CN113435896A (en) * | 2021-05-18 | 2021-09-24 | 腾讯科技（深圳）有限公司 | Transaction verification method, device, equipment and storage medium |
| CN115293769A (en) * | 2022-10-08 | 2022-11-04 | 中铱数字科技有限公司 | Dynamic management and check node system based on block chain |
| CN115860742A (en) * | 2023-02-27 | 2023-03-28 | 北京溪塔科技有限公司 | Data synchronization method, node, storage medium and equipment for light node in block chain |
| CN111666582B (en) * | 2019-03-08 | 2024-05-03 | 深圳市网安计算机安全检测技术有限公司 | Data cleaning method, device, equipment and storage medium based on block chain |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528746A (en) * | 2016-10-26 | 2017-03-22 | 江苏通付盾科技有限公司 | Trade information inquiring method, device and system |
| US20180145836A1 (en) * | 2016-11-18 | 2018-05-24 | Intel Corporation | Technology for secure partitioning and updating of a distributed digital ledger |
-
2018
- 2018-07-18 CN CN201810789962.8A patent/CN108681900A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106528746A (en) * | 2016-10-26 | 2017-03-22 | 江苏通付盾科技有限公司 | Trade information inquiring method, device and system |
| US20180145836A1 (en) * | 2016-11-18 | 2018-05-24 | Intel Corporation | Technology for secure partitioning and updating of a distributed digital ledger |
Non-Patent Citations (3)
| Title |
|---|
| 中国互联网金融安全课题组: "《中国互联网金融安全发展报告 2017 监管科技 逻辑 应用与路径》", 31 January 2018, 中国金融出版社 * |
| 企鹅号 - ANDROID优秀开源项目分享: "Merkle树和SPV机制", 《腾讯云（HTTPS://CLOUD.TENCENT.COM/DEVELOPER/NEWS/212113）》 * |
| 等一轮残月: "什么是SPV钱包（轻钱包）？", 《链节点（HTTPS://WWW.CHAINNODE.COM/TUTORIAL/2002）》 * |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020134616A1 (en) * | 2018-12-28 | 2020-07-02 | 阿里巴巴集团控股有限公司 | Method, system, apparatus and device for processing request in alliance chain |
| TWI718714B (en) * | 2018-12-28 | 2021-02-11 | 開曼群島商創新先進技術有限公司 | Request processing method, system, device and equipment in alliance chain |
| CN110046901A (en) * | 2018-12-28 | 2019-07-23 | 阿里巴巴集团控股有限公司 | Reliability verification method, system, device and the equipment of alliance's chain |
| EP3817333A4 (en) * | 2018-12-28 | 2021-09-08 | Advanced New Technologies Co., Ltd. | Method, system, apparatus and device for processing request in alliance chain |
| CN110049087A (en) * | 2018-12-28 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of reliability verification method, system, device and the equipment of alliance's chain |
| CN110046901B (en) * | 2018-12-28 | 2020-06-30 | 阿里巴巴集团控股有限公司 | Credibility verification method, system, device and equipment of alliance chain |
| CN110049087B (en) * | 2018-12-28 | 2020-05-05 | 阿里巴巴集团控股有限公司 | Credibility verification method, system, device and equipment of alliance chain |
| US11107079B2 (en) | 2018-12-28 | 2021-08-31 | Advanced New Technologies Co., Ltd. | Methods, systems, apparatuses and devices for verifying credibility of consortium blockchain |
| TWI727467B (en) * | 2018-12-28 | 2021-05-11 | 開曼群島商創新先進技術有限公司 | Trustworthiness verification method, system, device and equipment of alliance chain |
| CN110022345A (en) * | 2018-12-28 | 2019-07-16 | 阿里巴巴集团控股有限公司 | Request processing method, system, device and equipment in alliance's chain |
| CN111666582B (en) * | 2019-03-08 | 2024-05-03 | 深圳市网安计算机安全检测技术有限公司 | Data cleaning method, device, equipment and storage medium based on block chain |
| CN111666582A (en) * | 2019-03-08 | 2020-09-15 | 深圳市网安计算机安全检测技术有限公司 | Data cleaning method, device and equipment based on block chain and storage medium |
| CN110442448A (en) * | 2019-07-04 | 2019-11-12 | 杭州复杂美科技有限公司 | Block generation method, equipment and storage medium |
| CN110503558A (en) * | 2019-08-29 | 2019-11-26 | 深圳前海微众银行股份有限公司 | A kind of processing method and processing device based on block catenary system |
| CN110503558B (en) * | 2019-08-29 | 2023-10-03 | 深圳前海微众银行股份有限公司 | Processing method and device based on block chain system |
| CN111418183A (en) * | 2019-11-27 | 2020-07-14 | 支付宝(杭州)信息技术有限公司 | Asynchronous processing of blockchain blocks |
| CN111418183B (en) * | 2019-11-27 | 2022-09-16 | 支付宝(杭州)信息技术有限公司 | Asynchronous processing of blockchain blocks |
| CN110889729A (en) * | 2019-11-29 | 2020-03-17 | 腾讯科技（深圳）有限公司 | Data verification method and device based on block chain network |
| CN110889729B (en) * | 2019-11-29 | 2024-03-26 | 腾讯科技（深圳）有限公司 | Data verification method and device based on blockchain network |
| CN111242617A (en) * | 2020-01-02 | 2020-06-05 | 支付宝(杭州)信息技术有限公司 | Method and apparatus for performing transaction correctness verification |
| CN111680049A (en) * | 2020-05-15 | 2020-09-18 | 杭州趣链科技有限公司 | Block chain-based processing method and processing device for Internet of things data |
| CN113435896B (en) * | 2021-05-18 | 2022-05-31 | 腾讯科技（深圳）有限公司 | Transaction verification method, device, equipment and storage medium |
| CN113435896A (en) * | 2021-05-18 | 2021-09-24 | 腾讯科技（深圳）有限公司 | Transaction verification method, device, equipment and storage medium |
| CN115293769B (en) * | 2022-10-08 | 2022-12-27 | 中铱数字科技有限公司 | Dynamic management and check node system based on block chain |
| CN115293769A (en) * | 2022-10-08 | 2022-11-04 | 中铱数字科技有限公司 | Dynamic management and check node system based on block chain |
| CN115860742A (en) * | 2023-02-27 | 2023-03-28 | 北京溪塔科技有限公司 | Data synchronization method, node, storage medium and equipment for light node in block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108681900A (en) | The method of light node verification transaction | |
| CN109242685A (en) | Common recognition and verification method and device based on block chain | |
| CN108615151B (en) | Data processing method, block chain server and node equipment | |
| CN109543455A (en) | A kind of data archiving method and device of block chain | |
| CN109684108A (en) | Implementation method, system, storage medium and the electronic equipment of message queue | |
| JP2021532494A (en) | A distributed network system that operates groups for the nodes included in the system | |
| CN109146490A (en) | block generation method, device and system | |
| CN110083334A (en) | The online method and device of model | |
| CN110223153A (en) | Account checking method, device, electronic equipment and storage medium | |
| CN108846674A (en) | The method and apparatus of signature are verified in block chain | |
| CN107169055B (en) | A kind of operating method and operating system of database table | |
| CN109784928A (en) | Information processing method and information processing unit based on block chain | |
| CN109492049A (en) | Data processing, block generation and synchronous method for block chain network | |
| CN110009759A (en) | Work attendance method, attendance checking system and Work attendance device based on block chain | |
| CN109493051A (en) | The more subchain system architectures of main chain adduction row of account distribution and migration can dynamically be carried out | |
| CN109857806B (en) | Synchronous verification method and device for database table | |
| CN109685657A (en) | The method and node device and storage medium of transaction are handled in block chain network | |
| CN109634655A (en) | Variable configuration method based on heat deployment, device, electronic equipment, storage medium | |
| CN109634979A (en) | Data-updating method and device | |
| CN106293996B (en) | Method of data synchronization, main equipment, alternate device and system | |
| CN110298757B (en) | Consensus method and device relating to DPoS | |
| CN111078715A (en) | Synchronous storage method and device for internet advertisement data on block chain | |
| CN111738853A (en) | Transaction optimization method and device based on block chain distributed system | |
| CN110347380A (en) | Front and back end development approach and equipment | |
| CN112801616B (en) | Abnormal account book processing method and device |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20181019 |