Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A block-chain hybrid consensus method based on DAG algorithm

A blockchain and consensus technology, applied in the computer field, can solve the problems of inability to accurately judge whether synchronization is complete, inability to know when the transaction is valid, and uncertainty of transaction confirmation time, so as to improve transaction query efficiency, improve consensus efficiency, Improve the effect of trading TPS

Inactive Publication Date: 2019-01-15
北京物链互联科技有限公司
View PDF4 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The obvious disadvantage of DAG is that the transaction confirmation time is uncertain, and it is impossible to know when the transaction will be valid
At the same time, the transaction query cannot accurately describe the coordinates of the block where the exchange is located, so the query efficiency is low
When performing block synchronization, it will not be possible to accurately determine whether the synchronization is complete

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A block-chain hybrid consensus method based on DAG algorithm
  • A block-chain hybrid consensus method based on DAG algorithm
  • A block-chain hybrid consensus method based on DAG algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0047] Such as figure 1 As shown, a blockchain hybrid consensus method based on the DAG algorithm, the specific steps are as follows:

[0048] S1: The client receives a single transaction or transaction set within a period of time, the client verifies the validity of the transaction, and the verified transaction or transaction set is called txsv,

[0049] S2: Define the graph node of the DAG network as txsn, select two txsn whose weight is higher than the set value from the DAG network, and verify the transaction validity of the transaction sets of these two txsn.

[0050] S3: After the verification is passed, the client submits txsv to the DAG network and appends it to the end of the two txsn that passed the verification.

[0051] S4: The BFT consensus initiator randomly selects a txsn whose weight is higher than the set value from the DAG network, and the parent block of the txsn is successfully recorded on the blockchain by BFT, and the BFT consensus initiator verifies the v...

Embodiment 2

[0063] Such as Figure 7 As shown, in the case that other steps are the same as in the first embodiment, S4 adopts the PoS algorithm, that is, proof of rights and interests.

[0064] Suppose the total number of nodes in the whole network is: A, B, C, D, E, F, G, H, I, J, K, L

[0065] Assume that the Tokens owned by each node account are 10, 15, 100, 1, 50...

[0066] S41: Vote to select the proposer

[0067] Each node votes for each other according to its own Token number, and the number of votes each node can vote is the same as the Token it holds. Suppose A gets 180 votes, B: 20, C: 100, D: 33. Count the voting results within a certain period of time. A gets the highest number of votes, and A gets the proposal power;

[0068] S42: Block out

[0069] A packages the transactions it has received into blocks, and then broadcasts them to all nodes in the entire network. The whole network first identifies the identity of A, uses cryptography, performs each block, and comple...

Embodiment 3

[0071] Such as Figure 8 As shown, in the case that other steps are the same as in Embodiment 1, S4 adopts the DPoS algorithm, that is, the delegated proof-of-stake algorithm;

[0072] Suppose the total number of nodes in the whole network is: A, B, C, D, E, F, G, H, I, J, K, L

[0073] Assume that the Tokens owned by each node account are 10, 15, 100, 1, 50...

[0074] S41: Vote to select members of the consensus group

[0075] Each node conducts a comprehensive calculation based on its own Token number and the time it holds Token to obtain the voting value. Suppose A gets 180 votes, B: 20, C: 100, D: 33, E: 100, F: 20, G: 100, H: 33. According to the configuration requirements, four nodes with the highest votes are selected to form a consensus group, which are A:180, C:100, E:100, G:100;

[0076] S42: Proposer setting

[0077] Among the four selected members of the consensus group, set the proposer. The order of proposals can be selected according to round-robin or acc...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

A block chain hybrid consensus method based on DAG algorithm comprises the following steps: 1.a client collects and verifies transactions or transaction sets; 2, selecting at least two graph nodes whose weight is high than that set value from the DAG network, verifying the transaction validity of the graph nodes or the transaction set, and proceed to the next step after the verification; 3, the client end submits a transaction or a transaction set to the DAG network; Step 4, adopting a second consensus algorithm different from the DAG consensus algorithm to carry out deterministic consensus; 5, the consensus initiator sends a graph node consensus completion message to the DAG network; Step 6: increasing the weight of the graph node in the DAG network.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a block chain hybrid consensus method based on a DAG algorithm. Background technique [0002] Blockchain technology uses block chain data structure to verify and store data, uses distributed node consensus algorithm to generate and update data, uses cryptography to ensure the security of data transmission and access, and utilizes intelligence composed of automated script codes. A new distributed infrastructure and computing method for programming and manipulating data through contracts; [0003] There are many existing consensus algorithms, such as PoW, DAG, PBFT, RAFT, and PAXOS algorithms. Among them, PoW, DAG, and PBFT are Byzantine fault-tolerant consensus. The PoW algorithm uses the workload proof algorithm to produce blocks in an average of 10 minutes, but PoW is prone to forks. 6 block confirmations are required to ensure that block transactions are valid; [0004] RAF...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q20/06G06Q20/40G06Q40/04
CPCG06Q20/065G06Q20/401G06Q40/04
Inventor 杨宁徐加明
Owner 北京物链互联科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com