CN108694581B - Transaction information processing method and device and block link points - Google Patents
Transaction information processing method and device and block link points Download PDFInfo
- Publication number
- CN108694581B CN108694581B CN201810449063.3A CN201810449063A CN108694581B CN 108694581 B CN108694581 B CN 108694581B CN 201810449063 A CN201810449063 A CN 201810449063A CN 108694581 B CN108694581 B CN 108694581B
- Authority
- CN
- China
- Prior art keywords
- storage node
- transaction information
- transaction
- hash value
- compensation
- 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
- 230000010365 information processing Effects 0.000 title claims abstract description 32
- 238000003672 processing method Methods 0.000 title claims abstract description 20
- 238000000034 method Methods 0.000 claims abstract description 27
- 238000012790 confirmation Methods 0.000 claims abstract description 14
- 238000004590 computer program Methods 0.000 claims description 11
- 230000008569 process Effects 0.000 abstract description 11
- 238000004891 communication Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 6
- 238000012545 processing Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 101100134058 Caenorhabditis elegans nth-1 gene Proteins 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Computer Security & Cryptography (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The embodiment of the invention provides a transaction information processing method, a transaction information processing device and a block chain node. The method comprises the following steps: a first storage node receives an exchange request message sent by a second storage node, wherein the exchange request message comprises the number, the hash value and the recording time of first transaction information which is stored in the second storage node and is not recorded into a block; the first storage node determines a hash value of second transaction information according to the locally stored second transaction information which is not marked into a block; and if the hash value of the first transaction information is different from the hash value of the second transaction information, and the quantity of the first transaction information is the same as that of the second transaction information, the first storage node sends an exchange confirmation message to the second storage node. The embodiment of the invention ensures the fairness of the first storage node and the second storage node in the exchange process of the transaction information.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a transaction information processing method and device and a block chain node.
Background
In a blockchain network, transaction information stored by different storage nodes may be different, and therefore, the storage nodes may obtain the transaction information stored in other storage nodes by communicating with other storage nodes.
However, the amount of the transaction information stored by different storage nodes is also different, and therefore, it is difficult to ensure the fairness of the different storage nodes in the transaction information exchange process.
Disclosure of Invention
The embodiment of the invention provides a transaction information processing method and device and a block link node, so as to ensure fairness of a first storage node and a second storage node in a transaction information exchange process.
In a first aspect, an embodiment of the present invention provides a transaction information processing method, including:
a first storage node receives an exchange request message sent by a second storage node, wherein the exchange request message comprises the number, the hash value and the recording time of first transaction information which is stored in the second storage node and is not recorded into a block;
the first storage node determines a hash value of second transaction information according to the locally stored second transaction information which is not marked into a block;
and if the hash value of the first transaction information is different from the hash value of the second transaction information, and the quantity of the first transaction information is the same as that of the second transaction information, the first storage node sends an exchange confirmation message to the second storage node.
In a second aspect, an embodiment of the present invention provides a transaction information processing apparatus, including:
the receiving module is used for receiving an exchange request message sent by a second storage node, wherein the exchange request message comprises the number, the hash value and the recording time of first transaction information which is stored in the second storage node and is not recorded into a block;
the determining module is used for determining a hash value of second transaction information according to the locally stored second transaction information which is not marked into a block;
and the sending module is used for sending an exchange confirmation message to the second storage node when the hash value of the first transaction information is different from the hash value of the second transaction information and the quantity of the first transaction information is the same as that of the second transaction information.
In a third aspect, an embodiment of the present invention provides a block link point, including:
a memory;
a processor; and
a computer program;
wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of the first aspect.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, the computer program being executed by a processor to implement the method of the first aspect.
According to the transaction information processing method, the transaction information processing device and the block link node provided by the embodiment of the invention, the exchange request message sent by the second storage node is received through the first storage node, the hash value of the second transaction information is determined according to the second transaction information which is locally stored and is not logged into the block, when the hash value of the first transaction information is different from that of the second transaction information and the number of the first transaction information is the same as that of the second transaction information, the first transaction information and the second transaction information are not completely the same, and at the moment, the first storage node sends the exchange confirmation message to the second storage node, so that the fairness of the first storage node and the second storage node in the transaction information exchange process is ensured.
Drawings
Fig. 1 is a schematic diagram of an application scenario provided in an embodiment of the present invention;
FIG. 2 is a flow chart of a transaction information processing method according to an embodiment of the invention;
fig. 3 is a schematic diagram of another application scenario provided in the embodiment of the present invention;
FIG. 4 is a flow chart of a transaction information processing method according to another embodiment of the invention;
FIG. 5 is a schematic structural diagram of a transaction information processing apparatus according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a blockchain node according to an embodiment of the present invention.
With the foregoing drawings in mind, certain embodiments of the disclosure have been shown and described in more detail below. These drawings and written description are not intended to limit the scope of the disclosed concepts in any way, but rather to illustrate the concepts of the disclosure to those skilled in the art by reference to specific embodiments.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
The transaction information processing method provided by the invention can be applied to the communication system shown in figure 1. As shown in fig. 1, the communication system includes: access network device 11, terminal device 12, and server 13. It should be noted that the communication System shown in fig. 1 may be applicable to different network formats, for example, may be applicable to Global System for Mobile communication (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), Time Division-Synchronous Code Division Multiple Access (TD-SCDMA), Long Term Evolution (Long Term Evolution, LTE), and future 5G network formats. Optionally, the communication system may be a system in a scenario of high-reliability and Low-Latency Communications (URLLC) transmission in a 5G communication system.
Therefore, optionally, the access Network device 11 may be a Base Station (BTS) and/or a Base Station Controller in GSM or CDMA, a Base Station (NodeB, NB) and/or a Radio Network Controller (RNC) in WCDMA, an evolved Node B (eNB or eNodeB) in LTE, or a relay Station or an access point, or a Base Station (gbb) in a future 5G Network, and the present invention is not limited thereto.
The terminal device 12 may be a wireless terminal or a wired terminal. A wireless terminal may refer to a device that provides voice and/or other traffic data connectivity to a user, a handheld device having wireless connection capability, or other processing device connected to a wireless modem. A wireless terminal, which may be a mobile terminal such as a mobile telephone (or "cellular" telephone) and a computer having a mobile terminal, for example, a portable, pocket, hand-held, computer-included, or vehicle-mounted mobile device, may communicate with one or more core Network devices via a Radio Access Network (RAN), and may exchange language and/or data with the RAN. For another example, the Wireless terminal may also be a Personal Communication Service (PCS) phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), and other devices. A wireless Terminal may also be referred to as a system, a Subscriber Unit (Subscriber Unit), a Subscriber Station (Subscriber Station), a Mobile Station (Mobile), a Remote Station (Remote Station), a Remote Terminal (Remote Terminal), an Access Terminal (Access Terminal), a User Terminal (User Terminal), a User Agent (User Agent), and a User Device or User Equipment (User Equipment), which are not limited herein. Optionally, the terminal device 12 may also be a smart watch, a tablet computer, or the like. In this embodiment, the terminal device 12 and the server 13 may be nodes in a blockchain network.
The invention provides a transaction information processing method, which aims to solve the technical problems in the prior art.
The following describes the technical solutions of the present invention and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present invention will be described below with reference to the accompanying drawings.
Fig. 2 is a flowchart of a transaction information processing method according to an embodiment of the present invention. The embodiment of the invention provides a transaction information processing method aiming at the technical problems in the prior art, which comprises the following specific steps:
As shown in fig. 3, the blockchain network includes a storage node 31, a storage node 32, a storage node 33, and a storage node 34, and any two storage nodes of the storage node 31, the storage node 32, the storage node 33, and the storage node 34 may communicate with each other. Optionally, the storage node 31, the storage node 32, the storage node 33 and the storage node 34 are connected to each other in a communication manner.
In the present embodiment, the storage node 31 is taken as the first storage node, and the storage node 32 is taken as the second transaction information for illustration.
As shown in fig. 3, it is assumed that the storage node 32 locally stores the first transaction information that is not logged, and the first transaction information may specifically be transaction information generated by at least one transaction node received by the storage node 32. Assuming that the number of the first transaction information is 10, the storage node 32 may calculate the hash value corresponding to the first transaction information according to the first transaction information. The storage node 32 sends an exchange request message to the storage node 31, where the exchange request message includes the recording time of the first transaction information, the hash value corresponding to the first transaction information, and the number of the first transaction information. Wherein the first transaction information may be recorded from after the nth block is generated to before the nth-1 block is not generated, and may also be recorded from after the nth block is generated to a time when the exchange request message is issued.
In this embodiment, the second transaction information of the un-posted block is stored in the storage node 31, and the first transaction information of the un-posted block stored in the storage node 32 may be completely or partially identical to the second transaction information of the un-posted block stored in the storage node 31.
The storage node 31 performs hash operation on the locally stored second transaction information that is not logged into the block to obtain a hash value corresponding to the second transaction information.
After the storage node 31 receives the exchange request message sent by the storage node 32, first, whether the quantity of the first transaction information stored by the storage node 32 is the same as the quantity of the second transaction information stored by the storage node 31 is compared, if the quantity of the first transaction information stored by the storage node 32 is the same as the quantity of the second transaction information stored by the storage node 31, the storage node 31 further compares whether the hash value corresponding to the first transaction information is the same as the hash value corresponding to the second transaction information, and if the hash value corresponding to the first transaction information is the same as the hash value corresponding to the second transaction information, it indicates that the first transaction information stored with the non-logged block in the storage node 32 may be completely the same as the second transaction information stored with the non-logged block in the storage node 31, and further, the storage node 31 sends the prompt message to the storage node 32, the prompt message is used to prompt the storage node 32 that the transaction information stored in the storage node 31 is the same and no interaction is required.
If the number of the first transaction information stored by the storage node 32 is the same as the number of the second transaction information stored by the storage node 31, and the hash value corresponding to the first transaction information is different from the hash value corresponding to the second transaction information, it indicates that the first transaction information stored in the storage node 32 without the block entry may not be completely the same as the second transaction information stored in the storage node 31 without the block entry, at this time, the storage node 31 may send an exchange confirmation message to the storage node 32, specifically, the storage node 31 may send the second transaction information to the storage node 32, and the storage node 32 may send the first transaction information to the storage node 31, so that the storage node 31 and the storage node 32 acquire the transaction information that the storage node 31 and the storage node 32 do not originally have locally. Since the number of the transaction information originally stored locally by the storage node 32 and the storage node 31 is the same, the storage node 32 does not need to compensate the storage node 31 and the storage node 31 does not need to compensate the storage node 32 in the exchange process of the transaction information between the storage node 32 and the storage node 31.
In addition, if the number of the first transaction information is greater than that of the second transaction information, the first storage node sends compensation transaction application information to the second storage node, and the compensation transaction application information includes compensation information sent by the first storage node to the second storage node.
If the number of the first transaction information stored by the storage node 32 is greater than the number of the second transaction information stored by the storage node 31, that is, the second transaction information stored by the storage node 31 is less, and the first transaction information stored by the storage node 32 is more, the storage node 31 may determine to exchange the transaction information with the storage node 32, or may determine not to exchange the transaction information with the storage node 32. If the storage node 31 determines to exchange the transaction information with the storage node 32, the storage node 31 needs to compensate the storage node 32, and optionally, the storage node 31 sends compensation transaction application information to the storage node 32, where the compensation transaction application information includes compensation information from the storage node 31 to the storage node 32. Optionally, the storage node 31 may encrypt the compensation transaction application information by using its own private key to obtain encrypted compensation transaction application information, and send the encrypted compensation transaction application information to the storage node 32, so that the storage node 32 decrypts the compensation information sent by the storage node 31 to the storage node 32 according to the public key of the storage node 31, and determines whether to exchange transaction information with the storage node 31 according to the compensation information. If the storage node 32 determines to exchange transaction information with the storage node 31 according to the compensation information, the storage node 32 transmits an exchange confirmation message to the storage node 31, and if the storage node 32 determines not to exchange transaction information with the storage node 31 according to the compensation information, the storage node 32 transmits an exchange rejection message to the storage node 31.
In addition, if the number of the first transaction information is smaller than the number of the second transaction information, the first storage node sends the hash value of the second transaction information and the number of the second transaction information to the second storage node. And the first storage node receives compensation transaction application information sent by the second storage node, wherein the compensation transaction application information comprises compensation information sent by the second storage node to the first storage node.
If the amount of the first transaction information stored by the storage node 32 is less than the amount of the second transaction information stored by the storage node 31, that is, the amount of the second transaction information stored by the storage node 31 is large, and the amount of the first transaction information stored by the storage node 32 is small, the storage node 31 sends the hash value of the second transaction information and the amount of the second transaction information to the storage node 32. After the storage node 32 receives the hash value of the second transaction information and the number of the second transaction information sent by the storage node 31, it is determined that the number of the second transaction information stored by the storage node 31 is greater than the number of the first transaction information stored by the storage node 32, and at this time, the storage node 32 may determine to exchange the transaction information with the storage node 31 or may determine not to exchange the transaction information with the storage node 31. If the storage node 32 determines to exchange transaction information with the storage node 31, the storage node 32 needs to compensate the storage node 31, and optionally, the storage node 32 sends compensation transaction application information to the storage node 31, where the compensation transaction application information includes compensation information from the storage node 32 to the storage node 31. Optionally, the storage node 32 may encrypt the compensation transaction application information by using its own private key to obtain encrypted compensation transaction application information, and send the encrypted compensation transaction application information to the storage node 31, so that the storage node 31 decrypts the compensation information sent by the storage node 32 to the storage node 31 according to the public key of the storage node 32, and determines whether to exchange transaction information with the storage node 32 according to the compensation information. If the storage node 31 determines to exchange transaction information with the storage node 32 according to the compensation information, the storage node 31 transmits an exchange confirmation message to the storage node 32, and if the storage node 31 determines not to exchange transaction information with the storage node 32 according to the compensation information, the storage node 31 transmits an exchange rejection message to the storage node 32.
Optionally, when the transaction information stored in the storage node is greater than a preset value, the exchange request message is sent to other storage nodes, and if the other storage nodes determine to exchange the transaction information with the storage node, the storage node may obtain compensation of the other storage nodes, so that the other storage nodes can be promoted to store more transaction information. If the transaction information stored in the storage node is smaller than the preset value, the storage node may only perform single-point exchange with another storage node, or wait for receiving broadcast messages of other storage nodes.
In the embodiment of the invention, the first storage node receives the exchange request message sent by the second storage node, and determines the hash value of the second transaction information according to the second transaction information which is locally stored and is not logged in the block, when the hash value of the first transaction information is different from the hash value of the second transaction information, and the number of the first transaction information is the same as that of the second transaction information, the first transaction information and the second transaction information are not completely the same, and at the moment, the first storage node sends the exchange confirmation message to the second storage node, so that the fairness of the first storage node and the second storage node in the exchange process of the transaction information is ensured.
Fig. 4 is a flowchart of a transaction information processing method according to another embodiment of the invention. On the basis of the foregoing embodiment, the transaction information processing method provided in this embodiment specifically includes the following steps:
The implementation manner of step 401 and step 201 is consistent with specific principles, and is not described herein again.
The implementation manner of step 402 and step 202 is consistent with specific principles, and will not be described herein.
The implementation manner of step 403 and step 203 is consistent with specific principles, and will not be described herein again
In this embodiment, when the storage node 31 determines to exchange the transaction information with the storage node 32, the storage node 31 may send the second transaction information to the storage node 32 within a preset time, specifically, the storage node 31 may encrypt the second transaction information by using a private key of the storage node 31, and send the encrypted second transaction information to the storage node 32 within the preset time, which may be a short time in this embodiment.
When the storage node 32 receives the second transaction information or the encrypted second transaction information sent by the storage node 31, the storage node 32 needs to immediately send the first transaction information to the storage node 32, or immediately encrypt the first transaction information and immediately send the encrypted first transaction information to the storage node 32, otherwise, the exchange is invalid, and the blockchain system cancels compensation and reward for the storage node of the default party in the transaction process.
In the embodiment of the invention, the first storage node receives the exchange request message sent by the second storage node, and determines the hash value of the second transaction information according to the second transaction information which is locally stored and is not logged in the block, when the hash value of the first transaction information is different from the hash value of the second transaction information, and the number of the first transaction information is the same as that of the second transaction information, the first transaction information and the second transaction information are not completely the same, and at the moment, the first storage node sends the exchange confirmation message to the second storage node, so that the fairness of the first storage node and the second storage node in the exchange process of the transaction information is ensured.
Fig. 5 is a schematic structural diagram of a transaction information processing apparatus according to an embodiment of the present invention. As shown in fig. 5, the transaction information processing apparatus 50 according to an embodiment of the present invention may execute a processing flow provided by the transaction information processing method according to an embodiment of the present invention, and includes: a receiving module 51, a determining module 52 and a transmitting module 53; the receiving module 51 is configured to receive an exchange request message sent by a second storage node, where the exchange request message includes the number, hash value, and recording time of first transaction information that is stored in the second storage node and is not logged in to a block; the determining module 52 is configured to determine a hash value of the second transaction information according to the locally stored second transaction information that is not logged into the block; the sending module 53 is configured to send an exchange confirmation message to the second storage node when the hash value of the first transaction information is different from the hash value of the second transaction information, and the number of the first transaction information is the same as the number of the second transaction information.
Optionally, the sending module 53 is further configured to: and when the quantity of the first transaction information is greater than that of the second transaction information, sending compensation transaction application information to the second storage node, wherein the compensation transaction application information comprises compensation information sent to the second storage node by the first storage node.
Optionally, the sending module 53 is further configured to: and when the quantity of the first transaction information is smaller than the quantity of the second transaction information, sending the hash value of the second transaction information and the quantity of the second transaction information to the second storage node.
Optionally, the receiving module 51 is further configured to: and receiving compensation transaction application information sent by the second storage node, wherein the compensation transaction application information comprises compensation information sent by the second storage node to the first storage node.
Optionally, the sending module 53 is further configured to: sending the second transaction information to the second storage node within a preset time; the receiving module 51 is further configured to: and receiving first transaction information sent by the second storage node within the preset time.
The transaction information processing apparatus of the embodiment shown in fig. 5 can be used to implement the technical solutions of the above method embodiments, and the implementation principles and technical effects are similar, and are not described herein again.
Fig. 6 is a schematic structural diagram of a blockchain node according to an embodiment of the present invention. The block link point provided by the embodiment of the present invention may execute the processing flow provided by the transaction information processing method embodiment, as shown in fig. 6, the block link point 60 includes a memory 61, a processor 62, a computer program, and a communication interface 63; wherein the computer program is stored in the memory 61 and is configured to be executed by the processor 62 to execute the transaction information processing method according to the above-described embodiment.
The block link points of the embodiment shown in fig. 6 can be used to implement the technical solution of the above method embodiment, and the implementation principle and technical effect are similar, and are not described herein again.
In addition, the present embodiment also provides a computer-readable storage medium on which a computer program is stored, the computer program being executed by a processor to implement the transaction information processing method described in the above embodiment.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. 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, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
It is obvious to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be performed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to perform all or part of the above described functions. For the specific working process of the device described above, reference may be made to the corresponding process in the foregoing method embodiment, which is not described herein again.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (12)
1. A transaction information processing method, comprising:
a first storage node receives an exchange request message sent by a second storage node, wherein the exchange request message comprises the number, the hash value and the recording time of first transaction information which is stored in the second storage node and is not recorded into a block;
the first storage node determines a hash value of second transaction information according to the locally stored second transaction information which is not marked into a block;
and if the hash value of the first transaction information is different from the hash value of the second transaction information, and the quantity of the first transaction information is the same as that of the second transaction information, the first storage node sends an exchange confirmation message to the second storage node.
2. The method of claim 1, further comprising:
and if the quantity of the first transaction information is greater than that of the second transaction information, the first storage node sends compensation transaction application information to the second storage node, wherein the compensation transaction application information comprises compensation information sent to the second storage node by the first storage node.
3. The method of claim 1, further comprising:
and if the quantity of the first transaction information is less than that of the second transaction information, the first storage node sends the hash value of the second transaction information and the quantity of the second transaction information to the second storage node.
4. The method of claim 3, further comprising:
and the first storage node receives compensation transaction application information sent by the second storage node, wherein the compensation transaction application information comprises compensation information sent by the second storage node to the first storage node.
5. The method according to any of claims 1-4, wherein after the first storage node sends an exchange acknowledgement message to the second storage node, the method further comprises:
the first storage node sends the second transaction information to the second storage node within a preset time;
and the first storage node receives the first transaction information sent by the second storage node in the preset time.
6. A transaction information processing apparatus applied to a first storage node, the apparatus comprising:
the receiving module is used for receiving an exchange request message sent by a second storage node, wherein the exchange request message comprises the number, the hash value and the recording time of first transaction information which is stored in the second storage node and is not recorded into a block;
the determining module is used for determining a hash value of second transaction information according to the locally stored second transaction information which is not marked into a block;
and the sending module is used for sending an exchange confirmation message to the second storage node when the hash value of the first transaction information is different from the hash value of the second transaction information and the quantity of the first transaction information is the same as that of the second transaction information.
7. The transaction information processing device of claim 6, wherein the sending module is further configured to: and when the quantity of the first transaction information is greater than that of the second transaction information, sending compensation transaction application information to the second storage node, wherein the compensation transaction application information comprises compensation information sent to the second storage node by the first storage node.
8. The transaction information processing device of claim 6, wherein the sending module is further configured to: and when the quantity of the first transaction information is less than that of the second transaction information, sending the hash value of the second transaction information and the quantity of the second transaction information to the second storage node.
9. The transaction information processing device of claim 8, wherein the receiving module is further configured to: and receiving compensation transaction application information sent by the second storage node, wherein the compensation transaction application information comprises compensation information sent by the second storage node to the first storage node.
10. The transaction information processing device of any of claims 6-8, wherein the sending module is further configured to: sending the second transaction information to the second storage node within a preset time;
the receiving module is further configured to: and receiving first transaction information sent by the second storage node within the preset time.
11. A block link point, comprising:
a memory;
a processor; and
a computer program;
wherein the computer program is stored in the memory and configured to be executed by the processor to implement the method of any one of claims 1-5.
12. A computer-readable storage medium, having stored thereon a computer program for execution by a processor to perform the method of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810449063.3A CN108694581B (en) | 2018-05-11 | 2018-05-11 | Transaction information processing method and device and block link points |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810449063.3A CN108694581B (en) | 2018-05-11 | 2018-05-11 | Transaction information processing method and device and block link points |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108694581A CN108694581A (en) | 2018-10-23 |
| CN108694581B true CN108694581B (en) | 2021-06-29 |
Family
ID=63846230
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810449063.3A Active CN108694581B (en) | 2018-05-11 | 2018-05-11 | Transaction information processing method and device and block link points |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108694581B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109784928B (en) * | 2019-01-23 | 2024-04-12 | 众安信息技术服务有限公司 | Information processing method and information processing device based on block chain |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105719185A (en) * | 2016-01-22 | 2016-06-29 | 杭州复杂美科技有限公司 | Block chain data comparison and consensus method |
| CN106452785A (en) * | 2016-09-29 | 2017-02-22 | 财付通支付科技有限公司 | Block chain network, branch node and block chain network application method |
| CN107317672A (en) * | 2017-05-10 | 2017-11-03 | 广东网金控股股份有限公司 | A kind of light weight terminating machine block catenary system |
| CN107767127A (en) * | 2017-10-23 | 2018-03-06 | 中国联合网络通信集团有限公司 | Exchange information processing method and device in block chain |
| CN107809484A (en) * | 2017-10-30 | 2018-03-16 | 中国联合网络通信集团有限公司 | Block chain exchange information processing method and block chain node |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10938571B2 (en) * | 2016-10-26 | 2021-03-02 | Acronis International Gmbh | System and method for verification of data transferred among several data storages |
| US10719771B2 (en) * | 2016-11-09 | 2020-07-21 | Cognitive Scale, Inc. | Method for cognitive information processing using a cognitive blockchain architecture |
-
2018
- 2018-05-11 CN CN201810449063.3A patent/CN108694581B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105719185A (en) * | 2016-01-22 | 2016-06-29 | 杭州复杂美科技有限公司 | Block chain data comparison and consensus method |
| CN106452785A (en) * | 2016-09-29 | 2017-02-22 | 财付通支付科技有限公司 | Block chain network, branch node and block chain network application method |
| CN107317672A (en) * | 2017-05-10 | 2017-11-03 | 广东网金控股股份有限公司 | A kind of light weight terminating machine block catenary system |
| CN107767127A (en) * | 2017-10-23 | 2018-03-06 | 中国联合网络通信集团有限公司 | Exchange information processing method and device in block chain |
| CN107809484A (en) * | 2017-10-30 | 2018-03-16 | 中国联合网络通信集团有限公司 | Block chain exchange information processing method and block chain node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108694581A (en) | 2018-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109067724B (en) | Block chain data transaction method, device, equipment and storage medium | |
| CN108712506B (en) | Block chain node communication method and device and block chain node | |
| CN109118360B (en) | Block chain account checking method, device, equipment and storage medium | |
| CN108900528B (en) | Block chain real-name authentication method, device, equipment and storage medium | |
| CN108200568B (en) | Mobile communication electronic SIM card data processing method and device | |
| CN108605225B (en) | Safety processing method and related equipment | |
| CN108881296B (en) | Block chain real-name authentication method, device, equipment and storage medium | |
| CN109087100B (en) | Key distribution method, device, equipment and storage medium | |
| CN108769142B (en) | Transaction information processing method and block generation node | |
| CN108989043B (en) | Block processing method and device and block link points | |
| CN108683727B (en) | Block processing method and main node | |
| CN109087096B (en) | Block chain account checking method, device, equipment and storage medium | |
| CN108876611B (en) | Transaction information processing method and device and block link points | |
| CN108777710B (en) | Inter-node communication method and device of block chain and block chain node | |
| US20150365475A1 (en) | Resource Allocation Method and Device for Direct Communication Between User Devices | |
| CN108768961B (en) | Storage processing method and home gateway | |
| EP3522668A1 (en) | Method and device for accessing network | |
| CN109104285B (en) | Block chain real-name authentication method, device, equipment and storage medium | |
| CN108777712B (en) | Block chain node communication method and device and block chain node | |
| CN108694581B (en) | Transaction information processing method and device and block link points | |
| CN108898419B (en) | Reward information processing method and device and block link points | |
| CN110944331B (en) | Method for obtaining context configuration information, terminal equipment and access network equipment | |
| CN108768733B (en) | Block chain account book processing method and device and block chain link points | |
| CN108848144B (en) | Method and device for accessing nodes in block chain and block chain link point | |
| WO2019028777A1 (en) | Paging method, terminal device, and network device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |