Distributed Ledger Terminal Value Linking for Ordering Proof
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data management systems using distributed ledger technology face increased costs and load when proving the ordering of data across multiple ledgers, as they require frequent timestamp token acquisition for each data update.
Innovation Solution
The system incorporates a record hash value from one distributed ledger into another, associating the ledgers and allowing proof of data ordering without excessive data capacity increase, while enabling timestamp token acquisition only when necessary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If timestamp tokens are obtained for each data update in multiple distributed ledgers, then ordering of data can be proven, but system load and cost increase
Solution Approach 1:
The patent introduces terminal values as intermediary elements that link distributed ledgers. Instead of obtaining timestamp tokens for every data update in each ledger, the system generates terminal values that represent the state of ledgers at specific time points. These terminal values act as mediators that enable proof of ordering between ledgers without requiring frequent timestamp token acquisitions, thereby reducing system load while maintaining reliability.
2Measurement precision
If timestamp tokens are obtained for each data update, then ordering proof is accurate, but cost increases
Solution Approach 1:
The patent implements periodic action by generating terminal values at specific time points rather than continuously obtaining timestamp tokens for every data update. The system periodically creates terminal values that capture the state of distributed ledgers at those moments, enabling ordering proof without the continuous cost burden of frequent timestamp token acquisitions, thus maintaining measurement precision while reducing energy loss.
3Ease of operation
If multiple distributed ledgers are maintained separately, then data management is simple, but proof of ordering between ledgers is difficult
Solution Approach 1:
The patent merges the proof mechanism across multiple distributed ledgers by introducing terminal values that link them together. Each terminal value contains information about the state of ledgers at a specific time point, creating a combined proof structure. This allows the ledgers to remain operationally independent while their ordering relationships are proven through the merged terminal value system, maintaining ease of operation while enabling cross-ledger ordering proof.
Data Source
AI summary
When a controller of a client server updates component data D12 to component data D13, the controller creates in a distributed ledger which is a first proof chain, a record (Age [3]) including a hash value of the component data D13. Then, the controller generates a terminal hash value which is a hash value of a terminal record (Age [3]) in the first proof chain. The controller has the generated terminal hash value stored in a record in a distributed ledger which is a second proof chain, and associates the first proof chain and the second proof chain with each other.