CN107276762A - The method of work and device of a kind of multi-protocols block chain - Google Patents

The method of work and device of a kind of multi-protocols block chain Download PDF

Info

Publication number
CN107276762A
CN107276762A CN201710318169.5A CN201710318169A CN107276762A CN 107276762 A CN107276762 A CN 107276762A CN 201710318169 A CN201710318169 A CN 201710318169A CN 107276762 A CN107276762 A CN 107276762A
Authority
CN
China
Prior art keywords
block
branched chain
branch
hash value
agreement
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
Application number
CN201710318169.5A
Other languages
Chinese (zh)
Other versions
CN107276762B (en
Inventor
陆舟
于华章
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Feitian Technologies Co Ltd
Original Assignee
Feitian Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Feitian Technologies Co Ltd filed Critical Feitian Technologies Co Ltd
Priority to CN201710318169.5A priority Critical patent/CN107276762B/en
Publication of CN107276762A publication Critical patent/CN107276762A/en
Application granted granted Critical
Publication of CN107276762B publication Critical patent/CN107276762B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic 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/3236Cryptographic 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
    • H04L9/3239Cryptographic 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 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0866Generation of secret information including derivation or calculation of cryptographic keys or passwords involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0872Generation of secret information including derivation or calculation of cryptographic keys or passwords using geo-location information, e.g. location data, time, relative position or proximity to other entities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic 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/3297Cryptographic 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 involving time stamps, e.g. generation of time stamps

Abstract

The invention discloses a kind of method of work of multi-protocols block chain and device, belong to block chain field.Methods described includes:Create wound generation block and standard block;The hash value deposit standard block of wound generation block is calculated, and block is added on main block chain by the agreement of wound generation block;When there is new business demand, branch's block and branched chain root block are created on main block chain;Short hash value is used as after the short hash value of calculating branched chain root block and authorizes Hash deposits branch block;The hash value deposit branched chain root block of branch's block is calculated, branched chain is linked into;When new block need to be added in branched chain, also need checking branched chain root block whether legal, if illegal, new block failure is added in branched chain, if legal, read the agreement of branched chain and verify the validity of branched chain.Using technical scheme, the block chain of multi-protocols can be created, it is allowed to change the agreement of block chain, and the branch of block chain can be extended.

Description

The method of work and device of a kind of multi-protocols block chain
Technical field
The present invention relates to the method for work and device of block chain technology, more particularly to a kind of multi-protocols block chain, belong to area Block chain field.
Background technology
Persistently overheating with bit coin in recent years, block chain also slowly enters big as the Floor layer Technology basis of bit coin Many visuals field.Block chain is a decentralization, the technical scheme of collective's one reliable distributed data base of maintenance.The party Case mainly allows block to be associated by cryptography method, and each block contains the whole data letter of system in certain time Breath, and digital signature is generated with the validity of checking information according to data message, while hash value (cryptographic Hash) is linked to One block chain of next data block formation.
Although there is block chain on a distribution network abundant hard and fast rule to set up an effective block, During establishment block chain, the rule of control block chain data storage, parsing and block addition and checking is set and can not entirely Change, and existing block chain technology does not adapt to the ability of node, and in order to support the link most grown, any establishment is in block Branch on chain can all be abandoned, waste of resource.
The content of the invention
The invention aims to solve problems of the prior art, there is provided a kind of work of multi-protocols block chain Make method and device.
On the one hand, the invention provides a kind of method of work of multi-protocols block chain, including:
Step S1:Wound generation block is created, and standard block is created according to the agreement of wound generation block;Calculate wound generation block Hash value is simultaneously deposited into standard block, is linked into main block chain, and added on main block chain according to the agreement of wound generation block Block;
Step S2:When there is new business demand, branch's block is created on main block chain, and create branched chain root area Block;The short hash value of branched chain root block is calculated, and regard short hash value as mandate Hash deposits branch block;Calculate area of branch The hash value of block is simultaneously deposited into branched chain root block, is linked into branched chain;
Step S3:When needing to add new block in branched chain, whether checking branched chain root block is legal, if not It is legal, then new block failure is added in branched chain, if legal, the agreement of branched chain read and verifies having for branched chain Effect property, if branched chain effectively, new block is added according to the agreement of branched chain in branched chain, if branched chain is invalid, New block failure is then added in branched chain.
Specifically, wound generation block is created, is specially:Identified and created according to criterion of proof, net load, descriptor and branch Create after generation block, net load hash value is calculated according to the net load of wound generation block, and be wound generation block addition timestamp;
Specifically, standard block is created according to agreement as defined in wound generation block, is specially:According to criterion of proof, net load, Descriptor and branch's mark are created after standard block according to the agreement of wound generation block, calculate net according to the net load of standard block Load hash value, and add timestamp for standard block;
Specifically, branch's block is created on main block chain, is specially:According to criterion of proof, net load, descriptor and Branch's mark is created after branch's block according to the agreement of wound generation block, and net load Hash is calculated according to the net load of branch's block Value, and be branch's block addition timestamp.
Specifically, branched chain root block is created, is specially:Identified according to criterion of proof, net load, descriptor and branch Create after branched chain root block, net load hash value is calculated according to the net load of branched chain root block, and be branched chain root block Add timestamp.
Further, the hash value of wound generation block is calculated in step S1 and standard block is deposited into, main block is linked into Chain, be specially:According to the criterion of proof of wound generation block, using the net load hash value in wound generation block, timestamp, prove to mark Standard, descriptor, branch's mark and random number calculate the hash value of wound generation block, regard the hash value for creating generation block as standard block Previous block hash value deposit standard block, be linked into main block chain.
Further, step S2 falls into a trap the short hash value of point counting side chain root block, and short hash value is used as authorizes Hash Branch's block is stored in, is specially:Criterion of proof, net load, descriptor, branch in branched chain root block are identified, born only Lotus hash value and timestamp calculate the short hash value of branched chain root block, and using the short hash value of branched chain root block as point The mandate Hash deposits branch block of branch block;
Further, calculate the hash value of branch's block and be deposited into branched chain root block, be specially:According to branch Criterion of proof in block, using the previous block hash value in branch's block, net load hash value, timestamp, criterion of proof, Descriptor, branch's mark, random number and authorize Hash to calculate the hash value of branch block, and using the hash value of branch's block as The previous block hash value deposit branched chain root block of branched chain root block.
Preferably, before the hash value for calculating branch's block, in addition to:Calculate branch's block previous on main block chain Block hash value is simultaneously stored in branch's block, is specially:According to the proof mark of previous block of branch's block on main block chain Standard, is marked using the previous block hash value of previous block, net load hash value, timestamp, criterion of proof, descriptor, branch Know, random number and mandate Hash calculate previous block hash value and be stored in branch's block.
Specifically, verify whether branched chain root block is legal in step S3, be specially:
Step F1:Verify branched chain root block previous block hash value whether with branch's block on main block chain Hash value is identical, if identical, performs step F2, otherwise branched chain root block is illegal, and new area is added in branched chain Block fails;
Step F2:Verify branched chain root block short hash value whether with the mandate in branch's block on main block chain Hash is identical, if identical, reads the agreement of branched chain and verifies the validity of branched chain, if it is valid, in branched chain The upper new block success of addition, if invalid, adds new block failure in the branched chain, and otherwise branched chain root block is not It is legal, new block failure is added in branched chain.
Further, step F1, be specially:Previous block hash value, random number, net load in branch's block Hash value, timestamp, criterion of proof, descriptor, branch's mark, mandate Hash and net load calculate the Hash of branch's block Whether value, the hash value of checking branch block is identical with the previous block hash value in branched chain root block, if two values are identical, Step F2 is then performed, otherwise branched chain root block is illegal, and branched chain is considered as invalid;
Further, step F2, be specially:According to the net load hash value of branched chain root block, timestamp, prove mark Accurate, descriptor and branch's mark calculate the short hash value of branched chain root block, and the short hash value of checking branched chain root block is It is no identical with the mandate hash value of branch block, if two values are identical, the agreement of branched chain is read, otherwise branched chain root block Illegal, branched chain is considered as invalid.
Further, also include before the validity for reading the agreement of branched chain and verifying branched chain:Judge whether to deposit In the equal branched chain root block of the hash value of other another previous block hash values and branch's block, if it is present After length most long branched chain is chosen in the branched chain being connected with branch block as legal branched chain, legal branched chain is read Agreement and verify the validity of legal branched chain, if it does not exist, then directly reading the agreement of branched chain and verifying branched chain Validity.
Specifically, the agreement of branched chain is read, is specially:In branch's block on branched chain root block or main block chain Read the agreement of branched chain.
Specifically, in step S3, the validity of branched chain is verified, is specially:Verify the Hash of all blocks in branched chain Whether value meets the agreement of branched chain;And verify whether the timestamp of all blocks in branched chain meets the agreement of branched chain, such as It is verified, then effectively, otherwise the branched chain is invalid for the branched chain.
More specifically, whether the hash value of all blocks meets the agreement of branched chain in checking branched chain, it is specially:Calculate Whether the hash value of first block in branched chain, the previous block hash value in judgement and next block is identical, if Identical, then first block in branched chain meets the agreement of branched chain, continues to verify whether other blocks in branched chain are full The agreement of sufficient branched chain, as described all blocks in branched chain be unsatisfactory for the agreement of the branched chain and be then considered as invalid;
More specifically, whether the timestamp of all blocks meets the agreement of branched chain in checking branched chain, it is specially:Judge Whether the timestamp of each block meets the form of timestamp as defined in branched chain agreement in branched chain, if it is, branched chain Upper each block meets the agreement of branched chain, and new block is added in branched chain according to the agreement of branched chain, otherwise branch Chain is considered as invalid.
On the other hand, the invention provides a kind of device of multi-protocols block chain, including:
First creation module, for creating wound generation block and creating standard block according to the agreement of wound generation block;
First computing module, the hash value for calculating wound generation block;
First memory module, the hash value of the wound generation block for the first computing module to be obtained is stored in the first creation module The standard block of establishment, is linked into main block chain;
First add module, block is added for the agreement according to wound generation block on main block chain;
Second creation module, divides for when there is new business demand, creating branch's block on main block chain, and creating Side chain root block;
Second computing module, the short hash value for calculating branched chain root block;
Second memory module, the short hash value for the second computing module to be obtained is created as mandate Hash deposits second In branch's block of module creation;
3rd computing module, the hash value for calculating branch's block;
3rd memory module, the hash value of branch's block for the 3rd computing module to be obtained is stored in the second creation module In the branched chain root block of establishment, branched chain is linked into;
First authentication module, for when needing to add new block in branched chain, whether checking branched chain root block It is legal;
Read module, for when the first authentication module checking branched chain root block is legal, reading the agreement of branched chain;
Second authentication module, the validity for verifying the branched chain that read module is read;
Second add module, for when the second authentication module verify branched chain agreement it is effective when, according to branched chain Agreement adds new block in branched chain.
Specifically, in the present embodiment, the first creation module, is specifically included:First creating unit, the first computing unit, First adding device, the second creating unit, the second computing unit, the second adding device, the 3rd creating unit, the 3rd computing unit With the 3rd adding device;
First creating unit, for creating wound generation block according to criterion of proof, net load, descriptor and branch mark;
First computing unit, the net load Hash of generation block is created for being calculated according to the net load for creating the first creating unit Value;
First adding device, for adding timestamp for wound generation block;
Second creating unit, for being identified according to criterion of proof, net load, descriptor and branch according to wound generation block Agreement creates standard block;
Second computing unit, the net load hash value for calculating standard block according to the net load of standard block;
Second adding device, for adding timestamp for standard block;
3rd creating unit, for being identified according to criterion of proof, net load, descriptor and branch according to wound generation block Agreement creates branch's block;
3rd computing unit, the net load hash value for calculating branch's block according to the net load of branch's block;
3rd adding device, for adding timestamp for branched chain root block.
Specifically, the second creation module, is specifically included:4th creating unit, the 4th computing unit and the 4th add module;
4th creating unit, for creating branched chain root area according to criterion of proof, net load, descriptor and branch mark Block;
4th computing unit, the net load of the branched chain root block for being created according to the 4th creating unit calculates branched chain The net load hash value of root block;
4th add module, for adding timestamp for branched chain root block.
Further, the first computing module, specifically for the criterion of proof according to wound generation block, using in wound generation block Net load hash value, timestamp, criterion of proof, descriptor, branch's mark and random number calculate the hash value of wound generation block;
First memory module, the hash value of the wound generation block specifically for the first computing unit is calculated is used as standard block Previous block hash value deposit standard block, be linked into main block chain.
Further, the second computing module, specifically for:Criterion of proof, net load in branched chain root block, retouch State the short hash value that symbol, branch's mark, net load hash value and timestamp calculate branched chain root block;
Specifically, the second memory module, specifically for:The short Hash for the branched chain root block that second computing module is calculated It is worth and is stored in branch's block as the mandate Hash of branch's block;
Specifically, the 3rd computing module, specifically for:According to the criterion of proof of branch's block, using in branch's block Previous block hash value, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and mandate Hash Calculate the hash value of branch's block;
Specifically, the 3rd memory module, specifically for:Using the 3rd computing module calculate branch's block hash value as The previous block hash value deposit branched chain root block of branched chain root block.
Preferably, the present apparatus also includes:4th computing module and the 4th memory module;
4th computing module, for the criterion of proof in previous block of branch's block on main block chain, makes With the previous block hash value in previous block of branch's block on main block chain, net load hash value, timestamp, proof Standard, descriptor, branch's mark, random number and mandate Hash calculate previous block hash value;
4th memory module, the previous block hash value for the 4th computing module to be calculated is stored in branch's block.
Further, authentication module includes:First authentication unit and the second authentication unit;
First authentication unit, for verify the previous block hash value in branched chain root block whether with main block chain The hash value of branch's block is identical;
Second authentication unit, previous block hash value and primary area for verifying branched chain root block when the first authentication unit When the hash value of branch's block on block chain is identical, verify branched chain root block short hash value whether with main block chain point Mandate Hash in branch block is identical;
Specifically, read module, short hash value and master specifically for verifying branched chain root block when the second authentication unit When the mandate Hash in branch's block on block chain is identical, the agreement of branched chain is read.
Further, the first authentication unit includes:First computation subunit and the first checking subelement, the second checking are single Member includes:Second computation subunit and the second checking subelement;
First computation subunit, for previous block hash value, random number, the net load Hash in branch's block Value, timestamp, criterion of proof, descriptor, branch's mark, mandate Hash and net load calculate the hash value of branch's block;
First checking subelement, for verify the first computation subunit calculate the obtained hash value of branch's block whether with The previous block hash value of branched chain root block is identical;
Second computation subunit, for verifying that the first computation subunit calculates obtained area of branch when the first checking subelement When the hash value of block is identical with the previous block hash value of branched chain root block, according to the net load Hash of branched chain root block Value, timestamp, criterion of proof, descriptor and branch's mark calculate the short hash value of branched chain root block;
Second checking subelement, for verifying that the second computation subunit calculates the short hash value of obtained branched chain root block It is whether identical with the mandate hash value of branch block;
Read module, specifically for when the second checking subelement checking is identical with the mandate hash value of branch block, reading Take the agreement of branched chain simultaneously.
Further, device also includes:Judge module and selecting module;
Judge module, for judging whether that the hash value of other previous block hash values and branch's block is equal Branched chain root block;
Selecting module, for judging the hash value in the presence of another previous block hash value and branch's block when judge module During equal branched chain root block, length most long branched chain is chosen in the branched chain being connected with branch block as legal point Side chain;
Read module, is additionally operable to after selecting module chooses length most long branched chain as legal branched chain, read and close The agreement of method branched chain.
Read module, the association specifically for reading branched chain in branch's block on branched chain root block or main block chain View.
Specifically, authentication module includes:3rd authentication unit and the 4th authentication unit;
3rd authentication unit, for verifying whether the hash value of all blocks in branched chain meets the agreement of branched chain;
4th authentication unit, for verifying whether the timestamp of all blocks in branched chain meets the agreement of branched chain.
Further, the 3rd authentication unit includes:3rd computation subunit, the first judgment sub-unit and the 3rd checking are single Member;
3rd computation subunit, the hash value for calculating first block in branched chain;
First judgment sub-unit, for judging that the 3rd computation subunit calculates the hash value of first block in branched chain It is whether identical with previous block hash value in next block;
3rd checking subelement, for judging the in the 3rd computation subunit calculating branched chain when the first judgment sub-unit When the hash value of one block is identical with the previous block hash value in next block, next block in checking branched chain Whether the agreement of branched chain is met;
4th authentication unit, including the second judgment sub-unit and addition subelement;
Second judgment sub-unit, for judging whether the timestamp of each block in branched chain meets branched chain agreement regulation Timestamp form;
Subelement is added, for judging that the timestamp of each block in branched chain is satisfied by branch when the second judgment sub-unit As defined in chain agreement during the form of timestamp, new block is added in branched chain according to the agreement of branched chain.
The beneficial effect that the present invention is obtained is:
Using technical scheme, the block chain of multi-protocols can be created, it is allowed to change the agreement of block chain, and The branch of block chain can be extended.
Brief description of the drawings
, below will be to embodiment or existing for the clearer explanation embodiment of the present invention or technical scheme of the prior art There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of flow chart of the method for work of multi-protocols block chain;
Fig. 2 is wound generation block structure schematic diagram;
Fig. 3 is standard block structure schematic diagram;
Fig. 4 is the internal connection schematic diagram of branch's block and branched chain root block;
Fig. 5 is the schematic diagram with an effective branched chain;
Fig. 6 is a kind of flow chart of the method for work of multi-protocols block chain;
Fig. 7 is the schematic diagram with a plurality of effective branched chain;
Fig. 8 is a kind of flow chart that standard block is created in branched chain;
Fig. 9 is a kind of schematic diagram of the device of multi-protocols block chain.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation is described, it is clear that described embodiment is only one embodiment of the invention, rather than whole embodiments.Based on this hair Embodiment in bright, the every other implementation that those of ordinary skill in the art are obtained under the premise of creative work is not made Example, belongs to the scope of protection of the invention.
Embodiment one
There is provided a kind of method of work of multi-protocols block chain in the present embodiment, specific steps include:
Step S1:Wound generation block is created, and standard block is created according to the agreement of wound generation block;Calculate wound generation block Hash value is simultaneously deposited into standard block, is linked into main block chain, and added on main block chain according to the agreement of wound generation block Block;
Step S2:When there is new business demand, branch's block is created on main block chain, and create branched chain root area Block;The short hash value of branched chain root block is calculated, and regard short hash value as mandate Hash deposits branch block;Calculate area of branch The hash value of block is simultaneously deposited into branched chain root block, is linked into branched chain;
Step S3:When needing to add new block in branched chain, whether checking branched chain root block is legal, if not It is legal, then new block failure is added in branched chain, if legal, the agreement of branched chain read and verifies having for branched chain Effect property, if branched chain effectively, new block is added according to the agreement of branched chain in branched chain, if branched chain is invalid, New block failure is then added in branched chain.
Specifically, in the present embodiment, wound generation block is created, is specially:According to criterion of proof, net load, descriptor with And branch's mark is created after wound generation block, net load hash value is calculated according to the net load of wound generation block, and add for wound generation block Add timestamp;
Specifically, standard block is created according to agreement as defined in wound generation block, is specially:According to criterion of proof, net load, Descriptor and branch's mark are created after standard block according to the agreement of wound generation block, calculate net according to the net load of standard block Load hash value, and add timestamp for standard block;
Specifically, branch's block is created on main block chain, is specially:According to criterion of proof, net load, descriptor and Branch's mark is created after branch's block according to the agreement of wound generation block, and net load Hash is calculated according to the net load of branch's block Value, and be branch's block addition timestamp.
Specifically, in the present embodiment, branched chain root block is created, is specially:According to criterion of proof, net load, description Symbol and branch's mark are created after branched chain root block, and net load hash value is calculated according to the net load of branched chain root block, and Timestamp is added for branched chain root block.
Further, the hash value of wound generation block is calculated in step S1 and standard block is deposited into, main block is linked into Chain, be specially:According to the criterion of proof of wound generation block, using the net load hash value in wound generation block, timestamp, prove to mark Standard, descriptor, branch's mark and random number calculate the hash value of wound generation block, regard the hash value for creating generation block as standard block Previous block hash value deposit standard block, be linked into main block chain.
Further, step S2 falls into a trap the short hash value of point counting side chain root block, and short hash value is used as authorizes Hash Branch's block is stored in, is specially:Criterion of proof, net load, descriptor, branch in branched chain root block are identified, born only Lotus hash value and timestamp calculate the short hash value of branched chain root block, and using the short hash value of branched chain root block as point The mandate Hash deposits branch block of branch block;
Further, calculate the hash value of branch's block and be deposited into branched chain root block, be specially:According to branch Criterion of proof in block, using the previous block hash value in branch's block, net load hash value, timestamp, criterion of proof, Descriptor, branch's mark, random number and authorize Hash to calculate the hash value of branch block, and using the hash value of branch's block as The previous block hash value deposit branched chain root block of branched chain root block.
Preferably, before the hash value for calculating branch's block, in addition to:Calculate branch's block previous on main block chain Block hash value is simultaneously stored in branch's block, is specially:According to the proof mark of previous block of branch's block on main block chain Standard, is marked using the previous block hash value of previous block, net load hash value, timestamp, criterion of proof, descriptor, branch Know, random number and mandate Hash calculate previous block hash value and be stored in branch's block.
Specifically, in the present embodiment, verify whether branched chain root block is legal in step S3, be specially:
Step F1:Verify branched chain root block previous block hash value whether with branch's block on main block chain Hash value is identical, if identical, performs step F2, otherwise branched chain root block is illegal, and new area is added in branched chain Block fails;
Step F2:Verify branched chain root block short hash value whether with the mandate in branch's block on main block chain Hash is identical, if identical, reads the agreement of branched chain and verifies the validity of branched chain, if it is valid, in branched chain The upper new block success of addition, if invalid, adds new block failure in the branched chain, and otherwise branched chain root block is not It is legal, new block failure is added in branched chain.
Further, in the present embodiment, step F1, be specially:Previous block hash value in branch's block, with Machine number, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, mandate Hash and net load calculate branch Whether the hash value of block, the hash value of checking branch block is identical with the previous block hash value in branched chain root block, if Two values are identical, then perform step F2, otherwise branched chain root block is illegal, and branched chain is considered as invalid;
Further, in the present embodiment, step F2, be specially:According to the net load hash value of branched chain root block, when Between stamp, criterion of proof, descriptor and branch's mark calculate the short hash value of branched chain root block, checking branched chain root block Whether short hash value is identical with the mandate hash value of branch block, if two values are identical, read the agreement of branched chain, otherwise divides Side chain root block is illegal, and branched chain is considered as invalid.
Further, also include before the validity for reading the agreement of branched chain and verifying branched chain:Judge whether to deposit In the equal branched chain root block of the hash value of other another previous block hash values and branch's block, if it is present After length most long branched chain is chosen in the branched chain being connected with branch block as legal branched chain, legal branched chain is read Agreement and verify the validity of legal branched chain, if it does not exist, then directly reading the agreement of branched chain and verifying branched chain Validity.
Specifically, the agreement of branched chain is read, is specially:In branch's block on branched chain root block or main block chain Read the agreement of branched chain.
Specifically, in step S3, the validity of branched chain is verified, is specially:Verify the Hash of all blocks in branched chain Whether value meets the agreement of branched chain;And verify whether the timestamp of all blocks in branched chain meets the agreement of branched chain, such as It is verified, then effectively, otherwise the branched chain is invalid for the branched chain.
More specifically, whether the hash value of all blocks meets the agreement of branched chain in checking branched chain, it is specially:Calculate Whether the hash value of first block in branched chain, the previous block hash value in judgement and next block is identical, if Identical, then first block in branched chain meets the agreement of branched chain, continues to verify whether other blocks in branched chain are full The agreement of sufficient branched chain, as described all blocks in branched chain be unsatisfactory for the agreement of the branched chain and be then considered as invalid;
More specifically, whether the timestamp of all blocks meets the agreement of branched chain in checking branched chain, it is specially:Judge Whether the timestamp of each block meets the form of timestamp as defined in branched chain agreement in branched chain, if it is, branched chain Upper each block meets the agreement of branched chain, and new block is added in branched chain according to the agreement of branched chain, otherwise branch Chain is considered as invalid.
Embodiment two
There is provided a kind of method of work of multi-protocols block chain in the present embodiment, referring to Fig. 1, specific steps include:
Step 101:Wound generation block is created according to criterion of proof, net load, descriptor and branch mark;
Wound generation block is the beginning of main block chain.Specifically, it was demonstrated that standard can be that the proof based on workload is (such as right The requirement of hash value), rights and interests prove, key or other any kind of compliance checks;Net load Rigen is according to different application Demand write-in respective stored data and main block chain on the agreement that performs, can be regular length or variable-length, this In embodiment, so that main block chain performs agreement A as an example, agreement A is the agreement of main block chain acquiescence, decides whether to allow branched chain Establishment, define main block chain block on data storage, carry out main block chain block and branched chain validation verification etc., this Its shared space size is set in embodiment no more than 1Mb;Descriptor describes the size of net load and the information of data;Branch marks Know and determine whether the block allows the presence of branch.
For example, criterion of proof is 258522748404, descriptor is 2224550616, branch's mark 00;Wherein, branch marks Know 00 and represent branchiess standard block, 01 represents that this block allows the presence of branch.
Step 102:Net load hash value is calculated according to the net load of wound generation block;
Specifically, the algorithm for calculating net load hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA- 512nd, SHA-512/224, SHA-512/256, SHA3 etc., can use same algorithm or different algorithms by once or many Secondary calculating obtains net load hash value.
For example, the net load hash value calculated in this embodiment is:
5812db5df9e4782132833dbf88b902b3a0b5ca9961b5705d00c62b947420cf62。
Step 103:For wound generation block addition timestamp;
In the present embodiment, after for wound generation block addition timestamp, wound generation block has been built up, wound generation block such as Fig. 2 institutes Show, including:Random number, net load hash value, timestamp, criterion of proof, net load, descriptor and branch's mark are, it is necessary to say Bright, wound generation block, as the beginning of main block chain, is a special block, not comprising previous block hash value.
Specifically, timestamp have recorded the time of block foundation, it is allowed to have a range of error, distributed network User's examination timestamp can examine whether it is a timestamp forged.
For example, the time for creating wound generation block is 19 seconds mornings 10 point 33 minute of on October 20th, 2016, by the Unix times Stab after changing as 1476930799.
Step 104:Created and marked according to main block chain agreement according to criterion of proof, net load, descriptor and branch mark Quasi- block;
In the present embodiment, the net load of standard block now performs agreement A.
For example, criterion of proof is 258522748404, descriptor is 2224550616, and branch is designated 00.
Step 105:Net load hash value is calculated according to the net load of standard block;
For example, the net load hash value calculated is:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 106:Timestamp is added for standard block;
For example, the time for creating wound generation block is 56 seconds mornings 10 point 55 minute of on October 20th, 2016, by the Unix times Stab after changing as 1476932156.
Step 107:According to the criterion of proof in wound generation block, net load hash value, timestamp, the card of wound generation block are used Bright standard, descriptor, branch's mark and random number calculate the hash value of wound generation block, and are stored in standard block as standard block Previous block hash value;
In the present embodiment, calculate the hash value of wound generation block and be stored in standard block as the previous block of standard block Hash value, standard block has been built up, and standard block is as shown in figure 3, mainly include:It is previous block hash value, random number, net negative Lotus hash value, timestamp, criterion of proof, net load, descriptor and branch's mark, wherein, net load hash value is to net negative Lotus has been cooked what Hash computings were obtained.
Specifically, change the value of random number by constantly adjusting in the present embodiment, calculate having for certificate of compliance standard Imitate the hash value of branch's block.Calculating the algorithm of hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA- 512nd, SHA-512/224, SHA-512/256, SHA3 etc., can use same algorithm or different algorithms by once or many Secondary calculating obtains creating the hash value of generation block.
For example, random number is:2199601046, calculating the obtained hash value of wound generation block is:
b27a85ced3ae9e22b5f4066790a9954fa72cf320a9dfcea9257190c5a21ff925。
According to the method for above-mentioned establishment standard block, user can constitute a main block according to multiple standard blocks are created Chain.
Step 108:Branch's block is created according to criterion of proof, net load, descriptor and branch mark;
In the present embodiment, the agreement write in the net load of branch's block is identical with the agreement of branched chain, but area of branch Block still carries out the agreement of main block chain, i.e., that branch's block write-in in the present embodiment is agreement B, but still performs agreement A.
For example, criterion of proof is:258522748404, descriptor is:2224550616, branch is designated:01.
Step 109:Net load in branch's block calculates net load hash value;
For example, the net load calculating net load hash value of branch's block is:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 110:For branch's block addition timestamp;
For example, the time for creating branch's block is 12 seconds mornings 11 point 10 minute of on October 20th, 2016, by the Unix times Stab after changing as 1476933012.
Step 111:According to the criterion of proof in standard block, the previous block hash value in standard block, net is used Load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number calculate the hash value of standard regions block, and are stored in Branch's block as branch's block previous block hash value;
For example, random number is:927bf6aeb9, calculate the hash value of standard block is:
e1b7efc6c6aeb73eb608d38b144da3077f74c6060e6aaa6a400ce7a5f59e9783。
Step 112:Branched chain root block is created according to criterion of proof, net load, descriptor and branch mark;
In the present embodiment, in net load in the data and branched chain of the demand write-in respective stored of with good grounds different application The agreement of execution, writes in the agreement that branched chain needs to perform, the present embodiment in the net load of branched chain root block, with branch Chain is performed exemplified by agreement B, the branched chain that agreement B is applied to branched chain root block and is next connected to after branched chain root block Lu Zhong.
If for example, the branch in system replicates one and by the branched root block of legal authorization by fraudulent copying Duplicate block, system can ignore the duplication block automatically.Even if to add new block, system after the block of duplication Will be considered that new block is to be linked at by the branched root block of legal authorization.
For example, criterion of proof is:374820264590, descriptor is:371829340297 and branch mark 00.
Step 113:Net load in branched chain root block calculates net load hash value;
For example, net load hash values are:
896be254c089dae7b66b50275551927037ce0cc83e74839738fdbfca82d1ff3d。
Step 114:Timestamp is added for branched chain root block;
For example, the time for creating branched chain root block is 28 seconds mornings 11 point 26 minute of on October 20th, 2016, by Unix Timestamp change after into 1476933988.
Step 115:Criterion of proof, net load, descriptor, branch's mark in branched chain root block, net load Hash value and timestamp calculate the short hash value of branched chain root block, and regard short hash value deposit branch's block as area of branch The mandate Hash of block;
In the present embodiment, the short hash value of branched chain root block is used as mandate Hash deposits branch block, branch's block Build up.
For example, calculate the short hash value of branched chain root block is:
ef96b09775ba3b3341f9832a608948151ee0027e690c8672a476351a9f7625d。
Step 116:According to the criterion of proof in branch's block, the previous block hash value of branch's block, net negative is used Lotus hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and the Hash for authorizing Hash calculating branch block Value, is used as the previous block hash value of branched chain root block;
Specifically, change the value of random number by constantly adjusting in the present embodiment, calculate having for certificate of compliance standard Imitate the hash value of branch's block.
For example, random number is:The hash value of 2d06607889, Suan get branch block is:
c61845fde8183851d88062e38419f08ab36f54dbfb74bca8e01675bfa765d854
In the present embodiment, the hash value of branched chain root block storage branch block is used as the previous area of branched chain root block Block hash value, branched chain root block has been built up.The hash value of branch's block as branched chain root block previous block Hash Value, completes the process of both sides' reference, it is ensured that branched chain root block is one of the branch's block effective branch being certified.Branch The schematic diagram that the related data of block and branched chain root block is mutually quoted is as shown in Figure 4.
User can according to the demand of own service, according to the method described above, according to the agreement of branched chain continue on side chain after Continuous establishment standard block, realizes that step is described in detail in embodiment three.
For example, in the present embodiment, the schematic diagram for creating the block chain of an effective branched chain is as shown in Figure 5.Main block chain What is existed inside the net load of standard block is what is existed inside agreement A, the net load of branched chain root block (or branch's block) It is the agreement B of branched chain, the main block chain for performing agreement A and the branch link for performing agreement B are considered as active link.
Embodiment three
In the present embodiment, branched chain root block also can be as can create on the branched chain root block of branch's block, i.e., one The branched chain of a plurality of different agreement.The implementation method of the block chain of a plurality of branched chain and various protocols is created, referring to Fig. 6, specifically Step includes:
Step 201:Wound generation block is created according to criterion of proof, net load, descriptor and branch mark;
Wound generation block is the beginning of main block chain.Specifically, it was demonstrated that standard can be that the proof based on workload is (such as right The requirement of hash value), rights and interests prove, key or other any kind of compliance checks;Net load Rigen is according to different application Demand write-in respective stored data and branched chain on the agreement that performs, can be regular length or variable-length, this reality Apply in example, so that main block chain performs agreement A as an example, agreement A is the agreement of main block chain acquiescence, decide whether to allow branched chain Create, define the storage of data on main block chain block, carry out main block chain block and branched chain validation verification etc.;Descriptor The size of net load and the information of data are described;Branch's mark determines whether the block allows the flag bit that there is branch.
For example, criterion of proof is 258522748404, descriptor is 2224550616, branch's mark 00;Wherein, branch marks Know 00 and represent branchiess standard block, 01 represents that this block allows the presence of branch.
Step 202:Net load in wound generation block calculates net load hash value;
Specifically, the algorithm for calculating net load hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA- 512nd, SHA-512/224, SHA-512/256, SHA3 etc., can use same algorithm or different algorithms by once or many Secondary calculating obtains net load hash value.
For example, the net load hash value calculated in this embodiment is:
5812db5df9e4782132833dbf88b902b3a0b5ca9961b5705d00c62b947420cf62。
Step 203:For wound generation block addition timestamp;
In the present embodiment, after for wound generation block addition timestamp, wound generation block has been built up.Specifically, time stab The time of block foundation is recorded, it is allowed to have a range of error, user's examination timestamp of distributed network can examine it Whether it is a timestamp forged.
For example, the time for creating wound generation block is 19 seconds mornings 10 point 33 minute of on October 20th, 2016, by the Unix times Stab after changing as 1476930799.
Step 204:Created and marked according to main block chain agreement according to criterion of proof, net load, descriptor and branch mark Quasi- block;
For example, criterion of proof is 258522748404, descriptor is 2224550616, and branch is designated 00.
Step 205:Net load in standard block calculates net load hash value;
In the present embodiment, the net load of standard block now performs agreement A.
For example, the net load hash value calculated is:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 206:Timestamp is added for standard block;
For example, the time for creating wound generation block is 56 seconds mornings 10 point 55 minute of on October 20th, 2016, by the Unix times Stab after changing as 1476932156.
Step 207:According to wound generation block in criterion of proof, using wound generation block in net load hash value, timestamp, Criterion of proof, descriptor, branch's mark and random number calculate the hash value of wound generation block, and are stored in standard block as standard regions The previous block hash value of block;
Specifically, change the value of random number by constantly adjusting in the present embodiment, calculate having for certificate of compliance standard Imitate the hash value of branch's block.Calculating the algorithm of hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA- 512nd, SHA-512/224, SHA-512/256, SHA3 etc., can use same algorithm or different algorithms by once or many Secondary calculating obtains creating the hash value of generation block.
For example, random number is:2199601046, calculating the obtained hash value of wound generation block is:
b27a85ced3ae9e22b5f4066790a9954fa72cf320a9dfcea9257190c5a21ff925。
According to the method for above-mentioned establishment standard block, user can constitute a main block according to multiple standard blocks are created Chain.
Step 208:Branch's block is created according to criterion of proof, net load, descriptor and branch mark;
In the present embodiment, the agreement write in the net load of branch's block is identical with the agreement of branched chain, but area of branch Block still carries out the agreement of main block chain, i.e., that branch's block write-in in the present embodiment is agreement B, but still performs agreement A.
For example, criterion of proof is:258522748404, descriptor is:2224550616, branch is designated:01.
Step 209:Net load in branch's block calculates net load hash value;
For example, the net load calculating net load hash value of branch's block is:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 210:For branch's block addition timestamp;
For example, the time for creating branch's block is 12 seconds mornings 11 point 10 minute of on October 20th, 2016, by the Unix times Stab after changing as 1476933012.
Step 211:According to the criterion of proof in standard block, the previous block hash value of standard block, net negative is used Lotus hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and the Hash for authorizing Hash calculating standard blocks Value, and branch's block is stored in as the previous block hash value of branch's block;
For example, random number is:927bf6aeb9, calculate the hash value of standard block is:
e1b7efc6c6aeb73eb608d38b144da3077f74c6060e6aaa6a400ce7a5f59e9783。
Step 212:Branched chain root block is created according to criterion of proof, net load, descriptor and branch mark;
In the present embodiment, net load Rigen writes in the data and branched chain of respective stored according to the demand of different application and held Capable agreement, writes in the agreement that branched chain needs to perform, the present embodiment in the net load of branched chain root block, with branched chain Perform exemplified by agreement B, agreement B is applied to branched chain root block and the following branch link being connected to after branched chain root block In.
If for example, the branch in system replicates one and by the branched root block of legal authorization by fraudulent copying Duplicate block, system can ignore clone's block automatically.Even if to add new block, system after the block of clone Will be considered that new block is to be linked at by the branched root block of legal authorization.
For example, criterion of proof is:374820264590, descriptor is:371829340297 and branch mark 01.
Step 213:Net load in branched chain root block calculates net load hash value;
For example, net load hash values are:
896be254c089dae7b66b50275551927037ce0cc83e74839738fdbfca82d1ff3d。
Step 214:Timestamp is added for branched chain root block;
For example, the time for creating branched chain root block is 28 seconds mornings 11 point 26 minute of on October 20th, 2016, by Unix Timestamp change after into 1476933988.
Step 215:According to the criterion of proof in branch's block, the previous block hash value in branch's block, net is used Load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and the Hash for authorizing Hash calculating branch block Value, and branched chain root block is stored in as the previous block hash value of branched chain root block;
For example, random number is:The hash value of 2d06607889, Suan get branch block is:
a36fce8c4f207bd2c022013b85e8ea08b5749467443e5f6f16535679edbdb564
It should be noted that can be continued to continue establishment standard block on side chain according to the agreement of branched chain root block, in detail Thin step will not be repeated here as shown in embodiment three.
Step 216:Branched root branch block is created according to criterion of proof, net load, descriptor and branch mark;
In the present embodiment, net load Rigen writes in the data and branched chain of respective stored according to the demand of different application and held Capable agreement, writes the agreement that branched chain needs to perform in the net load of branched root branch block.User can be according to reality Situation creates multiple branched root branches block, in the present embodiment, exemplified by creating Liang Ge branched roots branch block.The present embodiment In, two branched chains perform agreement C, agreement D respectively, and agreement C and agreement D are respectively applied to branched root branch block and following It is connected in the branch link after branched root branch block.
For example, the criterion of proof of first branched root branch block is:8d3b1be98445, descriptor is: 473044022075, branch is designated:00.
Step 217:Net load in branched root branch block calculates net load hash value;
For example, the net load hash value of branched root branch block is:
038edfbcd15127659e167c8bb9c991ae5befbeeb4dc35cce4912c67abf915c62。
Step 218:For branched root branch block addition timestamp;
For example, the creation time of branched root branch block is 8 seconds mornings 11 point 38 minute of on October 20th, 2016, by Unix Timestamp change after into 1476934688.
Step 219:Criterion of proof, net load, descriptor, branch's mark in branched root branch block, net load Hash value and timestamp calculate the short hash value of branched root branch block, and short hash value is stored in into branch's chain component block work For the mandate Hash of branch's chain component block;
For example, the short hash value of branched root branch block is:
05f7d42fb70c4430d3bb164f58c1c847cc8fe877356432042ef0e83ee01d24d7
Step 220:According to the criterion of proof in branched chain root block, the previous block in branched chain root block is used Hash value, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and mandate Hash calculate branch The hash value of chain root block, and branched root branch block is stored in as the previous block hash value of branched root branch block;
In the present embodiment, the hash value of branched root branch block storage branched chain root block is used as branched root branch block Previous block hash value after, branched root branch block has been built up.
For example, random number is:2199601046, the hash value of branched chain root block is:
038edfbcd15127659e167c8bb9c991ae5befbeeb4dc35cce4912c67abf915c62
User can continue establishment standard block according to actual conditions after branched root branch block.Detailed step such as embodiment Shown in four, it will not be repeated here.
For example, creating the block chain of a plurality of effective branched chain, schematic diagram is as shown in Figure 7.Branch's block and branch are created After chain root block, Liang Ge branched roots branch block is created according to agreement, two effective branched chains perform agreement C and D respectively.
Example IV
A kind of flow chart that standard block is created in branched chain is provided in the present embodiment, referring to Fig. 8, is specifically included:
Step 301:Whether the previous block hash value for verifying branched chain root block is that it is connected on main block chain The hash value of branch's block, if it is, performing step 302, otherwise branched chain is invalid, terminates;
Specifically, in the present embodiment, according to the previous block Hash of the branch's block created, random number, net Load hash value, timestamp, criterion of proof, descriptor, branch's mark, mandate Hash, net load are according to establishment branched chain root area The algorithm of previous block hash value is calculated during block, the hash value of branch's block is calculated again, and with before branched chain root block One block hash value is compared, if two values are equal, performs step 302, otherwise, the branch where branched chain root block Chain is invalid, terminates.
Step 302:Whether the short hash value for verifying branched chain root block is that it is connected in branch's block of main block chain Mandate Hash, if it is, perform step 303, otherwise branched chain is invalid, terminate;
Specifically, in the present embodiment, according to the net load hash value of branched chain root block, timestamp, criterion of proof, retouch Symbol, branch's mark are stated according to the algorithm that branched chain root block short Hash is calculated when creating branch's block, branched chain root is calculated again The short hash value of block, and contrasted with the mandate hash value of branch block, if two values are equal, step 303 is performed, it is no Then, the branched chain where branched chain root block is invalid, terminates.
Step 303:Judge whether also to there are other previous block hash values and the hash value of branch's block is equal Branched chain root block, is then, length most long branched chain to be chosen in the branched chain being connected with branch block as legal branch Chain, performs step 304, otherwise, branched chain root block is legal, continues executing with step 304;
Step 304:Branched chain is read from the net load of branch's block of legal branched chain root block or main block chain Agreement;
In the present embodiment, the agreement of branched chain may reside on branch's block, can also be present in branched root block On.
Step 305:Whether the hash value of all blocks meets the agreement of branched chain in checking branched chain, is to perform step 306, otherwise branched chain is invalid, terminates.
In the present embodiment, a series of requirements such as the algorithm of calculation block hash value are defined inside the agreement of branched chain, Judge according to calculation block hash value as defined in branched chain agreement the counted block hash value of algorithm and there is next block Previous block hash value it is whether identical, if identical, meet the agreement of branched chain, continue executing with step 306, otherwise, This branched chain is invalid, terminates.
Step 306:Whether the timestamp of all blocks meets the agreement of branched chain in checking branched chain, is that branched chain has Effect, continues executing with step 307, otherwise branched chain is invalid, terminates.
In the present embodiment, a series of requirements such as the form of timestamp are defined inside the agreement of branched chain, branch is judged Whether the timestamp of each block meets the regulation of branched chain agreement on chain, if it is satisfied, then step 306 is continued executing with, otherwise, This branched chain is invalid, terminates.
Step 307:New standard block is added in effective branch's chain end according to the agreement of branched chain.
Specifically, the step of standard block of establishment is described in detail in embodiment one and embodiment two, herein no longer Repeat.
Embodiment five
A kind of device of multi-protocols block chain is present embodiments provided, as shown in figure 9, device includes:
First creation module 401, for creating wound generation block and creating standard block according to the agreement of wound generation block;
First computing module 402, the hash value for calculating wound generation block;
First memory module 403, the hash value deposit first of the wound generation block for the first computing module 402 to be obtained is created The standard block that block 401 is created is modeled, main block chain is linked into;
First add module 404, block is added for the agreement according to wound generation block on main block chain;
Second creation module 405, for creating branch's block on main block chain, and creates branched chain root block;
Second computing module 406, the short hash value for calculating branched chain root block;
Second memory module 407, for the short hash value that obtains the second computing module 406 as authorizing Hash deposits the In branch's block that two creation modules 405 are created;
3rd computing module 408, the hash value for calculating branch's block;
3rd memory module 409, the hash value deposit second of branch's block for the 3rd computing module 408 to be obtained is created Model in the branched chain root block that block 405 is created, be linked into branched chain;
First authentication module 410, for when that need to add new block in branched chain, whether checking branched chain root block It is legal;
Read module 411, for when the first authentication module 410 checking branched chain root block is legal, reading branched chain Agreement;
Second authentication module 412, the validity of the agreement for verifying the branched chain that read module 411 is read;
Second add module 413, for when the second authentication module verify 412 branched chains agreement it is effective when, according to point The agreement of side chain adds new block in branched chain.
Specifically, in the present embodiment, the first creation module, is specifically included:First creating unit, the first computing unit, First adding device, the second creating unit, the second computing unit, the second adding device, the 3rd creating unit, the 3rd computing unit With the 3rd adding device;
First creating unit, for creating wound generation block according to criterion of proof, net load, descriptor and branch mark;
First computing unit, the net load Hash of generation block is created for being calculated according to the net load for creating the first creating unit Value;
First adding device, for adding timestamp for wound generation block;
Second creating unit, for being identified according to criterion of proof, net load, descriptor and branch according to wound generation block Agreement creates standard block;
Second computing unit, the net load hash value for calculating standard block according to the net load of standard block;
Second adding device, for adding timestamp for standard block;
3rd creating unit, for being identified according to criterion of proof, net load, descriptor and branch according to wound generation block Agreement creates branch's block;
3rd computing unit, the net load hash value for calculating branch's block according to the net load of branch's block;
3rd adding device, for adding timestamp for branched chain root block.
Specifically, the second creation module, is specifically included:4th creating unit, the 4th computing unit and the 4th add module;
4th creating unit, for creating branched chain root area according to criterion of proof, net load, descriptor and branch mark Block;
4th computing unit, the net load of the branched chain root block for being created according to the 4th creating unit calculates branched chain The net load hash value of root block;
4th add module, for adding timestamp for branched chain root block.
Further, the first computing module, specifically for the criterion of proof according to wound generation block, using in wound generation block Net load hash value, timestamp, criterion of proof, descriptor, branch's mark and random number calculate the hash value of wound generation block;
First memory module, the hash value of the wound generation block specifically for the first computing unit is calculated is used as standard block Previous block hash value deposit standard block, be linked into main block chain.
Further, the second computing module, specifically for:Criterion of proof, net load in branched chain root block, retouch State the short hash value that symbol, branch's mark, net load hash value and timestamp calculate branched chain root block;
Specifically, the second memory module, specifically for:The short Hash for the branched chain root block that second computing module is calculated It is worth and is stored in branch's block as the mandate Hash of branch's block;
Specifically, the 3rd computing module, specifically for:According to the criterion of proof of branch's block, using in branch's block Previous block hash value, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and mandate Hash Calculate the hash value of branch's block;
Specifically, the 3rd memory module, specifically for:Using the 3rd computing module calculate branch's block hash value as The previous block hash value deposit branched chain root block of branched chain root block.
Preferably, the present apparatus also includes:4th computing module and the 4th memory module;
4th computing module, for the criterion of proof in previous block of branch's block on main block chain, makes With the previous block hash value in previous block of branch's block on main block chain, net load hash value, timestamp, proof Standard, descriptor, branch's mark, random number and mandate Hash calculate previous block hash value;
4th memory module, the previous block hash value for the 4th computing module to be calculated is stored in branch's block.
Further, authentication module includes:First authentication unit and the second authentication unit;
First authentication unit, for verify the previous block hash value in branched chain root block whether with main block chain The hash value of branch's block is identical;
Second authentication unit, previous block hash value and primary area for verifying branched chain root block when the first authentication unit When the hash value of branch's block on block chain is identical, verify branched chain root block short hash value whether with main block chain point Mandate Hash in branch block is identical;
Specifically, read module, short hash value and master specifically for verifying branched chain root block when the second authentication unit When the mandate Hash in branch's block on block chain is identical, the agreement of branched chain is read.
Further, the first authentication unit includes:First computation subunit and the first checking subelement, the second checking are single Member includes:Second computation subunit and the second checking subelement;
First computation subunit, for previous block hash value, random number, the net load Hash in branch's block Value, timestamp, criterion of proof, descriptor, branch's mark, mandate Hash and net load calculate the hash value of branch's block;
First checking subelement, for verify the first computation subunit calculate the obtained hash value of branch's block whether with The previous block hash value of branched chain root block is identical;
Second computation subunit, for verifying that the first computation subunit calculates obtained area of branch when the first checking subelement When the hash value of block is identical with the previous block hash value of branched chain root block, according to the net load Hash of branched chain root block Value, timestamp, criterion of proof, descriptor and branch's mark calculate the short hash value of branched chain root block;
Second checking subelement, for verifying that the second computation subunit calculates the short hash value of obtained branched chain root block It is whether identical with the mandate hash value of branch block;
Read module, specifically for when the second checking subelement checking is identical with the mandate hash value of branch block, reading Take the agreement of branched chain simultaneously.
Further, device also includes:Judge module and selecting module;
Judge module, for judging whether that the hash value of other previous block hash values and branch's block is equal Branched chain root block;
Selecting module, for judging the hash value in the presence of another previous block hash value and branch's block when judge module During equal branched chain root block, length most long branched chain is chosen in the branched chain being connected with branch block as legal point Side chain;
Read module, is additionally operable to after selecting module chooses length most long branched chain as legal branched chain, read and close The agreement of method branched chain.
Read module, the association specifically for reading branched chain in branch's block on branched chain root block or main block chain View.
Specifically, authentication module includes:3rd authentication unit and the 4th authentication unit;
3rd authentication unit, for verifying whether the hash value of all blocks in branched chain meets the agreement of branched chain;
4th authentication unit, for verifying whether the timestamp of all blocks in branched chain meets the agreement of branched chain.
Further, the 3rd authentication unit includes:3rd computation subunit, the first judgment sub-unit and the 3rd checking are single Member;
3rd computation subunit, the hash value for calculating first block in branched chain;
First judgment sub-unit, for judging that the 3rd computation subunit calculates the hash value of first block in branched chain It is whether identical with previous block hash value in next block;
3rd checking subelement, for judging the in the 3rd computation subunit calculating branched chain when the first judgment sub-unit When the hash value of one block is identical with the previous block hash value in next block, next block in checking branched chain Whether the agreement of branched chain is met;
4th authentication unit, including the second judgment sub-unit and addition subelement;
Second judgment sub-unit, for judging whether the timestamp of each block in branched chain meets branched chain agreement regulation Timestamp form;
Subelement is added, for judging that the timestamp of each block in branched chain is satisfied by branch when the second judgment sub-unit As defined in chain agreement during the form of timestamp, new block is added in branched chain according to the agreement of branched chain.
The foregoing is only a preferred embodiment of the present invention, but protection scope of the present invention be not limited thereto, Any one skilled in the art the invention discloses technical scope in, change or replacement can be readily occurred in, all It should be included within the scope of the present invention.Therefore, protection scope of the present invention should be defined by scope of the claims.

Claims (24)

1. a kind of method of work of multi-protocols block chain, it is characterised in that methods described includes:
Step S1:Wound generation block is created, and standard block is created according to the agreement of wound generation block;Calculate the hash value of wound generation block And the standard block is deposited into, main block chain is linked into, and according to the agreement for creating generation block in the main block chain Upper addition block;
Step S2:When there is new business demand, branch's block is created on the main block chain, and create branched chain root area Block;The short hash value of the branched chain root block is calculated, and the area of branch is stored in using the short hash value as mandate Hash Block;Calculate the hash value of branch's block and be deposited into the branched chain root block, be linked into branched chain;
Step S3:When needing to add new block in the branched chain, verify whether the branched chain root block is legal, such as It is really illegal, then new block failure is added in the branched chain, if legal, the agreement of the branched chain read and tests The validity of the branched chain is demonstrate,proved, if branched chain effectively, is added according to the agreement of the branched chain in the branched chain New block, if branched chain is invalid, adds new block failure in the branched chain.
2. according to the method described in claim 1, it is characterised in that
It is described to create wound generation block, be specially:Chuan Shi areas are created according to criterion of proof, net load, descriptor and branch mark Block, calculates net load hash value, and be the wound generation block addition timestamp according to the net load;
It is described to create standard block according to agreement as defined in the wound generation block, be specially:According to criterion of proof, net load, retouch State symbol and branch's mark creates standard block according to the agreement of wound generation block, net load Hash is calculated according to the net load Value, and add timestamp for the standard block;
It is described that branch's block is created on the main block chain, be specially:According to criterion of proof, net load, descriptor and point Branch mark creates branch's block according to the agreement of wound generation block, calculates net load hash value according to the net load, and be described Branch's block addition timestamp.
3. according to the method described in claim 1, it is characterised in that the establishment branched chain root block, it is specially:According to proof Standard, net load, descriptor and branch's mark create branched chain root block, and net load Hash is calculated according to the net load Value, and add timestamp for the branched chain root block.
4. according to the method described in claim 1, it is characterised in that in the step S1, the Hash for calculating wound generation block It is worth and is deposited into the standard block, be linked into main block chain, is specially:Using wound generation block in net load hash value, Timestamp, criterion of proof, descriptor, branch's mark and random number calculate the hash value of wound generation block, by the wound generation block Hash value is stored in the standard block as the previous block hash value of the standard block, is linked into main block chain.
5. according to the method described in claim 1, it is characterised in that in the step S2, described calculate the branched chain root area The short hash value of block, and be specially as authorizing Hash to be stored in branch's block using the short hash value:According to the branch Criterion of proof, net load, descriptor, branch's mark, net load hash value and timestamp in chain root block calculate described point The short hash value of side chain root block, and using the short hash value of the branched chain root block as branch's block mandate Hash It is stored in branch's block;
The hash value for calculating branch's block is simultaneously deposited into the branched chain root block, is specially:According to area of branch Criterion of proof in block, is marked using the previous block hash value in branch's block, net load hash value, timestamp, proof Standard, descriptor, branch's mark, random number and Hash is authorized to calculate the hash value of branch's block, and by branch's block Hash value as the previous block hash value of the branched chain root block be stored in the branched chain root block.
6. method according to claim 5, it is characterised in that before the hash value of calculating branch's block, also Including:Calculate previous block hash value of the branch's block on main block chain and be deposited into branch's block, be specially:Root According to the criterion of proof of previous block of the branch's block on main block chain, the previous area in the previous block is used Block hash value, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and mandate Hash calculate institute State previous block hash value and be stored in branch's block.
7. method according to claim 5, it is characterised in that in the step S3, the checking branched chain root area Whether block is legal, is specially:
Step F1:Verify previous block hash value in the branched chain root block whether with the area of branch on the main block chain The hash value of block is identical, if identical, performs step F2, otherwise the branched chain root block is illegal, in the branched chain The new block failure of upper addition;
Step F2:Verify the branched chain root block short hash value whether with awarding in branch's block on the main block chain Weigh Hash identical, if identical, read the agreement of the branched chain and verify the validity of the branched chain, if effectively, New block success is then added in the branched chain, if invalid, new block failure is added in the branched chain, otherwise The branched chain root block is illegal, and new block failure is added in the branched chain.
8. method according to claim 7, it is characterised in that the step F1, is specially:According in branch's block Previous block hash value, random number, net load hash value, timestamp, criterion of proof, descriptor, branch mark, authorize Hash And net load calculates the hash value of branch's block, verify branch's block hash value whether with the branched chain root Previous block hash value in block is identical, if two values are identical, performs step F2, otherwise branched chain root block is illegal, The branched chain is considered as invalid;
The step F2, be specially:According to the net load hash value of the branched chain root block, timestamp, criterion of proof, description Symbol and branch's mark calculate the short hash value of the branched chain root block, and verifying the short hash value of the branched chain root block is It is no identical with mandate hash value in branch's block, if identical, the agreement of the branched chain is read, otherwise branched chain root Block is illegal, and the branched chain is considered as invalid.
9. method according to claim 7, the agreement of the reading branched chain simultaneously verifies the effective of the branched chain Also include before property:Judge whether the equal branched chain root of the hash value of other previous block hash values and branch's block Block, if it is present choosing length most long branched chain in the branched chain being connected with branch's block as legal point Side chain, reads the agreement of the legal branched chain and verifies the validity of the legal branched chain, if it does not exist, then directly reading Take the agreement of the branched chain and verify the validity of the branched chain.
10. according to the method described in claim 1, it is characterised in that the agreement for reading the branched chain, it is specially:From The agreement of branched chain is read in branch's block on the branched chain root block or main block chain.
11. according to the method described in claim 1, it is characterised in that in the step S3, described verify having for the branched chain Effect property, be specially:Verify whether the hash value of all blocks in the branched chain meets the agreement of branched chain;And verify described point Whether the timestamp of all blocks meets the agreement of branched chain on side chain, is such as verified, then the branched chain is effective, otherwise The branched chain is invalid.
12. method according to claim 11, it is characterised in that the Hash of all blocks in the checking branched chain Whether value meets the agreement of branched chain, is specially:The hash value of first block in the branched chain is calculated, is judged and next Whether the previous block hash value in individual block is identical, if identical, and first block in the branched chain meets described The agreement of branched chain, continues to verify the agreement whether other blocks in the branched chain meet the branched chain, divides as described All blocks on side chain are unsatisfactory for the agreement of the branched chain, and then the branched chain is considered as invalid;
Whether the timestamp of all blocks meets the agreement of branched chain in the checking branched chain, is specially:Judge respectively Whether the timestamp of each block is satisfied by the form of timestamp as defined in branched chain agreement in the branched chain, if it is, Current block meets the agreement of branched chain in the branched chain, and is added according to the agreement of branched chain in the branched chain newly Block, then the timestamp of each block is unsatisfactory for the form of timestamp as defined in branched chain agreement then institute in branched chain as described State branched chain and be considered as invalid.
13. a kind of equipment of multi-protocols block chain, it is characterised in that described device includes:
First creation module, for creating wound generation block and creating standard block according to the agreement of wound generation block;
First computing module, the hash value for calculating the wound generation block;
First memory module, the hash value of the wound generation block for first computing module to be obtained is stored in the standard Block, is linked into main block chain;
First add module, block is added for the agreement according to the wound generation block on the main block chain;
Second creation module, divides for when there is new business demand, creating branch's block on the main block chain, and creating Side chain root block;
Second computing module, the short hash value for calculating the branched chain root block;
Second memory module, the short hash value for second computing module to be obtained is described as authorizing Hash to be stored in Branch's block;
3rd computing module, the hash value for calculating branch's block;
3rd memory module, for the hash value deposit described second for the branch's block for obtaining the 3rd computing module In the branched chain root block that creation module is created, branched chain is linked into;
First authentication module, for when needing to add new block in the branched chain, verifying the branched chain root block It is whether legal;
Read module, for when first authentication module verifies that the branched chain root block is legal, reading the branched chain Agreement;
Second authentication module, the validity for verifying the branched chain that the read module is read;
Second add module, for verified when second authentication module branched chain agreement it is effective when, according to described The agreement of branched chain adds new block in the branched chain.
14. device according to claim 13, it is characterised in that first creation module, is specifically included:First creates Unit, the first computing unit, the first adding device, the second creating unit, the second computing unit, the second adding device, the 3rd wound Build unit, the 3rd computing unit and the 3rd adding device;
First creating unit, for creating wound generation block according to criterion of proof, net load, descriptor and branch mark;
First computing unit, the net of generation block is created for being calculated according to the net load for creating first creating unit Load hash value;
First adding device, for adding timestamp for the wound generation block;
Second creating unit, for being identified according to criterion of proof, net load, descriptor and branch according to wound generation block Agreement creates standard block;
Second computing unit, the net load hash value for calculating standard block according to the net load of the standard block;
Second adding device, for adding timestamp for the standard block;
3rd creating unit, for being identified according to criterion of proof, net load, descriptor and branch according to wound generation block Agreement creates branch's block;
3rd computing unit, the net load hash value for calculating branch's block according to the net load of branch's block;
3rd adding device, for adding timestamp for branch's block.
15. device according to claim 13, it is characterised in that second creation module, is specifically included:4th creates Unit, the 4th computing unit and the 4th add module;
4th creating unit, for creating branched chain root area according to criterion of proof, net load, descriptor and branch mark Block;
4th computing unit, the net load of the branched chain root block for being created according to the 4th creating unit, which is calculated, to be divided The net load hash value of side chain root block;
4th add module, for adding timestamp for the branched chain root block.
16. device according to claim 13, it is characterised in that first computing module, specifically for according to wound generation The criterion of proof of block, using wound generation block in net load hash value, timestamp, criterion of proof, descriptor, branch mark and Random number calculates the hash value of wound generation block;
First memory module, specifically for the hash value of wound generation block that calculates first computing unit as described The previous block hash value of standard block is stored in the standard block, is linked into main block chain.
17. device according to claim 13, it is characterised in that second computing module, specifically for:According to described Criterion of proof, net load, descriptor, branch's mark, net load hash value and timestamp in branched chain root block calculate institute State the short hash value of branched chain root block;
Second memory module, specifically for:By the short of the branched chain root block of second computing module calculating Hash value is stored in branch's block as the mandate Hash of branch's block;
3rd computing module, specifically for:According to the criterion of proof of branch's block, using previous in branch's block Block hash value, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and mandate Hash are calculated The hash value of branch's block;
3rd memory module, specifically for:The hash value for branch's block that 3rd computing module is calculated is made The branched chain root block is stored in for the previous block hash value of the branched chain root block.
18. device according to claim 17, it is characterised in that also include:4th computing module and the 4th memory module;
4th computing module, for the proof mark in previous block of the branch's block on main block chain Standard, using the previous block hash value in previous block of the branch's block on main block chain, net load hash value, when Between stamp, criterion of proof, descriptor, branch's mark, random number and authorize Hash to calculate the previous block hash value;
4th memory module, for previous described point of the block hash value deposit for calculating the 4th computing module Branch block.
19. device according to claim 17, it is characterised in that the authentication module includes:First authentication unit and Two authentication units;
First authentication unit, for verify the previous block hash value in the branched chain root block whether with the primary area The hash value of branch's block on block chain is identical;
Second authentication unit, the previous block Hash for verifying the branched chain root block when first authentication unit When value is identical with the hash value of branch's block on the main block chain, whether the short hash value of the checking branched chain root block It is identical with the mandate Hash in branch's block on the main block chain;
The read module, short hash value and institute specifically for verifying the branched chain root block when second authentication unit State mandate Hash in branch's block on main block chain it is identical when, read the agreement of the branched chain.
20. device according to claim 19, it is characterised in that first authentication unit includes:First calculates son list Member and the first checking subelement, second authentication unit include:Second computation subunit and the second checking subelement;
First computation subunit, for previous block hash value, random number, the net load in branch's block Hash value, timestamp, criterion of proof, descriptor, branch's mark, mandate Hash and net load calculate branch's block Hash value;
The first checking subelement, for verifying that first computation subunit calculates the Hash of obtained branch's block Whether value is identical with the previous block hash value of the branched chain root block;
Second computation subunit, is obtained for verifying that first computation subunit is calculated when the described first checking subelement Branch's block hash value it is identical with the previous block hash value of the branched chain root block when, according to the branched chain Net load hash value, timestamp, criterion of proof, descriptor and the branch's mark of root block calculate the branched chain root block Short hash value;
The second checking subelement, for verifying that second computation subunit calculates the obtained branched chain root block Whether short hash value is identical with the mandate hash value of branch's block;
The read module, specifically for when the described second checking subelement checking and the mandate hash value phase of branch's block Meanwhile, read the agreement of the branched chain.
21. device according to claim 19, it is characterised in that also include:Judge module and selecting module;
The judge module, for judging whether that the hash value of other previous block hash values and branch's block is equal Branched chain root block;
The selecting module, for judging when the judge module in the presence of another previous block hash value and branch's block During the equal branched chain root block of hash value, length most long branched chain is chosen in the branched chain being connected with branch's block It is used as legal branched chain;
The read module, is additionally operable to after the selecting module chooses length most long branched chain as legal branched chain, read Take the agreement of the legal branched chain.
22. device according to claim 13, it is characterised in that the read module, specifically for when the checking mould When block verifies that the branched chain root block is legal, read and divide in branch's block on the branched chain root block or main block chain The agreement of side chain.
23. device according to claim 13, it is characterised in that the authentication module includes:3rd authentication unit and Four authentication units;
3rd authentication unit, for verifying whether the hash value of all blocks in the branched chain meets the association of branched chain View;
4th authentication unit, for verifying whether the timestamp of all blocks in the branched chain meets the association of branched chain View.
24. device according to claim 23, it is characterised in that the 3rd authentication unit includes:3rd calculates son list Member, the first judgment sub-unit and the 3rd checking subelement;
3rd computation subunit, the hash value for calculating first block in the branched chain;
First judgment sub-unit, for judging that the 3rd computation subunit calculates first block in the branched chain Hash value and next block in previous block hash value it is whether identical;
The 3rd checking subelement, for judging that the 3rd computation subunit calculating is described when first judgment sub-unit When the hash value of first block in branched chain is identical with the previous block hash value in next block, the branch is verified Whether next block on chain meets the agreement of the branched chain;
4th authentication unit, including the second judgment sub-unit and addition subelement;
Second judgment sub-unit, for judging whether the timestamp of each block in the branched chain meets branched chain agreement The form of defined timestamp;
The addition subelement, for judging that the timestamp of each block in the branched chain is equal when second judgment sub-unit When meeting the form of timestamp as defined in branched chain agreement, new area is added in the branched chain according to the agreement of branched chain Block.
CN201710318169.5A 2017-05-08 2017-05-08 A kind of working method and device of multi-protocols block chain Active CN107276762B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710318169.5A CN107276762B (en) 2017-05-08 2017-05-08 A kind of working method and device of multi-protocols block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710318169.5A CN107276762B (en) 2017-05-08 2017-05-08 A kind of working method and device of multi-protocols block chain

Publications (2)

Publication Number Publication Date
CN107276762A true CN107276762A (en) 2017-10-20
CN107276762B CN107276762B (en) 2019-08-30

Family

ID=60073848

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710318169.5A Active CN107276762B (en) 2017-05-08 2017-05-08 A kind of working method and device of multi-protocols block chain

Country Status (1)

Country Link
CN (1) CN107276762B (en)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108009445A (en) * 2017-11-30 2018-05-08 成都蓝海贝信息技术有限公司 A kind of trust data management system of half centralization
CN108322304A (en) * 2018-02-28 2018-07-24 北京比特大陆科技有限公司 The computational methods and device of proof of work, electronic equipment, program and medium
CN108390894A (en) * 2018-04-20 2018-08-10 黄绍进 A kind of personal information based on block chain really weighs method and block chain client
CN108460596A (en) * 2018-02-27 2018-08-28 周伟 A kind of quantized value assignment transfer method based on block chain
CN108595535A (en) * 2018-03-30 2018-09-28 李欣宇 Knowledge Q-A system and method based on the double-chain block chain of same root
CN108616574A (en) * 2018-03-30 2018-10-02 华为技术有限公司 Manage storage method, equipment and the storage medium of data
CN108768918A (en) * 2018-03-15 2018-11-06 中山大学 A kind of access control method based on empowerment management chain
CN109472600A (en) * 2018-11-20 2019-03-15 深圳市墨者安全科技有限公司 A kind of block chain trust authentication method and device
CN109858285A (en) * 2018-12-07 2019-06-07 上海异势信息科技有限公司 Processing method, device, equipment and the medium of block chain data
CN109871365A (en) * 2019-01-15 2019-06-11 苏州链读文化传媒有限公司 A kind of distributed file system
CN110163600A (en) * 2018-02-14 2019-08-23 财团法人工业技术研究院 Block catenary system and the method for applying it
WO2019195755A1 (en) * 2018-04-05 2019-10-10 Neji, Inc. Network protocol for blockchain based network packets
WO2020015668A1 (en) * 2018-07-20 2020-01-23 北京航空航天大学 Block chain storage method and node of block chain
CN111010382A (en) * 2019-09-12 2020-04-14 腾讯科技(深圳)有限公司 Method and apparatus for processing data requests in a blockchain network
CN111213134A (en) * 2018-09-19 2020-05-29 因特比有限公司 Method and system for performing hyper-convergence using blockchains

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160012424A1 (en) * 2014-07-11 2016-01-14 Ribbit.me! USA Inc. Distributed ledger protocol to incentivize transactional and non-transactional commerce
CN105488675A (en) * 2015-11-25 2016-04-13 布比(北京)网络技术有限公司 Distributed shared general ledger construction method of block chain
CN106157142A (en) * 2016-06-30 2016-11-23 惠众商务顾问(北京)有限公司 A kind of block chain common recognition and synchronous method, system and device
CN106533690A (en) * 2016-09-27 2017-03-22 布比(北京)网络技术有限公司 Block chain asset handling terminal and corresponding digital asset handling method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160012424A1 (en) * 2014-07-11 2016-01-14 Ribbit.me! USA Inc. Distributed ledger protocol to incentivize transactional and non-transactional commerce
CN105488675A (en) * 2015-11-25 2016-04-13 布比(北京)网络技术有限公司 Distributed shared general ledger construction method of block chain
CN106157142A (en) * 2016-06-30 2016-11-23 惠众商务顾问(北京)有限公司 A kind of block chain common recognition and synchronous method, system and device
CN106533690A (en) * 2016-09-27 2017-03-22 布比(北京)网络技术有限公司 Block chain asset handling terminal and corresponding digital asset handling method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
田海博等: "基于公开区块链的隐私保护公平合同签署协议", 《密码学报》 *

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108009445A (en) * 2017-11-30 2018-05-08 成都蓝海贝信息技术有限公司 A kind of trust data management system of half centralization
CN108009445B (en) * 2017-11-30 2021-05-11 成都蓝海贝信息技术有限公司 Semi-centralized trusted data management system
CN110163600A (en) * 2018-02-14 2019-08-23 财团法人工业技术研究院 Block catenary system and the method for applying it
CN110163600B (en) * 2018-02-14 2022-12-27 财团法人工业技术研究院 Block chain system and method using the same
CN108460596A (en) * 2018-02-27 2018-08-28 周伟 A kind of quantized value assignment transfer method based on block chain
CN108322304A (en) * 2018-02-28 2018-07-24 北京比特大陆科技有限公司 The computational methods and device of proof of work, electronic equipment, program and medium
CN108322304B (en) * 2018-02-28 2021-12-07 海峡小鹿有限公司 Calculation method and apparatus for workload certification, electronic device, program, and medium
CN108768918A (en) * 2018-03-15 2018-11-06 中山大学 A kind of access control method based on empowerment management chain
CN108768918B (en) * 2018-03-15 2021-09-24 中山大学 Access control method based on authorization management chain
CN108616574A (en) * 2018-03-30 2018-10-02 华为技术有限公司 Manage storage method, equipment and the storage medium of data
CN108595535A (en) * 2018-03-30 2018-09-28 李欣宇 Knowledge Q-A system and method based on the double-chain block chain of same root
CN108616574B (en) * 2018-03-30 2020-06-16 华为技术有限公司 Management data storage method, device and storage medium
CN108595535B (en) * 2018-03-30 2020-11-17 李欣宇 Knowledge question-answering system and method based on same-root double-chain block chain
WO2019195755A1 (en) * 2018-04-05 2019-10-10 Neji, Inc. Network protocol for blockchain based network packets
CN108390894A (en) * 2018-04-20 2018-08-10 黄绍进 A kind of personal information based on block chain really weighs method and block chain client
WO2020015668A1 (en) * 2018-07-20 2020-01-23 北京航空航天大学 Block chain storage method and node of block chain
CN111213134A (en) * 2018-09-19 2020-05-29 因特比有限公司 Method and system for performing hyper-convergence using blockchains
CN109472600A (en) * 2018-11-20 2019-03-15 深圳市墨者安全科技有限公司 A kind of block chain trust authentication method and device
CN109472600B (en) * 2018-11-20 2021-01-01 深圳市墨者安全科技有限公司 Block chain credibility verification method and device
CN109858285A (en) * 2018-12-07 2019-06-07 上海异势信息科技有限公司 Processing method, device, equipment and the medium of block chain data
CN109858285B (en) * 2018-12-07 2023-03-14 上海异势信息科技有限公司 Block chain data processing method, device, equipment and medium
CN109871365A (en) * 2019-01-15 2019-06-11 苏州链读文化传媒有限公司 A kind of distributed file system
CN111010382A (en) * 2019-09-12 2020-04-14 腾讯科技(深圳)有限公司 Method and apparatus for processing data requests in a blockchain network

Also Published As

Publication number Publication date
CN107276762B (en) 2019-08-30

Similar Documents

Publication Publication Date Title
CN107276762A (en) The method of work and device of a kind of multi-protocols block chain
CN110059494B (en) Privacy protection method for block chain transaction data and block chain system
CN108830602B (en) Permission chain construction and management and control method based on chameleon hash function
EP2959631B1 (en) Verification system and method with extra security for lower-entropy input records
CN110138733A (en) Object storage system based on block chain is credible to deposit card and access right control method
CN110300973A (en) The foundation of alliance's block chain network
CN104969508B (en) Method for the integrality of the data structure of protecting regular length
CN106875518A (en) The control method of smart lock, device and smart lock
CN106027456A (en) Apparatus and method for authenticating network devices
CN110569246B (en) Block chain node information synchronization method and device, computer equipment and storage medium
CN111988290A (en) Transaction deletion method and system under user balance privacy protection and authorization supervision
CN110224984A (en) A kind of multi-party authorization method and device based on block chain technology
CN112565264B (en) Cloud storage data integrity detection method based on block chain
CN110912705A (en) Distributed electronic voting method and system based on block chain
CN113344222A (en) Safe and credible federal learning mechanism based on block chain
CN112069550A (en) Electronic contract deposit certificate system based on intelligent contract mode
CN113259135A (en) Lightweight blockchain communication authentication device and method for detecting data tamper
CN112540998A (en) Method and device for clearing on-chain content of block chain
CN109981736B (en) Dynamic public auditing method supporting mutual trust of user and cloud server
CN114328518A (en) UTXO model-based low storage consumption method and system
CN113037827B (en) Voting method based on block chain, self-organization management method and computer equipment
CN113591103A (en) Identity authentication method and system between intelligent terminals of power internet of things
CN113285850A (en) Method and system suitable for testing password performance of power distribution safety equipment
CN112541195A (en) Method and device for constructing editable block chain
CN107968764A (en) A kind of authentication 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
GR01 Patent grant
GR01 Patent grant