Hierarchical Token Storage for Verifiable Asset Records
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems fail to efficiently and securely store and manage the diverse and complex documentation associated with real-world assets like real estate, which often involves numerous users and platforms, leading to separate and incompatible storage of documents across different actors.
Innovation Solution
A hierarchical data storage system using blockchain technology, where data is tokenized and hashed to create a verifiable and organized record of transactions and assets, utilizing cryptographic protocols like ERC-1155Delta and ERC-721, enabling secure and universal access for all users.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If separate storage systems are used for different actors, then each actor can store documents independently, but the documents become incompatible and difficult to manage
Solution Approach 1:
The patent merges separate storage systems into a unified hierarchical structure where documents from multiple actors are integrated into a single blockchain-based storage system. The hierarchy organizes documents by asset type, then by actor, creating a unified view that maintains compatibility across all participants while eliminating the complexity of managing separate incompatible systems.
Solution Approach 2:
The storage system is segmented into hierarchical levels: top-level asset categories, middle-level actor-specific folders, and bottom-level individual documents. This segmentation allows each actor to maintain independent document storage while ensuring compatibility through the unified hierarchical structure that all actors can access and manage.
2Reliability
If hierarchical tokenization is applied to all data, then data organization and verification improve, but processing time and computational complexity increase
Solution Approach 1:
The system performs preliminary tokenization and hashing of documents during the ingestion phase, creating a hierarchical structure of tokens that represent the document content and metadata. This preliminary processing enables rapid verification and retrieval operations later, as the hierarchical token structure allows for efficient indexing and searching without requiring full document processing during queries.
Solution Approach 2:
The patent implements a nested tokenization approach where documents are tokenized into hierarchical levels: top-level asset tokens, middle-level actor tokens, and bottom-level document tokens. Each token contains references to parent tokens, creating a nested structure that enables efficient verification by checking only the relevant hierarchical levels rather than processing entire documents at all levels.
3Ease of operation
If comprehensive data hierarchy is created, then data organization and accessibility improve, but storage requirements and system complexity increase
Solution Approach 1:
The hierarchical token structure serves multiple functions simultaneously: it organizes data by asset type and actor, enables cryptographic verification through hashing, provides efficient indexing for retrieval, and maintains referential integrity through token relationships. This multi-functionality reduces the need for separate systems and simplifies the overall structure while improving data accessibility.
Solution Approach 2:
The system creates token copies that represent documents at different hierarchical levels. Each token is a reference copy that points to the actual document storage location, allowing the hierarchy to organize and index data without requiring physical duplication of the entire document content at each level. This copying approach reduces storage requirements while maintaining comprehensive organization.
Data Source
AI summary
Computing systems are configured to provide a hierarchical organization of blockchain operations, efficiently storing recursive hashes that allow quick verification of received data and data state. Received data from authorized users in associated and stored by representation at a corresponding position in the hierarchy. The computer hashes and tokenizes received data with the hash and stores the same. Each token created is then separately hashed with time and creator into a listing of all such tokens within an object. Such re-hashing is reiterated up each hierarchy level and stored in the containing object. The lists of all hashes at each level can be used to verify a state or individual document that will be reflected in the stored listings is accurate or currently true. Additionally, user actions and histories, as well as state progression and history, can be queried and reported easily with the lists.