CN107493340B - Data distribution verification method, device and system in block chain network - Google Patents
Data distribution verification method, device and system in block chain network Download PDFInfo
- Publication number
- CN107493340B CN107493340B CN201710731166.4A CN201710731166A CN107493340B CN 107493340 B CN107493340 B CN 107493340B CN 201710731166 A CN201710731166 A CN 201710731166A CN 107493340 B CN107493340 B CN 107493340B
- Authority
- CN
- China
- Prior art keywords
- node
- time stamp
- transaction data
- latest
- 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.)
- Active
Links
Images
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 a data distribution verification method, a device and a system in a block chain network, wherein the method comprises the following steps: by adding the server node and the proxy node in the traditional block chain, after the proxy node acquires the transaction data which is newly sent by the server node and the point-to-point message which is newly sent by the second node, the proxy node compares the size relationship between the first timestamp in the transaction data and the second timestamp in the point-to-point message, and then determines whether the second node acquires the transaction data of the first node, so that the bottleneck problem of the block chain transaction efficiency is solved, the transaction data processing efficiency is improved in a geometric level, and the improvement on the block chain network transaction performance can enable the block chain technology to meet the performance requirements in industrial application.
Description
Technical Field
The present invention relates to the field of distributed data broadcasting and distribution technologies, and in particular, to a method, an apparatus, and a system for verifying data distribution in a blockchain network.
Background
Bitcoin is by far the most successful blockchain application scenario, and the transaction data propagation protocol of bitcoin system includes the following steps:
1) the bitcoin trading node broadcasts the newly generated trading data to all nodes of the whole network;
2) each node stores the collected transaction data in a block;
3) each node finds a workload proof with enough difficulty in the block based on self computing power;
4) when the node finds the workload certification of the block, the node broadcasts the block to all nodes in the whole network;
5) other nodes agree on the validity of the block only if all transactions contained in the block are valid and have not previously existed;
6) the other nodes accept the data block and create a new block at the end of the block to extend the chain, treating the random hash value of the accepted block as prior to the random hash value of the new block.
The blockchain, as a new technology which is emerging and rapidly developed in recent years, is bound to face various problems and obstacles which restrict the development thereof, and the efficiency problem thereof is the biggest bottleneck which restricts the application of the blockchain industry.
Transaction confirmation time the bit coin block generation time is 10 minutes, and thus the transaction confirmation time is generally 10 minutes, which limits the application of bit coins in small value transactions and time sensitive transactions to a certain extent.
Therefore, a data distribution verification method in a blockchain network is provided to solve the technical problem of long transaction confirmation time in the current blockchain technology.
Disclosure of Invention
The embodiment of the invention provides a data distribution and verification method, device and system in a block chain network, which solve the technical problem of overlong transaction confirmation time in the current block chain technology.
The embodiment of the invention provides a data distribution checking method in a block chain network, which comprises the following steps:
s1: determining a first time stamp and a second time stamp, wherein the first time stamp is a time stamp contained in latest transaction data which is sent by the server node for the latest time, and the second time stamp is a time stamp in a point-to-point message which is sent by the second node and corresponds to the latest successful transaction data which is sent by the server node and is successfully received for the latest time;
s2: and comparing the first time stamp with the second time stamp, if the first time stamp is larger than the second time stamp, confirming that the second node does not successfully acquire the latest transaction data, and sending the latest transaction data to the second node as new latest successful transaction data.
Preferably, step S1 specifically includes:
and determining a first time stamp and a second time stamp, wherein the first time stamp is the time stamp contained in the latest transaction data which is sent by the server node for the latest time and corresponds to the transaction data sent by the first node which is received for the last time, and the second time stamp is the time stamp in the point-to-point message which is sent by the second node and corresponds to the point-to-point message which is sent by the server node and corresponds to the point-to-point message which is successfully received for the last time.
Preferably, step S2 is preceded by:
and caching the latest transaction data and the point-to-point message which is sent by the second node for the latest time.
Preferably, step S2 specifically includes:
and comparing the first time stamp with the second time stamp, if the first time stamp is equal to the second time stamp, confirming that the second node successfully acquires the latest transaction data, deleting the latest transaction data and deleting the point-to-point message which is sent by the acquired second node last time, and if the first time stamp is larger than the second time stamp, confirming that the second node does not successfully acquire the latest transaction data and sending the latest transaction data to the second node as new last successful transaction data.
Preferably, an embodiment of the present invention further provides a data distribution verification apparatus in a blockchain network, where the apparatus includes:
the determining unit is used for determining a first time stamp and a second time stamp, wherein the first time stamp is a time stamp contained in latest transaction data which is sent by the server node for the latest time, and the second time stamp is a time stamp in a point-to-point message which is sent by the second node and corresponds to the latest successful transaction data which is sent by the server node and is successfully received for the latest time;
and the comparison unit is used for comparing the first time stamp with the second time stamp, confirming that the second node does not successfully acquire the latest transaction data if the first time stamp is larger than the second time stamp, and sending the latest transaction data to the second node as new last successful transaction data.
Preferably, the determining unit is further configured to determine a first timestamp and a second timestamp, where the first timestamp is a timestamp included in latest transaction data corresponding to the transaction data sent by the first node and last received by the server node, and the second timestamp is a timestamp in a point-to-point message sent by the second node and corresponding to the last successful transaction data sent by the server node and last received by the second node.
Preferably, the data distribution checking apparatus in the blockchain network provided in the embodiment of the present invention further includes:
and the caching unit is used for caching the latest transaction data and the point-to-point message which is sent by the second node at the latest time.
Preferably, the comparison unit includes:
the comparison subunit is used for comparing the first time stamp with the second time stamp, if the first time stamp is equal to the second time stamp, the deletion subunit is triggered, and if the first time stamp is greater than the second time stamp, the sending subunit is triggered;
the deleting subunit is used for confirming that the second node successfully acquires the latest transaction data, deleting the latest transaction data and deleting the point-to-point message which is acquired and sent by the second node last time;
and the sending subunit is used for confirming that the second node does not successfully acquire the latest transaction data and sending the latest transaction data to the second node as new latest successful transaction data.
Preferably, an embodiment of the present invention further provides a data distribution verification system in a blockchain network, including: the server node, the second node and the data distribution checking device are used for checking the data distribution;
the server node, the data distribution checking device and the second node are in communication connection.
Preferably, the data distribution checking system in the blockchain network provided in the embodiment of the present invention further includes: a first node;
the first node is in communication connection with the server node;
the first node is used for sending transaction data to the server node.
According to the technical scheme, the embodiment of the invention has the following advantages:
the embodiment of the invention provides a data distribution verification method, a device and a system in a block chain network, wherein the method comprises the following steps: determining a first time stamp and a second time stamp, wherein the first time stamp is a time stamp contained in latest transaction data which is sent by the server node for the latest time, and the second time stamp is a time stamp in a point-to-point message which is sent by the second node and corresponds to the latest successful transaction data which is sent by the server node and is successfully received for the latest time; and comparing the first time stamp with the second time stamp, if the first time stamp is larger than the second time stamp, confirming that the second node does not successfully acquire the latest transaction data, and sending the latest transaction data to the second node as new latest successful transaction data. According to the embodiment of the invention, the server node and the proxy node (which are equivalent to a data distribution and verification device in the blockchain network) are added in the traditional blockchain network, after the proxy node acquires the latest transaction data sent by the server node for the latest time and the point-to-point message sent by the second node for the latest time, the proxy node compares the relation between the first timestamp in the transaction data and the second timestamp in the point-to-point message to determine whether the second node acquires the latest transaction data, so that the bottleneck problem of blockchain transaction efficiency is solved, the transaction data processing efficiency is improved in a geometric grade manner, and the improvement of the blockchain network transaction performance can enable the blockchain technology to meet the performance requirements in industrial application.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without inventive exercise.
Fig. 1 is a schematic flowchart of a data distribution verification method in a blockchain network according to an embodiment of the present invention;
fig. 2 is another schematic flowchart of a data distribution verification method in a blockchain network according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a data distribution checking apparatus in a blockchain network according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a data distribution verification system in a blockchain network according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention provides a data distribution and verification method, device and system in a block chain network, which solve the technical problem of overlong transaction confirmation time in the current block chain technology.
In order to make the objects, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the embodiments described below are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, an embodiment of a data distribution checking method in a blockchain network according to an embodiment of the present invention includes:
101. and determining a first time stamp and a second time stamp, wherein the first time stamp is the time stamp contained in the latest transaction data which is sent by the server node for the latest time, and the second time stamp is the time stamp in the point-to-point message which is sent by the second node and corresponds to the latest successful transaction data which is sent by the server node and is successfully received for the latest time.
The proxy node determines a first time stamp and a second time stamp, wherein the first time stamp is a time stamp contained in latest transaction data sent by the server node for the latest time, and the second time stamp is a time stamp in a point-to-point message sent by the second node and corresponding to the latest successful transaction data sent by the server node which is successfully received for the latest time.
It should be noted that the server node, the proxy node, the first node, and the second node are all nodes in the blockchain, and the difference is mainly due to different functions implemented by the server node, the proxy node, the first node, and the second node. The first timestamp and the second timestamp are also both timestamps, but are named differently to distinguish where the two exist.
The server assigns a first timestamp in the transaction data after acquiring the latest transaction data sent by the first node, so that the latest transaction data is acquired, and the server node sends the latest transaction data to the agent node and the second node after assigning.
And the second node generates a piece of point-to-point information when successfully acquiring the last successful transaction data sent by the server node for the last time, and assigns a second timestamp in the point-to-point information, wherein the value of the second timestamp is equal to the value of the timestamp in the successfully transaction data sent by the server node and acquired by the second node for the last time.
It will be appreciated that the first and second time stamps will be used in a subsequent comparison to demonstrate whether the second node successfully acquired the first node's transaction data.
102. And comparing the first time stamp with the second time stamp, if the first time stamp is larger than the second time stamp, confirming that the second node does not successfully acquire the latest transaction data, and sending the latest transaction data to the second node as new latest successful transaction data.
And the agent node compares the first time stamp with the second time stamp, if the first time stamp is larger than the second time stamp, the second node is confirmed to unsuccessfully acquire the latest transaction data, and the latest transaction data is sent to the second node to be used as new last successful transaction data.
It should be noted that there are two cases in which the values of the first time stamp and the second time stamp exist. The first is that the two are equal, it indicates that the second node successfully receives the transaction data of the first node, that is, the second node successfully receives the latest transaction data sent by the server node last time (at this time, the latest transaction data sent by the server node last time is equal to the latest successful transaction data sent by the proxy node last time successfully), and the latest transaction data includes a first timestamp equal to a (the value a is the time point at which the server node assigns the first timestamp). And after the second node successfully acquires the latest transaction data, a point-to-point message is generated, and a second timestamp in the point-to-point message is assigned, wherein the value is equal to the value of the first timestamp in the latest transaction data, so that the agent node receives the transaction data (namely, the agent node has the first timestamp equivalent to a), receives point-to-point information sent by the second node (namely, the agent node has the second timestamp equivalent to a), judges that the first timestamp is equal to the second timestamp, and indirectly proves that the second node successfully acquires the latest transaction data.
The second case that the value of the first timestamp is greater than the value of the second timestamp indicates that the second node did not successfully receive the latest transaction data, i.e., the second node did not successfully receive the latest transaction data. It should be noted that the proxy node has to successfully receive the latest transaction data that is sent by the server node for the latest time, and it is assumed that the latest transaction data includes a first timestamp equal to a value b (the value b is a time point at which the server node assigns a value to the first timestamp). However, the second node does not successfully acquire the latest transaction data sent by the server node for the latest time, the latest point-to-point message is not generated, the proxy node caches the latest point-to-point message, and the value of the second timestamp in the latest point-to-point message is definitely smaller than the value b of the first timestamp in the transaction data sent by the server node for the latest time, so that when the value of the first timestamp is larger than the value of the second timestamp, it is indicated that the second node does not receive the latest transaction data.
It should be noted that, a server node first acquires data100 sent by a first node, assigns a first timestamp of the data100, and then sends the assigned data100 to an agent node and a second node, assuming that the second node successfully receives transaction data100 sent by the server node (at this time, the data100 is equal to the last successful transaction data sent by the server node successfully received by the second node last time), a point-to-point message corresponding to the data100 is generated, assigns a second timestamp in the point-to-point message, the value is equal to the value of the first timestamp in the data100, and then sends the point-to-point message to the agent node, the agent node definitely and successfully acquires the data100 sent by the server node, and the result that the first timestamp and the second timestamp are equal is obtained by comparing the first timestamp and the second timestamp proves that the data100 is acquired by the second node.
Assume that the second node does not successfully receive the transaction data100 sent by the server node, but a point-to-point message generated after the second node successfully receives the transaction data99 of the first node last time (at this time, data99 is equal to the last successful transaction data sent by the server node last time) is cached in the proxy node, and a value of a second timestamp included in the point-to-point message (the value is equal to the time for assigning a first timestamp in the transaction data99 after the server node receives the transaction data99 sent by the first node) is smaller than a value of a first timestamp included in the data100 received by the proxy node from the server node, that is, it is reversely verified that the second node does not receive the transaction data100 of the first node. And finally, the agent node sends the data100 to the second node again, the second node generates a latest point-to-point message corresponding to the data100, assigns a second timestamp in the latest point-to-point message, and sends the message to the agent node, and the agent node compares the first timestamp of the data100 with the second timestamp in the point-to-point message corresponding to the data100 again to obtain the result that the first timestamp and the second timestamp are equal to each other, and confirms that the data100 is obtained by the second node.
Compared with the traditional blockchain transaction propagation protocol, the embodiment of the invention has the advantages that the server node and the proxy node are added in the traditional blockchain, after the proxy node acquires the transaction data which is newly sent by the server node and the point-to-point message which is newly sent by the second node, the proxy node compares the size relationship between the first timestamp in the transaction data and the second timestamp in the point-to-point message, and then determines whether the second node acquires the transaction data of the first node, so that the bottleneck problem of blockchain transaction efficiency is solved, the transaction data processing efficiency is improved in a geometric grade manner, and the improvement on the blockchain network transaction performance can enable the blockchain technology to meet the performance requirements in industrial application.
Referring to fig. 2, another embodiment of a data distribution checking method in a blockchain network according to an embodiment of the present invention includes:
201. and determining a first time stamp and a second time stamp, wherein the first time stamp is the time stamp contained in the latest transaction data which is sent by the server node for the latest time and corresponds to the transaction data sent by the first node which is received for the last time, and the second time stamp is the time stamp in the point-to-point message which is sent by the second node and corresponds to the point-to-point message which is sent by the server node and corresponds to the point-to-point message which is successfully received for the last time.
It can be understood that the first node first sends the transaction data to the server node, the server node assigns a value to the first timestamp in the transaction data to obtain the latest transaction data, and the server node sends the latest transaction data to the second node and the agent node.
202. And caching the latest transaction data and the point-to-point message which is sent by the second node for the latest time.
The proxy node caches the latest transaction data and the point-to-point message which is sent by the second node at the latest time, and a cache message queue is formed.
203. The first timestamp and the second timestamp are compared, 204 is executed if the first timestamp is equal to the second timestamp, and 205 is executed if the first timestamp is greater than the second timestamp.
204. And confirming that the second node successfully acquires the latest transaction data, deleting the latest transaction data and deleting the point-to-point message which is acquired and sent last time by the second node.
205. And confirming that the second node does not successfully acquire the latest transaction data, and sending the latest transaction data to the second node as new latest successful transaction data.
And the proxy node compares the first time stamp with the second time stamp, if the first time stamp is equal to the second time stamp, the second node is confirmed to successfully acquire the latest transaction data, the latest transaction data is deleted, the point-to-point message sent by the second node last time is deleted, if the first time stamp is larger than the second time stamp, the second node is confirmed to unsuccessfully acquire the latest transaction data, and the latest transaction data is sent to the second node to serve as new last successful transaction data.
It should be noted that after it is confirmed that the second node acquires the latest transaction data, the latest transaction data is deleted and the point-to-point message sent by the second node last time is deleted. It can be understood that, after the agent node determines that the second node acquires the latest transaction data sent by the server node for the latest time, the agent node directly deletes the latest transaction data, so that the agent node does not actually cache the transaction data of any version (corresponding to any time point), and the agent node deletes the last point-to-point message and retains the point-to-point message (including the second timestamp of the current time) of the current time (i.e., the latest time) for proving whether the second node successfully acquires the latest transaction data next time.
Assuming that the second node successfully receives the transaction data100 sent by the server, the proxy node acquires a point-to-point message generated by the second node according to the data100, the point-to-point message includes a second timestamp, the value of the second timestamp is equal to the time for the server node to assign a value to the first timestamp in the transaction data100 sent by the first node, and before the proxy node successfully acquires the transaction data100 sent by the server node, the first timestamp of the data100 and the second timestamp of the point-to-point message (corresponding data100) are compared, the data100 is deleted after the first timestamp of the data100 and the second timestamp of the point-to-point message (corresponding data100) are equal to each other, but the point-to-point message corresponding to the data100 is retained, and the point-to-point message corresponding to the data99 is deleted, so that each node in the block chain, such as the proxy node, does not excessively cache the transaction data, and can, further improving the efficiency of blockchain transactions.
The invention enables the transaction data or the new block broadcasted by the node to quickly make response by enough nodes and further integrate into the block account book, thereby solving the bottleneck problem of the block chain transaction efficiency, and improving the block chain network transaction performance to enable the block chain technology to meet the performance requirements in industrial application. For example, Bitband blockchain networks are currently only able to process 7 transactions per second, which is inefficient, compared to the latest laboratory test data of Visa being 5.6 million transactions per second (in practical applications, Visa processes peak to be 1.4 million transactions per second). By using the block chain network, the transaction data processing efficiency is improved in geometric grade. Under the condition that the newly added server and proxy nodes are single machines, the processing efficiency of the block chain network per second exceeds 1000, and if the server and the proxy nodes are distributed clusters, the level of processing 5.6 ten thousand transactions per second by Visa can be achieved.
Referring to fig. 3, an embodiment of a data distribution checking apparatus (actually, the proxy node) in a blockchain network according to the present invention includes:
a determining unit 301, configured to determine a first timestamp and a second timestamp, where the first timestamp is a timestamp included in latest transaction data that is sent by a server node last time, and the second timestamp is a timestamp in a point-to-point message that is sent by a second node and corresponds to last successful transaction data that was sent by the server node last time and was successfully received;
and the comparing unit 303 is configured to compare the first timestamp with the second timestamp, and if the first timestamp is greater than the second timestamp, determine that the second node does not successfully acquire the latest transaction data, and send the latest transaction data to the second node as new last successful transaction data.
The determining unit 301 is further configured to determine a first timestamp and a second timestamp, where the first timestamp is a timestamp included in latest transaction data corresponding to transaction data sent by the first node and last received by the server node last, and the second timestamp is a timestamp in a point-to-point message sent by the second node and corresponding to last successful transaction data sent by the server node and last successfully received by the second node.
The data distribution and verification device in the block chain network provided by the embodiment of the invention further comprises:
the caching unit 302 is configured to cache the latest transaction data and the point-to-point message that is sent by the second node the latest time.
The comparison unit 303 includes:
a comparing subunit 3031, configured to compare the first timestamp with the second timestamp, trigger the deleting subunit 3032 if the first timestamp is equal to the second timestamp, and trigger the sending subunit 3033 if the first timestamp is greater than the second timestamp;
a deleting subunit 3032, configured to confirm that the second node successfully acquires the latest transaction data, delete the latest transaction data, and delete the point-to-point message that is sent by the second node last time;
and a sending subunit 3033, configured to confirm that the second node has not successfully obtained the latest transaction data, and send the latest transaction data to the second node as new last successful transaction data.
Referring to fig. 4, a data distribution verification system in a blockchain network according to an embodiment of the present invention includes:
a server node 401, a second node 403 and a data distribution checking means (proxy node 402) as described above;
the server node 401, the data distribution checking device (proxy node 402), and the second node 403 are connected in communication with each other.
The data distribution and verification system in the block chain network provided by the embodiment of the invention further comprises: a first node 404;
the first node 404 is communicatively connected to the server node 401;
the first node 404 is configured to send transaction data to the server node 401.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A data distribution checking method in a block chain network is characterized by comprising the following steps:
s1: determining a first time stamp and a second time stamp, wherein the first time stamp is a time stamp contained in latest transaction data which is sent by the server node for the latest time, and the second time stamp is a time stamp in a point-to-point message which is sent by the second node and corresponds to the latest successful transaction data which is sent by the server node and is successfully received for the latest time;
s2: and comparing the first time stamp with the second time stamp, if the first time stamp is larger than the second time stamp, confirming that the second node does not successfully acquire the latest transaction data, and sending the latest transaction data to the second node as new latest successful transaction data.
2. The method for verifying data distribution in a blockchain network according to claim 1, wherein step S1 specifically includes:
and determining a first time stamp and a second time stamp, wherein the first time stamp is the time stamp contained in the latest transaction data which is sent by the server node for the latest time and corresponds to the transaction data sent by the first node which is received for the last time, and the second time stamp is the time stamp in the point-to-point message which is sent by the second node and corresponds to the point-to-point message which is sent by the server node and corresponds to the point-to-point message which is successfully received for the last time.
3. The method for checking data distribution in a blockchain network according to claim 1, wherein step S2 is preceded by:
and caching the latest transaction data and the point-to-point message which is sent by the second node for the latest time.
4. The method for verifying data distribution in a blockchain network according to claim 3, wherein the step S2 specifically includes:
and comparing the first time stamp with the second time stamp, if the first time stamp is equal to the second time stamp, confirming that the second node successfully acquires the latest transaction data, deleting the latest transaction data and deleting the point-to-point message which is sent by the acquired second node last time, and if the first time stamp is larger than the second time stamp, confirming that the second node does not successfully acquire the latest transaction data and sending the latest transaction data to the second node as new last successful transaction data.
5. A data distribution verification apparatus in a blockchain network, comprising:
the determining unit is used for determining a first time stamp and a second time stamp, wherein the first time stamp is a time stamp contained in latest transaction data which is sent by the server node for the latest time, and the second time stamp is a time stamp in a point-to-point message which is sent by the second node and corresponds to the latest successful transaction data which is sent by the server node and is successfully received for the latest time;
and the comparison unit is used for comparing the first time stamp with the second time stamp, confirming that the second node does not successfully acquire the latest transaction data if the first time stamp is larger than the second time stamp, and sending the latest transaction data to the second node as new last successful transaction data.
6. The data distribution checking apparatus in a blockchain network according to claim 5, wherein the determining unit is further configured to determine a first timestamp and a second timestamp, wherein the first timestamp is a timestamp included in latest transaction data corresponding to the transaction data sent by the first node and last sent by the server node, and the second timestamp is a timestamp in a point-to-point message corresponding to the last successful transaction data sent by the server node and last sent by the second node.
7. The data distribution verification apparatus in a blockchain network according to claim 5, further comprising:
and the caching unit is used for caching the latest transaction data and the point-to-point message which is sent by the second node at the latest time.
8. The data distribution checking apparatus in a blockchain network according to claim 7, wherein the comparing unit includes:
the comparison subunit is used for comparing the first time stamp with the second time stamp, if the first time stamp is equal to the second time stamp, the deletion subunit is triggered, and if the first time stamp is greater than the second time stamp, the sending subunit is triggered;
the deleting subunit is used for confirming that the second node successfully acquires the latest transaction data, deleting the latest transaction data and deleting the point-to-point message which is acquired and sent by the second node last time;
and the sending subunit is used for confirming that the second node does not successfully acquire the latest transaction data and sending the latest transaction data to the second node as new latest successful transaction data.
9. A data distribution verification system in a blockchain network, comprising: a server node, a second node and a data distribution checking apparatus according to any one of claims 5 to 8;
the server node, the data distribution checking device and the second node are in communication connection.
10. The data distribution verification system according to claim 9, further comprising: a first node;
the first node is in communication connection with the server node;
the first node is used for sending transaction data to the 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 CN107493340A (en) | 2017-12-19 |
| CN107493340B true 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) |
Families Citing this family (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 |
| CN108681965B (en) * | 2018-04-24 | 2021-01-29 | 全链通有限公司 | Block chain network transaction processing method and device for offline node |
| 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 |
| 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 |
| 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 |
| CN109345182A (en) * | 2018-11-12 | 2019-02-15 | 北京洛必达科技有限公司 | A kind of block chain logistics big data security processing system and method |
| CN109670956B (en) * | 2018-12-21 | 2021-05-04 | 成都四方伟业软件股份有限公司 | Block chain transaction method and device |
| CN110598446A (en) * | 2019-09-16 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Block chain based test method and device, storage medium and computer equipment |
| CN113094753B (en) * | 2021-05-08 | 2023-02-24 | 重庆银行股份有限公司 | Big data platform hive data modification method and system based on block chain |
| CN113438287B (en) * | 2021-06-17 | 2022-07-01 | 杭州宇链科技有限公司 | 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 |
|---|
| "区块链技术的发展与前瞻";王数 等;《电脑知识与技术》;20170815;第13卷(第23期);第34-36页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107493340A (en) | 2017-12-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107493340B (en) | Data distribution verification method, device and system in block chain network | |
| CN107171810B (en) | Verification method and device of block chain | |
| CN107396360B (en) | Block verification method and device | |
| CN107294729B (en) | Communication method and device between different nodes in block chain | |
| CN107276765B (en) | Processing method and device for consensus in block chain | |
| CN107480990B (en) | Block chain accounting method and device | |
| CN112685796B (en) | Block chain-based block consensus method and related equipment | |
| CN108665359B (en) | Block chain processing method, accounting node and verification node | |
| CN110177124B (en) | Identity authentication method based on block chain and related equipment | |
| EP3934161A1 (en) | Consensus method and data verification method, apparatus, and system of consortium blockchain | |
| CN112600678B (en) | Data processing method, device, equipment and storage medium | |
| CN108600315B (en) | Block link route processing method, device and storage medium | |
| CN110445615B (en) | Network request security verification method, device, medium and electronic equipment | |
| CN109166040B (en) | Transaction auditing method, device, equipment and storage medium based on block chain | |
| CN112907369A (en) | Block chain-based data consensus method and device, electronic equipment and storage medium | |
| CN111258986A (en) | Rollback method of block chain | |
| CN112398692A (en) | Consensus process processing method and device and electronic equipment | |
| CN112184436A (en) | Data synchronization method, electronic device and readable storage medium | |
| CN113255014A (en) | Data processing method based on block chain and related equipment | |
| US20220239668A1 (en) | Blockchain-based message processing method and apparatus, device, and storage medium | |
| CN112835885A (en) | Processing method, device and system for distributed table storage | |
| CN105184559A (en) | System and method for payment | |
| CN109885258B (en) | Data deleting device and method based on block chain | |
| CN111309809A (en) | Block header storage method and equipment thereof | |
| CN110598479A (en) | Data processing method and device and computer readable storage medium |
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 |