CN108765150A - Exchange information processing method and memory node - Google Patents
Exchange information processing method and memory node Download PDFInfo
- Publication number
- CN108765150A CN108765150A CN201810449027.7A CN201810449027A CN108765150A CN 108765150 A CN108765150 A CN 108765150A CN 201810449027 A CN201810449027 A CN 201810449027A CN 108765150 A CN108765150 A CN 108765150A
- Authority
- CN
- China
- Prior art keywords
- transaction information
- block
- memory
- memory node
- node
- 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.)
- Pending
Links
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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
Abstract
A kind of exchange information processing method of offer of the embodiment of the present invention and memory node.This method includes：The first Transaction Information for not charging to block being locally stored is sent to other memory nodes in the block chain network by memory node；The memory node receives the second Transaction Information being stored in other described memory nodes and do not charge to block that other described memory nodes are sent；The memory node determines the third Transaction Information for not charging to block according to first Transaction Information and second Transaction Information；If the third Transaction Information is the All Activity information for not charging to block in the block chain network, the third Transaction Information is sent to and digs mine node by the memory node.The embodiment of the present invention can guarantee that it is complete to charge to area's Transaction Information in the block.
Description
Technical field
The present embodiments relate to field of communication technology more particularly to a kind of exchange information processing methods and memory node.
Background technology
In block chain network, when a certain participation node generation Transaction Information, which can be broadcast to the area
In block chain network, so as to other nodes records in the block chain network and the Transaction Information is stored, but can so lead to this
Occur broadcast storm in block chain network, therefore be directed to the problem, the transaction of node generation will be participated in the prior art by proposing
Information is transmitted directly to the memory node in the block chain network.
But in the prior art, the participation node for generating Transaction Information is not and all storages in the block chain network
Node all connects so that Transaction Information that each memory node receives or storage is not complete in the block chain network
Transaction Information, so as to cause charging to, area's Transaction Information in the block is imperfect.
Invention content
A kind of exchange information processing method of offer of the embodiment of the present invention and memory node, to ensure to charge to area's transaction in the block
Information is complete.
In a first aspect, the embodiment of the present invention provides a kind of exchange information processing method, including：
The first Transaction Information for not charging to block being locally stored is sent in the block chain network by memory node
Other memory nodes；
The memory node receives being stored in other described memory nodes and not remembering for other memory nodes transmission
Enter the second Transaction Information of block；
The memory node is determined and is not charged to the of block according to first Transaction Information and second Transaction Information
Three Transaction Informations；
It is described to deposit if the third Transaction Information is the All Activity information for not charging to block in the block chain network
The third Transaction Information is sent to and digs mine node by storage node.
Second aspect, the embodiment of the present invention provide a kind of memory node, including：
Sending module, the first Transaction Information for not charging to block for that will be locally stored are sent to the block chain network
In other memory nodes；
Receiving module is not remembered for being stored in other described memory nodes of receiving that other described memory nodes send and
Enter the second Transaction Information of block；
Determining module, for according to first Transaction Information and second Transaction Information, block not to be charged in determination
Third Transaction Information；
The sending module is additionally operable to：When the third Transaction Information is the institute for not charging to block in the block chain network
When having Transaction Information, the third Transaction Information is sent to and digs mine node.
The third aspect, the embodiment of the present invention provide a kind of memory node, including：
Memory；
Processor；And
Computer program；
Wherein, the computer program is stored in the memory, and is configured as being executed with reality by the processor
Method described in existing first aspect.
Fourth aspect, the embodiment of the present invention provide a kind of computer readable storage medium, are stored thereon with computer program,
The computer program is executed by processor to realize the method described in first aspect.
Exchange information processing method and memory node provided in an embodiment of the present invention will be deposited locally by the first memory node
The first Transaction Information for not charging to block of storage is sent to other memory nodes in the block chain network, receives other storages
The second Transaction Information being stored in other memory nodes and do not charge to block that node is sent, if being believed according to first transaction
Breath and second Transaction Information determine that it is the institute for not charging to block in the block chain network not charge to the third Transaction Information of block
Have Transaction Information, then first memory node by the third Transaction Information be sent to dig mine node, so as to the digging mine node according to
The third Transaction Information generates block, to ensure that it is complete to charge to area's Transaction Information in the block.
Description of the drawings
Fig. 1 is a kind of schematic diagram of application scenarios provided in an embodiment of the present invention；
Fig. 2 is exchange information processing method flow chart provided in an embodiment of the present invention；
Fig. 3 is the schematic diagram of another application scenarios provided in an embodiment of the present invention；
Fig. 4 is the exchange information processing method flow chart that another embodiment of the present invention provides；
Fig. 5 is the structural schematic diagram of memory node provided in an embodiment of the present invention；
Fig. 6 is the structural schematic diagram for the memory node that another embodiment of the present invention provides.
Through the above attached drawings, it has been shown that the specific embodiment of the disclosure will be hereinafter described in more detail.These attached drawings
It is not intended to limit the scope of this disclosure concept by any means with verbal description, but is by referring to specific embodiments
Those skilled in the art illustrate the concept of the disclosure.
Specific implementation mode
Example embodiments are described in detail here, and the example is illustrated in the accompanying drawings.Following description is related to
When attached drawing, unless otherwise indicated, the same numbers in different drawings indicate the same or similar elements.Following exemplary embodiment
Described in embodiment do not represent all implementations consistent with this disclosure.On the contrary, they be only with it is such as appended
The example of the consistent device and method of some aspects be described in detail in claims, the disclosure.
Exchange information processing method provided by the invention can be adapted for communication system shown in FIG. 1.As shown in Figure 1, should
Communication system includes：Access network equipment 11, terminal device 12 and server 13.It should be noted that communication system shown in FIG. 1
System can be adapted for different network formats, for example, can be adapted for global system for mobile telecommunications (Global System of
Mobile communication, abbreviation GSM), CDMA (Code Division Multiple Access, referred to as
CDMA), wideband code division multiple access (Wideband Code Division Multiple Access, abbreviation WCDMA), time division synchronous
CDMA (Time Division-Synchronous Code Division Multiple Access, abbreviation TD-
SCDMA), the network formats such as the 5G in long term evolution (Long Term Evolution, abbreviation LTE) system and future.Optionally,
Above-mentioned communication system can be that highly reliable low time delay communicates (Ultra-Reliable and Low Latency in 5G communication systems
Communications, abbreviation URLLC) transmission scene in system.
So optionally, above-mentioned access network equipment 11 can be base station (the Base Transceiver in GSM or CDMA
Station, abbreviation BTS) and/or base station controller can also be base station (NodeB, abbreviation NB) in WCDMA and/or wireless
Network controller (Radio Network Controller, abbreviation RNC), can also be the evolved base station in LTE
(Evolutional Node B, abbreviation eNB or eNodeB) either base in relay station or access point or future 5G networks
Stand (gNB) etc., and the present invention does not limit herein.
Above-mentioned terminal device 12 can be that wireless terminal can also be catv terminal.Wireless terminal can be directed to user and carry
For voice and/or the equipment of other business datum connectivity, there is the portable equipment of wireless connecting function or be connected to wireless
Other processing equipments of modem.Wireless terminal can be through wireless access network (Radio Access Network, abbreviation
RAN it) is communicated with one or more equipments of the core network, wireless terminal can be mobile terminal, as mobile phone (or is
" honeycomb " phone) and computer with mobile terminal, for example, it may be portable, pocket, hand-held, built-in computer
Or vehicle-mounted mobile device, they exchange language and/or data with wireless access network.For another example wireless terminal can be with
It is personal communication service (Personal Communication Service, abbreviation PCS) phone, wireless phone, session setup
Agreement (Session Initiation Protocol, abbreviation SIP) phone, wireless local loop (Wireless Local
Loop, abbreviation WLL) it stands, the equipment such as personal digital assistant (Personal Digital Assistant, abbreviation PDA).It is wireless whole
End is referred to as system, subscriber unit (Subscriber Unit), subscriber station (Subscriber Station), movement station
(Mobile Station), mobile station (Mobile), distant station (Remote Station), remote terminal (Remote
Terminal), access terminal (Access Terminal), user terminal (User Terminal), user agent (User
Agent), user equipment (User Device or User Equipment), is not limited thereto.Optionally, above-mentioned terminal is set
Standby 12 can also be the equipment such as smartwatch, tablet computer.In the present embodiment, terminal device 12 and server 13 can be areas
Participation node in block chain network.
Exchange information processing method provided by the invention, it is intended to solve the technical problem as above of the prior art.
How the technical solution of technical scheme of the present invention and the application is solved with specifically embodiment below above-mentioned
Technical problem is described in detail.These specific embodiments can be combined with each other below, for same or analogous concept
Or process may repeat no more in certain embodiments.Below in conjunction with attached drawing, the embodiment of the present invention is described.
Fig. 2 is exchange information processing method flow chart provided in an embodiment of the present invention.The embodiment of the present invention is directed to existing skill
The technical problem as above of art, provides exchange information processing method, and this method is as follows：
The first Transaction Information for not charging to block being locally stored is sent to the block chain by step 201, memory node
Other memory nodes in network.
As shown in figure 3, block chain network includes the first memory node 31, the second memory node 32, third memory node
33, the 4th memory node 34, transaction node 1 and transaction node 2 only schematically illustrate, do not limit the block link network herein
The specific network architecture of network.
Optionally, the first memory node 31 is connect with transaction node 1 and transaction node 2 respectively, when transaction node 1 and transaction
When node 2 generates Transaction Information, Transaction Information that transaction node 1 and transaction node 2 can be generated be transmitted directly to this first
Memory node 31.Optionally, the local of transaction node 1 and transaction node 2 is stored with memory node resource pool, the memory node
Resource pool includes the identification information of at least one memory node, when transaction node 1 and the generation Transaction Information of transaction node 2,
One or more optimal memory nodes are selected from the memory node resource pool being respectively locally stored, it is assumed that 1 He of transaction node
The optimal memory node that transaction node 2 selects is the first memory node 31, then transaction node 1 and transaction node 2 will be respective
The Transaction Information of generation is sent to the first memory node 31.
In the present embodiment, since the Transaction Information of 2 each self-generating of transaction node 1 and transaction node does not charge to block also,
Therefore the Transaction Information that the transaction node 1 and transaction node 2 that the first memory node 31 receives respectively are sent is not charge to block
Transaction Information the Transaction Information of transaction node 1 and transaction node 2 that the first memory node 31 receives is denoted as herein
One Transaction Information.As shown in figure 3, the first memory node 31, the second memory node 32, third memory node the 33, the 4th storage section
Point 34 is established between each other communication connection, optionally, the first memory node 31, the second memory node 32, third memory node
33, the Transaction Information for not charging to block being locally stored can be sent to by any one memory node in the 4th memory node 34
Other memory nodes, for example, the first memory node 31 is by the Transaction Information of received transaction node 1 and transaction node 2
It is sent respectively to the second memory node 32, third memory node 33, the 4th memory node 34.
Optionally, the first memory node 31 can also receive the transaction node other than transaction node 1 and transaction node 2
The Transaction Information of generation.
What step 202, other described memory nodes of memory node reception were sent is stored in other described memory nodes
In and do not charge to the second Transaction Information of block.
Similarly in the first memory node 31, the second memory node 32, third memory node 33, the 4th memory node 34 also may be used
It can receive the Transaction Information that other transaction nodes are sent in the block chain network, further, the second memory node 32, third
The Transaction Information for not charging to block that memory node 33, the 4th memory node 34 can also be stored is sent to the first storage section
Point 31.Herein, the friendship for not charging to block the second memory node 32, third memory node 33, the 4th memory node 34 stored
Easy information is denoted as the second Transaction Information.
According to first Transaction Information and second Transaction Information, determination is not charged to for step 203, the memory node
The third Transaction Information of block.
For example, the first memory node 31 has sent M Transaction Information to the second memory node 32, which is
The Transaction Information not having in second memory node 32；Second memory node 32 has sent N items transaction letter to the first memory node 31
Breath, which is the Transaction Information not having in the first memory node 31, in this way, the first memory node 31 can be stored with M
+ N Transaction Informations, the second memory node 32 can also be stored with M+N Transaction Information；Further, the first memory node 31 is gone back
Third memory node 33 can be received, the Transaction Information that the 4th memory node 34 is sent, the first memory node 31 can be according to original
Come the M articles of Transaction Information stored, the friendship received from the second memory node 32, third memory node 33, the 4th memory node 34
Easy information generates new Transaction Information, which is denoted as third Transaction Information by the present embodiment.Further, first
Memory node 31 judges whether the third Transaction Information is the whole Transaction Informations for not charging to block in the block chain network.
If step 204, the third Transaction Information are the All Activity information for not charging to block in the block chain network,
Then the third Transaction Information is sent to and digs mine node by the memory node.
If the first memory node 31 determines that the third Transaction Information is the whole for not charging to block in the block chain network
Transaction Information, then the first memory node 31 the third Transaction Information is encrypted using the private key of oneself, and will be encrypted
Third Transaction Information is sent to the digging mine node in the block chain network.Optionally, the first memory node 31 can be by the encryption
Third Transaction Information afterwards is sent to multiple digging mine nodes.In addition, the same digging mine node can also connect from multiple memory nodes
Transaction Information is received, for example, the digging mine node can be from the first memory node 31, the second memory node 32, third memory node 33, the
Four memory nodes 34 receive Transaction Information respectively, when the digging mine node receive the first memory node 31, the second memory node 32,
After the Transaction Information that third memory node 33, the 4th memory node 34 are sent respectively, compare the storage of the first memory node 31, second
The Transaction Information that node 32, third memory node 33, the 4th memory node 34 are sent respectively selects most complete transaction letter
Breath, and digging mine is carried out with the most complete Transaction Information and is calculated, to generate the book keeping operation power that new block grabs new block.For example, should
Digging mine node can also increase in new block for rewarding the first memory node 31, the second memory node 32, third storage section
The Transaction Information of the 33, the 4th memory node 34 of point, which can be specifically bit coin or the form of other values of money.It can
Choosing, which can store according to the first memory node 31, the second memory node 32, third memory node the 33, the 4th
The validity or integrality for the Transaction Information that node 34 provides are given the first memory node 31, the second memory node 32, third and are deposited
The different amount of money award of node 33, the 4th memory node 34 is stored up, to promote different memory nodes to can further improve oneself
Service ability.The digging mine node is stored to the first memory node 31, the second memory node 32, third memory node the 33, the 4th
The ratio of the amount of money award of node 34 can determine by the digging mine node oneself, can also be according to the service etc. of block memory node
Grade is negotiated to obtain by the digging mine node and block service node.In addition, the digging mine node is deposited to the first memory node 31, second
Store up node 32, third memory node 33, the 4th memory node 34 the ratio of amount of money award can also be identical.In addition, first deposits
Storage node 31, the second memory node 32, third memory node 33, the 4th memory node 34 can also be given according to the digging mine node
Amount of money award, determine subsequently whether continues give the digging mine node provide Transaction Information.
The embodiment of the present invention is sent the first Transaction Information for not charging to block being locally stored by the first memory node
To other memory nodes in the block chain network, being stored in other memory nodes for other memory nodes transmission is received
And the second Transaction Information of block is not charged to, if according to first Transaction Information and second Transaction Information, area is not charged in determination
The third Transaction Information of block is the All Activity information for not charging to block in the block chain network, then first memory node should
Third Transaction Information, which is sent to, digs mine node, so that the digging mine node generates block according to the third Transaction Information, to ensure
It is complete to charge to area's Transaction Information in the block.
Fig. 4 is the exchange information processing method flow chart that another embodiment of the present invention provides.On the basis of above-described embodiment
On, exchange information processing method provided in this embodiment specifically comprises the following steps：
Step 401, the memory node are using first key to the first Transaction Information for not charging to block that is locally stored
It is encrypted to obtain encrypted first Transaction Information.
As shown in figure 3, for example, the first memory node 31 has received the transaction letter that transaction node 1 and transaction node 2 are sent
Breath, the first memory node 31 Transaction Information of the transaction node 1 received and transaction node 2 can be encrypted, specifically,
The Transaction Information of the transaction node 1 and transaction node 2 that receive is encrypted using first key, it is encrypted to obtain
First Transaction Information.
Encrypted first Transaction Information is sent in the block chain network by step 402, the memory node
Other memory nodes.
Encrypted first Transaction Information is further sent to the second memory node 32 by the first memory node 31, third is deposited
Store up node 33, the 4th memory node 34.
What step 403, other described memory nodes of memory node reception were sent is stored in other described memory nodes
In and do not charge to encrypted second Transaction Information of block.
Wherein, encrypted second Transaction Information is stored in using the second key pair by other described memory nodes
Do not charge in other described memory nodes and block the second Transaction Information be encrypted after obtain.
Specifically, not charging to area when being stored in the second memory node 32, third memory node 33, the 4th memory node 34
When the second Transaction Information of block, the second memory node 32, third memory node 33, the 4th memory node 34 are respectively to second friendship
Easy information is encrypted, and is encrypted for example, the second key pair second Transaction Information may be used in the second memory node 32
To encrypted second Transaction Information；Similarly, second key pair can also be used in third memory node 33, the 4th memory node 34
Second Transaction Information is encrypted to obtain encrypted second Transaction Information.
The first key is sent to other described memory nodes by step 404, the memory node.
In the present embodiment, when the Transaction Information of transaction node 1 and transaction node 2 is encrypted in the first memory node 31
The first key of use can not be the private key of the first memory node 31, equally, the second memory node 32 encryption the second transaction letter
The second key that breath uses may not be the private key of the second memory node 32, and reason is：The public key of first memory node 31
Public key with the second memory node 32 is disclosed in the block chain network, is saved in addition to the first memory node 31 and second stores
Encrypted first Transaction Information is decrypted in the public key that the first memory node 31 may be used in node except point 32,
Encrypted second Transaction Information is decrypted in the public key that the second memory node 32 may be used, so that depositing in addition to first
Node except storage node 31 and the second memory node 32 can get the first memory node 31 and the second memory node 32
The Transaction Information of ground storage, it is no longer the to lead to the Transaction Information that the first memory node 31 and the second memory node 32 are locally stored
One memory node 31 and the second memory node 32 are exclusive.
In the present embodiment, first key can be sent to the second memory node 32 by the first memory node 31, so as to
Two memory nodes 32 decrypt encrypted first Transaction Information.
Step 405, the memory node receive second key that other described memory nodes are sent.
In addition, the first memory node 31 can also receive the second key of the second memory node 32 transmission, so as to first
Memory node 31 decrypts encrypted second Transaction Information.
According to first Transaction Information and second Transaction Information, determination is not charged to for step 406, the memory node
The third Transaction Information of block.
For example, the first memory node 31 can be saved according to the first Transaction Information being locally stored originally, and from the second storage
The second Transaction Information that point 32, third memory node 33, the 4th memory node 34 receive, determines the third for not charging to block
Transaction Information.
Step 407, the memory node according to the number of other memory nodes and first Transaction Information and
The consistency of second Transaction Information determines whether the third Transaction Information is not charge to block in the block chain network
All Activity information.
First memory node 31 is according to the interaction times for interacting Transaction Information or other memory nodes interacted
Number, determine interact the interaction times of Transaction Information or the number of other memory nodes that interacts whether be more than it is pre-
If value, if the number for other memory nodes for interacting the interaction times of Transaction Information or interacting is more than preset value,
First memory node 31, which further determines that, whether there is a target storage node in other memory nodes interacted so that
The Transaction Information and first memory node 31 that first memory node 31 is received from the target storage node are local stored
Under Transaction Information it is consistent, if unanimously, illustrating that the third Transaction Information is not charge to block in the block chain network
All Activity information, i.e. the third Transaction Information are the complete Transaction Informations for not charging to block.
If step 408, the third Transaction Information are the All Activity information for not charging to block in the block chain network,
Then the third Transaction Information is sent to and digs mine node by the memory node.
The realization method and concrete principle of step 408 are consistent with the realization method and concrete principle of above-mentioned steps 204, this
Place repeats no more.
The embodiment of the present invention is by the first memory node using first key to do not charge to block first that is locally stored
Transaction Information is encrypted to obtain encrypted first Transaction Information, so that other memory nodes are stored in using the second key pair
Do not charge in other memory nodes and block the second Transaction Information be encrypted after obtain the second Transaction Information, improve not
With the safety of the Transaction Information of interaction between memory node.
Fig. 5 is the structural schematic diagram of memory node provided in an embodiment of the present invention.Storage section provided in an embodiment of the present invention
Point can execute the process flow of exchange information processing method embodiment offer, as shown in figure 5, memory node 50 includes：It sends
Module 51, receiving module 52 and determining module 53；Wherein, do not charge to block first that sending module 51 is used to be locally stored
Transaction Information is sent to other memory nodes in the block chain network；Receiving module 52 is for receiving other described storage sections
What point was sent is stored in other described memory nodes and does not charge to the second Transaction Information of block；Determining module 53 is used for basis
First Transaction Information and second Transaction Information determine the third Transaction Information for not charging to block；Sending module 51 is also
For：When the third Transaction Information is not charge to the All Activity information of block in the block chain network, by described
Three Transaction Informations, which are sent to, digs mine node.
Optionally, determining module 53 is specifically used for：According to the number of other memory nodes and first transaction
The consistency of information and second Transaction Information determines whether the third Transaction Information is not remember in the block chain network
Enter the All Activity information of block.
Optionally, memory node 50 further includes：Encrypting module 54；Encrypting module 54 is used to deposit to local using first key
The first Transaction Information for not charging to block of storage is encrypted to obtain encrypted first Transaction Information；Sending module 51 is specifically used
In：Other memory nodes encrypted first Transaction Information being sent in the block chain network.
Optionally, receiving module 52 is specifically used for：Described other that are stored in that other described memory nodes are sent are received to deposit
Encrypted second Transaction Information of block is not charged in storage node and；Wherein, encrypted second Transaction Information be by
Other described memory nodes are stored in other described memory nodes using the second key pair and are not charged to the second transaction of block
What information obtained after being encrypted.
Optionally, sending module 51 is additionally operable to：The first key is sent to other described memory nodes；Receiving module
52 are additionally operable to：Receive second key that other described memory nodes are sent.
The memory node of embodiment illustrated in fig. 5 can be used for executing the technical solution of above method embodiment, realization principle
Similar with technique effect, details are not described herein again.
Fig. 6 is the structural schematic diagram for the memory node that another embodiment of the present invention provides.It is provided in an embodiment of the present invention to deposit
Storage node can execute the process flow of exchange information processing method embodiment offer, as shown in fig. 6, memory node 60 includes depositing
Reservoir 61, processor 62, computer program and communication interface 63；Wherein, computer program is stored in memory 61, and by with
It is set to the exchange information processing method executed by processor 62 described in above-described embodiment.
The memory node of embodiment illustrated in fig. 6 can be used for executing the technical solution of above method embodiment, realization principle
Similar with technique effect, details are not described herein again.
In addition, the present embodiment also provides a kind of computer readable storage medium, it is stored thereon with computer program, the meter
Calculation machine program is executed by processor to realize the exchange information processing method described in above-described embodiment.
In several embodiments provided by the present invention, it should be understood that disclosed device and method can pass through it
Its mode is realized.For example, the apparatus embodiments described above are merely exemplary, for example, the division of the unit, only
Only a kind of division of logic function, formula that in actual implementation, there may be another division manner, such as multiple units or component can be tied
Another system is closed or is desirably integrated into, or some features can be ignored or not executed.Another point, it is shown or discussed
Mutual coupling, direct-coupling or communication connection can be the INDIRECT COUPLING or logical by some interfaces, device or unit
Letter connection can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, you can be located at a place, or may be distributed over multiple
In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it can also
It is that each unit physically exists alone, it can also be during two or more units be integrated in one unit.Above-mentioned integrated list
The form that hardware had both may be used in member is realized, can also be realized in the form of hardware adds SFU software functional unit.
The above-mentioned integrated unit being realized in the form of SFU software functional unit can be stored in one and computer-readable deposit
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions are used so that a computer
It is each that equipment (can be personal computer, server or the network equipment etc.) or processor (processor) execute the present invention
The part steps of embodiment the method.And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (Read-
Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disc or CD etc. it is various
The medium of program code can be stored.
Those skilled in the art can be understood that, for convenience and simplicity of description, only with above-mentioned each function module
Division progress for example, in practical application, can be complete by different function modules by above-mentioned function distribution as needed
At the internal structure of device being divided into different function modules, to complete all or part of the functions described above.On
The specific work process for stating the device of description, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
Finally it should be noted that：The above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；To the greatest extent
Present invention has been described in detail with reference to the aforementioned embodiments for pipe, it will be understood by those of ordinary skill in the art that：Its according to
So can with technical scheme described in the above embodiments is modified, either to which part or all technical features into
Row equivalent replacement；And these modifications or replacements, various embodiments of the present invention technology that it does not separate the essence of the corresponding technical solution
The range of scheme.
Claims (12)
1. a kind of exchange information processing method, which is characterized in that including：
The first Transaction Information for not charging to block being locally stored is sent to other in the block chain network by memory node
Memory node；
The memory node receives being stored in other described memory nodes and not charging to area for other memory nodes transmission
Second Transaction Information of block；
The memory node determines that the third for not charging to block is handed over according to first Transaction Information and second Transaction Information
Easy information；
If the third Transaction Information is the All Activity information for not charging to block in the block chain network, the storage section
The third Transaction Information is sent to and digs mine node by point.
2. according to the method described in claim 1, it is characterized in that, the memory node is according to first Transaction Information and institute
The second Transaction Information is stated, determination is not charged to after the third Transaction Information of block, further includes：
The memory node is according to the number of other memory nodes and first Transaction Information and second transaction
The consistency of information determines whether the third Transaction Information is the All Activity letter for not charging to block in the block chain network
Breath.
3. method according to claim 1 or 2, which is characterized in that the memory node does not charge to area by what is be locally stored
First Transaction Information of block is sent to before other memory nodes in the block chain network, further includes：
The memory node is encrypted to obtain using first key to the first Transaction Information for not charging to block being locally stored
Encrypted first Transaction Information；
The first Transaction Information for not charging to block being locally stored is sent in the block chain network by the memory node
Other memory nodes, including：
The memory node saves other storages that encrypted first Transaction Information is sent in the block chain network
Point.
4. according to the method described in claim 3, it is characterized in that, the memory node receives other memory nodes transmission
The second Transaction Information being stored in other described memory nodes and do not charge to block, including：
The memory node receives being stored in other described memory nodes and not charging to area for other memory nodes transmission
Encrypted second Transaction Information of block；
Wherein, encrypted second Transaction Information be stored in using the second key pair by other described memory nodes it is described
Do not charge in other memory nodes and block the second Transaction Information be encrypted after obtain.
5. according to the method described in claim 4, it is characterized in that, the method further includes：
The first key is sent to other described memory nodes by the memory node；
The memory node receives second key that other described memory nodes are sent.
6. a kind of memory node, which is characterized in that including：
Sending module, the first Transaction Information for not charging to block for that will be locally stored are sent in the block chain network
Other memory nodes；
Receiving module does not charge to for being stored in other described memory nodes of receiving that other described memory nodes send and area
Second Transaction Information of block；
Determining module, for according to first Transaction Information and second Transaction Information, determining the third for not charging to block
Transaction Information；
The sending module is additionally operable to：When the third Transaction Information is all friendships for not charging to block in the block chain network
When easy information, the third Transaction Information is sent to and digs mine node.
7. memory node according to claim 6, which is characterized in that the determining module is specifically used for：According to it is described its
The consistency of the number of his memory node and first Transaction Information and second Transaction Information, determines the third
Whether Transaction Information is the All Activity information for not charging to block in the block chain network.
8. the memory node described according to claim 6 or 7, which is characterized in that further include：
Encrypting module, for being encrypted to obtain to the first Transaction Information for not charging to block being locally stored using first key
Encrypted first Transaction Information；
The sending module is specifically used for：
Other memory nodes encrypted first Transaction Information being sent in the block chain network.
9. memory node according to claim 8, which is characterized in that the receiving module is specifically used for：
Receive being stored in other described memory nodes and not charging to the encrypted of block for other memory nodes transmission
Second Transaction Information；
Wherein, encrypted second Transaction Information be stored in using the second key pair by other described memory nodes it is described
Do not charge in other memory nodes and block the second Transaction Information be encrypted after obtain.
10. memory node according to claim 9, which is characterized in that the sending module is additionally operable to：It is close by described first
Key is sent to other described memory nodes；
The receiving module is additionally operable to：Receive second key that other described memory nodes are sent.
11. a kind of memory node, which is characterized in that including：
Memory；
Processor；And
Computer program；
Wherein, the computer program is stored in the memory, and is configured as being executed to realize such as by the processor
Claim 1-5 any one of them methods.
12. a kind of computer readable storage medium, which is characterized in that be stored thereon with computer program, the computer program
It is executed by processor to realize method as described in any one in claim 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810449027.7A CN108765150A (en) | 2018-05-11 | 2018-05-11 | Exchange information processing method and memory node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810449027.7A CN108765150A (en) | 2018-05-11 | 2018-05-11 | Exchange information processing method and memory node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108765150A true CN108765150A (en) | 2018-11-06 |
Family
ID=64010176
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810449027.7A Pending CN108765150A (en) | 2018-05-11 | 2018-05-11 | Exchange information processing method and memory node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108765150A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111598558A (en) * | 2020-05-13 | 2020-08-28 | 中国联合网络通信集团有限公司 | Accounting method, accounting node server and payer node server |
| CN114666043A (en) * | 2022-03-04 | 2022-06-24 | 广东钜联信息科技有限公司 | Method for generating bookkeeper by block chain difference probability consensus algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170132626A1 (en) * | 2015-11-05 | 2017-05-11 | Mastercard International Incorporated | Method and system for processing of a blockchain transaction in a transaction processing network |
| CN106789908A (en) * | 2016-11-23 | 2017-05-31 | 江苏通付盾科技有限公司 | Block common recognition method for building up and system in block chain |
| CN107122673A (en) * | 2017-03-09 | 2017-09-01 | 深圳市金立通信设备有限公司 | A kind of information ciphering method and terminal |
| CN107197036A (en) * | 2017-06-22 | 2017-09-22 | 广东网金控股股份有限公司 | A kind of consistent processing method of information based on block chain and terminal |
| CN107392611A (en) * | 2017-03-24 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of method and device for sending Transaction Information and common recognition checking |
-
2018
- 2018-05-11 CN CN201810449027.7A patent/CN108765150A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170132626A1 (en) * | 2015-11-05 | 2017-05-11 | Mastercard International Incorporated | Method and system for processing of a blockchain transaction in a transaction processing network |
| CN106789908A (en) * | 2016-11-23 | 2017-05-31 | 江苏通付盾科技有限公司 | Block common recognition method for building up and system in block chain |
| CN107122673A (en) * | 2017-03-09 | 2017-09-01 | 深圳市金立通信设备有限公司 | A kind of information ciphering method and terminal |
| CN107392611A (en) * | 2017-03-24 | 2017-11-24 | 阿里巴巴集团控股有限公司 | A kind of method and device for sending Transaction Information and common recognition checking |
| CN107197036A (en) * | 2017-06-22 | 2017-09-22 | 广东网金控股股份有限公司 | A kind of consistent processing method of information based on block chain and terminal |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111598558A (en) * | 2020-05-13 | 2020-08-28 | 中国联合网络通信集团有限公司 | Accounting method, accounting node server and payer node server |
| CN111598558B (en) * | 2020-05-13 | 2023-08-22 | 中国联合网络通信集团有限公司 | Billing method, billing node server and payer node server |
| CN114666043A (en) * | 2022-03-04 | 2022-06-24 | 广东钜联信息科技有限公司 | Method for generating bookkeeper by block chain difference probability consensus algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108810119A (en) | block chain processing method, device and block chain node | |
| CN101222325B (en) | Wireless multi-hop network key management method based on ID | |
| CN108989048A (en) | Cryptographic key distribution method, device, equipment and storage medium | |
| CN109067724A (en) | Block chain data trade method, apparatus, equipment and storage medium | |
| CN104581652B (en) | Message treatment method, the method and apparatus for selecting MME | |
| CN109087100A (en) | Cryptographic key distribution method, device, equipment and storage medium | |
| CN108769142A (en) | Exchange information processing method and block generate node | |
| CN107480990A (en) | Block chain bookkeeping methods and device | |
| CN108566275A (en) | Identity identifying method, device and block chain node | |
| CN108712506A (en) | block chain node communication method, device and block chain node | |
| CN108900528A (en) | Block chain real name identification method, device, equipment and storage medium | |
| CN108881296A (en) | Block chain real name identification method, device, equipment and storage medium | |
| CN109118360A (en) | Block chain account checking method, device, equipment and storage medium | |
| CN108616532A (en) | Ballot processing method, apparatus and terminal device | |
| CN108366369A (en) | A kind of method and access net, terminal, equipment of the core network of data security transmission | |
| CN108683727A (en) | Block processes method and host node | |
| CN109640274A (en) | Note transmission method, device and computer readable storage medium based on block chain | |
| CN108632307A (en) | A kind of session connection method for building up and SMF | |
| CN109246696A (en) | Cipher key processing method and relevant apparatus | |
| CN108765150A (en) | Exchange information processing method and memory node | |
| CN108810120A (en) | block chain node communication method, device and block chain node | |
| CN109673010A (en) | The number of taking based on block chain turns network method and device, storage medium | |
| CN109087096A (en) | Block chain account checking method, device, equipment and storage medium | |
| CN109639715A (en) | Method, apparatus, equipment and the computer readable storage medium for avoiding honeysuckle from attacking | |
| CN108876611A (en) | Exchange information processing method, device and block chain node |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181106 |