← Back to Patent Claims
Patent Claim 145 All Patents →

Reversible-Suppression Right-to-be-Forgotten on an Append-Only Ledger

Erasure as a reversible per-row visibility flip, uniformly enforced across every access surface, without ever mutating the underlying hash chain

Patent Claim JIL Sovereign July 2026 Claim 145 of 157

Executive Summary

JIL Sovereign honors data-subject erasure requests on top of an append-only, hash-chained ledger without ever violating the ledger's append-only property. Rather than deleting or mutating the underlying WORM-hashed rows - which would break the hash chain and destroy the evidentiary record the ledger exists to preserve - an erasure request is honored as a per-row member_suppressed visibility flag flip. The underlying hash-chained data is never touched; suppression is enforced identically at every subject-facing access surface, so a suppressed record is unavailable to ordinary access regardless of entry point, while remaining structurally present for legitimate chain-of-custody, legal-hold, and audit purposes.

Because suppression is reversible - it is a flag, not a destructive operation - an erroneously-applied suppression or an overriding legal obligation can be corrected without any loss of underlying evidentiary content.

Core Innovation: Resolving the apparent conflict between an append-only evidentiary ledger's tamper-evidence guarantee and a data subject's erasure right by separating "erasure" - a visibility-layer contract enforced consistently across every access surface - from "destruction" - an irreversible, separately-governed operation - rather than treating the two as the same operation.

Problem Statement

An append-only, hash-chained ledger is specifically designed to make its own history impossible to alter without detection - that is the entire evidentiary value of the design. Data-protection regimes that grant individuals a right to erasure, such as GDPR Article 17, appear on the surface to be in direct tension with that design: literal deletion of a row breaks the hash chain, or requires re-deriving and re-signing every subsequent entry, which is itself a form of tampering with history, while ignoring erasure requests risks non-compliance with the applicable data-rights regime.

Systems that do not resolve this tension cleanly either compromise ledger integrity through ad hoc deletions that break replayability, or refuse erasure requests outright - a posture unlikely to hold up under regulatory scrutiny given the growing number of jurisdictions with comprehensive data-protection legislation.

137/194
Countries with data-protection legislation (UNCTAD Global Cyberlaw Tracker)
3
Independent access surfaces enforcing the same suppression predicate
0
Mutations to the hash chain during an erasure request

Why Conventional Erasure Implementations Fall Short

  • Hard delete from a relational database: straightforward but structurally incompatible with any hash-chained/WORM evidentiary substrate.
  • Data anonymization/pseudonymization tools: often irreversible by design, foreclosing correction of an erroneously-applied suppression.
  • Consent-management platforms (OneTrust, TrustArc): typically manage request-workflow state, not the underlying data-layer visibility enforcement across every access surface.

Technical Architecture

Suppression Flag, Not Deletion

Each subject-scoped row (or the subject's aggregate record) carries a member_suppressed boolean, set by an authorized erasure-request workflow, never by direct data mutation. The hash-chained WORM content backing the row is never modified, deleted, or re-hashed as part of suppression - the chain's integrity guarantee is fully preserved.

Uniform Enforcement Across Surfaces

Access SurfaceEnforcement Point
Subject-facing portalVisibility predicate applied to every query
Data-export pipelineSame predicate applied identically
Application programming interfaceSame predicate applied identically

Because the identical visibility predicate is applied at all three surfaces, suppression cannot be bypassed by using a different access path.

Reversibility

Because suppression is a flag rather than a destructive operation, an erroneously-applied suppression, a withdrawn request, or an overriding legal obligation can be reversed by flipping the flag back, without any loss of underlying evidentiary content.

Prior Art Differentiation

ApproachLedger-Preserving?Reversible?Uniform Across All Access Surfaces?
Hard delete (relational database)No - breaks hash chainNoN/A
Irreversible anonymization/pseudonymizationYesNoDepends on implementation
Consent-management workflow platformsDepends on underlying data layerDependsNot typically - workflow state, not data-layer enforcement
JIL reversible suppressionYesYesYes - 3 independent surfaces

Patent Claim

Independent Claim 145: A computer-implemented method for honoring a data-subject erasure request over an append-only hash-chained ledger comprising: receiving an erasure request scoped to a data subject; in response, setting a suppression flag associated with one or more rows corresponding to the data subject, without modifying, deleting, or re-hashing the underlying hash-chained content of said rows; and enforcing a visibility predicate keyed to said suppression flag identically across a plurality of independent access surfaces, including a subject-facing portal, a data-export pipeline, and an application programming interface, such that the data subject's rows remain inaccessible through any of said access surfaces while the underlying hash chain remains intact and unaltered, and such that the suppression flag may be reversed without loss of the underlying evidentiary content.