Unlock instant, AI-driven research and patent intelligence for your innovation.

High-speed consensus method based on block chain

A block chain and consensus technology, applied in the field of block chain, can solve the problems of block chain performance improvement, consumption of large computer computing resources and network resources, etc., to reduce computer computing power and network resource costs, improve Consensus performance, the effect of increasing the number of concurrent transactions

Pending Publication Date: 2022-03-11
ZHONGRUI COMM PLANNING & DESIGN +1
View PDF1 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] In order to solve the technical defect that the existing PBFT consensus algorithm needs to consume a large amount of computer computing resources and network resources in the Prepare stage, which leads to the difficulty in improving the performance of the block chain using the PBFT consensus algorithm, the present invention provides a high-speed block chain based consensus method

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
  • High-speed consensus method based on block chain
  • High-speed consensus method based on block chain
  • High-speed consensus method based on block chain

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0059] Such as figure 1 As shown, the master node puts the transaction into the cache pool; the master node polls the slave nodes and selects the optimal slave node; the master node generates a cache pool access token and sends it to the optimal slave node; the optimal slave node Rely on the cache pool access token to search for transactions in the cache pool; the optimal secondary node downloads the transaction, performs transaction summary calculation, transaction summary comparison, and comparison result broadcast; after the optimal secondary node completes the work, it replies to the primary node, The master node deletes the corresponding transaction in the cache pool; then proceed to the next round of consensus.

Embodiment 2

[0061] Such as figure 2 with image 3 As shown, the reconfiguration method in the Prepare phase includes a polling operation flow and a verification operation flow in sequence.

[0062] The polling operation process includes the following steps:

[0063] S1: The master node puts the transaction to be verified into the cache pool of the local memory, and all transactions in the cache pool are sorted by Seq number, and only the master node has the permission to write and delete transactions in the cache pool;

[0064] S2: The master node confirms whether the values ​​of N, ni, hi, and Tmax have been updated, if yes, update, if not, go to the next step;

[0065] S3: The master node updates q according to real-time messages i , j;

[0066] S4: Master node calculates i=jMOD(N-1);

[0067] S5: master node computing

[0068] S6: Master node compares tq i and if tq i less than Then jump to S9, if tq i greater or equal to Then proceed to S7;

[0069] S7: master node ...

Embodiment 3

[0086] In this embodiment, assume that the following entities exist in the blockchain network:

[0087] Client C

[0088] Blockchain consensus node n 1 , n 2 , n 3 , n 4

[0089] Other known conditions required by the master node:

[0090] Seq=1501

[0091] N-1=3

[0092] q 1 =10,q 2 =100,q 3 =1000

[0093] h 1 =10000, h 2=20000, h 3 =30000

[0094] j-5

[0095] T max =10000

[0096] The consensus steps for patent improvement of the present invention are as follows:

[0097] Blockchain client C sends to master node n 1 A transaction "Transaction" is uploaded, "Transaction" contains , m is the transaction content, D(m) is the transaction summary, and Sign is the digital signature of client C.

[0098] master node n main Give the transaction "Transaction" number Seq 1501, and add the number to the transaction header "Seq1501+Transaction"

[0099] The master node puts the transaction "Seq 1501+Transaction" into the cache pool in the order of Seq numbers.

...

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

The invention relates to a high-speed consensus method based on a block chain, and the method sequentially comprises a Request stage, a Prepart stage, a Prepart stage, a Commit stage and a Reply stage, the Prepart stage and the Prepart stage carry out reconstruction, and a main node puts a transaction into a cache pool; the main node polls the auxiliary nodes, and the optimal auxiliary node is selected; the main node generates a cache pool access token and sends the cache pool access token to the optimal auxiliary node; the optimal auxiliary node searches the transaction in the cache pool by means of the cache pool access token; the optimal auxiliary node downloads the transaction, and performs transaction abstract calculation, transaction abstract comparison and comparison result broadcasting work; after the optimal auxiliary node completes work, the main node is replied, and the main node deletes the corresponding transaction in the cache pool; and next consensus is carried out. According to the method, the computer computing power overhead and the network resource overhead of the stage are reduced, so that the time consumption of the stage can be reduced, the consensus performance of the block chain is improved, and the concurrent transaction number of the block chain is increased.

Description

technical field [0001] The present invention relates to the field of block chains, and more specifically, to a high-speed consensus method based on block chains. Background technique [0002] In the traditional consortium chain blockchain, PBFT (Practical Byzantine Fault Tolerance) or a variant of the PBFT consensus algorithm is usually used to achieve consistent storage of data on the blockchain. The traditional PBFT consensus algorithm is divided into five stages: Request, Pre-prepare, Prepare, Commit, and Reply. The workflow is as follows: Image 6 As shown, C is the transaction on-chain request client, 0 is the master node, and 1-3 are the three slave nodes. [0003] The specific working principle of the traditional PBFT (Practical Byzantine Fault Tolerance) consensus algorithm is as follows: [0004] Request: The client sends a transaction on-chain request to the master node, and the request includes transaction content, transaction summary and message signature; [0...

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
IPC IPC(8): G06Q20/38G06Q40/04G06F9/54G06F21/64
CPCG06Q20/3825G06Q20/3827G06Q40/04G06F9/546G06F9/542G06F21/64
Inventor 李鹏飞蒋绍杰曾嘉炜曾哲君
Owner ZHONGRUI COMM PLANNING & DESIGN