Append-Only Mutation Lineage Log: Forward-Secure Identity Transition Chains

by Nick Clark | Published March 27, 2026 | PDF

Provisional Application 64/050,895 describes an identity model in which the durable artifact is not a key but a chain of mutations: every transformation an identity undergoes, whether a routine attribute update, a credential rotation, or a graceful retirement, is recorded as an entry whose digest is bound to its predecessor. The chain is append-only, forward-secure, and tamper-evident, and the link from any mutation back to its predecessor makes rollback to a prior state always achievable through forward motion rather than through editing history. This article describes the mechanism, its operating parameters, alternative embodiments, the composition with surrounding identity primitives, the prior art it distinguishes, and the disclosure scope claimed.


Mechanism

Each entry in the mutation lineage log records a single identity-state transition. An entry contains the prior chain head, the mutation type, the mutation payload bound to the operative attribute schema, a monotonic counter, a wall-clock timestamp drawn from a disclosed time source, and the per-entry digest computed over all preceding fields. The per-entry digest is the cryptographic spine of the chain: any later modification to a field within the entry, or to the entry's predecessor, breaks the digest and is detectable by any party who walks the chain.

The chain is append-only by construction. The data store that holds the log refuses any operation that overwrites or deletes an existing entry; only append operations are admitted, and an append is admitted only when the candidate entry's prior-head field references the current head of the chain. Concurrent appends are serialized by the data store or, in distributed embodiments, by a quorum-based ordering protocol that fixes the canonical sequence before the entries are committed.

Forward security is achieved by deriving each entry's signing material from a one-way function of the prior entry's secret state. The secret used to authenticate the current entry is destroyed once the entry is committed, leaving behind only the public digest. An attacker who later compromises the identity's current secret state cannot reconstruct the secrets that authenticated prior entries and therefore cannot forge a revised history that would be accepted by a verifier walking the chain.

The mutation type set is deliberately broad and is itself extensible by chain entries. The base set includes attribute creation, attribute update, attribute removal, credential rotation, role acquisition, role release, quarantine entry, quarantine exit, retirement, and re-activation. Each mutation type carries its own payload schema, and the schemas themselves are committed at chain genesis or by later schema-evolution mutations. This evolutionary discipline ensures that a verifier walking the chain knows, for any entry, which schema version was in force, can validate the payload against that schema, and can flag any entry whose payload does not conform. Schemas are not free to drift silently; they evolve only through explicit mutation entries that are themselves subject to the same audit guarantees.

Periodic anchors checkpoint the chain. At configured intervals, expressed in entry counts or in elapsed time, the chain emits an anchor entry containing a cumulative hash over all entries since the prior anchor, a witness or co-signature drawn from a disclosed authority set, and a self-test digest covering the local agent's code and configuration. The anchor permits sparse verification: a party who wishes to verify a single mutation deep in the chain need not walk the entire history but may fetch the bracketing anchors and verify only the segment between them, with a cost logarithmic in the chain length when anchors are spaced geometrically.

Every mutation is linked to its predecessor by the prior-head reference and by the cumulative chain hash. Rollback to a prior state is therefore always possible: the identity issues a new mutation entry whose payload restores the desired prior attributes, with the predecessor reference correctly pointing to the current head. Critically, rollback is itself a forward motion in the chain rather than an edit of history. The chain after rollback contains the rolled-back state and the rollback entry that produced it; it does not pretend that the intervening entries did not occur. This preserves the audit invariant that the chain is the complete history of the identity.

Operating Parameters

Anchor cadence is the primary operational parameter. The disclosed range spans from one anchor every sixteen entries to one anchor per day, with geometric or hybrid schedules contemplated. Tighter cadences shorten verification segments at the cost of more frequent witness interaction; looser cadences reduce witness load at the cost of longer verification walks. The cadence is committed to the chain itself, so any later verifier can confirm that anchors arrive at the disclosed cadence and can flag a chain whose anchor cadence has been silently relaxed.

Witness or co-signature membership at anchor time is parameterized by quorum size and by the eligible witness set. The disclosed minimum quorum is a bare majority of the eligible set; conservative deployments specify two-thirds or three-quarters. The eligible witness set is itself governed by chain entries: a witness is added or removed by a mutation entry, and witness changes therefore inherit the same audit guarantees as identity attribute changes.

Forward-security key derivation uses a one-way function specified at chain genesis and committed to the genesis entry. The disclosed family includes hash-based key evolution suitable for post-quantum settings; the chain may also evolve its key-derivation family by a mutation entry that stages the transition, applies it at the next anchor, and records both old and new derivations during a disclosed grace window so that in-flight operations can be reconciled.

Time-source parameters control how the wall-clock timestamp in each entry is derived and how it is verified. The disclosed sources include local monotonic clocks combined with a periodic external time witness, hash-anchored timestamping services, and consensus-derived block heights from a reference distributed ledger. The chain commits to a time-source choice at genesis and may evolve it by mutation; mismatches between the recorded timestamp and the expected source-derived value beyond a disclosed tolerance are surfaced as audit findings rather than silently corrected. This treatment of time prevents a class of attacks in which an adversary backdates entries to obscure the order of events.

