CN109660545A - A Consortium Chain Consensus Method and Computer Storage Medium - Google Patents
A Consortium Chain Consensus Method and Computer Storage Medium Download PDFInfo
- Publication number
- CN109660545A CN109660545A CN201811611199.6A CN201811611199A CN109660545A CN 109660545 A CN109660545 A CN 109660545A CN 201811611199 A CN201811611199 A CN 201811611199A CN 109660545 A CN109660545 A CN 109660545A
- Authority
- CN
- China
- Prior art keywords
- node
- common recognition
- white list
- request
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000003860 storage Methods 0.000 claims abstract description 15
- 230000007246 mechanism Effects 0.000 claims description 19
- 238000012545 processing Methods 0.000 claims description 17
- 238000012795 verification Methods 0.000 claims description 5
- 235000013399 edible fruits Nutrition 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 10
- 230000008569 process Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 5
- 238000005070 sampling Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 241001269238 Data Species 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000003313 weakening effect Effects 0.000 description 1
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/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/0876—Network architectures or network communication protocols for network security for authentication of entities based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
-
- 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/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Small-Scale Networks (AREA)
Abstract
The embodiment of the invention provides a alliance chain consensus method and a computer storage medium, which comprises the steps of firstly sending a white list acquisition request to a management node of an alliance chain so as to request the management node to acquire a node white list according to the white list acquisition request; then receiving a node white list returned by the management node, and randomly selecting an identification of the consensus node from the node white list according to a set node selection rule; sending a consensus request of block data to the consensus node according to the identification of the consensus node; and receiving the consensus information returned by the consensus node, judging whether consensus is achieved according to the consensus information, and acquiring consensus result data. And finally judging whether the block data are successfully identified or not according to the acquired identification result data of the first set number by circularly executing the steps of the first set number. By randomly selecting the consensus nodes in multiple rounds, the complexity of communication between the consensus nodes in the consensus process can be controlled, and the influence of malicious nodes on the consensus result can be reduced.
Description
Technical field
The present embodiments relate to field of computer technology more particularly to a kind of alliance's chain common recognition method and computer storages
Medium.
Background technique
Block chain is that the computers such as Distributed Storage, point-to-point transmission, common recognition mechanism, Encryption Algorithm are utilized in one kind
The new application mode of technology.Block chain is divided into three classes, and is respectively: publicly-owned chain, alliance's chain (also referred to as joint block chain, industry area
Block chain) and three kinds of privately owned chain.Wherein, publicly-owned chain is directed to owner；Alliance's chain be directed to some specific group and
Limited third party；Private chain is directed to individual.
Wherein, the node of alliance's chain has stronger safety and performance guarantee than the node of publicly-owned chain, handles up to meet height
Amount, the demand of low power consuming, many alliances chain is often used practical Byzantine failure tolerance algorithm (PBFT, Practical at present
Byzantine Fault Tolerance) reach common understanding, it can be achieved that quickly generate new block, reach the second grade of not bifurcated
Common recognition.Under this common recognition mechanism, needs to elect a host node by alliance's chain whole node, needing to generate new block
When, it is responsible for generating new block by the host node.Once host node election occurs, main period is being selected to will be unable to normally know together, and
The complexity for the communication known together between node reaches O (n^2), and number of nodes is more, and common recognition efficiency decline is more obvious.
Summary of the invention
In view of this, one of the technical issues of embodiment of the present invention is solved be to provide a kind of alliance's chain common recognition method and
Computer storage medium, to overcome in the prior art when alliance's chain number of nodes is more, what is communicated between node of knowing together disappears
The problem of it is too high to cease complexity, common recognition efficiency is caused to reduce.
The embodiment of the present invention provides a kind of alliance's chain common recognition method, comprising:
The management node of white list acquisition request to alliance's chain is sent, to request the management node according to the white list
Acquisition request sending node white list, wherein include that can all carry out block data in alliance's chain to be total in the node white list
The mark of the node of knowledge；
The node white list that the management node returns is received, and according to the node selection of setting rule, from described
The mark of common recognition node is randomly selected in node white list；
According to the mark of the common recognition node, the common recognition request of block data is sent to the common recognition node；
The consensus information that the common recognition node returns is received, and is judged whether according to the consensus information for the common recognition
Request is reached common understanding, and common recognition result data is obtained, wherein the consensus information includes common recognition of the common recognition node according to setting
Processing result of the mechanism to the common recognition request；
The step of executing the management node for sending white list acquisition request to alliance's chain is returned, is set until obtaining first
The common recognition result data of fixed number amount；
According to the common recognition result data of the first setting quantity, judge whether the block data knows together success.
Other side according to an embodiment of the present invention, additionally provides a kind of computer storage medium, and the computer is deposited
It is stored in storage media:
For sending the management node of white list acquisition request to alliance's chain, to request the management node according to described white
The instruction of list acquisition request sending node white list, wherein include that can all be carried out in alliance's chain in the node white list
The mark of the node of block data common recognition；
The node white list returned for receiving the management node, and it is regular according to the node selection of setting, from
The instruction of the mark of common recognition node is randomly selected in the node white list；
For the mark according to the common recognition node, the finger of the common recognition request of block data is sent to the common recognition node
It enables；
The consensus information returned for receiving the common recognition node, and judged whether according to the consensus information for described
Common recognition request is reached common understanding, and the instruction of common recognition result data is obtained, wherein the consensus information include the common recognition node according to
Processing result of the common recognition mechanism of setting to the common recognition request；
For returning to the step of executing the management node for sending white list acquisition request to alliance's chain, until obtaining the
The instruction of the common recognition result data of one setting quantity；
For the common recognition result data according to the first setting quantity, judge whether the block data knows together into
The instruction of function.
By above technical scheme as it can be seen that alliance's chain common recognition scheme of the embodiment of the present invention is being needed newly-generated block counts
When according to carrying out out block cochain, first transmission white list acquisition request to alliance's chain management node, with request management node according to
White list acquisition request sending node white list；Then the node white list that management node returns is received, and according to the section of setting
Point selection rule, randomly selects the mark of common recognition node from node white list；According to the mark of common recognition node, Xiang Gongshi node
Send the common recognition request of block data；The consensus information that common recognition node returns is received, and judges whether to reach according to consensus information
Common recognition obtains common recognition result data.The above-mentioned steps that the first setting quantity is executed by circulation, according to the first of acquisition the setting number
The common recognition result data of amount finally judges whether block data knows together success.It can be seen that when can all carry out area in alliance's chain
When block number is excessive according to the number of nodes of common recognition, the present invention can only can carry out the node of block data common recognition to the part randomly selected
Common recognition request is sent, the complexity of inter-node communication during common recognition is controlled；And common recognition node can be carried out by more rounds
Randomly select and send common recognition request, finally according to more rounds obtain common recognition result data judge the common recognition to block data
Whether succeed, to reduce influence of the malicious node to common recognition result.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The some embodiments recorded in inventive embodiments can also obtain according to these attached drawings for those of ordinary skill in the art
Take other attached drawings.
Fig. 1 shows the flow chart of alliance's chain common recognition method of the embodiment of the present invention one.
Fig. 2 shows the flow charts of alliance's chain of the embodiment of the present invention two common recognition method.
Specific embodiment
In order to make those skilled in the art more fully understand the technical solution in the embodiment of the present invention, below in conjunction with the present invention
Attached drawing in embodiment, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described reality
Applying example only is a part of the embodiment of the embodiment of the present invention, instead of all the embodiments.Based on the implementation in the embodiment of the present invention
, the range of protection of the embodiment of the present invention all should belong in every other embodiment acquired in those of ordinary skill in the art.
Below with reference to attached drawing of the embodiment of the present invention the embodiment of the present invention will be further explained specific implementation.
Embodiment one
Fig. 1 shows the flow chart of alliance's chain common recognition method of the embodiment of the present invention one.Such as Fig. 1, implementation of the invention
Example alliance's chain common recognition method the following steps are included:
Step S101: the management node of white list acquisition request to alliance's chain is sent, to request management node according to white name
Single acquisition request sending node white list, wherein include that can all carry out block data common recognition in alliance's chain in node white list
Node mark.
In the present embodiment, since alliance's chain is directed to some specific group and limited third party, there are accesses
Mechanism, the manager of alliance's chain can be carried out access by whole nodes of at least management node to alliance's chain, common recognition permission, gone out
The management of block permission etc., therefore block data common recognition can be carried out from inquiring or being obtained in alliance's chain from management node
Range of nodes and producible block data and the range of nodes for carrying out out block cochain.For example, node is when coalizing chain,
Need put on record to alliance chain manager first, i.e., need to submit registration formality, manager after the approval just can in management node incite somebody to action
Associated rights are arranged at alliance's chain node in the Node registry, thus the chain that coalizes.
In the present embodiment, due in alliance's chain, only when the node that can carry out block data common recognition is total to block data
After knowing successfully, newly-generated block data can just be carried out out block cochain by requesting node, therefore need will be newly-generated for requesting node
Block data when carrying out out block cochain, white list acquisition request can be sent first to management node, with request from management node
Obtain the node white list that block data common recognition can be carried out in alliance's chain, and then all or part of section into node white list
Point initiates the common recognition request of block data, to know together to block data.
Optionally, node white list is used to determine the node model that block data common recognition currently can be all carried out in alliance's chain
It encloses, it may include the mark of the node of block data common recognition can be all carried out in alliance's chain.Since the node in alliance's chain can dynamic
It is added or exits, the range of nodes that different time points can carry out block data common recognition may change, therefore manage section
Point can be added or exit situation according to the node in alliance's chain, carry out real-time update to node white list.
Step S102: the node white list that management node returns is received, and according to the node selection of setting rule, from node
The mark of common recognition node is randomly selected in white list.
In the present embodiment, when the number of nodes that can all carry out block data common recognition in alliance's chain is excessive, such as to whole
The node that can carry out block data common recognition, which sends the common recognition of block data, requests to may cause that inter-node communication complexity is high to ask
Topic influences efficiency of knowing together, therefore can be according to the node selection rule of setting, and part is only selected from node white list to carry out
The node of block data common recognition is used as common recognition node, only requests to carry out by common recognition of the common recognition node to block data in subsequent step
Processing, to reduce inter-node communication complexity.
Optionally, node selection rule is at least used to determine the quantity of common recognition node, to control in subsequent step to block
When the common recognition request of data is handled, inter-node communication complexity of knowing together.In practical applications, node selection rule is unlimited,
It can be according to the factors sets itself such as Project Realization demand, network environment, hardware performance.
In the present embodiment, malicious node prejudges sampling results in order to prevent, thus start DDOS attack that common recognition is caused to fail,
The mark that random sampling algorithm randomly selects common recognition node from node white list can be used.The type of random sampling algorithm is not
Limit, in practical applications can sets itself according to demand.
Optionally, in order to guarantee the reliability communicated, random sampling algorithm need to be deployed to each requesting node in advance and can
In the node for carrying out block data common recognition, so that can determine whether itself after common recognition node receives common recognition request in the next steps
Whether be the taking-up according to selected by random sampling algorithm node, with carry out common recognition request authenticity verification.
Step S103: according to the mark of common recognition node, Xiang Gongshi node sends the common recognition request of block data.
In the present embodiment, it may also include the address of node letter that can all carry out block data common recognition in node white list
Breath, so that the common recognition that can send block data according to common recognition address of node information is requested to this after selecting common recognition node
Common recognition node.For example, if the corresponding address information of node each in alliance's chain is distributed into the mark of the node by management node,
Then the corresponding address information of common recognition node can be obtained directly by reading the mark of common recognition node.
In the present embodiment, common recognition request is for requesting common recognition node to execute common recognition processing according to the common recognition mechanism of setting, altogether
It is unlimited to know information and format included in request, can be set in practical applications according to the selected common recognition mechanism of alliance's chain
It is fixed.
Step S104: the consensus information that common recognition node returns is received, and judges whether to ask for common recognition according to consensus information
Ask and reach common understanding, obtain common recognition result data, wherein consensus information include common recognition node according to the common recognition mechanism of setting to common recognition
The processing result of request.
In the present embodiment, due in practical applications, may each common recognition node can be according to common recognition mechanism to received
Common recognition request is handled, and returns to consensus information, it is therefore desirable to just may be used according to the consensus information that all common recognition node is returned
Determine all whether common recognition node reaches common understanding for the common recognition request that epicycle is sent, and obtains common recognition result data.Wherein, altogether
Know result data and be at least used for the common recognition request that recording needle sends epicycle, nodes of all knowing together are reached common understanding or do not reached altogether
Know.
Step S105: returning to the step of executing the management node for sending white list acquisition request to alliance's chain, until obtaining
The common recognition result data of first setting quantity.
In the present embodiment, due to common recognition result data be only according to common recognition node to common recognition request handle it is acquired
Data, common recognition node may be only a part that can be carried out in the node of block data common recognition, if common recognition node is all or big
If part belongs to malicious node, it is possible to will lead to common recognition failure, therefore in order to reduce malicious node to common recognition success rate
Influence, can carry out more take turns common recognition nodes randomly selects and sends common recognition request, i.e., first set quantity is more than or equal to
2, so that the node for carrying out block data common recognition that different rounds are handled common recognition request according to the common recognition mechanism of setting
There are difference for range, so that the final common recognition result datas obtained according to more wheels determine whether block data knows together success.
Specifically, the wheel for randomly selecting and sending common recognition request of common recognition node can be set for by the first setting quantity
Sub-quantity, to obtain the common recognition result data of the first setting quantity.For the angle of probability theory, the first setting quantity is bigger,
The probability that then malicious node causes common recognition to fail is also lower, but when will increase block data and entirely knowing together spent by process
Between, therefore the first setting number can be set according to factors such as Project Realization demand, network environment, hardware performances in practical applications
Amount.
In the present embodiment, as time goes by, the node white list in management node may change, i.e.,
The range of nodes that block data common recognition can currently be carried out may change, selection when executing step S103 again to reduce
Out with the probability of last round of identical common recognition range of nodes, the acquired common recognition knot during the whole common recognition to block data
When fruit data times are not up to the first setting quantity, after obtaining primary common recognition result data, it can return again to and execute step S101,
Again to the newest node white list of management node request.
Step S106: according to the common recognition result data of the first setting quantity, judge whether block data knows together success.
In the present embodiment, common recognition result judgement rule can be first set according to engineering demand or application scenarios in practical applications
Then, thus after the common recognition result data that acquisition first sets quantity, block data is judged using common recognition result judgment rule
Whether common recognition is successful.
For example, common recognition result judgment rule can be set as " if more than or equal to recording in 60% common recognition result data
Reach common understanding, then success of knowing together ", if to 10 common recognition result datas are obtained during the whole common recognition of block data,
It wherein has recorded and reaches common understanding in the common recognition result data of 8 acquisitions, have recorded in the common recognition result data of 2 acquisitions and do not reach
Common recognition, the ratio reached common understanding be 80%, be greater than 60%, then according to common recognition result judgment rule can determine block data common recognition at
Function.
By the above embodiment of the present invention as it can be seen that when requesting node is needing to carry out newly-generated block data in the present invention
Out when block cochain, the management node of white list acquisition request to alliance's chain is sent, first to request management node according to white list
Acquisition request sending node white list；Then the node white list that management node returns is received, and according to the node selection of setting
Rule randomly selects the mark of common recognition node from node white list；According to the mark of common recognition node, Xiang Gongshi node sends area
The common recognition of block number evidence is requested；The consensus information that common recognition node returns is received, and judges whether to reach common understanding according to consensus information, is obtained
Take common recognition result data.The above-mentioned steps that the first setting quantity is executed by circulation, according to being total to for the first of acquisition the setting quantity
Know result data, finally judges whether block data knows together success.It can be seen that when can all carry out block data in alliance's chain
When the number of nodes of common recognition is excessive, the present invention can only be sent altogether to the node that the part randomly selected can carry out block data common recognition
Know request, controls the complexity of inter-node communication during common recognition；And the random of common recognition node can be carried out by more rounds
Choose and send common recognition request, finally according to the common recognition result data that more rounds obtain judge to the common recognition of block data whether at
Function, to reduce influence of the malicious node to common recognition result.
Embodiment two
Fig. 2 shows the flow charts of alliance's chain of the embodiment of the present invention two common recognition method.As shown in Fig. 2, of the invention
Embodiment alliance's chain common recognition method the following steps are included:
Step S201: the management node of white list acquisition request to alliance's chain is sent, to request management node according to white name
Single acquisition request makes requests the authentication of node, if the verification passes, then to requesting node sending node white list.
In the present embodiment, in order to ensure communication safety, the relevant information of alliance's chain node is avoided to be leaked, management node exists
After the white list acquisition request for receiving requesting node transmission, authentication can be carried out to requesting node first, only verifying is logical
Later, just node white list can be sent to requesting node.
Optionally, management node can be each node allocation identification in alliance's chain, to not according to the mark rule of setting
It is distinguished with node, and the mark for the node that can all carry out block data common recognition in alliance's chain is stored to node white list
In.
Optionally, management node can be by parsing white list acquisition request, and acquisition is used for the information of identification request node, from
And according to the information for identification request node, authentication is carried out to requesting node.For example, authentication may include that judgement is asked
Ask whether node belongs to the node being admitted into or whether requesting node belongs to producible block data and carry out out block cochain
Node.
Optionally, due at least will record node in management node to the node for being managed node access in alliance's chain
Address information, for example, can record the I P address of whole nodes and port in alliance's chain in management node.In order to reduce data
The corresponding address information of node each in alliance's chain can be assigned as the mark of the node by amount of storage, management node.It is corresponding, it is white
It may include the address information of requesting node in list acquisition request, management node, can basis after receiving white list acquisition request
The address information for parsing requesting node acquired in white list acquisition request carries out authentication to requesting node.
Optionally, in order to reduce the complexity of alliance's catenary system node permission, can will have common recognition permission and out block power
The range of nodes of limit is arranged to identical range of nodes, i.e., the node that block data common recognition can be carried out in alliance's chain produces area
Block number evidence simultaneously carries out out block cochain, and it is total that producible block data and the node for carrying out out block cochain also can carry out block data
Know.Therefore, if requesting node has block permission, also there is common recognition permission, i.e., will include and ask in node white list
Seek the mark of node.It is corresponding, step S201 can include:
The management node of white list acquisition request to alliance's chain is sent, to request management node parsing white list acquisition to be asked
It asks, the mark of acquisition request node, and judges the identifying whether in node white list of requesting node, if it is, to request
Node sending node white list.
Optionally, in order to improve the decentralization degree of alliance's chain, and the data processing amount of management node is reduced, management section
Point can be not involved in subsequent step, i.e., do not include the mark of management node in node white list.
Step S202: the node white list that management node returns is received, and according to the node selection of setting rule, from node
The mark of common recognition node is randomly selected in white list.
In the present embodiment, when the number of nodes that can all carry out block data common recognition in alliance's chain is less, such as still carry out
If the common recognition node selection of more rounds, it is possible to the selected common recognition range of nodes taken out of different rounds occur and be completely coincident
The phenomenon that, cause the common recognition result data repeatedly obtained in subsequent step identical, i.e., with a batch common recognition node to identical
Common recognition request repeats common recognition processing, reduces common recognition efficiency instead.Therefore in order to avoid aforementioned phenomenon, step S202 can be wrapped
Enclosed tool step S202a~S202c:
Sub-step S202a: determine that the node that block data common recognition can be all carried out in alliance's chain is total according to node white list
Amount, and judge whether node total amount is greater than the second setting quantity.
Specifically, the common recognition number of nodes that every wheel participates in processing common recognition request is more, then malice due to for theoretically
It is lower that node influences a possibility that common recognition result, but the traffic between node can increase significantly, therefore can pass through the second setting
Quantity determines every common recognition number of nodes upper limit taken turns and randomly selected out, and can further be determined and be carried out according to the second setting quantity
The wheel sub-quantity for randomly selecting and sending common recognition request of common recognition node.
Optionally, in order to which under the premise of guaranteeing alliance's chain overall operation efficiency, selection common recognition node as much as possible can
According to the network environment and/or hardware performance of the node that can all carry out block data common recognition in alliance's chain, the second setting is determined
Quantity.
Optionally, the mark number for the node for carrying out block data common recognition for including in parsing node white list can be passed through
Amount obtains node total amount；Or judge the node total amount for whether having counted and having recorded including management node in node white list, such as
Fruit is that node total amount is then read directly from white list.
Sub-step S202b: if it is, randomly selecting the mark of the second setting quantity from node white list as common recognition
The mark of node.
Specifically, when node total amount is greater than the second setting quantity, then shows can at least to select two and different be total to
Range of nodes is known, to carry out the common recognition request processing of at least two-wheeled block data.
Optionally, due to the integer-bit according to node total number divided by the value of the second setting quantity, it may be determined that can choose altogether
It is complete to carry out the common recognition range of nodes that common recognition request is handled if necessary to every wheel for how many entirely different common recognition range of nodes out
It is complete different, the node that can carry out block data common recognition can be divided into how many group altogether in alliance's chain.Therefore, in order to allow in alliance's chain
The node that can carry out block data common recognition at least participates in the common recognition request processing of a wheel block data, can be according to node total number and the
Two setting quantity, determine the first setting quantity, wherein the value of the first setting quantity is more than or equal to node total number divided by second
Set the value of quantity.
Sub-step S202c: if it is not, then mark of whole marks as common recognition node in node white list is chosen, and
First setting quantity is adjusted to 1.
Specifically, when node total amount is less than the second setting quantity then showing that being total to for the second setting quantity can not be selected
Know node；When node total amount is equal to the second setting quantity, then the common recognition node selected every time is just whole in alliance's chain
It can carry out the node of block data common recognition.Therefore in these cases, without more rounds carry out common recognition node randomly select and
Common recognition request is sent, the node by can all carry out block data common recognition in alliance's chain carries out the processing of a wheel common recognition request i.e.
It can.Further, since the first setting quantity is used to be set for the wheel number for randomly selecting and sending common recognition request of common recognition node
Amount, thus also it is corresponding need to by first set quantity be adjusted to 1.
In the present embodiment, when the node total amount that can all carry out block data common recognition in alliance's chain is greater than the second setting quantity
When, if it is every wheel be all made of random algorithm chosen from the node that can all carry out block data common recognition know together node if,
Node total amount and the second setting quantity are closer, and the identical probability of common recognition range of nodes that front and back two-wheeled randomly selects out is got over
It is high.Therefore identical least for the common recognition range of nodes for avoiding continuous two-wheeled from selecting, when node total amount is more than or equal to the
When two settings twice of quantity, the common recognition node selected can be marked, i.e., the mark addition of common recognition node selected
Take label.
Corresponding, step S202 may also include sub-step S202d~S202e:
Sub-step S202d: according to label has been chosen, screening the mark of the node in node white list, obtains not
The mark of the node of label has been chosen in addition.
Sub-step S202e: from being not added in the mark for having chosen the node of label, the mark of common recognition node is randomly selected.
Step S203: according to the mark of common recognition node, Xiang Gongshi node sends the common recognition request of block data.
Step S204: the consensus information that common recognition node returns is received, and whether is judged whether according to consensus information for altogether
Know request to reach common understanding, obtain common recognition result data, wherein consensus information includes common recognition mechanism pair of the common recognition node according to setting
The processing result of common recognition request.
Step S205: returning to the step of executing the management node for sending white list acquisition request to alliance's chain, until obtaining
The common recognition result data of first setting quantity.
Step S206: according to the common recognition result data of the first setting quantity, the number reached common understanding is determined；Judgement is reached altogether
Whether the number of knowledge is more than or equal to third setting quantity, if it is, knowing together successfully.
In the present embodiment, third setting quantity is for limiting the number minimum reached common understanding.In order to guarantee common recognition safety,
The common recognition mechanism that can be selected according to alliance's chain, determines the permitted normal node accounting minimum of common recognition mechanism fault tolerant secure,
Then determine that third sets quantity according to permitted normal node accounting minimum, i.e., third setting quantity is divided by the first setting
The value of quantity is more than or equal to permitted normal node accounting minimum.
Optionally, the common recognition mechanism set is practical Byzantine failure tolerance algorithm, since the present embodiment is sent out by requesting node
Play common recognition request, there is no need to carry out the election of host node, therefore avoid occurring selecting practical Byzantine failure tolerance algorithm of main period without
The case where method is normally known together.
Further, since the normal operation of practical Byzantine failure tolerance algorithm needs at least four common recognition node, and fault tolerant secure
Allow malicious node accounting total on alliance's chain less than 1/3, i.e., normal node accounting is more than or equal to 2/3, therefore corresponding,
The second setting quantity can be set more than or equal to 4, third sets quantity and is more than or equal to divided by the value of the first setting quantity
2/3。
Step S207: if known together successfully, by block data cochain, simultaneously the whole network broadcasts block data in alliance's chain
Data information.
In the present embodiment, if known together successfully, requesting node can cochain be simultaneously in alliance's chain by corresponding block data
The data information broadcast of block data is carried out to alliance's chain whole node, wherein can be block data distribution pair by management node
The mark answered, to guarantee data consistency.
By the above embodiment of the present invention as it can be seen that management node can make requests section according to white list acquisition request in the present invention
The authentication of point, if the verification passes, Cai Huixiang requesting node sending node white list, it is ensured that communication security avoids joining
The relevant information of alliance's chain node is leaked；The common recognition number of nodes that every wheel randomly selects out can be limited by setting the second setting quantity
The upper limit is measured, common recognition is requested to carry out the communication complexity between the common recognition node of common recognition processing to control every wheel；It is set according to second
Fixed number amount determines the first setting quantity, so that the number of nodes that no matter can all carry out block data common recognition in alliance's chain is more
It is few, it can efficiently complete the common recognition of block data；Label has been chosen by the mark addition to common recognition node, can avoid continuous two
It is identical to take turns the common recognition range of nodes selected, is successfully influenced with weakening malicious node to common recognition.
Embodiment three
The embodiment of the invention also provides a kind of computer storage medium, it is stored in computer storage medium:
For sending the management node of white list acquisition request to alliance's chain, to request management node to be obtained according to white list
Request the instruction of sending node white list, wherein include that can all carry out block data common recognition in alliance's chain in node white list
Node mark；
For receiving the node white list of management node return, and according to the node selection of setting rule, from the white name of node
The instruction of the mark of common recognition node is randomly selected in list；
For the mark according to common recognition node, Xiang Gongshi node sends the instruction of the common recognition request of block data；
The consensus information returned for receiving common recognition node, and judge whether to reach for common recognition request according to consensus information
Common recognition, obtain common recognition result data instruction, wherein consensus information include common recognition node according to the common recognition mechanism of setting to common recognition
The processing result of request；
For returning to the step of executing the management node for sending white list acquisition request to alliance's chain, set until obtaining first
The instruction of the common recognition result data of fixed number amount；
For the common recognition result data according to the first setting quantity, judge whether block data knows together successful instruction.
Optionally, further includes: for sending the management node of white list acquisition request to alliance's chain, to request management node
The authentication of node is made requests according to white list acquisition request, it is if the verification passes, then white to requesting node sending node
The instruction of list.
Optionally, further includes: block data common recognition can be all carried out in alliance's chain for determining according to node white list
Node total amount, and judge whether node total amount is greater than the instruction of the second setting quantity；
For if it is, randomly selecting mark of the mark of the second setting quantity as common recognition node from node white list
The instruction of knowledge；
For if it is not, then choose marks of whole marks as node of knowing together in node white list, and first is set
Fixed number amount is adjusted to 1 instruction.
Optionally, further includes: for the network environment according to the node that can all carry out block data common recognition in alliance's chain
And/or hardware performance, determine the instruction of the second setting quantity.
Optionally, further includes: for determining the first setting quantitative directive according to node total number and the second setting quantity,
In, the value of the first setting quantity is more than or equal to the value that node total number sets quantity divided by second.
Optionally, further includes: for the common recognition result data according to the first setting quantity, determine the number reached common understanding,
And judge whether the number reached common understanding is more than or equal to the instruction of third setting quantity, if it is, knowing together successfully.
Optionally, the common recognition mechanism set is corresponding as practical Byzantine failure tolerance algorithm, second setting quantity be greater than or
Equal to 4, third sets quantity and is more than or equal to 2/3 divided by the value of the first setting quantity.
Optionally, further includes: for being screened to the mark of the node in node white list according to label has been chosen,
Obtain the instruction for being not added with the mark for the node for having chosen label；
For root from being not added in the mark for having chosen the node of label, the instruction of the mark of common recognition node is randomly selected.
It optionally, does not include the mark of management node in node white list.
Corresponding alliance chain in aforesaid plurality of embodiment of the method may be implemented in computer storage medium through this embodiment
Common recognition method, and the beneficial effect with correlation method embodiment, details are not described herein.
It may be noted that all parts/step described in the embodiment of the present invention can be split as more according to the needs of implementation
The part operation of two or more components/steps or components/steps can also be combined into new component/step by multi-part/step
Suddenly, to realize the purpose of the embodiment of the present invention.
It is above-mentioned to be realized in hardware, firmware according to the method for the embodiment of the present invention, or be implemented as being storable in note
Software or computer code in recording medium (such as CD ROM, RAM, floppy disk, hard disk or magneto-optic disk), or it is implemented through net
The original storage of network downloading in long-range recording medium or nonvolatile machine readable media and will be stored in local recording medium
In computer code, so that method described herein can be stored in using general purpose computer, application specific processor or can compile
Such software processing in journey or the recording medium of specialized hardware (such as ASIC or FPGA).It is appreciated that computer, processing
Device, microprocessor controller or programmable hardware include can store or receive software or computer code storage assembly (for example,
RAM, ROM, flash memory etc.), when the software or computer code are by computer, processor or hardware access and execute, realize
Alliance's chain common recognition method described herein.In addition, when general purpose computer accesses for realizing the chain common recognition side, alliance being shown here
When the code of method, the execution of code, which is converted to general purpose computer, is used to execute the dedicated of the alliance's chain common recognition method being shown here
Computer.
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 method and step 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 range of the embodiment of the present invention.
Embodiment that the above embodiments are only used to illustrate the present invention, and the limitation not to the embodiment of the present invention, related skill
The those of ordinary skill in art field can also make various in the case where not departing from the spirit and scope of the embodiment of the present invention
Variation and modification, therefore all equivalent technical solutions also belong to the scope of the embodiment of the present invention, the patent of the embodiment of the present invention
Protection scope should be defined by the claims.
Claims (10)
- A kind of method 1. alliance's chain is known together characterized by comprisingThe management node of white list acquisition request to alliance's chain is sent, to request the management node to obtain according to the white list Request sending node white list, wherein include that can all carry out block data common recognition in alliance's chain in the node white list The mark of node；The node white list that the management node returns is received, and according to the node selection of setting rule, from the node The mark of common recognition node is randomly selected in white list；According to the mark of the common recognition node, the common recognition request of block data is sent to the common recognition node；The consensus information that the common recognition node returns is received, and judges whether to request for the common recognition according to the consensus information Reach common understanding, obtain common recognition result data, wherein the consensus information includes common recognition mechanism of the common recognition node according to setting To the processing result of the common recognition request；The step of executing the management node for sending white list acquisition request to alliance's chain is returned to, until obtaining the first setting number The common recognition result data of amount；According to the common recognition result data of the first setting quantity, judge whether the block data knows together success.
- 2. the method according to claim 1, wherein described send the management of white list acquisition request to alliance's chain Node, to request the management node to include: according to the white list acquisition request sending node white listThe management node of the white list acquisition request to alliance's chain is sent, to request the management node according to described white List acquisition request makes requests the authentication of node, if the verification passes, then to the white name of requesting node sending node It is single.
- 3. the method according to claim 1, wherein the node selection according to setting is regular, from the section Point white list in randomly select common recognition node mark include:The node total amount that block data common recognition can be all carried out in alliance's chain is determined according to the node white list, and described in judgement Whether node total amount is greater than the second setting quantity；If it is, randomly selecting mark of the mark of the second setting quantity as common recognition node from the node white list；If it is not, then choosing mark of whole marks as common recognition node in the node white list, and described first is set Fixed number amount is adjusted to 1.
- 4. according to the method described in claim 3, it is characterized in that, the method also includes:According to the network environment and/or hardware performance of the node that can all carry out block data common recognition in alliance's chain, determine described in Second setting quantity.
- 5. according to the method described in claim 3, it is characterized in that, the method also includes:According to the node total number and the second setting quantity, the first setting quantity is determined, wherein first setting The value of quantity is more than or equal to the node total number divided by the value of the second setting quantity.
- 6. according to the method described in claim 3, it is characterized in that, the common recognition knot according to the first setting quantity Fruit data, judging whether the block data knows together successfully includes:According to the common recognition result data of the first setting quantity, the number reached common understanding is determined；Whether the number reached common understanding described in judgement is more than or equal to third setting quantity, if it is, knowing together successfully.
- 7. according to the method described in claim 6, it is characterized in that, the common recognition mechanism set is calculated as practical Byzantine failure tolerance Method, corresponding, the second setting quantity is more than or equal to 4, and the third setting quantity is divided by the first setting quantity Value be more than or equal to 2/3.
- 8. the method according to claim 1, wherein the method also includes: to it is described common recognition node mark Label has been chosen in addition；Corresponding, the node selection rule according to setting randomly selects altogether from the node white list Know node mark include:Label has been chosen according to described, the mark of the node in the node white list has been screened, acquisition is not added with described The mark of the node of label is chosen；From the mark for being not added with the node for having chosen label, the mark of common recognition node is randomly selected.
- 9. the method according to claim 1, wherein not including the management node in the node white list Mark.
- 10. a kind of computer storage medium, which is characterized in that be stored in the computer storage medium:For sending the management node of white list acquisition request to alliance's chain, to request the management node according to the white list The instruction of acquisition request sending node white list, wherein include that can all carry out block in alliance's chain in the node white list The mark of the node of data common recognition；The node white list returned for receiving the management node, and according to the node selection of setting rule, from described The instruction of the mark of common recognition node is randomly selected in node white list；For the mark according to the common recognition node, the instruction of the common recognition request of block data is sent to the common recognition node；The consensus information returned for receiving the common recognition node, and judged whether according to the consensus information for the common recognition Request is reached common understanding, and obtains the instruction of common recognition result data, wherein the consensus information includes the common recognition node according to setting Common recognition mechanism to it is described common recognition request processing result；For returning to the step of executing the management node for sending white list acquisition request to alliance's chain, set until obtaining first The instruction of the common recognition result data of fixed number amount；For the common recognition result data according to the first setting quantity, judge whether the block data knows together successfully Instruction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811611199.6A CN109660545B (en) | 2018-12-27 | 2018-12-27 | Alliance chain consensus method and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811611199.6A CN109660545B (en) | 2018-12-27 | 2018-12-27 | Alliance chain consensus method and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109660545A true CN109660545A (en) | 2019-04-19 |
| CN109660545B CN109660545B (en) | 2021-04-09 |
Family
ID=66117396
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811611199.6A Active CN109660545B (en) | 2018-12-27 | 2018-12-27 | Alliance chain consensus method and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109660545B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110300171A (en) * | 2019-06-28 | 2019-10-01 | 深圳市元征科技股份有限公司 | Information collecting method, system, computer readable storage medium and electronic equipment |
| CN110460634A (en) * | 2019-07-02 | 2019-11-15 | 特斯联（北京）科技有限公司 | Edge calculations common recognition request management method and system |
| CN112583908A (en) * | 2020-12-07 | 2021-03-30 | 合肥达朴汇联科技有限公司 | Block chain consensus method, system, device and medium applied to block output node |
| CN112600698A (en) * | 2020-12-07 | 2021-04-02 | 合肥达朴汇联科技有限公司 | Block chain consensus method, system, device and medium applied to non-block-out nodes |
| CN113486118A (en) * | 2021-07-21 | 2021-10-08 | 银清科技有限公司 | Consensus node selection method and device |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0586768A1 (en) * | 1992-09-11 | 1994-03-16 | International Business Machines Corporation | Efficient multi-users timer |
| US20110066857A1 (en) * | 2001-06-22 | 2011-03-17 | Probst David K | Method for secure delivery of digital content |
| CN106878000A (en) * | 2017-03-06 | 2017-06-20 | 中钞信用卡产业发展有限公司北京智能卡技术研究院 | A kind of alliance's chain common recognition method and system |
| CN107018125A (en) * | 2017-02-17 | 2017-08-04 | 阿里巴巴集团控股有限公司 | A kind of block catenary system, date storage method and device |
| CN107360206A (en) * | 2017-03-29 | 2017-11-17 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method, equipment and system |
| US20170364701A1 (en) * | 2015-06-02 | 2017-12-21 | ALTR Solutions, Inc. | Storing differentials of files in a distributed blockchain |
| US20170366353A1 (en) * | 2015-06-02 | 2017-12-21 | ALTR Solutions, Inc. | Generation of hash values within a blockchain |
| CN107612973A (en) * | 2017-08-18 | 2018-01-19 | 暨南大学 | Block chain structure, generation method and transaction verification method for intelligent sliding moved end |
| CN108197959A (en) * | 2018-01-23 | 2018-06-22 | 华南理工大学 | A kind of fast verification pond based on block chain, fast verification system and operating method |
| WO2018161901A1 (en) * | 2017-03-10 | 2018-09-13 | 阿里巴巴集团控股有限公司 | Consensus method and device |
| CN108596623A (en) * | 2018-05-09 | 2018-09-28 | 合肥达朴汇联科技有限公司 | A kind of block chain common recognition reaches method |
| CN108632362A (en) * | 2018-04-12 | 2018-10-09 | 北京天德科技有限公司 | A kind of method that privately owned block chain builds the election of block node |
| US20180300694A1 (en) * | 2018-05-14 | 2018-10-18 | Beijing Good Fortune Innovative Intelligence Technology Co.Ltd | Method for intelligently selecting accounting node of blockchain |
| CN108769163A (en) * | 2018-05-16 | 2018-11-06 | 深圳前海微众银行股份有限公司 | Alliance's chain common recognition reaches method, equipment and computer readable storage medium |
| CN108881169A (en) * | 2018-05-21 | 2018-11-23 | 西安电子科技大学 | Time distribution and synchronous method and system, data processing system based on block chain |
| CN109040012A (en) * | 2018-06-19 | 2018-12-18 | 西安电子科技大学 | A kind of data security protecting and sharing method based on block chain and system and application |
-
2018
- 2018-12-27 CN CN201811611199.6A patent/CN109660545B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0586768A1 (en) * | 1992-09-11 | 1994-03-16 | International Business Machines Corporation | Efficient multi-users timer |
| US20110066857A1 (en) * | 2001-06-22 | 2011-03-17 | Probst David K | Method for secure delivery of digital content |
| US20170364701A1 (en) * | 2015-06-02 | 2017-12-21 | ALTR Solutions, Inc. | Storing differentials of files in a distributed blockchain |
| US20170366353A1 (en) * | 2015-06-02 | 2017-12-21 | ALTR Solutions, Inc. | Generation of hash values within a blockchain |
| CN107018125A (en) * | 2017-02-17 | 2017-08-04 | 阿里巴巴集团控股有限公司 | A kind of block catenary system, date storage method and device |
| CN106878000A (en) * | 2017-03-06 | 2017-06-20 | 中钞信用卡产业发展有限公司北京智能卡技术研究院 | A kind of alliance's chain common recognition method and system |
| WO2018161901A1 (en) * | 2017-03-10 | 2018-09-13 | 阿里巴巴集团控股有限公司 | Consensus method and device |
| CN107360206A (en) * | 2017-03-29 | 2017-11-17 | 阿里巴巴集团控股有限公司 | A kind of block chain common recognition method, equipment and system |
| CN107612973A (en) * | 2017-08-18 | 2018-01-19 | 暨南大学 | Block chain structure, generation method and transaction verification method for intelligent sliding moved end |
| CN108197959A (en) * | 2018-01-23 | 2018-06-22 | 华南理工大学 | A kind of fast verification pond based on block chain, fast verification system and operating method |
| CN108632362A (en) * | 2018-04-12 | 2018-10-09 | 北京天德科技有限公司 | A kind of method that privately owned block chain builds the election of block node |
| CN108596623A (en) * | 2018-05-09 | 2018-09-28 | 合肥达朴汇联科技有限公司 | A kind of block chain common recognition reaches method |
| US20180300694A1 (en) * | 2018-05-14 | 2018-10-18 | Beijing Good Fortune Innovative Intelligence Technology Co.Ltd | Method for intelligently selecting accounting node of blockchain |
| CN108769163A (en) * | 2018-05-16 | 2018-11-06 | 深圳前海微众银行股份有限公司 | Alliance's chain common recognition reaches method, equipment and computer readable storage medium |
| CN108881169A (en) * | 2018-05-21 | 2018-11-23 | 西安电子科技大学 | Time distribution and synchronous method and system, data processing system based on block chain |
| CN109040012A (en) * | 2018-06-19 | 2018-12-18 | 西安电子科技大学 | A kind of data security protecting and sharing method based on block chain and system and application |
Non-Patent Citations (2)
| Title |
|---|
| 张仕将: "基于Gossip协议的拜占庭共识算法", 《计算机科学》 * |
| 韩璇: "区块链技术中的共识机制研究", 《信息安全》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110300171A (en) * | 2019-06-28 | 2019-10-01 | 深圳市元征科技股份有限公司 | Information collecting method, system, computer readable storage medium and electronic equipment |
| CN110300171B (en) * | 2019-06-28 | 2022-04-15 | 深圳市元征科技股份有限公司 | Information acquisition method, system, computer readable storage medium and electronic device |
| CN110460634A (en) * | 2019-07-02 | 2019-11-15 | 特斯联（北京）科技有限公司 | Edge calculations common recognition request management method and system |
| CN112583908A (en) * | 2020-12-07 | 2021-03-30 | 合肥达朴汇联科技有限公司 | Block chain consensus method, system, device and medium applied to block output node |
| CN112600698A (en) * | 2020-12-07 | 2021-04-02 | 合肥达朴汇联科技有限公司 | Block chain consensus method, system, device and medium applied to non-block-out nodes |
| CN112600698B (en) * | 2020-12-07 | 2023-06-13 | 合肥达朴汇联科技有限公司 | Block chain consensus method, system, equipment and medium applied to non-block-out node |
| CN112583908B (en) * | 2020-12-07 | 2024-04-16 | 合肥达朴汇联科技有限公司 | Block chain consensus method, system, equipment and medium applied to block outlet node |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109660545B (en) | 2021-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109660545A (en) | A Consortium Chain Consensus Method and Computer Storage Medium | |
| US7752168B2 (en) | Method for coordinating peer-to-peer replicated backup and versioning based on usage metrics acquired from peer client | |
| US9697066B2 (en) | Method for processing data quality exceptions in a data processing system | |
| WO2019128299A1 (en) | Test system and test method | |
| CN112087502A (en) | Method, device and equipment for processing request and storage medium | |
| CN111435495A (en) | Service processing method, device and equipment | |
| CN110599144B (en) | Network access method and device for blockchain nodes | |
| US20200394162A1 (en) | Operation management method for distributed ledger system, operation management system for distributed ledger system, and operation management program for distributed ledger system | |
| CN110555319A (en) | Resource expected result auditing method and device based on block chain and computer equipment | |
| CN108647974A (en) | A kind of Information Authentication method, apparatus and system based on block chain | |
| CN115460075B (en) | Cloud-protogenesis-based multi-network mode implementation method, device, equipment and medium | |
| CN112000943B (en) | Information verification method based on edge computing and cloud edge fusion and central cloud platform | |
| CN110784324B (en) | Node admission method and device | |
| CN117633078B (en) | API interface management method, device, equipment and storage medium based on big data | |
| CN117290244A (en) | Interface test case generation method and device, computer equipment and storage medium | |
| CN110619023A (en) | Water source detection data chaining method and device of Internet of things by combining block chains | |
| CN113472545B (en) | Equipment network access method, device, equipment, storage medium and communication system | |
| CN116980164A (en) | Access request processing method, system, device, computer equipment and storage medium | |
| CN113824738A (en) | Method and system for node communication management in block chain | |
| CN112732676A (en) | Data migration method, device, equipment and storage medium based on block chain | |
| KR102364737B1 (en) | Method of auto-installing of agent using dynamic url | |
| CN112000731B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN116846908B (en) | A blockchain-based Handle identification data sharing method and platform | |
| CN113938692B (en) | Video live broadcast risk control method and device | |
| WO2021059519A1 (en) | Analysis system, method, and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |