Fragmenting Data for Immutable Storage Across Multiple Structures

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional databases face challenges in securing data against internal threats and maintaining data integrity, as they often rely on mutable audit logs that can be tampered with, and existing blockchain systems are not well-suited for low-latency access to large data sets or robust storage of high-security data.

Innovation Solution

The implementation of a tamper-evident, immutable data repository using Merkle Trees and cryptographic hash pointers within a blockchain framework, such as Docuchain, which allows for secure, low-latency storage and retrieval of large data sets by storing data directly in Merkle Trees and using an improved hash function to maintain data integrity and security.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If data is stored in traditional mutable databases, then ease of operation and access is improved, but data integrity and security against tampering deteriorates

Engineering Contradiction:
Improvedata accessVSAvoiddata integrity
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The patent segments data into multiple blocks that are distributed across an immutable ledger and separate storage locations. Each block contains cryptographic hash pointers that link to adjacent blocks, creating a chain structure. This segmentation allows data to be accessed efficiently while maintaining integrity through the immutable chain structure, resolving the contradiction between ease of access and data integrity.

Inventive Principle:
Principle #1Segmentation

2Reliability

If blockchain systems are used for immutable storage, then data integrity is improved, but access latency and retrieval speed deteriorates

Engineering Contradiction:
Improvedata integrityVSAvoidaccess latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent extracts large data sets from the immutable blockchain ledger and stores them in separate, easily accessible storage locations. The blockchain retains only cryptographic hash pointers and metadata, while the actual data resides in external storage. This extraction maintains data integrity through the immutable chain while enabling fast access to the extracted data, resolving the contradiction between integrity and access speed.

Inventive Principle:
Principle #2Taking out (Extraction)

3Reliability

If large data sets are stored directly in blockchain structures, then data integrity is maintained, but storage complexity and computational overhead increases

Engineering Contradiction:
Improvedata integrityVSAvoidstorage complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces an intermediary layer consisting of smart contracts and cryptographic hash pointers that mediate between the immutable blockchain and external storage systems. This intermediary structure maintains data integrity by storing verification mechanisms in the blockchain while delegating actual data storage to simpler external systems, reducing overall storage complexity while preserving integrity.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentEP3485421B1Fragmenting data for the purposes of persistent storage across multiple immutable data structures
Publication Date: 2020.07.15 ALTR SOLUTIONS INC
  • EP3485421B1 patent drawingFigure 1
  • EP3485421B1 patent drawingFigure 2
  • EP3485421B1 patent drawingFigure 3

AI summary

Provided is a process including: receiving one or more write requests; selecting a first subset of the values as corresponding to higher-security fields; segmenting a first value in the first subset; instructing a first computing device to store a first subset of segments among the plurality of segments in memory; and instructing a second computing device to store a second subset of segments among the plurality of segments in memory.