Nested Hash Chain Transactions for Secure Block Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems face challenges in providing secure and efficient access to hash chains while transactions are being written, particularly in avoiding invalidation of the hash chain during data block updates.
Innovation Solution
A method and system for appending and updating data blocks on hash chains by setting tail block identifiers to previous blocks, allowing for secure removal and updating of transactions without invalidating the hash chain, using cryptographic hash functions to ensure data integrity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If data blocks are appended to a hash chain during transaction writing, then access to the hash chain is enabled, but the hash chain may be invalidated when blocks are updated
Solution Approach 1:
The patent segments the hash chain into multiple branches, allowing independent updates to different data blocks without affecting the entire chain. When a data block needs to be updated, only the specific branch containing that block is modified, while other branches remain intact and valid.
Solution Approach 2:
The patent introduces intermediary structures (such as branch pointers and metadata blocks) that mediate between the immutable hash chain and the mutable transaction data. These intermediaries allow updates to be performed without directly modifying the core hash chain blocks, preserving chain validity.
2Adaptability or versatility
If transactions are updated by appending new data blocks, then updated transaction data is stored, but the original transaction structure is altered
Solution Approach 1:
The patent performs preliminary actions by creating a snapshot or copy of the original transaction structure before applying updates. This allows the system to maintain the original structure intact while creating updated versions, enabling rollback if needed and preserving structural stability.
Solution Approach 2:
The patent implements nested transaction structures where updated transactions contain references to their parent transactions. This nesting allows multiple versions of transactions to coexist with clear hierarchical relationships, maintaining structural integrity while enabling updates.
3Productivity
If multiple processes access and write to the hash chain simultaneously, then cooperative updates and reads are enabled, but conflicts may occur during block appending
Solution Approach 1:
The patent divides the hash chain into multiple independent branches or segments that different processes can access simultaneously. This segmentation reduces contention for the same resources, allowing parallel operations without conflicts while maintaining overall system consistency.
Solution Approach 2:
The patent implements self-service mechanisms where each process independently manages its own transaction branches and validates its operations against the current state of the hash chain. This reduces the need for complex centralized coordination while ensuring consistency through self-validation.
Data Source
AI summary
A method for using shareable and nested transactions on hash chains includes appending a data block of a transaction of a first hash chain to a second hash chain. The second hash chain originates from a tail block of the first hash chain. The method further includes removing the data block from the transaction by setting a tail block identifier of the second hash chain to a previous block appended to one of the first hash chain and the second hash chain prior to the data block. The method further includes updating the transaction with updated transaction data by setting the tail block identifier of the second hash chain to the updated data block. The method further includes appending the second hash chain to the first hash chain by setting the tail block of the first hash chain to the tail block of the second hash chain.