Rollback constraints are governed by policy entries written into the chain. A policy entry may, for example, require that a rollback mutation include attestations from a quorum of governance roles, that it not span more than a disclosed number of intervening entries, or that it not roll back across an anchor without explicit acknowledgment. Because the policy is itself in the chain, the same evolutionary discipline applies: policy is changed by mutation, and any rollback evaluator can determine which policy was in force at the moment the rollback was attempted.

Alternative Embodiments

In a first embodiment, the chain is held by the identity itself in a local persistent store, with witness signatures fetched at anchor time from a remote witness service. This embodiment is suited to user-held identities where the user is the canonical author and remote witnesses provide non-repudiation. In a second embodiment, the chain is held redundantly by a federation of operators who jointly serve as both the storage layer and the witness set; this embodiment is suited to organizational identities and to scenarios where no single party should hold the canonical chain.

A third embodiment binds the chain to a content-addressed store such that each entry's address is its digest. Sparse verification is then particularly efficient because anchor fetches reduce to direct lookups in the content-addressed substrate. A fourth embodiment runs the chain inside a hardware-attested environment with a sealed key-derivation function, raising the bar for adversaries who would attempt to extract forward-security secrets directly from the host.

A fifth embodiment generalizes the mutation type set to include relationship mutations: entries that record the formation, modification, or dissolution of relationships between identities. The chain in this embodiment becomes a per-identity view of a relational graph, with each side of a relationship recording its own entry and reconciliation occurring at anchor time. A sixth embodiment supports selective disclosure of mutation contents while preserving chain integrity by storing payload commitments rather than payloads themselves; the actual payload is disclosed under a separate access policy without affecting the digest spine.

A seventh embodiment provides a cold-archive form in which the live chain is periodically truncated by emitting an archival anchor that stands in for the truncated prefix. The archival anchor carries the cumulative hash and a disclosed retrieval reference for the archived prefix. Verifiers who require deep history retrieve the archive; verifiers who only need recent state work against the truncated chain. The truncation is itself an entry, so the existence of the archive is not concealed from any party who walks the live chain.

Composition With Surrounding Primitives

The mutation lineage log is the substrate on which several other keyless-identity primitives stand. Trust-slope validation reads the chain to determine whether the trajectory of mutations is consistent with the identity's claimed posture; quarantine signals are emitted as chain entries so that quarantine itself is auditable; credential issuance and revocation are mutations rather than out-of-band events. The chain composes with the policy distribution mechanism, with the fallback enforcement primitive that may need to render decisions against a cached chain head, and with the content anchoring system, which may reference chain entries when binding a content artifact to an authoring identity.

Because the chain is append-only and forward-secure, every primitive that consumes it inherits the same tamper-evidence and the same auditability. A verifier who trusts the chain root can verify any downstream claim that derives from a chain entry by walking the chain to the entry, checking the per-entry digest, checking the cumulative chain hash, and checking the bracketing anchors. The primitives that stand on the chain do not need to maintain their own audit logs; they reference chain entries and inherit the chain's guarantees.

Prior-Art Distinction

Append-only logs and Merkle-anchored audit trails are well-known in the certificate-transparency and distributed-ledger literatures. The disclosed mechanism is distinguished in several respects. First, the chain is per-identity rather than per-system, with mutations specific to the identity's lifecycle rather than transactions in a shared ledger. Second, forward security is achieved by per-entry key evolution rather than by long-lived signing keys protected by external mechanisms; the chain itself ages out the keys that authenticated past entries. Third, rollback is handled as forward motion through a rollback mutation rather than by editing or branching history, preserving the single-history invariant that audit consumers rely on.

Conventional certificate revocation lists and OCSP-style mechanisms communicate present-tense state without communicating the trajectory by which the state was reached. The mutation lineage log communicates trajectory as a first-class artifact. Conventional event-sourcing in software architecture provides a similar shape but does not generally include forward security, sparse-verification anchors, witness quorums, or policy-governed rollback. The combination disclosed here is, to the inventor's knowledge, not present in the prior art.

Disclosure Scope

This disclosure encompasses the append-only mutation lineage log as a structural component of the keyless identity system, including the per-entry digest, the forward-secure key evolution, the periodic anchor with witness quorum, the cumulative chain hash, the rollback-as-forward-motion semantics, and the parameter ranges identified above. It encompasses local, federated, content-addressed, hardware-attested, relational, selectively-disclosing, and cold-archive embodiments, and any combination thereof. The claim scope contemplated is independent of any particular hash function, signature scheme, or substrate, and is defined by the structural properties of the chain rather than by any specific implementation choice.

Nick Clark Invented by Nick Clark Founding Investors:
Anonymous, Devin Wilkie
72 28 14 36 01