Hmm… I do not have operational experience with that exact objective myself, but research in the adjacent areas seems to be getting very active right now:
I think the direct answer is yes: this does connect to a genuinely active technical area, although it has not yet converged on one stable name or one standard architecture.
The closest broad labels I have found are always-on agents and persistent-state agents. The recent Always-On Agents survey, for example, treats the operative state of a long-running agent as more than retrieved memories: it also includes permissions, credentials, commitments, provenance and audit records, trigger conditions, and externally committed effects. At the same time, nearby work is still split across memory governance, capability security, runtime authorization, durable execution, provenance, and adversarial evaluation.
So I would not replace your vocabulary with a supposedly “correct” standard term. I would describe this as a point where several existing fields are converging.
The part of your post that seems most technically concrete to me is the promotion/admission boundary:
source or authority witness
-> candidate or derived state
-> state admission
-> candidate effect
-> effect authorization
-> durable effect and receipt
-> recovery, revalidation, or compensation
That is not meant as a guess about your private schema. It is just a neutral way to place the questions you raised.
Under that model:
- retrieval makes material available;
- provenance makes a derivation inspectable;
- admission decides whether material may become governing state;
- authorization decides whether it may support a current effect;
- commit and recovery determine what becomes durable and what may safely be reconstructed.
This is why I think the useful distinctions are:
- provenance is not authority;
- a checkpoint is not automatically legitimate continuity;
- an earlier approval is not automatically current authorization;
- visible task success is not the same property as an authorized commit.
A relatively low-disclosure, high-information next proof surface might therefore be a small invariant matrix, before expanding the benchmark much further. For restart, replay, rollback, damaged state, and cross-host migration, each important item could be classified as one of:
- must remain exactly identical;
- may differ, but must remain semantically equivalent;
- must be revalidated;
- must be discarded and recomputed;
- explicitly out of scope.
The rows could be limited to governing state, authority witnesses or approval epochs, the currently allowed effect set, committed-effect receipts, recovery outcomes, and retained negative results. That would make “cross-host verification” much easier for an outside reader to interpret without requiring publication of proprietary rules or fixtures.
A second, optional proof surface would be one synthetic or scrubbed end-to-end trace:
source / witness
-> candidate state
-> provenance and scope labels
-> admission decision + reason
-> candidate effect
-> effect decision
-> receipt or denial
-> replay / recovery result
Even a single case like that would give outside case authors a contract to target.
Where this seems to sit in the current research map
The correspondence is not exact, but I would roughly map the nearby work like this:
| Your term or question |
Nearby research / engineering line |
What it contributes |
What it does not settle |
| continuity across sessions |
Always-On Agents, persistent-state agents, durable workflows |
Treats permissions, commitments, audit state, triggers, and committed effects as durable state, not just retrieved text |
Does not provide one accepted runtime architecture or identity criterion |
| candidate generation vs executable effect |
Agent libOS, capability systems, reference monitors |
Separates model-visible affordances from primitive-level resource authority |
Does not establish that every semantic admission decision can be made deterministically |
| prior state that was once authorized |
Commit-Time Authorization, TOCTOU, revocation and expiry |
Asks whether the authority witness is still fresh, causally relevant, effect-bound, and eligible at the irreversible boundary |
Does not by itself solve memory reconstruction or long-term identity |
| provenance / lineage |
W3C PROV-DM, PROV-AQ |
Supplies mature vocabulary for entities, activities, agents, derivations, versions, and provenance bundles |
A provenance record is not automatically correct, authoritative, current, or admissible |
| contaminated state that fires later |
Sleeper Channels and Provenance Gates, persistent prompt injection, confused-deputy problems |
Gives a concrete threat model in which an input persists as memory, a skill, a scheduled job, or a filesystem change and activates later |
It studies a narrower attack class and particular agent configurations |
| outside-authored governance evaluation |
AgentDojo, GateMem |
Shows extensible adversarial environments and joint evaluation of utility, access control, and forgetting |
Neither benchmark is a complete match for recovery, authority lineage, or cross-host continuity |
The stable foundations here are older systems ideas: capability security, reference monitors, authorization at the point of use, event sourcing, idempotency, provenance, revocation, and audit trails.
What looks new and unusually active is the attempt to apply those ideas to systems where:
- state is partly semantic rather than fully typed in advance;
- the model can create summaries, plans, tools, skills, and derived memories;
- the action surface can change during operation;
- authority evidence can become stale between planning and commit;
- recovery can reintroduce state from another time, host, model, schema, or policy epoch.
That is why I would call this an emerging convergence rather than a settled category. Several of the closest papers are very recent preprints or prototypes, so they are useful as search connections and design examples, not as final consensus.
One especially close design principle appears in Agent libOS: changing what the model can ask for should not silently change what the runtime allows it to affect. Its prototype represents long-running agents with process identity, capabilities, checkpoints, object memory, human approval queues, and append-only audit, while keeping protected effects behind runtime primitives. That is not the same system you describe, but it is strong evidence that the “runtime substrate rather than persona wrapper” framing is appearing independently.
A compact evaluation route
Your current result—zero wrong-authority accepts and zero wrong-effect accepts in the bounded typed-recovery suite—sounds useful under the limitations you already stated: internal, bounded, and not an external audit.
The most informative complement would not necessarily be a much larger count. It would be a small matrix that makes the result interpretable along both safety and usefulness axes.
A possible result taxonomy:
| Outcome |
Meaning |
| correct allow / recover |
valid state or authority was accepted and the intended operation remained possible |
| correct review |
the boundary detected that automatic admission was not justified |
| correct deny |
invalid authority or effect was blocked |
| wrong-authority accept |
material became governing state without sufficient authority |
| wrong-effect accept |
a durable effect was allowed without sufficient current authorization |
| false deny |
a valid state or effect was rejected |
| over-review |
the system remained safe, but escalated cases that should have been routine |
| duplicate effect |
replay or recovery repeated an already committed external action |
| infrastructure / uninterpretable failure |
the run did not produce a governance result that can be classified |
That prevents two opposite overreadings:
- “zero wrong accepts proves the whole system is safe”; and
- “a conservative boundary is useless because it sometimes refuses.”
The relevant question is whether it preserves valid continuity while refusing unauthorized promotion with an acceptable review and denial burden.
GateMem is useful here because it jointly evaluates legitimate long-horizon utility, contextual access control, and active forgetting. Its scope is shared memory rather than your whole runtime, but the evaluation lesson transfers: governance metrics are difficult to interpret without a clean-task utility axis.
AgentDojo is useful for a different reason: it is an extensible environment in which normal task performance, attacks, and defenses can be tested in the same tool environment. For your outside-authored lane, the reusable idea is not necessarily its prompt-injection scenarios; it is the separation of:
- task specification;
- environment state;
- attack or perturbation;
- observable external effects;
- utility and security outcomes.
A compact initial perturbation set could include:
| Perturbation |
The property it isolates |
| valid state with paraphrased presentation |
admission should not depend on superficial phrasing |
| unchanged goal and payload, but expired approval epoch |
stale authority must not survive merely because the intended action is unchanged |
| replayed checkpoint after an effect already committed |
effect receipts and deduplication must prevent double execution |
| reconstructed state with missing provenance edge |
recovery should not silently promote an incomplete derivation |
| source and derived summary disagree |
the policy for authoritative source vs derived state becomes visible |
| clean state under a new policy or schema version |
migration and revalidation rules are exercised |
| deleted or revoked source with surviving index / summary / cache |
forgetting and revocation propagation are tested |
| damaged state that is sufficient for safe refusal but not recovery |
bounded degradation can be distinguished from total failure |
| migration to a new host with the same governing inputs |
the declared cross-host invariants can be checked |
| migration with different model or tool versions |
semantic continuity can be separated from exact execution replay |
The strongest controlled cases would keep the user goal and payload constant while changing only the authority relation. The recent Commit-Time Authorization work uses that general style: preserve visible task success conditions while invalidating the authority witness before the durable effect. Whether or not its exact definitions fit your runtime, that control design seems directly reusable.
Negative-result retention also matters here. Keeping denials, reviews, failed recoveries, partial traces, and unclassifiable runs prevents the surviving success demonstrations from becoming the only visible history of the boundary.
The main implementation-dependent branches
The right tests depend heavily on what actually owns the admission boundary.
If admission is deterministic or policy-engine based
The main risks move away from model confidence and toward:
- incomplete policy coverage;
- normalization mistakes before authorization;
- bypass paths that reach an effect without the guarded primitive;
- policy and schema version drift;
- fail-open behavior when fields are absent or malformed;
- semantic extraction feeding the policy the wrong typed facts.
A strong proof surface is then a small executable invariant set around the final primitive, plus coverage showing that every protected effect reaches that primitive.
If an LLM participates in admission
It helps to separate at least three layers:
- semantic extraction from unstructured material;
- the judgment about admissibility or authority;
- the final enforcement point.
Otherwise, a stable final decision may hide variation in the extracted facts, or a stable extractor may feed an unstable judge. Useful controls include repeated runs, model and prompt version changes, adversarially phrased but semantically equivalent evidence, and cases where the correct answer is review rather than allow or deny.
The most important architectural question is not whether an LLM appears somewhere in the path, but whether any model output can directly cross the final effect boundary without an independently checkable decision.
If human approval is the authority root
The approval should ideally be bound to the thing that will actually happen, not merely to an agent-authored natural-language description.
Relevant fields may include:
- normalized action and parameters;
- target resource or recipient;
- effect digest;
- policy or authority epoch;
- expiry;
- one-shot or reusable status;
- delegation lineage;
- whether the approval survived replay, rollback, or migration.
This is also where review burden becomes part of the safety story. A system that asks constantly may remain conservative while training the operator to approve without inspection. A useful metric is therefore not only “human approval present,” but whether the approval was inspectable, specifically bound, and rare enough to remain meaningful.
If the system is layered
That is probably the most realistic case. Then each transition should identify which layer has final authority:
untrusted input
-> semantic interpretation
-> candidate state
-> state-admission policy
-> planner / candidate action
-> effect policy
-> optional human approval
-> primitive enforcement
-> receipt / audit
The valuable artifact is the reason and receipt chain across those transitions. A later reviewer should be able to tell not merely that an action happened, but which subject requested it, what evidence was considered, which policy version applied, whether a human decision was involved, and which primitive finally committed the effect.
Recovery, rollback, and cross-host verification
I would split “rollback” into four different operations because they have different guarantees:
- memory or state rollback — restoring an earlier internal state;
- workflow replay — recomputing from recorded history;
- authority revalidation — deciding whether old permissions, approvals, or witnesses remain eligible;
- external-effect handling — deduplication, reconciliation, or compensation for actions that already escaped the runtime.
A checkpoint can often restore computation. It cannot, by itself, make the outside world revert.
This distinction is visible in durable-workflow systems. The LangGraph interrupt documentation, for example, warns that resume can re-run code before an interrupt and therefore recommends making side effects idempotent. Temporal similarly separates replayable workflow logic from external activities. Those systems are not solutions to authority governance, but they provide mature vocabulary for the mechanics underneath it.
For a governed long-lived agent, I would expect recovery to ask at least:
- Was this effect already committed?
- Is there a durable receipt or idempotency key?
- Was the authorizing witness tied to this exact effect?
- Is that witness still within its scope, version, epoch, and expiry?
- Did policy, schema, tool, model, or host identity change?
- Which state is authoritative, and which state is merely reconstructable context?
- If reconstruction is incomplete, is the safe result denial, review, or bounded degraded operation?
“Cross-host verification” can then mean several different things:
| Possible invariant |
What success would mean |
| byte-identical snapshot |
the serialized artifact is reproduced exactly |
| canonical governing state |
the same authoritative facts and relationships are reconstructed |
| equivalent admission decisions |
the same test cases receive the same allow / review / deny outcomes |
| equivalent allowed-effect set |
the migrated runtime can affect no more and no less than intended |
| receipt continuity |
previously committed effects remain known and are not repeated |
| equivalent recovery outcome |
damaged or partial states degrade in the same bounded way |
| equivalent role / lane ownership |
active responsibilities and conflicts are preserved |
| identical generated language |
model output is reproduced exactly |
The last one is usually the least stable and may not be necessary. The middle invariants are more directly connected to governance.
A useful migration manifest might therefore record, at minimum:
- runtime and schema version;
- policy version or digest;
- model and tool versions where they affect interpretation;
- governing-state digest;
- authority and delegation epochs;
- checkpoint lineage;
- committed-effect receipts;
- pending approvals and whether they survive migration;
- explicitly rebuildable, non-governing artifacts such as indexes, embeddings, or caches.
This also makes it possible to define a clear failure mode: migration can preserve the recoverable context while refusing to preserve authority that cannot be revalidated.
Why provenance needs its own trust boundary
Provenance is essential, but it is not self-authenticating.
The W3C PROV family gives a mature way to represent entities, activities, agents, derivations, specializations, and bundles. It is especially helpful for distinguishing a changing resource from a constrained version or instance of that resource.
But PROV-AQ explicitly notes that a provenance record is not, by itself, guaranteed to be authoritative or correct. Trust in the provenance record must be determined separately.
For an agent runtime, that suggests several distinct questions:
- Is the original source trusted for this claim?
- Was the provenance edge recorded by a trusted component?
- Is the record complete enough for the decision being made?
- Has the source, derivation rule, or policy been revoked or superseded?
- Does the lineage show availability only, or actual authority to govern?
- Can an untrusted input cause the system to author an apparently trusted summary, skill, schedule, or checkpoint?
That last case is why persistent-injection work is relevant. Sleeper Channels and Provenance Gates describes inputs that persist through one surface and activate later through another. Its exact threat model should not be generalized to every runtime, but it provides useful case shapes:
- an untrusted source becomes a memory;
- a memory becomes a generated skill;
- a skill becomes a scheduled action;
- a later clean session encounters only the derived artifact;
- paraphrasing or multiple derivations make the original source difficult to recognize.
The general lesson is that provenance needs to survive semantic transformation. Recording only the immediately previous object may be insufficient if authority laundering can occur through summaries, indexes, generated code, or repeated “independent” references that all descend from the same source.
So, overall, I think your argument can remain narrow and technical:
- the vocabulary is not settled;
- “memory + persona” does not describe all of the relevant runtime behavior;
- the important properties are state admission, authority lineage, commit validity, bounded recovery, and independently authored evaluation;
- the strongest next public step is probably an invariant contract, followed by one scrubbed trace or a small externally extensible case matrix.
That would let the claim be tested without turning the discussion into either a metaphysical argument or a demand to disclose the entire implementation.