CN110011974A - Bookkeeping methods, device, terminal and the computer readable storage medium of block chain - Google Patents
Bookkeeping methods, device, terminal and the computer readable storage medium of block chain Download PDFInfo
- Publication number
- CN110011974A CN110011974A CN201910171582.2A CN201910171582A CN110011974A CN 110011974 A CN110011974 A CN 110011974A CN 201910171582 A CN201910171582 A CN 201910171582A CN 110011974 A CN110011974 A CN 110011974A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- random number
- casting
- timeslice
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to block chain technical field more particularly to a kind of bookkeeping methods, device, terminal and the computer readable storage mediums of block chain.Wherein, bookkeeping methods includes: that local node generates random number, and broadcasts other nodes into block chain network；Local node receives the random number information of other node broadcasts, it caches and continues to broadcast this random number, then the random number generated to the random number and local node received is ranked up, obtain initial random number sorted lists, then, local node broadcasts the initial random number sorted lists to other described nodes, to obtain the random number sorted lists known together through the whole network；The local node determines that its affiliated block in current time period casts timeslice according to the random number sorted lists through the whole network common recognition, and carries out block casting when reaching block casting timeslice；It efficiently avoids calculating the waste of power, and is not in calculate the problems in power collection, improve the stability of block chain network.
Description
Technical field
The invention belongs to block chain technical field more particularly to a kind of bookkeeping methods, device, terminal and the calculating of block chain
Machine readable storage medium storing program for executing.
Background technique
Block chain is a kind of a kind of chain type number for being sequentially in time combined into data block in such a way that sequence is connected
According to structure, and the distributed account book that can not be distorted He can not forge guaranteed in a manner of cryptography.One core skill of block chain
Art is common recognition mechanism, that is, the method for a record validity of reaching common understanding between all nodes, assert.
Currently, typical block chain common recognition mechanism mainly include proof of work (Proof of Power, PoW) algorithm and
Equity proves (Proof of Stake, PoS) algorithm.However, in PoW algorithm, since the whole network miner (node) puts into calculation
Power calculation block, and finally only have the block of a miner that can become the whole network and know together, it be easy to cause a large amount of power of calculating to be wasted.For
PoS algorithm, although there is no the wastes for calculating power, since it carries out the competing of casting person in a manner of pledging digital cash
Choosing causes network there may be and calculates power concentration so that the probability for possessing the more node of quantity of money as casting person is larger
The problem of, reduce the stability of block chain network.
Summary of the invention
In view of this, the embodiment of the present invention provides the bookkeeping methods of block chain a kind of, device, terminal and computer-readable deposits
Storage media, the common recognition mechanism that can solve block chain in the prior art there is technical issues that calculate power waste and calculates power.
First aspect of the embodiment of the present invention provides a kind of bookkeeping methods of block chain, comprising:
Local node generates random number, and the node identification information that will carry the random number and the local node
Random number information broadcast other nodes into block chain network；Meanwhile the local node receives other node broadcasts
Random number information, and the random number information received is broadcasted again, so that each node in block chain network
The random number information of all nodes in block chain network can be received；
The local node in the random number information received random number and the local node generate it is random
Number is ranked up, and obtains the initial random number sorted lists for carrying node identification information, and then, the local node will be described
Initial random number sorted lists are broadcasted to other described nodes, to obtain the random number sorted lists known together through the whole network；
The local node determines it in current time period according to the random number sorted lists through the whole network common recognition
Affiliated block casts timeslice, and carries out block casting when reaching block casting timeslice.
Second aspect of the embodiment of the present invention provides a kind of billing device of block chain, comprising:
Random number generation module generates random number for local node, and will carry the random number and described
The random number information of the node identification information of ground node broadcasts other nodes into block chain network；Meanwhile the local section
Point receives the random number information of other node broadcasts, and the random number information received is broadcasted again, so that area
Each node in block chain network can receive the random number information of all nodes in block chain network；
Random number sorted lists generation module, for the local node to the random number in the random number information received
And the random number that the local node generates is ranked up, and obtains the initial random number Sorted list for carrying node identification information
Table, then, the local node broadcast the initial random number sorted lists to other described nodes, total through the whole network to obtain
The random number sorted lists of knowledge；
Block casts module, determines it according to the random number sorted lists through the whole network common recognition for the local node
Block belonging in current time period casts timeslice, and carries out block casting when reaching block casting timeslice.
The third aspect of the embodiment of the present invention provides a kind of terminal, including memory, processor and is stored in the storage
In device and the computer program that can run on the processor, the processor are realized above-mentioned when executing the computer program
The step of first aspect the method.
Fourth aspect of the embodiment of the present invention provides a kind of computer readable storage medium, the computer readable storage medium
It is stored with computer program, the computer program realizes above-mentioned first aspect the method when being executed by processor the step of.
In the embodiment of the present invention, block casting is carried out before carrying out block casting by each node in block chain network
The distribution of timeslice is made, so that each node, which only needs to cast in corresponding block, carries out block casting in timeslice, without
All the time block casting is all carried out, that is, in a block casting timeslice, do not need the whole network node all investment new districts
The calculating of block efficiently avoids the waste for calculating power；Simultaneously as being by block chain network in the embodiment of the present application
Each node generates random number, and the mode for obtaining the random number sorted lists known together through the whole network determines each node when current
Between in the period belonging to block cast timeslice, therefore, the selection that block casts timeslice has biggish randomness, and every
A node has the opportunity to carry out block casting, is not in calculate the problems in power collection, improves the stability of block chain network.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to needed in the embodiment attached
Figure is briefly described, it should be understood that the following drawings illustrates only certain embodiments of the present invention, therefore is not construed as pair
The restriction of range for those of ordinary skill in the art without creative efforts, can also be according to this
A little attached drawings obtain other relevant attached drawings.
Fig. 1 is a kind of first implementation flow schematic diagram of the bookkeeping methods of block chain provided in an embodiment of the present invention；
Fig. 2 is that a kind of specific implementation flow of the step 103 of the bookkeeping methods of block chain provided in an embodiment of the present invention is shown
It is intended to；
Fig. 3 is a kind of the second implementation process schematic diagram of the method for the book keeping operation of block chain provided in an embodiment of the present invention；
Fig. 4 is a kind of structural schematic diagram of the billing device of block chain provided in an embodiment of the present invention；
Fig. 5 is a kind of structural schematic diagram of terminal provided in an embodiment of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.It will be clear to one skilled in the art that in the other embodiments without these details
The present invention may be implemented.In other situations, the detailed description to well-known system, apparatus, circuit and method is omitted,
In order to avoid unnecessary details interferes description of the invention.
In order to illustrate technical solutions according to the invention, the following is a description of specific embodiments.
Block chain application common at present has bit coin project and ether mill project.The common recognition mechanism that the two projects use
Including PoW common recognition algorithm and PoS algorithm.However, PoW algorithm and PoS algorithm have the shortcomings that its is intrinsic.For example, being calculated for PoW
Method calculates power calculation block since the whole network miner puts into, and finally only has the block of a miner that can become the whole network and know together, and is easy
It causes largely to calculate power and be wasted；For PoS algorithm, although pledging digital goods due to it there is no the waste for calculating power
The mode of coin carries out the election contest of casting person, so that the probability for possessing the more node of quantity of money as casting person is larger, causes
Network, which there may be, calculates the problems in power collection, reduces the stability of block chain network.
In the embodiment of the present invention, block casting is carried out before carrying out block casting by each node in block chain network
The distribution of timeslice is made, so that each node, which only needs to cast in corresponding block, carries out block casting in timeslice, without
All the time block casting is all carried out, that is, in a block casting timeslice, do not need the whole network node all investment new districts
The calculating of block efficiently avoids the waste for calculating power；Simultaneously as being by block chain network in the embodiment of the present application
Each node generates random number, and the mode for obtaining the random number sorted lists known together through the whole network determines each node when current
Between in the period belonging to block cast timeslice, therefore, the selection that block casts timeslice has biggish randomness, and every
A node has the opportunity to carry out block casting, is not in calculate the problems in power collection, improves the stability of block chain network.
Fig. 1 shows the first implementation flow schematic diagram of the bookkeeping methods of block chain provided in an embodiment of the present invention.The party
Method is applied to terminal (node of block chain), can be executed by the billing device of the block chain configured in terminal, the block chain
Billing device can be realized by way of hardware and/or software.The bookkeeping methods may include step 101 to step 103.
Step 101, local node generates random number, and the node that will carry the random number and the local node
The random number information of identification information broadcasts other nodes into block chain network；Meanwhile the local node receives other sections
The random number information of point broadcast, and the random number information received is broadcasted again, so that in block chain network
Each node can receive the random number information of all nodes in block chain network.
It should be noted that all carrying out area by identical rule since each node status in block chain network is identical
Block casting is made.Therefore, in the embodiment of the present application, the workflow of local node is considered as the workflow of entire block chain network
Journey, likewise, the workflow of entire block chain network is similarly considered as the workflow needed to be implemented for local node.
For example, local node executes during generating random number, other nodes in block chain network in addition to local node are also same
Sample is executing the process for generating random number.
Wherein, other nodes can be the intelligent terminals such as computer, server in local node and block chain network.
The random number that local node generates can be the random number of fixed byte length.For example, the length of 4 bytes with
Machine number.
The node identification information can be MAC Address, title or the sequence number of node, be used for unique identification block link network
Node in network.
Step 102, the local node is to the random number and local node life in the random number information received
At random number be ranked up, obtain the initial random number sorted lists for carrying node identification information, then, the local section
Point broadcasts the initial random number sorted lists to other described nodes, to obtain the random number Sorted list known together through the whole network
Table.
In embodiments of the present invention, block chain be it is a kind of sequentially in time by data block in such a way that sequence is connected group
A kind of linked data structure of synthesis, and the distributed account book that can not be distorted He can not forge guaranteed in a manner of cryptography.Area
Each node in block chain kept accounts (that is, block casting) when, need to carry out the acquisition of book keeping operation power.
In embodiments of the present invention, each node first generates random number when carrying out the acquisition of book keeping operation power, and will carry
The random number information of the node identification information of the random number and node broadcasts other nodes into block chain network, together
When, the local node receives the random number information of other node broadcasts, and the random number information received is carried out again
Secondary broadcast, so that each node in block chain network can receive the random number letter of all nodes in block chain network
Breath so that each node in block chain network can according to the random number that node each in block chain network generates into
The sequence of row random number, obtains the initial random number sorted lists for carrying node identification information.Then, every in block chain network
The initial random number sorted lists are broadcasted other nodes into block chain network again by a node, to obtain knowing together through the whole network
Random number sorted lists.Wherein, which can be to carry out each random number in the way of from big to small
Sort obtained random number sorted lists, or by each random number be ranked up in the way of from small to large with
Machine number sorted lists.
Specifically, the initial random number sorted lists are broadcasted other nodes into block chain network by local node,
It can be with the step of obtaining the random number sorted lists known together through the whole network are as follows: local node is by the initial random number sorted lists
Other nodes into block chain network are broadcasted, then, local node receives the initial random number Sorted list of other node broadcasts
Table, and the initial random number sorted lists received are compared with the initial random number sorted lists itself generated, if than
To success, then the initial random number sorted lists received are broadcasted again, if comparison is unsuccessful, will be received down
One initial random number sorted lists is compared with the initial random number sorted lists itself generated, terminates until the common recognition time
When, using the initial random number sorted lists received as the random number sorted lists known together through the whole network.
In the embodiment of the present application, each node in block chain network passes through the initial random number sorted lists that will be received
With itself generate initial random number sorted lists be compared, and compare it is unsuccessful when, not to this receive it is initial
Random number sorted lists are broadcasted, and when comparing successfully, the initial random number sorted lists received are broadcasted again,
The initial random number sorted lists that node at the end of knowing together the time, in block chain network can be made to receive are through the whole network
The random number sorted lists of common recognition.
Step 103, the local node determines it when current according to the random number sorted lists through the whole network common recognition
Between in the period belonging to block cast timeslice, and carry out block casting when reaching block casting timeslice.
In the embodiment of the present invention, after the random number sorted lists for obtaining knowing together through the whole network, it can determine block chain
Each block chain node in network in current time period belonging to block cast timeslice.
For example, with one week for a time cycle, then after the random number sorted lists for obtaining knowing together through the whole network, so that it may
To be to belong to its own in the distribution of each node one week according to the collating sequence of the corresponding node of random number sorted lists
Block casts timeslice, for example, the block casting time of node A is the 8:00-8:10 on Monday, when the block of node B is cast
Between be Monday 8:10-8:20；And so on, it is carried out so that each node only needs to cast in timeslice in corresponding block
Block casting efficiently avoids calculating power waste without all carrying out block casting all the time；Simultaneously as the application
It is random number to be generated by each node in block chain network, and obtain the random number known together through the whole network sequence in embodiment
The mode of list determines each node block casting timeslice affiliated in current time period, and therefore, block casts the time
The selection of piece has biggish randomness, and each node has the opportunity to carry out block casting, is not in calculate power to concentrate
Problem effectively increases the stability of block chain network.
It should be noted that the above-mentioned time cycle can also be 1 day, 2 days, 3 days or 10 days, the present invention is to this without limit
System, for the convenience of description, being illustrated in the embodiment of the present application with (one week) 7 days for a time cycle.
Optionally, as shown in Fig. 2, in above-mentioned steps 103, the local node is according to the random number known together through the whole network
Sorted lists determine that the block in current time period casts timeslice, and carry out block when reaching block casting timeslice
Casting can also include: step 201 to step 203.
Step 201, the local node is according to the random number sorted lists through the whole network common recognition in block chain network
Node be grouped, and determine each be grouped in current time period block casting the period.
Step 202, the local node determines each in grouping according to the random number collating sequence of each node in being grouped
The block casting sequence of node.
Step 203, when the block for reaching grouping belonging to the local node casts the period, the local node exists
Periodic area is carried out according to the block casting sequence of each node in being grouped in the block casting period of grouping belonging to it
Waiting in turn for timeslice is made in block casting, and is waiting in turn carrying out block casting in successful block casting timeslice.
That is, the local node is determined according to the random number sorted lists through the whole network common recognition in current time
When block in period casts timeslice, first according to the random number sorted lists through the whole network common recognition in block chain network
All nodes are grouped, and determine the block casting period being each grouped in current time period, then, according to specific
Grouping situation determine grouping belonging to local node, and the block casting sequence in grouping reaches the local section
When the block of grouping belonging to point casts the period, root in the block casting period of grouping of the local node belonging to it
Waiting in turn for periodic block casting timeslice is carried out according to the block casting sequence of each node in being grouped, and is being waited in turn successfully
Block, which is cast, carries out block casting in timeslice.
Specifically, for example, it is assumed that block chain network includes this 15 nodes of node A- node O, week time of block casting
Phase is one week, and the block casting period of each grouping is one day, and the block casting timeslice of each node is 10 minutes, local
Node is node C, then when carrying out block casting, node A- node O can first generate random number respectively, and will carry respectively
The random number information of the node identification information of the random number and node broadcasts other nodes into block chain network；So
Afterwards, node A- node O receives the random number information of other node broadcasts respectively, and to random in the random number information received
The random number that the several and described local node generates is ranked up, and obtains the initial random number sequence for carrying node identification information
List；Then, node A- node O respectively broadcasts the initial random number sorted lists of each self-generating to other described sections
Point, to obtain the random number sorted lists known together through the whole network, for example, the random number sorted lists known together through the whole network are as follows: section
Point A, node D, node N, node K, node F, node H, node I, node M, node G, node L, node J, node O, node C,
Node B, node E.Then, according to it is described through the whole network common recognition random number sorted lists to all nodes in block chain network into
Row grouping, for example, being divided into following 7 groups:
First group are as follows: node A, node D；
Second group are as follows: node N, node K；
Third group are as follows: node F, node H；
4th group are as follows: node I, node M；
5th group are as follows: node G, node L；
6th group are as follows: node J, node O；
7th group are as follows: node C, node B, node E；
And the block casting period in each grouping current time period is some day in one week, for example, determining
The block casting period being each grouped in current time period are as follows: first group of Monday, second group of Tuesday, third group star
Phase three, the 4th group of Thursday, the 5th group of Friday, the 6th group of Saturday, the 7th group of Sunday.
Finally, each node determines the area for being grouped interior each node according to the random number collating sequence of each node in being grouped
Sequence is made in block casting；When the block for reaching grouping belonging to each node casts the period, grouping of each node belonging to it
The block casting period in periodic block carried out according to the block casting sequence of each node in being grouped cast timeslice
Wait in turn, and waiting in turn carrying out block casting in successful block casting timeslice.
For example, node C when reaching Tuesday, first carries out block casting in first block casting timeslice 8:00:8:10
It makes, then waits for block casting timeslice 8:10:8:20 of the node B belonging to it and carry out block casting, and node E is waited to exist
After block casting timeslice 8:20:8:30 belonging to it carries out block casting, block of the node C belonging to it casts timeslice
8:30:8:40 carries out block casting, and so on.It is carried out so that each node only needs to cast in timeslice in corresponding block
Block casting.
Optionally, in above-mentioned steps 203, root in the block casting period of grouping of the local node belonging to it
Periodic block casting timeslice is carried out according to the block casting sequence of each node in being grouped to wait in turn including: the local section
It is carried out periodically in the block casting period of grouping of the point belonging to it according to the block casting sequence of each node in being grouped
Block cast when waiting in turn of timeslice, if block casting timeslice history wait in turn in the period, before the local node
The number that one node is not successfully completed block casting is greater than preset times or the block of generation is not known together by the whole network, then exists
It is suitable to generate new block casting for the previous node for deleting the local node in being grouped in the block casting sequence of each node
Sequence, the local node carry out waiting in turn for periodic block casting timeslice according to new block casting sequence.
In the embodiment of the present application, due to being waited in turn in the period in the history of block casting timeslice, before the local node
The number that one node is not successfully completed block casting is greater than the block of preset times or generation not by table when the whole network common recognition
Show that the previous node of local node is likely to be irresponsible node either dishonest node, therefore, is occurring this
The number that the previous node of ground node is not successfully completed block casting is greater than preset times or the block of generation does not pass through entirely
When net common recognition, the previous node of the local node can be deleted in the block casting sequence of each node in being grouped, it is raw
The block casting sequence of Cheng Xin, and waiting in turn for periodic block casting timeslice is carried out according to new block casting sequence, with
The not responsible behavior of the previous node is punished, the efficiency that network carries out block casting is improved.
For example, the previous node of local node C is node E, then block casting is not successfully completed in node E or generated
Block not by the whole network know together when, local node C will wait node B block cast timeslice at the end of carry out block casting
Make, that is, the deletion of node E in being grouped, generate new block casting sequence be node C, node B.
Wherein, above-mentioned preset times can be set according to practical application scene, for example, the preset times can be set
It is set to 2 times, 3 times, 5 times or other numbers, the application is not limited this.
In practical applications, in the current time period of block casting, the whole network node casts timeslice in each block
When waiting for the period in turn and starting, while the distrust value list an of the whole network is safeguarded, whenever there is casting in defined block for node
Timeslice is not timely completed block casting, then the distrust value of this node adds 1.When the distrust value of some node is greater than in advance
If when threshold value, that is, when being not successfully completed the number of block casting greater than preset times, the whole network node will be in the grouping belonging to it
It deletes, it is made no longer to have an opportunity to participate in the casting block in current time period, the block until entering next time cycle
When casting, the trust value of each node restores to 0, re-starts waiting in turn for block casting timeslice, and reach block casting
Block casting is carried out when timeslice.
It optionally, in the respective embodiments described above, can also include: step as shown in figure 3, after above-mentioned steps 103
104 to step 105.
Step 104, each node weight in the block casting for entering next time cycle, in the block chain network
The newly-generated random number, and regenerate the random number sorted lists known together through the whole network；
Step 105, the random number sorted lists through the whole network common recognition that the local node is regenerated according to are again
It determines the block casting timeslice belonging to it, and carries out block casting when reaching block casting timeslice.
In the embodiment of the present application, every block casting for completing a time cycle, and enter next time cycle
When block is cast, require to regenerate the random number sorted lists known together through the whole network, that is, carry out block to each node again
The sequence of casting causes to occur calculating the problems in power collection to avoid because block casting sequence is fixed.
Optionally, described in the block casting for entering next time cycle in above-mentioned steps 104, the block chain
Each node in network regenerates the random number, and regenerates the random number sorted lists known together through the whole network, comprising:
In the block casting for entering next time cycle, will not be total to by the whole network in historical time cycle memory in the block of generation
The node of knowledge is removed name from the rolls, it is made to be not involved in the step of regenerating the random number sorted lists known together through the whole network.
The above-mentioned historical time period refers to the already existing time cycle in the past, for example, entering next time cycle
Block casting when, next time cycle pervious all time cycles are the historical time period.
Due to not being likely to be malice by the node that the whole network is known together in the block of generation in historical time cycle memory
Node is dishonest node, and therefore, in the block casting for entering next time cycle, needing will be in historical time
Cycle memory generation block not by the whole network know together node remove name from the rolls, make its be not involved in regenerate through the whole network common recognition with
The step of machine number sorted lists, improves the stability of network to reduce a possibility that network is attacked.
For example, a certain node is when generating block, it is square by the way that block data etc. is distorted or forged to block data
Formula changes block data, and the block of generation is broadcasted.At this point, other nodes in block chain network receive the node
After the block of generation, which is verified, in authentication failed, the information of authentication failed is broadcasted, so that receiving
The node of this information is proceeded as follows according to the verification result of itself: if itself also authentication failed, broadcast such information；Such as
The success of fruit own verification, then not broadcast such information.Finally, above-mentioned not sincere in the case where the whole network majority node is honest node
The block that real node generates will be unable to know together by the whole network, while be removed name from the rolls by the node in block chain network, it is not involved in
The step of regenerating the random number sorted lists known together through the whole network.
In each embodiment of foregoing description, local node carries out block casting when reaching block casting timeslice
The step of may include: local node when reaching block casting timeslice, all transaction for preparing to be packed into block are formed
Transaction List Table generates Merkel's tree root Hash (Merkle Root Hash) by Merkel tree (Merkle Tree) algorithm, and
Obtain input of the block head as proof of work；The constantly nonce value of change block head, and the block head after change is done double
Weight SHA256 operation, when calculated result is less than network current difficulty target value, success of solving a problem；At this point, with private key to area
Block number is according to being encrypted, and the block data after broadcast enciphering, to be verified by other nodes to the block data, and is testing
After demonstrate,proving successfully, account book is written.
In the embodiment of the present invention, when one new block data of every generation, the node for generating the block can also be carried out
Reward.
For example, node one the whole network block of every generation in block chain network, then obtain 80% casting block currency prize
It encourages, for example, the 80% of 5 ether coin.Other 20% reward enters bonus pool in group, that is, an ether coin is put into group
Bonus pool.After the block of grouping casts the period, generation block is averagely given in all rewards that will be organized in interior bonus pool
Average time shortest node and generate block the largest number of nodes, with motivate its faster more accurately casting block.
As Fig. 4 shows a kind of structural schematic diagram of the billing device of block chain provided in an embodiment of the present invention, the note
Account device 400 includes: random number generation module 401, random number sorted lists generation module 402 and block casting module 403.
The random number generation module 401, for local node generate random number, and will carry the random number and
The random number information of the node identification information of the local node broadcasts other nodes into block chain network；Meanwhile it is described
Local node receives the random number information of other node broadcasts, and the random number information received is broadcasted again,
So that each node in block chain network can receive the random number information of all nodes in block chain network；
The random number sorted lists generation module 402, for the local node in the random number information received
Random number and the local node generate random number be ranked up, obtain carrying the initial random of node identification information
Number sorted lists, then, the local node broadcasts the initial random number sorted lists to other described nodes, to obtain
The random number sorted lists known together through the whole network；
The block casts module 403, for the local node according to the random number Sorted list known together through the whole network
Table determines its block casting timeslice affiliated in current time period, and carries out block when reaching block casting timeslice
Casting.
Optionally, the block casts module 403 further include:
Grouped element, for the local node according to the random number sorted lists through the whole network common recognition to block link network
Node in network is grouped, and determines the block casting period being each grouped in current time period；
Order determination unit determines according to the random number collating sequence of each node in being grouped for the local node and divides
The block casting sequence of each node in group；
Block casting unit, it is described when for casting the period in the block for reaching grouping belonging to the local node
It is carried out in the block casting period of grouping of the local node belonging to it according to the block casting sequence of each node in being grouped
Periodic block casting timeslice is waited in turn, and is waiting in turn carrying out block casting in successful block casting timeslice.
The block casting unit is also used to: root in the block casting period of grouping of the local node belonging to it
Periodic when waiting in turn of timeslice of block casting is carried out according to the block casting sequence of each node in being grouped, if in a upper block
Casting timeslice was waited in turn in the period, the area that the previous node of the local node is not successfully completed block casting or generates
Block is not known together by the whole network, then deletes the previous section of the local node in the block casting sequence of each node in being grouped
Point, generates new block casting sequence, and the local node carries out periodic block casting according to new block casting sequence
Timeslice is waited in turn.
It should be noted that for convenience and simplicity of description, the specific work of the billing device 400 of the block chain of foregoing description
Make process, can the method referring to figs. 1 to Fig. 3 corresponding process, details are not described herein.
Fig. 5 is the structural schematic diagram of terminal provided in an embodiment of the present invention.The terminal can be the aforementioned local
Node and other nodes, the terminal 5 of the embodiment include: processor 50, memory 51 and are stored in the memory 51
And the computer program 52 that can be run on the processor 50, such as the spreadsheet of block chain.The processor 50 executes
The step in the bookkeeping methods embodiment of above-mentioned each block chain is realized when the computer program 52, for example, step shown in FIG. 1
Rapid 101 to the block chain described in step 103 billing step, alternatively, when the processor 50 executes the computer program 52
Realize the function of each module/unit in above-mentioned each Installation practice, such as the function of module 401 to 403 shown in Fig. 4.
Illustratively, the computer program 52 can be divided into one or more module/units, it is one or
Multiple module/units are stored in the memory 51, and are executed by the processor 50, to complete the present invention.Described one
A or multiple module/units can be the series of computation machine program instruction section that can complete specific function, which is used for
Implementation procedure of the computer program 52 in the terminal 5 is described.
The user terminal or the node device may include, but be not limited only to, processor 50, memory 51.This field
Technical staff is appreciated that Fig. 5 is only the example of terminal 5, the not restriction of structure paired terminal 5, may include than illustrating more
More or less component perhaps combines certain components or different components, such as the book keeping operation box of the block chain can also wrap
Include input-output equipment, network access equipment, bus etc..
Alleged processor 50 can be central processing unit (Central Processing Unit, CPU), can also be
Other general processors, digital signal processor (Digital Signal Processor, DSP), specific integrated circuit
(Application Specific Integrated Circuit, ASIC), field programmable gate array (Field-
Programmable Gate Array, FPGA) either other programmable logic device, discrete gate or transistor logic,
Discrete hardware components etc..General processor can be microprocessor or the processor is also possible to any conventional processor
Deng.
The memory 51 can be the internal storage unit of the terminal 5, such as the hard disk or memory of terminal 5.It is described
Memory 51 is also possible to the External memory equipment of the terminal 5, such as the plug-in type hard disk being equipped in the terminal 5, intelligence
Storage card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash Card)
Deng.Further, the memory 51 can also both include the internal storage unit of the terminal 5 or set including external storage
It is standby.The memory 51 is for storing other program sum numbers needed for the book keeping operation of the computer program and the block chain
According to.The memory 51 can be also used for temporarily storing the data that has exported or will export.
It is apparent to those skilled in the art that for convenience of description and succinctly, only with above-mentioned each function
Can unit, module division progress for example, in practical application, can according to need and by above-mentioned function distribution by different
Functional unit, module are completed, i.e., the internal structure of described device is divided into different functional unit or module, more than completing
The all or part of function of description.Each functional unit in embodiment, module can integrate in one processing unit, can also
To be that each unit physically exists alone, can also be integrated in one unit with two or more units, it is above-mentioned integrated
Unit both can take the form of hardware realization, can also realize in the form of software functional units.In addition, each function list
Member, the specific name of module are also only for convenience of distinguishing each other, the protection scope being not intended to limit this application.Above system
The specific work process of middle unit, module, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, is not described in detail or remembers in some embodiment
The part of load may refer to the associated description of other embodiments.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
The scope of the present invention.
In embodiment provided by the present invention, it should be understood that disclosed device/terminal device and method, it can be with
It realizes by another way.For example, device described above/terminal device embodiment is only schematical, for example, institute
The division of module or unit is stated, only a kind of logical function partition, there may be another division manner in actual implementation, such as
Multiple units or components can be combined or can be integrated into another system, or some features can be ignored or not executed.Separately
A bit, shown or discussed mutual coupling or direct-coupling or communication connection can be through some interfaces, device
Or the INDIRECT COUPLING or communication connection of unit, it can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated module/unit be realized in the form of SFU software functional unit and as independent product sale or
In use, can store in a computer readable storage medium.Based on this understanding, the present invention realizes above-mentioned implementation
All or part of the process in example method, can also instruct relevant hardware to complete, the meter by computer program
Calculation machine program can be stored in a computer readable storage medium, the computer program when being executed by processor, it can be achieved that on
The step of stating each embodiment of the method.Wherein, the computer program includes computer program code, the computer program generation
Code can be source code form, object identification code form, executable file or certain intermediate forms etc..The computer-readable medium
It may include: any entity or device, recording medium, USB flash disk, mobile hard disk, magnetic that can carry the computer program code
Dish, CD, computer storage, read-only memory (Read-Only Memory, ROM), random access memory (Random
Access Memory, RAM), electric carrier signal, telecommunication signal and software distribution medium etc..It should be noted that the meter
The content that calculation machine readable medium includes can carry out increase and decrease appropriate according to the requirement made laws in jurisdiction with patent practice,
It such as does not include electric carrier signal and telecommunications according to legislation and patent practice, computer-readable medium in certain jurisdictions
Signal.
Embodiment described above is merely illustrative of the technical solution of the present invention, rather than its limitations；Although referring to aforementioned reality
Applying example, invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each
Technical solution documented by embodiment is modified or equivalent replacement of some of the technical features；And these are modified
Or replacement, the spirit and scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution should all
It is included within protection scope of the present invention.
Claims (10)
1. a kind of bookkeeping methods of block chain characterized by comprising
Local node generate random number, and will carry the random number and the local node node identification information with
Machine number information broadcasts other nodes into block chain network；Meanwhile the local node receives the random of other node broadcasts
Number information, and the random number information received is broadcasted again, so that the equal energy of each node in block chain network
Enough receive the random number information of all nodes in block chain network；
The local node in the random number information received random number and the local node generate random number into
Row sequence, obtains the initial random number sorted lists for carrying node identification information, and then, the local node will be described initial
Random number sorted lists are broadcasted to other described nodes, to obtain the random number sorted lists known together through the whole network；
The local node according to it is described through the whole network common recognition random number sorted lists determine its in current time period belonging to
Block cast timeslice, and reach block casting timeslice when carry out block casting.
2. bookkeeping methods as described in claim 1, which is characterized in that the local node according to it is described through the whole network common recognition with
Machine number sorted lists determine that the block in current time period casts timeslice, and carry out when reaching block casting timeslice
Block is cast
The local node divides the node in block chain network according to the random number sorted lists through the whole network common recognition
Group, and determine the block casting period being each grouped in current time period；
The local node determines that the block for being grouped interior each node is cast according to the random number collating sequence of each node in being grouped
Make sequence；
When the block for reaching grouping belonging to the local node casts the period, grouping of the local node belonging to it
The block casting period in periodic block carried out according to the block casting sequence of each node in being grouped cast timeslice
Wait in turn, and waiting in turn carrying out block casting in successful block casting timeslice.
3. bookkeeping methods as claimed in claim 2, which is characterized in that the block of grouping of the local node belonging to it is cast
It makes and periodic block casting timeslice is carried out according to the block casting sequence of each node in being grouped in the period waits in turn wrapping
It includes:
It is cast in the block casting period of grouping of the local node belonging to it according to the block of each node in being grouped
Sequence carries out periodic when waiting in turn of timeslice of block casting, if the history in block casting timeslice was waited in turn in the period, institute
The previous node for stating local node is not successfully completed the number that block is cast and does not lead to greater than preset times or the block of generation
The whole network common recognition is crossed, then deletes the previous node of the local node in the block casting sequence of each node in being grouped, it is raw
The block casting sequence of Cheng Xin, the local node carry out periodic block according to new block casting sequence and cast timeslice
Wait in turn.
4. bookkeeping methods as claimed in any one of claims 1-3, which is characterized in that in the local node according to the warp
The random number sorted lists of the whole network common recognition determine its block casting timeslice affiliated in current time period, and reach area
Block casting is carried out when making timeslice after block casting, further includes:
In the block casting for entering next time cycle, each node in the block chain network regenerate it is described with
Machine number, and regenerate the random number sorted lists known together through the whole network；
The random number sorted lists through the whole network common recognition that the local node is regenerated according to redefine belonging to it
Block casts timeslice, and carries out block casting when reaching block casting timeslice.
5. bookkeeping methods as claimed in claim 4, which is characterized in that described to be cast in the block for entering next time cycle
When, each node in the block chain network regenerates the random number, and regenerates the random number known together through the whole network
Sorted lists, comprising:
In the block casting for entering next time cycle, will not pass through entirely in historical time cycle memory in the block of generation
The node of net common recognition is removed name from the rolls, it is made to be not involved in the step of regenerating the random number sorted lists known together through the whole network.
6. a kind of billing device of block chain characterized by comprising
Random number generation module generates random number for local node, and will carry the random number and the local section
The random number information of the node identification information of point broadcasts other nodes into block chain network；Meanwhile the local node connects
The random number information of other node broadcasts is received, and the random number information received is broadcasted again, so that block chain
Each node in network can receive the random number information of all nodes in block chain network；
Random number sorted lists generation module, for the local node in the random number information received random number and
The random number that the local node generates is ranked up, and obtains the initial random number sorted lists for carrying node identification information,
Then, the local node broadcasts the initial random number sorted lists to other described nodes, to obtain knowing together through the whole network
Random number sorted lists；
Block casts module, determines that it is being worked as according to the random number sorted lists through the whole network common recognition for the local node
Block belonging in the preceding time cycle casts timeslice, and carries out block casting when reaching block casting timeslice.
7. billing device as claimed in claim 6, which is characterized in that the block casts module, further includes:
Grouped element, for the local node according to the random number sorted lists through the whole network common recognition in block chain network
Node be grouped, and determine each be grouped in current time period block casting the period；
Order determination unit determines in grouping for the local node according to the random number collating sequence of each node in being grouped
The block casting sequence of each node；
Block casting unit, when for casting the period in the block for reaching grouping belonging to the local node, the local
Period is carried out according to the block casting sequence of each node in being grouped in the block casting period of grouping of the node belonging to it
Property block casting timeslice wait in turn, and waiting in turn carrying out block casting in successful block casting timeslice.
8. billing device as claimed in claim 7, which is characterized in that the block casting unit is also used to: the local section
It is carried out periodically in the block casting period of grouping of the point belonging to it according to the block casting sequence of each node in being grouped
Block cast when waiting in turn of timeslice, if block casting timeslice history wait in turn in the period, before the local node
The number that one node is not successfully completed block casting is greater than preset times or the block of generation is not known together by the whole network, then exists
It is suitable to generate new block casting for the previous node for deleting the local node in being grouped in the block casting sequence of each node
Sequence, the local node carry out waiting in turn for periodic block casting timeslice according to new block casting sequence.
9. a kind of terminal, including memory, processor and storage can be run in the memory and on the processor
Computer program, which is characterized in that the processor is realized when executing the computer program as claim 1 to 5 is any
The step of one the method.
10. a kind of computer readable storage medium, the computer-readable recording medium storage has computer program, and feature exists
In realization is such as the step of claim 1 to 5 any one the method when the computer program is executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910171582.2A CN110011974B (en) | 2019-03-07 | 2019-03-07 | Accounting method and device of block chain, terminal and computer-readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910171582.2A CN110011974B (en) | 2019-03-07 | 2019-03-07 | Accounting method and device of block chain, terminal and computer-readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110011974A true CN110011974A (en) | 2019-07-12 |
| CN110011974B CN110011974B (en) | 2021-08-10 |
Family
ID=67166600
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910171582.2A Active CN110011974B (en) | 2019-03-07 | 2019-03-07 | Accounting method and device of block chain, terminal and computer-readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110011974B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110445852A (en) * | 2019-07-29 | 2019-11-12 | 杭州复杂美科技有限公司 | Logical card distribution method, equipment and storage medium |
| CN110457006A (en) * | 2019-07-22 | 2019-11-15 | 上海朝夕网络技术有限公司 | The hardware based distributed multi-party random digit generation method of one kind and system |
| CN110585727A (en) * | 2019-09-26 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Resource acquisition method and device |
| CN110661867A (en) * | 2019-09-25 | 2020-01-07 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN110852882A (en) * | 2019-11-11 | 2020-02-28 | 北京众享比特科技有限公司 | Packet consensus method, apparatus, device, and medium for blockchain networks |
| CN111447274A (en) * | 2020-03-26 | 2020-07-24 | 北京京东振世信息技术有限公司 | Node selection method and device |
| CN111464544A (en) * | 2020-04-01 | 2020-07-28 | 中国联合网络通信集团有限公司 | Block chain account book generation method and device |
| CN111523890A (en) * | 2020-04-23 | 2020-08-11 | 腾讯科技（深圳）有限公司 | Data processing method and device based on block chain, storage medium and equipment |
| CN111556115A (en) * | 2020-04-22 | 2020-08-18 | 财付通支付科技有限公司 | Data processing method, device and equipment based on block chain and storage medium |
| CN112040015A (en) * | 2020-11-06 | 2020-12-04 | 腾讯科技（深圳）有限公司 | Consensus node list generation method and related device |
| CN113010894A (en) * | 2020-06-12 | 2021-06-22 | 腾讯科技（深圳）有限公司 | Data processing method and device and computer readable storage medium |
| WO2021134470A1 (en) * | 2019-12-31 | 2021-07-08 | 西门子股份公司 | Blockchain system, data processing method, computing device and medium |
| CN114979148A (en) * | 2022-06-16 | 2022-08-30 | 中国联合网络通信集团有限公司 | Data transmission method, device and computer readable storage medium |
| CN111523890B (en) * | 2020-04-23 | 2024-06-07 | 腾讯科技（深圳）有限公司 | Block chain-based data processing method, device, storage medium and equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106357405A (en) * | 2016-09-19 | 2017-01-25 | 弗洛格（武汉）信息科技有限公司 | Method and system for managing data on basis of block chain technology consistency algorithms |
| US20180189755A1 (en) * | 2016-12-29 | 2018-07-05 | Red Hat, Inc. | Providing blockchain-based subscription-as-a-service management |
| CN108269090A (en) * | 2018-01-19 | 2018-07-10 | 中国科学院软件研究所 | Based on the common recognition method and apparatus for block catenary system drawn lots at random without negotiation |
| CN108596621A (en) * | 2018-04-28 | 2018-09-28 | 深圳市优学链科技有限公司 | Block chain accounting nodes generation method, device, computer equipment and storage medium |
| CN108964879A (en) * | 2018-07-20 | 2018-12-07 | 杭州复杂美科技有限公司 | A kind of drawing method, common recognition method, equipment and storage medium |
| US20190014124A1 (en) * | 2017-07-10 | 2019-01-10 | Cisco Technology, Inc. | End-to-end policy management for a chain of administrative domains |
| CN109361740A (en) * | 2018-09-27 | 2019-02-19 | 百度在线网络技术（北京）有限公司 | A kind of block generation method, device, equipment and the medium of block chain |
-
2019
- 2019-03-07 CN CN201910171582.2A patent/CN110011974B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106357405A (en) * | 2016-09-19 | 2017-01-25 | 弗洛格（武汉）信息科技有限公司 | Method and system for managing data on basis of block chain technology consistency algorithms |
| US20180189755A1 (en) * | 2016-12-29 | 2018-07-05 | Red Hat, Inc. | Providing blockchain-based subscription-as-a-service management |
| US20190014124A1 (en) * | 2017-07-10 | 2019-01-10 | Cisco Technology, Inc. | End-to-end policy management for a chain of administrative domains |
| CN108269090A (en) * | 2018-01-19 | 2018-07-10 | 中国科学院软件研究所 | Based on the common recognition method and apparatus for block catenary system drawn lots at random without negotiation |
| CN108596621A (en) * | 2018-04-28 | 2018-09-28 | 深圳市优学链科技有限公司 | Block chain accounting nodes generation method, device, computer equipment and storage medium |
| CN108964879A (en) * | 2018-07-20 | 2018-12-07 | 杭州复杂美科技有限公司 | A kind of drawing method, common recognition method, equipment and storage medium |
| CN109361740A (en) * | 2018-09-27 | 2019-02-19 | 百度在线网络技术（北京）有限公司 | A kind of block generation method, device, equipment and the medium of block chain |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110457006A (en) * | 2019-07-22 | 2019-11-15 | 上海朝夕网络技术有限公司 | The hardware based distributed multi-party random digit generation method of one kind and system |
| CN110457006B (en) * | 2019-07-22 | 2021-08-06 | 上海朝夕网络技术有限公司 | Distributed multi-party random number generation method and system based on hardware |
| CN110445852A (en) * | 2019-07-29 | 2019-11-12 | 杭州复杂美科技有限公司 | Logical card distribution method, equipment and storage medium |
| CN110445852B (en) * | 2019-07-29 | 2021-12-10 | 杭州复杂美科技有限公司 | Method, device and storage medium for issuing general certificate |
| CN110661867A (en) * | 2019-09-25 | 2020-01-07 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN110661867B (en) * | 2019-09-25 | 2021-07-23 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN110585727A (en) * | 2019-09-26 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Resource acquisition method and device |
| CN110585727B (en) * | 2019-09-26 | 2023-08-29 | 腾讯科技（深圳）有限公司 | Resource acquisition method and device |
| CN110852882A (en) * | 2019-11-11 | 2020-02-28 | 北京众享比特科技有限公司 | Packet consensus method, apparatus, device, and medium for blockchain networks |
| CN110852882B (en) * | 2019-11-11 | 2020-11-20 | 北京众享比特科技有限公司 | Packet consensus method, apparatus, device, and medium for blockchain networks |
| WO2021134470A1 (en) * | 2019-12-31 | 2021-07-08 | 西门子股份公司 | Blockchain system, data processing method, computing device and medium |
| CN111447274A (en) * | 2020-03-26 | 2020-07-24 | 北京京东振世信息技术有限公司 | Node selection method and device |
| CN111447274B (en) * | 2020-03-26 | 2023-06-02 | 北京京东振世信息技术有限公司 | Node selection method and device |
| CN111464544A (en) * | 2020-04-01 | 2020-07-28 | 中国联合网络通信集团有限公司 | Block chain account book generation method and device |
| CN111556115A (en) * | 2020-04-22 | 2020-08-18 | 财付通支付科技有限公司 | Data processing method, device and equipment based on block chain and storage medium |
| CN111556115B (en) * | 2020-04-22 | 2023-04-21 | 财付通支付科技有限公司 | Block chain-based data processing method, device, equipment and storage medium |
| CN111523890A (en) * | 2020-04-23 | 2020-08-11 | 腾讯科技（深圳）有限公司 | Data processing method and device based on block chain, storage medium and equipment |
| CN111523890B (en) * | 2020-04-23 | 2024-06-07 | 腾讯科技（深圳）有限公司 | Block chain-based data processing method, device, storage medium and equipment |
| CN113010894A (en) * | 2020-06-12 | 2021-06-22 | 腾讯科技（深圳）有限公司 | Data processing method and device and computer readable storage medium |
| CN112040015B (en) * | 2020-11-06 | 2021-02-12 | 腾讯科技（深圳）有限公司 | Consensus node list generation method and related device |
| CN112040015A (en) * | 2020-11-06 | 2020-12-04 | 腾讯科技（深圳）有限公司 | Consensus node list generation method and related device |
| CN114979148A (en) * | 2022-06-16 | 2022-08-30 | 中国联合网络通信集团有限公司 | Data transmission method, device and computer readable storage medium |
| CN114979148B (en) * | 2022-06-16 | 2023-07-14 | 中国联合网络通信集团有限公司 | Data transmission method, device and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110011974B (en) | 2021-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110011974A (en) | Bookkeeping methods, device, terminal and the computer readable storage medium of block chain | |
| CN107169865B (en) | Asset data processing system based on block chain technology | |
| WO2020143183A1 (en) | Blockchain consensus method based on delegated proof of stake, and related device | |
| CN107864198A (en) | A kind of block chain common recognition method based on deep learning training mission | |
| CN109544334A (en) | A kind of network scalability block chain implementation method | |
| EP3837627B1 (en) | Transaction system and method of operation thereof | |
| CN109951474B (en) | Method for realizing block chain common identification block | |
| CN108667632A (en) | Based on the credit record sharing method and device of block chain, electronic equipment | |
| CN107239940A (en) | Network trading method and device based on block catenary system | |
| CN109242500A (en) | Block chain transaction validation verification method, apparatus and storage medium | |
| EP3688701A1 (en) | Scalable distributed ledger system | |
| CN108596623A (en) | A kind of block chain common recognition reaches method | |
| CN107077682A (en) | Method and device for inquiring state information of electronic ticket and block link point | |
| CN107147735A (en) | A kind of distributed account book system based on hierarchy | |
| CN108764870A (en) | Transaction processing method and device, electronic equipment based on block chain | |
| CN110471985A (en) | Electronic bill based on block chain cancels method and device, electronic equipment | |
| CN109921909A (en) | The block chain common recognition method and device proved based on contribution | |
| CN107392608A (en) | Digital asset method of commerce and block catenary system based on block catenary system | |
| CN110348248A (en) | Distributed book keeping operation power generation method in a kind of block chain technology | |
| CN107181797A (en) | The block compression method and system of a kind of block chain | |
| CN110738472B (en) | Block chain storage method and node of block chain | |
| CN110135964A (en) | A kind of financial accounting method based on block chain technology | |
| CN108665363A (en) | A kind of block chain common recognition reaches device | |
| CN108667717A (en) | Block chain processing method, medium, device and computing device based on instant communication message record | |
| CN110473081A (en) | Based on the electronic bill method of charging out and device of block chain, electronic equipment |
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 | ||
| CB02 | Change of applicant information |
Address after: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Applicant after: Gangrong Technology Co., Ltd. Address before: 518000 Guangdong city of Shenzhen province Qianhai Shenzhen Hong Kong cooperation zone before Bay Road No. 1 building 201 room A (located in Shenzhen Qianhai business secretary Co. Ltd.) Applicant before: Shenzhen Ronghui Tongjin Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |