US 2026/0089008 A1 · DATA TRUNCATION FROM CRYPTOGRAPHIC DATA STRUCTURES

Abstract

Methods for asynchronously determining relational data integrity using cryptographic data structures are performed by systems and devices. Changes in current tables of relational databases are reflected in associated history tables. Cryptographic hybrid blockchain ledgers are updated with transaction records, for entry changes in current and history tables, including transaction information and hash values of corresponding entry changes. Hybrid blockchain ledgers also include root hash values of Merkle trees of transaction records in current blocks, and hash values of prior blocks. A current block receipt is asynchronously generated and provided as a single hash value from which the validity states of the tables and ledger are able to be verified. Cryptographic receipts of specific transactions reflected in table entry changes are generated and provide immutable evidence of specific transaction existence for users. Ledger-enabled tables are provided for mixed database operations with ledger-disabled tables, and temporal history table database operations are enabled.

Claims20

Dependent claims

A method performed by a computing system, the method comprising:

designating a first record in a ledger for truncation based on the first record satisfying a truncation criterion;
generating state capture data comprising a first hash indicative of a valid state of the first record;
inserting the state capture data into the ledger;
and
truncating the first record from the ledger.

2 more elements

A system, comprising:

a processor;
and
a memory comprising instructions that, when executed by the processor, cause the processor to:
designate a first record in a ledger for truncation based on the first record satisfying a truncation criterion;
generate state capture data comprising a first hash indicative of a valid state of the first record;
insert the state capture data into the ledger;
and
truncate the first record from the ledger.

5 more elements

A computer-readable storage medium comprising instructions that, when executed by a processor, cause the processor to:

designate a first record in a ledger for truncation based on the first record satisfying a truncation criterion;
generate state capture data comprising a first hash indicative of a valid state of the first record;
insert the state capture data into the ledger;
and
truncate the first record from the ledger.

2 more elements

Dependencies are inferred from the claim text.

Facts

Application

19/402,331Filed 26 Nov 2025

Priority

29 May 2020

Published

26 Mar 2026

Term ends

Not estimatedThe source records don’t support an estimate.

Classification9 codes

H04L 9/3239
Using cryptographic hash functions: involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
G06F 16/2282
Indexing; Data structures therefor; Storage structures: tablespace storage structures; Management thereof
G06F 16/2379
Updating: updates performed during online database operations; commit processing
G06F 16/284
Databases characterised by their database models, e.g. relational or object models: relational databases

Family

Application16/888,044Continuation · filed 29 May 2020

Application18/309,352Continuation · filed 28 Apr 2023

Application19/402,331Continuation

US 11,671,262 B2Related patent

US 12,512,999 B2Related patent

US 2021/0377037 A1Published application

US 2023/0269088 A1Published application

US 2026/0089008 A1This patent

From the US filing history. Foreign family members aren’t listed.

Data truncation from cryptographic data structures

Life of this patent

Data truncation from cryptographic data structures

Life of this patent

Abstract

Claims20