Blocktree Distributed Storage for Fast Access and Data Integrity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed computing systems face challenges in ensuring data integrity and confidentiality, particularly in managing data locality and latency, while dealing with user devices that have increased computational and storage capabilities, leading to higher development costs and potential data breaches.
Innovation Solution
A hierarchical tree structure, referred to as blocktree, is implemented to organize computing devices and data blocks, enabling read and write access through cryptographic operations, with a file system interface that controls server data storage and ensures data integrity and confidentiality, using a Merkle tree for write integrity and a Raft consensus protocol for synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If data is distributed across various geographical boundaries to reduce latency and improve user experience, then data access speed and user experience are improved, but data integrity and confidentiality become harder to ensure
Solution Approach 1:
The system segments data into discrete data blocks that are distributed across multiple servers in a hierarchical tree structure. Each data block is independently addressable and can be stored on different servers, allowing parallel access while maintaining individual block integrity through cryptographic hashing.
Solution Approach 2:
The patent introduces a Merkle tree structure as an intermediary mechanism that connects distributed data blocks to their logical hierarchy. The Merkle root serves as a mediator that enables verification of data integrity without requiring direct access to all underlying data blocks, thus maintaining confidentiality while ensuring reliability.
2Power
If user devices are given increased computational and storage capabilities to handle distributed data, then processing power and storage capacity are improved, but development costs and security risks increase
Solution Approach 1:
The system employs universal cryptographic primitives (hashing, digital signatures) that can be implemented across diverse user devices regardless of their specific computational capabilities. This allows devices with varying power levels to participate in the distributed system without requiring device-specific customizations, reducing development complexity.
Solution Approach 2:
Each user device autonomously generates its own cryptographic key pairs and manages its local data blocks independently. The system does not require centralized key management or complex coordination protocols, allowing devices to self-configure and reducing the burden on developers to manage device heterogeneity.
3Reliability
If data is replicated across multiple servers to ensure confidentiality and integrity, then data security is improved, but write performance and synchronization become more complex
Solution Approach 1:
The system pre-computes Merkle tree hashes and stores them alongside data blocks during the write operation. This preliminary hashing action allows for efficient later verification of data integrity without requiring re-computation, thus maintaining security while improving write performance.
Solution Approach 2:
The patent replaces traditional mechanical consensus protocols (which require multiple rounds of communication and coordination) with cryptographic verification based on Merkle trees. Instead of physically coordinating between servers through complex message passing, the system uses mathematical proofs of integrity that can be independently verified, dramatically simplifying synchronization.
4Productivity
If a hierarchical tree structure is implemented to organize data blocks and servers, then data management efficiency is improved, but system complexity increases
Solution Approach 1:
The system implements a nested hierarchical structure where data blocks are organized into directories, which are organized into parent directories, forming a tree structure. Each level of the hierarchy is represented as a data block itself, creating nested layers of organization that improve management efficiency while maintaining a consistent simple interface at each level.
Solution Approach 2:
The patent introduces an additional dimensional layer of organization by mapping the hierarchical tree structure onto a distributed server network. Instead of organizing data in a single flat dimension, the system adds the spatial dimension of server distribution, allowing efficient local access while maintaining global organization through the hierarchical structure.
Data Source
AI summary
Embodiments of the present disclosure provide systems and methods for organizing information and one or more computing devices into a hierarchical tree structure. The system includes a memory storing a root directory configured to store an identifier of an owner of the hierarchical tree structure. In addition, the system includes one or more registers storing one or more data blocks configured to store the information. The one or more data blocks include at least one of: files and directories. The system further includes one or more servers to represent the one or more computing devices. Furthermore, the system includes one or more processors configured to run one or more processes on the one or more servers.