Distributed Node Categorization for Scalable Consensus Reliability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed computing systems face limitations such as nodes operating beyond their capacity, heuristic-based partitioning failures, inability to store large records, and scalability issues due to the need for uniform node capabilities, leading to underutilization of more powerful devices and increased risk of data compromise.
Innovation Solution
A method to categorize computing devices based on their characteristics, allowing nodes with similar capabilities to form categories that perform distinct functions, enabling more diverse and efficient utilization of resources within the distributed computing system, where nodes can be added or reassigned based on their capabilities and system needs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If uniform node capabilities are required for all nodes in the distributed computing system, then consensus operations can be performed reliably, but more powerful computing devices cannot be fully utilized and the system cannot scale effectively
Solution Approach 1:
The patent segments the distributed computing system into multiple categories based on node capabilities. Nodes are divided into different categories (e.g., full nodes, light nodes, mining nodes) with different functional requirements. This segmentation allows powerful devices to be assigned to categories that utilize their full capabilities while maintaining consensus reliability through specialized node roles.
Solution Approach 2:
The patent applies local quality by assigning different functional qualities to different nodes based on their capabilities. Instead of requiring all nodes to have identical capabilities, each node is configured with the specific quality appropriate to its category. Powerful nodes can handle complex computations and storage while less capable nodes perform simpler validation functions, optimizing resource utilization across the network.
2Reliability
If all nodes must store and process the same data for consensus, then data integrity is maintained, but the system cannot handle large numbers of records and powerful devices are underutilized
Solution Approach 1:
The patent segments data storage and processing responsibilities across different node categories. Full nodes store complete blockchain data and perform comprehensive validation, while light nodes store only essential verification data. This segmentation enables the system to handle large numbers of records by distributing storage burdens appropriately, allowing powerful devices to handle large-scale data processing while maintaining data integrity through the consensus of full nodes.
Solution Approach 2:
The patent creates a multi-functional system where different node categories serve different functions within the same distributed ledger network. Full nodes perform comprehensive validation and storage, light nodes provide rapid verification, and mining nodes handle transaction processing. This universality allows the system to process large volumes of data efficiently while maintaining integrity through the coordinated operation of diverse node types.
3Ease of manufacture
If heuristic-based partitioning is used to divide nodes into groups, then initial organization is simplified, but the system creates known points of failure and cannot dynamically adapt to changing node capabilities
Solution Approach 1:
The patent implements dynamic node categorization that automatically adapts to changing node capabilities and system conditions. Nodes can transition between categories based on their performance, availability, and capability changes. This dynamic approach eliminates the static nature of heuristic-based partitioning, allowing the system to recover from failures by reassigning nodes to appropriate categories and preventing single points of failure that would exist in fixed partitioning schemes.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
Adding a computing node to a distributed computing system. A method includes executing a binary, for nodes of the distributed computing system, at the computing node. A public node is identified as a result of executing the binary. Various characteristics of the computing node are identified as a result of executing the binary. The various characteristics are provided to the public node. The computing node receives from the public node a registration confirmation packet comprising information identifying a category from among a plurality of categories of the distributed computing system. The identified category is identified for the computing node based on the identified characteristics of the computing node, and based on the health of the identified category. The computing node is connected to the distributed computing system by the computing node connecting to the identified category.