Off-Chain Isomorphic Database for Tangible Asset Tracking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain technologies are inadequate for tracking and managing complex, non-fungible tangible assets as they lack the capability to efficiently store and update large volumes of associated data, and do not effectively handle the unique characteristics and changes of such assets throughout their lifecycle.
Innovation Solution
The method involves using an off-chain isomorphic database to store hierarchical hash-linked tree data structures representing tangible assets, while a distributed ledger stores hash values associated with smart contracts, allowing for the generation, modification, and transfer of asset tokens that reflect changes in the assets' state, ownership, and location, with the ability to merge or destroy tokens as necessary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blockchain is used to store and manage tangible asset data, then security and immutability are improved, but storage capacity and data update efficiency deteriorate
Solution Approach 1:
The patent extracts large-volume asset data from the blockchain storage system and places it in external off-chain storage systems. Only essential identifiers and hash values remain on-chain, resolving the contradiction between blockchain security and limited storage capacity.
Solution Approach 2:
The patent segments asset data into multiple hierarchical levels (root nodes, child nodes, grandchild nodes) with different storage locations. Critical integrity data remains on-chain while detailed data is stored off-chain, balancing security requirements with storage capacity constraints.
2Reliability
If blockchain is used to store and manage tangible asset data, then security and immutability are improved, but data update efficiency deteriorates
Solution Approach 1:
The patent implements a dynamic data structure where asset data can be updated at multiple hierarchical levels. When assets are modified, split, or merged, the system dynamically adjusts the tree structure and updates only the necessary nodes, maintaining immutability of historical records while enabling efficient current data updates.
Solution Approach 2:
The patent performs preliminary hashing and validation of asset data before committing to the blockchain. This preliminary processing allows faster on-chain transactions while maintaining the security and immutability guarantees of the blockchain system.
3Loss of information
If detailed asset data is stored on-chain, then data completeness is improved, but transaction costs and processing time increase
Solution Approach 1:
The patent extracts detailed asset data from on-chain storage and places it in off-chain storage systems. The blockchain retains only essential identifiers, hashes, and metadata, dramatically reducing transaction costs and processing time while maintaining data completeness through cryptographic verification.
Solution Approach 2:
The patent creates cryptographic copies (hashes) of asset data that are stored on-chain. These copies serve as verifiable references to the complete off-chain data, ensuring data completeness can be verified without storing the actual large-volume data on the blockchain.
4Adaptability or versatility
If complex asset relationships are tracked, then asset management capability is improved, but system complexity increases
Solution Approach 1:
The patent implements a nested hierarchical tree structure where assets can contain sub-assets, which can contain further sub-assets at multiple levels. This nested structure naturally represents complex asset relationships (such as composite assets, inventory hierarchies, or organizational structures) while providing a systematic framework that manages complexity through clear hierarchical boundaries and standardized node operations.
Data Source
AI summary
A processor-implemented method for the ownership transfer and tracking of tangible assets using a blockchain is described. In an embodiment, the method includes generating a root node associated with a tangible asset via a processor. The root node has a first hash value that represents a storage location of the root node, data associated with a tangible asset, and a second hash value that represents a storage location of the subsidiary node. The method also includes storing a hierarchical hash-linked tree structure in a non-transitory, processor-readable memory. The hierarchical hash-linked tree structure can include multiple nodes. The multiple nodes include the root node and the subsidiary node. The subsidiary node has the second hash value, and data associated with a tangible sub-asset of the tangible asset.


