CN109214795A - A kind of block chain mixing common recognition method based on DAG algorithm - Google Patents
A kind of block chain mixing common recognition method based on DAG algorithm Download PDFInfo
- Publication number
- CN109214795A CN109214795A CN201811086648.XA CN201811086648A CN109214795A CN 109214795 A CN109214795 A CN 109214795A CN 201811086648 A CN201811086648 A CN 201811086648A CN 109214795 A CN109214795 A CN 109214795A
- Authority
- CN
- China
- Prior art keywords
- common recognition
- dag
- algorithm
- node
- transaction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- 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/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
-
- 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/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Computer Security & Cryptography (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
It is a kind of based on DAG algorithm block chain mixing common recognition method specific step is as follows, step 1: transaction or Transaction Set are collected and verified to client；Step 2: it selects weight to be higher than at least two node of graph of setting value from DAG network, and transaction validation verification is carried out to node of graph transaction or Transaction Set, then entered in next step by verifying；Step 3: client submits transaction or Transaction Set to DAG network；Step 4: using second of being determined property of the common recognition algorithm common recognition for being different from DAG common recognition algorithm；Step 5: node of graph common recognition is sent to DAG network from common recognition promoter and completes message；Step 6: increase weight of the node of graph in DAG network.
Description
Technical field
The present invention relates to field of computer technology, and in particular to a kind of block chain mixing common recognition method based on DAG algorithm.
Background technique
Block chain technology is that algorithm of knowing together with storing data, using distributed node is verified using block linked data structure
Guarantee the safety of data transmission and access with more new data, in the way of cryptography, using by automatized script generation to generate
The intelligent contract of code composition programs the completely new distributed basis framework and calculation of one kind with operation data；
Existing common recognition algorithm has very much, such as PoW, DAG, PBFT, RAFT, PAXOS algorithm, and wherein PoW, DAG, PBFT are
Byzantine failure tolerance common recognition, PoW algorithm went out block using proof of work algorithm average 10 minutes, but PoW is easy to produce bifurcated, needs
6 pieces of confirmations are effective to guarantee block transaction；
RAFT, PAXOS algorithm can only support SPOF (Single Point of Faliure), can not support SPOT (single-point trust).In other words,
SPOF machine leads to not work due to shutdown, network failure etc., and SPOT indicates hacker in malicious attack distribution
System can simulate mutual message, send spurious information.Wherein Byzantine failure tolerance common recognition also divides maximum probability common recognition and certainty total
Know, wherein PoW, DAG belong to maximum probability common recognition, can not learn whether the transaction is effective in block chain after the completion of common recognition, PBFT
Etc. classes BFT algorithm belong to certainty common recognition, the block transaction results are deterministic after the completion of common recognition.PBFT common recognition needs network more
Secondary interaction, confirmation, when common recognition efficiency caused by the reasons such as network delay occur reduces, subsequent transaction will be unable to common recognition confirmation,
TPS sharply declines.DAG algorithm uses directed acyclic graph, and New Transaction needs to mention after carrying out transaction verification to more transactions before
It hands over to block chain.The distinct disadvantage of DAG is that the trade confirmation time is uncertain, can not learn when effective the transaction is.Meanwhile it trading
Inquiry can not accurate description exchange in block locations coordinate, so search efficiency is lower.It will be unable to when executing block and synchronizing
Whether accurate judgement synchronization is completed.
Summary of the invention
One, the technical issues of solving
DAG mixture of networks is efficiently known together algorithm in view of the deficiencies of the prior art, the present invention proposes a kind of, is guaranteeing to trade
While TPS, common recognition efficiency, Transaction Inquiries efficiency, synchronous efficiency are improved, guarantees that high frequency is handed over using DAG directed acyclic graph feature
Easy to handle ability carries out transaction fast verification, using BFT certainty common recognition characteristic, carries out verifying sequence to DAG transaction, and will
The block for completing BFT is marked in DAG, increases the block in the weighted value of DAG network, improves the area of the convergence rate of DAG
Block chain common recognition method.
Two, specific technical solution
A kind of block chain mixing common recognition method based on DAG algorithm, specific step is as follows,
Step 1: transaction or Transaction Set are collected and verified to client；
Step 2: it selects weight to be higher than at least two node of graph of setting value from DAG network, and trades to the node of graph
Or Transaction Set carries out transaction validation verification, is then entered in next step by verifying；
Step 3: client submits transaction or Transaction Set to DAG network；
Step 4: using second of being determined property of the common recognition algorithm common recognition for being different from DAG common recognition algorithm；
Step 5: node of graph common recognition is sent to DAG network from common recognition promoter and completes message；
Step 6: increase weight of the node of graph in DAG network.
To better implement the present invention, further are as follows:
Second of common recognition algorithm is BFT algorithm in the step 4, specifically: the common recognition promoter of BFT is from DAG network
The node of graph that weighted value is higher than setting value is randomly selected, and father's block of the node of graph is successfully recorded on block chain by BFT,
BFT know together promoter to the node of graph carry out validation verification, such as authentication failed, then notify the DAG network identity node of graph without
Effect, is proved to be successful, and is known together using being determined property of BFT agreement.
Second of common recognition algorithm is POS algorithm, specific steps in the step 4 are as follows:
4.1 ballot selection motions sponsors, each node are mutually voted according to the Token number of itself, and each node can vote
It is identical as the Token that itself holds that number is；
In 4.2 voting results, the most persons of number of votes obtained obtain motion power, and the transaction that itself is received is packaged into
Block is then broadcast to all nodes of the whole network, and the whole network identifies the identity of the most persons of number of votes obtained first, and progress respectively falls block, completes
Block process out.
Second of common recognition algorithm is DPOS algorithm, specific steps in the step 4 are as follows:
4.1 ballot selection common recognition group memberships, each node is according to itself Token number and holds time of Token and carries out
COMPREHENSIVE CALCULATING obtains ballot value；
4.2 motions sponsors setting sets motions sponsor in the common recognition group membership selected；
4.3 in the common recognition group membership selected, and according to the motion of setting sequence, progress respectively falls block, completes out block.
Second of common recognition algorithm is Algorand algorithm, specific steps in the step 4 are as follows:
4.1 make a choice by lot common recognition group；
The 4.2 common recognition groups elected carry out wheel outflow block according to BFT algorithm.
In the step 2, selecting weight to be higher than the node of graph of setting value from DAG network is two.
Client submits transaction or Transaction Set to DAG network, and is appended to the tail for the node of graph being verified
Portion.
Three, the invention has the benefit that
1, it improves transaction TPS, improve common recognition efficiency, replace chain structure using directed acyclic graph, trading processing can be improved
Concurrent capability, client process is transferred into transaction verification work in part, DAG is reduced and knows together network processes pressure, and then improve
Trade TPS, common recognition efficiency.
2, Transaction Inquiries efficiency is improved, the directed acyclic graph structures of DAG can not define the location coordinate information of inquiry transaction,
It needs to find from back to front as processing chained list, once encounter bifurcated, it is also desirable to branched structure is traversed to search transaction, we
The BFT common recognition of case is stored using chain structure, transaction position is accurately positioned using block number, block bias internal, while can
In BFT store transaction, component quick indexing table facilitates carry out Transaction Inquiries.
3, improve synchronous efficiency is difficult to define whether synchronize process knot when DAG network is synchronous using directed acyclic diagram data
Beam, but Fast synchronization can be realized using the chain structure of BFT, it need to only guarantee that the block number of synchronization node is equal to the block of other nodes
Number, i.e., provable synchronous process terminates.
4, DAG convergence rate is improved.Since DAG network is using directed acyclic graph, figure network can be unlimited in principle
Extension causes the weighted value due to certain transaction to add up insufficient, is judged as trading in vain, this programme will complete the block of BFT
Weight adds up, and the higher block of weighted value can be selected when client carries out block submission and carries out transaction verification, improves and receives
Hold back speed.
5, transaction certainty.DAG network needs which transaction by weighted judgment effective, but which is with uncertain
Property.Such as: two transactions are honeysuckle transaction, concurrently execute and be committed to DAG network, wherein one is added by subsequent transaction and has
Have a higher weight, but another pen is due to being that honeysuckle transaction is less by subsequent superposition, through the transaction of honeysuckle after a period of time no longer by
Superposition, it is believed that transaction invalid.But subsequent transaction can be made to be appended to honeysuckle transaction tail portion by attack means, honeysuckle is improved and hand over
Easy weight, former transaction will be considered to invalid at this time.Using DAG+BFT scheme, block be recorded BFT common recognition based on, if DAG
There is the transaction of other honeysuckles, then it is invalid to be directly set to.
6, by vote by ballot common recognition node, more there is decentralization characteristic.If there are malicious attacks for node, will punish
It penalizes and deducts promoter token, therefore increase node and do evil cost, improve block chain indirectly and know together safety.
Detailed description of the invention
Fig. 1 is the flow chart of the embodiment of the present invention one；
Fig. 2 is the initial DAG network node figure of embodiment one in the present invention；
Fig. 3 submits trading pattern to DAG network for one client of embodiment in the present invention；
Fig. 4 is the schematic diagram that one BFT network of embodiment obtains Transaction Set progress BFT common recognition from txns in the present invention；
Fig. 5 is the schematic diagram that the transaction that one client first of embodiment selects weight high in the present invention carries out transaction verification；
Fig. 6 is that BFT network acquisition DAG network txsn knows together in the embodiment of the present invention one, increases corresponding DAG network
The schematic diagram of weight.
Fig. 7 is the method schematic diagram of ballot selection motions sponsor in the embodiment of the present invention two；
Fig. 8 is the method schematic diagram of ballot selection common recognition group membership in the embodiment of the present invention three；
The method schematic diagram for the common recognition group that makes a choice by lot in the position Fig. 9 embodiment of the present invention four.
Specific embodiment
The preferred embodiments of the present invention will be described in detail with reference to the accompanying drawing, so that advantages and features of the invention energy
It is easier to be readily appreciated by one skilled in the art, so as to make a clearer definition of the protection scope of the present invention.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Embodiment one:
As shown in Figure 1, a kind of block chain based on DAG algorithm mixes common recognition method, the specific steps are as follows:
S1: client receive whithin a period of time single transaction or Transaction Set, client validation trade validity,
The transaction or Transaction Set being verified are known as txsv,
S2: the node of graph for defining DAG network is txsn, and weight is selected to be higher than two txsn of setting value from DAG network,
Transaction validation verification is carried out to the Transaction Set of the two txsn.
S3: after being verified, client submits txsv to DAG network, and is appended to the tail for two txsn being verified
Portion.
The common recognition promoter of S4:BFT randomly selects the txsn that weight is higher than setting value, and the txsn from DAG network
Father's block is successfully recorded on block chain by BFT, and BFT knows together promoter to txsn progress validation verification.If verifying is lost
It loses, then notifies the DAG network identity txsn invalid.
S5: it is known together after being verified using being determined property of BFT agreement.
S6: after common recognition, txsn common recognition is sent to DAG network from common recognition promoter and completes message.
After S7:DAG network detection BFT is total to the knowledgeable's identity, increase the txsn in the weighted value of DAG network.
The concrete application of the present embodiment is as follows:
DAG netinit, it is assumed that there are four txsn nodes.
Such as with five users of A, B, C, D, E, it is assumed that initial DAG network node situation is as shown in Fig. 2, wherein DAG network
There are four the txsn that weight is 10, and all know together on BFT network.
It is as shown in Figure 3: to trade assuming that client is submitted to DAG network simultaneously, wherein the remaining sum of B only has 30 yuan, two friendships
Can only easily there be a success.
As shown in Figure 4: BFT network obtains Transaction Set from txns and carries out BFT common recognition, and Sorry, your ticket has not enough value for discovery (B- > C, 18).
Other two txsn are successfully entered BFT network, increase the weight in DAG network.BFT network advertisement DAG network (B- > C, 18)
In vain.
As shown in Figure 5: the transaction that client first selects weight high carries out transaction verification, and is appended to the tail portion txsn.
As shown in Figure 6: BFT network obtains DAG network txsn and knows together, and increases corresponding DAG network weight.
Embodiment two:
As shown in fig. 7, S4 uses PoS algorithm in the case of other steps and identical embodiment one, i.e. equity proves.
Assuming that the whole network node total number are as follows: A, B, C, D, E, F, G, H, I, J, K, L
Assuming that the Token that each node account possesses is 10,15,100,1,50 ...
S41: ballot selection motions sponsor
Each node is mutually voted according to the Token number of itself, each node can votes be to hold with itself
Token is identical.Assuming that A obtains poll 180, B:20, C:100, D:33.Statistics voting results A obtains highest ticket in certain time
Number, A obtain motion power；
S42: go out block
The transaction that A receives itself carries out being packaged into block, is then broadcast to all nodes of the whole network.The whole network identifies first
The identity of A, cryptography, progress respectively fall block, complete out block process.
Embodiment three:
As shown in figure 8, S4 uses DPoS algorithm, i.e. commission equity in the case of other steps and identical embodiment one
Prove algorithm；
Assuming that the whole network node total number are as follows: A, B, C, D, E, F, G, H, I, J, K, L
Assuming that the Token that each node account possesses is 10,15,100,1,50 ...
S41: ballot selection common recognition group membership
Each node is according to itself Token number and holds time of Token and carries out COMPREHENSIVE CALCULATING, obtains ballot value.It is false
If A obtains poll 180, B:20, C:100, D:33, E:100, F:20, G:100, H:33.4 gained votes are selected according to configuration requirement
Highest node forms common recognition group, is A:180, C:100, E:100, G:100 respectively；
S42: motions sponsor's setting
In the four common recognition group memberships selected, motions sponsor is set.Can be sought according to wheel and according to poll height into
Row selection motion sequence.Assuming that we seek according to wheel carries out motions sponsor's setting, it is sequentially A, C, E, G；
S43: go out block
A carries out the transaction that itself receives to receive to be packaged into block, is then broadcast to all nodes of the whole network.The whole network identifies first
The identity of A, cryptography, progress respectively fall block, complete out block process.Next coherence is that C node goes out block, and C node receives itself
To transaction be packaged into block, after carrying out the whole network broadcast, respectively fall block.
Example IV
As shown in figure 9, S4 is encrypted using Algorand algorithm and is taken out in the case of other steps and identical embodiment one
The common recognition algorithm of label.
Assuming that the whole network node total number are as follows: A, B, C, D, E, F, G, H, I, J, K, L
Assuming that the Token that each node account possesses is 10,15,100,1,50 ...
S41: the common recognition that makes a choice by lot group
All nodes participate in drawing lots, and the node drawn is as common recognition group membership D, H, L, K；
S42: executing BFT and know together out block, and the common recognition group elected carries out wheel outflow block according to BFT algorithm.
It although an embodiment of the present invention has been shown and described, for the ordinary skill in the art, can be with
A variety of variations, modification, replacement can be carried out to these embodiments without departing from the principles and spirit of the present invention by understanding
And modification, subject to the scope of the present invention is defined by the following claims.
Claims (7)
1. a kind of block chain based on DAG algorithm mixes common recognition method, which is characterized in that specific step is as follows:
Step 1: transaction or Transaction Set are collected and verified to client；
Step 2: from DAG network select weight be higher than setting value at least two node of graph, and to the node of graph transaction or
Transaction Set carries out transaction validation verification, is then entered in next step by verifying；
Step 3: client submits transaction or Transaction Set to DAG network；
Step 4: using second of being determined property of the common recognition algorithm common recognition for being different from DAG common recognition algorithm；
Step 5: node of graph common recognition is sent to DAG network from common recognition promoter and completes message；
Step 6: increase weight of the node of graph in DAG network.
2. the block chain based on DAG algorithm mixes common recognition method according to claim 1, it is characterised in that: the step 4
In second common recognition algorithm be BFT algorithm, specifically: the common recognition promoter of BFT, which randomly selects weight from DAG network and is higher than, to be set
Definite value node of graph, and father's block of the node of graph is successfully recorded on block chain by BFT, BFT knows together promoter to the node of graph
Validation verification is carried out, such as authentication failed then notifies the DAG network identity node of graph invalid, is proved to be successful and then uses BFT agreement
Being determined property common recognition.
3. the block chain based on DAG algorithm mixes common recognition method according to claim 1, it is characterised in that: the step 4
In second common recognition algorithm be POS algorithm, specific steps are as follows:
4.1 ballot selection motions sponsors, each node mutually voted according to the Token number of itself, each node can votes be
It is identical as the Token that itself holds；
In 4.2 voting results, the most persons of number of votes obtained obtain motion power, and the transaction that itself is received carries out being packaged into area
Block is then broadcast to all nodes of the whole network, and the whole network identifies the identity of the most persons of number of votes obtained first, and progress respectively falls block, completes out
Block process.
4. the block chain based on DAG algorithm mixes common recognition method according to claim 1, it is characterised in that: the step 4
In second common recognition algorithm be DPOS algorithm, specific steps are as follows:
4.1 ballot selection common recognition group memberships, each node is according to itself Token number and holds time of Token and is integrated
It calculates, obtains ballot value；
4.2 motions sponsors setting sets motions sponsor in the common recognition group membership selected；
4.3 in the common recognition group membership selected, and according to the motion of setting sequence, progress respectively falls block, completes out block.
5. the block chain based on DAG algorithm mixes common recognition method according to claim 1, it is characterised in that: the step 4
In second common recognition algorithm be Algorand algorithm, specific steps are as follows:
4.1 make a choice by lot common recognition group；
The 4.2 common recognition groups elected carry out wheel outflow block according to BFT algorithm.
6. the block chain based on DAG algorithm mixes common recognition method according to claim 1, it is characterised in that: the step 2
In, selecting weight to be higher than the node of graph of setting value from DAG network is two.
7. the block chain based on DAG algorithm mixes common recognition method according to claim 1, it is characterised in that: the step 3
Specifically: client submits transaction or Transaction Set to DAG network, and is appended to the tail for the node of graph being verified
Portion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811086648.XA CN109214795A (en) | 2018-09-18 | 2018-09-18 | A kind of block chain mixing common recognition method based on DAG algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811086648.XA CN109214795A (en) | 2018-09-18 | 2018-09-18 | A kind of block chain mixing common recognition method based on DAG algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109214795A true CN109214795A (en) | 2019-01-15 |
Family
ID=64984607
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811086648.XA Pending CN109214795A (en) | 2018-09-18 | 2018-09-18 | A kind of block chain mixing common recognition method based on DAG algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109214795A (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109872161A (en) * | 2019-03-01 | 2019-06-11 | 山东大学 | A kind of chip and system accelerating IOTA subchain transaction verification process |
| CN109961364A (en) * | 2019-02-19 | 2019-07-02 | 众安信息技术服务有限公司 | A kind of method of commerce and system based on directed acyclic graph |
| CN110084596A (en) * | 2019-04-01 | 2019-08-02 | 杜晓楠 | A kind of method and apparatus of processing block chain mixing common recognition |
| CN110838947A (en) * | 2019-11-21 | 2020-02-25 | 桂林电子科技大学 | Multi-block output common chain consensus mechanism based on H-Algorand |
| CN110995790A (en) * | 2019-11-14 | 2020-04-10 | 北京联合天成价值网络科技有限公司 | Method for solving block chain network consensus uncertainty |
| CN111080288A (en) * | 2019-10-18 | 2020-04-28 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| CN111414373A (en) * | 2020-03-18 | 2020-07-14 | 深圳市网心科技有限公司 | Consensus method and consensus system |
| CN111600960A (en) * | 2020-05-22 | 2020-08-28 | 昆明大棒客科技有限公司 | Switching method of hybrid consensus mechanism in block chain and related equipment |
| CN111861459A (en) * | 2019-04-28 | 2020-10-30 | 常州一仙智能科技有限公司 | Iota account book optimization system and method based on DPoS consensus algorithm |
| CN111932252A (en) * | 2020-07-07 | 2020-11-13 | 广东工业大学 | DAG network-based wireless charging secure transaction method |
| CN112019380A (en) * | 2020-08-12 | 2020-12-01 | 西华大学 | Right excitation-based block chain consensus method combining Raft and PBFT algorithm |
| CN112202775A (en) * | 2020-09-29 | 2021-01-08 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN113516557A (en) * | 2021-07-14 | 2021-10-19 | 桂林电子科技大学 | Block chain with directed acyclic graph structure and implementation method thereof |
| JP2022541581A (en) * | 2019-08-01 | 2022-09-26 | ブルーム・テクノロジー・インコーポレイテッド | DAG-AWTC ledger system with BFT fixed agreement method |
| CN116188167A (en) * | 2023-04-17 | 2023-05-30 | 之江实验室 | Block chain system and consensus method based on DAG structure |
| CN116723200A (en) * | 2023-08-11 | 2023-09-08 | 杭州趣链科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
| US11769125B2 (en) | 2020-05-22 | 2023-09-26 | Baidu Online Network Technology (Beijing) Co., Ltd | Method and apparatus for processing transaction requests in blockchain, device and medium |
| RU2809645C2 (en) * | 2019-08-01 | 2023-12-14 | Блум Текнолоджи, Инк. | Dag-awtc register system using consensus bft verification mechanism |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106445711A (en) * | 2016-08-28 | 2017-02-22 | 杭州云象网络技术有限公司 | Byzantine-fault-tolerant consensus method applied to block chain |
| US20170323392A1 (en) * | 2016-05-05 | 2017-11-09 | Lance Kasper | Consensus system for manipulation resistant digital record keeping |
| CN107360248A (en) * | 2017-07-31 | 2017-11-17 | 众安信息技术服务有限公司 | For configuring the method and apparatus locally known together and computer-readable recording medium |
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
-
2018
- 2018-09-18 CN CN201811086648.XA patent/CN109214795A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170323392A1 (en) * | 2016-05-05 | 2017-11-09 | Lance Kasper | Consensus system for manipulation resistant digital record keeping |
| CN106445711A (en) * | 2016-08-28 | 2017-02-22 | 杭州云象网络技术有限公司 | Byzantine-fault-tolerant consensus method applied to block chain |
| CN107360248A (en) * | 2017-07-31 | 2017-11-17 | 众安信息技术服务有限公司 | For configuring the method and apparatus locally known together and computer-readable recording medium |
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109961364A (en) * | 2019-02-19 | 2019-07-02 | 众安信息技术服务有限公司 | A kind of method of commerce and system based on directed acyclic graph |
| CN109961364B (en) * | 2019-02-19 | 2021-04-06 | 众安信息技术服务有限公司 | Transaction method and system based on directed acyclic graph |
| CN109872161A (en) * | 2019-03-01 | 2019-06-11 | 山东大学 | A kind of chip and system accelerating IOTA subchain transaction verification process |
| CN109872161B (en) * | 2019-03-01 | 2021-05-04 | 山东大学 | Chip and system for accelerating IOTA sub-chain transaction verification process |
| CN110084596A (en) * | 2019-04-01 | 2019-08-02 | 杜晓楠 | A kind of method and apparatus of processing block chain mixing common recognition |
| CN110084596B (en) * | 2019-04-01 | 2023-02-10 | 杜晓楠 | Method and device for processing block chain mixed consensus |
| CN111861459A (en) * | 2019-04-28 | 2020-10-30 | 常州一仙智能科技有限公司 | Iota account book optimization system and method based on DPoS consensus algorithm |
| JP2022541581A (en) * | 2019-08-01 | 2022-09-26 | ブルーム・テクノロジー・インコーポレイテッド | DAG-AWTC ledger system with BFT fixed agreement method |
| RU2809645C2 (en) * | 2019-08-01 | 2023-12-14 | Блум Текнолоджи, Инк. | Dag-awtc register system using consensus bft verification mechanism |
| JP7318104B2 (en) | 2019-08-01 | 2023-07-31 | ブルーム・テクノロジー・インコーポレイテッド | DAG-AWTC ledger system with BFT fixed agreement method |
| CN111080288B (en) * | 2019-10-18 | 2023-08-18 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| CN111080288A (en) * | 2019-10-18 | 2020-04-28 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| CN110995790A (en) * | 2019-11-14 | 2020-04-10 | 北京联合天成价值网络科技有限公司 | Method for solving block chain network consensus uncertainty |
| CN110838947B (en) * | 2019-11-21 | 2021-04-23 | 桂林电子科技大学 | Multi-block output common chain consensus mechanism based on H-Algorand |
| CN110838947A (en) * | 2019-11-21 | 2020-02-25 | 桂林电子科技大学 | Multi-block output common chain consensus mechanism based on H-Algorand |
| CN111414373A (en) * | 2020-03-18 | 2020-07-14 | 深圳市网心科技有限公司 | Consensus method and consensus system |
| CN111414373B (en) * | 2020-03-18 | 2023-09-19 | 深圳市迅雷网络技术有限公司 | Consensus method and consensus system |
| CN111600960A (en) * | 2020-05-22 | 2020-08-28 | 昆明大棒客科技有限公司 | Switching method of hybrid consensus mechanism in block chain and related equipment |
| US11769125B2 (en) | 2020-05-22 | 2023-09-26 | Baidu Online Network Technology (Beijing) Co., Ltd | Method and apparatus for processing transaction requests in blockchain, device and medium |
| CN111932252A (en) * | 2020-07-07 | 2020-11-13 | 广东工业大学 | DAG network-based wireless charging secure transaction method |
| CN112019380B (en) * | 2020-08-12 | 2022-07-22 | 西华大学 | Right excitation-based block chain consensus method combining Raft and PBFT algorithm |
| CN112019380A (en) * | 2020-08-12 | 2020-12-01 | 西华大学 | Right excitation-based block chain consensus method combining Raft and PBFT algorithm |
| CN112202775B (en) * | 2020-09-29 | 2021-06-22 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN112202775A (en) * | 2020-09-29 | 2021-01-08 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN113516557B (en) * | 2021-07-14 | 2022-09-23 | 桂林电子科技大学 | Block chain with directed acyclic graph structure and implementation method thereof |
| CN113516557A (en) * | 2021-07-14 | 2021-10-19 | 桂林电子科技大学 | Block chain with directed acyclic graph structure and implementation method thereof |
| CN116188167A (en) * | 2023-04-17 | 2023-05-30 | 之江实验室 | Block chain system and consensus method based on DAG structure |
| CN116188167B (en) * | 2023-04-17 | 2023-08-04 | 之江实验室 | Block chain system and consensus method based on DAG structure |
| CN116723200A (en) * | 2023-08-11 | 2023-09-08 | 杭州趣链科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
| CN116723200B (en) * | 2023-08-11 | 2023-11-10 | 武汉趣链数字科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109214795A (en) | A kind of block chain mixing common recognition method based on DAG algorithm | |
| Zhou et al. | Pirate: A blockchain-based secure framework of distributed machine learning in 5g networks | |
| FI129087B (en) | Blockchain network accessing method and system | |
| Zhang et al. | Blockchain-based distributed software-defined vehicular networks: a dueling deep ${Q} $-learning approach | |
| Kogias et al. | Enhancing bitcoin security and performance with strong consistency via collective signing | |
| CN111311414A (en) | Block chain multi-party consensus method based on consistent hash algorithm | |
| CN111010278B (en) | High-fault-tolerance layering consensus method based on DPoS | |
| CN109447795A (en) | Byzantine consensus method supporting rapid achievement of final confirmation | |
| CN110380847A (en) | A kind of block chain common recognition method and apparatus | |
| Liu et al. | MDP-based quantitative analysis framework for proof of authority | |
| CN111179087B (en) | Alliance chain consensus method based on grid arbitration | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| Islam et al. | A comparative analysis of proof-of-authority consensus algorithms: Aura vs Clique | |
| CN109886810A (en) | Crowdsourcing method of commerce and system, readable storage medium storing program for executing and terminal | |
| CN113568972A (en) | Mixed consensus realization device and method for schema block chain | |
| CN113283892A (en) | PoSearch and PBFT fusion consensus algorithm based on voting mechanism | |
| Qushtom et al. | A two-stage PBFT architecture with trust and reward incentive mechanism | |
| Xiao et al. | Proof of importance: A consensus algorithm for importance based on dynamic authorization | |
| CN111490994B (en) | Consensus mechanism method for combining DPOS between block link point groups and POW in node group | |
| Georgiou et al. | Implementing three exchange read operations for distributed atomic storage | |
| CN110555764B (en) | Method and system for block chain consistency under decentralized environment | |
| CN115883578A (en) | 5G power network node trust management method based on block chain technology | |
| Sun et al. | A Scalable Sharding Protocol Based on Cross-Shard Dynamic Transaction Confirmation for Alliance Chain in Intelligent Systems | |
| Gupta | Resilient and scalable architecture for permissioned blockchain fabrics | |
| Wu et al. | Multimaster Node Byzantine Fault-Tolerant Consensus Algorithm Based on Consistent Hash Algorithm |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190115 |