Check patentability & draft patents in minutes with Patsnap Eureka AI!

An IIFT block chain consensus algorithm

A blockchain and consensus technology, applied in the blockchain field, can solve problems such as low performance, PoW algorithm consumes large computing resources, and excessive network overhead, so as to achieve the effect of reducing network overhead and avoiding the risk of chain forks

Pending Publication Date: 2019-06-18
无锡一邦网络科技有限公司
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

A single consensus algorithm has various problems, such as the PoW algorithm that consumes a large amount of computing resources and has low performance; PoS or DPoS has the problem of "rich rule"; and the PBFT algorithm with a sound theoretical proof faces the network overhead caused by broadcasting oversized problem

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
  • An IIFT block chain consensus algorithm
  • An IIFT block chain consensus algorithm
  • An IIFT block chain consensus algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0030] Such as Figure 1-2 As shown, an IIFT blockchain consensus algorithm is applied to the node pool, and its steps are:

[0031] (1) The node has passed the "Security Committee" to verify the hardware, location and owner, become a preparation node, and join the preparation node pool;

[0032] (2) Based on the equity currency owned by the preparation node and the online time of the preparation node, calculate the bookkeeping weight coefficient of each preparation node, and the bookkeeping weight coefficient of a single preparation node

[0033]

[0034] Among them, I is the number of equity coins of the node, ∑(i) is the total number of equity coins, T is the online time of the node, ∑(t) is the online time of all nodes, α is the proportion coefficient of equity coins, and β is the proportion coefficient of online time; prepare the node After multiplying by the bookkeeping weight coefficient, 21 bookkeeping nodes required for one bookkeeping cycle are randomly generated...

Embodiment 2

[0042] An IIFT blockchain consensus algorithm, the steps of which include multiplying the preparation node by the bookkeeping weight coefficient to randomly generate 21 bookkeeping nodes required for a bookkeeping cycle.

[0043] Randomly select one of the N preparation nodes with different weights, and make the overall selection result be distributed according to the weight. If there are 4 nodes A, B, C, and D, the weights are 1, 2, 3, and 4 respectively, and the ratio of A:B:C:D in the random result should be 1:2:3:4.

[0044] Suppose the weight A(1)-B(3)-C(6)-D(10) of each element is accumulated, then the weight jurisdictions of the four nodes are [0,1), [1,3), [ 3,6), [6,10). Then a random number between [0,10) is randomly generated. Which interval it falls in, the node after this interval is the accounting node of this round.

[0045] Using TreeMap, construct such as image 3 The treemap shown, and then use treemap.tailMap().firstKey() to find the target element. It ...

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 discloses an IIFT block chain consensus algorithm. Preparation nodes are prepared in a node pool; twenty-one accounting nodes in an accounting period are selected from the preparation nodes in the preparation node pool through random selection according to the accounting weight; The selected accounting nodes are ranked randomly again, each accounting node generates a block in a blockperiod and records the accounting node as a main node, and the main node broadcasts the generated block; After the main node broadcasts, other nodes in the preparation node pool verify the block andadd the block into an account book, and the accounting node sends a confirmation message to the main node; whether the transaction in the block is confirmed is determined according to the verificationcondition of the accounting node; And when the bookkeeping of all the bookkeeping nodes is finished, the bookkeeping period is finished, and all the bookkeeping nodes are offline. According to the method, the problem of'luxury unified treatment 'of the POS or the DPOS is effectively avoided, the enthusiasm of node participation is effectively encouraged, the risk of chain branching is effectivelyavoided, and the network overhead is also greatly reduced.

Description

Technical field: [0001] The invention belongs to the technical field of block chains, in particular to an IIFT block chain consensus algorithm. Background technique: [0002] The consensus algorithm solves the process of reaching a consensus on a proposal (Proposal). It has become a key bottleneck in the performance of the blockchain system. A single consensus algorithm has various problems, such as the PoW algorithm that consumes a large amount of computing resources and has low performance; PoS or DPoS has the problem of "rich rule"; and the PBFT algorithm with a sound theoretical proof faces the network overhead caused by broadcasting Too big a problem. The idea of ​​combining the advantages of multiple consensus algorithms is gaining more and more attention. [0003] The information disclosed in this Background section is only for enhancing the understanding of the general background of the present invention and should not be taken as an acknowledgment or any form of ...

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): G06Q40/04G06F21/64
Inventor 高榕
Owner 无锡一邦网络科技有限公司
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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