Blockring Data Structure for Immutable Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain systems are resource-intensive and costly for storing user data unrelated to cryptocurrency, lacking the option for users to select encryption strength, which is often excessive for the type of data being stored.
Innovation Solution
The introduction of a blockring data structure, which mimics the blockchain's chaining property by having each block store the hash of the previous block, creating a closed ring structure that is computationally difficult to alter, allowing users to set the strength of the ring based on CPU power, and is fast to validate, enabling secure storage without the need for extensive computational resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blockchain is used for storing user data, then data immutability and security are improved, but computational resource consumption and cost increase significantly
Solution Approach 1:
The patent extracts the essential immutability mechanism from blockchain (hash chaining) and separates it from the resource-intensive consensus protocol. By removing the proof-of-work requirement and keeping only the cryptographic linking of blocks, the system achieves data immutability without the high computational overhead of traditional blockchain.
Solution Approach 2:
The patent segments the blockchain functionality into two independent components: (1) the data structure with hash-based block chaining for immutability, and (2) the consensus mechanism for security. This segmentation allows the system to use only the necessary immutability portion while avoiding the resource-intensive consensus portion.
2Reliability
If blockchain encryption strength is increased, then data security is improved, but resource consumption and validation time increase
Solution Approach 1:
The patent introduces dynamic encryption strength where the hash algorithm complexity can be adjusted based on the security requirements of the stored data. Users can select from different hash functions (MD5, SHA-1, SHA-256, etc.) and configure the number of hashing iterations, allowing the system to adapt encryption strength to the specific data sensitivity rather than using a fixed high-security setting for all data.
3Reliability
If blockchain is used for data storage, then data integrity is improved, but storage cost and complexity increase
Solution Approach 1:
The patent creates a simplified blockring data structure that serves as a disposable, lightweight alternative to full blockchain implementations. Each blockring instance is self-contained with configurable parameters, allowing easy creation and deletion without the complexity of maintaining a distributed blockchain network. The structure uses simple hash chaining that can be implemented with minimal computational resources.
Data Source
AI summary
A blockring service system may include a processor and memory, wherein the processor is configured to: receive a blockring request from the at least one user node; parse the request to derive blockring parameters; generate a blockring having a plurality of blocks connected by bonds based on the blockring parameters; and send the blockring to the at least one user node for distribution.