CN110033238A - Block chain common recognition system based on asynchronous ordering techniques - Google Patents
Block chain common recognition system based on asynchronous ordering techniques Download PDFInfo
- Publication number
- CN110033238A CN110033238A CN201910298641.2A CN201910298641A CN110033238A CN 110033238 A CN110033238 A CN 110033238A CN 201910298641 A CN201910298641 A CN 201910298641A CN 110033238 A CN110033238 A CN 110033238A
- Authority
- CN
- China
- Prior art keywords
- role
- chain node
- asynchronous
- node
- 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
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000012545 processing Methods 0.000 claims abstract description 8
- 238000002360 preparation method Methods 0.000 claims description 26
- 238000012790 confirmation Methods 0.000 claims description 19
- 238000004891 communication Methods 0.000 claims description 11
- 230000000694 effects Effects 0.000 claims description 9
- 230000006870 function Effects 0.000 claims description 7
- 230000004044 response Effects 0.000 claims description 7
- 230000008859 change Effects 0.000 claims description 6
- 238000012544 monitoring process Methods 0.000 claims description 6
- 238000013459 approach Methods 0.000 claims description 3
- 238000013016 damping Methods 0.000 claims description 3
- 239000003595 mist Substances 0.000 claims description 3
- 238000011017 operating method Methods 0.000 claims description 3
- 238000005192 partition Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 230000001360 synchronised effect Effects 0.000 claims description 3
- 235000013399 edible fruits Nutrition 0.000 claims description 2
- 238000007689 inspection Methods 0.000 claims description 2
- 230000009466 transformation Effects 0.000 claims description 2
- 238000012163 sequencing technique Methods 0.000 abstract description 5
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3827—Use of message hashing
-
- 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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Abstract
The present invention relates to the block chain common recognition systems based on asynchronous ordering techniques, which is characterized in that creates asynchronous sort algorithm, converts processing to the sequencing problem of the request of asynchronous system large-scale concurrent and data for common recognition problem；Asynchronous sort algorithm is created, converts common recognition problem to the sequencing problem handled to the request of asynchronous system large-scale concurrent and data, it is practical.
Description
Technical field
The present invention relates to block chain technical field, it is related to the block chain common recognition system based on asynchronous ordering techniques.
Background technique
Existing block chain common recognition method usually requires to connect during common recognition with most of nodes, and obtains ballot,
Node is larger to dictyosome dependence, is difficult to improve system data transmission efficiency, and needs of knowing together are converted into processing to asynchronous system
The sequencing problem of large-scale concurrent request and data, and it is also contemplated that the whole connectivity of network, in non-full-mesh network
In the environment of, or even be connected to the network in the system of ratio < 50% and be unable to operate normally.
In conclusion having broken Traditional Thinking in bottom if a kind of technical solution can be provided, broken through by core of algorithm
Mouthful, and corresponding cooperation is done with common recognition mechanism, it can achieve significant effect and measured data, possessed higher common recognition effect
Rate.
Summary of the invention
In view of this, the present invention provide it is a kind of solution or part solve the above problems block chain based on asynchronous sequence skill
The block chain common recognition system of art.
To achieve the effect that above-mentioned technical proposal, the technical solution of the present invention is as follows: the block chain based on asynchronous ordering techniques
Common recognition system, which is characterized in that the block chain common recognition system based on asynchronous ordering techniques, which is characterized in that comprising client, just
Beginning layer network, mid-level network, asynchronous collator, chain node apparatus；
Client will surpass when calling in asynchronous sort algorithm according to trigger condition, callbacks, critical point monitoring, state
When these conditions be called；
The effect of initial layer network receives the Asynchronous Request from client；
The effect at middle layer network is to approach any continuous function with multitiered network topology section structure, can be in fit procedure
Quickly restrain normalizing as a result, and using back-propagation algorithm, Multilayer partition, mist algorithm, weak center and decentralization it
Between handover network topology section structure；
Asynchronous collator includes and calls asynchronous sort algorithm, line asynchronous of going forward side by side communication and asynchronous execution, in asynchronous row
In sequence device, client request newly added node terminates without waiting for previous node tasks, but passes through global flag mark
Carry out asynchronous communication；It, can not without being waited between each task, but according to the information currently obtained from global flag mark
Task node is executed disconnectedly and is interrupted and obtains back end, and asynchronous sort algorithm avoids the synchronous communication expense between task；It is asynchronous
Sort algorithm lies over the response of current accounting nodes request by client, handles next accounting nodes request；Book keeping operation section
Point is performed, and can be put into execution stack and be gone to execute, go in task queue to have checked whether accounting nodes needs after having executed
It executes, and accounting nodes is put into execution stack to go to execute and is over and can go in task queue to have checked whether execute
Accounting nodes, circuit sequentially inspection execute, in asynchronous execution be arranged timer as state transformation trigger condition, Zhi Daoda
At common recognition；
Asynchronous collator passes through asynchronous sort algorithm, common recognition by each accounting nodes in each hinged node device
Algorithm is reached common understanding with distributed each accounting nodes, and generates the super node in accounting nodes and ordinary node；And pass through
Asynchronous sort algorithm improves between the accounting nodes speed generated in chain node apparatus and accounting nodes in asynchronous collator
The speed reached common understanding；The asynchronous sort algorithm that asynchronous collator provides is executed on each accounting nodes；Each role's chain
Node carries out state change and its sequence, until each chain role node is reached common understanding；In asynchronous collator, all book keeping operation sections
Point is all asynchronous execution, and each accounting nodes are an asynchronous tasks；Node asynchronous on chain executes, without waiting for before
One accounting nodes completion executes again；
Accounting nodes are divided by chain node apparatus: priority role's chain node, and second priority weighs role's chain node, coordinator angle
Color chain node, alternative people role's chain node；Chain node apparatus includes each accounting nodes；Super node in accounting nodes and common
Node is the division on another level, for being better than the whole connectivity of network, in the environment of non-full-mesh network, even
It can also be operated normally by super node in the system of network connection ratio < 50%；
Priority role's chain node: it is responsible for request of the processing from accounting nodes, manages generation, the Yi Jiyu of hash
Second priority weighs role's chain node and keeps asynchronous communication critical point monitoring, is distributed to the information such as other accounting nodes cryptographic Hash；Suboptimum
It first weighs role's chain node: being responsible for response and requested from priority role chain node, respond the choosing from coordinator role's chain node
Lift request；Coordinator role's chain node: it sends and is requested with sub-priority role chain node, while handling alternative successful candidate in the imperial examinations at the provincial level in the Ming and Qing dynasties's chain node
Election request；Alternative people role's chain node: the request with coordinator role's chain node is sent；All nodes are to coordinate when initial
Person role's chain node；Four role's chain nodes constitute role's chain node state machine and execute state turn according to different trigger conditions
Become, circuits sequentially, terminate until reaching common recognition；The selection plausibility function f (x) of each role's chain node is calculated with following formula:
In above-mentioned publicity, i is integer, is indicated from 1 to countless big, M1, M2, M3..., MnEach role's chain node is represented, f is
Damping factor indicates that the role relation between chain node converts grade probability, it is a weight, wijWhat is indicated is j pairs of chain node
Chain node i weight distribution, i, j, n are positive integer；Wherein E (Mi) indicate each role's chain node M1, M2, M3..., MnPossible probability
Property set, f (i) and f (j) respectively indicate chain node i and a possibility that chain node j change, for calculating chain node j to chain link
Point i weight distribution wij；
Common recognition algorithm operating procedure based on asynchronous sort algorithm includes: initial phase, and the preparation stage executes the stage,
Confirmation stage completes the stage；Second priority weighs role's chain node and initiates to request to priority role's chain node, priority role's chain link
Point receives the request of second priority power role's chain node, can send to other second priority power role's chain node and prepare message, Qi Taci
Priority role's chain node just has received preparation message, is prepared to enter into the preparation stage；When multiple second priority power role's chain link clicks through
Enter in any number of processor, receives the sequence correlation for the input message for having identification comprising second priority power role's chain node
With accounting nodes correlation, the sequence state in shared sequence memory is checked；Preparation stage, determine input message whether be for
Maintain message sequence in sequence and other second priority of next message to be processed weigh role's chain node；Wherein coordinator angle
, can be there are two types of selection after color chain link point receives early-stage preparations message, one is receiving, and one is do not receive；When message is sent, disappear
Symbol p and q in breath is for indicating that in the message received before be identical label, and the symbol t and u in message are for indicating
The message received before is different label, at this time will refuse information transmission request；The logic of refusal is exactly priority
Role's chain node and second priority power role's chain node will not send two p and q having the same, but the message that t and u is different；
If there are also the message of current all untreated sequence for processor, and if input message is confirmed as the next wait locate of sequence
Message is managed, then input message is transmitted to shared sequence memory, then by the way that outbound point of processor can be used in processor
The message is fetched, to handle, priority role's chain node can be sent after agreeing to request to other second priority power role's chain node
Preparation stage message；If receiving the preparation stage message more than 3K different nodes, just representing the preparation stage has been completed；Such as
Fruit processor then restarts the preparation stage in the message for handling at least one sequence at present；The execution stage, to other second priority
It weighs role's chain node broadcasts and executes phase messages, similarly, this process may be to have i node also in progress；Confirmation stage,
The confirmation phase messages that other second priority power role's chain nodes are sent are received to represent big after receiving 2i+1 confirmation message
Most nodes come into confirmation stage；Ending phase weighs role's chain node when most of second priority and has completed confirmation stage,
Indicate that this stage has reached common understanding, then alternative people role's chain node carries out request, and data are written；If shared sequence
Column memory has included the message to be processed of sequence；It or is not the next wait locate of sequence if input message is confirmed as
Reason message remains to be further processed, finally until base then being stored in input message in the spilling memory of shared processor
All accounting nodes participated in during knowing together are reached common understanding in asynchronous sort algorithm.
Beneficial achievement of the invention are as follows: the present invention provides the block chain common recognition systems based on asynchronous ordering techniques, incite somebody to action this
Invention is related to the common recognition system of the block chain based on asynchronous ordering techniques, which is characterized in that creates asynchronous sort algorithm, common recognition is asked
Topic is converted into processing to the sequencing problem of the request of asynchronous system large-scale concurrent and data；Asynchronous sort algorithm is created, will be total to
Knowledge problem is converted into the sequencing problem handled to the request of asynchronous system large-scale concurrent and data, practical., public property
By force.
Specific embodiment
In order to which technical problems, technical solutions and advantages to be solved are more clearly understood, tie below
Embodiment is closed, the present invention will be described in detail.It should be noted that specific embodiment described herein is only to explain
The present invention is not intended to limit the present invention, and the product for being able to achieve said function belongs to equivalent replacement and improvement, is all contained in this hair
Within bright protection scope.The specific method is as follows:
Embodiment 1: the present embodiment specifically illustrates the step of common recognition system of the block chain based on asynchronous ordering techniques, such as
Under: the block chain common recognition system based on asynchronous ordering techniques, which is characterized in that include client, initial layer network, middle layer net
Network, asynchronous collator, chain node apparatus；Client will be according to trigger condition, readjustment skill when calling in asynchronous sort algorithm
Art, critical point monitoring, these overtime conditions of state are called；
The effect of initial layer network receives the Asynchronous Request from client；The effect at middle layer network is to use multitiered network
Topology saves structure to approach any continuous function, quickly can restrain normalizing in fit procedure as a result, and calculating using backpropagation
Method, Multilayer partition, mist algorithm, the handover network topology section structure between weak center and decentralization；
Asynchronous collator is for calling asynchronous sort algorithm and asynchronous execution, in asynchronous collator, client
Request newly added node terminates without waiting for previous node tasks, but carries out asynchronous communication by global flag mark；Respectively
Without being waited between task, but according to the information currently obtained from global flag mark, task section can be continually performed
Point and interruption obtain back end, and asynchronous sort algorithm avoids the synchronous communication expense between task；Asynchronous sort algorithm allows client
End lies over the response of current accounting nodes request, handles next accounting nodes request；Accounting nodes are performed, and can be put
It goes to execute in task queue, goes in task queue to have checked whether that accounting nodes need to be implemented after having executed, and will book keeping operation
Node, which is put into go to execute in execution stack, to be over and can remove in task queue the accounting nodes for checking whether execute, according to
Secondary circular test executes, and timer is arranged in asynchronous execution as state and changes trigger condition, until reaching common understanding；
Asynchronous collator passes through asynchronous sort algorithm, common recognition by each accounting nodes in each hinged node device
Algorithm is reached common understanding with distributed each accounting nodes, and generates the super node in accounting nodes and ordinary node；And by different
Step sort algorithm improves the accounting nodes speed generated in chain node apparatus and reaches in asynchronous collator between accounting nodes
At the speed of common recognition；The asynchronous sort algorithm that asynchronous collator provides is executed on each accounting nodes；Each role's chain link
Point carry out state change and its sequence, until each chain role node is reached common understanding；In asynchronous collator, all accounting nodes
It is all asynchronous execution, each accounting nodes are an asynchronous tasks；Node asynchronous on chain executes, without waiting for previous
A accounting nodes completion executes again；
Accounting nodes are divided by chain node apparatus: priority role's chain node, and second priority weighs role's chain node, coordinator angle
Color chain node, alternative people role's chain node；Chain node apparatus includes each accounting nodes；Super node in accounting nodes and common
Node is the division on another level, for being better than the whole connectivity of network, in the environment of non-full-mesh network, even
It can also be operated normally by super node in the system of network connection ratio < 50%；
Priority role's chain node: it is responsible for request of the processing from accounting nodes, manages generation, the Yi Jiyu of hash
Second priority weighs role's chain node and keeps asynchronous communication critical point monitoring, is distributed to the information such as other accounting nodes cryptographic Hash；Suboptimum
It first weighs role's chain node: being responsible for response and requested from priority role chain node, respond the choosing from coordinator role's chain node
Lift request；Coordinator role's chain node: it sends and is requested with sub-priority role chain node, while handling alternative successful candidate in the imperial examinations at the provincial level in the Ming and Qing dynasties's chain node
Election request；Alternative people role's chain node: the request with coordinator role's chain node is sent；All nodes are to coordinate when initial
Person role's chain node；Four role's chain nodes constitute role's chain node state machine and execute state turn according to different trigger conditions
Become, circuits sequentially, terminate until reaching common recognition；The selection plausibility function f (x) of each role's chain node is calculated with formula:
In above-mentioned publicity, i is integer, is indicated from 1 to countless big, M1, M2, M3..., MnEach role's chain node is represented, f is
Damping factor indicates that the role relation between chain node converts grade probability, it is a weight, wijWhat is indicated is j pairs of chain node
Chain node i weight distribution, i, j, n are positive integer；Wherein E (Mi) indicate each role's chain node M1, M2, M3..., MnPossible probability
Property set, f (i) and f (j) respectively indicate chain node i and a possibility that chain node j change, for calculating chain node j to chain link
Point i weight distribution wij；
Common recognition algorithm operating procedure based on asynchronous sort algorithm includes: initial phase, and the preparation stage executes the stage,
Confirmation stage completes the stage；Second priority weighs role's chain node and initiates to request to priority role's chain node, priority role's chain link
Point receives the request of second priority power role's chain node, can send to other second priority power role's chain node and prepare message, Qi Tajie
Point just has received preparation message, is prepared to enter into the preparation stage；When multiple second priority power role's chain link point enters any number of processing
In device, the sequence correlation for receiving the input message for having identification comprising second priority power role's chain node is related to accounting nodes
Value checks the sequence state of the sequence in shared sequence memory；Preparation stage determines whether input message is to maintain sequence
It, can be a kind of there are two types of selection after the sequence of message in column and next information node to be processed receive early-stage preparations message
It is to receive, one is do not receive；When message is sent, the symbol p and q in message are for indicating that in the message received before be identical
Label, symbol t and u in message will at this time refuse for indicating that in the message received before be different label
Message sends request；The logic of refusal is exactly that host node will not send two p and q having the same, but t and u is different disappears
Breath；If there are also the message of current all untreated sequence for processor, and if input message is confirmed as the next of sequence
Message to be processed then exists by the way that can be used in processor is outbound respectively then input message is transmitted to shared sequence memory
Reason device fetches the message, and to handle, node can send preparation stage message to other nodes after agreeing to request；If received super
The preparation stage message for crossing 3K different nodes, just representing the preparation stage has completed；If processor is being handled at least at present
The message of one sequence then restarts the preparation stage；The execution stage executes phase messages to other node broadcasts, similarly, this
A process may be to have i node also in progress；Confirmation stage receives the confirmation phase messages that other nodes are sent, when
After receiving 2i+1 confirmation message, represents most of nodes and come into confirmation stage；Ending phase, when most of nodes
Confirmation stage is completed, indicates that this stage has reached common understanding, then node carries out request, and data are written；If shared
Sequence memory has included the message to be processed of sequence；Or if input message be confirmed as, be not sequence it is next to
Processing message remain to be further processed then being stored in input message in the spilling memory of shared processor, finally until
Accounting nodes based on asynchronous sort algorithm are reached common understanding.
Beneficial achievement of the invention are as follows: the present invention provides the block chain common recognition systems based on asynchronous ordering techniques, by base
In the discrete block chain of random continuous by the common recognition algorithm ballot confirmation of conventional discrete type, upgrading is at continuous type grab sample, only
A part in all nodes is chosen to obtain one as a result, reciprocal more wheel samplings, realize all standing；When the result of grab sample
A confidence values are converged to, common recognition is reached；High based on the discrete common recognition algorithm security of random continuous, public property is strong.
The above is only the preferred embodiments of the invention, the claims that are not intended to limit the invention.Simultaneously
It is described above, for those skilled in the technology concerned it would be appreciated that and implement, therefore other be based on it is disclosed
The equivalent change that content is completed, should be included in the covering scope of the claims.
Claims (1)
- The system 1. the block chain based on asynchronous ordering techniques is known together, which is characterized in that include client, initial layer network, centre Layer network, asynchronous collator, chain node apparatus；The client will surpass when calling in asynchronous sort algorithm according to trigger condition, callbacks, critical point monitoring, state When these conditions be called；The effect of the initial layer network receives the Asynchronous Request from client；The effect at the middle layer network is to approach any continuous function with multitiered network topology section structure, can be in fit procedure Quickly restrain normalizing as a result, and using back-propagation algorithm, Multilayer partition, mist algorithm, weak center and decentralization it Between handover network topology section structure；The asynchronous collator includes and calls asynchronous sort algorithm, line asynchronous of going forward side by side communication and asynchronous execution, described different It walks in collator, client request newly added node terminates without waiting for previous node tasks, but passes through global flag Mark carries out asynchronous communication；It, can without being waited between each task, but according to the information currently obtained from global flag mark Back end is obtained to be continually performed task node and interrupt, asynchronous sort algorithm avoids the synchronous communication expense between task； Asynchronous sort algorithm lies over the response of current character chain node request by client, handles next role's chain node and asks It asks；Role's chain node is performed, and can be put into and be gone to execute in execution stack, goes to have checked whether angle in task queue after having executed Color chain node needs to be implemented, and role's chain node is put into execution stack to go to execute and is over and can go in task queue to check whether There is the role's chain node that can execute, circuit sequentially inspection and execute, timer is set in asynchronous execution and is turned as state Become trigger condition, until reaching common understanding；The asynchronous collator passes through asynchronous sort algorithm, base by each role's chain node in each hinged node device Reach common understanding in the common recognition algorithm of asynchronous sort algorithm with distributed each role's chain node, and generates super in role's chain node Grade node and ordinary node；And the speed of the generation of role's chain node in the chain node apparatus is improved by asynchronous sort algorithm The speed reached common understanding in asynchronous collator between role's chain node；Asynchronous sequence dress is executed on each role's chain node The asynchronous sort algorithm of offer is provided；Each role's chain link point carries out state change and its sequence, until each chain role node is reached Common recognition；In asynchronous collator, all role's chain nodes are all asynchronous executions, and each role's chain node is one asynchronous Task；Each role's chain node can regard the node on a chain as, and the node asynchronous on chain executes, without waiting for previous A role's chain node completion executes again；Role's chain node is divided by chain node apparatus: priority role's chain node, and second priority weighs role's chain node, coordinator role Chain node, alternative people role's chain node；The chain node apparatus includes each role's chain node；Super node in role's chain node With the division that ordinary node is on another level, for be better than network whole connectivity, in the environment of non-full-mesh network Under, in addition network connection ratio < 50% system in can also be operated normally by super node；Priority role's chain node: be responsible for processing from second priority power role's chain node request, manage hash generation, And asynchronous communication critical point monitoring is kept with second priority power role's chain node, it is distributed to the letter of other role's chain node cryptographic Hash Breath；Second priority weighs role's chain node: being responsible for response and requests from priority role chain node, response comes from coordinator role's chain link The election request of point；Coordinator role's chain node: it sends and is requested with sub-priority role chain node, while handling alternative successful candidate in the imperial examinations at the provincial level in the Ming and Qing dynasties's chain The election of node is requested；Alternative people role's chain node: the request with coordinator role's chain node is sent；All nodes are equal when initial For coordinator role's chain node；Four role's chain nodes constitute role's chain node state machine and execute shape according to different trigger conditions State transformation, circuits sequentially, terminates until reaching common recognition；The following formula meter of the selection plausibility function f (x) of each role's chain node It calculates:In above-mentioned publicity, i is integer, is indicated from 1 to countless big, M1, M2, M3..., MnRepresent the possibility probability of each role's chain node Property, f is damping factor, indicates that the role relation between chain node converts grade probability, it is a weight, wijWhat is indicated is chain link Point j is positive integer to chain node i weight distribution, i, j, n；Wherein E (Mi) indicate each role's chain node M1, M2, M3..., MnIt can The probabilistic set of energy, f (i) and f (j) respectively indicate a possibility that chain node i and chain node j variation, for calculating chain node j To chain node i weight distribution wij；Common recognition algorithm operating procedure based on asynchronous sort algorithm includes: initial phase, and the preparation stage executes stage, confirmation Stage completes the stage；Second priority weighs role's chain node and initiates to request to priority role's chain node, and priority role's chain link is checked and accepted To the request of second priority power role's chain node, it can be sent to other second priority power role's chain node and prepare message, other second priority Power role's chain node just has received preparation message, is prepared to enter into the preparation stage；Appoint when multiple second priority power role's chain link point enters In what multiple processor, sequence correlation and the angle of the input message for having identification comprising second priority power role's chain node are received Color chain node correlation checks the sequence state in shared sequence memory；Preparation stage, determine input message whether be in order to Maintain other second priority power role's chain node of message sequence in sequence and next message to be processed；Wherein coordinator role , can be there are two types of selection after chain link point receives early-stage preparations message, one is receiving, and one is do not receive；When message is sent, message In symbol p and q for indicating that in the message received before be identical label, the symbol t and u in message are for expression at it Before the message that receives be different label, at this time will refuse information send request；The logic of refusal is exactly priority angle Color chain node and second priority power role's chain node will not send two p and q having the same, but the message that t and u is different；Such as There are also the message of current all untreated sequence for fruit processor, and if input message is confirmed as the next to be processed of sequence Message, then input message is transmitted to shared sequence memory, then by can be used outbound point of processor to take in processor The message is returned, to handle, priority role's chain node is agreed to send to other second priority power role's chain node after requesting quasi- Standby phase messages；If receiving the preparation stage message more than 3K different nodes, just representing the preparation stage has been completed；If Processor in the message for handling at least one sequence, then restarts the preparation stage at present；The execution stage weighs to other second priority Role's chain node broadcasts execute phase messages, and similarly, this process may be to have i second priority power role's chain node also carrying out 's；Confirmation stage receives the confirmation phase messages that other second priority power role's chain nodes are sent, disappears when receiving 2i+1 confirmation After breath, represents most of other second priority power role's chain nodes and come into confirmation stage；Ending phase, when most of second priority Power role's chain node has completed confirmation stage, indicates that this stage has reached common understanding, and then alternative people role's chain node is just Request can be executed；If the shared sequence memory has included the message to be processed of sequence；Or if input message is true Be set to be not sequence next message to be processed, then input message is stored in the spilling memory of shared processor, It remains to be further processed, finally role's chain node during participation common recognitions all in asynchronous sort algorithm is reached common understanding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910298641.2A CN110033238A (en) | 2019-04-15 | 2019-04-15 | Block chain common recognition system based on asynchronous ordering techniques |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910298641.2A CN110033238A (en) | 2019-04-15 | 2019-04-15 | Block chain common recognition system based on asynchronous ordering techniques |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110033238A true CN110033238A (en) | 2019-07-19 |
Family
ID=67238394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910298641.2A Pending CN110033238A (en) | 2019-04-15 | 2019-04-15 | Block chain common recognition system based on asynchronous ordering techniques |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110033238A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109583903A (en) * | 2018-11-28 | 2019-04-05 | 杭州复杂美科技有限公司 | Block confirmation method, equipment and storage medium |
| CN111212124A (en) * | 2019-12-26 | 2020-05-29 | 山东公链信息科技有限公司 | Asynchronous sequencing technology for converting consensus into processing concurrent requests to asynchronous system |
| CN112540985A (en) * | 2020-12-07 | 2021-03-23 | 江苏赛融科技股份有限公司 | Global sequencing output system and method based on distributed computing framework |
-
2019
- 2019-04-15 CN CN201910298641.2A patent/CN110033238A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109583903A (en) * | 2018-11-28 | 2019-04-05 | 杭州复杂美科技有限公司 | Block confirmation method, equipment and storage medium |
| CN109583903B (en) * | 2018-11-28 | 2020-12-11 | 杭州复杂美科技有限公司 | Block confirmation method, equipment and storage medium |
| CN111212124A (en) * | 2019-12-26 | 2020-05-29 | 山东公链信息科技有限公司 | Asynchronous sequencing technology for converting consensus into processing concurrent requests to asynchronous system |
| CN111212124B (en) * | 2019-12-26 | 2022-12-13 | 山东公链信息科技有限公司 | Asynchronous sequencing system for converting consensus into processing concurrent requests to asynchronous system |
| CN112540985A (en) * | 2020-12-07 | 2021-03-23 | 江苏赛融科技股份有限公司 | Global sequencing output system and method based on distributed computing framework |
| CN112540985B (en) * | 2020-12-07 | 2023-09-26 | 江苏赛融科技股份有限公司 | Global ordering output system and method based on distributed computing framework |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110033238A (en) | Block chain common recognition system based on asynchronous ordering techniques | |
| CN106533935B (en) | A kind of method and apparatus obtaining business chain information in cloud computing system | |
| US5819299A (en) | Process for distributed garbage collection | |
| CN110138596A (en) | A kind of block chain common recognition method based on handover network topology mode | |
| CN112600759B (en) | Multipath traffic scheduling method and system based on deep reinforcement learning under Overlay network | |
| CN102904794A (en) | Method and device for mapping virtual network | |
| JP5741150B2 (en) | Relay device, relay program, and relay method | |
| CN107992359A (en) | The task scheduling algorithm that cost perceives under a kind of cloud environment | |
| WO2023216489A1 (en) | Computing power network node evaluation and operation method and apparatus | |
| CN103297390A (en) | Method for enabling server to be connected with client-sides reversely | |
| CN108228363A (en) | A kind of message method and device | |
| CN105637485B (en) | A kind of deadlock detection method suitable for generalized model | |
| CN109445921A (en) | A kind of distributed data task processing method and device | |
| CN108347379A (en) | Based on the centrally stored content center network method for routing in region | |
| CN105721293B (en) | A kind of adaptive competing method of Master gateway based on Alljoyn agreement | |
| US20020133532A1 (en) | Methods and devices for selecting internet servers | |
| CN104410698B (en) | Initiation node abnormality eliminating method and device under a kind of share nothing cluster | |
| CN108718335A (en) | A kind of load-balancing method, device, Web server and storage medium | |
| CN114710798A (en) | Fault positioning method and device | |
| CN106874371A (en) | A kind of data processing method and device | |
| CN111242643B (en) | Real-time updating system for manufacturing service information of miniature annular part | |
| CN107979627A (en) | A kind of processing method and processing device of network request | |
| CN109787836A (en) | Based on the determination method and device of the VNF scheduling scheme of genetic algorithm | |
| CN116546025B (en) | Cloud computing-based edge data management system | |
| CN107426728A (en) | High-performance access authentication processing method, system, controller equiment, network device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190719 |
|
| WD01 | Invention patent application deemed withdrawn after publication |