| Internet-Draft | Claim Currency | November 2026 |
| Morrison | Expires 22 May 2027 | [Page] |
This memo specifies a read-time freshness evaluator and an observation-gated re-assertion discipline for concurrent autonomous readers of a single reconciled substrate history. For every claim read from the substrate, a three-state currency band (FRESH, AGING, STALE) is derived at read time from the durable history and is never stored. A claim whose derived band is not FRESH MUST NOT be re-emitted as current and MUST NOT ground a new durable claim; the sole transition back to currency is a fresh observation of the claim's basis, and the substrate's append stage enforces that for every reader. The memo specifies the claim-layer consumer that two companion specifications, Substrate-Observation as an Alternative to Envelope Coordination and the Substrate-Provenance Annotation Grammar, each left unspecified. It composes a read-time-derived band, a decay clock measured in missing observations learned from a basis's own change cadence, an append-stage rejection of any claim citing a basis that is no longer the head of its lineage, and observation as the only admissible refresh. No new substrate is standardised; the discipline composes with substrate that already exists.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 22 May 2027.¶
Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶
When several autonomous readers share a single body of recorded knowledge, a recurring failure is that a reader cites an aged claim as though it were current. Because the claim was true when it was written and nothing since has forced it into an explicit uncertain state, a reader that retrieves it finds a plausible value and re-asserts it as present truth. The failure is acute for software agents that read a shared store, act on what they read, and write new records grounded in it, because each new record carries the aged claim into durable state with no sign that it has aged.¶
Two companion memos specify what this memo builds on, and neither specifies the claim layer. [SUBOBS] describes how
concurrent sessions of a principal observe each other's presence
through substrate byproducts, with no coordination envelope, and defines decay-to-uncertainty as a first-class terminal operating state. It concerns which sessions are present and leaves aside what they wrote, and it deliberately standardises nothing. [SUBPROV] defines a
closed-class grammar for annotating the provenance of a claim,
including a terminal decayed-to-uncertainty class and an optional
observation timestamp, but states that it does not specify what an
inference system must do with the annotation.¶
This memo specifies that missing consumer. It defines the shape of a read over a reconciled substrate, the derivation of a currency band for the read, and the discipline under which an aged claim may still be emitted, marked as uncertain, but may not be re-asserted as current nor used to ground a new claim. The enforcement point is the substrate's append stage, since that is the only place a shared history can enforce anything without transmitting a coordination message.¶
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
The following terms are defined for the purposes of this document:¶
Claim. A recorded assertion together with the observations that ground it, held in the reconciled substrate history.¶
Reconciled substrate. The single durable history that concurrent readers share, to which a claim is appended through the substrate-physics cascade of [SUBOBS] and from which every currency band is derived.¶
Append stage. The point in that cascade at which a submitted claim is admitted to the durable history or rejected.¶
Basis lineage. The append-only sequence of observation events for a single basis element (a file, a record, an external source, a prior claim). Each event has a stable observation identifier and a timestamp.¶
Lineage head. The most recent observation event in a basis lineage at the moment of evaluation.¶
Grounding observation. The specific observation event a claim cited as basis when it was written.¶
Currency band. A three-state value, FRESH, AGING, or STALE, derived at read time for a claim, expressing whether the claim may be re-asserted as current.¶
Expected-observation deficit. The difference between the number of observations a basis lineage's own measured cadence predicts should have occurred since a claim's grounding observation, and the number that actually occurred.¶
Re-observation. A new observation event appended to a basis lineage, producing a new lineage head.¶
Currency-fast-forward rule. The append-stage admissibility predicate that rejects any submitted claim whose cited basis is not the current head of its lineage.¶
A read of the reconciled substrate returns a claim inside an envelope. The envelope carries the assertion, the
timestamp of its grounding observation (as_of), the basis set
(each element naming its substrate class per [SUBPROV], its
observation identifier, and its observation timestamp), the claim's
decay class, the currency band derived at this read, the evidence
from which the band was derived, the re-verification trigger (the
moved or deficit-bearing basis elements whose re-observation F6
requires before the claim is FRESH again), and the supersession
state.¶
The band is derived at read time and MUST NOT be stored. A stored band is itself a claim, and it ages like any other. Deriving the band at each read from the current durable history makes the band exactly as fresh as the read. The envelope carries the band's own evidence (the lineage heads and deficits it was computed from) so that a relying party can re-derive and audit it.¶
as_of is the time of the grounding observation, whenever the claim was written. The delay between observing a basis and writing the claim MUST NOT make the claim appear younger
than that observation.¶
Supersession resolves before any band is derived. Supersession decides whether a claim is valid, and the band grades whether a valid claim is current. A superseded claim has no band.¶
The band is a function of the durable history and, on the silence axis, of the time of the read (Section 4.2). Two axes contribute, and either is sufficient to degrade a band.¶
For each basis element, the evaluator compares the claim's grounding observation identifier against the current head of that element's basis lineage. If a head has moved, the basis was re-observed after the claim was grounded, and what the basis records may have changed since. The motion axis counts appended observation events and reads no clock. Counting events defeats confidence-replay (re-emitting an old observation cannot rewind a lineage head) and removes divergence from clock skew between readers on this axis (all readers observe the same sequence). The silence axis of Section 4.2 does not share this property.¶
A basis that goes unobserved also decays, at a rate learned from its
own lineage.
The evaluator maintains, per basis element, the measured observation cadence. The cadence is the empirical distribution of inter-observation intervals
over a trailing window of the lineage. The expected-observation
deficit is the number of observations the cadence predicts should
have occurred since as_of, minus the number that occurred. A
basis that historically changes hourly and has been silent for a day
carries a large deficit; a basis that changes yearly and has been
silent for a day carries none. The window is measured from the lineage, and no party sets it. Confidence in an earlier
observation therefore falls at a rate set by how fast the observed
thing changes, with no fixed expiry, as
[MORRISON-IFT], Section 3.1 argues for authentication.¶
If a basis lineage's own observation cadence collapses because the process that observes it has stopped, the deficit on that basis grows and its dependent claims degrade toward STALE. A claim whose observer has stopped therefore never appears current.¶
The silence axis needs a clock. The cadence is measured from the
timestamps of the observations in the lineage, and the deficit is
counted from as_of to the time of the read. This memo does not name the source of that time.
Two readers whose clocks differ can derive different deficits from
the same history. Only on the motion axis does every reader derive
the same result from the same history state.¶
FRESH: every lineage head equals the claim's grounding observation identifier, and the deficit is below its lower bound on every basis element.¶
AGING: any single lineage head has moved, or the deficit is past its lower bound on any basis element.¶
STALE: a moved head together with a deficit past the lower bound on the same element, or the deficit past its upper bound on any basis element, or the transitive rule of Section 6 forces it.¶
STALE is a terminal operating state in the sense of [SUBOBS] Section 2. The reader continues to operate under it, and it neither aborts the read nor evicts the claim. The decay class of [SUBPROV] remains in the envelope as a coarse, human-legible summary of the measured volatility, and the normative derivation uses the measured cadence alone.¶
The discipline has reader-side rules, which alone would be advisory, and substrate-side rules that enforce them.¶
F1. A reader MUST derive the band at read time from the durable history and MUST NOT reuse a band derived at an earlier read.¶
F2. A claim whose derived band is FRESH MAY be emitted as
current, carrying its substrate-class provenance, its as_of, and
the band's evidence.¶
F3. A claim whose derived band is AGING or STALE MUST NOT be
emitted as current. It MAY be emitted only with the
decayed-to-uncertainty annotation of [SUBPROV] attached,
together with its as_of and derived band. Emission without the
annotation, or with a fabricated FRESH band, is non-conformant.¶
F4. A claim whose derived band is not FRESH MUST NOT appear in the basis set of any new claim submitted for append to the durable history. Aged state MAY be discussed; it MUST NOT be built upon.¶
F5 (the currency-fast-forward rule). The append stage of the reconciled substrate MUST reject any submitted claim whose cited basis observation identifier is not the current head of that basis element's lineage at append time. Every session observes the rejection identically. The rejection transmits no coordination message and fails closed. It is the claim-layer analogue of a cryptographic non-fast-forward rejection at a settlement layer.¶
F6 (observation as the sole transition). The only transition from AGING or STALE back to FRESH is a re-observation of every moved or deficit-bearing basis element, each a new observation event appended to the durable history with a new observation identifier and timestamp. Elapsed time, repetition of the claim, agreement among any number of readers, receipt of any message, and any server grant MUST NOT effect the transition.¶
F7. The evaluator MUST resolve supersession before band derivation, and the append stage MUST reject a claim citing a superseded claim as basis, as it rejects one citing a non-head observation.¶
F4 and F5 move freshness enforcement from the read path to the append path. Cache freshness protects a reader from an aged copy, and F4 and F5 protect the durable history from new claims grounded in aged ones.¶
A claim whose basis set includes another claim inherits a band equal to the minimum of its own intrinsic band and the minimum band across its basis closure. The inheritance is evaluated lazily at read time over the basis graph and memoised per read.¶
The evaluation sends no invalidation message and needs no dirty-flag walk or publish-subscribe fan-out, since [SUBOBS] identifies that envelope coordination as an anti-pattern. Because each read recomputes the closure against the durable history, transitive currency is a function of the history and the time of the read, and readers at the same history state and the same time derive identical inheritance.¶
Under F5, a claim whose basis had already been superseded at its lineage head can never have been admitted, and chains resting on a moved head therefore cannot form in the history going forward. A basis can still age by silence after admission, and transitive currency governs those chains as well as chains recorded before the discipline was in force.¶
The claim tuples and their basis lineages live in the append-only
identity-log stages of the substrate-physics cascade described in
[SUBOBS]: the per-principal append log for claims scoped to one
principal's sessions, and the per-organisation append log for
collective claims. The principal and the organisation are each
named by a ~handle, which corresponds to an alter: URI
[ALTER-URI], for example alter:~alice for a person and
alter:~example.com for an organisation. Filesystem-lock
arbitration orders concurrent append attempts on the same lineage.
This memo assumes a single writer to each lineage at a time. The history is serialised and has one current head, and F5 compares against that head.
A site that cannot read that head cannot cite it, and F5 rejects its
claim. The memo specifies nothing for histories held at separate
sites.
For externally visible commitments, a currency-fast-forward rejection surfaces at external operational settlement. The cryptographic non-fast-forward rejection is an existing instance of the rule.¶
The band evaluator reads lineage heads from the append-log stages, and the F5 gate executes at the same append stage the cascade already owns. F5 therefore adds one admissibility predicate to an existing stage and no new stage. Like [SUBOBS], this memo standardises no new substrate and specifies a discipline over substrate that already exists.¶
A decayed read is tagged with the decayed-to-uncertainty terminal class of [SUBPROV], the grammar's observation timestamp field carries as_of, and its observation-identifier field carries the grounding observation identifier. Any relying party can re-query
the named lineage and confirm both the age and the head divergence
independently.¶
[SUBPROV] notes that an annotation is the inference system's declaration and proves nothing by itself. This memo answers that concern at the append stage. A forged FRESH band is rejected at F5, because a fabricated envelope cannot alter the lineage head the append stage checks.¶
A single reconciled history and the mutual-hallucination property of [SUBOBS] are not in tension, because they occupy different layers.¶
Each reader derives its own band at its own read moment. Two readers reading seconds apart, or reading while an append is in flight, may hold divergent local views of currency. No local band is canonical, as the mutual-hallucination property of [SUBOBS] requires, and every band is derived from the same durable history. Divergence between readers comes from the timing of their reads and, on the silence axis, from differences between their clocks (Section 4.2). It never extends to disagreement about what the history contains.¶
Divergence reconciles at the commitment stage, as everything does under [SUBOBS]. Whichever reader appends first advances the lineage head; the other reader's now-aged local view is caught by F5 when it attempts to build on it. The rejected reader is sent no message. It observes the rejection, then re-reads the history and derives its band again.¶
A declared time-to-live, whether a fixed lifetime or a per-record
fresh_until, is a window a party chooses. A chosen window can be gamed and does not follow the basis's actual rate of change. The silence axis of Section 4.2 measures the window from the basis's own lineage.¶
An invalidation message broadcast to readers when a basis changes is envelope coordination of the kind [SUBOBS] rejects, and it needs a fan-out, a delivery guarantee and a broker. The transitive currency of Section 6 achieves invalidation as a read-time function of the history, with no message.¶
An abort on aged input, the posture of a security-metadata expiry scheme, forfeits the terminal-operating-state posture. An agent that must continue under partial information needs to keep operating with an aged claim marked uncertain. Under F3 the aged claim can still be emitted, and under F4 it cannot ground a new claim.¶
Each element this memo composes appears in some published design, and none of the designs cited below combines them. Several are designed against the combination.¶
Knowledge units for multi-model deliberation [KU] carry a per-unit
fresh_until, a status of active, stale, or superseded, and a
volatility tier, and on ageing a unit "SHOULD be considered
potentially stale" and "SHOULD be re-deliberated". The text places no block on citing or using an aged unit, and its write side has no rule rejecting a new unit for referencing a stale parent. It is a many-units model, in which units are never modified in place and change produces new units linked by supersedes and parent inheritance in a
directed graph. Its recovery primitive is re-deliberation of the claim (a fresh round of model questioning). Under this memo the discipline is enforced at the append stage, binds to a single reconciled history,
and admits only re-observation as the transition to currency.¶
HTTP caching freshness [RFC9111], with stale-while-revalidate and stale-if-error [RFC5861], computes freshness lifetime against current age and, on exceeding it, marks a response stale but permits serving it, either directly or while revalidating. Revalidation fires only on a reuse attempt, and currency is restored by an origin grant. Caches are per-node; there is no single reconciled history, and no origin exists behind a reconciled substrate. Under this memo an aged claim may still be emitted but may not ground a new claim, currency returns only through a new observation, and the band is derived at every read whether or not a reuse is attempted.¶
The Update Framework [TUF] expires metadata and requires a client to refuse an expired file, aborting the workflow and reporting a possible freeze attack. Its terminal state is an abort, and its model is the security workflow of one client.¶
Certificate Transparency [RFC9162] requires a log to publish a signed tree head no older than a maximum merge delay, re-signing even when idle, with non-progress detected by external monitors. The freshness obligation is on the producer and the detection is off-path; there is no reader-side decay of a stored claim to uncertainty.¶
The phi accrual failure detector [PHIACCRUAL] outputs a continuous suspicion level about a process's liveness from heartbeat-arrival history, leaving the threshold to the consumer. The silence axis of Section 4.2 uses the same inter-arrival statistics. Phi grades suspicion that a node has failed and only informs, while the deficit grades uncertainty about a stored claim's currency and gates an append.¶
Leases [LEASES] grant time-bounded permission to trust a cached datum, requiring re-acquisition on expiry. Expiry is a binary lapse of a permission granted by a server, and the claim has no labelled uncertainty state to decay into.¶
DNS negative caching [RFC2308] counts a time-to-live down to eviction, with an explicit absence of any intermediate unknown state, per resolver, with lazy re-query. An evicted record leaves no uncertain state behind, and there is no reconciled history.¶
Geographic attestation results [GEORES] carry a basis field
naming the class of artifact a result rests on, a basis-ref field
carrying the claim-uuid of the result it rests on, and observed-from
and observed-until fields giving the interval over which the
observations behind it were made. These are the closest published
fields to the basis set and as_of of Section 3. The
document defines no freshness band over them.¶
Attestation Results for Secure Interactions [AR4SI], Section 2.3.2, separates a tier in which the Verifier makes no assertion (None) from a tier in which the Verifier could not complete its appraisal (Incomplete). Its Section 2.4 states that mechanisms for expiring a Verifier's confidence are not defined in that document. A STALE claim under this memo was asserted and is read with its decay shown. It is neither of those two tiers.¶
Epoch Markers [EPOCH] let recipients establish freshness from the reception of a shared marker, without tracking time through a local real-time clock. The motion axis of Section 4.1 has the same property, counting appended observations in place of clock readings. The silence axis of Section 4.2 reads a clock and does not.¶
TRIP [TRIP], Section 12.2, binds each Attestation Result to a Relying Party nonce, the current chain head and the current time, and supports no mode without that active exchange. Freshness is established when the result is issued, for one request. Under this memo the band is derived at each read from the durable history.¶
The cached scheme of [SIGKEY], Section 3.11, presents a cache identifier in place of an assertion the verifier cached earlier. Section 6.1 of the same document validates the resolved assertion as it would one presented in full, and states that "expiry at stage 2 is the freshness check". The freshness of a cached assertion is therefore judged against the assertion's own expiry.¶
Confidence-replay, in which an adversary re-emits an aged observation to refresh readers' confidence in stale state, does not succeed. The motion axis counts appended observation events, and a replay cannot rewind a lineage head. Refresh requires a new append, and a strictly advancing head cannot be moved backward.¶
Ghost-basis injection, in which an adversary fabricates a lineage to feed a false cadence, is mitigated by the identity-bound append admission of the cascade in [SUBOBS] and by that memo's monotonic layer-coverage commitment.¶
Band forgery has no effect at the append stage. A forged FRESH band cannot alter the lineage head the F5 predicate checks, and a forged envelope citing a non-head basis is rejected whatever band it claims. Emission-side forgery, a reader emitting an aged claim as FRESH, remains a conformance violation and is detectable by re-derivation against the history.¶
Currency starvation, in which an adversary appends spurious observations onto a basis lineage to hold every dependent claim at AGING indefinitely, is mitigated by identity-bound append admission. It can also be mitigated by a cadence learner that treats a sustained change in append rate as a new volatility regime, or by a per-lineage append-rate ceiling.¶
Simulated split-brain across cascade stages is inherited from [SUBOBS] and its per-observer monotonic layer-coverage mitigation.¶
An observation lineage exposes the observation cadence of its basis, and that cadence can itself profile a principal's activity rhythm. Implementations SHOULD scope lineage visibility to the principal's own scope, and cadence-derived windows MUST NOT be used to manufacture a continuously refreshing per-individual surveillance signal. Pseudonymous-tier observations follow the refusal postures of [SUBOBS] Privacy Considerations.¶
This memo requires no IANA actions. A future revision may register the currency-band vocabulary alongside any substrate-class registry established by [SUBPROV].¶
States the single-writer assumption in the binding to the reconciliation cascade, and states that the silence axis needs a clock (and that the motion axis does not), with no requirement changed.¶
Adds related-work paragraphs citing the geographic attestation results basis, basis-ref and observation window [GEORES], the None and Incomplete tiers of [AR4SI], epoch markers [EPOCH], Section 12.2 of [TRIP], and the cached scheme of Section 3.11 of [SIGKEY], all informative.¶
States in Sections 4, 4.2 and 6 that the band is a function of the durable history and, on the silence axis, of the time of the read. Earlier text called the band a pure function of the history. No requirement changed.¶
Retitles Sections 9 and 10 and makes editorial changes throughout, with no requirement changed.¶
Cites [SUBPROV] and [ALTER-URI] at their current revisions.¶
Initial revision.¶