PATENT CLAIM ANALYSIS

Application Number: 16361067
Application Type: Utility
Filing Date: 2019-03
Publication Date: 2019-07
Patent Classification: ["709", "245000"]

Abstract:
An example topology construction method for satisfying partition tolerance, comprising: combining the consortium blockchain consensus mechanism with the network topology structure to make the consortium blockchain consensus satisfy the partition tolerance in probability; abstracting the partition tolerance of a system into a class of convergent Markov process and computing a steady-state probability of the system; estimating the probability and the average minimum repair time of failing to meet consistency or availability in the event of a partition failure with a given number of failure channels, and a partition tolerance probability and an average minimum repair time of the system are obtained; and analyzing the resource overhead and the partition tolerance under different network topologies according to the obtained partition tolerance probability and the average minimum repair time, and constructing the network topology structure with suitable scale and high partition tolerance for the consortium blockchain consensus of different needs.

Claim (Index 8):
The topology construction system for satisfying partition tolerance in the consortium blockchain consensus according to  claim 7 , wherein in the hierarchical network topology structure, according to the process of consensus, the partition tolerance of a lower-level domain is not only affected by its network topology structure, but is also related to the partition tolerance of a higher-level domain; wherein the partition tolerance probability of the system is p=1\u2212\u03a3 m=1 n \u03a3(i 1 ,i 2 ,i 3 , . . . ,i m )p i1 p i1i2 p i1i2i3  . . . p i1i2i3 . . . im\u22121 (1\u2212p i1i2i3 . . . im ); wherein the average minimum repair time of the system is t = \u2211 m = 1 n \ue89e \u2211 ( i 1 , i 2 , i 3 , \u2026 \ue89e , i m ) \ue89e t i \ue89e \ue89e 1 \ue89e i \ue89e \ue89e 2 \ue89e i \ue89e \ue89e 3 \ue89e \ue89e \u2026 \ue89e \ue89e i \ue89e \ue89e m \u00b7 pi \ue89e \ue89e 1 \ue89e pi \ue89e \ue89e 1 \ue89e i \ue89e \ue89e 2 \ue89e pi \ue89e \ue89e 1 \ue89e i \ue89e \ue89e 2 \ue89e i \ue89e \ue89e 3 \ue89e \ue89e \u2026 \ue89e \ue89e pi \ue89e \ue89e 1 \ue89e i \ue89e \ue89e 2 \ue89e i \ue89e \ue89e 3 \ue89e \ue89e \u2026 \ue89e \ue89e i \ue89e \ue89e m - 1 \ue89e ( 1 - Pi \ue89e \ue89e 1 \ue89e i \ue89e \ue89e 2 \ue89e i \ue89e \ue89e 3 \ue89e \ue89e \u2026 \ue89e \ue89e i \ue89e \ue89e m ) 1 - p ; where p i1i2i3 . . .  represents the partition tolerance probability of each domain, and t i1i2i3 . . .  represents the average minimum repair time of each domain.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 99.0
- Lexical Diversity: 2.22857
- Patent Class: 709.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15997710', '14922879', '16136637', '15942604', '16135701']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2393170653708318
- 35 USC 102 Novelty (BERT): 0.4988394151476005
- Combined Prediction Score: 0.2652693003485087
- Mean Citation Score: 160.15512800000005
- Max Citation Score: 165.66400000000004
- Similarity Product: 99.859555557251

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test