Persistent Data Structure Appending for Concurrent Block Writes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional distributed ledger solutions face throughput issues due to the requirement that new data blocks must store the hash value of the previous block, causing conflicts when multiple blocks are concurrently available for appending, leading to recomputation of incompatible blocks.
Innovation Solution
Implementing a method where new data blocks include predefined appending requirements, allowing appending only if specific conditions are met, such as matching content, ordering, or context, to manage concurrent data block appending flexibly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If new data blocks must store the hash value of the previous block to prevent tampering, then data integrity and security are improved, but throughput deteriorates due to conflicts when multiple blocks are concurrently available for appending
Solution Approach 1:
The patent segments the appending requirement into multiple types (first type requiring full sequence match, second type requiring partial match, third type requiring only content match). This segmentation allows different data blocks to have different appending requirements, enabling concurrent appending of blocks with compatible requirements while maintaining security for blocks requiring full verification.
Solution Approach 2:
The patent changes the parameter of appending requirements from a single uniform requirement to multiple configurable types. By introducing different matching criteria (full sequence match vs. partial match vs. content-only match), the system can adjust the strictness of verification based on the specific data block and its priority, thereby resolving the throughput-integrity tradeoff.
2Reliability
If strict hash matching is required for all concurrent data blocks, then security against tampering is maintained, but processing time increases due to recomputation of incompatible blocks
Solution Approach 1:
The patent applies partial verification for second-type appending requirements, where only a portion of the sequence needs to match rather than the entire sequence. This partial action reduces processing time for concurrent blocks while still providing security for the critical portions that are verified.
Solution Approach 2:
Different data blocks are assigned different appending requirement types based on their local characteristics and priority. High-priority blocks with strict security needs use first-type requirements, while lower-priority or time-sensitive blocks use second or third-type requirements with reduced verification, optimizing the balance between security and processing speed.
3Device complexity
If conventional distributed ledger structures are used with uniform appending requirements, then simplicity of implementation is maintained, but flexibility in managing concurrent blocks deteriorates
Solution Approach 1:
The patent introduces a universal appending requirement field in the data block structure that can accommodate multiple types of requirements (first, second, and third types). This multi-functional design allows the same basic structure to support both strict security scenarios and flexible concurrent appending scenarios, enhancing adaptability without significantly increasing implementation complexity.
Data Source
AI summary
A method (600) for storing a persistent data structure (110) comprising a sequence (SQ) of data blocks (D(i)) is disclosed. The method comprises, under the control of a computing system (105): —at the computing system (105), receiving (602) a new one of the data blocks (ND) to be appended to a last one (D(M)) of the data blocks in the sequence (SQ). Said new data block contains corresponding data and a corresponding appending requirement selected among a set of pre-defined appending requirements comprising: —a first one of the appending requirements providing that a content and an ordering of all the data blocks (D(i)) of the sequence (SQ) of data blocks match a corresponding first indication received with the appending requirement, and a further one of the appending requirements providing that a content and an ordering of all the data blocks (D(i)) of a further sequence (BSQ) being at least an initial portion of the sequence (SQ) matches a corresponding further indication received with the appending requirement, said further sequence (BSQ) being identified by a corresponding context (K), the method further comprises:-at the computing system (105), appending (612; 614) said new data block to said last data block conditioned to a fulfillment of said appending requirement contained in the new data block.