CN108810077A - Block chain common recognition processing method, electronic device and computer readable storage medium - Google Patents
Block chain common recognition processing method, electronic device and computer readable storage medium Download PDFInfo
- Publication number
- CN108810077A CN108810077A CN201810355855.4A CN201810355855A CN108810077A CN 108810077 A CN108810077 A CN 108810077A CN 201810355855 A CN201810355855 A CN 201810355855A CN 108810077 A CN108810077 A CN 108810077A
- Authority
- CN
- China
- Prior art keywords
- node
- common recognition
- block
- transaction
- block chain
- 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
-
- 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
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1048—Departure or maintenance mechanisms
-
- 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
-
- 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
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/53—Network services using third party service providers
-
- 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
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Abstract
The invention discloses a kind of block chain common recognition processing method, this method includes：According to the high quality node of periodical rotation mechanism and POW algorithm picks preset quantities from block catenary system；Common recognition processing is traded between the node chosen.The present invention also provides a kind of electronic device and computer readable storage mediums.Block chain common recognition processing method, electronic device and computer readable storage medium provided by the invention can realize a kind of common recognition mechanism of layering in block catenary system, probabilistic consistency common recognition algorithm is combined with absolute consistency common recognition algorithm, the probabilistic consistency common recognition relatively few number of node of algorithm picks is first passed through in large-scale network node, then absolute consistency common recognition algorithm is recycled efficiently to be known together to common recognition content in selected node, the availability of block catenary system is improved, and extends the scope of application of block catenary system.
Description
Technical field
The present invention relates to a kind of block chain technical field more particularly to block chain common recognition processing method, electronic device and meters
Calculation machine readable storage medium storing program for executing.
Background technology
Current block chain common recognition mechanism can be generally divided into two major class, i.e. probabilistic consistency common recognition mechanism and absolute one
Cause property common recognition mechanism.
Probabilistic consistency common recognition mechanism proves (Proof with proof of work (Proof of Work, POW) algorithm and equity
Of Stake, POS) algorithm be representative, the advantage is that network size is bigger suitable for large-scale distributed network, block chain
Common recognition process is more intended to stablize.And its shortcomings that, is that common recognition efficiency is low, generation block speed is relatively slow, also will in this way
User experience is influenced in some high frequency business scopes.In addition there is the risk for " bifurcated " occur in this mechanism, i.e., in some area
There is certain probability two different blocks occur in block height.Although with the growth of block height, this " bifurcated " has very
Maximum probability is eliminated, but for some business scenarios relatively high to coherence request, such as financial system, this " bifurcated " is difficult
With what is tolerated by user.
Absolute consistency knows together mechanism with practical Byzantine failure tolerance algorithm (Practical Byzantine Fault-
Tolerance, PBFT) it is representative, it the advantage is that efficiency of knowing together between relatively small-scale node is very high, and result of knowing together
The phenomenon that there is absolute consistency between node, be not in block " bifurcated ".And its shortcomings that, is not being suitable on a large scale
Distributed network.When node size is larger, common recognition efficiency increases with number of nodes to be reduced with number of nodes square grade, this will lead
Block chain availability in the case where node is more is caused seriously to reduce.And if number of nodes keeps smaller, and can lead to block chain
Centralization risk is faced, this will likely can be disagreed with the original intention of Service User.
Invention content
In view of this, a kind of block chain common recognition processing method of present invention proposition, electronic device and computer-readable storage medium
Probabilistic consistency common recognition algorithm is combined with absolute consistency common recognition algorithm, is first passed through in large-scale network node by matter
The probabilistic consistency common recognition relatively few number of node of algorithm picks, then recycles absolute consistency to know together algorithm in common recognition
Appearance is efficiently known together.
First, to achieve the above object, the present invention proposes a kind of block chain common recognition processing method, and the method comprising the steps of：
According to the high quality node of periodical rotation mechanism and POW algorithm picks preset quantities from block catenary system；And
Common recognition processing is traded between the node chosen.
Optionally, according to the height of periodical rotation mechanism and POW algorithm picks preset quantities in the catenary system from block
The step of quality node includes：
Rotational cycle is set；
When reaching the election contest starting point in the rotational cycle, pass through the alternate node of POW algorithms selection preset quantities；
When next rotational cycle starts, currently used common recognition node is replaced with the alternate node.
Optionally, the rotational cycle is N number of block, and the election contest starting point can be divided exactly by N/2 for block height and cannot
When evenly divisible by N.
Optionally, the step of alternate node by POW algorithms selection preset quantities includes：
When reaching the election contest starting point in the rotational cycle, all nodes do POW fortune to the block of the election contest starting point
It calculates；
Each node sends a transaction into preset target account after calculating result, and operation result is attached to friendship
In easy extension fields, it to be used for checkout transaction validity；
Effective transaction is searched from the account, and the alternate node is added by trading order.
Optionally, described the step of common recognition processing is traded between the node chosen, includes：
When each rotational cycle starts, according to replaced common recognition node, after transaction is packaged as block, use
Practical Byzantine failure tolerance algorithm is reached common understanding between the replaced common recognition node.
In addition, to achieve the above object, it is described to deposit the present invention also provides a kind of electronic device, including memory, processor
The block chain common recognition processing routine that can be run on the processor, the block chain common recognition processing routine quilt are stored on reservoir
The processor realizes following steps when executing：
According to the high quality node of periodical rotation mechanism and POW algorithm picks preset quantities from block catenary system；And
Common recognition processing is traded between the node chosen.
Optionally, according to the height of periodical rotation mechanism and POW algorithm picks preset quantities in the catenary system from block
The step of quality node includes：
Rotational cycle is set；
When reaching the election contest starting point in the rotational cycle, pass through the alternate node of POW algorithms selection preset quantities；
When next rotational cycle starts, currently used common recognition node is replaced with the alternate node.
Optionally, the rotational cycle is N number of block, and the election contest starting point can be divided exactly by N/2 for block height and cannot
When evenly divisible by N.
Optionally, the step of alternate node by POW algorithms selection preset quantities includes：
When reaching the election contest starting point in the rotational cycle, all nodes do POW fortune to the block of the election contest starting point
It calculates；
Each node sends a transaction into preset target account after calculating result, and operation result is attached to friendship
In easy extension fields, it to be used for checkout transaction validity；
Effective transaction is searched from the account, and the alternate node is added by trading order.
Optionally, described the step of common recognition processing is traded between the node chosen, includes：
When each rotational cycle starts, according to replaced common recognition node, after transaction is packaged as block, use
Practical Byzantine failure tolerance algorithm is reached common understanding between the replaced common recognition node.
Further, to achieve the above object, the present invention also provides a kind of computer readable storage medium, the computers
Readable storage medium storing program for executing is stored with block chain common recognition processing routine, and the block chain common recognition processing routine can be by least one processor
It executes, so that at least one processor is executed such as the step of above-mentioned block chain common recognition processing method.
Compared to the prior art, block chain common recognition processing method proposed by the invention, electronic device and computer-readable
Storage medium can realize a kind of common recognition mechanism of layering in block catenary system, by probabilistic consistency common recognition algorithm and absolutely
Consistency common recognition algorithm is combined, and it is relatively a small number of that probabilistic consistency common recognition algorithm picks are first passed through in large-scale network node
Then the node of amount recycles absolute consistency common recognition algorithm efficiently to be known together to common recognition content in selected node.Also,
Selected node ensure that number in following rotational cycle based on block chain common recognition itself in the form of periodical rotation mechanism
According to common recognition.This programme both can be adapted in large-scale distributed network, while can also efficiently produce block, improve
The availability of block catenary system, and the scope of application of block catenary system is extended, so that block catenary system bottom is met more
The demand of kind business scenario.
Description of the drawings
Fig. 1 is a kind of configuration diagram for electronic device that first embodiment of the invention proposes；
Fig. 2 is a kind of flow diagram for block chain common recognition processing method that second embodiment of the invention proposes；
Fig. 3 is the specific refinement flow diagram of step S10 in Fig. 2.
The embodiments will be further described with reference to the accompanying drawings for the realization, the function and the advantages of the object of the present invention.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, not
For limiting the present invention.Based on the embodiments of the present invention, those of ordinary skill in the art are not before making creative work
The every other embodiment obtained is put, shall fall within the protection scope of the present invention.
It should be noted that the description for being related to " first ", " second " etc. in the present invention is used for description purposes only, and cannot
It is interpreted as indicating or implying its relative importance or implicitly indicates the quantity of indicated technical characteristic.Define as a result, " the
One ", the feature of " second " can explicitly or implicitly include at least one of the features.In addition, the skill between each embodiment
Art scheme can be combined with each other, but must can be implemented as basis with those of ordinary skill in the art, when technical solution
Will be understood that the combination of this technical solution is not present in conjunction with there is conflicting or cannot achieve when, also not the present invention claims
Protection domain within.
First embodiment
As shown in fig.1, first embodiment of the invention proposes a kind of electronic device for realizing block chain common recognition processing method
1。
In the present embodiment, electronic device 1 can be server, smart mobile phone, tablet computer, PC, portable meter
Calculation machine and other electronic equipments with calculation function.
The electronic device 1 includes：Memory 11, processor 13, network interface 15 and communication bus 17.Wherein, network
Interface 15 may include optionally standard wireline interface and wireless interface (such as WI-FI interface).Communication bus 17 is for realizing this
Connection communication between a little components.
Memory 11 includes at least a type of readable storage medium storing program for executing.The readable storage medium storing program for executing of at least one type
It can be the non-volatile memory medium of such as flash memory, hard disk, multimedia card, card-type memory.In some embodiments, described to deposit
Reservoir 11 can be the internal storage unit of the electronic device 1, such as the hard disk of the electronic device 1.In other embodiments
In, the memory 11 can also be to be equipped on the external memory unit of the electronic device 1, such as the electronic device 1
Plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card dodge
Deposit card (Flash Card) etc..
In the present embodiment, the memory 11 can be used for store be installed on the electronic device 1 application software and
The related data generated in Various types of data, such as the program code and its operational process of block chain common recognition processing routine 10.
Processor 13 can be in some embodiments a central processing unit (Central Processing Unit,
CPU), microprocessor or other data processing chips, the program code for being stored in run memory 11 or processing data.
Fig. 1 illustrates only the electronic device 1 for processing routine 10 of knowing together with component 11-17 and block chain, but should manage
Solution, Fig. 1 do not show that all components of electronic device 1, can substitute and implement more or less component.
In 1 embodiment of electronic device shown in Fig. 1, as memory block in a kind of memory 11 of computer storage media
The program code of block chain common recognition processing routine 10, processor 13 execute the program code of the block chain common recognition processing routine 10
When, realize following steps：
(1) according to the high quality node of periodical rotation mechanism and POW algorithm picks preset quantities from block catenary system.
It specifically includes：
A., rotational cycle is set.In the present embodiment, can be arranged per N number of block (such as N=10000) is a rotation
Period will choose a collection of high quality node again for each rotational cycle.
B. when reaching the election contest starting point in the rotational cycle, pass through the alternate node of POW algorithms selection preset quantities.
In the present embodiment, the election contest starting point, which is block height, can be divided exactly by N/2 and evenly divisible by N (such as cannot can be divided exactly by 5000
And cannot be divided exactly by 10000) when, that is, when the rotational cycle proceeds to half, the time for being left half of rotational cycle is used
To do the selection of the alternate node.At this point, all nodes do POW operations to the block of the election contest starting point, and tied calculating
A transaction is sent to preset open system account after fruit, turnover can be arbitrary value (being recommended as the minimum allowed),
Operation result is attached in the extension fields of transaction, subsequent check validity is used for.Then, it is looked into from the account
Effective transaction is looked for, the alternate node is added by trading order.
C. when next rotational cycle starts, currently used common recognition node is replaced with the alternate node.?
In the present embodiment, each rotational cycle is corresponding with the common recognition node of preset quantity.When next rotational cycle is opened
When the beginning, currently used common recognition node failure is replaced with new a batch common recognition node with the selected alternate node, is used for
Handle the common recognition work of the rotational cycle.
(2) common recognition processing is traded between the node chosen.In the present embodiment, it is opened in each rotational cycle
When the beginning, according to replaced common recognition node, after transaction is packaged as block, reach between these replaced common recognition nodes altogether
Know.
The detailed description of above-mentioned steps please refers to following second embodiments, and details are not described herein.
Second embodiment
As shown in fig.2, second embodiment of the invention proposes a kind of block chain common recognition processing method.In the present embodiment,
The execution sequence of the step in flow chart shown in Fig. 2 can change according to different requirements, and certain steps can be omitted.This
Outside, the Conventional processing steps in relation to block catenary system can be included in the present invention according to practical application scene.This method includes following
Step：
Step S10, according to the high quality of periodical rotation mechanism and POW algorithm picks preset quantities from block catenary system
Node.
As shown in fig.3, for the specific refined flow chart of the step.In the present embodiment, which specifically includes：
Rotational cycle is arranged in step S100.
Specifically, in order to which the fairness and the high availability for ensureing node, selected common recognition node that ensure election will adopt
Take periodical rotation mechanism.In the present embodiment, it is a rotational cycle that can be arranged per N number of block (such as N=10000),
For each rotational cycle, a collection of high quality node will be chosen again as common recognition node.
Step S102 passes through the standby of POW algorithms selection preset quantities when reaching the election contest starting point in the rotational cycle
Select node.
In the present embodiment, the election contest starting point be block height can be divided exactly by N/2 and cannot it is evenly divisible by N (such as can quilt
5000 divide exactly and cannot be divided exactly by 10000) when, that is, when the rotational cycle proceeds to half, it is left half of rotational cycle
Time be used for doing the selection of the alternate node.At this point, all nodes do POW operations to the block of the election contest starting point, and
A transaction is sent to preset open system account (POW target accounts) after calculating result, turnover can be arbitrary value
(being recommended as the minimum allowed), operation result is attached in the extension fields of transaction, effective for subsequent check
Property.Then, effective transaction (i.e. operation result is correctly merchandised) is searched from the account, is added by trading order described standby
Select node.
Specifically, in block catenary system, for each node, there are three types of states：Peer, Validator and
Candidate.Wherein, Peer nodes are still not selected node, are responsible for block synchronization and transaction forwarding；Validator is saved
Point is the node elected, is used to carry out block common recognition in next step；Candidate nodes are the standby of Validator nodes
Use node.Validator nodes still possess with Candidate nodes the block of Peer nodes it is synchronous and transaction forwarding capability.
When reaching the election contest starting point in the rotational cycle, all nodes do POW fortune to the block of the election contest starting point
It calculates, concrete operation is to find a random number nonce, is met：
SHA256(SHA256(block_header_hash||nonce))<=2^M,
Wherein M is the positive integer less than 256, indicates degree-of-difficulty factor, and M can be 240 in the present embodiment.
The node for calculating nonce sends a transaction to preset open system account at once, and operation result is attached
It is added in the extension fields of transaction, the validity for the subsequent check transaction.The purpose of the POW operations be in order to
The network environment and computing environment for examining each node, subsequently receive the sequence of the transaction according to the account, can sentence
Break and the arithmetic speed of each node, to pick out the node of high quality.
In the present embodiment, each node needs to preserve three tables and mesh information.Three tables are appointed for present node
The effective node listing of duty table, current period, effective node of next period (i.e. alternate node) list.Wherein：
Table 1：Present node tenure table
| ID | Validator | Candidate |
In the present node holds a post table, ID is Validator node serial numbers, and Validator is that each ID is corresponding
Validator node address, Candidate are the corresponding Candidate node address of each Validator nodes.It is described
The quantity of Validator nodes can need to set according to what is currently merchandised, and being 4 in table 1 with Validator number of nodes is
Example.The Validator nodes and Candidate nodes are the effective node of current period, that is, current rotational cycle makes
Common recognition node.When the present node tenure table is that each rotational cycle starts, carried out according to following table 2 and table 3
It fills in.
Table 2：The effective node listing of current period
| ID | ADDR | IP | BLOCK_POS | TX_POS |
In the effective node listing of the current period, ID is the sequencing that the account receives transaction, and ranking is leaned on
Preceding transaction id is also located further forward, and corresponding node also can preferentially be chosen as Validator nodes.ADDR is node address, and IP is section
The IP address of point, BLOCK_POS, which is POW, proves the transaction (friendship with POW operation results that i.e. node is sent to the account
Block height where easily), TX_POS, which is POW, proves the transaction id of exchange within a block, for verifying whether the node is conjunction
Method node.It is obtained from the transaction (POW proves transaction) that the account receives according to the effective node listing of current period
The information solicitation taken, since these transaction are by common recognition, the result of all querying nodes is identical.
Table 3：Next period effective node listing
| ID | ADDR | IP | BLOCK_POS | TX_POS |
In next period effective node listing, ID is the sequencing that the account receives transaction, and ranking is leaned on
Preceding transaction id is also located further forward, and corresponding node also can preferentially be chosen as Validator nodes.ADDR is node address, and IP is section
The IP address of point, BLOCK_POS, which is POW, proves exchange in block height, and TX_POS, which is POW, proves exchange within a block
Transaction id, for verifying whether the node is legitimate node.Effective node listing of next period is also according to from the account
The information solicitation obtained in the transaction (POW proves transaction) that family receives, since these transaction are by common recognition, Suo Youjie
The result of point inquiry is identical.
After reaching the election contest starting point in the rotational cycle, the account receives the POW that each node is sent successively
It proves to search effective transaction during transaction, all nodes are merchandised from subregion where the account, it will be corresponding legal by trading order
Node is added in table 3.
Wherein, each Validator nodes cannot be reappointed or reelected consecutively, that is, identical node cannot be in continuous two rotational cycles
In serve as Validator nodes.By taking Validator number of nodes in table 1 is 4 as an example, i.e., preceding 4 nodes in table 2 cannot
It is packed into the position of preceding 4 nodes in table 3.Even if preceding 4 nodes in table 2 are current in the account, there are rankings again
Forward effective transaction also will prevent Validator nodes from connecting during inserting table 3 from the 5th position start recording
Appoint.
Step S104 replaces currently used common recognition with the alternate node when next rotational cycle starts
Node.
In the present embodiment, each rotational cycle is corresponding with the common recognition node of preset quantity.When next described
When rotational cycle starts, it is total to replace with new a batch with the selected alternate node for currently used common recognition node failure
Node is known, for handling the common recognition work of the rotational cycle.
Specifically, after current rotational cycle, when next rotational cycle starts, former table 2 is replaced with table 3, i.e.,
Selected alternate node becomes the effective common recognition node of next rotational cycle.In addition, according to required
The quantity of Validator nodes obtains the Validator of respective numbers respectively from replaced table 2 (former table 3) in sequence
Node and Candidate nodes insert table 1.For example, by taking required Validator nodes are 4 as an example, by replaced table 2
In preceding 4 nodal informations filling table 1 the parts Validator, the parts Candidate of the 5th~8 nodal information filling table 1.
Fig. 2, step S20 are returned to, common recognition processing is traded between the node chosen.
In the present embodiment, when each rotational cycle starts, according to replaced common recognition node, transaction is packaged
After block, reach common understanding between these replaced common recognition nodes.
Specifically, it when each rotational cycle starts, is known together by the Validator node networkings in table 1.
Any one consistency common recognition algorithm may be used in the common recognition, in the present embodiment by taking PBFT as an example.Selected
Validator nodes are packaged transaction and generate block, and know together to block in validator nodes.Know together successful area
Block can be stored into validator nodes local block chain, other nodes can also synchronize newest block from validator nodes.
When some validator node can not be normally carried out common recognition work, other nodes will select this from public table 1
The corresponding candidate nodes of validator nodes are replaced.Also, the corresponding candidate nodes are as new
Validator nodes before, will also from table 2 the legal next node of sequential selection as new validator
The corresponding candidate nodes of node.By taking Validator number of nodes in table 1 is 4 as an example, when some validator node
When can not be normally carried out common recognition work, other nodes will select this validator node corresponding from table 1
Candidate nodes are replaced, and select the 9th node corresponding as new validator nodes from table 2
Candidate nodes.
Block chain common recognition processing method provided in this embodiment, can realize a kind of common recognition of layering in block catenary system
Probabilistic consistency common recognition algorithm is combined with absolute consistency common recognition algorithm, is first passed through in large-scale network node by mechanism
The probabilistic consistency common recognition relatively few number of node of algorithm picks, then recycles absolute consistency to know together algorithm in selected section
It is efficiently known together to common recognition content in point.Also, selected node is based on block chain in the form of periodical rotation mechanism
Common recognition itself ensure that the common recognition of data in following rotational cycle.This programme both can be adapted for large-scale distributed network
In, while block can also be efficiently produced, the availability of block catenary system is improved, and extend being applicable in for block catenary system
Range allows block catenary system bottom to meet the needs of more kinds of business scenarios.
3rd embodiment
The present invention also provides another embodiments, that is, provide a kind of computer readable storage medium, the computer
Readable storage medium storing program for executing is stored with block chain common recognition processing routine 10, and the block chain common recognition processing routine 10 can be by least one place
It manages device to execute, so that at least one processor is executed such as the step of above-mentioned block chain common recognition processing method.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on this understanding, technical scheme of the present invention substantially in other words does the prior art
Going out the part of contribution can be expressed in the form of software products, which is stored in a storage medium
In (such as ROM/RAM, magnetic disc, CD), including some instructions are used so that a client (can be mobile phone, computer, electronics
Device, air conditioner or network equipment etc.) execute method described in each embodiment of the present invention.
It these are only the preferred embodiment of the present invention, be not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (11)
- The processing method 1. a kind of block chain is known together, which is characterized in that the method includes the steps：It is pre- according to periodical rotation mechanism and proof of work (Proof of Work, POW) algorithm picks from block catenary system If the high quality node of quantity；AndCommon recognition processing is traded between the node chosen.
- The processing method 2. block chain as described in claim 1 is known together, which is characterized in that according to week in the catenary system from block The step of high quality node of phase property rotation mechanism and POW algorithm picks preset quantities includes：Rotational cycle is set；When reaching the election contest starting point in the rotational cycle, pass through the alternate node of POW algorithms selection preset quantities；When next rotational cycle starts, currently used common recognition node is replaced with the alternate node.
- The processing method 3. block chain as claimed in claim 2 is known together, which is characterized in that the rotational cycle is N number of block, institute State election contest starting point be block height can be divided exactly by N/2 and cannot be evenly divisible by N when.
- The processing method 4. block chain as claimed in claim 2 is known together, which is characterized in that described default by POW algorithms selections The step of alternate node of quantity includes：When reaching the election contest starting point in the rotational cycle, all nodes do POW operations to the block of the election contest starting point；Each node sends a transaction into preset target account after calculating result, and operation result is attached to transaction In extension fields, it to be used for checkout transaction validity；Effective transaction is searched from the account, and the alternate node is added by trading order.
- The processing method 5. block chain as claimed in claim 2 is known together, which is characterized in that described to be carried out between the node chosen Transaction common recognition processing the step of include：When each rotational cycle starts, according to replaced common recognition node, after transaction is packaged as block, using practicality Byzantine failure tolerance algorithm is reached common understanding between the replaced common recognition node.
- 6. a kind of electronic device, which is characterized in that the electronic device includes memory, processor, is stored on the memory There are the block chain common recognition processing routine that can be run on the processor, the block chain to know together processing routine by the processor Following steps are realized when execution：According to the high quality node of periodical rotation mechanism and POW algorithm picks preset quantities from block catenary system；AndCommon recognition processing is traded between the node chosen.
- 7. electronic device as claimed in claim 6, which is characterized in that changed planes according to periodically wheel in the catenary system from block System and POW algorithm picks preset quantities high quality node the step of include：Rotational cycle is set；When reaching the election contest starting point in the rotational cycle, pass through the alternate node of POW algorithms selection preset quantities；When next rotational cycle starts, currently used common recognition node is replaced with the alternate node.
- 8. electronic device as claimed in claim 7, which is characterized in that the rotational cycle is N number of block, the election contest starting point Can be divided exactly by N/2 for block height and cannot be evenly divisible by N when.
- 9. electronic device as claimed in claim 7, which is characterized in that described to pass through the alternative of POW algorithms selection preset quantities The step of node includes：When reaching the election contest starting point in the rotational cycle, all nodes do POW operations to the block of the election contest starting point；Each node sends a transaction into preset target account after calculating result, and operation result is attached to transaction In extension fields, it to be used for checkout transaction validity；Effective transaction is searched from the account, and the alternate node is added by trading order.
- 10. electronic device as claimed in claim 7, which is characterized in that described to be traded common recognition between the node chosen The step of processing includes：When each rotational cycle starts, according to replaced common recognition node, after transaction is packaged as block, using practicality Byzantine failure tolerance algorithm is reached common understanding between the replaced common recognition node.
- 11. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has block chain total Know processing routine, the block chain common recognition processing routine can be executed by least one processor, so that at least one processing Device executes the step of block chain common recognition processing method as described in any one of claim 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810355855.4A CN108810077A (en) | 2018-04-19 | 2018-04-19 | Block chain common recognition processing method, electronic device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810355855.4A CN108810077A (en) | 2018-04-19 | 2018-04-19 | Block chain common recognition processing method, electronic device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108810077A true CN108810077A (en) | 2018-11-13 |
Family
ID=64092978
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810355855.4A Pending CN108810077A (en) | 2018-04-19 | 2018-04-19 | Block chain common recognition processing method, electronic device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108810077A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327548A (en) * | 2018-11-27 | 2019-02-12 | 北京瑞卓喜投科技发展有限公司 | A kind of block chain update method and block chain more new system |
| CN109639416A (en) * | 2018-12-21 | 2019-04-16 | 深圳市网心科技有限公司 | A kind of identifier's node determines method, system, device and computer storage medium |
| CN110298670A (en) * | 2019-07-05 | 2019-10-01 | 北京艾摩瑞策科技有限公司 | It is related to the common recognition method and device thereof of PBFT |
| CN110912994A (en) * | 2019-11-22 | 2020-03-24 | 中国联合网络通信集团有限公司 | Block chain consensus method and device |
| CN111080447A (en) * | 2019-12-02 | 2020-04-28 | 裴保林 | Rotation method and system for neutral node in block chain system |
| CN111130875A (en) * | 2019-12-20 | 2020-05-08 | 上海优扬新媒信息技术有限公司 | Block chain consensus method, device, equipment and storage medium |
| CN112132579A (en) * | 2020-09-30 | 2020-12-25 | 深圳前海微众银行股份有限公司 | Block chain consensus node updating method and device |
| CN112801791A (en) * | 2021-01-29 | 2021-05-14 | 武汉大学 | Authorization-based block chain consensus method and system |
| CN112995317A (en) * | 2021-02-26 | 2021-06-18 | 中国工商银行股份有限公司 | Block chain consensus method and block chain link points |
| CN113486118A (en) * | 2021-07-21 | 2021-10-08 | 银清科技有限公司 | Consensus node selection method and device |
| WO2021226846A1 (en) * | 2020-05-12 | 2021-11-18 | Beijing Wodong Tianjun Information Technology Co., Ltd. | Systems and methods for establishing consensus in distributed communications |
| CN114710504A (en) * | 2022-03-31 | 2022-07-05 | 蚂蚁区块链科技(上海)有限公司 | Rotation method of common nodes in block chain system, nodes and block chain system |
| CN115293769A (en) * | 2022-10-08 | 2022-11-04 | 中铱数字科技有限公司 | Dynamic management and check node system based on block chain |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160253523A1 (en) * | 2015-02-27 | 2016-09-01 | Guardtime Ip Holdings Limited | Redundant Fail-Safe Synchronization in a Data Authentication Infrastructure |
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
| CN107341660A (en) * | 2017-05-27 | 2017-11-10 | 唐盛（北京）物联技术有限公司 | A kind of block chain bottom common recognition mechanism and the block catenary system based on the common recognition mechanism |
| CN107360248A (en) * | 2017-07-31 | 2017-11-17 | 众安信息技术服务有限公司 | For configuring the method and apparatus locally known together and computer-readable recording medium |
| CN107450981A (en) * | 2017-05-31 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method and apparatus |
-
2018
- 2018-04-19 CN CN201810355855.4A patent/CN108810077A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160253523A1 (en) * | 2015-02-27 | 2016-09-01 | Guardtime Ip Holdings Limited | Redundant Fail-Safe Synchronization in a Data Authentication Infrastructure |
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
| CN107341660A (en) * | 2017-05-27 | 2017-11-10 | 唐盛（北京）物联技术有限公司 | A kind of block chain bottom common recognition mechanism and the block catenary system based on the common recognition mechanism |
| CN107450981A (en) * | 2017-05-31 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method and apparatus |
| CN107360248A (en) * | 2017-07-31 | 2017-11-17 | 众安信息技术服务有限公司 | For configuring the method and apparatus locally known together and computer-readable recording medium |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327548A (en) * | 2018-11-27 | 2019-02-12 | 北京瑞卓喜投科技发展有限公司 | A kind of block chain update method and block chain more new system |
| CN109639416A (en) * | 2018-12-21 | 2019-04-16 | 深圳市网心科技有限公司 | A kind of identifier's node determines method, system, device and computer storage medium |
| CN109639416B (en) * | 2018-12-21 | 2022-09-02 | 深圳市迅雷网络技术有限公司 | Method, system and device for determining verifier node and computer storage medium |
| CN110298670A (en) * | 2019-07-05 | 2019-10-01 | 北京艾摩瑞策科技有限公司 | It is related to the common recognition method and device thereof of PBFT |
| CN110912994B (en) * | 2019-11-22 | 2022-02-11 | 中国联合网络通信集团有限公司 | Block chain consensus method and device |
| CN110912994A (en) * | 2019-11-22 | 2020-03-24 | 中国联合网络通信集团有限公司 | Block chain consensus method and device |
| CN111080447A (en) * | 2019-12-02 | 2020-04-28 | 裴保林 | Rotation method and system for neutral node in block chain system |
| CN111080447B (en) * | 2019-12-02 | 2020-10-30 | 百望股份有限公司 | Rotation method and system for neutral node in block chain system |
| CN111130875A (en) * | 2019-12-20 | 2020-05-08 | 上海优扬新媒信息技术有限公司 | Block chain consensus method, device, equipment and storage medium |
| CN111130875B (en) * | 2019-12-20 | 2022-09-30 | 度小满科技(北京)有限公司 | Block chain consensus method, device, equipment and storage medium |
| WO2021226846A1 (en) * | 2020-05-12 | 2021-11-18 | Beijing Wodong Tianjun Information Technology Co., Ltd. | Systems and methods for establishing consensus in distributed communications |
| CN112132579A (en) * | 2020-09-30 | 2020-12-25 | 深圳前海微众银行股份有限公司 | Block chain consensus node updating method and device |
| CN112132579B (en) * | 2020-09-30 | 2022-08-12 | 深圳前海微众银行股份有限公司 | Block chain consensus node updating method and device |
| CN112801791A (en) * | 2021-01-29 | 2021-05-14 | 武汉大学 | Authorization-based block chain consensus method and system |
| CN112995317A (en) * | 2021-02-26 | 2021-06-18 | 中国工商银行股份有限公司 | Block chain consensus method and block chain link points |
| CN113486118A (en) * | 2021-07-21 | 2021-10-08 | 银清科技有限公司 | Consensus node selection method and device |
| CN113486118B (en) * | 2021-07-21 | 2023-09-22 | 银清科技有限公司 | Consensus node selection method and device |
| CN114710504A (en) * | 2022-03-31 | 2022-07-05 | 蚂蚁区块链科技(上海)有限公司 | Rotation method of common nodes in block chain system, nodes and block chain system |
| CN115293769A (en) * | 2022-10-08 | 2022-11-04 | 中铱数字科技有限公司 | Dynamic management and check node system based on block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108810077A (en) | Block chain common recognition processing method, electronic device and computer readable storage medium | |
| CN108200203B (en) | Block chain system based on double-layer network | |
| CN109359759A (en) | Intelligence divides storehouse method, equipment and computer readable storage medium | |
| CN109087024B (en) | Data processing method, device, storage medium and equipment for electronic bill | |
| CN109522362A (en) | Incomplete markets synchronous method, system and equipment based on block chain data | |
| CN106506663B (en) | A kind of number distributing method, server and system | |
| CN108347483B (en) | Decentralized computing system based on double-layer network | |
| CN108769264B (en) | Block chain domain division method | |
| CN110399728A (en) | A kind of edge calculations method for trust evaluation of nodes, device, equipment and storage medium | |
| CN106325756B (en) | Data storage method, data calculation method and equipment | |
| CN104616142B (en) | Data transfer method, server, mobile terminal and system | |
| US11030594B2 (en) | Network server and method of operating thereof to mediate actions between user terminals relating to online games | |
| CN110570179B (en) | Order display method, device, equipment and storage medium | |
| CN110597922A (en) | Data processing method, device, terminal and storage medium | |
| CN111582935A (en) | Block chain-based integral mutual identification method and system | |
| CN113065966A (en) | Method and device for determining types of business products | |
| CN108876339B (en) | E-pet transaction method and device based on certificate | |
| CN111311360A (en) | Resource return method and device, storage medium and electronic device | |
| CN110188140A (en) | Data pull method, apparatus, storage medium and computer equipment | |
| CN113032036B (en) | Service data processing method, device, system, computer equipment and storage medium | |
| CN106844605B (en) | Batch data logical process method and device | |
| CN111147568B (en) | Identity data synchronization method and device | |
| CN113139748A (en) | Service information recommendation method and device, electronic equipment and storage medium | |
| CN104572649B (en) | The processing method of the data of distributed memory system, apparatus and system | |
| CN110472977A (en) | A kind of the transaction record generation method and relevant device of block chain |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20211012 Address after: 518000 21 / f-23 / F, block B, building 12, Shenzhen Bay science and technology ecological park, No. 18, South Keji Road, high tech community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: Xunlei Networking Technologies, Ltd. Applicant after: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. Address before: 518000 Room 201, building A, 1 front Bay Road, Shenzhen Qianhai cooperation zone, Shenzhen, Guangdong Applicant before: SHENZHEN ONETHING TECHNOLOGIES Co.,Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181113 |