CN107276762B - A kind of working method and device of multi-protocols block chain - Google Patents
A kind of working method and device of multi-protocols block chain Download PDFInfo
- Publication number
- CN107276762B CN107276762B CN201710318169.5A CN201710318169A CN107276762B CN 107276762 B CN107276762 B CN 107276762B CN 201710318169 A CN201710318169 A CN 201710318169A CN 107276762 B CN107276762 B CN 107276762B
- Authority
- CN
- China
- Prior art keywords
- block
- branched chain
- branch
- hash value
- root zone
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
- H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic 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/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0866—Generation 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0872—Generation 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3297—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving time stamps, e.g. generation of time stamps
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses the working methods and device of a kind of multi-protocols block chain, belong to block chain field.The described method includes: creation wound generation block and standard block;The hash value for calculating wound generation block is stored in standard block, and adds block on main block chain by the agreement of wound generation block;When there is new business demand, branch's block and branched chain root zone block are created on main block chain;Branch's block is stored in using short hash value as authorization Hash after the short hash value of calculating branched chain root zone block;The hash value for calculating branch's block is stored in branched chain root zone block, is linked into branched chain;It when new block need to be added in branched chain, also needs verifying branched chain root zone block whether legal, if illegal, new block failure is added in branched chain, if legal, the agreement of branched chain read and verifies the validity of branched chain.Using technical solution of the present invention, the block chain of multi-protocols can be created, allows to change the agreement of block chain, and the branch of block chain can be extended.
Description
Technical field
The present invention relates to block chain technology more particularly to a kind of working methods and device of multi-protocols block chain, belong to area
Block chain field.
Background technique
With the persistently overheating of 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 the technical solution an of decentralization, collective's one reliable distributed data base of maintenance.The party
Case mainly allows block to associate by cryptography method, and each block contains the data letter of system whole in certain time
Breath, and digital signature is generated with the validity of verification information according to data information, while hash value (cryptographic Hash) being linked to
Next data block forms a block chain.
Although there is block chain on a distribution network abundant hard and fast rule to establish an effective block,
When creating block chain, the rule of the storage of control block chain data, parsing and block addition and verifying is set entirely and cannot
Change, and existing block chain technology does not adapt to the ability of node, in order to support longest link, any creation is in block
Branch on chain can all be abandoned, waste of resource.
Summary of the invention
The purpose of the present invention is to solve problems of the prior art, provide a kind of work of multi-protocols block chain
Make method and device.
On the one hand, the present invention provides a kind of working methods of multi-protocols block chain, comprising:
Step S1: creation wound generation block, 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 add 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 zone
Block;The short hash value of branched chain root zone block is calculated, and is stored in branch's block for short hash value as authorization Hash;Calculate area, branch
The hash value of block is simultaneously deposited into branched chain root zone block, is linked into branched chain;
Step S3: when needing to add new block in branched chain, whether verifying branched chain root zone block is legal, if not
It is legal, then new block failure is added in branched chain, if legal, read the agreement of branched chain and is verified having for branched chain
Effect property, if branched chain is effective, 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, creation wound generation block, specifically: it is identified and is created according to criterion of proof, net load, descriptor and branch
After creating generation block, net load hash value is calculated according to the net load of wound generation block, and add timestamp for wound generation block;
Specifically, according to wound generation block as defined in agreement create standard block, specifically: according to criterion of proof, net load,
After descriptor and branch's mark create standard block according to the agreement of wound generation block, calculated according to the net load of standard block net
Load hash value, and timestamp is added for standard block;
Specifically, on main block chain create branch's block, specifically: according to criterion of proof, net load, descriptor and
After branch's mark is according to agreement creation branch's block of wound generation block, net load Hash is calculated according to the net load of branch's block
Value, and timestamp is added for branch's block.
Specifically, branched chain root zone block is created, specifically: it is identified according to criterion of proof, net load, descriptor and branch
After creating branched chain root zone block, net load hash value is calculated according to the net load of branched chain root zone block, and be branched chain root zone block
Add timestamp.
Further, the hash value of wound generation block is calculated in step S1 and is deposited into standard block, is linked into main block
Chain, specifically: according to the criterion of proof of wound generation block, marked using the net load hash value in wound generation block, timestamp, proof
Standard, descriptor, branch's mark and random number calculate the hash value of wound generation block, will create the hash value of generation block as standard block
Previous block hash value be stored in standard block, be linked into main block chain.
Further, step S2 falls into a trap the short hash value of point counting branch root zone block, and using short hash value as authorization Hash
It is stored in branch's block, specifically: it is identified according to the criterion of proof in branched chain root zone block, net load, descriptor, branch, is net negative
Lotus hash value and timestamp calculate the short hash value of branched chain root zone block, and using the short hash value of branched chain root zone block as dividing
The authorization Hash of branch block is stored in branch's block;
Further, it calculates the hash value of branch's block and is deposited into branched chain root zone block, specifically: according to branch
Criterion of proof in block, using in branch's block previous block hash value, net load hash value, timestamp, criterion of proof,
Descriptor, branch mark, random number and authorization Hash calculate branch's block hash value, and using the hash value of branch's block as
The previous block hash value of branched chain root zone block is stored in branched chain root zone block.
Preferably, before the hash value for calculating branch's block, further includes: it is previous on main block chain to calculate branch's block
Block hash value is simultaneously stored in branch's block, specifically: 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 authorization Hash calculate previous block hash value and be stored in branch's block.
Specifically, it is whether legal that branched chain root zone block is verified in step S3, specifically:
Step F1: verifying branched chain root zone block previous block hash value whether with branch's block on main block chain
Hash value is identical, if identical, thens follow the steps F2, and otherwise branched chain root zone block is illegal, and new area is added in branched chain
Block failure;
Step F2: verifying branched chain root zone block short hash value whether with the authorization in branch's block on main block chain
Hash is identical, if identical, read 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 in vain, new block failure is added in the branched chain, otherwise branched chain root zone block is not
It is legal, new block failure is added in branched chain.
Further, step F1, specifically: according to the previous block hash value in branch's block, random number, net load
Hash value, timestamp, criterion of proof, descriptor, branch's mark, authorization Hash and net load calculate the Hash of branch's block
Value, whether the hash value for verifying branch's block is identical as the previous block hash value in branched chain root zone block, if two values are identical,
F2 is thened follow the steps, otherwise branched chain root zone block is illegal, and branched chain is considered as invalid;
Further, step F2, specifically: according to the net load hash value of branched chain root zone block, timestamp, prove to mark
Quasi-, descriptor and branch's mark calculate the short hash value of branched chain root zone block, and the short hash value of verifying branched chain root zone block is
It is no identical as the authorization hash value of branch block, if two values are identical, the agreement of branched chain is read, otherwise branched chain root zone block
Illegal, branched chain is considered as invalid.
Further, before reading the agreement of branched chain and verifying the validity of branched chain further include: judge whether to deposit
In the equal branched chain root zone block of the hash value of another other previous block hash value and branch's block, if it is present
After the longest branched chain of length 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, specifically: in branch's block on branched chain root zone block or main block chain
Read the agreement of branched chain.
Specifically, in step S3, the validity of branched chain is verified, specifically: the Hash of all blocks in verifying branched chain
Whether value meets the agreement of branched chain;And whether the timestamp for verifying all blocks in branched chain meets the agreement of branched chain, such as
It is verified, then the branched chain is effective, and otherwise the branched chain is invalid.
More specifically, whether the hash value of all blocks meets the agreement of branched chain in verifying branched chain, specifically: it calculates
The hash value of first block in branched chain, whether judgement and the previous block hash value in next block are identical, if
Identical, then first block in branched chain meets the agreement of branched chain, and whether other blocks for continuing to verify in branched chain are full
The agreement of sufficient branched chain is considered as invalid if the agreement of branched chain as described in all blocks in the branched chain are not satisfied;
More specifically, whether the timestamp of all blocks meets the agreement of branched chain in verifying branched chain, specifically: judgement
Whether the timestamp of each block meets the format 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 adds new block in branched chain according to the agreement of branched chain, otherwise branch
Chain is considered as invalid.
On the other hand, the present invention provides a kind of devices of multi-protocols block chain, comprising:
First creation module, for creating generation block and creating standard block according to the agreement of wound generation block;
First computing module, for calculating the hash value of wound generation block;
The hash value of first memory module, the wound generation block for obtaining the first computing module is stored in the first creation module
The standard block of creation, is linked into main block chain;
First adding module, for adding block on main block chain according to the agreement of wound generation block;
Second creation module for when there is new business demand, creating branch's block on main block chain, and creates and divides
Branch root zone block;
Second computing module, for calculating the short hash value of branched chain root zone block;
Second memory module, the short hash value for obtaining the second computing module is as authorization Hash the second creation of deposit
In branch's block of module creation;
Third computing module, for calculating the hash value of branch's block;
The hash value of third memory module, branch's block for obtaining third computing module is stored in the second creation module
In the branched chain root zone block of creation, it is linked into branched chain;
First authentication module, for when needing to add new block in branched chain, whether verifying branched chain root zone block
It is legal;
Read module, for reading the agreement of branched chain when the first authentication module verifying branched chain root zone block is legal;
Second authentication module, for verifying the validity for the branched chain that read module is read;
Second adding module, for when the second authentication module verifying 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 specifically includes: the first creating unit, the first computing unit,
First adding unit, the second creating unit, the second computing unit, the second adding unit, third creating unit, third computing unit
With third adding unit;
First creating unit, for identifying creation wound generation block according to criterion of proof, net load, descriptor and branch;
First computing unit, for calculating the net load Hash of wound generation block according to the net load of the first creating unit of creation
Value;
First adding unit, 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, for calculating the net load hash value of standard block according to the net load of standard block;
Second adding unit, for adding timestamp for standard block;
Third 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;
Third computing unit, for calculating the net load hash value of branch's block according to the net load of branch's block;
Third adding unit, for adding timestamp for branched chain root zone block.
Specifically, the second creation module specifically includes: the 4th creating unit, the 4th computing unit and the 4th adding module;
4th creating unit, for identifying creation branched chain root zone according to criterion of proof, net load, descriptor and branch
Block;
The net load of 4th computing unit, the branched chain root zone block for being created according to the 4th creating unit calculates branched chain
The net load hash value of root zone block;
4th adding module, for adding timestamp for branched chain root zone 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, specifically for the wound generation block for calculating the first computing unit hash value as standard block
Previous block hash value be stored in standard block, be linked into main block chain.
Further, the second computing module is specifically used for: according in branched chain root zone block criterion of proof, net load, retouch
State the short hash value that symbol, branch's mark, net load hash value and timestamp calculate branched chain root zone block;
Specifically, the second memory module is specifically used for: the short Hash for the branched chain root zone block that the second computing module is calculated
It is worth and is stored in branch's block as the authorization Hash of branch's block;
Specifically, third computing module is specifically used 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 authorization Hash
Calculate the hash value of branch's block;
Specifically, third memory module is specifically used for: the hash value for branch's block that third computing module is calculated as
The previous block hash value of branched chain root zone block is stored in branched chain root zone block.
Preferably, the present apparatus further include: the 4th computing module and the 4th memory module;
4th computing module makes for the criterion of proof according to branch's block in previous block on main block chain
With previous block hash value, net load hash value, timestamp, proof of branch's block in the previous block on main block chain
Standard, descriptor, branch's mark, random number and authorization Hash calculate previous block hash value;
4th memory module, the previous block hash value for calculating the 4th computing module are stored in branch's block.
Further, authentication module includes: the first authentication unit and the second authentication unit;
First authentication unit, for verify the previous block hash value in branched chain root zone block whether on main block chain
The hash value of branch's block is identical;
Second authentication unit, for verifying previous block hash value and the primary area of branched chain root zone block when the first authentication unit
When the hash value of branch's block on block chain is identical, verify branched chain root zone block short hash value whether on main block chain point
Authorization Hash in branch block is identical;
Specifically, read module, specifically for verifying short hash value and the master of branched chain root zone block when the second authentication unit
When the authorization Hash in branch's block on block chain is identical, the agreement of branched chain is read.
Further, the first authentication unit includes: the first computation subunit and the first verifying subelement, and the second verifying is single
Member includes: the second computation subunit and the second verifying subelement;
First computation subunit, for according to previous block hash value, random number, the net load Hash in branch's block
Value, timestamp, criterion of proof, descriptor, branch's mark, authorization Hash and net load calculate the hash value of branch's block;
First verifying subelement, for verify branch's block that the first computation subunit is calculated hash value whether with
The previous block hash value of branched chain root zone block is identical;
Second computation subunit, for verifying the area, branch that the first computation subunit is calculated when the first verifying subelement
When the hash value of block is identical as the previous block hash value of branched chain root zone block, according to the net load Hash of branched chain root zone block
Value, timestamp, criterion of proof, descriptor and branch's mark calculate the short hash value of branched chain root zone block;
Second verifying subelement, for verifying the short hash value for the branched chain root zone block that the second computation subunit is calculated
It is whether identical as the authorization hash value of branch block;
Read module, specifically for when the second verifying subelement verifying is identical as the authorization hash value of branch block, reading
Take the agreement of branched chain simultaneously.
Further, device further include: judgment module and selecting module;
Judgment module, the hash value for judging whether there is other previous block hash values and branch's block are equal
Branched chain root zone block;
Selecting module, for there are the hash values of another previous block hash value and branch's block when judgment module judgement
When equal branched chain root zone block, the longest branched chain of length is chosen as legal point in the branched chain being connected with branch block
Branch;
Read module is also used to read and close after selecting module chooses the longest branched chain of length as legal branched chain
The agreement of method branched chain.
Read module, specifically for reading the association of branched chain in branch's block on branched chain root zone block or main block chain
View.
Specifically, authentication module includes: third authentication unit and the 4th authentication unit;
Whether third authentication unit, the hash value for verifying all blocks in branched chain meet the agreement of branched chain;
Whether the 4th authentication unit, the timestamp for verifying all blocks in branched chain meet the agreement of branched chain.
Further, third authentication unit includes: that third computation subunit, the first judgment sub-unit and third verifying are single
Member;
Third computation subunit, for calculating the hash value of first block in branched chain;
First judgment sub-unit, for judging that third computation subunit calculates the hash value of first block in branched chain
It is whether identical with the previous block hash value in next block;
Third verifies subelement, for judge the in third computation subunit calculating branched chain when the first judgment sub-unit
When the hash value of one block is identical with previous block hash value in next block, next block in branched chain is verified
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 format;
Subelement is added, for judging that the timestamp of each block in branched chain is all satisfied branch when the second judgment sub-unit
When the format of timestamp as defined in chain agreement, new block is added in branched chain according to the agreement of branched chain.
The beneficial effect that the present invention obtains is:
Using technical solution of the present invention, the block chain of multi-protocols can be created, allows to change the agreement of block chain, and
The branch of block chain can be extended.
Detailed description of the invention
Illustrate the embodiment of the present invention or technical solution in the prior art in order to clearer, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of flow chart of the working method 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 zone block;
Fig. 5 is the schematic diagram with an effective branched chain;
Fig. 6 is a kind of flow chart of the working method 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.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiment is only one embodiment of the invention, instead of all the embodiments.Based on this hair
Embodiment in bright, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, shall fall within the protection scope of the present invention.
Embodiment one
In the present embodiment, a kind of working method of multi-protocols block chain is provided, specific steps include:
Step S1: creation wound generation block, 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 add 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 zone
Block;The short hash value of branched chain root zone block is calculated, and is stored in branch's block for short hash value as authorization Hash;Calculate area, branch
The hash value of block is simultaneously deposited into branched chain root zone block, is linked into branched chain;
Step S3: when needing to add new block in branched chain, whether verifying branched chain root zone block is legal, if not
It is legal, then new block failure is added in branched chain, if legal, read the agreement of branched chain and is verified having for branched chain
Effect property, if branched chain is effective, 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, creation wound generation block, specifically: according to criterion of proof, net load, descriptor with
And after branch's mark creation wound generation block, net load hash value is calculated according to the net load of wound generation block, and add for wound generation block
It adds timestamp;
Specifically, according to wound generation block as defined in agreement create standard block, specifically: according to criterion of proof, net load,
After descriptor and branch's mark create standard block according to the agreement of wound generation block, calculated according to the net load of standard block net
Load hash value, and timestamp is added for standard block;
Specifically, on main block chain create branch's block, specifically: according to criterion of proof, net load, descriptor and
After branch's mark is according to agreement creation branch's block of wound generation block, net load Hash is calculated according to the net load of branch's block
Value, and timestamp is added for branch's block.
Specifically, in the present embodiment, branched chain root zone block is created, specifically: according to criterion of proof, net load, description
After symbol and branch's mark creation branched chain root zone block, net load hash value is calculated according to the net load of branched chain root zone block, and
Timestamp is added for branched chain root zone block.
Further, the hash value of wound generation block is calculated in step S1 and is deposited into standard block, is linked into main block
Chain, specifically: according to the criterion of proof of wound generation block, marked using the net load hash value in wound generation block, timestamp, proof
Standard, descriptor, branch's mark and random number calculate the hash value of wound generation block, will create the hash value of generation block as standard block
Previous block hash value be stored in standard block, be linked into main block chain.
Further, step S2 falls into a trap the short hash value of point counting branch root zone block, and using short hash value as authorization Hash
It is stored in branch's block, specifically: it is identified according to the criterion of proof in branched chain root zone block, net load, descriptor, branch, is net negative
Lotus hash value and timestamp calculate the short hash value of branched chain root zone block, and using the short hash value of branched chain root zone block as dividing
The authorization Hash of branch block is stored in branch's block;
Further, it calculates the hash value of branch's block and is deposited into branched chain root zone block, specifically: according to branch
Criterion of proof in block, using in branch's block previous block hash value, net load hash value, timestamp, criterion of proof,
Descriptor, branch mark, random number and authorization Hash calculate branch's block hash value, and using the hash value of branch's block as
The previous block hash value of branched chain root zone block is stored in branched chain root zone block.
Preferably, before the hash value for calculating branch's block, further includes: it is previous on main block chain to calculate branch's block
Block hash value is simultaneously stored in branch's block, specifically: 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 authorization Hash calculate previous block hash value and be stored in branch's block.
Specifically, in the present embodiment, it is whether legal that branched chain root zone block is verified in step S3, specifically:
Step F1: verifying branched chain root zone block previous block hash value whether with branch's block on main block chain
Hash value is identical, if identical, thens follow the steps F2, and otherwise branched chain root zone block is illegal, and new area is added in branched chain
Block failure;
Step F2: verifying branched chain root zone block short hash value whether with the authorization in branch's block on main block chain
Hash is identical, if identical, read 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 in vain, new block failure is added in the branched chain, otherwise branched chain root zone block is not
It is legal, new block failure is added in branched chain.
Further, in the present embodiment, step F1, specifically: according in branch's block previous block hash value, with
Machine number, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, authorization Hash and net load calculate branch
The hash value of block, whether the hash value for verifying branch's block is identical as the previous block hash value in branched chain root zone block, if
Two values are identical, then follow the steps F2, and otherwise branched chain root zone block is illegal, and branched chain is considered as invalid;
Further, in the present embodiment, step F2, specifically: according to the net load hash value of branched chain root zone block, when
Between stamp, criterion of proof, descriptor and branch's mark calculate the short hash value of branched chain root zone block, verifying branched chain root zone block
Whether short hash value is identical as the authorization hash value of branch block, if two values are identical, read the agreement of branched chain, otherwise divides
Branch root zone block is illegal, and branched chain is considered as invalid.
Further, before reading the agreement of branched chain and verifying the validity of branched chain further include: judge whether to deposit
In the equal branched chain root zone block of the hash value of another other previous block hash value and branch's block, if it is present
After the longest branched chain of length 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, specifically: in branch's block on branched chain root zone block or main block chain
Read the agreement of branched chain.
Specifically, in step S3, the validity of branched chain is verified, specifically: the Hash of all blocks in verifying branched chain
Whether value meets the agreement of branched chain;And whether the timestamp for verifying all blocks in branched chain meets the agreement of branched chain, such as
It is verified, then the branched chain is effective, and otherwise the branched chain is invalid.
More specifically, whether the hash value of all blocks meets the agreement of branched chain in verifying branched chain, specifically: it calculates
The hash value of first block in branched chain, whether judgement and the previous block hash value in next block are identical, if
Identical, then first block in branched chain meets the agreement of branched chain, and whether other blocks for continuing to verify in branched chain are full
The agreement of sufficient branched chain is considered as invalid if the agreement of branched chain as described in all blocks in the branched chain are not satisfied;
More specifically, whether the timestamp of all blocks meets the agreement of branched chain in verifying branched chain, specifically: judgement
Whether the timestamp of each block meets the format 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 adds new block in branched chain according to the agreement of branched chain, otherwise branch
Chain is considered as invalid.
Embodiment two
In the present embodiment, a kind of working method of multi-protocols block chain is provided, referring to Fig. 1, specific steps include:
Step 101: creation wound generation block is identified according to criterion of proof, net load, descriptor and branch;
Wound generation block is the beginning of main block chain.Specifically, it was demonstrated that it is (such as right that standard can be the proof based on workload
The requirement of hash value), equity 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 executes, can be regular length or variable-length, this
In embodiment, by taking main block chain executes agreement A as an example, agreement A is the agreement of main block chain default, decides whether to allow branched chain
Creation, 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's mark
Know and determines whether the block allows that there are branches.
For example, criterion of proof is 258522748404, and descriptor 2224550616, branch's mark 00;Wherein, branch marks
Knowing 00 indicates branchiess standard block, and 01 expression this block allows that there are branches.
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-
512, the same algorithm or different algorithms can be used by primary or more in SHA-512/224, SHA-512/256, SHA3 etc.
It is secondary that net load hash value is calculated.
For example, the net load hash value calculated in this embodiment are as follows:
5812db5df9e4782132833dbf88b902b3a0b5ca9961b5705d00c62b947420cf62。
Step 103: adding timestamp for wound generation block;
In the present embodiment, after adding timestamp for wound generation block, wound generation block has been built up, and creates generation block such as Fig. 2 institute
Show, comprising: random number, net load hash value, timestamp, criterion of proof, net load, descriptor and branch's mark need
It is bright, beginning of the generation block as main block chain is created, is a special block, does not include previous block hash value.
Specifically, timestamp has recorded the time of block foundation, allows to have a certain range of error, distributed network
User, which checks timestamp, can examine whether it is the timestamp forged.
For example, the time of creation wound generation block is at 10 points in the morning on October 20th, 2,016 33 minutes and 19 seconds, by the Unix time
It stabs after converting as 1476930799.
Step 104: being 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 at this time executes agreement A.
For example, criterion of proof is 258522748404, descriptor 2224550616, branch is identified as 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 are as follows:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 106: adding timestamp for standard block;
For example, the time of creation wound generation block is at 10 points in the morning on October 20th, 2,016 55 minutes and 56 seconds, by the Unix time
It stabs after converting as 1476932156.
Step 107: according to the criterion of proof in wound generation block, using net load hash value, timestamp, the card of wound generation block
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, it calculates the hash value of wound generation block and is stored in previous block of the standard block as standard block
Hash value, standard block have been built up, and standard block is as shown in figure 3, specifically including that previous block hash value, random number, bearing only
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 operation obtained.
Specifically, the value for changing random number by constantly adjustment in the present embodiment, calculates having for certificate of compliance standard
Imitate the hash value of branch's block.The algorithm for calculating hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-
512, the same algorithm or different algorithms can be used by primary or more in SHA-512/224, SHA-512/256, SHA3 etc.
The secondary hash value that wound generation block is calculated.
For example, random number are as follows: 2199601046, the hash value for the wound generation block being calculated are as follows:
b27a85ced3ae9e22b5f4066790a9954fa72cf320a9dfcea9257190c5a21ff925。
According to the method for above-mentioned creation standard block, user can form a main block according to multiple standard blocks are created
Chain.
Step 108: creation branch's block is identified according to criterion of proof, net load, descriptor and branch;
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, 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 executes agreement A.
For example, criterion of proof are as follows: 258522748404, descriptor are as follows: 2224550616, branch's mark are as follows: 01.
Step 109: net load hash value is calculated according to the net load in branch's block;
For example, the net load of branch's block calculates net load hash value are as follows:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 110: adding timestamp for branch's block;
For example, the time of creation branch's block is at 11 points in the morning on October 20th, 2,016 10 minutes and 12 seconds, by the Unix time
It stabs after converting as 1476933012.
Step 111: according to the criterion of proof in standard block, using the previous block hash value, net in standard block
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
Previous block hash value of branch's block as branch's block;
For example, random number are as follows: 927bf6aeb9, calculate standard block hash value are as follows:
e1b7efc6c6aeb73eb608d38b144da3077f74c6060e6aaa6a400ce7a5f59e9783。
Step 112: creation branched chain root zone block is identified according to criterion of proof, net load, descriptor and branch;
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, is written the agreement that needs to be implemented of branched chain in the net load of branched chain root zone block, in the present embodiment, with branch
For chain executes agreement B, agreement B is applied to branched chain root zone block and the following branched chain being connected to after branched chain root zone block
Lu Zhong.
For example, if the branch in system by fraudulent copying, that is, replicates one and by the branched root block of legal authorization
Duplicate block, system can ignore the duplication block automatically.Even if to add new block, system after the block of duplication
It will be considered that new block is to be linked at by the branched root block of legal authorization.
For example, criterion of proof are as follows: 374820264590, descriptor are as follows: 371829340297 and branch's mark 00.
Step 113: net load hash value is calculated according to the net load in branched chain root zone block;
For example, net load hash value are as follows:
896be254c089dae7b66b50275551927037ce0cc83e74839738fdbfca82d1ff3d。
Step 114: adding timestamp for branched chain root zone block;
For example, the time of creation branched chain root zone block is at 11 points in the morning on October 20th, 2,016 26 minutes and 28 seconds, by Unix
Timestamp convert after into 1476933988.
Step 115: according to criterion of proof, net load, descriptor, the branch's mark, net load in branched chain root zone block
Hash value and timestamp calculate the short hash value of branched chain root zone block, and using short hash value deposit branch's block as area, branch
The authorization Hash of block;
In the present embodiment, the short hash value of branched chain root zone block is stored in branch's block, branch's block as authorization Hash
It has built up.
For example, calculate branched chain root zone block short hash value are as follows:
ef96b09775ba3b3341f9832a608948151ee0027e690c8672a476351a9f7625d。
Step 116: according to the criterion of proof in branch's block, using the previous block hash value of branch's block, net negative
Lotus hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and authorization Hash calculate the Hash of branch's block
Value, the previous block hash value as branched chain root zone block;
Specifically, the value for changing random number by constantly adjustment in the present embodiment, calculates having for certificate of compliance standard
Imitate the hash value of branch's block.
For example, random number are as follows: the hash value of 2d06607889, Suan get branch block are as follows:
c61845fde8183851d88062e38419f08ab36f54dbfb74bca8e01675bfa765d854
In the present embodiment, previous area of the hash value of branched chain root zone block storage branch's block as branched chain root zone block
Block hash value, branched chain root zone block have been built up.Previous block Hash of the hash value of branch's block as branched chain root zone block
Value completes the process of both sides' reference, it is ensured that branched chain root zone block is effective branch that one of branch's block is certified.Branch
The schematic diagram that the related data of block and branched chain root zone 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 branch after
Continuous creation standard block realizes that step is described in detail in embodiment three.
For example, the schematic diagram for creating the block chain of an effective branched chain is as shown in Figure 5 in the present embodiment.Main block chain
Agreement A existing for inside the net load of standard block, inside the net load of branched chain root zone block (or branch's block) existing for
It is the agreement B of branched chain, the main block chain for executing agreement A and the branch link for executing agreement B are considered as active link.
Embodiment three
In the present embodiment, branched chain root zone block also can be used as branch's block, i.e. can create on a branched chain root zone block
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: creation wound generation block is identified according to criterion of proof, net load, descriptor and branch;
Wound generation block is the beginning of main block chain.Specifically, it was demonstrated that it is (such as right that standard can be the proof based on workload
The requirement of hash value), equity 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 executes, can be regular length or variable-length, this reality
It applies in example, by taking main block chain executes agreement A as an example, agreement A is the agreement of main block chain default, decides whether to allow branched chain
Creation defines the storage of data on main block chain block, carries 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 there are branch.
For example, criterion of proof is 258522748404, and descriptor 2224550616, branch's mark 00;Wherein, branch marks
Knowing 00 indicates branchiess standard block, and 01 expression this block allows that there are branches.
Step 202: net load hash value is calculated according to the net load in wound generation block;
Specifically, the algorithm for calculating net load hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-
512, the same algorithm or different algorithms can be used by primary or more in SHA-512/224, SHA-512/256, SHA3 etc.
It is secondary that net load hash value is calculated.
For example, the net load hash value calculated in this embodiment are as follows:
5812db5df9e4782132833dbf88b902b3a0b5ca9961b5705d00c62b947420cf62。
Step 203: adding timestamp for wound generation block;
In the present embodiment, after adding timestamp for wound generation block, wound generation block has been built up.Specifically, time stab
The time for having recorded block foundation, allow to have a certain range of error, the user of distributed network, which checks timestamp, can examine it
It whether is the timestamp forged.
For example, the time of creation wound generation block is at 10 points in the morning on October 20th, 2,016 33 minutes and 19 seconds, by the Unix time
It stabs after converting as 1476930799.
Step 204: being 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 2224550616, branch is identified as 00.
Step 205: net load hash value is calculated according to the net load in standard block;
In the present embodiment, the net load of standard block at this time executes agreement A.
For example, the net load hash value calculated are as follows:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 206: adding timestamp for standard block;
For example, the time of creation wound generation block is at 10 points in the morning on October 20th, 2,016 55 minutes and 56 seconds, by the Unix time
It stabs after converting 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, the value for changing random number by constantly adjustment in the present embodiment, calculates having for certificate of compliance standard
Imitate the hash value of branch's block.The algorithm for calculating hash value has MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-
512, the same algorithm or different algorithms can be used by primary or more in SHA-512/224, SHA-512/256, SHA3 etc.
The secondary hash value that wound generation block is calculated.
For example, random number are as follows: 2199601046, the hash value for the wound generation block being calculated are as follows:
b27a85ced3ae9e22b5f4066790a9954fa72cf320a9dfcea9257190c5a21ff925。
According to the method for above-mentioned creation standard block, user can form a main block according to multiple standard blocks are created
Chain.
Step 208: creation branch's block is identified according to criterion of proof, net load, descriptor and branch;
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, 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 executes agreement A.
For example, criterion of proof are as follows: 258522748404, descriptor are as follows: 2224550616, branch's mark are as follows: 01.
Step 209: net load hash value is calculated according to the net load in branch's block;
For example, the net load of branch's block calculates net load hash value are as follows:
428516a06795ccc26829ccf63f994b86f9a53221d73110b9c7e9bd0fc3dfd471。
Step 210: adding timestamp for branch's block;
For example, the time of creation branch's block is at 11 points in the morning on October 20th, 2,016 10 minutes and 12 seconds, by the Unix time
It stabs after converting as 1476933012.
Step 211: according to the criterion of proof in standard block, using the previous block hash value of standard block, net negative
Lotus hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and authorization Hash calculate the Hash of standard block
Value, and it is stored in previous block hash value of branch's block as branch's block;
For example, random number are as follows: 927bf6aeb9, calculate standard block hash value are as follows:
e1b7efc6c6aeb73eb608d38b144da3077f74c6060e6aaa6a400ce7a5f59e9783。
Step 212: creation branched chain root zone block is identified according to criterion of proof, net load, descriptor and branch;
In the present embodiment, it is held in data and branched chain of the net load Rigen according to the demand write-in respective stored of different application
Capable agreement, is written the agreement that needs to be implemented of branched chain in the net load of branched chain root zone block, in the present embodiment, with branched chain
For executing agreement B, agreement B is applied to branched chain root zone block and the following branch link being connected to after branched chain root zone block
In.
For example, if the branch in system by fraudulent copying, that is, replicates one and by the branched root block of legal authorization
Duplicate block, system can ignore clone's block automatically.Even if to add new block, system after the block of clone
It will be considered that new block is to be linked at by the branched root block of legal authorization.
For example, criterion of proof are as follows: 374820264590, descriptor are as follows: 371829340297 and branch's mark 01.
Step 213: net load hash value is calculated according to the net load in branched chain root zone block;
For example, net load hash value are as follows:
896be254c089dae7b66b50275551927037ce0cc83e74839738fdbfca82d1ff3d。
Step 214: adding timestamp for branched chain root zone block;
For example, the time of creation branched chain root zone block is at 11 points in the morning on October 20th, 2,016 26 minutes and 28 seconds, by Unix
Timestamp convert after into 1476933988.
Step 215: according to the criterion of proof in branch's block, using the previous block hash value, net in branch's block
Load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and authorization Hash calculate the Hash of branch's block
Value, and it is stored in previous block hash value of the branched chain root zone block as branched chain root zone block;
For example, random number are as follows: the hash value of 2d06607889, Suan get branch block are as follows:
a36fce8c4f207bd2c022013b85e8ea08b5749467443e5f6f16535679edbdb564
It should be noted that can be continued to continue creation standard block on branch according to the agreement of branched chain root zone block, in detail
Thin step is as shown in embodiment three, and details are not described herein.
Step 216: creation branched root branch block is identified according to criterion of proof, net load, descriptor and branch;
In the present embodiment, it is held in data and branched chain of the net load Rigen according to the demand write-in respective stored of different application
The agreement that branched chain needs to be implemented is written in capable agreement 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, for creating Liang Ge branched root branch block.The present embodiment
In, two branched chains execute agreement C, agreement D respectively, and agreement C and agreement D are respectively applied to branched root branch block and next
It is connected in the branch link after branched root branch block.
For example, the criterion of proof of first branched root branch block are as follows: 8d3b1be98445, descriptor are as follows:
473044022075, branch's mark are as follows: 00.
Step 217: net load hash value is calculated according to the net load in branched root branch block;
For example, the net load hash value of branched root branch block are as follows:
038edfbcd15127659e167c8bb9c991ae5befbeeb4dc35cce4912c67abf915c62。
Step 218: adding timestamp for branched root branch block;
For example, the creation time of branched root branch block is at 11 points in the morning on October 20th, 2,016 38 minutes and 8 seconds, by Unix
Timestamp convert after into 1476934688.
Step 219: according to criterion of proof, net load, descriptor, the branch's mark, net load in branched root branch block
Hash value and timestamp calculate the short hash value of branched root branch block, and short hash value deposit branch's chain component block is made
For the authorization Hash of branch's chain component block;
For example, the short hash value of branched root branch block are as follows:
05f7d42fb70c4430d3bb164f58c1c847cc8fe877356432042ef0e83ee01d24d7
Step 220: according to the criterion of proof in branched chain root zone block, using the previous block in branched chain root zone block
Hash value, net load hash value, timestamp, criterion of proof, descriptor, branch's mark, random number and authorization Hash calculate branch
The hash value of chain root zone block, and it is stored in previous block hash value of the branched root branch block as branched root branch block;
In the present embodiment, the hash value of branched root branch block storage branched chain root zone block is as branched root branch block
Previous block hash value after, branched root branch block has been built up.
For example, random number are as follows: 2199601046, the hash value of branched chain root zone block are as follows:
038edfbcd15127659e167c8bb9c991ae5befbeeb4dc35cce4912c67abf915c62
User can continue creation standard block after branched root branch block according to the actual situation.Detailed step such as embodiment
Shown in four, details are not described herein.
For example, the block chain of a plurality of effective branched chain of creation, schematic diagram are as shown in Figure 7.Branch's block and branch are created
After chain root zone block, Liang Ge branched root branch block is created according to agreement, two effective branched chains execute agreement C and D respectively.
Example IV
The flow chart that a kind of creation standard block in branched chain is provided in the present embodiment is specifically included referring to Fig. 8:
Step 301: whether the previous block hash value of verifying branched chain root zone block is that it is connected on main block chain
The hash value of branch's block, if so, thening follow the steps 302, otherwise branched chain is invalid, terminates;
Specifically, in the present embodiment, according to the previous block Hash of branch's block created, random number, net
Load hash value, timestamp, criterion of proof, descriptor, branch's mark, authorization Hash, net load are according to creation branched chain root zone
The algorithm of previous block hash value is calculated when block, again calculate branch's block hash value, and with before branched chain root zone block
One block hash value is compared, if two values are equal, thens follow the steps 302, otherwise, the branch where branched chain root zone block
Chain is invalid, terminates.
Step 302: whether the short hash value of verifying branched chain root zone block is that it is connected in branch's block of main block chain
Authorization Hash, if so, thening follow the steps 303, otherwise branched chain is invalid, terminate;
Specifically, in the present embodiment, according to the net load hash value of branched chain root zone block, timestamp, criterion of proof, retouch
The algorithm that branched chain root zone block short Hash is calculated when stating symbol, branch's mark according to creation branch's block, calculates branched chain root again
The short hash value of block, and comparing with the authorization hash value of branch block thens follow the steps 303 if two values are equal, no
Then, the branched chain where branched chain root zone block is invalid, terminates.
Step 303: judging whether that there is also the hash value of other previous block hash values and branch's block is equal
Branched chain root zone block is then, the longest branched chain of length to be chosen in the branched chain being connected with branch block as legal branch
Chain executes step 304, and otherwise, branched chain root zone block is legal, continues to execute step 304;
Step 304: reading branched chain from the net load of branch's block of legal branched chain root zone block or main block chain
Agreement;
In the present embodiment, the agreement of branched chain can reside on branch's block, can also exist on branched root block
On.
Step 305: whether the hash value of all blocks meets the agreement of branched chain in verifying branched chain, is to then follow the steps
306, otherwise branched chain is invalid, terminates.
In the present embodiment, a series of requirements such as algorithm of calculation block hash value are defined inside the agreement of branched chain,
Judge the counted block hash value of algorithm according to calculation block hash value as defined in branched chain agreement and there are next blocks
Previous block hash value it is whether identical, if identical, meet the agreement of branched chain, continue to execute step 306, otherwise,
This branched chain is invalid, terminates.
Step 306: whether the timestamp of all blocks meets the agreement of branched chain in verifying branched chain, is that branched chain has
Effect, continues to execute step 307, and otherwise branched chain is invalid, terminates.
In the present embodiment, a series of requirements such as format of timestamp are defined inside the agreement of branched chain, judges branch
Whether the timestamp of each block meets the regulation of branched chain agreement on chain, if it is satisfied, then step 306 is continued to execute, 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 creation has described in detail in example 1 and example 2, herein no longer
It repeats.
Embodiment five
The device for present embodiments providing a kind of multi-protocols block chain, as shown in figure 9, device includes:
First creation module 401, for creating generation block and creating standard block according to the agreement of wound generation block;
First computing module 402, for calculating the hash value of wound generation block;
First memory module 403, the first wound of hash value deposit of the wound generation block for obtaining the first computing module 402
The standard block that block 401 creates is modeled, main block chain is linked into;
First adding module 404, for adding block on main block chain according to the agreement of wound generation block;
Second creation module 405 for creating branch's block on main block chain, and creates branched chain root zone block;
Second computing module 406, for calculating the short hash value of branched chain root zone block;
Second memory module 407, short hash value for obtaining the second computing module 406 is as authorization Hash deposit the
In branch's block of two creation modules 405 creation;
Third computing module 408, for calculating the hash value of branch's block;
Third memory module 409, the second wound of hash value deposit of branch's block for obtaining third computing module 408
It models in the branched chain root zone block that block 405 creates, is linked into branched chain;
First authentication module 410, for when that need to add new block in branched chain, whether verifying branched chain root zone block
It is legal;
Read module 411, for reading branched chain when the first authentication module 410 verifying branched chain root zone block is legal
Agreement;
Second authentication module 412, the validity of the agreement for verifying the branched chain that read module 411 is read;
Second adding module 413, for when the second authentication module verify 412 branched chains agreement it is effective when, according to point
The agreement of branch adds new block in branched chain.
Specifically, in the present embodiment, the first creation module specifically includes: the first creating unit, the first computing unit,
First adding unit, the second creating unit, the second computing unit, the second adding unit, third creating unit, third computing unit
With third adding unit;
First creating unit, for identifying creation wound generation block according to criterion of proof, net load, descriptor and branch;
First computing unit, for calculating the net load Hash of wound generation block according to the net load of the first creating unit of creation
Value;
First adding unit, 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, for calculating the net load hash value of standard block according to the net load of standard block;
Second adding unit, for adding timestamp for standard block;
Third 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;
Third computing unit, for calculating the net load hash value of branch's block according to the net load of branch's block;
Third adding unit, for adding timestamp for branched chain root zone block.
Specifically, the second creation module specifically includes: the 4th creating unit, the 4th computing unit and the 4th adding module;
4th creating unit, for identifying creation branched chain root zone according to criterion of proof, net load, descriptor and branch
Block;
The net load of 4th computing unit, the branched chain root zone block for being created according to the 4th creating unit calculates branched chain
The net load hash value of root zone block;
4th adding module, for adding timestamp for branched chain root zone 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, specifically for the wound generation block for calculating the first computing unit hash value as standard block
Previous block hash value be stored in standard block, be linked into main block chain.
Further, the second computing module is specifically used for: according in branched chain root zone block criterion of proof, net load, retouch
State the short hash value that symbol, branch's mark, net load hash value and timestamp calculate branched chain root zone block;
Specifically, the second memory module is specifically used for: the short Hash for the branched chain root zone block that the second computing module is calculated
It is worth and is stored in branch's block as the authorization Hash of branch's block;
Specifically, third computing module is specifically used 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 authorization Hash
Calculate the hash value of branch's block;
Specifically, third memory module is specifically used for: the hash value for branch's block that third computing module is calculated as
The previous block hash value of branched chain root zone block is stored in branched chain root zone block.
Preferably, the present apparatus further include: the 4th computing module and the 4th memory module;
4th computing module makes for the criterion of proof according to branch's block in previous block on main block chain
With previous block hash value, net load hash value, timestamp, proof of branch's block in the previous block on main block chain
Standard, descriptor, branch's mark, random number and authorization Hash calculate previous block hash value;
4th memory module, the previous block hash value for calculating the 4th computing module are stored in branch's block.
Further, authentication module includes: the first authentication unit and the second authentication unit;
First authentication unit, for verify the previous block hash value in branched chain root zone block whether on main block chain
The hash value of branch's block is identical;
Second authentication unit, for verifying previous block hash value and the primary area of branched chain root zone block when the first authentication unit
When the hash value of branch's block on block chain is identical, verify branched chain root zone block short hash value whether on main block chain point
Authorization Hash in branch block is identical;
Specifically, read module, specifically for verifying short hash value and the master of branched chain root zone block when the second authentication unit
When the authorization Hash in branch's block on block chain is identical, the agreement of branched chain is read.
Further, the first authentication unit includes: the first computation subunit and the first verifying subelement, and the second verifying is single
Member includes: the second computation subunit and the second verifying subelement;
First computation subunit, for according to previous block hash value, random number, the net load Hash in branch's block
Value, timestamp, criterion of proof, descriptor, branch's mark, authorization Hash and net load calculate the hash value of branch's block;
First verifying subelement, for verify branch's block that the first computation subunit is calculated hash value whether with
The previous block hash value of branched chain root zone block is identical;
Second computation subunit, for verifying the area, branch that the first computation subunit is calculated when the first verifying subelement
When the hash value of block is identical as the previous block hash value of branched chain root zone block, according to the net load Hash of branched chain root zone block
Value, timestamp, criterion of proof, descriptor and branch's mark calculate the short hash value of branched chain root zone block;
Second verifying subelement, for verifying the short hash value for the branched chain root zone block that the second computation subunit is calculated
It is whether identical as the authorization hash value of branch block;
Read module, specifically for when the second verifying subelement verifying is identical as the authorization hash value of branch block, reading
Take the agreement of branched chain simultaneously.
Further, device further include: judgment module and selecting module;
Judgment module, the hash value for judging whether there is other previous block hash values and branch's block are equal
Branched chain root zone block;
Selecting module, for there are the hash values of another previous block hash value and branch's block when judgment module judgement
When equal branched chain root zone block, the longest branched chain of length is chosen as legal point in the branched chain being connected with branch block
Branch;
Read module is also used to read and close after selecting module chooses the longest branched chain of length as legal branched chain
The agreement of method branched chain.
Read module, specifically for reading the association of branched chain in branch's block on branched chain root zone block or main block chain
View.
Specifically, authentication module includes: third authentication unit and the 4th authentication unit;
Whether third authentication unit, the hash value for verifying all blocks in branched chain meet the agreement of branched chain;
Whether the 4th authentication unit, the timestamp for verifying all blocks in branched chain meet the agreement of branched chain.
Further, third authentication unit includes: that third computation subunit, the first judgment sub-unit and third verifying are single
Member;
Third computation subunit, for calculating the hash value of first block in branched chain;
First judgment sub-unit, for judging that third computation subunit calculates the hash value of first block in branched chain
It is whether identical with the previous block hash value in next block;
Third verifies subelement, for judge the in third computation subunit calculating branched chain when the first judgment sub-unit
When the hash value of one block is identical with previous block hash value in next block, next block in branched chain is verified
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 format;
Subelement is added, for judging that the timestamp of each block in branched chain is all satisfied branch when the second judgment sub-unit
When the format of timestamp as defined in chain agreement, 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 scope of protection of the present invention is not limited thereto,
Anyone skilled in the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, all
It is covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be subject to the protection scope in claims.
Claims (24)
1. a kind of working method of multi-protocols block chain, which is characterized in that the described method includes:
Step S1: creation wound generation block, and standard block is created according to the agreement of wound generation block;Calculate the hash value of wound generation block
And it is deposited into the standard block, it is linked into main block chain, and according to the agreement of the wound 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 zone
Block;The short hash value of the branched chain root zone block is calculated, and is stored in the area, branch for the short hash value as authorization Hash
Block;It calculates the hash value of branch's block and is deposited into the branched chain root zone block, be linked into branched chain;
Step S3: when needing to add new block in the branched chain, whether legal, such as if verifying the branched chain root zone block
Fruit is illegal, then adds new block failure in the branched chain, if legal, read the agreement of the branched chain and test
The validity of the branched chain is demonstrate,proved, if branched chain is effective, is added in the branched chain according to the agreement of the branched chain
New block adds new block failure if branched chain is invalid in the branched chain.
2. the method according to claim 1, wherein
Generation block is created in the creation, specifically: the creation area Chuan Shi is identified according to criterion of proof, net load, descriptor and branch
Block calculates net load hash value according to the net load, and adds timestamp for the wound generation block;
It is described according to wound generation block agreement create standard block, specifically: according to criterion of proof, net load, descriptor and
Branch's mark creates standard block according to the agreement of wound generation block, calculates net load hash value according to the net load, and be institute
State standard block addition timestamp;
It is described that branch's block is created on the main block chain, specifically: according to criterion of proof, net load, descriptor and divide
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 adds timestamp.
3. the method according to claim 1, wherein the creation branched chain root zone block, specifically: according to proof
Standard, net load, descriptor and branch's mark creation branched chain root zone block, calculate net load Hash according to the net load
Value, and timestamp is added for the branched chain root zone block.
4. the method according to claim 1, wherein the Hash of generation block is created in the calculating in the step S1
Be worth and be deposited into the standard block, be linked into main block chain, specifically: 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. described to calculate the branched chain root zone the method according to claim 1, wherein in the step S2
The short hash value of block, and it is stored in branch's block using the short hash value as authorization Hash, specifically: according to the branch
Criterion of proof, net load, descriptor, branch's mark, net load hash value and timestamp in chain root zone block calculate described point
The short hash value of branch root zone block, and using the short hash value of the branched chain root zone block as the authorization Hash of branch's block
It is stored in branch's block;
The hash value for calculating branch's block is simultaneously deposited into the branched chain root zone block, specifically: according to area, 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 authorization Hash calculate the hash value of branch's block, and by branch's block
Hash value be stored in the branched chain root zone block as the previous block hash value of the branched chain root zone block.
6. according to the method described in claim 5, it is characterized in that, being gone back before the hash value for calculating branch's block
Include: the previous block hash value calculated branch's block on main block chain and be deposited into branch's block, specifically: 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 authorization Hash calculate institute
It states previous block hash value and is stored in branch's block.
7. according to the method described in claim 5, it is characterized in that, in the step S3, the verifying branched chain root zone
Whether block is legal, specifically:
Step F1: verify previous block hash value in the branched chain root zone block whether with the area, branch on the main block chain
The hash value of block is identical, if identical, thens follow the steps F2, and otherwise the branched chain root zone block is illegal, in the branched chain
The new block failure of upper addition;
Step F2: verify the branched chain root zone block short hash value whether with awarding in branch's block on the main block chain
It is identical to weigh Hash, if identical, read the agreement of the branched chain and verifies the validity of the branched chain, if effectively,
New block success is then added in the branched chain, if in vain, new block failure is added in the branched chain, otherwise
The branched chain root zone block is illegal, and new block failure is added in the branched chain.
8. the method according to the description of claim 7 is characterized in that the step F1, specifically: according in branch's block
Previous block hash value, random number, net load hash value, timestamp, criterion of proof, descriptor, branch mark, authorization 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, thens follow the steps F2, and otherwise branched chain root zone block is illegal,
The branched chain is considered as invalid;
The step F2, specifically: according to the net load hash value, timestamp, criterion of proof, description of the branched chain root zone block
Symbol and branch's mark calculate the short hash value of the branched chain root zone block, and the short hash value for verifying the branched chain root zone block is
It is no identical as authorization hash value in branch's block, if they are the same, then the agreement of the branched chain is read, otherwise branched chain root
Block is illegal, and the branched chain is considered as invalid.
9. according to the method described in claim 7, the agreement for reading the branched chain and verifying the effective of the branched chain
Property before further include: judge whether there is 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 the longest branched chain of length in the branched chain being connected with branch's block as legal point
Branch 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
It takes the agreement of the branched chain and verifies the validity of the branched chain.
10. the method according to claim 1, wherein the agreement for reading the branched chain, specifically: from
The agreement of branched chain is read in branch's block on the branched chain root zone block or main block chain.
11. the method according to claim 1, wherein there is the verifying branched chain in the step S3
Effect property, specifically: whether the hash value for verifying 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 branch, is such as verified, then the branched chain is effective, otherwise
The branched chain is invalid.
12. according to the method for claim 11, which is characterized in that the Hash of all blocks in the verifying branched chain
Whether value meets the agreement of branched chain, specifically: the hash value of first block in the branched chain is calculated, is judged and next
Whether the previous block hash value in a block is identical, if identical, described in first block satisfaction in the branched chain
The agreement of branched chain continues to verify the agreement whether other blocks in the branched chain meet the branched chain, and such as described point
The agreement of the branched chain is not satisfied in all blocks on branch, and then the branched chain is considered as invalid;
Whether the timestamp of all blocks meets the agreement of branched chain in the verifying branched chain, specifically: judge respectively
Whether the timestamp of each block is all satisfied the format 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 adds in the branched chain newly according to the agreement of branched chain
Block, the then institute if the format of timestamp as defined in branched chain agreement is not satisfied in the timestamp of block each in the branched chain
It states branched chain and is considered as invalid.
13. a kind of equipment of multi-protocols block chain, which is characterized in that described device includes:
First creation module, for creating generation block and creating standard block according to the agreement of wound generation block;
First computing module, for calculating the hash value of the wound generation block;
The hash value of first memory module, the wound generation block for obtaining first computing module is stored in the standard
Block is linked into main block chain;
First adding module, for adding block on the main block chain according to the agreement of the wound generation block;
Second creation module for when there is new business demand, creating branch's block on the main block chain, and creates and divides
Branch root zone block;
Second computing module, for calculating the short hash value of the branched chain root zone block;
Second memory module, the short hash value for obtaining second computing module is as described in authorization Hash deposit
Branch's block;
Third computing module, for calculating the hash value of branch's block;
Third memory module, the hash value deposit described second of branch's block for obtaining the third computing module
In the branched chain root zone block of creation module creation, it is linked into branched chain;
First authentication module, for verifying the branched chain root zone block when needing to add new block in the branched chain
It is whether legal;
Read module, for reading the branched chain when first authentication module verifying branched chain root zone block is legal
Agreement;
Second authentication module, for verifying the validity for the branched chain that the read module is read;
Second adding 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, which is characterized in that first creation module specifically includes: the first creation
Unit, the first computing unit, the first adding unit, the second creating unit, the second computing unit, the second adding unit, third wound
Build unit, third computing unit and third adding unit;
First creating unit, for identifying creation wound generation block according to criterion of proof, net load, descriptor and branch;
First computing unit, for calculating the net of wound generation block according to the net load for creating first creating unit
Load hash value;
First adding unit, 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, for calculating the net load hash value of standard block according to the net load of the standard block;
Second adding unit, for adding timestamp for the standard block;
The third 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;
The third computing unit, for calculating the net load hash value of branch's block according to the net load of branch's block;
The third adding unit, for adding timestamp for branch's block.
15. device according to claim 13, which is characterized in that second creation module specifically includes: the 4th creation
Unit, the 4th computing unit and the 4th adding module;
4th creating unit, for identifying creation branched chain root zone according to criterion of proof, net load, descriptor and branch
Block;
4th computing unit, the net load of the branched chain root zone block for being created according to the 4th creating unit, which calculates, to be divided
The net load hash value of branch root zone block;
4th adding module, for adding timestamp for the branched chain root zone block.
16. device according to claim 13, which is characterized in that first computing module is specifically used 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 wound generation block for calculating first computing unit hash value as described in
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, which is characterized in that second computing module is specifically used for: according to described
Criterion of proof, net load, descriptor, branch's mark, net load hash value and timestamp in branched chain root zone block calculate institute
State the short hash value of branched chain root zone block;
Second memory module, is specifically used for: by the short of the branched chain root zone block of second computing module calculating
Hash value is stored in branch's block as the authorization Hash of branch's block;
The third computing module, is specifically used 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 authorization Hash are calculated
The hash value of branch's block;
The third memory module, is specifically used for: the hash value for branch's block that the third computing module is calculated is made
The branched chain root zone block is stored in for the previous block hash value of the branched chain root zone block.
18. device according to claim 17, which is characterized in that further include: the 4th computing module and the 4th memory module;
4th computing module, for the proof mark according to branch's block in previous block on main block chain
Standard, using previous block hash value of the branch's block in the previous block on main block chain, net load hash value, when
Between stamp, criterion of proof, descriptor, branch's mark, random number and authorization Hash calculate the previous block hash value;
4th memory module, described point of the previous block hash value deposit for calculating the 4th computing module
Branch block.
19. device according to claim 17, which is characterized in that the authentication module includes: the first authentication unit and
Two authentication units;
First authentication unit, for verify the previous block hash value in the branched chain root zone block whether with the primary area
The hash value of branch's block on block chain is identical;
Second authentication unit, for verifying the previous block Hash of the branched chain root zone block when first authentication unit
Be worth it is identical with the hash value of branch's block on the main block chain when, verify the branched chain root zone block short hash value whether
It is identical with the authorization Hash in branch's block on the main block chain;
The read module, specifically for verifying short hash value and the institute of the branched chain root zone block when second authentication unit
State authorization 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, which is characterized in that first authentication unit includes: that the first calculating is single
Member and the first verifying subelement, second authentication unit include: the second computation subunit and the second verifying subelement;
First computation subunit, for according to the previous block hash value in branch's block, random number, net load
Hash value, timestamp, criterion of proof, descriptor, branch's mark, authorization Hash and net load calculate branch's block
Hash value;
The first verifying subelement, for verifying the Hash for branch's block that first computation subunit is calculated
Whether identical as the previous block hash value of the branched chain root zone block it is worth;
Second computation subunit is calculated for verifying first computation subunit when the first verifying subelement
Branch's block hash value it is identical as the previous block hash value of the branched chain root zone block when, according to the branched chain
Net load hash value, timestamp, criterion of proof, descriptor and the branch's mark of root zone block calculate the branched chain root zone block
Short hash value;
The second verifying subelement, for verifying the branched chain root zone block that second computation subunit is calculated
Whether short hash value is identical as the authorization hash value of branch's block;
The read module, specifically for the authorization hash value phase when the second verifying the subelement verifying and branch's block
Meanwhile reading the agreement of the branched chain.
21. device according to claim 19, which is characterized in that further include: judgment module and selecting module;
The judgment module, the hash value for judging whether there is other previous block hash values and branch's block are equal
Branched chain root zone block;
The selecting module, for there are another previous block hash value and branch's blocks when judgment module judgement
When the equal branched chain root zone block of hash value, the longest branched chain of length is chosen in the branched chain being connected with branch's block
As legal branched chain;
The read module is also used to read after the selecting module chooses the longest branched chain of length as legal branched chain
Take the agreement of the legal branched chain.
22. device according to claim 13, which is characterized in that the read module is specifically used for working as the verifying mould
When the block verifying branched chain root zone block is legal, reads and divide in branch's block on the branched chain root zone block or main block chain
The agreement of branch.
23. device according to claim 13, which is characterized in that the authentication module includes: third authentication unit and
Four authentication units;
Whether the third authentication unit, the hash value for verifying all blocks in the branched chain meet the association of branched chain
View;
Whether the 4th authentication unit, the timestamp for verifying all blocks in the branched chain meet the association of branched chain
View.
24. device according to claim 23, which is characterized in that the third authentication unit includes: that third calculates son list
Member, the first judgment sub-unit and third verify subelement;
The third computation subunit, for calculating the hash value of first block in the branched chain;
First judgment sub-unit, for judging that the third computation subunit calculates first block in the branched chain
Hash value and next block in previous block hash value it is whether identical;
The third verifies subelement, for judging described in the third computation subunit calculating when first judgment sub-unit
When the hash value of first block in branched chain is identical with 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 format 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 format of timestamp as defined in branched chain agreement, new area is added in the branched chain according to the agreement of branched chain
Block.
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 CN107276762A (en) | 2017-10-20 |
CN107276762B true 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) |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108009445B (en) * | 2017-11-30 | 2021-05-11 | 成都蓝海贝信息技术有限公司 | Semi-centralized trusted data management system |
TWI659373B (en) * | 2018-02-14 | 2019-05-11 | 財團法人工業技術研究院 | Blockchain system and method thereof |
CN108460596B (en) * | 2018-02-27 | 2020-08-25 | 周伟 | Quantization value distribution transfer method based on block chain |
CN108322304B (en) * | 2018-02-28 | 2021-12-07 | 海峡小鹿有限公司 | Calculation method and apparatus for workload certification, electronic device, program, and medium |
CN108768918B (en) * | 2018-03-15 | 2021-09-24 | 中山大学 | Access control method based on authorization management chain |
CN108595535B (en) * | 2018-03-30 | 2020-11-17 | 李欣宇 | Knowledge question-answering system and method based on same-root double-chain block chain |
CN108616574B (en) * | 2018-03-30 | 2020-06-16 | 华为技术有限公司 | Management data storage method, device and storage medium |
WO2019195639A1 (en) * | 2018-04-05 | 2019-10-10 | Neji, Inc. | Programmatic creation of blockchains |
CN108390894A (en) * | 2018-04-20 | 2018-08-10 | 黄绍进 | A kind of personal information based on block chain really weighs method and block chain client |
CN110738472B (en) * | 2018-07-20 | 2023-10-03 | 北京航空航天大学 | 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 |
CN109472600B (en) * | 2018-11-20 | 2021-01-01 | 深圳市墨者安全科技有限公司 | Block chain credibility verification method and device |
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 |
CN110535872B (en) * | 2019-09-12 | 2021-06-01 | 腾讯科技(深圳)有限公司 | Method and apparatus for processing data requests in a blockchain network |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2954655C (en) * | 2014-07-11 | 2021-04-06 | Ribbit.me! USA Inc. | Distributed ledger protocol to incentivize transactional and non-transactional commerce |
CN105488675B (en) * | 2015-11-25 | 2019-12-24 | 布比(北京)网络技术有限公司 | Block chain distributed shared general ledger construction method |
CN106157142A (en) * | 2016-06-30 | 2016-11-23 | 惠众商务顾问(北京)有限公司 | A kind of block chain common recognition and synchronous method, system and device |
CN106533690B (en) * | 2016-09-27 | 2020-11-20 | 布比(北京)网络技术有限公司 | Digital asset processing method adopting block chain asset processing terminal |
-
2017
- 2017-05-08 CN CN201710318169.5A patent/CN107276762B/en active Active
Also Published As
Publication number | Publication date |
---|---|
CN107276762A (en) | 2017-10-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107276762B (en) | A kind of working method and device of multi-protocols block chain | |
CN110113388B (en) | Improved clustering algorithm-based block chain system consensus method and device | |
AU2017272163B2 (en) | Verification system and method with extra security for lower-entropy input records | |
CN110059494B (en) | Privacy protection method for block chain transaction data and block chain system | |
CN112257095B (en) | Method for selecting alliance chain consensus node | |
CN108322306A (en) | A kind of cloud platform reliable journal auditing method towards secret protection based on trusted third party | |
US10846372B1 (en) | Systems and methods for trustless proof of possession and transmission of secured data | |
CN110362357A (en) | A kind of configuration file management method and device of application program | |
CN110213038B (en) | Method and system for forming consensus of block chain | |
CN112069550B (en) | Electronic contract evidence-storing system based on intelligent contract mode | |
CN108400981A (en) | The public cloud auditing system and method for lightweight and secret protection in smart city | |
CN109861829B (en) | Cloud data justice auditing system supporting dynamic updating and auditing method thereof | |
CN111488134B (en) | Public random number generation method and device based on block chain | |
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 | |
CN112613601A (en) | Neural network model updating method, device and computer storage medium | |
CN110113334A (en) | Contract processing method, equipment and storage medium based on block chain | |
CN110225012A (en) | The ownership inspection and update method of one outer bag data based on alliance's chain | |
CN111555860B (en) | Block chain link point consensus method, device, electronic equipment and storage medium | |
Zhao et al. | Fuzzy identity-based dynamic auditing of big data on cloud storage | |
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 | |
CN113556393A (en) | Multi-type intermodal data exchange system and method based on block chain | |
CN110990808B (en) | Notarization number shaking method based on block chain | |
Zou et al. | Dynamic provable data possession based on ranked Merkle hash tree |
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 |