Hash Chain Genesis Record Advancement for Storage Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Hash chain data structures, such as blockchains, can grow excessively large and consume significant storage and processing resources, especially in systems with limited capabilities like embedded systems, and older records may lose utility over time, unnecessarily consuming resources.
Innovation Solution
Implementing a method where each subsequent record in the hash chain includes authentication values for both the preceding record and a designated genesis record, allowing for the deletion of older records and the advancement of the genesis record, thereby maintaining a consistent chain size and resource efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If hash chain data structures are used to ensure data integrity and tamper evidence, then reliability is improved, but the volume of data stored increases excessively over time
Solution Approach 1:
The patent extracts and removes older records from the hash chain that are no longer needed for security validation. By identifying and deleting records beyond a retention period or threshold, the system maintains data integrity for necessary records while reducing overall storage volume of the hash chain structure.
Solution Approach 2:
The patent implements dynamic record retention policies where the hash chain adapts its size over time based on configurable parameters such as retention periods, chain size thresholds, and security requirements. This allows the storage volume to be optimized dynamically while maintaining reliability through configurable security margins.
2Reliability
If all records are retained in the hash chain to maintain integrity, then reliability is improved, but processing resources are wasted on older records that have lost utility
Solution Approach 1:
The patent extracts and removes obsolete records from the hash chain that have exceeded their utility period. By identifying records older than a configured retention period or those beyond a certain position in the chain, the system eliminates processing overhead for records that no longer contribute to security or validation requirements.
Solution Approach 2:
The patent changes operational parameters such as record retention period, chain size threshold, and validation depth to optimize processing resource usage. By adjusting these parameters based on system requirements and resource availability, the system balances integrity maintenance with processing efficiency.
3Reliability
If the hash chain grows without limit to maintain complete history, then reliability is improved, but the device complexity increases for systems with limited storage capabilities
Solution Approach 1:
The patent implements dynamic storage management with configurable retention policies, chain size thresholds, and automatic record pruning. This transforms the static, ever-growing hash chain into a dynamic structure that adapts to storage constraints while maintaining necessary historical records for security and validation purposes.
Solution Approach 2:
The patent introduces configurable parameters including retention period, maximum chain size, and validation window that allow systems with limited storage capabilities to manage hash chain growth. These parameters enable customization of the balance between maintaining complete history and managing device complexity based on specific application requirements.
Data Source
AI summary
In an example, a data structure comprises a first genesis record having an associated authentication value and a plurality of subsequent records arranged in an order, wherein at least one subsequent record includes the authentication value associated with the first genesis record and an authentication value associated with another record in the data structure. A method may include designating one of the subsequent records as a second genesis record, acquiring an authentication value for the second genesis record, deleting at least one record preceding the second genesis record in the data structure and adding a further record to the data structure wherein the further record includes the authentication value of the second genesis record and an authentication value associated with a directly preceding record in the data structure.