Dynamic Blockchain Tree Versioning for Scalable Private Views
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing tree structures overlaid on blockchain networks, such as the Metanet, are static and limit users to a single view, leading to inefficiencies in scalability and privacy, as all users see the same nodes and cannot be updated dynamically.
Innovation Solution
Implement a dynamic tree structure using the Metanet Flux Protocol (MFP) that allows creation of multiple versions of the tree based on off-chain parameters, enabling user-specific and time-variant views, with edges that can be obfuscated and weights incorporated, and includes Proof of Work.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a static tree structure is used, then the structure is simple and stable, but scalability and privacy are limited as all users see the same nodes
Solution Approach 1:
The patent transforms the static tree structure into a dynamic one by introducing versioning mechanisms. Each node can have multiple versions (e.g., node v1, node v2) that represent different states or views of the same data. This allows the tree to adapt and change its structure based on user-specific parameters while maintaining the underlying blockchain's immutability.
Solution Approach 2:
The tree structure is segmented into multiple versions and branches. Instead of a single monolithic tree, the system divides the data into different versions (v1, v2, etc.) that can be selectively accessed. Each version can have different child nodes, enabling user-specific views while maintaining overall structural integrity.
2Productivity
If the tree structure is made dynamic with multiple versions, then scalability and privacy improve, but the complexity of managing and accessing the structure increases
Solution Approach 1:
The patent uses copying by creating multiple versions of nodes (node v1, node v2) rather than modifying a single structure. Each version is a copy that can be independently managed and accessed. This copying approach enables scalability and user-specific views while simplifying version management compared to complex in-place modifications.
Solution Approach 2:
The system manages dynamic tree structures by changing parameters such as version numbers (v1, v2) and link identifiers rather than fundamentally restructuring the entire tree. This parameter-based approach allows for scalable updates and user-specific configurations without the complexity of complete structural reconfiguration.
3Adaptability or versatility
If all users see the same nodes, then the structure is simple to maintain, but privacy and customization are compromised
Solution Approach 1:
The patent introduces dynamic versioning that allows different users to see different versions of nodes based on their permissions or preferences. The tree structure can dynamically adapt to show node v1 to one user and node v2 to another, providing customizable views while maintaining reliable data consistency through blockchain's immutable ledger.
Solution Approach 2:
The versioning mechanism acts as an intermediary layer between the immutable blockchain data and the user views. This intermediary (version numbers, link identifiers) mediates between the need for data consistency and the desire for customized views, allowing users to access different versions without compromising the underlying data integrity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A computer-implemented method of creating different versions of a tree structure overlaid on a blockchain, wherein the method is performed by a tree creator and comprises: creating one or more target child nodes of a target parent node, each target child node comprising a respective data payload; and forming a respective edge between each target child node and the target parent node by associating each of the target child nodes with a respective link identifier, wherein the respective link identifier is based on at least one off-chain parameter.