CN109522362A - Incomplete markets synchronous method, system and equipment based on block chain data - Google Patents
Incomplete markets synchronous method, system and equipment based on block chain data Download PDFInfo
- Publication number
- CN109522362A CN109522362A CN201811206580.4A CN201811206580A CN109522362A CN 109522362 A CN109522362 A CN 109522362A CN 201811206580 A CN201811206580 A CN 201811206580A CN 109522362 A CN109522362 A CN 109522362A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- target block
- chain
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 62
- 230000001360 synchronised effect Effects 0.000 title claims abstract description 32
- 239000012634 fragment Substances 0.000 claims abstract description 152
- 238000003860 storage Methods 0.000 claims abstract description 62
- 238000012545 processing Methods 0.000 claims description 53
- 238000012795 verification Methods 0.000 claims description 35
- 238000004590 computer program Methods 0.000 claims description 20
- 241001269238 Data Species 0.000 claims description 15
- 238000004891 communication Methods 0.000 claims description 7
- 230000008859 change Effects 0.000 claims description 5
- 238000005520 cutting process Methods 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 238000012360 testing method Methods 0.000 claims 1
- 230000009467 reduction Effects 0.000 abstract description 3
- 230000000694 effects Effects 0.000 abstract description 2
- 230000003993 interaction Effects 0.000 description 33
- 230000000977 initiatory effect Effects 0.000 description 15
- 238000004422 calculation algorithm Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 14
- 238000003032 molecular docking Methods 0.000 description 12
- 230000005540 biological transmission Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 7
- 238000013500 data storage Methods 0.000 description 6
- 238000009826 distribution Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 6
- 241000251468 Actinopterygii Species 0.000 description 3
- 210000004556 brain Anatomy 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000005611 electricity Effects 0.000 description 3
- 230000002708 enhancing effect Effects 0.000 description 3
- 238000013467 fragmentation Methods 0.000 description 3
- 238000006062 fragmentation reaction Methods 0.000 description 3
- 239000003999 initiator Substances 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 230000001105 regulatory effect Effects 0.000 description 3
- 201000001880 Sexual dysfunction Diseases 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 231100000872 sexual dysfunction Toxicity 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to block chain technical field more particularly to a kind of incomplete markets synchronous method, system and equipment based on block chain data, wherein the described method includes: requesting synchronous target block to destination node;Receive requested target block;If received node is the non-fully node, the target block is forwarded to the complete node;The complete node verifies the received target block of institute, if by the target block fragment and being stored the fragment data of acquisition to business chain by verifying.The embodiment of the present invention has reached following technical effect: solving the continuous growth existing in the prior art with block chain data volume, time spent by shared data is continuously increased, it is easy to cause the congestion of block chain network and block storage burden, to reach the reduction shared period, improve sharing efficiency, save storage quantity, the purpose to guarantee data security.
Description
Technical field
The present invention relates to block chain technical field more particularly to a kind of incomplete markets sides of synchronization based on block chain data
Method, system and equipment.
Background technique
Block chain technology is also referred to as distributed account book technology, is substantially a kind of distributed interconnection data of decentralization
Library.Block chain network can be considered using the network of block chain Technical Architecture, include multiple block chain nodes in the block chain network,
Either block chain node can correspond at least one block chain, and either block chain may include at least one block.
In the prior art, the application of block chain can be divided into two classes:
Publicly-owned chain: all nodes can participate in common recognition, competition book keeping operation power.Publicly-owned chain be towards masses, it is any individual or
Person group can read, send transaction and transaction can obtain effective confirmation of the block chain, participate in the block chain of common recognition.Number
According to open.Its main feature is that: neutrality, open, transactions velocity is slow, needs " digging mine " or similar to common recognition method, commonly uses P2P network, resist
Examination property is high.
License chain: the node being only licensed could know together, compete book keeping operation power and create block, include privately owned chain, alliance
All non-publicly-owned chains such as chain, enterprise's chain.Data can be openly or underground.Wherein, privately owned chain refers to write-in permission in a group
Knit the block chain in hand;Alliance's chain refer to by several personal or tissues, company, government control block chain.The characteristics of permitting chain
Be: transactions velocity is fast, not needing the whole network common recognition, transaction cost of " digging mine " class, low (transaction only needs several permit nodes verifyings i.e.
Can);It can examine, the mainstream of commercial application field can be occupied.
Specifically, the process of business datum cochain (being stored in block chain network) includes three phases:
1, the stage is accepted, it can be understood as the business datum to cochain is connect by a certain block chain node in block chain network
It receives, and the business datum is accepted by the block chain node;
2, it knows together the stage, it can be understood as block chain node needs after accepting the business datum by block chain network
In other block chain nodes participate in carrying out common recognition processing to the business datum, after business datum is by common recognition, can enter and deposit
The storage stage;
3, memory phase, it can be understood as the business datum that block chain node passes through common recognition carries out cochain processing.
Common recognition method i.e. common recognition algorithm in block chain technology is realized between different blocks chain node in block chain network
Establish the important method for trusting, obtaining equity.So-called common recognition method is the ballot by special joint, in a short period of time
The verifying and confirmation of complete swap;To a transaction, if the incoherent multiple a nodes of interests can reach common understanding, so that it may
To think that the whole network can also reach common understanding to this.A kind of data structure of the block chain as storing data in chronological order, can prop up
Hold different common recognition methods.
Under different common recognition methods, the generating process of block can be slightly different.But on the whole, each node is received in processing
After the block information arrived, process of exchange is substantially all according to following process: node receives multiple Transaction Informations, is put into trading pit
In;Node obtains the Transaction Information being currently received from trading pit, is ranked up to transaction and executes in order;It is finished it
Afterwards, node generates intact block, is finally broadcasted.
Block chain is as emerging technology, and perfect there are also many problems demands, block chain agreement is faced with the obstacle of scalability.
The scaling concern of block chain is roughly divided into two aspects:
1, the extension sexual dysfunction of handling capacity of trading and trade confirmation delay;
2, sexual dysfunction is extended caused by block chain overall situation account book data storage bottleneck.
By taking this service request of block cochain in business datum as an example, in the common recognition stage, either block chain node is being received
To after the request of block cochain, need to broadcast itself to this cochain from all block chain nodes other in block chain network to the whole network
The signature of request, can cochain after through common recognition.It has been used in block chain existing, either publicly-owned chain is privately owned
Chain or alliance's chain are all that transaction is handled on a chain, it is contemplated that block chain node is numerous, when there is common recognition demand, holds
Easily lead to block chain network congestion.Such as: there is different mechanisms in certain company, and the business of these mechanisms is all such as placed on a chain
On, the pressure that will cause processing business on chain increases, and the processing business time can be elongated, is unfavorable for the expansion of business.Also, in area
The signature for needing to store all block chain nodes of the whole network in block, as the node on block chain is continuously increased, shared data and altogether
Knowing the spent time can also be continuously increased, and cause storage burden to block in this way.
Block chain network is the network system based on distributed principle, theoretically speaking the content on each network node
It is consistent, wants to obtain the data in block chain, as long as being obtained from wherein any one node or local node.
But in actual application, local node can freely configure the type of current local node.For example, can be with
The full record node (full-node) comprising intact block chain data selectively is configured by local node, or includes part
The non-full record node (n-full-node) of block chain data.
Which data is locally stored can be determined by current local node type and concrete configuration, therefore local node
Not necessarily there are all data of intact block chain in current network in block chain.Non- full record node is configured in local node
When, the data needed for carrying out needing to obtain to other nodes of place block chain network when data are synchronous, currently existing number
It is difficult to realize carry out safety in above-mentioned scene according to synchronous method and efficient data is synchronous.
Thus, it needs to find a kind of new block chain synchronization scheme, to overcome the above problem.
Summary of the invention
In view of the deficiencies of the prior art, the present invention provides a kind of incomplete markets sides of synchronization based on block chain data
Method, system and equipment, solve the continuous growth existing in the prior art with block chain data volume, spent by shared data
Time be continuously increased, be easy to cause the congestion of block chain network and block storage burden, to reach the reduction shared period, mention
High sharing efficiency, saving storage quantity, the purpose to guarantee data security, concrete scheme are as follows:
In a first aspect, the present invention provides a kind of incomplete markets synchronous method based on block chain data, the block
Chain includes main chain and multiple business chains, and the business chain includes a complete node for participating in main chain common recognition and multiple participation business
The non-fully node of chain common recognition, which comprises
Synchronous target block is requested to destination node;
Receive requested target block;
If received node is the non-fully node, the target block is forwarded to the complete node;
The complete node verifies the received target block of institute, if by verifying, by the target block fragment
And the fragment data of acquisition is broadcasted to business chain to store.
Preferably, the complete node verifies the received target block of institute, comprising:
The preposition Hash of the more received target block of complete node and the newest block of the complete node
Hash it is whether consistent, if unanimously, the target block is carried out common recognition verification by the complete node, if by verification,
Show to pass through verifying.
Preferably, synchronous target block is requested to destination node, comprising:
The main chain is divided into multiple block subchains;
The target block is synchronized to the request of the destination node of each block subchain to obtain in each block subchain
Newest target block.
Preferably, described will be before the target block fragment, which comprises
If receiving at least two target blocks, at least two target block is respectively by the different block subchains
Node is sent, and a corresponding upper target block is identical, then according to the change time-sequencing at least two target block
At least two target block is added in the block chain where the complete node.
It is preferably, described by the target block fragment, comprising:
It is one or more fragment datas by the target block cutting, and one or more of fragment datas is carried out
Random coded is corresponding one or more target fragment datas.
Preferably, described to broadcast the fragment data of acquisition to business chain to store, including
Obtain the Hash of the target block and the Hash of each target fragment data, by the Hash of the target block and
The Hash of each target fragment data is broadcasted together to business chain to store.
Preferably, the method also includes:
Obtain the Hash of the target fragment data;
According to the corresponding target block of Hash lookup of the target fragment data and obtain corresponding target fragment data
Content;
The Hash of the target fragment data and the target fragment data content are stored to the non-fully node institute
Business chain.
Second aspect is known together system the present invention provides a kind of region, and the block chain includes main chain and multiple business chains,
The business chain includes the non-fully node of the complete node for participating in main chain common recognition and multiple participation business chain common recognitions, described
System includes: multiple
Request module, for requesting synchronous target block to destination node;
Receiving module, for receiving requested target block;
The target block is forwarded to described by scheduler module if being the non-fully node for received node
Complete node;
Processing module verifies the received target block of institute for the complete node, if by verifying, it will be described
Target block fragment simultaneously broadcasts the fragment data of acquisition to business chain to store.
The third aspect is known together equipment the present invention provides a kind of region, and the block chain includes main chain and multiple business chains,
The business chain includes the non-fully node of the complete node for participating in main chain common recognition and multiple participation business chain common recognitions, described
Equipment includes:
Communication bus, for realizing the connection communication between processor and memory;
Memory, for storing computer program;
Processor, for executing the computer program to realize following steps:
Synchronous target block is requested to destination node;
Receive requested target block;
If received node is the non-fully node, the target block is forwarded to the complete node;
The complete node verifies the received target block of institute, if by verifying, by the target block fragment
And the fragment data of acquisition is broadcasted to business chain to store.
Fourth aspect, the present invention provides a kind of computer readable storage mediums, are stored thereon with computer program, described
The method of above-mentioned first aspect is realized when computer program is executed by processor.
The utility model has the advantages that the incomplete markets synchronous method and system of the invention based on block chain data, by using industry
The multiple nodes being engaged on chain carry out piecemeal storage to block, change the distributed storage in the prior art based on block chain and are adopted
The mode of global storage can satisfy the biggish block storage of data volume;Avoid under global storage mode it is potential such as
The risk that block is integrally damaged under the situations such as delay machine, operation troubles can also be from the area of other normal operations even if risk exists
Synchrodata is got in block chain node, improves the safety of data storage;Due to the anti-tamper characteristic that block chain has, cause
It distort either side can not to the storing data in block chain privately, so that the safety of storing data be effectively ensured
Property.
Detailed description of the invention
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, attached drawing
In embodiment do not constitute any limitation of the invention, for those of ordinary skill in the art, do not paying creativeness
Under the premise of labour, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is the incomplete markets synchronous method embodiment flow diagram the present invention is based on block chain data.
Fig. 2 is the incomplete markets synchronization system example structure schematic diagram the present invention is based on block chain data.
Fig. 3 is the incomplete markets synchronizer example structure schematic diagram the present invention is based on block chain data.
Specific embodiment
Technical solution of the present invention is described in further detail with embodiment with reference to the accompanying drawing, this be it is of the invention compared with
Good embodiment.It should be appreciated that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments;
It should be noted that in the absence of conflict, the feature in embodiment and embodiment in the present invention can be combined with each other.Base
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts it is all its
His embodiment, shall fall within the protection scope of the present invention.
The main thought of technical solution of the embodiment of the present invention: synchronous target block is requested to destination node;Reception is requested
Target block;If received node is the non-fully node, the target block is forwarded to the complete node;Institute
It states complete node to verify the received target block of institute, if by verifying, by the target block fragment and by acquisition
Fragment data is stored to business chain.
It is right in conjunction with appended figures and specific embodiments in order to better understand above-mentioned technical solution
Above-mentioned technical proposal is described in detail.
Embodiment one
One embodiment of the invention provides a kind of incomplete markets synchronous method based on block chain data, the block chain
Including main chain and multiple business chains, the business chain includes a complete node for participating in main chain common recognition and multiple participation business chains
The non-fully node of common recognition, as shown in Figure 1, the method for data synchronization can specifically include following steps:
Step S101 requests synchronous target block to destination node;
In the embodiment of the present application, this step is same to the destination node of synchronization object initiation data for business chain timing
Step.Specifically, the destination node that can choose short distance sends the synchronization request to destination node;Business chain receives target section
The synchrodata of point passback.
Step S102 receives requested target block;
In the embodiment of the present application, business chain can forward requested target block, the interaction by receiving interaction platform
Platform can be used for receiving the establishment of item request of project initiator transmission, and create corresponding business item, when the traffic item
When mesh is in operating status, which also can receive user and requests for the business processing of the business item, and according to this
Business item and business processing request carry out business processing.
Wherein, which can be crowd and raises platform, then the crowd raise platform both can receive raised by the crowd that the side of raising money is sent
Establishment of item request, and creates corresponding crowd and raises project, also can receive by raising request with recognizing of throwing that human hair send, this recognize raise request can
To be to raise recognizing for project for the crowd in fund raising state to raise request.
In the embodiment of the present application, interaction platform externally provides docking standard agreement, specifically, each business chain network can
With the Application Programming Interface (API) provided according to interaction platform, the client of built-in standard agreement is developed, is docked with interaction platform
As a common recognition node.
In the embodiment of the present application, a node accepts the business of block, which can be referred to as service handling node,
And initiation is to the common recognition of the business.It can also include multiple nodes, if these nodes participate in the business other than the node
Common recognition processing, then these nodes can be referred to as common recognition node.In addition, these nodes can also be used as service handling node.
Such as: include 5 nodes (such as: node 1, node 2, node 3, node 4 and node 5), each section in the main chain of block chain
Point is either service handling node can be common recognition node again.Assuming that node 1 has accepted certain business datum, then node 1 this
When be service handling node, node 2, node 3, node 4 and node 5 are then participated in as the common recognition node of the business datum to the industry
The common recognition processing for data of being engaged in.
In the embodiment of the present application, what the node of the main chain of block chain can be used as business datum accepts node, can also be with
Not as the node that accepts of business datum, and as the node or this complete of processing of knowing together for initiating common recognition processing
Node is not specifically limited here.
If the node of the main chain of block chain accepts node as business datum, then the block chain node can be from local
A part of business datum is fished for as business datum to be known together in the business datum of storage accepted, and is directed in order to subsequent
The partial service data fished for initiate common recognition processing.
If complete node of the node of business chain not as the accepting node of business datum and as this common recognition processing, that
The block chain node can fish for a part of business datum as industry to be known together from business datum resource pool to be known together
Business data, in order to the subsequent common recognition processing initiated for the partial service data fished for.
Specifically, the node of the business chain receives the target block that interaction platform is sent, and is receiving mesh to be known together
After marking block, the corresponding business datum for generating the service request to be known together is obtained.Due to user's letter as target block
Breath is sent to the common recognition node, so the node is when receiving the business datum, as long as believing in the business datum comprising user
Breath, can determine that the corresponding business processing data of the target block are accepted by which user side.
The target block is forwarded to described complete by step S103 if received node is the non-fully node
Node.
In the embodiment of the present application, as described above, interaction platform externally provides docking standard agreement, specifically, each industry
The Application Programming Interface (API) that chain network of being engaged in can be provided according to interaction platform develops the client of built-in standard agreement, with friendship
Mutual platform docking becomes an externally common recognition node, referred to as complete node.It is put down in addition, any main body can also be docked to interaction
Platform becomes internally common recognition node, referred to as non-fully node.
Wherein, it is described it is internal common recognition node type can be individual, enterprise, regulatory agency etc., be also possible to credit height,
In credit, the different credit grade such as credit is low.In short, internally the type of common recognition node can divide according to the actual situation, this
Apply without limitation.
Specifically, the client of built-in docking standard agreement can be installed at the terminal for personal or individual, with
After can submit at any time service request by the client;For enterprise, the enterprise especially provided services to the user,
Its application can be docked with configuration center, when it is provided services to the user, this can be submitted to service corresponding business and asked
It asks, for knowing together accordingly, subsystem carries out common recognition verification.
For example, the client of certain electric business platform built-in can dock standard agreement, docked with interaction platform, when user is at this
When electric business platform is done shopping, whether electric business platform request sub-network of knowing together is whether certified products, the user prop up to the purchased commodity of the user
It pays the items such as successfully and carries out common recognition verification, and feed back to user.
For example, ordinary individual can become internally common recognition node, when two internally common recognition node is transferred accounts, wherein one
A internal common recognition node can be with initiating business request, and requesting the corresponding region block chain network of payment technical field is this progress of transferring accounts
Common recognition verification, and this corresponding block of transferring accounts is recorded on the block chain of region.
In short, application scenarios are very rich under the framework of this system, individual can become internally common recognition node, request
The various events of its generation are verified, enterprise can become internally common recognition node, trust of the enhancing user to it.
In the embodiment of the present application, the non-fully node is internal node body, can be assigned in the present system internally
Node body with the identity of node, but these non-fully node is that cannot participate in externally knowing together under the application scenarios of the application
Verification, the external common recognition verification under the application scenarios of the application is executed by complete node.
But non-fully node can execute internally common recognition verification described in the application scenarios of the application, as described above,
Entire society can be included in unified credit system based on the business chain, when the business chain corresponds to a publicly-owned block
When chain network, which only needs to dock with the business chain, will not influence the publicly-owned block link network
The operating of network, that is, main chain script.
Specifically, if the receiving node of the business chain is the non-fully node internally known together, by step
The received target block of S102 is forwarded to the complete node externally known together.
In an alternative embodiment, the leader node that the complete node can be elected by Raft algorithm.In Raft
In agreement, each node in distributed network can be divided into leader node and subordinate's node, which has to the distribution
Subordinate's node in formula network sends the permission of heartbeat message, and subordinate's node in the distributed network is receiving the leader
After the heartbeat message that node is sent, which can be updated in contents such as the information logs of subordinate's node local.In addition,
When initiating business by subordinate's node, which can be sent to the business leader node, and by the leader node
To carry out business processing, or it is distributed to other subordinate's nodes and carries out business processing.
Wherein, which can be when the block chain network brings into operation, and is elected and is produced by each internal consensus node
It is raw, the specific leader node how to elect and the leader node how change-session, can be such as Raft agreement one in the prior art
It causes, the application does not limit this.
Further, in the embodiment of the present application, when the distributed protocol is Raft agreement, due in Raft agreement
Leader node needs each node into the network to send heartbeat message, so the common recognition node is in determining the block chain network
Leader node when, which can be determined by the heartbeat message received.If the common recognition node is in heartbeat message pair
When the time cycle answered is not received by the heartbeat message of leader node transmission, then the common recognition node can wait other common recognition sections
Point initiates election, and receives the ballot request of candidate's node transmission, and by responding ballot request, selects the next term of office
Leader node.Certainly, which can also become chooser node, and send ballot request to other common recognition nodes, then
The common recognition node can also become the leader node in the block chain network.Since the determination of above-mentioned leader node belongs to existing skill
Art, so specific technical detail the application repeats no more.
It should be noted that the complete node or non-fully node can be terminal, e.g., mobile phone, PC/plate electricity
The equipment such as brain or the complete node or non-fully node is also possible to server, then the server can be the non-fully node
Or the non-fully corresponding server of node, and the server can be an individual equipment, be also possible to have multiple devices
The system of composition, as long as the equipment can be used as the non-fully node of the block chain network or non-fully node receives and the common recognition section
The business datum that the corresponding interaction platform of point is sent, and there is the permission that common recognition is initiated in the block chain network, this
Apply to this non-fully node or non-fully node be specially which kind of equipment this and without limitation.
Step S104, the complete node verify the received target block of institute, if by verifying, by the target
Block fragment simultaneously broadcasts the fragment data of acquisition to business chain to store.It is described in detail specific as follows:
Step S1041, the preposition Hash and the complete node of the complete more received target block of node
Newest block Hash it is whether consistent, if unanimously, the target block is carried out common recognition verification by the complete node, if logical
Verification is crossed, then shows to pass through verifying.
As noted previously, as the user information as target block is sent to the common recognition node, so the node is receiving
When to the business datum, as long as in the business datum including user information, can determine the corresponding business datum of the block be by
What which user side accepted.
Specifically, firstly, by the newest block of the preposition Hash of the received target block and the complete node
Unanimously whether Hash be compared, if comparison result is consistent, then it represents that the target block is newest block, such industry
The data of business chain node realize data in the data of destination node and synchronize.Then, in the data of business chain node in target section
On the basis of the data put realize data synchronization, common recognition verification is carried out to the target block, specifically the complete section
The public key that point can be held with itself, verifies the signing messages for including in the target block, is determining the A.L.S.
After breath is by verifying, further according to the content for including in the target block, the head cryptographic Hash of the target block is verified.True
After the head cryptographic Hash of the fixed target block is by verifying, then it can determine the target block by verifying, i.e., target block passes through industry
Business chain verifying, then can be stored in the business chain of itself using the target block as block.Wherein, verification code type can configure
For the common Encryption Algorithm of various those skilled in the art or checking algorithm check code generated.
It should be noted that specifically each node carries out target block according to common recognition algorithm in block chain technical field
Common recognition verification, also, the privacies such as account, transaction record of each node of block chain network Internet access, for verifying.The application
Common recognition checking process and existing common recognition checking process and indistinction in embodiment, therefore will not be repeated in subsequent specification.
The target block cutting is one or more fragment datas by step S1042, and to one or more of points
It is corresponding one or more target fragment datas that sheet data, which carries out random coded,.
Preferably, in order to guarantee the load balancing of each node in entire internally common recognition node set, it may be determined that node set
In each node load capacity, and then can determine the number of each node current idle resource, so that it is determined that the target block is cut
The quantity of the fragment data divided.
Further, in order to further increase the safety of target block, to one or more of fragment datas carry out with
Machine coding.Wherein, the random coded in the embodiment of the present invention and existing random linear network encoding and indistinction, therefore rear
Continuous specification will not repeat.
Step S1043 obtains the Hash of the target block and the Hash of each target fragment data, by the target area
The Hash of the Hash of block and each target fragment data is broadcasted together to business chain to store.
In embodiments of the present invention, this step is mainly used for being recorded in the distribution feelings of the target block stored in business chain
Condition, and establish the Hash of target block, target fragment data Hash set and target block unified resource positioning three it
Between index relative, in case business chain non-fully node store target block when use.
Specifically, the complete node obtains the Hash of target block and the Hash of each target fragment data, according to each
The Hash of a target fragment data forms target fragment data Hash set;Establish Hash, the target fragment data of target block
The unified resource of Hash set and target block positions the index relative between table, by the Hash of target block, target fragment number
It is broadcasted together to business chain according to the unified resource positioning table and index relative of Hash set and target block to store.
Step S105 receives the fragment data and by the fragment data distributed storage.It is described in detail specific as follows:
Step S1051 obtains the Hash of the target fragment data;
Since each target fragment has a unique Hash corresponding, being identified to target fragment and
It distinguishes, therefore the non-fully node of business chain needs to obtain the Hash of target fragment.
Step S1052 according to the corresponding target block of Hash lookup of the target fragment data and obtains corresponding mesh
Mark fragment data content;
Specifically, according to the corresponding target fragment data Hash set of the Hash lookup of target fragment data, according to target
The Hash of fragment data Hash set and target block, target block unified resource positioning table between index relative, obtain
The unified resource of the corresponding target block of target fragment data Hash set positions table, is positioned according to the unified resource of target block
Table reads target block, and corresponding target fragment data content is obtained from target block according to target block fragmentation threshold.
Step S1053 stores the Hash of the target fragment data and the target fragment data content to described non-
Business chain where complete node.
In practical applications, it is corresponding to complete first Hash in target fragment Hash set first for the node in business chain
Then the storage of target fragment completes next Hash in target fragment data Hash set by other nodes in business chain
The storage of corresponding target fragment data, repeatedly until whole Hash in traversal target fragment data Hash set extremely will
Entire target block storage finishes.
Other of business chain, can in the same way, by the fragment after non-fully node receives the fragment data
Data are stored in the business chain of itself storage as block.
The block piecemeal storage method of the embodiment of the present invention, changes the distributed storage in the prior art based on block chain
The mode of used global storage carries out piecemeal storage to block using multiple nodes in business chain, can satisfy data
Measure biggish block storage;In addition, block piecemeal storage method provided by the invention also improves the safety of data storage, keep away
Exempt from the risk that potential block is integrally damaged under global storage mode.
Embodiment two
One embodiment of the invention provides a kind of incomplete markets synchronous method based on block chain data, the block chain
Including main chain and multiple business chains, the business chain includes a complete node for participating in main chain common recognition and multiple participation business chains
The non-fully node of common recognition, as shown in Figure 1, the method for data synchronization can specifically include following steps:
Step S201 requests synchronous target block to destination node;
In the embodiment of the present application, this step is same to the destination node of synchronization object initiation data for business chain timing
Step.Specifically, the destination node that can choose short distance sends the synchronization request to destination node;Business chain receives target section
The synchrodata of point passback.
Unlike implementation one, in the embodiment of the present application, the main chain is divided into multiple block subchains first, so
It is newest in each block subchain to obtain that the destination node request of backward each block subchain synchronizes the target block
Target block.
Specifically, main chain is divided into multiple block subchains that length is 256, successively request traverses each block subchain, respectively
The queue number of the block of block subchain be 1-256,257-512,513-768 ..., etc..
In an alternative embodiment, also it can set other different big for the length of block subchain according to actual needs
Small regular length or variable-length.
Step S202 receives requested target block;
In the embodiment of the present application, business chain can forward requested target block, the interaction by receiving interaction platform
Platform can be used for receiving the establishment of item request of project initiator transmission, and create corresponding business item, when the traffic item
When mesh is in operating status, which also can receive user and requests for the business processing of the business item, and according to this
Business item and business processing request carry out business processing.
Wherein, which can be crowd and raises platform, then the crowd raise platform both can receive raised by the crowd that the side of raising money is sent
Establishment of item request, and creates corresponding crowd and raises project, also can receive by raising request with recognizing of throwing that human hair send, this recognize raise request can
To be to raise recognizing for project for the crowd in fund raising state to raise request.
In the embodiment of the present application, interaction platform externally provides docking standard agreement, specifically, each business chain network can
With the Application Programming Interface (API) provided according to interaction platform, the client of built-in standard agreement is developed, is docked with interaction platform
As a common recognition node.
In the embodiment of the present application, a node accepts the business of block, which can be referred to as service handling node,
And initiation is to the common recognition of the business.It can also include multiple nodes, if these nodes participate in the business other than the node
Common recognition processing, then these nodes can be referred to as common recognition node.In addition, these nodes can also be used as service handling node.
Such as: include 5 nodes (such as: node 1, node 2, node 3, node 4 and node 5), each section in the main chain of block chain
Point is either service handling node can be common recognition node again.Assuming that node 1 has accepted certain business datum, then node 1 this
When be service handling node, node 2, node 3, node 4 and node 5 are then participated in as the common recognition node of the business datum to the industry
The common recognition processing for data of being engaged in.
In the embodiment of the present application, what the node of the main chain of block chain can be used as business datum accepts node, can also be with
Not as the node that accepts of business datum, and as the node or this complete of processing of knowing together for initiating common recognition processing
Node is not specifically limited here.
If the node of the main chain of block chain accepts node as business datum, then the block chain node can be from local
A part of business datum is fished for as business datum to be known together in the business datum of storage accepted, and is directed in order to subsequent
The partial service data fished for initiate common recognition processing.
If complete node of the node of business chain not as the accepting node of business datum and as this common recognition processing, that
The block chain node can fish for a part of business datum as industry to be known together from business datum resource pool to be known together
Business data, in order to the subsequent common recognition processing initiated for the partial service data fished for.
Specifically, the node of the business chain receives the target block that interaction platform is sent, and is receiving mesh to be known together
After marking block, the corresponding business datum for generating the service request to be known together is obtained.Due to user's letter as target block
Breath is sent to the common recognition node, so the node is when receiving the business datum, as long as believing in the business datum comprising user
Breath, can determine that the corresponding business processing data of the target block are accepted by which user side.
The target block is forwarded to described complete by step S203 if received node is the non-fully node
Node.
In the embodiment of the present application, as described above, interaction platform externally provides docking standard agreement, specifically, each industry
The Application Programming Interface (API) that chain network of being engaged in can be provided according to interaction platform develops the client of built-in standard agreement, with friendship
Mutual platform docking becomes an externally common recognition node, referred to as complete node.It is put down in addition, any main body can also be docked to interaction
Platform becomes internally common recognition node, referred to as non-fully node.
Wherein, it is described it is internal common recognition node type can be individual, enterprise, regulatory agency etc., be also possible to credit height,
In credit, the different credit grade such as credit is low.In short, internally the type of common recognition node can divide according to the actual situation, this
Apply without limitation.
Specifically, the client of built-in docking standard agreement can be installed at the terminal for personal or individual, with
After can submit at any time service request by the client;For enterprise, the enterprise especially provided services to the user,
Its application can be docked with configuration center, when it is provided services to the user, this can be submitted to service corresponding business and asked
It asks, for knowing together accordingly, subsystem carries out common recognition verification.
For example, the client of certain electric business platform built-in can dock standard agreement, docked with interaction platform, when user is at this
When electric business platform is done shopping, whether electric business platform request sub-network of knowing together is whether certified products, the user prop up to the purchased commodity of the user
It pays the items such as successfully and carries out common recognition verification, and feed back to user.
For example, ordinary individual can become internally common recognition node, when two internally common recognition node is transferred accounts, wherein one
A internal common recognition node can be with initiating business request, and requesting the corresponding region block chain network of payment technical field is this progress of transferring accounts
Common recognition verification, and this corresponding block of transferring accounts is recorded on the block chain of region.
In short, application scenarios are very rich under the framework of this system, individual can become internally common recognition node, request
The various events of its generation are verified, enterprise can become internally common recognition node, trust of the enhancing user to it.
In the embodiment of the present application, the non-fully node is internal node body, can be assigned in the present system internally
Node body with the identity of node, but these non-fully node is that cannot participate in externally knowing together under the application scenarios of the application
Verification, the external common recognition verification under the application scenarios of the application is executed by complete node.
But non-fully node can execute internally common recognition verification described in the application scenarios of the application, as described above,
Entire society can be included in unified credit system based on the business chain, when the business chain corresponds to a publicly-owned block
When chain network, which only needs to dock with the business chain, will not influence the publicly-owned block link network
The operating of network, that is, main chain script.
Specifically, if the receiving node of the business chain is the non-fully node internally known together, by step
The received target block of S102 is forwarded to the complete node externally known together.
In an alternative embodiment, the leader node that the complete node can be elected by Raft algorithm.In Raft
In agreement, each node in distributed network can be divided into leader node and subordinate's node, which has to the distribution
Subordinate's node in formula network sends the permission of heartbeat message, and subordinate's node in the distributed network is receiving the leader
After the heartbeat message that node is sent, which can be updated in contents such as the information logs of subordinate's node local.In addition,
When initiating business by subordinate's node, which can be sent to the business leader node, and by the leader node
To carry out business processing, or it is distributed to other subordinate's nodes and carries out business processing.
Wherein, which can be when the block chain network brings into operation, and is elected and is produced by each internal consensus node
It is raw, the specific leader node how to elect and the leader node how change-session, can be such as Raft agreement one in the prior art
It causes, the application does not limit this.
Further, in the embodiment of the present application, when the distributed protocol is Raft agreement, due in Raft agreement
Leader node needs each node into the network to send heartbeat message, so the common recognition node is in determining the block chain network
Leader node when, which can be determined by the heartbeat message received.If the common recognition node is in heartbeat message pair
When the time cycle answered is not received by the heartbeat message of leader node transmission, then the common recognition node can wait other common recognition sections
Point initiates election, and receives the ballot request of candidate's node transmission, and by responding ballot request, selects the next term of office
Leader node.Certainly, which can also become chooser node, and send ballot request to other common recognition nodes, then
The common recognition node can also become the leader node in the block chain network.Since the determination of above-mentioned leader node belongs to existing skill
Art, so specific technical detail the application repeats no more.
It should be noted that the complete node or non-fully node can be terminal, e.g., mobile phone, PC/plate electricity
The equipment such as brain or the complete node or non-fully node is also possible to server, then the server can be the non-fully node
Or the non-fully corresponding server of node, and the server can be an individual equipment, be also possible to have multiple devices
The system of composition, as long as the equipment can be used as the non-fully node of the block chain network or non-fully node receives and the common recognition section
The business datum that the corresponding interaction platform of point is sent, and there is the permission that common recognition is initiated in the block chain network, this
Apply to this non-fully node or non-fully node be specially which kind of equipment this and without limitation.
Step S204, the complete node verify the received target block of institute, if by verifying, by the target
Block fragment simultaneously broadcasts the fragment data of acquisition to business chain to store.It is described in detail specific as follows:
The newest block of step S2041, the preposition Hash of the more received target block and the complete node
Whether Hash is consistent, if unanimously, the target block is verified, if showing to pass through verifying by verification.
As noted previously, as the user information as target block is sent to the common recognition node, so the node is receiving
When to the business datum, as long as in the business datum including user information, can determine the corresponding business datum of the block be by
What which user side accepted.
Specifically, firstly, by the newest block of the preposition Hash of the received target block and the complete node
Unanimously whether Hash be compared, if comparison result is consistent, then it represents that the target block is newest block, such industry
The data of business chain node realize data in the data of destination node and synchronize.Then, in the data of business chain node in target section
On the basis of the data put realize data synchronization, common recognition verification is carried out to the target block, specifically the complete section
The public key that point can be held with itself, verifies the signing messages for including in the target block, is determining the A.L.S.
After breath is by verifying, further according to the content for including in the target block, the head cryptographic Hash of the target block is verified.True
After the head cryptographic Hash of the fixed target block is by verifying, then it can determine the target block by verifying, i.e., target block passes through industry
Business chain verifying, then can be stored in the business chain of itself using the target block as block.Wherein, verification code type can configure
For the common Encryption Algorithm of various those skilled in the art or checking algorithm check code generated.
It should be noted that specifically each node carries out target block according to common recognition algorithm in block chain technical field
Common recognition verification, also, the privacies such as account, transaction record of each node of block chain network Internet access, for verifying.
Step S2042, if receiving at least two target blocks, at least two target block is respectively by different institutes
The transmission of block subchain node is stated, and a corresponding upper target block is identical, then according to the change at least two target block
More time-sequencing at least two target block is added in the block chain where the complete node.
It can be seen from the above, when requesting synchronous target block to destination node, be the main chain is divided into first it is multiple
Then block subchain synchronizes the target block to the request of the destination node of each block subchain to obtain each block
Newest target block in chain.
In practical applications, there are multiple and different block subchain nodes to send respective target block to complete node simultaneously
The case where occur, in this case, the head Hash for the upper block for including in the target block of different block subchain nodes
Value may be identical, if node completely determines that these target blocks pass through verifying, these target blocks are stored in area
During block chain, the case where branch will occur, to increase the complexity of block chain.
Thus, in embodiments of the present invention, complete node, can be according to each when receiving at least two special objective blocks
The block that includes in special objective block generates the head cryptographic Hash of time and/or each special block, to each special objective block into
Row sequence, and then based on obtained ranking results, the head cryptographic Hash of the upper target block for including to each special objective block with
And the corresponding head cryptographic Hash of each special objective block is updated, and is stored to these special objective blocks.
The target block cutting is one or more fragment datas by step S2043, and to one or more of points
It is corresponding one or more target fragment datas that sheet data, which carries out random coded,.
Preferably, in order to guarantee the load balancing of each node in entire internally common recognition node set, it may be determined that node set
In each node load capacity, and then can determine the number of each node current idle resource, so that it is determined that the target block is cut
The quantity of the fragment data divided.
Further, in order to further increase the safety of target block, to one or more of fragment datas carry out with
Machine coding.Wherein, the random coded in the embodiment of the present invention and existing random linear network encoding and indistinction, therefore rear
Continuous specification will not repeat.
Step S2044 obtains the Hash of the target block and the Hash of each target fragment data, by the target area
The Hash of the Hash of block and each target fragment data is broadcasted together to business chain to store.
In embodiments of the present invention, this step is mainly used for being recorded in the distribution feelings of the target block stored in business chain
Condition, and establish the Hash of target block, target fragment data Hash set and target block unified resource positioning three it
Between index relative, in case business chain non-fully node store target block when use.
Specifically, the complete node obtains the Hash of target block and the Hash of each target fragment data, according to each
The Hash of a target fragment data forms target fragment data Hash set;Establish Hash, the target fragment data of target block
The unified resource of Hash set and target block positions the index relative between table, by the Hash of target block, target fragment number
It is broadcasted together to business chain according to the unified resource positioning table and index relative of Hash set and target block to store.
Step S205 receives the fragment data and by the fragment data distributed storage.It is described in detail specific as follows:
Step S2051 obtains the Hash of the target fragment data;
Since each target fragment has a unique Hash corresponding, being identified to target fragment and
It distinguishes, therefore the non-fully node of business chain needs to obtain the Hash of target fragment.
Step S2052 according to the corresponding target block of Hash lookup of the target fragment data and obtains corresponding mesh
Mark fragment data content;
Specifically, according to the corresponding target fragment data Hash set of the Hash lookup of target fragment data, according to target
The Hash of fragment data Hash set and target block, target block unified resource positioning table between index relative, obtain
The unified resource of the corresponding target block of target fragment data Hash set positions table, is positioned according to the unified resource of target block
Table reads target block, and corresponding target fragment data content is obtained from target block according to target block fragmentation threshold.
Step S2053 stores the Hash of the target fragment data and the target fragment data content to described non-
Business chain where complete node.
In practical applications, it is corresponding to complete first Hash in target fragment Hash set first for the node in business chain
Then the storage of target fragment completes next Hash in target fragment data Hash set by other nodes in business chain
The storage of corresponding target fragment data, repeatedly until whole Hash in traversal target fragment data Hash set extremely will
Entire target block storage finishes.
Other of business chain, can in the same way, by the fragment after non-fully node receives the fragment data
Data are stored in the business chain of itself storage as block.
The block piecemeal storage method of the embodiment of the present invention, changes the distributed storage in the prior art based on block chain
The mode of used global storage carries out piecemeal storage to block using multiple nodes in business chain, can satisfy data
Measure biggish block storage;In addition, block piecemeal storage method provided by the invention also improves the safety of data storage, keep away
Exempt from the risk that potential block is integrally damaged under global storage mode.
Embodiment three
One embodiment of the invention provides a kind of incomplete markets synchronization system based on block chain data, the block chain
Including main chain and multiple business chains, the business chain includes a complete node for participating in main chain common recognition and multiple participation business chains
The non-fully node of common recognition, as shown in Fig. 2, the synchronization system can specifically include following module:
Request module, for requesting synchronous target block to destination node;
Receiving module, for receiving requested target block;
The target block is forwarded to described by scheduler module if being the non-fully node for received node
Complete node;
Processing module verifies the received target block of institute for the complete node, if by verifying, it will be described
Target block fragment simultaneously broadcasts the fragment data of acquisition to business chain to store.
Example IV
One embodiment of the invention provides a kind of incomplete markets synchronizer based on block chain data, the block chain
Including main chain and multiple business chains, the business chain includes a complete node for participating in main chain common recognition and multiple participation business chains
The non-fully node of common recognition, as shown in figure 3, the synchronization system can specifically include following module:
Communication bus, for realizing the connection communication between processor and memory;
Memory, for storing computer program;Memory may include high speed RAM memory, it is also possible to also comprising non-
Unstable memory (non-volatile memory), for example, at least a magnetic disk storage.Memory optionally can wrap
Containing at least one storage device.
Processor, for executing above-mentioned computer program to realize following steps:
Step S301 requests synchronous target block to destination node;
In the embodiment of the present application, this step is same to the destination node of synchronization object initiation data for business chain timing
Step.Specifically, the destination node that can choose short distance sends the synchronization request to destination node;Business chain receives target section
The synchrodata of point passback.
Unlike implementation one, in the embodiment of the present application, the main chain is divided into multiple block subchains first, so
It is newest in each block subchain to obtain that the destination node request of backward each block subchain synchronizes the target block
Target block.
Specifically, main chain is divided into multiple block subchains that length is 256, successively request traverses each block subchain, respectively
The queue number of the block of block subchain be 1-256,257-512,513-768 ..., etc..
In an alternative embodiment, also it can set other different big for the length of block subchain according to actual needs
Small regular length or variable-length.
Step S302 receives requested target block;
In the embodiment of the present application, business chain can forward requested target block, the interaction by receiving interaction platform
Platform can be used for receiving the establishment of item request of project initiator transmission, and create corresponding business item, when the traffic item
When mesh is in operating status, which also can receive user and requests for the business processing of the business item, and according to this
Business item and business processing request carry out business processing.
Wherein, which can be crowd and raises platform, then the crowd raise platform both can receive raised by the crowd that the side of raising money is sent
Establishment of item request, and creates corresponding crowd and raises project, also can receive by raising request with recognizing of throwing that human hair send, this recognize raise request can
To be to raise recognizing for project for the crowd in fund raising state to raise request.
In the embodiment of the present application, interaction platform externally provides docking standard agreement, specifically, each business chain network can
With the Application Programming Interface (API) provided according to interaction platform, the client of built-in standard agreement is developed, is docked with interaction platform
As a common recognition node.
In the embodiment of the present application, a node accepts the business of block, which can be referred to as service handling node,
And initiation is to the common recognition of the business.It can also include multiple nodes, if these nodes participate in the business other than the node
Common recognition processing, then these nodes can be referred to as common recognition node.In addition, these nodes can also be used as service handling node.
Such as: include 5 nodes (such as: node 1, node 2, node 3, node 4 and node 5), each section in the main chain of block chain
Point is either service handling node can be common recognition node again.Assuming that node 1 has accepted certain business datum, then node 1 this
When be service handling node, node 2, node 3, node 4 and node 5 are then participated in as the common recognition node of the business datum to the industry
The common recognition processing for data of being engaged in.
In the embodiment of the present application, what the node of the main chain of block chain can be used as business datum accepts node, can also be with
Not as the node that accepts of business datum, and as the node or this complete of processing of knowing together for initiating common recognition processing
Node is not specifically limited here.
If the node of the main chain of block chain accepts node as business datum, then the block chain node can be from local
A part of business datum is fished for as business datum to be known together in the business datum of storage accepted, and is directed in order to subsequent
The partial service data fished for initiate common recognition processing.
If complete node of the node of business chain not as the accepting node of business datum and as this common recognition processing, that
The block chain node can fish for a part of business datum as industry to be known together from business datum resource pool to be known together
Business data, in order to the subsequent common recognition processing initiated for the partial service data fished for.
Specifically, the node of the business chain receives the target block that interaction platform is sent, and is receiving mesh to be known together
After marking block, the corresponding business datum for generating the service request to be known together is obtained.Due to user's letter as target block
Breath is sent to the common recognition node, so the node is when receiving the business datum, as long as believing in the business datum comprising user
Breath, can determine that the corresponding business processing data of the target block are accepted by which user side.
The target block is forwarded to described complete by step S303 if received node is the non-fully node
Node.
In the embodiment of the present application, as described above, interaction platform externally provides docking standard agreement, specifically, each industry
The Application Programming Interface (API) that chain network of being engaged in can be provided according to interaction platform develops the client of built-in standard agreement, with friendship
Mutual platform docking becomes an externally common recognition node, referred to as complete node.It is put down in addition, any main body can also be docked to interaction
Platform becomes internally common recognition node, referred to as non-fully node.
Wherein, it is described it is internal common recognition node type can be individual, enterprise, regulatory agency etc., be also possible to credit height,
In credit, the different credit grade such as credit is low.In short, internally the type of common recognition node can divide according to the actual situation, this
Apply without limitation.
Specifically, the client of built-in docking standard agreement can be installed at the terminal for personal or individual, with
After can submit at any time service request by the client;For enterprise, the enterprise especially provided services to the user,
Its application can be docked with configuration center, when it is provided services to the user, this can be submitted to service corresponding business and asked
It asks, for knowing together accordingly, subsystem carries out common recognition verification.
For example, the client of certain electric business platform built-in can dock standard agreement, docked with interaction platform, when user is at this
When electric business platform is done shopping, whether electric business platform request sub-network of knowing together is whether certified products, the user prop up to the purchased commodity of the user
It pays the items such as successfully and carries out common recognition verification, and feed back to user.
For example, ordinary individual can become internally common recognition node, when two internally common recognition node is transferred accounts, wherein one
A internal common recognition node can be with initiating business request, and requesting the corresponding region block chain network of payment technical field is this progress of transferring accounts
Common recognition verification, and this corresponding block of transferring accounts is recorded on the block chain of region.
In short, application scenarios are very rich under the framework of this system, individual can become internally common recognition node, request
The various events of its generation are verified, enterprise can become internally common recognition node, trust of the enhancing user to it.
In the embodiment of the present application, the non-fully node is internal node body, can be assigned in the present system internally
Node body with the identity of node, but these non-fully node is that cannot participate in externally knowing together under the application scenarios of the application
Verification, the external common recognition verification under the application scenarios of the application is executed by complete node.
But non-fully node can execute internally common recognition verification described in the application scenarios of the application, as described above,
Entire society can be included in unified credit system based on the business chain, when the business chain corresponds to a publicly-owned block
When chain network, which only needs to dock with the business chain, will not influence the publicly-owned block link network
The operating of network, that is, main chain script.
Specifically, if the receiving node of the business chain is the non-fully node internally known together, by step
The received target block of S102 is forwarded to the complete node externally known together.
In an alternative embodiment, the leader node that the complete node can be elected by Raft algorithm.In Raft
In agreement, each node in distributed network can be divided into leader node and subordinate's node, which has to the distribution
Subordinate's node in formula network sends the permission of heartbeat message, and subordinate's node in the distributed network is receiving the leader
After the heartbeat message that node is sent, which can be updated in contents such as the information logs of subordinate's node local.In addition,
When initiating business by subordinate's node, which can be sent to the business leader node, and by the leader node
To carry out business processing, or it is distributed to other subordinate's nodes and carries out business processing.
Wherein, which can be when the block chain network brings into operation, and is elected and is produced by each internal consensus node
It is raw, the specific leader node how to elect and the leader node how change-session, can be such as Raft agreement one in the prior art
It causes, the application does not limit this.
Further, in the embodiment of the present application, when the distributed protocol is Raft agreement, due in Raft agreement
Leader node needs each node into the network to send heartbeat message, so the common recognition node is in determining the block chain network
Leader node when, which can be determined by the heartbeat message received.If the common recognition node is in heartbeat message pair
When the time cycle answered is not received by the heartbeat message of leader node transmission, then the common recognition node can wait other common recognition sections
Point initiates election, and receives the ballot request of candidate's node transmission, and by responding ballot request, selects the next term of office
Leader node.Certainly, which can also become chooser node, and send ballot request to other common recognition nodes, then
The common recognition node can also become the leader node in the block chain network.Since the determination of above-mentioned leader node belongs to existing skill
Art, so specific technical detail the application repeats no more.
It should be noted that the complete node or non-fully node can be terminal, e.g., mobile phone, PC/plate electricity
The equipment such as brain or the complete node or non-fully node is also possible to server, then the server can be the non-fully node
Or the non-fully corresponding server of node, and the server can be an individual equipment, be also possible to have multiple devices
The system of composition, as long as the equipment can be used as the non-fully node of the block chain network or non-fully node receives and the common recognition section
The business datum that the corresponding interaction platform of point is sent, and there is the permission that common recognition is initiated in the block chain network, this
Apply to this non-fully node or non-fully node be specially which kind of equipment this and without limitation.
Step S304, the complete node verify the received target block of institute, if by verifying, by the target
Block fragment simultaneously broadcasts the fragment data of acquisition to business chain to store.It is described in detail specific as follows:
The newest block of step S3041, the preposition Hash of the more received target block and the complete node
Whether Hash is consistent, if unanimously, the target block is verified, if showing to pass through verifying by verification.
As noted previously, as the user information as target block is sent to the common recognition node, so the node is receiving
When to the business datum, as long as in the business datum including user information, can determine the corresponding business datum of the block be by
What which user side accepted.
Specifically, firstly, by the newest block of the preposition Hash of the received target block and the complete node
Unanimously whether Hash be compared, if comparison result is consistent, then it represents that the target block is newest block, such industry
The data of business chain node realize data in the data of destination node and synchronize.Then, in the data of business chain node in target section
On the basis of the data put realize data synchronization, common recognition verification is carried out to the target block, specifically the complete section
The public key that point can be held with itself, verifies the signing messages for including in the target block, is determining the A.L.S.
After breath is by verifying, further according to the content for including in the target block, the head cryptographic Hash of the target block is verified.True
After the head cryptographic Hash of the fixed target block is by verifying, then it can determine the target block by verifying, i.e., target block passes through industry
Business chain verifying, then can be stored in the business chain of itself using the target block as block.Wherein, verification code type can configure
For the common Encryption Algorithm of various those skilled in the art or checking algorithm check code generated.
It should be noted that specifically each node carries out target block according to common recognition algorithm in block chain technical field
Common recognition verification, also, the privacies such as account, transaction record of each node of block chain network Internet access, for verifying.
Step S3042, if receiving at least two target blocks, at least two target block is respectively by different institutes
The transmission of block subchain node is stated, and a corresponding upper target block is identical, then according to the change at least two target block
More time-sequencing at least two target block is added in the block chain where the complete node.
It can be seen from the above, when requesting synchronous target block to destination node, be the main chain is divided into first it is multiple
Then block subchain synchronizes the target block to the request of the destination node of each block subchain to obtain each block
Newest target block in chain.
In practical applications, there are multiple and different block subchain nodes to send respective target block to complete node simultaneously
The case where occur, in this case, the head Hash for the upper block for including in the target block of different block subchain nodes
Value may be identical, if node completely determines that these target blocks pass through verifying, these target blocks are stored in area
During block chain, the case where branch will occur, to increase the complexity of block chain.
Thus, in embodiments of the present invention, complete node, can be according to each when receiving at least two special objective blocks
The block that includes in special objective block generates the head cryptographic Hash of time and/or each special block, to each special objective block into
Row sequence, and then based on obtained ranking results, the head cryptographic Hash of the upper target block for including to each special objective block with
And the corresponding head cryptographic Hash of each special objective block is updated, and is stored to these special objective blocks.
The target block cutting is one or more fragment datas by step S3043, and to one or more of points
It is corresponding one or more target fragment datas that sheet data, which carries out random coded,.
Preferably, in order to guarantee the load balancing of each node in entire internally common recognition node set, it may be determined that node set
In each node load capacity, and then can determine the number of each node current idle resource, so that it is determined that the target block is cut
The quantity of the fragment data divided.
Further, in order to further increase the safety of target block, to one or more of fragment datas carry out with
Machine coding.Wherein, the random coded in the embodiment of the present invention and existing random linear network encoding and indistinction, therefore rear
Continuous specification will not repeat.
Step S3044 obtains the Hash of the target block and the Hash of each target fragment data, by the target area
The Hash of the Hash of block and each target fragment data is broadcasted together to business chain to store.
In embodiments of the present invention, this step is mainly used for being recorded in the distribution feelings of the target block stored in business chain
Condition, and establish the Hash of target block, target fragment data Hash set and target block unified resource positioning three it
Between index relative, in case business chain non-fully node store target block when use.
Specifically, the complete node obtains the Hash of target block and the Hash of each target fragment data, according to each
The Hash of a target fragment data forms target fragment data Hash set;Establish Hash, the target fragment data of target block
The unified resource of Hash set and target block positions the index relative between table, by the Hash of target block, target fragment number
It is broadcasted together to business chain according to the unified resource positioning table and index relative of Hash set and target block to store.
Step S305 receives the fragment data and by the fragment data distributed storage.It is described in detail specific as follows:
Step S3051 obtains the Hash of the target fragment data;
Since each target fragment has a unique Hash corresponding, being identified to target fragment and
It distinguishes, therefore the non-fully node of business chain needs to obtain the Hash of target fragment.
Step S3052 according to the corresponding target block of Hash lookup of the target fragment data and obtains corresponding mesh
Mark fragment data content;
Specifically, according to the corresponding target fragment data Hash set of the Hash lookup of target fragment data, according to target
The Hash of fragment data Hash set and target block, target block unified resource positioning table between index relative, obtain
The unified resource of the corresponding target block of target fragment data Hash set positions table, is positioned according to the unified resource of target block
Table reads target block, and corresponding target fragment data content is obtained from target block according to target block fragmentation threshold.
Step S3053 stores the Hash of the target fragment data and the target fragment data content to described non-
Business chain where complete node.
In practical applications, it is corresponding to complete first Hash in target fragment Hash set first for the node in business chain
Then the storage of target fragment completes next Hash in target fragment data Hash set by other nodes in business chain
The storage of corresponding target fragment data, repeatedly until whole Hash in traversal target fragment data Hash set extremely will
Entire target block storage finishes.
Other of business chain, can in the same way, by the fragment after non-fully node receives the fragment data
Data are stored in the business chain of itself storage as block.
Embodiment five
One embodiment of the invention provides a kind of computer readable storage medium, is stored thereon with computer program, above-mentioned
The above-mentioned incomplete markets synchronous method based on block chain data is realized when computer program is executed by processor.
It is to sum up above-mentioned, a kind of incomplete markets synchronous method based on block chain data provided in an embodiment of the present invention and be
System carries out piecemeal storage to block by using multiple nodes in business chain, changes in the prior art based on block chain
The mode of global storage used by distributed storage can satisfy the biggish block storage of data volume;Avoid global storage mould
The risk that block is integrally damaged under the situations such as potential delay machine, operation troubles under formula can also be from it even if risk exists
Synchrodata is got in the block chain node of his normal operation, improves the safety of data storage;Since block chain has
Anti-tamper characteristic, cause either side not distort privately to the storing data in block chain, to be effectively ensured
The safety of storing data.So the embodiment of the present invention has reached following technical effect: solve it is existing in the prior art with
The continuous growth of block chain data volume, time spent by shared data be continuously increased, be easy to cause block chain network congestion
And block storage burden improves sharing efficiency, saves storage quantity, guarantee data security to reach the reduction shared period
Purpose.
It should be noted that for the various method embodiments described above, for simple description, therefore, it is stated as a series of
Combination of actions, but those skilled in the art should understand that, the present invention is not limited by the sequence of acts described because
According to the present invention, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art should also know
It knows, embodiment described in this description belongs to alternative embodiment, and related actions and modules is not necessarily of the invention
It is necessary.
Above-described embodiment can be realized wholly or partly by software, hardware, firmware or any other combination.When
When using software realization, above-described embodiment can be realized entirely or partly in the form of a computer program product.The computer
Program product includes one or more computer instructions.When loading or execute on computers the computer program instructions, all
Or partly generate the process or function being somebody's turn to do according to the embodiment of the present application.The computer can be general purpose computer, dedicated computing
Machine, computer network or other programmable devices.The computer instruction may be stored in a computer readable storage medium,
Or transmitted from a computer readable storage medium to another computer readable storage medium, for example, the computer instruction
Wired (such as infrared, wireless, microwave etc.) mode can be passed through from a web-site, computer, server or data center
It is transmitted to another web-site, computer, server or data center.The computer readable storage medium can be meter
Any usable medium that calculation machine can access either includes server, the data center etc. of one or more usable medium set
Data storage device.The usable medium can be magnetic medium (for example, floppy disk, hard disk, tape), optical medium (for example, DVD),
Or semiconductor medium.Semiconductor medium can be solid state hard disk.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
Scope of the present application.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, there is no the portion being described in detail in some embodiment
Point, reference can be made to the related descriptions of other embodiments.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided by the present invention, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including multiple instruction is used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the complete of each embodiment the method for the present invention
Portion or part steps.And storage medium above-mentioned include: USB flash disk, mobile hard disk, read-only memory (read-only memory,
ROM), random access memory (random access memory, RAM), magnetic or disk etc. are various can store program
The medium of code.
The present invention be referring to the embodiment of the present invention method, apparatus (equipment) and computer program product flow chart with/
Or block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/
Or the combination of the process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions
To general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
A machine so that by the instruction that the processor of computer or other programmable data processing devices executes generate for realizing
The device for the function of being specified in one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations;To the greatest extent
Pipe present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: its according to
So be possible to modify the technical solutions described in the foregoing embodiments, or to some or all of the technical features into
Row equivalent replacement;And these are modified or replaceed, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme.
Claims (10)
1. a kind of incomplete markets synchronous method based on block chain data, the block chain includes main chain and multiple business chains,
It is characterized in that, the business chain includes that the complete node for participating in main chain common recognition participates in the non-complete of business chains common recognition with multiple
Full node, which comprises
Synchronous target block is requested to destination node;
Receive requested target block;
If received node is the non-fully node, the target block is forwarded to the complete node;
The complete node verifies the received target block of institute, if by verifying, by the target block fragment and will
The fragment data of acquisition is broadcasted to business chain to store.
2. the method according to claim 1, wherein the complete node tests the received target block of institute
Card includes:
The Kazakhstan of the newest block of the preposition Hash and complete node of the more received target block of complete node
It is uncommon whether consistent, if unanimously, the target block is carried out common recognition verification by the complete node, if being shown by verification
Pass through verifying.
3. according to the method described in claim 2, it is characterized in that, described include: to the synchronous target block of destination node request
The main chain is divided into multiple block subchains;
The target block is synchronized to the request of the destination node of each block subchain to obtain in each block subchain most
New target block.
4. according to the method described in claim 3, it is characterized in that, the method is also wrapped by before the target block fragment
It includes:
If receiving at least two target blocks, at least two target block is respectively by the different block subchain nodes
It sends, and a corresponding upper target block is identical, then according to the change time-sequencing at least two target block by institute
It states in the block chain where the complete node is added at least two target blocks.
5. the method according to claim 1, wherein including: by the target block fragment
It is one or more fragment datas by the target block cutting, and one or more of fragment datas is carried out random
It is encoded to corresponding one or more target fragment datas.
6. method according to claim 1-5, which is characterized in that described to broadcast the fragment data of acquisition to industry
Chain of being engaged in store includes:
The Hash of the target block and the Hash of each target fragment data are obtained, by the Hash of the target block and each
The Hash of target fragment data is broadcasted together to business chain to store.
7. the method stated according to claim 6, which is characterized in that the method also includes:
Obtain the Hash of the target fragment data;
According to the corresponding target block of Hash lookup of the target fragment data and obtain corresponding target fragment data content;
The Hash of the target fragment data and the target fragment data content are stored to where the non-fully node
Business chain.
The system 8. a kind of region is known together, the block chain includes main chain and multiple business chains, which is characterized in that the business chain packet
The complete node of main chain common recognition and the non-fully node of multiple participation business chain common recognitions are participated in containing one, the system comprises:
Request module, for requesting synchronous target block to destination node;
Receiving module, for receiving requested target block;
The target block is forwarded to described complete by scheduler module if being the non-fully node for received node
Node;
Processing module is verified the received target block of institute for the complete node, if by verifying, by the target
Block fragment simultaneously broadcasts the fragment data of acquisition to business chain to store.
The equipment 9. a kind of region is known together, the block chain includes main chain and multiple business chains, which is characterized in that the business chain packet
The complete node of main chain common recognition and the non-fully node of multiple participation business chain common recognitions are participated in containing one, the equipment includes:
Communication bus, for realizing the connection communication between processor and memory;
Memory, for storing computer program;
Processor, for executing the computer program to realize following steps:
Synchronous target block is requested to destination node;
Receive requested target block;
If received node is the non-fully node, the target block is forwarded to the complete node;
The complete node verifies the received target block of institute, if by verifying, by the target block fragment and will
The fragment data of acquisition is stored to business chain.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The method according to claim 1 to 7 is realized when being executed by processor.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811206580.4A CN109522362B (en) | 2018-10-17 | 2018-10-17 | Incomplete data synchronization method, system and equipment based on block chain data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811206580.4A CN109522362B (en) | 2018-10-17 | 2018-10-17 | Incomplete data synchronization method, system and equipment based on block chain data |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109522362A true CN109522362A (en) | 2019-03-26 |
CN109522362B CN109522362B (en) | 2020-09-15 |
Family
ID=65771758
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811206580.4A Expired - Fee Related CN109522362B (en) | 2018-10-17 | 2018-10-17 | Incomplete data synchronization method, system and equipment based on block chain data |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109522362B (en) |
Cited By (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110086856A (en) * | 2019-04-01 | 2019-08-02 | 深圳前海达闼云端智能科技有限公司 | Control method and device of block chain node, storage medium and electronic equipment |
CN110099106A (en) * | 2019-04-24 | 2019-08-06 | 福建方维信息科技有限公司 | A kind of data synchronous method and terminal between block chain interior joint |
CN110210845A (en) * | 2019-06-11 | 2019-09-06 | 网易(杭州)网络有限公司 | For the method, apparatus of block chain Data Migration, medium and calculate equipment |
CN110347497A (en) * | 2019-06-03 | 2019-10-18 | 阿里巴巴集团控股有限公司 | A kind of method and device that multiple storage equipment are divided to equipment group |
CN110430282A (en) * | 2019-08-16 | 2019-11-08 | 微位(深圳)网络科技有限公司 | Data transmission method and device between distributed system node |
CN110442644A (en) * | 2019-07-08 | 2019-11-12 | 深圳壹账通智能科技有限公司 | Block chain data filing storage method, device, computer equipment and storage medium |
CN110505305A (en) * | 2019-08-27 | 2019-11-26 | 深圳市网心科技有限公司 | A kind of block chain sharding method, device and block catenary system |
CN110597466A (en) * | 2019-09-16 | 2019-12-20 | 腾讯科技(深圳)有限公司 | Control method and device of block chain node, storage medium and computer equipment |
CN110609872A (en) * | 2019-09-20 | 2019-12-24 | 北京海益同展信息科技有限公司 | Method and apparatus for synchronizing node data |
CN110737664A (en) * | 2019-10-21 | 2020-01-31 | 深圳前海微众银行股份有限公司 | block link point synchronization method and device |
CN111130801A (en) * | 2019-12-26 | 2020-05-08 | 腾讯科技(深圳)有限公司 | Data processing method and device, node equipment and computer storage medium |
CN111221910A (en) * | 2019-12-31 | 2020-06-02 | 杭州趣链科技有限公司 | Fragment storage method for improving block chain read-write performance |
CN111339086A (en) * | 2020-02-18 | 2020-06-26 | 腾讯科技(深圳)有限公司 | Block processing method, and data query method and device based on block chain |
CN111339089A (en) * | 2020-02-21 | 2020-06-26 | 联动优势(北京)数字科技有限公司 | Data storage and acquisition method and device applied to block chain |
CN111432009A (en) * | 2020-03-30 | 2020-07-17 | 深圳壹账通智能科技有限公司 | Method and device for synchronizing block chain data, electronic equipment and storage medium |
CN111478795A (en) * | 2020-03-06 | 2020-07-31 | 重庆邮电大学 | Alliance block chain network consensus method based on mixed Byzantine fault tolerance |
CN111597268A (en) * | 2020-05-21 | 2020-08-28 | 昆明大棒客科技有限公司 | Block chain expansion method, block chain node and block chain system |
CN111711526A (en) * | 2020-06-16 | 2020-09-25 | 深圳前海微众银行股份有限公司 | Consensus method and system for block chain nodes |
CN113098970A (en) * | 2021-04-12 | 2021-07-09 | 浙江永旗区块链科技有限公司 | Distributed network node data synchronization method |
US11099759B2 (en) | 2019-06-03 | 2021-08-24 | Advanced New Technologies Co., Ltd. | Method and device for dividing storage devices into device groups |
WO2021190179A1 (en) * | 2020-03-24 | 2021-09-30 | 腾讯科技(深圳)有限公司 | Synchronous processing method and related apparatus |
CN113722545A (en) * | 2021-06-30 | 2021-11-30 | 电子科技大学 | Data compiling and correcting method under license chain environment |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110309173B (en) * | 2019-06-14 | 2021-08-13 | 达闼机器人有限公司 | Contract data recording method and device, block chain node and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106649632A (en) * | 2016-12-07 | 2017-05-10 | 北京众享比特科技有限公司 | Data synchronism method and system |
CN107079059A (en) * | 2016-12-21 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Block chain storage method and device and node equipment |
CN107197036A (en) * | 2017-06-22 | 2017-09-22 | 广东网金控股股份有限公司 | A kind of consistent processing method of information based on block chain and terminal |
-
2018
- 2018-10-17 CN CN201811206580.4A patent/CN109522362B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106649632A (en) * | 2016-12-07 | 2017-05-10 | 北京众享比特科技有限公司 | Data synchronism method and system |
CN107079059A (en) * | 2016-12-21 | 2017-08-18 | 深圳前海达闼云端智能科技有限公司 | Block chain storage method and device and node equipment |
CN107197036A (en) * | 2017-06-22 | 2017-09-22 | 广东网金控股股份有限公司 | A kind of consistent processing method of information based on block chain and terminal |
Cited By (37)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110086856B (en) * | 2019-04-01 | 2022-02-01 | 达闼机器人有限公司 | Control method and device of block chain node, storage medium and electronic equipment |
CN110086856A (en) * | 2019-04-01 | 2019-08-02 | 深圳前海达闼云端智能科技有限公司 | Control method and device of block chain node, storage medium and electronic equipment |
CN110099106A (en) * | 2019-04-24 | 2019-08-06 | 福建方维信息科技有限公司 | A kind of data synchronous method and terminal between block chain interior joint |
CN110099106B (en) * | 2019-04-24 | 2022-04-19 | 福建方维信息科技有限公司 | Method and terminal for data synchronization between nodes in block chain |
US11354055B2 (en) | 2019-06-03 | 2022-06-07 | Advanced New Technologies Co., Ltd. | Method and device for dividing storage devices into device groups |
CN110347497A (en) * | 2019-06-03 | 2019-10-18 | 阿里巴巴集团控股有限公司 | A kind of method and device that multiple storage equipment are divided to equipment group |
US11099759B2 (en) | 2019-06-03 | 2021-08-24 | Advanced New Technologies Co., Ltd. | Method and device for dividing storage devices into device groups |
CN110347497B (en) * | 2019-06-03 | 2020-07-21 | 阿里巴巴集团控股有限公司 | Method and device for dividing multiple storage devices into device groups |
CN110210845A (en) * | 2019-06-11 | 2019-09-06 | 网易(杭州)网络有限公司 | For the method, apparatus of block chain Data Migration, medium and calculate equipment |
CN110442644A (en) * | 2019-07-08 | 2019-11-12 | 深圳壹账通智能科技有限公司 | Block chain data filing storage method, device, computer equipment and storage medium |
CN110430282A (en) * | 2019-08-16 | 2019-11-08 | 微位(深圳)网络科技有限公司 | Data transmission method and device between distributed system node |
CN110430282B (en) * | 2019-08-16 | 2022-03-01 | 微位(深圳)网络科技有限公司 | Data transmission method and device between nodes of distributed system |
CN110505305B (en) * | 2019-08-27 | 2022-04-01 | 深圳市迅雷网络技术有限公司 | Block chain fragmentation method and device and block chain system |
CN110505305A (en) * | 2019-08-27 | 2019-11-26 | 深圳市网心科技有限公司 | A kind of block chain sharding method, device and block catenary system |
CN110597466A (en) * | 2019-09-16 | 2019-12-20 | 腾讯科技(深圳)有限公司 | Control method and device of block chain node, storage medium and computer equipment |
CN110597466B (en) * | 2019-09-16 | 2021-10-26 | 腾讯科技(深圳)有限公司 | Control method and device of block chain node, storage medium and computer equipment |
US12019652B2 (en) | 2019-09-20 | 2024-06-25 | Jingdong Technology Information Technology Co., Ltd. | Method and device for synchronizing node data |
CN110609872A (en) * | 2019-09-20 | 2019-12-24 | 北京海益同展信息科技有限公司 | Method and apparatus for synchronizing node data |
CN110737664A (en) * | 2019-10-21 | 2020-01-31 | 深圳前海微众银行股份有限公司 | block link point synchronization method and device |
CN111130801A (en) * | 2019-12-26 | 2020-05-08 | 腾讯科技(深圳)有限公司 | Data processing method and device, node equipment and computer storage medium |
CN111221910A (en) * | 2019-12-31 | 2020-06-02 | 杭州趣链科技有限公司 | Fragment storage method for improving block chain read-write performance |
CN111339086A (en) * | 2020-02-18 | 2020-06-26 | 腾讯科技(深圳)有限公司 | Block processing method, and data query method and device based on block chain |
CN111339086B (en) * | 2020-02-18 | 2021-04-20 | 腾讯科技(深圳)有限公司 | Block processing method, and data query method and device based on block chain |
CN111339089B (en) * | 2020-02-21 | 2023-09-22 | 联动优势科技有限公司 | Data storage and acquisition method and device applied to blockchain |
CN111339089A (en) * | 2020-02-21 | 2020-06-26 | 联动优势(北京)数字科技有限公司 | Data storage and acquisition method and device applied to block chain |
CN111478795B (en) * | 2020-03-06 | 2022-08-12 | 重庆邮电大学 | Alliance block chain network consensus method based on mixed Byzantine fault tolerance |
CN111478795A (en) * | 2020-03-06 | 2020-07-31 | 重庆邮电大学 | Alliance block chain network consensus method based on mixed Byzantine fault tolerance |
WO2021190179A1 (en) * | 2020-03-24 | 2021-09-30 | 腾讯科技(深圳)有限公司 | Synchronous processing method and related apparatus |
CN111432009B (en) * | 2020-03-30 | 2023-04-07 | 深圳壹账通智能科技有限公司 | Method and device for synchronizing block chain data, electronic equipment and storage medium |
CN111432009A (en) * | 2020-03-30 | 2020-07-17 | 深圳壹账通智能科技有限公司 | Method and device for synchronizing block chain data, electronic equipment and storage medium |
CN111597268A (en) * | 2020-05-21 | 2020-08-28 | 昆明大棒客科技有限公司 | Block chain expansion method, block chain node and block chain system |
CN111597268B (en) * | 2020-05-21 | 2023-09-12 | 昆明大棒客科技有限公司 | Block chain extension method, block chain node and block chain system |
CN111711526A (en) * | 2020-06-16 | 2020-09-25 | 深圳前海微众银行股份有限公司 | Consensus method and system for block chain nodes |
CN111711526B (en) * | 2020-06-16 | 2024-03-26 | 深圳前海微众银行股份有限公司 | Method and system for consensus of block chain nodes |
CN113098970A (en) * | 2021-04-12 | 2021-07-09 | 浙江永旗区块链科技有限公司 | Distributed network node data synchronization method |
CN113722545A (en) * | 2021-06-30 | 2021-11-30 | 电子科技大学 | Data compiling and correcting method under license chain environment |
CN113722545B (en) * | 2021-06-30 | 2023-04-28 | 电子科技大学 | Data compiling and correcting method under license chain environment |
Also Published As
Publication number | Publication date |
---|---|
CN109522362B (en) | 2020-09-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109522362A (en) | Incomplete markets synchronous method, system and equipment based on block chain data | |
CN108717630B (en) | Block output method and implementation system thereof | |
CN109547530A (en) | Region common recognition method, system and equipment | |
CN109829718B (en) | Block chain multi-level framework based on storage application scene and operation method thereof | |
CN108540536B (en) | Block chain-based network mass service processing method, equipment and storage medium | |
WO2018076759A1 (en) | Block chain-based multi-chain management method and system, electronic device, and storage medium | |
CN107846278B (en) | Intelligent contract processing method and device | |
CN109345387A (en) | Across the chain method of commerce of block chain, across chain communication device and storage medium | |
CN111327648B (en) | Processing method and system based on block chain intelligent contract | |
KR20180014534A (en) | Verification system and method for transaction based block chain | |
KR101827373B1 (en) | Block window module having agreement algorithm for limiting mining, managing server and virtual money exchange system and method | |
CN108985774A (en) | A kind of motivational techniques, device, equipment and the storage medium of block chain network | |
CN110417558A (en) | Verification method and device, the storage medium and electronic device of signature | |
CN109508968A (en) | Block catenary system and its control method | |
CN109146490A (en) | block generation method, device and system | |
CN108959621A (en) | A kind of implementation method, device, equipment and the storage medium of block chain network | |
CN108509615B (en) | Consensus establishing method and device based on drawing mechanism and readable storage medium | |
WO2020147484A1 (en) | Transaction clearing method and transaction clearing system | |
CN108022090B (en) | Virtual account management method, device, system and readable storage medium | |
CN112163950A (en) | Block chain network construction method and system convenient for expansion and node resource reuse and terminal equipment | |
CN109510713A (en) | A kind of shared motivational techniques of the flow based on block chain | |
CN109191288A (en) | Transaction system, method, apparatus and storage medium based on block chain | |
CN110197433A (en) | Numeric value transfer, apparatus and system | |
CN110517145A (en) | Data trade method and relevant device based on multi-tiling interchain | |
CN109522314A (en) | Data archiving method and terminal device based on block chain |
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 | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200915 |