Distributed Data Consistency via Node Trust Accumulation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current centralized arbitration methods in parallel network computing environments decrease the parallel feature of systems, increase the risk of single-point failures, and are not suitable for decentralized computing scenarios, while decentralized POW arbitration methods consume excessive computing resources and suffer from low efficiency.
Innovation Solution
A method using node trust accumulation and multiplication to co-assemble consistent data through a network of nodes that examine and verify each other's data blocks according to pre-defined or jointly generated rules, forming trusted partnerships and expanding data block groups until specific conditions are met, allowing for independent examination and encapsulation of consistent data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If centralized arbitration mechanism is used, then data consistency can be maintained, but the parallel feature of the system decreases and single point failure risk increases
Solution Approach 1:
The patent segments the centralized arbitration function into distributed node-level verification. Each node independently verifies data blocks according to pre-defined rules, eliminating the single centralized authority while maintaining consistency through collective validation.
Solution Approach 2:
Nodes perform self-verification and mutual verification of data blocks without requiring centralized arbitration. Each node uses its own computing resources to verify data consistency, making the system self-governing and eliminating dependency on central authorities.
2Reliability
If centralized arbitration mechanism is used, then data consistency can be maintained, but the risk of single point failures increases
Solution Approach 1:
The patent divides the arbitration function across multiple nodes, segmenting the centralized authority into distributed verification points. This eliminates the single point of failure by ensuring that no single node can compromise system reliability.
Solution Approach 2:
Each node maintains local verification capabilities and independent judgment on data blocks. Nodes apply pre-defined rules locally to verify data consistency, ensuring that verification can continue even if certain nodes fail or are compromised.
3Productivity
If decentralized POW arbitration method is used, then system parallelism is improved, but computing resource consumption increases and arbitration efficiency decreases
Solution Approach 1:
Instead of requiring full POW proof-of-work verification, the patent implements partial verification where nodes only perform necessary checks on data blocks. This reduces computing resource consumption while maintaining sufficient verification capability for data consistency.
Solution Approach 2:
The patent changes the verification parameter from computational intensity (POW) to rule-based validation. Nodes verify data according to pre-defined rules rather than performing intensive cryptographic computations, reducing energy consumption while maintaining parallel processing capability.
Data Source
Figure 1(a)
Figure 1(b)
Figure 1(c)
AI summary
A method is disclosed for accumulating and co-assembling consistent data. The method includes: 1) a node A packaging data D into data black DA according to a generation rule, and broadcasting a mutually trusted assembly invitation; 2) after a node B has approved the mutually trusted assembly invitation, assembling the DA and a data block DB of node B according to the generation rule, and returning an assembly result to node A; 3) after node A has validated the assembly result, establishing a mutually trusted partnership between node A and node B; 4) the mutually trusted partner nodes inspecting whether the stored assembly result meets a setting condition of an assembly rule, and if not, the mutually trusted partner nodes respectively broadcasting a mutually trusted assembly invitation to a network; and 5) after a node i has approved the mutually trusted assembly invitation, assembling the assembly result and a data block Di of the node i according to the generation rule, and returning a new assembly result to the invitation node, after all mutually trusted partner nodes issuing the invitation have approved the new assembly result, storing the new assembly result, and adding node i as a mutually trusted partner.