CN107493340A - Data distribution method of calibration in block chain network, apparatus and system - Google Patents
Data distribution method of calibration in block chain network, apparatus and system Download PDFInfo
- Publication number
- CN107493340A CN107493340A CN201710731166.4A CN201710731166A CN107493340A CN 107493340 A CN107493340 A CN 107493340A CN 201710731166 A CN201710731166 A CN 201710731166A CN 107493340 A CN107493340 A CN 107493340A
- Authority
- CN
- China
- Prior art keywords
- transaction data
- point
- timestamp
- newest
- section point
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/12—Applying verification of the received information
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1854—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with non-centralised forwarding system, e.g. chaincast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
- H04L2463/121—Timestamp
Abstract
The embodiment of the invention discloses the data distribution method of calibration in a kind of block chain network, apparatus and system, wherein, this method includes：By adding server node and agent node in traditional block chain, after agent node obtains the transaction data of the newest transmission of server node and the point-to-point message of the newest transmission of section point, agent node is by comparing the magnitude relationship of both the second timestamp in the stamp of the very first time in transaction data and point-to-point message, and then determine whether section point has got the transaction data of first node, solves the bottleneck problem of block chain trading efficiency, so that transaction data treatment effeciency is lifted in geometry level, lifting to block chain network performance of transaction will make block chain technology meet performance requirement in sector application.
Description
Technical field
The present invention relates to the data in distributed digital broadcast and distribution technology field, more particularly to a kind of block chain network
Distribute method of calibration, apparatus and system.
Background technology
Bit coin is block chain application scenarios the most successful so far, the transaction data propagation protocol of bit coin system
Comprise the following steps:
1) bit coin transaction node is broadcasted newly-generated transaction data to all nodes of the whole network；
2) each node stores the transaction data being collected into a block；
3) each node finds a proof of work with enough difficulty within a block based on power itself is calculated；
4) after node finds the proof of work of block, just to this block of all node broadcasts of the whole network；
5) only when being all effective comprising All Activity within a block and do not existed before, other nodes are just accepted
The validity of the block；
6) other nodes receive the data block, and manufacture new block at the end of the block to extend the chain, and
The random Harsh value for being received block is considered as the random Harsh value prior to new block.
Block chain will necessarily face various the problem of restricting its development as rising in recent years and fast-developing new technology
With obstacle and wherein efficiency by be restrict block chain sector application maximum bottleneck.
The trade confirmation time:Bit coin block generation the time be 10 minutes, thus the trade confirmation time be generally 10 minutes,
This limits application of the bit coin in penny ante and time-sensitive transaction to a certain extent.
Therefore it provides a kind of data distribution method of calibration in block chain network is to solve to exist in current block chain technology
Trade confirmation overlong time technical problem.
The content of the invention
The embodiments of the invention provide the data distribution method of calibration in a kind of block chain network, apparatus and system, solves
The technical problem of trade confirmation overlong time present in current block chain technology.
The embodiments of the invention provide the data distribution method of calibration in a kind of block chain network, including：
S1：Very first time stamp and the second timestamp are determined, wherein, very first time stamp is once to be sent out by server node is newest
The timestamp included in the newest transaction data sent, the second timestamp are successfully to be connect with its last time by what section point was sent
Receive the timestamp in point-to-point message corresponding to the last Successful Transaction data that server node is sent；
S2：Compare very first time stamp and the second timestamp, if very first time stamp is more than the second timestamp, confirm the second section
Point gets newest transaction data not successfully, and sends newest transaction data to section point as new last Successful Transaction number
According to.
Preferably, step S1 is specifically included：
Very first time stamp and the second timestamp are determined, wherein, very first time stamp is once to be sent by server node is newest
Receive the timestamp included in the corresponding newest transaction data of transaction data that first node sends with its last time, second
Timestamp is the last Successful Transaction data that server node transmission is properly received with its last time by section point transmission
Timestamp in corresponding point-to-point message.
Preferably, also include before step S2：
Cache the newest point-to-point message once sent of newest transaction data and section point.
Preferably, step S2 is specifically included：
Compare very first time stamp and the second timestamp, if very first time stamp is equal to the second timestamp, confirm section point
Newest transaction data is successfully got, newest transaction data is deleted and deletes the last point pair sent of the section point got
Point message, if very first time stamp is more than the second timestamp, confirm that section point gets newest transaction data not successfully, concurrently
Send newest transaction data to section point as new last Successful Transaction data.
Preferably, the embodiment of the present invention additionally provides the data distribution calibration equipment in a kind of block chain network, its feature
It is, including：
Determining unit, for determining very first time stamp and the second timestamp, wherein, very first time stamp is by server node
The timestamp included in the newest newest transaction data once sent, the second timestamp are by the last with it of section point transmission
The timestamp being once properly received in point-to-point message corresponding to the last Successful Transaction data of server node transmission；
Comparing unit, for comparing very first time stamp and the second timestamp, if very first time stamp is more than the second timestamp,
Confirm that section point gets newest transaction data not successfully, and send newest transaction data to section point as newly last
Successful Transaction data.
Preferably, determining unit, it is additionally operable to determine very first time stamp and the second timestamp, wherein, very first time stamp is served as reasons
The newest newest transaction corresponding with the transaction data of its last time reception first node transmission once sending of server node
The timestamp included in data, the second timestamp are to be properly received server node with its last time by what section point was sent
Timestamp in point-to-point message corresponding to the last Successful Transaction data sent.
Preferably, the data distribution calibration equipment in a kind of block chain network provided in an embodiment of the present invention also includes：
Buffer unit, for caching the newest point-to-point message once sent of newest transaction data and section point.
Preferably, comparing unit includes：
Comparing subunit, for comparing very first time stamp and the second timestamp, if very first time stamp is equal to the second timestamp,
Then subelement is deleted in triggering, if very first time stamp is more than the second timestamp, triggers transmission sub-unit；
Subelement is deleted, for confirming that section point successfully gets newest transaction data, deletes newest transaction data simultaneously
Delete the last point-to-point message sent of the section point got；
Transmission sub-unit, for confirming that section point gets newest transaction data not successfully, and send newest number of deals
According to section point as new last Successful Transaction data.
Preferably, the embodiment of the present invention additionally provides the data distribution check system in a kind of block chain network, including：Clothes
Device node, section point and the data as outlined above of being engaged in distribute calibration equipment；
Server node, data distribution calibration equipment and section point communicate to connect between any two.
Preferably, the data distribution check system in a kind of block chain network provided in an embodiment of the present invention also includes：The
One node；
First node and server node communication connection；
First node is used to send transaction data to server node.
As can be seen from the above technical solutions, the embodiment of the present invention has advantages below：
The embodiments of the invention provide the data distribution method of calibration in a kind of block chain network, apparatus and system, wherein,
This method includes：Very first time stamp and the second timestamp are determined, wherein, very first time stamp is once to be sent out by server node is newest
The timestamp included in the newest transaction data sent, the second timestamp are successfully to be connect with its last time by what section point was sent
Receive the timestamp in point-to-point message corresponding to the last Successful Transaction data that server node is sent；Compare the very first time stamp and
Second timestamp, if very first time stamp is more than the second timestamp, confirm that section point gets newest transaction data not successfully,
And newest transaction data is sent to section point as new last Successful Transaction data.The embodiment of the present invention passes through traditional
Server node and agent node (equivalent to the data distribution calibration equipment in block chain network) are added in block chain network,
Agent node obtain the server node newest newest transaction data, the section point that once send it is newest once send it is point-to-point
After message, agent node is by comparing both the second timestamps in the stamp of the very first time in transaction data and point-to-point message
Relation, and then determine whether section point has got newest transaction data, the bottleneck problem for solving block chain trading efficiency,
So that transaction data treatment effeciency is lifted in geometry level, the lifting to block chain network performance of transaction will make block chain technology be expert at
Meet performance requirement in industry application.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, without having to pay creative labor, may be used also
To obtain other accompanying drawings according to these accompanying drawings.
Fig. 1 is the flow signal of the data distribution method of calibration in a kind of block chain network provided in an embodiment of the present invention
Figure；
Fig. 2 is that another flow of the data distribution method of calibration in a kind of block chain network provided in an embodiment of the present invention is shown
It is intended to；
Fig. 3 is the structural representation of the data distribution calibration equipment in a kind of block chain network provided in an embodiment of the present invention
Figure；
Fig. 4 is the structural representation of the data distribution check system in a kind of block chain network provided in an embodiment of the present invention
Figure.
Embodiment
The embodiments of the invention provide the data distribution method of calibration in a kind of block chain network, apparatus and system, solves
The technical problem of trade confirmation overlong time present in current block chain technology.
To enable goal of the invention, feature, the advantage of the present invention more obvious and understandable, below in conjunction with the present invention
Accompanying drawing in embodiment, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that disclosed below
Embodiment be only part of the embodiment of the present invention, and not all embodiment.Based on the embodiment in the present invention, this area
All other embodiment that those of ordinary skill is obtained under the premise of creative work is not made, belongs to protection of the present invention
Scope.
Referring to Fig. 1, one of data distribution method of calibration in a kind of block chain network provided in an embodiment of the present invention
Embodiment, including：
101st, very first time stamp and the second timestamp are determined, wherein, very first time stamp is newest once by server node
The timestamp included in the newest transaction data sent, the second timestamp are by section point transmission and the success of its last time
Timestamp in point-to-point message corresponding to the last Successful Transaction data that the reception server node is sent.
Agent node determines very first time stamp and the second timestamp, wherein, very first time stamp is newest by server node
The timestamp included in the newest transaction data once sent, the second timestamp are by section point transmission and its last time
The timestamp being properly received in point-to-point message corresponding to the last Successful Transaction data of server node transmission.
It should be noted that server node, agent node, first node and section point are the section in block chain
Point, the function of being primarily due to its realization being distinguished are different.The very first time stabs and the second timestamp is also the time
Stamp, it is intended merely to the existing position difference of both differences and is named.
Server is after the newest transaction data once sent of first node is got, to the very first time in transaction data
Stamp carries out assignment, then obtains newest transaction data, server node sends newest transaction data to agent node after assignment
And section point, for well known to a person skilled in the art technology, server node, which sends transaction data to agent node, is
It is sure to succeed, but transaction data is sent to section point and not necessarily succeeded by server node, may be due to network the problems such as
Delay occur causes section point is no can successfully obtain transaction data.
Section point is successfully being got by the last Successful Transaction data of server node transmission for the last time, can be generated
One point-to-point information, and assignment is carried out to the second timestamp in point-to-point information, the value of the second timestamp is equal to the second section
The value of timestamp in the last Successful Transaction data that the server node that point last time is got is sent.
It is understood that very first time stamp and the second timestamp will be used for it is follow-up relatively with prove section point whether into
Work(obtains the transaction data of first node.
102nd, compare very first time stamp and the second timestamp, if very first time stamp is more than the second timestamp, confirm second
Node gets newest transaction data not successfully, and sends newest transaction data to section point as new last Successful Transaction
Data.
Agent node compares very first time stamp and the second timestamp, if very first time stamp is more than the second timestamp, confirms
Section point gets newest transaction data not successfully, and sends newest transaction data to section point as new last success
Transaction data.
It should be noted that there are two kinds of situations in the value of very first time stamp and the second timestamp.I.e. both are equal for the first,
Then illustrate that section point has been successfully received the transaction data of first node, i.e. section point has been successfully received server node
(now the newest newest transaction data once sent of server node is equal to agency to the newest newest transaction data once sent
Node last time is properly received the last Successful Transaction data of server node transmission), the newest transaction data includes
Stabbed in the very first time that numerical value is a (numerical value a is the time point that server node stabs progress assignment to the very first time).And the
Two nodes can generate a point-to-point message after the newest transaction data is successfully got, and in point-to-point message
Two timestamps carry out assignment, and the value is equal to the value that the very first time stabs in newest transaction data, and therefore, agent node is received
To the transaction data (having the equivalent very first time stamp in a), then receive the point-to-point information of section point transmission
(have equivalence in a the second timestamp), judge that very first time stamp is equal with the second timestamp, also the with regard to indirect proof
Two nodes have successfully got newest transaction data.
Second of situation is that the value of very first time stamp is more than the value of the second timestamp, then illustrates that section point connects not successfully
Newest transaction data is received, i.e. section point is unsuccessfully received newest transaction data.It should be noted that agent node is certain
The newest newest transaction data once sent of server node has been successfully received it, it is assumed that the newest transaction data, which includes, to be equal to
Numerical value is to stab b (numerical value b is that server node stabs the time point for carrying out assignment to the very first time) very first time.But by
The newest newest transaction data once sent of server node is got not successfully in section point, then will not generate newest point
To a message, and agent node is cached with the point-to-point message of last time, and the second time in last point-to-point message
The value of stamp is certainly less than the value b that the very first time stabs in the newest transaction data once sent of server node, therefore, when first
Between the value stabbed be more than the value of the second timestamp and then illustrate that section point is not received by newest transaction data.
It should be noted that server node gets first node first sends data100 and to the first of data100
Timestamp carries out assignment and then sends the data100 after assignment to agent node and section point, it is assumed that section point success
Receive server node transmission transaction data data100 (now data100 be equal to section point last time be properly received
The last Successful Transaction data that server node is sent), then the point-to-point message corresponding with data100 is generated, and to the point
Assignment is carried out to the second timestamp in a message, the value is equal to the value that the very first time stabs in data100, then this is point-to-point
Message is sent to agent node, and agent node has successfully got the data100 of server node transmission certainly, when it is by first
Between stamp be compared to obtain the two equal result with the second timestamp and then prove that section point has got data100.
Assuming that section point receives the transaction data data100 of server node transmission not successfully, but in agent node
Last section point is also cached with to be properly received the transaction data data99 of first node (now data99 is equal to the second section
Point last time is properly received the last Successful Transaction data of server node transmission) the point-to-point message that generates afterwards, the point pair
(value is equal to the transaction data that server node receives first node transmission to the value of the second timestamp included in point message
After data99, the time of assignment is carried out to the very first time stamp in transaction data data99) agent node is less than from server
The value for the very first time stamp that the data100 that node receives is included, also just reversely demonstrates section point and does not receive first node
Transaction data data100.Last agent node again can send data100 to section point, section point can generate with
Newest point-to-point message corresponding to data100, and assignment is carried out to the second timestamp in newest point-to-point message, and this is disappeared
Breath send to agent node, agent node can compare again the data100 very first times stab with data100 corresponding to point-to-point message
In the second timestamp, obtain the two equal result, confirm that section point has got data100.
The embodiment of the present invention is relative to traditional block chain transaction propagation agreement, by being added in traditional block chain
Server node and agent node, agent node obtain the transaction data and the newest hair of section point of the newest transmission of server node
After the point-to-point message sent, when agent node is by comparing second in the stamp of the very first time in transaction data and point-to-point message
Between stamp both magnitude relationship, and then determine whether section point has got the transaction data of first node, solve block
The bottleneck problem of chain trading efficiency so that transaction data treatment effeciency is lifted in geometry level, to block chain network performance of transaction
Lifting will make block chain technology meet performance requirement in sector application.
Referring to Fig. 2, data distribution method of calibration in a kind of block chain network provided in an embodiment of the present invention is another
Individual embodiment, including：
201st, very first time stamp and the second timestamp are determined, wherein, very first time stamp is newest once by server node
The timestamp included in the newest transaction data corresponding with the transaction data of its last time reception first node transmission sent,
Second timestamp is the last Successful Transaction that server node transmission is properly received with its last time by section point transmission
Timestamp in point-to-point message corresponding to data.
It is understood that first node sends transaction data to server node first, server node is to number of deals
Very first time stamp in carries out assignment, obtains newest transaction data, and server node again sends newest transaction data to the
Two nodes and agent node.
202nd, newest transaction data and the newest point-to-point message once sent of section point are cached.
The point-to-point message that agent node newest to newest transaction data and section point can once be sent caches, shape
Into buffered message queue.
203rd, compare very first time stamp and the second timestamp, if very first time stamp is equal to the second timestamp, perform 204,
If very first time stamp is more than the second timestamp, 205 are performed.
204th, confirm that section point successfully gets newest transaction data, delete newest transaction data and delete what is got
The last point-to-point message sent of section point.
205th, confirm that section point gets newest transaction data not successfully, and send newest transaction data to section point
As new last Successful Transaction data.
Agent node compares very first time stamp and the second timestamp, if very first time stamp is equal to the second timestamp, confirms
Section point successfully gets newest transaction data, deletes newest transaction data and deletes the last hair of the section point got
The point-to-point message sent, if very first time stamp is more than the second timestamp, confirm that section point gets newest transaction not successfully
Data, and newest transaction data is sent to section point as new last Successful Transaction data.
It should be noted that after confirming that section point gets newest transaction data, delete newest transaction data and delete
Except the last point-to-point message sent of section point.It is understood that agent node is judging that section point gets clothes
It is engaged in after the newest newest transaction data once sent of device node, can directly deletes newest transaction data, therefore, agent node is actual
On do not cache the transaction data of any one version (corresponding to any one time point), and agent node can delete the last time
Point-to-point message, and retain the point-to-point message (the second timestamp for including this) of this (i.e. newest once), for proving
Whether section point successfully gets newest transaction data next time.
Assuming that section point has successfully received the transaction data data100 of server transmission, then agent node can get the
The point-to-point message that two nodes generate according to data100, the point-to-point message include the second timestamp, the value of second timestamp
Very first time stamp in the transaction data data100 sent equal to server node to first node carries out the time of assignment, this
Preceding agent node has successfully got the transaction data100 of server node transmission, then can by data100 very first time stamp and
Second timestamp of point-to-point message (corresponding data100) is compared, and judges to delete data100 after the two is equal, but
It is the point-to-point message for retaining corresponding data100, while deletes corresponding data99 point-to-point message so that is in block chain each
Individual node such as agent node will not cache transaction data too much, can be more promptly to service node and other each nodes
The information of transmission responds, and further lifts block chain trading efficiency.
Because the present invention enables the transaction data of node broadcasts or new block quickly to allow enough nodes to respond,
And then be integrated into block account book, it is transactional to block chain network so as to solve the bottleneck problem of block chain trading efficiency
The lifting of energy will make block chain technology meet performance requirement in sector application.For example, bit coin block chain network is current
Per second to be only capable of handling 7 transactions, efficiency is low, and by contrast, laboratory test data newest Visa is that 5.6 ten thousand/second hand over
Easily (in actual applications, the peak value of Visa processing is 1.4 ten thousand/second).The block chain network of the present invention, transaction data are used
Treatment effeciency lifts geometry level.In the case that newly-increased server and proxy nodes are unit, at block chain network each second
Managing efficiency will be more than 1000, if in the case that server and proxy nodes are distributed type assemblies, reaching Visa and handling each second
5.6 ten thousand transactions it is horizontal also possible.
Referring to Fig. 3, the data distribution calibration equipment in a kind of block chain network provided in an embodiment of the present invention (is actually
Foregoing agents node) one embodiment, including：
Determining unit 301, for determining very first time stamp and the second timestamp, wherein, very first time stamp is by server
The timestamp included in the newest newest transaction data once sent of node, the second timestamp is by section point transmission and it
Last time is properly received the timestamp in point-to-point message corresponding to the last Successful Transaction data of server node transmission；
Comparing unit 303, for comparing very first time stamp and the second timestamp, if very first time stamp was more than for the second time
Stamp, then confirm that section point gets newest transaction data not successfully, and send newest transaction data to section point as new
Last Successful Transaction data.
Determining unit 301, it is additionally operable to determine very first time stamp and the second timestamp, wherein, very first time stamp is by servicing
The newest newest transaction data corresponding with the transaction data of its last time reception first node transmission once sending of device node
In the timestamp that includes, the second timestamp be sent by section point and its last time be properly received server node and send
Last Successful Transaction data corresponding to timestamp in point-to-point message.
Data distribution calibration equipment in a kind of block chain network provided in an embodiment of the present invention also includes：
Buffer unit 302, for caching the newest point-to-point message once sent of newest transaction data and section point.
Comparing unit 303 includes：
Comparing subunit 3031, for comparing very first time stamp and the second timestamp, if very first time stamp is equal to second
Between stab, then subelement 3032 is deleted in triggering, if very first time stamp is more than the second timestamp, triggering transmission sub-unit 3033；
Subelement 3032 is deleted, for confirming that section point successfully gets newest transaction data, deletes newest number of deals
According to and delete the last point-to-point message sent of the section point that gets；
Transmission sub-unit 3033, for confirming that section point gets newest transaction data not successfully, and send newest friendship
Easy data are to section point as new last Successful Transaction data.
Referring to Fig. 4, the data distribution check system in a kind of block chain network provided in an embodiment of the present invention, including：
Server node 401, section point 403 and data as outlined above distribution calibration equipment (agent node 402)；
Server node 401, data distribution calibration equipment (agent node 402) and section point 403 communicate between any two
Connection.
Data distribution check system in a kind of block chain network provided in an embodiment of the present invention also includes：First node
404；
First node 404 and server node 401 communicate to connect；
First node 404 is used to send transaction data to server node 401.
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, the corresponding process in preceding method embodiment is may be referred to, will not be repeated here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method can be with
Realize by another way.For example, device embodiment described above is only schematical, for example, the unit
Division, only a kind of division of logic function, can there is other dividing mode, such as multiple units or component when actually realizing
Another system can be combined or be desirably integrated into, or some features can be ignored, or do not perform.It is another, it is shown or
The mutual coupling discussed or direct-coupling or communication connection can be the indirect couplings by some interfaces, device or unit
Close or communicate to connect, can be electrical, mechanical or other forms.
The unit illustrated as separating component can be or may not be physically separate, show as unit
The part shown can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
On NE.Some or all of unit therein can be selected to realize the mesh of this embodiment scheme according to the actual needs
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can also
That unit is individually physically present, can also two or more units it is integrated in a unit.Above-mentioned integrated list
Member can both be realized in the form of hardware, can also be realized in the form of SFU software functional unit.
If the integrated unit is realized in the form of SFU software functional unit and is used as independent production marketing or use
When, it can be stored in a computer read/write memory medium.Based on such understanding, technical scheme is substantially
The part to be contributed in other words to prior art or all or part of the technical scheme can be in the form of software products
Embody, the computer software product is stored in a storage medium, including some instructions are causing a computer
Equipment (can be personal computer, server, or network equipment etc.) performs the complete of each embodiment methods described of the present invention
Portion or part steps.And foregoing storage medium includes：USB flash disk, mobile hard disk, read-only storage (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic disc or CD etc. are various can store journey
The medium of sequence code.
Described above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to before
Embodiment is stated the present invention is described in detail, it will be understood by those within the art that：It still can be to preceding
State the technical scheme described in each embodiment to modify, or equivalent substitution is carried out to which part technical characteristic；And these
Modification is replaced, and the essence of appropriate technical solution is departed from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
- A kind of 1. data distribution method of calibration in block chain network, it is characterised in that including：S1：Very first time stamp and the second timestamp are determined, wherein, very first time stamp is once sent by server node is newest The timestamp included in newest transaction data, the second timestamp are to be properly received clothes with its last time by what section point was sent The timestamp being engaged in point-to-point message corresponding to the last Successful Transaction data that device node is sent；S2：Compare very first time stamp and the second timestamp, if very first time stamp is more than the second timestamp, confirm section point not Newest transaction data is successfully got, and sends newest transaction data to section point as new last Successful Transaction data.
- 2. the data distribution method of calibration in block chain network according to claim 1, it is characterised in that step S1 is specific Including：Determine the very first time stamp and the second timestamp, wherein, the very first time stamp be by server node it is newest it is once sending with Its last time receives the timestamp included in newest transaction data corresponding to the transaction data that first node is sent, the second time The last Successful Transaction data that server node transmission is properly received with its last time for stabbing to be sent by section point are corresponding Point-to-point message in timestamp.
- 3. the data distribution method of calibration in block chain network according to claim 1, it is characterised in that before step S2 Also include：Cache the newest point-to-point message once sent of newest transaction data and section point.
- 4. the data distribution method of calibration in block chain network according to claim 3, it is characterised in that step S2 is specific Including：Compare very first time stamp and the second timestamp, if very first time stamp is equal to the second timestamp, confirm section point success Newest transaction data is got, newest transaction data is deleted and deletes point-to-point the disappearing of the section point last time transmission got Breath, if very first time stamp is more than the second timestamp, confirm that section point gets newest transaction data not successfully, and send most New Transaction data are to section point as new last Successful Transaction data.
- A kind of 5. data distribution calibration equipment in block chain network, it is characterised in that including：Determining unit, for determining very first time stamp and the second timestamp, wherein, very first time stamp is newest by server node The timestamp included in the newest transaction data once sent, the second timestamp are by section point transmission and its last time The timestamp being properly received in point-to-point message corresponding to the last Successful Transaction data of server node transmission；Comparing unit, for comparing very first time stamp and the second timestamp, if very first time stamp is more than the second timestamp, confirm Section point gets newest transaction data not successfully, and sends newest transaction data to section point as new last success Transaction data.
- 6. the data distribution calibration equipment in block chain network according to claim 5, it is characterised in that determining unit, It is additionally operable to determine very first time stamp and the second timestamp, wherein, very first time stamp is once sent by server node is newest The timestamp included in the corresponding newest transaction data of transaction data that first node sends is received with its last time, when second Between stamp be by section point send with its last time be properly received server node transmission last Successful Transaction data pair Timestamp in the point-to-point message answered.
- 7. the data distribution calibration equipment in block chain network according to claim 5, it is characterised in that also include：Buffer unit, for caching the newest point-to-point message once sent of newest transaction data and section point.
- 8. the data distribution calibration equipment in block chain network according to claim 7, it is characterised in that comparing unit bag Include：Comparing subunit, for comparing very first time stamp and the second timestamp, if very first time stamp is equal to the second timestamp, touch Hair deletes subelement, if very first time stamp is more than the second timestamp, triggers transmission sub-unit；Subelement is deleted, for confirming that section point successfully gets newest transaction data, newest transaction data is deleted and deletes The last point-to-point message sent of section point got；Transmission sub-unit, for confirming that section point gets newest transaction data not successfully, and send newest transaction data extremely Section point is as new last Successful Transaction data.
- A kind of 9. data distribution check system in block chain network, it is characterised in that including：Server node, section point With the data distribution calibration equipment as described in claim 5 to 8 any one；Server node, data distribution calibration equipment and section point communicate to connect between any two.
- 10. data broadcasting according to claim 9 and distribution check system, it is characterised in that also include：First node；First node and server node communication connection；First node is used to send transaction data to server node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710731166.4A CN107493340B (en) | 2017-08-23 | 2017-08-23 | Data distribution verification method, device and system in block chain network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710731166.4A CN107493340B (en) | 2017-08-23 | 2017-08-23 | Data distribution verification method, device and system in block chain network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107493340A true CN107493340A (en) | 2017-12-19 |
| CN107493340B CN107493340B (en) | 2020-02-11 |
Family
ID=60650726
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710731166.4A Active CN107493340B (en) | 2017-08-23 | 2017-08-23 | Data distribution verification method, device and system in block chain network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107493340B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107977340A (en) * | 2017-12-27 | 2018-05-01 | 邵美 | A kind of importance ranking method of block chain trade network node |
| CN108681965A (en) * | 2018-04-24 | 2018-10-19 | 全链通有限公司 | The block chain network transaction processing method and recipient's node of offline node |
| CN108777710A (en) * | 2018-05-31 | 2018-11-09 | 中国联合网络通信集团有限公司 | Block chain communication method between nodes, device and block chain node |
| CN108961048A (en) * | 2018-05-22 | 2018-12-07 | 杭州电子科技大学 | A kind of energy trade managing system and method based on DPoS block chain |
| CN108989043A (en) * | 2018-05-31 | 2018-12-11 | 中国联合网络通信集团有限公司 | Block processes method, apparatus and block chain node |
| CN109189727A (en) * | 2018-09-14 | 2019-01-11 | 江西理工大学 | A kind of block chain ciphertext cloud storage sharing method based on property broker re-encryption |
| CN109242299A (en) * | 2018-08-31 | 2019-01-18 | 深圳付贝科技有限公司 | Distribution digs mine method, digs mine machine and block catenary system |
| CN109345182A (en) * | 2018-11-12 | 2019-02-15 | 北京洛必达科技有限公司 | A kind of block chain logistics big data security processing system and method |
| CN109670956A (en) * | 2018-12-21 | 2019-04-23 | 成都四方伟业软件股份有限公司 | Block chain method of commerce and device |
| CN110598446A (en) * | 2019-09-16 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain based test method and device, storage medium and computer equipment |
| CN110750811A (en) * | 2018-07-05 | 2020-02-04 | 腾讯科技（深圳）有限公司 | Data storage method, data verification method, device, equipment and medium |
| CN113094753A (en) * | 2021-05-08 | 2021-07-09 | 重庆银行股份有限公司 | Big data platform hive data modification method and system based on block chain |
| CN113438287A (en) * | 2021-06-17 | 2021-09-24 | 杭州宇链科技有限公司 | Block chain deployment system and method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105404701A (en) * | 2015-12-31 | 2016-03-16 | 浙江图讯科技股份有限公司 | Peer-to-peer network-based heterogeneous database synchronization method |
| CN105912618A (en) * | 2016-04-07 | 2016-08-31 | 浙江万马新能源有限公司 | Block chain based charging pile charging transaction communication method and device |
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| CN106790431A (en) * | 2016-12-05 | 2017-05-31 | 同济大学 | Cloud manufacturing service Transaction Information record system and method based on block chain |
| WO2018130994A1 (en) * | 2017-01-13 | 2018-07-19 | Hashkloud Pty Ltd | Data verification and authentication system and method |
-
2017
- 2017-08-23 CN CN201710731166.4A patent/CN107493340B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105404701A (en) * | 2015-12-31 | 2016-03-16 | 浙江图讯科技股份有限公司 | Peer-to-peer network-based heterogeneous database synchronization method |
| CN105912618A (en) * | 2016-04-07 | 2016-08-31 | 浙江万马新能源有限公司 | Block chain based charging pile charging transaction communication method and device |
| CN106790431A (en) * | 2016-12-05 | 2017-05-31 | 同济大学 | Cloud manufacturing service Transaction Information record system and method based on block chain |
| CN106682907A (en) * | 2016-12-10 | 2017-05-17 | 江苏恒为信息科技有限公司 | Comparison and consensus method for block chain data |
| WO2018130994A1 (en) * | 2017-01-13 | 2018-07-19 | Hashkloud Pty Ltd | Data verification and authentication system and method |
Non-Patent Citations (1)
| Title |
|---|
| 王数 等: ""区块链技术的发展与前瞻"", 《电脑知识与技术》 * |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107977340A (en) * | 2017-12-27 | 2018-05-01 | 邵美 | A kind of importance ranking method of block chain trade network node |
| CN108681965A (en) * | 2018-04-24 | 2018-10-19 | 全链通有限公司 | The block chain network transaction processing method and recipient's node of offline node |
| CN108961048A (en) * | 2018-05-22 | 2018-12-07 | 杭州电子科技大学 | A kind of energy trade managing system and method based on DPoS block chain |
| CN108961048B (en) * | 2018-05-22 | 2021-11-09 | 杭州电子科技大学 | DPoS block chain-based energy transaction management system and method |
| CN108989043B (en) * | 2018-05-31 | 2021-01-26 | 中国联合网络通信集团有限公司 | Block processing method and device and block link points |
| CN108777710A (en) * | 2018-05-31 | 2018-11-09 | 中国联合网络通信集团有限公司 | Block chain communication method between nodes, device and block chain node |
| CN108989043A (en) * | 2018-05-31 | 2018-12-11 | 中国联合网络通信集团有限公司 | Block processes method, apparatus and block chain node |
| CN108777710B (en) * | 2018-05-31 | 2021-06-08 | 中国联合网络通信集团有限公司 | Inter-node communication method and device of block chain and block chain node |
| CN110750811B (en) * | 2018-07-05 | 2021-05-25 | 腾讯科技（深圳）有限公司 | Data storage method, data verification method, device, equipment and medium |
| CN110750811A (en) * | 2018-07-05 | 2020-02-04 | 腾讯科技（深圳）有限公司 | Data storage method, data verification method, device, equipment and medium |
| US11914730B2 (en) | 2018-07-05 | 2024-02-27 | Tencent Technology (Shenzhen) Company Limited | Data storage method, apparatus and device, data verification method, apparatus and device, and medium |
| CN109242299A (en) * | 2018-08-31 | 2019-01-18 | 深圳付贝科技有限公司 | Distribution digs mine method, digs mine machine and block catenary system |
| CN109189727B (en) * | 2018-09-14 | 2021-07-23 | 江西理工大学 | Block chain ciphertext cloud storage sharing method based on attribute proxy re-encryption |
| CN109189727A (en) * | 2018-09-14 | 2019-01-11 | 江西理工大学 | A kind of block chain ciphertext cloud storage sharing method based on property broker re-encryption |
| CN109345182A (en) * | 2018-11-12 | 2019-02-15 | 北京洛必达科技有限公司 | A kind of block chain logistics big data security processing system and method |
| CN109670956A (en) * | 2018-12-21 | 2019-04-23 | 成都四方伟业软件股份有限公司 | Block chain method of commerce and device |
| CN110598446A (en) * | 2019-09-16 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain based test method and device, storage medium and computer equipment |
| CN113094753A (en) * | 2021-05-08 | 2021-07-09 | 重庆银行股份有限公司 | Big data platform hive data modification method and system based on block chain |
| CN113438287A (en) * | 2021-06-17 | 2021-09-24 | 杭州宇链科技有限公司 | Block chain deployment system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107493340B (en) | 2020-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107493340A (en) | Data distribution method of calibration in block chain network, apparatus and system | |
| CN107464106B (en) | Method and system for transaction between main chain and side chain of block chain | |
| CN109426949B (en) | Cross-chain transaction method and device | |
| WO2019179192A1 (en) | Blockchain transaction processing method and device and storage medium | |
| US10341431B2 (en) | System and method for announcing cryptographic keys on a blockchain | |
| CN107396360A (en) | Block verification method and device | |
| CN109327459B (en) | Consensus method for union block chain network | |
| CN108600315B (en) | Block link route processing method, device and storage medium | |
| CN107171810A (en) | The verification method and device of block chain | |
| CN107330681A (en) | A kind of method and apparatus of exchange hour for being used to determine to merchandise outside block chain chain | |
| CN101102190A (en) | Method for generating local interface secret key | |
| CN112184436B (en) | Data synchronization method, electronic device and readable storage medium | |
| CN107194008A (en) | A kind of distributed system quickly updates verification method | |
| CN104601541A (en) | Data transmission method, server and user equipment | |
| CN104899731A (en) | Mobile payment data transmission method, mobile payment data transmission device and mobile payment data transmission system | |
| CN109493040B (en) | Anti-double-flower attack processing method and device based on block chain | |
| CN110928952A (en) | Data synchronization method and device based on block chain | |
| CN112272114A (en) | Method, device, equipment and storage medium for sending information across block chain network | |
| CN112202564A (en) | Transaction transfer method and device, electronic equipment and readable storage medium | |
| CN112087497A (en) | Data synchronization method and device, electronic equipment and readable storage medium | |
| CN104507059B (en) | A kind of multimedia message transmitting administrative method and multimedia message send managing device | |
| CN110598479A (en) | Data processing method and device and computer readable storage medium | |
| CN104361519B (en) | A kind of implementation method of social networking service platform and social networking service platform | |
| CN110248326B (en) | Data processing method and device | |
| CN107040945A (en) | The QoS amending methods and mobility management entity device of EPC networks |
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 |