CN109964242A - A kind of block chain common recognition method based on trusting relationship - Google Patents
A kind of block chain common recognition method based on trusting relationship Download PDFInfo
- Publication number
- CN109964242A CN109964242A CN201880004217.6A CN201880004217A CN109964242A CN 109964242 A CN109964242 A CN 109964242A CN 201880004217 A CN201880004217 A CN 201880004217A CN 109964242 A CN109964242 A CN 109964242A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- common recognition
- block chain
- trusting relationship
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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/3825—Use of electronic signatures
-
- 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/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The present invention be suitable for Internet technology improvement areas, provide it is a kind of based on trusting relationship block chain common recognition method, comprising: S1, according to transaction block data quantization node between trusting relationship；S2, trusting relationship figure is constructed according to the trusting relationship between node and is generated and trusts matrix；S3, the trust value that each node is iterated to calculate using the trusting relationship of the whole network node；S4, every wheel common recognition random selection one represent node as the host node with book keeping operation power, and host node selects several transaction creation blocks from trading pit.The mechanism of representative is taken, specialized accounting nodes reduce common recognition cost, energy saving, while improving the efficiency of node common recognition and the extended capability of algorithm.Node is represented based on trusting relationship selection, independent of the token of block chain, book keeping operation power is avoided to concentrate on a small number of " rich men ".
Description
Technical field
The invention belongs to Internet technology improvement areas more particularly to a kind of block chain common recognition sides based on trusting relationship
Method.
Background technique
With the scientific and technological revolution and industry transformation of global information technical field, internet gradually from " information interconnected network " to
" value internet " development.In " information interconnected network " epoch, the information on network is open and clear, but also due to can arbitrarily distort
Become insincere, needs the third-party institution to provide and trust guarantee.Once the third-party platform trusted is provided to close down, provided by
Trust just turns to foam.In order to solve the trust problem generated during internet development, block chain technology is come into being.
Block chain technology is the collection of the technologies such as distributed data-storage system, point-to-point transmission, common recognition mechanism, Encryption Algorithm
At application model, trust and value delivery that conventional internet cannot achieve can be realized on the internet.It is based on cryptography
Principle rather than the feature of credit, enable any both sides' direct dealing reached an agreement, and do not need the participation of third party intermediary.
On the other hand, there's almost no Single Point of Faliure in block chain, the data on chain are stored on global countless machine nodes, so that
Data " stabilization ", " credible " and " can not distort ", this imparts the value that data one kind on network can be trusted again.
Block chain has the characteristics that decentralization, and each node in network needs to follow certain agreement to guarantee number of nodes
According to consistency, this agreement be known as know together agreement or common recognition algorithm.Common recognition algorithm is the key component of block chain technology, directly
Connect the safety and efficiency for influencing block chain product.Safe and efficient common recognition agreement is an important research in block chain field
Problem.PoW common recognition algorithm in bit coin system creatively goes in central site network to realize number between node fly-by-night
According to consistency, strong evidence is bright to be realized the complete decentralization of system and has the advantages that simply to be easily achieved by calculating, but it
There is also the defects of the wasting of resources and performance difference.In addition, a small number of nodes can be grasped greatly in the application of block chain network small scale
Power is calculated in 50%, is changed centered on PoW common recognition can be made to be degenerated by decentralization, or even influence the safety of common recognition, therefore PoW is total
Knowledge usually uses under the big application scenarios of number of nodes.PoS common recognition algorithm in point point coin system proves mechanism by equity
Solves the defect of the wasting of resources of PoW common recognition, but it is similar to concentrate on a small number of nodes with the calculation power of PoW common recognition, PoS knows together meeting
Change common recognition centered on degeneration because equity is concentrated.DPoS common recognition algorithm in bit stock system mentions on the basis of PoS knows together
Authorized Stock proves mechanism out, and the equity of oneself is licensed to other nodes by node, and highest preceding 101 nodes of equity become generation
Table node, representing node, right is identical each other, obtains book keeping operation power in turn.The operating cost of network drops in the mechanism of representative
It is low, it can be improved the rate of block generation.
Although block chain common recognition is developing always, performance is extremely limited, is difficult to realize second grade common recognition.Research and
Developer starts to turn to sight into traditional distributed common recognition algorithm.Leslie Lamport is calculated in the Paxos that nineteen ninety proposes
Method is most commonly used common recognition algorithm in current most effective consistency algorithm and engineering practice based on message transmission.
Paxso can efficiently realize the consistency of data between node, but it cannot allow malicious node to destroy common recognition process, because
This can only be used in believable Intranet.1999, Castro and Liskov proposed that tolerance malicious node quantity is less than in network
1/3 PBFT of all number of nodes knows together algorithm, and throughput of system can achieve 100,000 or more under the mechanism.Super account book item
Mesh demonstrates a possibility that PBFT common recognition is in the considerably less alliance's chain network of malicious node, and achieves good effect.So
Itself O (n and PBFT knows together2) communication cost limit the network size of block chain, as number of nodes increases, performance is fast
Speed decline, so the scalability of PBFT common recognition is poor.Domestic honey ant block chain development teams propose dBFT agreement, pass through
Equity selects book keeping operation people, then is reached common understanding by book keeping operation people by Byzantine failure tolerance algorithm, to reduce the cost of the network operation, mentions
The efficiency of high common recognition algorithm.The existing common recognition algorithm for introducing the mechanism that represents all is limited to the token mechanism of block chain application, nothing
Method uses in certain block catenary systems there is no token.
Part of in September, 2015, after honey ant project formally sets up 1 year, Onchain issues honey ant common recognition algorithm white paper, mentions
Going out a kind of improved Byzantine failure tolerance algorithm --- authorization Byzantine failure tolerance (delegated BFT, dBFT) conduct can fit
Common recognition mechanism module for block catenary system.
DBFT common recognition is formed after improving on the basis of PBFT common recognition, and the response modes of the C/S framework of script are repaired
It is changed to be suitble to the P2P mode of peer-to-peer network and realizes that node can be dynamically into exiting.Node selects book keeping operation people according to equity, so
Reached common understanding between book keeping operation people by Byzantine failure tolerance algorithm afterwards.DBFT common recognition setting system node is two kinds of roles: common
Node and accounting nodes.Accounting nodes are the important nodes during common recognition, are responsible for collecting in a network and serializing affairs disappear
Cease and charge to the distributed account book of the whole network maintenance；Ordinary node is not involved in common recognition process, only uses system to be transferred accounts, be traded
Deng operation and receive the data in account book, but it can be seen that process of completely knowing together.It is replaced by the way that block is synchronous with view, to reach
To the original state consistency of node.DBFT system works in time synchronization state, and each round is known together in a certain time interval
A block is generated, the generation of each block may undergo different views.In a view, there is a node to serve as view
Long (leader), other nodes are Congressman (follower), are supported when speaker obtains authenticating more than the block of a certain number of Congressmen,
The common recognition of a new block can be reached.DBFT common recognition is suitable for alliance's chain and privately owned chain, is solved by introducing digital certificate
Certainly to the authentication question of common recognition node identities.
The major advantage of dBFT common recognition is, first, using specialized book keeping operation people, the efficiency that block generates is improved, and
And there is good scalability；Second, book keeping operation is completed by multi-person synergy, each block has lastness, will not bifurcated.
There is also certain defects for above-mentioned common recognition.Firstly, the selection for representing node relies on equity and token.Secondly, working as
After having 1/3 or more book keeping operation people to stop working, system will be unable to offer service, do evil when there is 1/3 or more book keeping operation people to combine, and
When other all book keeping operation people are divided into two network islands just, malice book keeping operation people can make system bifurcated occur, still
Cryptography evidence can be left.
Larimer team proposes DPoS white paper and its first application --- bit stock in March, 2014
(Bitshares).Due to applying appearance of the bit coin system because of mine pond and ASIC mine machine of PoW common recognition, calculating power becomes to get over
Carry out more centralization, has deviated from the decentralization just heart, therefore Larimer team of " mono- ticket of CPU " to a certain extent
Think that the decentralization of PoS common recognition may rely on a certain number of representatives rather than whole shareholders, all shareholders vote jointly
Elect representative.Book keeping operation right is returned to those again and held in the manpower of digital cash by DPoS common recognition expectation, allows each
The people for holding bit stock currency BTS votes to candidate represent in whole system resource, obtains 101 people of most polls
Then become and represent, the right for carrying out being packaged calculating to block is obtained with random uncertain rotation.All representatives will
It receives and is equal to 10% of transaction fee contained by the block of an average level in reward, if the block of an average level contains
There are 100 strands as transaction fee, then a representative will obtain 1 strand in reward.It can be understood as right and be evenly distributed to 101
In CPU, and right is essentially equal each other by each CPU.DPoS common recognition is similar to US House system, and only election process is at any time all
Can occur, therefore DPoS common recognition in book keeping operation and verifying node be just narrowed to a certain number of nodes from worldwide, can
To reach second grade delay.But entire common recognition mechanism is also to rely on token, and to reach certain safety, the block confirmation needed
Number is more, and what affairs were written into 100 blocks after block 51% is produced, which can be considered safety
On main chain.
Resist attack on because first 100 represent power obtained be it is identical, can not be by being more than
1% ballot paper and power is focused in a single representative.Because only that 100 representatives, it is envisaged that at an attacker
The representative for obtaining book keeping operation power to every successively carries out Denial of Service attack.Fortunately, due to the fact that the mark of every representative
It is its public key and non-ip address, the threat of this particular attack are easy to be mitigated.This will make to determine ddos attack target more
It is difficult.And potential between representing is directly connected to, and will make them is interfered to create block to become increasingly difficult.
So the major advantage of this common recognition algorithm is, and first, substantially reduce the number for participating in verifying and accounting nodes
Amount further reduces the waste for calculating power on the basis of POS common recognition, reduces the cost of network operating；Second, flow of knowing together
It is small, it is with good expansibility.
There is also certain defects for above-mentioned common recognition.Firstly, entire common recognition mechanism is also to rely on token, much commercially answer
With not needed existing for token.Secondly as above-mentioned common recognition is the improvement to PoW common recognition, the low block out of PoW common recognition is inherited
Speed characteristics, throughput of system are small.
Summary of the invention
The block chain common recognition method based on trusting relationship that the purpose of the present invention is to provide a kind of, it is intended to solve above-mentioned skill
Art problem.
A kind of method the invention is realized in this way block chain based on trusting relationship is known together, block chain common recognition side
Method the following steps are included:
S1, according to transaction block data quantization node between trusting relationship；
S2, trusting relationship figure is constructed according to the trusting relationship between node and is generated and trusts matrix；
S3, the trust value that each node is iterated to calculate using the trusting relationship of the whole network node, functional expression: Ti=CTTi-1；
S4, every wheel common recognition random selection one represent node and are used as the host node weighed with book keeping operation, and host node is from trading pit
Middle several transaction creation blocks of selection；
Wherein, C indicates to trust matrix, TiNode trust value vector after indicating i-th iteration, Ti-1It indicates to change for (i-1)-th time
Trust value vector after generation.
A further technical solution of the present invention is: attack majority is related with transaction and block in block chain, it is described to attack
Behavior is hit to include creation wash sale, broadcast useless transaction, create false block and broadcast useless block.
A further technical solution of the present invention is: the step S1 interior joint i receives effectively trading and have for node j transmission
Effect block will increase node i to the degree of belief of node j, on the contrary then can reduce degree of belief.Degree of belief calculation formula isWherein, gijIndicate that node i receives the effective transaction and block counts of node j transmission, uijIndicate section
Point i receives the invalid transaction and block counts of node j transmission, and β indicates the penalty coefficient of invalid data.
A further technical solution of the present invention is: in the step S2 in order to prevent malicious node to other malicious nodes compared with
High trust value gives the lower trust value of normal node, to influence to trust the selection for representing node, therefore usesTrust value between Regularization node obtains final trust Matrix Cn×n；Wherein, cijIndicate node i
To the normalization trust value of node j, tijNode i is indicated to the degree of belief of node j, n indicates the node total number of network.
A further technical solution of the present invention is: the trusting relationship matrix constructed in the step S2 have it is random, can not
About with aperiodic property, therefore node trust value matrix T iterative process Ti=CTTi-1It can restrain.
A further technical solution of the present invention is: transaction that the trust value between the step S3 interior joint is interacted and area
The influence of block number evidence, the dynamic change at any time in 0 to 1 range；K high node of the trust value is chosen as representing node,
Each node that represents has the chance for obtaining book keeping operation power.
A further technical solution of the present invention is: representing node according to trusting relationship selection in the step S3, section is represented
Point participates in fault-tolerant byzantine agreement, and specialized accounting nodes improve the scalability of common recognition agreement.
A further technical solution of the present invention is: considering Network Transmission Delays in the step S4, block is created to most
It is divided between addition block chain eventuallyBlock generates the periodTherefore other nodes have been when new round common recognition starts
Receive previous block data.
A further technical solution of the present invention is: considering that block chain network has phase whithin a period of time in the step S4
To stability, therefore update the period t represented0Much larger than the period t of block creation, the efficiency of common recognition is improved.
It is created a further technical solution of the present invention is: being represented in the step S4 between node by fault-tolerant byzantine agreement
Block is built, then the other nodes being diffused into block chain network, node is the rule of main chain according to most long-chain, it is ensured that node
The final consistency of data.
The beneficial effects of the present invention are: being made using mechanism is represented according to the trusting relationship selected section node between node
For the representative node for participating in common recognition.Representing selection is a cycle behavior, it means that as long as any one node is stringent honest
Work all there will be an opportunity to obtain book keeping operation power as node is represented and simultaneously creates block, therefore have than the representative mechanism based on equity
Better decentralization characteristic.The mechanism of representative is taken, specialized accounting nodes reduce common recognition cost, and energy saving mentions simultaneously
The high efficiency of node common recognition and the extended capability of algorithm.By between monitoring node interaction transaction and block data it is effective
Property, the node for selecting trust value high is represents node, independent of token system, book keeping operation power is avoided to concentrate on a small number of " rich men "
The shortcomings that.Trust value is restrained by trust matrix iteration, is substantially a kind of probability, is that the whole network node judges some node
Foundation, have relative stability.Trusting relationship variation between node is slower, therefore the update cycle for representing node is much larger than
The generation period of block.On the other hand, the quantity for representing node is relatively fixed, it is meant that the quantity of nodes can't shadow
It rings to representing the efficiency for running fault-tolerant byzantine agreement between node.
Detailed description of the invention
Fig. 1 is common recognition algorithm network model figure provided in an embodiment of the present invention.
Fig. 2 is the flow chart of the block chain common recognition method provided in an embodiment of the present invention based on trusting relationship.
Fig. 3 is common recognition algorithm schematic diagram provided in an embodiment of the present invention.
Specific embodiment
Block chain is a kind of distributed structure/architecture, and the multiple stage computers being connected to each other constitute peer-to-peer network, according to common recognition agreement
Coordinate operation is jointly processed by the request of user's submission.As shown in Figure 1, in peer-to-peer network, ground of each node all in equity
Position, is both server and client, function having the same.For a peer-to-peer network, usual number of nodes is not
Fixed, node may be added or exit network at any time.In addition to this, there is likely to be some insincere in network
The malicious node appointed, malice Byzantium node can refuse to respond the interactive information of other nodes, or even the false other sections of response
The request of point.In order to reduce the cost of common recognition, the efficiency of common recognition is improved, common recognition algorithm can be selected by the trusting relationship between node
It selects the high node of a part of trust value and participates in common recognition, this part of nodes, which becomes, represents node.Therefore in the network model packet of algorithm
Containing four kinds of nodes, it is ordinary node, Byzantium's node respectively, commonly represents node and Byzantium represents node.Make between node
Ensured communication safety with encryption technology, in every message all include key signature, abstract and verification information, Byzantium's node without
Method encrypts message by Brute Force, cannot forge a signature and find the message with identical abstract.
The process for agreement of knowing together, as shown in Figure 2.It generates to trust and close comprising the trusting relationship between (1) quantization node, (2)
System's figure and trust matrix, (3) calculate node trust value and selection represent node and (4) block generates four part of agreement.Node is logical
The transaction and block information for crossing monitoring adjacent node, establish trusting relationship, and trusting relationship is quantified as the real number between 0 to 1,
It is higher to be worth bigger expression degree of belief.When node sends effective transaction and block information to other nodes, can improve node it
Between degree of belief, it is on the contrary then degree of belief can be reduced.Then by the trusting relationship between the whole network node, trusting relationship figure is constructed,
Generate trusting relationship matrix.Then the thought for using for reference search-engine web page sequence, is analogous to webpage for node, the letter between node
The relationship of appointing is analogous to the hyperlink relation between webpage, iterates to calculate trust value for each node.K high node of trust value is worked as
It is selected as representing node, has an opportunity to obtain book keeping operation power and creates block.Representing operation between node, there is visiing for 1/3 fault-tolerant ability to account for
Front yard agreement guarantees the safety and availability of common recognition algorithm.
As shown in Figure 2,3, the flow chart of the block chain common recognition method provided by the invention based on trusting relationship, is described in detail such as
Under:
Step S1, according to the trusting relationship between transaction and block data quantization node；Trusting relationship itself is difficult to define,
In computer system the high node of degree of belief typically refer under particular circumstances can independently, safely and reliably complete to specify
The node of function.Since transaction and block are most important data in block chain, common recognition method is according to interaction between node
Transaction and block data quantization node between trusting relationship.In block chain network, node is all being handed over all the time
Easily and the interaction of block data, the transaction request of user's submission is constantly handled, verifies the validity of transaction, and to other nodes
The effective transaction of broadcast.The most of attack of block chain all with trade it is related with block, be primarily present create wash sale,
Broadcast useless transaction creates the false malicious acts such as block and broadcast useless block, therefore algorithm of knowing together is according to transaction and block
Data realize that the quantization of trusting relationship between node is effective.Node can count the number of its adjacent node interaction in operational process
It is believed that breath, it is assumed that the node i section time receives g from node jijA effective transaction and block, receive uijA invalid transaction
And block, then shown in degree of belief such as formula (1) of the node i to node j.β indicates the penalty coefficient of invalid data, is adjusted, and leads to
Often greater than 1, expression receive invalid data ratio receive valid data on trust value influence it is bigger.Usually very due to block chain network
Greatly, there is a situation where between many nodes that trusting relationship is quantified as 0.5 at this time without interactive.
Description according to formula (1) to trusting relationship between node, node i receive effectively trading and have for node j transmission
Effect block will increase node i to the degree of belief of node j, on the contrary then can reduce degree of belief.
Step S2 according to the trusting relationship building trusting relationship figure between node and generates trust matrix；In WWW,
Webpage is interlinked by way of hyperlink, more valuable webpage would generally by many web page interlinkages, it is on the contrary then seldom
It is linked.Search engine sorts to related web page, is presented to the user in an appropriate order according to the linking relationship between webpage.
The present invention has used for reference web page interlinkage relational graph, node is analogous to webpage, trusting relationship is analogous to hyperlink relation, according to node
Mutual trust relationship establish trusting relationship figure.
Trusting relationship figure is a digraph, wherein while weight indicate this while corresponding two vertex between trust
Degree.According to information relationship figure it can be concluded that trusting relationship matrix D between noden×n, wherein n indicates the node total number of network, square
Each element d of battle arrayijIndicate node i to the degree of belief of node j.Malicious node gives the higher letter of other malicious nodes in order to prevent
Appoint value, give the lower trust value of normal node, influences to trust the selection for representing node, use formula (2) Regularization node
Between trust value, obtain final trust Matrix Cn×n.The wherein direct trust relation between each element representation node, letter
For the coefficient values of Ren Dugao close to 1, the low coefficient values of degree of belief are close to 0, and the seldom coefficient values of interaction are close between node
It is 0.5.
Step S3 iterates to calculate the trust value of each node using the trusting relationship of the whole network node；Node is by directly supervising
The behavior of other nodes is surveyed it can be concluded that direct trust relation between them, and then can use the trusting relationship of the whole network node
The trust value for iterating to calculate each node, as shown in formula (3).Wherein C indicates above-mentioned trust matrix, TiIndicate that i-th changes
Node after generation trusts value matrix, Ti-1Node after indicating (i-1)-th iteration trusts value matrix.
Ti=CTTi-1Formula (3)
It can be proved that the iterative relation of formula (3) can finally restrain, convergence result is exactly to be trusted to close according to the whole network node
It is the trust value for the whole nodes being calculated.K high node of trust value is chosen as representing node, has an opportunity to be kept accounts
Power.
Step S4, every wheel common recognition random selection one represent node and are used as the host node weighed with book keeping operation, and host node is from friendship
Yi Chizhong selects several transaction creation blocks；It only represents node and participates in common recognition process, ordinary node cannot create block, still
It can see complete common recognition process.One wheel common recognition is comprising choosing host node and creation block two parts.Firstly, being saved at random from representative
It is host node that a node is selected in point.The representative node for being only elected as host node possesses book keeping operation power, can create block.Then
Block passes through by other verifications for representing node, is finally added in block chain.Assuming that participating in common recognition protocol node quantity
For k, f is the quantity that can tolerate malice Byzantium node
When node starts, the synchronization that other nodes in network do block data is first passed through.Node listens to the friendship come
Easily, effective transaction is stored in trading pit and is broadcast to other nodes by the validity of individual authentication transaction, and it is invalid to abandon
Transaction.After node obtains book keeping operation power, selects several transaction to constitute block from trading pit, the Kazakhstan of father's block is recorded in block head
Value is wished to guarantee the order of block.When trading pit is sky, when there is no effectively trading, dead zone can be generated according to normal cycle
Block.In view of the retardance of network transmission, it is divided into from creation block to ultimately joining to block chainBlock generates week
PhaseSo that other nodes have received previous block data when a wheel common recognition beginning.
Block data is reached an agreement between common recognition node needs experienced three stages, respectively Pre-Prepare,
Prepare and Commit.
(1) the Pre-Prepare stage
The host node for obtaining book keeping operation power sends Pre-Prepare request to all common recognition nodes, includes in request message
The height h of current block, view v, the number p of host node, block block and block signature blockp.Node is receiving
After the Pre-Prepare request of host node, the accuracy of message is verified.If Pre-Prepare request is illegal, proposal changes
Become view, reselects host node.When node receives legal Pre-Prepare request, meeting sends Prepare to other nodes
Request, itself enters Prepare state.In Prepare request comprising the height h of current block, view v, node number i and
To the signature block of blocki。
(2) the Prepare stage
When node receives 2f Prepare message, node enters Commit state, and sends Commit to other nodes
Message includes height h, view v, the number i of node and the signature block to block of current block in Commit messagei。
(3) the Commit stage
When node receives 2f Commit message, then it is assumed that this wheel common recognition is completed, and block is written in block chain.
It include complete block in Pre-Prepare message, node is after receiving the Pre-Prepare message of host node
Can in the block content for locally saving this common recognition, and later the Prepare stage and the Commit stage replaced using cryptographic Hash
Block is changed, communication cost is reduced.It is voted by the negotiation in these three stages, block data is consistent between final realization common recognition node
Property.The block only reached common understanding between representing node can just be broadcast to other nodes of block chain network.
Using mechanism is represented, according to the trusting relationship selected section node between node as the representative section for participating in common recognition
Point.Representing selection is a cycle behavior, it means that as long as the stringent honest work of any one node, all there will be an opportunity to become
Node is represented, book keeping operation is obtained and weighs and create block, therefore there is better decentralization characteristic than the representative mechanism based on equity.
The mechanism of representative is taken, specialized accounting nodes reduce common recognition cost, energy saving, while it is total to improve node
The efficiency of knowledge and the extended capability of algorithm.Pass through the validity of the transaction of interaction and block data between monitoring node, selection letter
The node for appointing value high is to represent node, independent of token system, book keeping operation is avoided to weigh the shortcomings that concentrating on a small number of " rich men ", tool
Have broad application prospects.
Trust value is restrained by trust matrix iteration, is substantially a kind of probability, is that the whole network node sentences some node
Disconnected foundation has relative stability.Trusting relationship variation between node is slower, therefore the update cycle for representing node is long-range
In the generation period of block.On the other hand, the quantity for representing node is relatively fixed, it is meant that the quantity of nodes can't
Influence the efficiency for representing and running fault-tolerant byzantine agreement between node.
For the safety of strict guarantee common recognition, it is desirable that fault-tolerant Byzantium's algorithm has 1/3 fault-tolerant ability.However it represents
Node not instead of completely random selects, and is strictly screened based on the trusting relationship between node, trust value is greater than
Other nodes in network, therefore there is the fault-tolerant ability higher than 1/3.
Faith mechanism is introduced in block chain in block chain, since transaction and block are most important data, common recognition
Method is proposed to trust between a kind of node suitable for block chain network and be closed according to the transaction and block data of interaction between node
The quantization method of system.Each node disjoint judges that the trust value of other nodes, different nodes may be different to same node
Trust value.Trust value between node is influenced by the transaction and block data that interact, in 0 to 1 range at any time dynamically
Variation.But the trust value of arbitrary node be not it is cocksure, it is substantially a kind of probability, is other nodes to it
The foundation of judgement.
Using trusting relationship mutual between node, iteration convergence obtains the trust value of the whole network node.The high section of trust value
Point is chosen as representing node, has an opportunity to obtain book keeping operation power.Node trust value usually with higher is represented, decentralization is improved
The security reliability of system is also enhanced while characteristic.This mode for representing node selection is kept away independent of token system
Exempt from the shortcomings that book keeping operation power concentrates on a small number of " rich men ".
The communication cost of fault-tolerant byzantine agreement can not use in extensive block chain network, have poor extension
Property.Common recognition mechanism algorithm proposed in this paper based on trust, froms the perspective of from another angle, is kept accounts and is saved by faith mechanism specialization
Point improves the degree of belief of accounting nodes, avoids the whole network and carries out fault-tolerant Byzantium's common recognition, improves the scalability and effect of common recognition
Rate.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (10)
- A kind of method 1. block chain based on trusting relationship is known together, which is characterized in that the block chain common recognition method includes following Step:S1, according to transaction block data quantization node between trusting relationship；S2, trusting relationship figure is constructed according to the trusting relationship between node and is generated and trusts matrix；S3, the trust value that each node is iterated to calculate using the trusting relationship of the whole network node, functional expression: Ti=CTTi-1；S4, every wheel common recognition random selection one represent node as the host node with book keeping operation power, and host node is selected from trading pit Select several transaction creation blocks；Wherein, C indicates to trust matrix, TiNode trust value vector after indicating i-th iteration, Ti-1After indicating (i-1)-th iteration Node trust value vector.
- The method 2. block chain according to claim 1 is known together, which is characterized in that attack majority and transaction in block chain Related with block, the attack includes creation wash sale, broadcast useless transaction, creates false block and broadcast useless area Block.
- The method 3. block chain according to claim 2 is known together, which is characterized in that the step S1 interior joint i receives node j Effective transaction and the effective block sent will increase node i to the degree of belief of node j, on the contrary then can reduce degree of belief；Degree of belief Calculation formula isWherein, gijIndicate that node i receives the effective transaction and block counts of node j transmission, uijIndicate that node i receives the invalid transaction and block counts of node j transmission, β indicates the penalty coefficient of invalid data.
- The method 4. block chain according to claim 3 is known together, which is characterized in that malice saves in order to prevent in the step S2 Point gives other malicious nodes higher trust value, gives the lower trust value of normal node, to influence to trust the choosing for representing node It takes, therefore usesTrust value between Regularization node obtains final trust Matrix Cn×n；Wherein, cijIndicate normalization trust value of the node i to node j, tijNode i is indicated to the degree of belief of node j, n indicates the node of network Sum.
- The method 5. block chain according to claim 4 is known together, which is characterized in that the trusting relationship constructed in the step S2 Matrix has random, irreducible and aperiodic property, therefore node trusts the iterative process T of value matrix Ti=CTTi-1It can receive It holds back.
- The method 6. block chain according to claim 5 is known together, which is characterized in that the trust between the step S3 interior joint Value is influenced by the transaction and block data that interact, the dynamic change at any time in 0 to 1 range.K high section of the trust value Point is chosen as representing node, and each node that represents has the chance for obtaining book keeping operation power.
- The method 7. block chain according to claim 6 is known together, which is characterized in that selected in the step S3 according to trusting relationship It selects and represents node, represent node and participate in fault-tolerant byzantine agreement, specialized accounting nodes improve the scalability of common recognition agreement.
- The method 8. block chain according to claim 7 is known together, which is characterized in that consider that network transmission is prolonged in the step S4 Chi Xing, creation block are divided between block chain to ultimately joiningBlock generates the periodTherefore new round common recognition is opened Other nodes have received previous block data when the beginning.
- 9. the common recognition method of block chain according to claim 8, which is characterized in that consider block link network in the step S4 Network has relative stability whithin a period of time, therefore updates the period t represented0Period t is generated much larger than block, improves common recognition Efficiency.
- The method 10. block chain according to claim 9 is known together, which is characterized in that represented between node in the step S4 Block, then the other nodes being diffused into block chain network are created by fault-tolerant byzantine agreement, node is according to most long-chain For the rule of main chain, guarantee the final consistency of node data.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2018/088355 WO2019222993A1 (en) | 2018-05-25 | 2018-05-25 | Blockchain consensus method based on trust relationship |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109964242A true CN109964242A (en) | 2019-07-02 |
| CN109964242B CN109964242B (en) | 2023-07-14 |
Family
ID=67023432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201880004217.6A Active CN109964242B (en) | 2018-05-25 | 2018-05-25 | Block chain consensus method based on trust relationship |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109964242B (en) |
| WO (1) | WO2019222993A1 (en) |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110505091A (en) * | 2019-08-23 | 2019-11-26 | 昆明理工大学 | One kind being based on the improved common recognition method of PBFT |
| CN110519246A (en) * | 2019-08-15 | 2019-11-29 | 安徽师范大学 | Based on the degree of belief calculation method for trusting block chain link point |
| CN110535836A (en) * | 2019-08-12 | 2019-12-03 | 安徽师范大学 | A kind of trust block chain common recognition method of based role classification |
| CN110661867A (en) * | 2019-09-25 | 2020-01-07 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN110853214A (en) * | 2019-11-06 | 2020-02-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN110990490A (en) * | 2019-12-19 | 2020-04-10 | 北京海益同展信息科技有限公司 | Method, device, equipment and medium for posting block chain in block chain network |
| CN111414420A (en) * | 2020-03-17 | 2020-07-14 | 重庆邮电大学 | Improved PBFT block chain consensus method |
| CN111522800A (en) * | 2020-07-03 | 2020-08-11 | 支付宝(杭州)信息技术有限公司 | Block chain consensus method, node and system of badger Byzantine fault-tolerant consensus mechanism |
| CN111711711A (en) * | 2020-05-28 | 2020-09-25 | 北京邮电大学 | Block chain-based top-level domain name management and analysis method and system |
| WO2020244197A1 (en) * | 2019-06-06 | 2020-12-10 | 西安安盟智能科技股份有限公司 | Distributed consensus algorithm and apparatus for rapidly generating block |
| CN112104482A (en) * | 2020-08-11 | 2020-12-18 | 佛山赛思禅科技有限公司 | Consensus method based on parallel voting |
| CN112583798A (en) * | 2020-11-30 | 2021-03-30 | 北京八分量信息科技有限公司 | Method, device and related product for screening common identification nodes from block chain system |
| CN112651830A (en) * | 2020-12-03 | 2021-04-13 | 齐鲁工业大学 | Block chain consensus method applied to power resource sharing network |
| CN112671815A (en) * | 2019-10-16 | 2021-04-16 | 陈小虎 | Byzantine fault-tolerant consensus scheme for unlicensed network |
| CN112783976A (en) * | 2021-01-05 | 2021-05-11 | 上海特高信息技术有限公司 | Consensus algorithm for flexibly packaging out blocks by allied block chains |
| CN112804305A (en) * | 2020-12-30 | 2021-05-14 | 北京八分量信息科技有限公司 | Credible networking method and system of internet node and related products |
| CN112860482A (en) * | 2021-01-27 | 2021-05-28 | 西南林业大学 | Block chain consensus performance optimization method |
| CN112905692A (en) * | 2021-02-01 | 2021-06-04 | 中国科学院数学与系统科学研究院 | Leaf block selection method of block chain system based on directed acyclic graph |
| CN113672987A (en) * | 2021-09-06 | 2021-11-19 | 上海万向区块链股份公司 | Method and system for selecting packet type accounting node under PoW mechanism |
| CN113783947A (en) * | 2021-08-26 | 2021-12-10 | 浙商银行股份有限公司 | Adaptive block link point fault tolerance improving method, equipment and storage medium |
| CN113922965A (en) * | 2021-10-09 | 2022-01-11 | 筹远(上海)信息科技有限公司 | Block chain data consensus method and device under Byzantine scene |
| CN113961545A (en) * | 2021-10-26 | 2022-01-21 | 北京市科学技术情报研究所 | Block chain-based information value database construction method |
| CN114332872A (en) * | 2022-03-14 | 2022-04-12 | 四川国路安数据技术有限公司 | Contract document fault-tolerant information extraction method based on graph attention network |
| CN114500046A (en) * | 2022-01-26 | 2022-05-13 | 南京晓庄学院 | Consensus algorithm based on field area network and IOTA |
| CN114650289A (en) * | 2020-12-02 | 2022-06-21 | 王志诚 | Method and device for block chain consensus |
| CN114745140A (en) * | 2022-06-13 | 2022-07-12 | 天津市城市规划设计研究总院有限公司 | Urban planning field block chain consensus verification method and system based on aggregation encryption |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111915294B (en) * | 2020-06-03 | 2023-11-28 | 东南大学 | Safe, privacy-preserving and tradable distributed machine learning framework operation method based on blockchain technology |
| CN112819433B (en) * | 2021-02-01 | 2024-03-26 | 北京工业大学 | Consensus method for collaborative government block chain |
| CN113051348B (en) * | 2021-03-29 | 2023-11-10 | 河南向量智能科技研究院有限公司 | Group product collaborative design block chain technology data synchronization collaborative method |
| CN113438327B (en) * | 2021-08-30 | 2021-11-30 | 湖南三湘银行股份有限公司 | Consensus algorithm implementation method based on block chain |
| CN113923217B (en) * | 2021-09-30 | 2024-04-16 | 中国人民解放军国防科技大学 | Asynchronous Bayesian-busy family consensus method and system based on DAG |
| CN114189325B (en) * | 2021-11-19 | 2023-09-29 | 新疆大学 | Bayesian-tolerant and scalable method and device with high fault tolerance and storage medium |
| CN114374520B (en) * | 2022-01-06 | 2023-11-03 | 上海交通大学宁波人工智能研究院 | Trusted and safe lightweight block chain implementation system and method |
| CN115021929B (en) * | 2022-05-24 | 2024-02-02 | 中国电信股份有限公司 | Trust management method and device for computing power network, storage medium and electronic equipment |
| CN115314513B (en) * | 2022-06-16 | 2023-09-19 | 北京邮电大学 | Trust twinning method based on block chain and related equipment |
| CN115914225B (en) * | 2022-10-28 | 2024-04-30 | 三峡大学 | Optimization method for Raft consensus algorithm election stage |
| CN117478300B (en) * | 2023-12-27 | 2024-03-01 | 湖南天河国云科技有限公司 | Cross-chain consensus method and device based on node determination and computer equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
| CN107169765A (en) * | 2017-05-11 | 2017-09-15 | 电子科技大学 | A kind of method adjusted into Mobile state of being known together based on business degree of belief to block chain |
| CN107341660A (en) * | 2017-05-27 | 2017-11-10 | 唐盛（北京）物联技术有限公司 | A kind of block chain bottom common recognition mechanism and the block catenary system based on the common recognition mechanism |
| CN107391320A (en) * | 2017-03-10 | 2017-11-24 | 阿里巴巴集团控股有限公司 | One kind common recognition method and device |
| CN107819848A (en) * | 2017-11-08 | 2018-03-20 | 济南浪潮高新科技投资发展有限公司 | A kind of internet of things equipment autonomy interconnected method based on block chain |
| CN108053308A (en) * | 2017-12-08 | 2018-05-18 | 横琴密达科技有限责任公司 | A kind of method and system of monetary device selection and intelligent Trade based on block chain |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10726346B2 (en) * | 2016-11-09 | 2020-07-28 | Cognitive Scale, Inc. | System for performing compliance operations using cognitive blockchains |
| CN107977340A (en) * | 2017-12-27 | 2018-05-01 | 邵美 | A kind of importance ranking method of block chain trade network node |
-
2018
- 2018-05-25 WO PCT/CN2018/088355 patent/WO2019222993A1/en active Application Filing
- 2018-05-25 CN CN201880004217.6A patent/CN109964242B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107391320A (en) * | 2017-03-10 | 2017-11-24 | 阿里巴巴集团控股有限公司 | One kind common recognition method and device |
| CN107124403A (en) * | 2017-04-14 | 2017-09-01 | 朱清明 | The generation method and computing device of common recognition block in block chain |
| CN107169765A (en) * | 2017-05-11 | 2017-09-15 | 电子科技大学 | A kind of method adjusted into Mobile state of being known together based on business degree of belief to block chain |
| CN107341660A (en) * | 2017-05-27 | 2017-11-10 | 唐盛（北京）物联技术有限公司 | A kind of block chain bottom common recognition mechanism and the block catenary system based on the common recognition mechanism |
| CN107819848A (en) * | 2017-11-08 | 2018-03-20 | 济南浪潮高新科技投资发展有限公司 | A kind of internet of things equipment autonomy interconnected method based on block chain |
| CN108053308A (en) * | 2017-12-08 | 2018-05-18 | 横琴密达科技有限责任公司 | A kind of method and system of monetary device selection and intelligent Trade based on block chain |
Cited By (46)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020244197A1 (en) * | 2019-06-06 | 2020-12-10 | 西安安盟智能科技股份有限公司 | Distributed consensus algorithm and apparatus for rapidly generating block |
| CN110535836A (en) * | 2019-08-12 | 2019-12-03 | 安徽师范大学 | A kind of trust block chain common recognition method of based role classification |
| CN110535836B (en) * | 2019-08-12 | 2021-10-29 | 安徽师范大学 | Trust block chain consensus method based on role classification |
| CN110519246A (en) * | 2019-08-15 | 2019-11-29 | 安徽师范大学 | Based on the degree of belief calculation method for trusting block chain link point |
| CN110519246B (en) * | 2019-08-15 | 2021-09-28 | 安徽师范大学 | Trust degree calculation method based on trust block chain node |
| CN110505091A (en) * | 2019-08-23 | 2019-11-26 | 昆明理工大学 | One kind being based on the improved common recognition method of PBFT |
| CN110505091B (en) * | 2019-08-23 | 2021-09-10 | 昆明理工大学 | Improved consensus method based on PBFT |
| CN110661867A (en) * | 2019-09-25 | 2020-01-07 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN110661867B (en) * | 2019-09-25 | 2021-07-23 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN112671815A (en) * | 2019-10-16 | 2021-04-16 | 陈小虎 | Byzantine fault-tolerant consensus scheme for unlicensed network |
| CN110853214A (en) * | 2019-11-06 | 2020-02-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN110990490A (en) * | 2019-12-19 | 2020-04-10 | 北京海益同展信息科技有限公司 | Method, device, equipment and medium for posting block chain in block chain network |
| CN110990490B (en) * | 2019-12-19 | 2023-09-01 | 京东科技信息技术有限公司 | Method, device, equipment and medium for checking in blockchain network |
| CN111414420B (en) * | 2020-03-17 | 2023-05-26 | 重庆邮电大学 | Improved PBFT block chain consensus method |
| CN111414420A (en) * | 2020-03-17 | 2020-07-14 | 重庆邮电大学 | Improved PBFT block chain consensus method |
| US11611567B2 (en) | 2020-05-28 | 2023-03-21 | Beijing University Of Posts And Telecommunications | Method and system for management and resolution of blockchain-based top-level domain |
| CN111711711A (en) * | 2020-05-28 | 2020-09-25 | 北京邮电大学 | Block chain-based top-level domain name management and analysis method and system |
| CN111522800B (en) * | 2020-07-03 | 2020-10-30 | 支付宝(杭州)信息技术有限公司 | Block chain consensus method, node and system of badger Byzantine fault-tolerant consensus mechanism |
| US11271799B2 (en) | 2020-07-03 | 2022-03-08 | Alipay (Hangzhou) Information Technology Co., Ltd. | Blockchain consensus method, node, and system based on honey badger byzantine fault tolerance consensus mechanism |
| CN111522800A (en) * | 2020-07-03 | 2020-08-11 | 支付宝(杭州)信息技术有限公司 | Block chain consensus method, node and system of badger Byzantine fault-tolerant consensus mechanism |
| CN112104482A (en) * | 2020-08-11 | 2020-12-18 | 佛山赛思禅科技有限公司 | Consensus method based on parallel voting |
| CN112104482B (en) * | 2020-08-11 | 2021-06-29 | 佛山赛思禅科技有限公司 | Consensus method based on parallel voting |
| CN112583798A (en) * | 2020-11-30 | 2021-03-30 | 北京八分量信息科技有限公司 | Method, device and related product for screening common identification nodes from block chain system |
| CN112583798B (en) * | 2020-11-30 | 2022-11-08 | 北京八分量信息科技有限公司 | Method, device and related product for screening common identification nodes from block chain system |
| CN114650289A (en) * | 2020-12-02 | 2022-06-21 | 王志诚 | Method and device for block chain consensus |
| CN112651830A (en) * | 2020-12-03 | 2021-04-13 | 齐鲁工业大学 | Block chain consensus method applied to power resource sharing network |
| CN112651830B (en) * | 2020-12-03 | 2023-01-24 | 齐鲁工业大学 | Block chain consensus method applied to power resource sharing network |
| CN112804305B (en) * | 2020-12-30 | 2023-03-31 | 北京八分量信息科技有限公司 | Credible networking method and system of internet node and related product |
| CN112804305A (en) * | 2020-12-30 | 2021-05-14 | 北京八分量信息科技有限公司 | Credible networking method and system of internet node and related products |
| CN112783976A (en) * | 2021-01-05 | 2021-05-11 | 上海特高信息技术有限公司 | Consensus algorithm for flexibly packaging out blocks by allied block chains |
| CN112783976B (en) * | 2021-01-05 | 2024-01-26 | 上海特高信息技术有限公司 | Consensus system for flexible packaging of alliance blockchain |
| CN112860482A (en) * | 2021-01-27 | 2021-05-28 | 西南林业大学 | Block chain consensus performance optimization method |
| CN112905692B (en) * | 2021-02-01 | 2023-09-29 | 中国科学院数学与系统科学研究院 | Leaf block selection method of block chain system based on directed acyclic graph |
| CN112905692A (en) * | 2021-02-01 | 2021-06-04 | 中国科学院数学与系统科学研究院 | Leaf block selection method of block chain system based on directed acyclic graph |
| CN113783947A (en) * | 2021-08-26 | 2021-12-10 | 浙商银行股份有限公司 | Adaptive block link point fault tolerance improving method, equipment and storage medium |
| CN113672987B (en) * | 2021-09-06 | 2023-09-05 | 上海万向区块链股份公司 | Method and system for selecting packet type billing node under PoW mechanism |
| CN113672987A (en) * | 2021-09-06 | 2021-11-19 | 上海万向区块链股份公司 | Method and system for selecting packet type accounting node under PoW mechanism |
| CN113922965B (en) * | 2021-10-09 | 2024-04-16 | 筹远(上海)信息科技有限公司 | Block chain data consensus method and device in Bayesian scene |
| CN113922965A (en) * | 2021-10-09 | 2022-01-11 | 筹远(上海)信息科技有限公司 | Block chain data consensus method and device under Byzantine scene |
| CN113961545A (en) * | 2021-10-26 | 2022-01-21 | 北京市科学技术情报研究所 | Block chain-based information value database construction method |
| CN113961545B (en) * | 2021-10-26 | 2022-04-26 | 北京市科学技术情报研究所 | Block chain-based information value database construction method |
| CN114500046A (en) * | 2022-01-26 | 2022-05-13 | 南京晓庄学院 | Consensus algorithm based on field area network and IOTA |
| CN114500046B (en) * | 2022-01-26 | 2024-03-15 | 南京晓庄学院 | Consensus method based on field network and IOTA |
| CN114332872A (en) * | 2022-03-14 | 2022-04-12 | 四川国路安数据技术有限公司 | Contract document fault-tolerant information extraction method based on graph attention network |
| CN114745140B (en) * | 2022-06-13 | 2022-08-23 | 天津市城市规划设计研究总院有限公司 | Urban planning field block chain consensus verification method and system based on aggregation encryption |
| CN114745140A (en) * | 2022-06-13 | 2022-07-12 | 天津市城市规划设计研究总院有限公司 | Urban planning field block chain consensus verification method and system based on aggregation encryption |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019222993A1 (en) | 2019-11-28 |
| CN109964242B (en) | 2023-07-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109964242A (en) | A kind of block chain common recognition method based on trusting relationship | |
| Wan et al. | Recent advances in consensus protocols for blockchain: a survey | |
| Zhou et al. | Solutions to scalability of blockchain: A survey | |
| Xiao et al. | A survey of distributed consensus protocols for blockchain networks | |
| Ferdous et al. | Blockchain consensus algorithms: A survey | |
| Jesus et al. | A survey of how to use blockchain to secure internet of things and the stalker attack | |
| Zheng et al. | An overview of blockchain technology: Architecture, consensus, and future trends | |
| Yu et al. | Proof-of-QoS: QoS based blockchain consensus protocol | |
| Zhuang et al. | Proof of reputation: A reputation-based consensus protocol for blockchain based systems | |
| Zhang et al. | Overview of blockchain consensus mechanism | |
| CN109426952A (en) | A kind of block chain framework | |
| CN109493056A (en) | A kind of block chain common recognition mechanism based on supply chain Ecological Information scene | |
| CN109039847A (en) | A kind of method and device solving block chain the whole network message consistency problem using DMT | |
| CN107423961A (en) | A kind of optimization common recognition method based on random correlation analysis | |
| Bugday et al. | Creating consensus group using online learning based reputation in blockchain networks | |
| CN111951108A (en) | Chain structure design method with intelligent contract block chain with complete picture | |
| Gayvoronskaya et al. | Blockchain | |
| Yu et al. | Low powered blockchain consensus protocols based on consistent hash | |
| Flood et al. | Blockchain’s future: can the decentralized blockchain community succeed in creating standards? | |
| Boreiri et al. | A novel consensus protocol in blockchain network based on proof of activity protocol and game theory | |
| Feng et al. | Regulatable and hardware-based proof of stake to approach nothing at stake and long range attacks | |
| Decker | On the scalability and security of bitcoin | |
| Singh et al. | Understanding the public, private and consortium consensus algorithms in blockchain technology | |
| Sun et al. | A reputation based hybrid consensus for e-commerce blockchain | |
| Jangid et al. | An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends |
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 |