Immutable Database Retention with Verifiable Data Deletion

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing immutable databases face challenges in efficiently managing data retention and deletion while preserving cryptographic proofs and database integrity, particularly in compliance with regulations like GDPR, due to the append-only nature of transactions and the complexity of maintaining chronological order under concurrent processing.

Innovation Solution

An immutable database system that stores transaction data as key-value pairs with cryptographic verification, allows for permanent deletion of data by preserving verification data in an append-only hash tree, and maintains database schema integrity by committing a new transaction with the SQL catalog before truncation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored in an append-only immutable database to ensure data integrity and cryptographic proofs, then data reliability is improved, but data deletion capability deteriorates

Engineering Contradiction:

Improvedata integrityVSAvoiddata deletion capability

Core Design Contradiction:

ReliabilityVSEase of operation

Solution Approach 1:

The patent segments the database into two distinct components: an immutable append-only log that preserves cryptographic proofs and an mutable SQL database that enables efficient data deletion. This segmentation allows each component to fulfill its specific function without compromising the other, resolving the contradiction between maintaining data integrity and enabling data deletion.

Inventive Principle:

Principle #1Segmentation

2Reliability

If all transaction data is retained indefinitely to maintain cryptographic proofs, then cryptographic verification is improved, but storage cost increases

Engineering Contradiction:

Improvecryptographic verificationVSAvoidstorage cost

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts the cryptographic verification data from the main transaction log and stores it separately in the SQL database. This extraction allows the immutable log to be truncated for storage efficiency while the extracted verification data is preserved in the SQL database, maintaining cryptographic verification capabilities without incurring excessive storage costs.

Inventive Principle:

Principle #2Taking out (Extraction)

3Productivity

If concurrent processes are used to handle high transaction volume, then productivity is improved, but data retrieval complexity increases

Engineering Contradiction:

Improvetransaction volume handlingVSAvoiddata retrieval complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent merges the strengths of two different database approaches: the high-throughput concurrent processing capability of the immutable log and the efficient chronological query capability of the SQL database. By combining these systems, the patent achieves both high productivity in transaction handling and simplified data retrieval in chronological order.

Inventive Principle:

Principle #5Merging (Combining)

Data Source

PatentUS12530685B2Data retention in a cryptographically verifiable immutable database

Publication Date: 2026.01.20 CODENOTARY INC

AI summary

Cryptographically-verifiable immutable database systems and methods for permanently deleting transaction value data from the immutable database system, preserving transaction verification data. Database schema data may be preserved when transaction value data is deleted.