<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE rfc>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude"
     category="info"
     docName="draft-abak-agent-control-delivery-evidence-00"
     ipr="trust200902"
     submissionType="IETF"
     tocInclude="true"
     sortRefs="true"
     symRefs="true"
     version="3">
  <front>
    <title abbrev="Agent Control Delivery Evidence">Evidence Requirements for Agent Control Delivery and Outcome Reconciliation</title>
    <seriesInfo name="Internet-Draft" value="draft-abak-agent-control-delivery-evidence-00"/>
    <author fullname="Ali Toygar Abak" initials="A. T." surname="Abak">
      <organization>Independent Researcher</organization>
      <address>
        <email>founder@phionyx.ai</email>
        <uri>https://phionyx.ai</uri>
      </address>
    </author>
    <date day="30" month="August" year="2026"/>
    <area>Security</area>
    <workgroup>Internet Engineering Task Force</workgroup>
    <keyword>agent</keyword>
    <keyword>control</keyword>
    <keyword>delivery</keyword>
    <keyword>evidence</keyword>
    <keyword>reconciliation</keyword>

    <abstract>
      <t>Agent systems can issue stop, suspend, revoke, constrain, cancel, or
      override instructions across system and administrative boundaries.  A
      record that such a control was decided or dispatched does not establish
      that the intended enforcement point received or applied it.  Conversely,
      the absence of an acknowledgement does not, by itself, establish
      non-delivery.</t>

      <t>This document defines format-independent evidence requirements for
      preserving that distinction.  It separates issuer-side emission,
      receiver-side observation, enforcement outcome, and observation of the
      resulting control effect.  It also defines negative-observation rules,
      per-instruction reconciliation states, and bounded-population accounting
      so that missing, malformed, conflicting, and unmatched records remain
      visible.</t>

      <t>This document does not define a receipt format, wire protocol,
      authorization system, policy language, transparency service, or audit
      regime.</t>
    </abstract>
  </front>

  <middle>
    <section anchor="intro">
      <name>Introduction</name>

      <t>Agent communication and execution systems increasingly carry control
      instructions that are expected to constrain a live runtime.  Examples
      include stopping a task, suspending a delegated operation, revoking an
      outstanding grant, cancelling a tool request, forcing a handoff, or
      replacing a permissive policy with a restrictive one.</t>

      <t>These controls frequently cross more than one boundary.  A policy
      component may decide that an activity must stop.  An issuer may serialize
      and dispatch the corresponding instruction.  A broker, gateway, sidecar,
      or operating-system channel may transport it.  An enforcement point may
      receive and verify it.  The enforcement point may then apply, refuse, or
      fail to apply it.  Finally, an observer may or may not see the intended
      control effect.</t>

      <t>Collapsing those events into a single label such as "sent",
      "delivered", "enforced", or "stopped" creates an interoperability and
      security problem.  Two implementations can emit syntactically valid
      records while reaching incompatible conclusions about the same control.
      A downstream evidence or audit layer cannot reconstruct a boundary fact
      that was never preserved by either side of that boundary.</t>

      <t>This document therefore specifies the minimum logical facts and
      reconciliation behavior needed to preserve control delivery and outcome
      uncertainty.  The requirements are independent of any particular
      serialization, transport, signature scheme, evidence envelope, or
      transparency system.</t>

      <section anchor="scope">
        <name>Scope and Non-Goals</name>

        <t>This document applies when a governance-relevant control instruction
        crosses a system, process, privilege, trust, or administrative boundary
        on its way to an enforcement point.  It covers:</t>

        <ul>
          <li><t>binding issuer-side and receiver-side observations to the same
          control instruction;</t></li>
          <li><t>distinguishing receipt, enforcement outcome, and observed
          control effect;</t></li>
          <li><t>preserving positive failures and bounded negative
          observations;</t></li>
          <li><t>reconciling missing, malformed, duplicated, substituted,
          orphaned, and conflicting evidence; and</t></li>
          <li><t>stating the scope and limitations of any resulting claim.</t></li>
        </ul>

        <t>This document does not:</t>

        <ul>
          <li><t>define a new receipt, token, log-entry, or evidence-envelope
          format;</t></li>
          <li><t>define how an agent is authenticated or authorized;</t></li>
          <li><t>decide whether a control instruction is correct, lawful, safe,
          or consistent with policy;</t></li>
          <li><t>define the semantics of stop, suspend, cancel, revoke, override,
          or any other control verb;</t></li>
          <li><t>prove the truth of producer assertions, complete mediation, or
          physical-world effect;</t></li>
          <li><t>require public disclosure of prompts, model reasoning, personal
          data, proprietary policy, or protected content; or</t></li>
          <li><t>standardize accountability, auditing, retention, or regulatory
          compliance.</t></li>
        </ul>

        <t>A protocol or profile can adopt the requirements in this document
        while using its existing identifiers, errors, acknowledgements,
        signatures, telemetry, or external evidence format.</t>
      </section>

      <section anchor="requirements-language">
        <name>Requirements Language</name>

        <t>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 <xref target="RFC2119"/> <xref target="RFC8174"/>
        when, and only when, they appear in all capitals, as shown here.</t>

        <t>This document is Informational.  The requirement terms make the
        evidence contract testable by protocol authors and implementers; they
        do not define an on-wire protocol by themselves.</t>
      </section>
    </section>

    <section anchor="terminology">
      <name>Terminology</name>

      <dl newline="true" spacing="normal">
        <dt>Agent Runtime</dt>
        <dd><t>A software environment that plans, mediates, dispatches, or
        executes actions on behalf of an agent or an agentic application.</t></dd>

        <dt>Control Instruction</dt>
        <dd><t>A direction intended to restrict, interrupt, replace, or
        otherwise govern current or future runtime behavior.  Examples include
        stop, suspend, cancel, revoke, constrain, quarantine, handoff, and
        override.  A control instruction is distinct from the business or tool
        action being governed.</t></dd>

        <dt>Issuer</dt>
        <dd><t>The component that emits a control instruction toward an
        enforcement point.  The issuer need not be the policy decision point
        that caused the instruction to be created.</t></dd>

        <dt>Enforcement Point</dt>
        <dd><t>The component that can apply or refuse the control at the
        relevant runtime or effect path.</t></dd>

        <dt>Control Boundary</dt>
        <dd><t>The declared system, process, privilege, trust, or administrative
        boundary between the issuer-side observation and the receiver-side
        observation.</t></dd>

        <dt>Observation Record</dt>
        <dd><t>An attributable statement that a specified observer saw a
        specified event at a specified boundary and time.  An observation
        record is an assertion whose integrity and trust basis require separate
        evaluation.</t></dd>

        <dt>Receiver Observation</dt>
        <dd><t>An observation made at, or cryptographically bound to, the
        intended enforcement point after the point has read and matched the
        control instruction.  Acceptance by an upstream transport intermediary
        is not a receiver observation unless a profile explicitly establishes
        equivalent endpoint semantics.</t></dd>

        <dt>Enforcement Outcome</dt>
        <dd><t>The enforcement point's attributable result after processing the
        instruction, such as APPLIED, REFUSED, NO_EFFECT, or UNKNOWN.</t></dd>

        <dt>Control Effect</dt>
        <dd><t>The change in governed runtime state that the control instruction
        was intended to cause, such as a task entering a stopped state.  This
        term does not mean the consequential business effect of the action that
        the agent was attempting to perform.</t></dd>

        <dt>Negative Observation</dt>
        <dd><t>A positive record of a bounded condition such as a deadline
        passing without a matching acknowledgement, a transport rejecting an
        attempt, or a referenced counterpart remaining unavailable at a stated
        reconciliation cutoff.  It is not a bare absence of data.</t></dd>

        <dt>Reconciler</dt>
        <dd><t>A component that correlates observations and reports a scoped
        verdict without silently converting uncertainty into success or
        failure.</t></dd>

        <dt>Bounded Population</dt>
        <dd><t>A closed, reproducible set of instructions or records selected by
        a declared inclusion rule, observation window, and reconciliation
        cutoff.</t></dd>

        <dt>Independent Observer</dt>
        <dd><t>An observer whose authority and write path are not controlled by
        the party or component whose assertion it is intended to corroborate.
        Administrative, key, process, and storage separation are relevant to
        this determination.</t></dd>
      </dl>
    </section>

    <section anchor="problem">
      <name>Problem Statement and Failure Model</name>

      <t>For a given control instruction, the following facts are distinct:</t>

      <ol>
        <li><t>a governance or policy decision was made;</t></li>
        <li><t>a control instruction was constructed and emitted;</t></li>
        <li><t>the instruction crossed the last issuer-controlled boundary;</t></li>
        <li><t>the intended enforcement point received and matched it;</t></li>
        <li><t>the enforcement point applied or refused it; and</t></li>
        <li><t>the intended control effect was observed.</t></li>
      </ol>

      <t>Evidence for one item does not, without an explicitly specified and
      verified binding, establish a later item.  In particular, a decision
      record does not establish dispatch; dispatch does not establish receipt;
      receipt does not establish enforcement; and enforcement does not
      establish an observed control effect.</t>

      <t>The reverse inference is also unsafe.  Missing receiver evidence can
      result from non-delivery, delayed delivery, delayed evidence export, a
      failed observer, retention loss, clock disagreement, identifier mismatch,
      or evidence suppression.  A receiver cannot report a control it never
      received.  An issuer cannot, from silence alone, prove what happened
      inside the receiver's boundary.</t>

      <t>The failure model includes at least:</t>

      <ul>
        <li><t>transport rejection, loss, reordering, duplication, and retry;</t></li>
        <li><t>identifier collision or reuse;</t></li>
        <li><t>the same identifier carrying a different instruction digest;</t></li>
        <li><t>a receiver record with no issuer-side counterpart;</t></li>
        <li><t>malformed or unverifiable records;</t></li>
        <li><t>conflicting observations from the same or different observers;</t></li>
        <li><t>partial observer or evidence-store failure;</t></li>
        <li><t>clock skew and unsupported ordering claims;</t></li>
        <li><t>an enforcement point acknowledging receipt before persistence or
        processing;</t></li>
        <li><t>successful processing that produces no observable control
        effect; and</t></li>
        <li><t>compromise of an issuer, receiver, observer, verifier, or signing
        key.</t></li>
      </ul>

      <t>The requirements below do not eliminate those failures.  They make the
      distinctions and residual uncertainty interoperably visible.</t>
    </section>

    <section anchor="model">
      <name>Logical Evidence Model</name>

      <t>An implementation MAY carry the required facts in one artifact, in
      several artifacts, in protocol fields, in telemetry, or through external
      references.  Regardless of packaging, a consumer needs to distinguish
      the following logical observations.</t>

      <section anchor="issuer-observation">
        <name>Issuer-Side Emission</name>

        <t>The issuer-side observation records that a particular instruction
        crossed a declared issuer boundary.  It binds a stable instruction
        identifier to a digest of the exact governed instruction or declared
        projection, identifies the target enforcement point or resolution
        input, and attributes the observation to the issuer-side observer.</t>

        <t>Creation of an in-memory object, enqueueing inside the issuer's own
        process, or a policy decision that has not reached the declared boundary
        does not satisfy this observation.</t>
      </section>

      <section anchor="receiver-observation">
        <name>Receiver-Side Observation</name>

        <t>The receiver-side observation records that the intended enforcement
        point, or an endpoint-bound observer acting for it, read an instruction
        with the same stable identifier and digest.  The record identifies the
        receiving boundary and the verification or matching result.</t>

        <t>A transport-level "accepted" or "queued" response is evidence about
        that transport boundary.  It MUST NOT be labeled as enforcement-point
        receipt unless the applicable profile defines the endpoint binding,
        delivery semantics, persistence point, and failure behavior that make
        the equivalence valid.</t>
      </section>

      <section anchor="enforcement-observation">
        <name>Enforcement Outcome</name>

        <t>The enforcement outcome reports what the enforcement point did after
        receiving and evaluating the instruction.  At minimum, a profile that
        reports enforcement MUST be able to distinguish:</t>

        <dl newline="true" spacing="normal">
          <dt>APPLIED</dt>
          <dd><t>The enforcement point reports that it applied the specified
          control under the declared local semantics.</t></dd>

          <dt>REFUSED</dt>
          <dd><t>The enforcement point reports that it intentionally did not
          apply the control, with a scoped reason or reason class where
          disclosure policy permits.</t></dd>

          <dt>NO_EFFECT</dt>
          <dd><t>The enforcement point processed the control but reports that it
          caused no change under the declared predicate and observation
          window.</t></dd>

          <dt>UNKNOWN</dt>
          <dd><t>The enforcement point cannot determine or support one of the
          preceding outcomes.</t></dd>
        </dl>

        <t>APPLIED is an attributable enforcement assertion.  It is not, by
        itself, independent observation of the resulting runtime state.</t>
      </section>

      <section anchor="effect-observation">
        <name>Control-Effect Observation</name>

        <t>A control-effect observation records a scoped predicate over the
        governed runtime state, such as "task X was no longer dispatching tool
        calls during window W".  It identifies the observer, observation
        method, target, predicate, window, and result.</t>

        <t>Where independent corroboration is claimed, the observer MUST be
        independent of both the issuer and the enforcement point under the
        stated trust model.  An implementation MUST NOT infer independence from
        a different process name, service label, or signing key alone.</t>
      </section>
    </section>

    <section anchor="requirements">
      <name>Evidence Preservation Requirements</name>

      <section anchor="r-cd-1">
        <name>R-CD-1: Stable Instruction Identity</name>

        <t>Each control instruction crossing a control boundary MUST have an
        identifier that remains stable across issuer, transport, receiver,
        enforcement, and reconciliation observations.  The identifier's
        uniqueness scope and reuse rules MUST be defined.  A decision, task,
        session, action, or delegation reference MAY also be carried, but it
        MUST NOT replace the instruction identifier unless the protocol defines
        identical uniqueness and lifecycle semantics.</t>
      </section>

      <section anchor="r-cd-2">
        <name>R-CD-2: Content Binding</name>

        <t>Every observation used to correlate a control instruction MUST bind
        the instruction identifier to a digest of either the exact instruction
        or a declared canonical projection of it.  The projection, digest
        algorithm, canonicalization rule, and domain-separation rule, if any,
        MUST be identified by the applicable protocol or profile.</t>

        <t>A digest match establishes byte or projection correspondence under
        the named algorithm.  It does not establish semantic equivalence,
        correctness, authority, or truth.</t>
      </section>

      <section anchor="r-cd-3">
        <name>R-CD-3: Boundary Attribution</name>

        <t>Each observation MUST identify the observer, the boundary side
        observed, and the event being asserted.  The evidence profile MUST
        state how the observer identity and its authority are verified.  If the
        producer is able to rewrite the purported corroborating record, the
        record MUST NOT be described as independent evidence.</t>
      </section>

      <section anchor="r-cd-4">
        <name>R-CD-4: Issuer-Side Emission</name>

        <t>When an implementation claims that a control was dispatched, it MUST
        emit or preserve an issuer-side observation at the last declared
        issuer-controlled boundary.  The observation MUST include the stable
        identifier, content binding, target or resolution input, observed time,
        and boundary description.</t>

        <t>If emission fails before that boundary, the implementation MUST NOT
        report the instruction as dispatched.  It SHOULD record the failed
        emission attempt as a positive failure event.</t>
      </section>

      <section anchor="r-cd-5">
        <name>R-CD-5: Receiver-Side Observation</name>

        <t>An implementation MUST NOT report delivery to the enforcement point
        unless it has a matching receiver-side observation or a receipt whose
        endpoint semantics satisfy <xref target="receiver-observation"/>.  The
        observation MUST carry the stable identifier, content binding, receiver
        identity, observed time, and verification result.</t>

        <t>A receiver MUST NOT acknowledge a digest or instruction identifier
        it did not read and match.  If verification or content matching fails,
        the receiver SHOULD preserve a scoped failure observation rather than
        emitting a successful acknowledgement.</t>
      </section>

      <section anchor="r-cd-6">
        <name>R-CD-6: Separate Enforcement Outcome</name>

        <t>Receipt and enforcement MUST be represented as separate facts.  An
        implementation that reports an enforcement result MUST distinguish at
        least APPLIED, REFUSED, NO_EFFECT, and UNKNOWN, or define a lossless
        mapping from its native states to those meanings.  Missing enforcement
        evidence MUST NOT default to APPLIED.</t>
      </section>

      <section anchor="r-cd-7">
        <name>R-CD-7: Separate Control-Effect Observation</name>

        <t>An observed control effect MUST be represented separately from both
        delivery and enforcement.  The observation MUST name its predicate,
        target, method, observer relationship, start and end conditions, and
        result.  A claim that no effect occurred MUST be bounded by an
        observation window and predicate; silence alone MUST NOT be reported as
        NO_EFFECT.</t>
      </section>

      <section anchor="r-cd-8">
        <name>R-CD-8: Negative Observations</name>

        <t>A negative observation MUST record what was positively observed,
        from which boundary, and as of which cutoff.  Profiles SHOULD support at
        least the following conceptual conditions where applicable:</t>

        <ul>
          <li><t>deadline elapsed without a matching acknowledgement;</t></li>
          <li><t>counterpart missing at the reconciliation cutoff;</t></li>
          <li><t>transport rejected the identified attempt;</t></li>
          <li><t>verification or content matching failed; and</t></li>
          <li><t>outcome remained undetermined after the declared deadline.</t></li>
        </ul>

        <t>The absence of an observation record is not a negative observation.
        A deadline-elapsed record establishes the reconciler's bounded view; it
        does not prove that the receiver never received the instruction.</t>
      </section>

      <section anchor="r-cd-9">
        <name>R-CD-9: Time and Ordering</name>

        <t>Each timed observation MUST identify its time value and the relevant
        clock or trust basis.  A profile that reports cross-observer latency or
        precedence MUST state how clock synchronization, trusted timestamping,
        causal linkage, or another ordering mechanism supports that claim.</t>

        <t>Matching identifiers and digests establish correspondence.  They do
        not, by themselves, establish that one observation preceded another.
        Unsupported ordering claims MUST be omitted or reported as
        indeterminate.</t>
      </section>

      <section anchor="r-cd-10">
        <name>R-CD-10: Total Reconciliation</name>

        <t>A reconciler MUST produce a deterministic disposition for every
        instruction and every input record presented under a declared profile.
        Malformed, unverifiable, duplicate, conflicting, and unmatched records
        MUST NOT be silently discarded.  A reconciler MUST NOT produce a
        successful delivery verdict solely because no failure record exists.</t>

        <t>The minimum per-instruction delivery dispositions are defined in
        <xref target="reconciliation-states"/>.  A profile MAY add more specific
        states, provided that it defines a lossless mapping to the minimum set
        and does not weaken UNCONFIRMED, INVALID, CONFLICT, or INDETERMINATE into
        success.</t>
      </section>

      <section anchor="r-cd-11">
        <name>R-CD-11: Bounded-Population Accounting</name>

        <t>An implementation claiming completeness over a set of controls MUST
        declare a reproducible inclusion rule, observation window,
        reconciliation cutoff, and expected issuer-instruction count.  Each
        expected instruction MUST appear in exactly one per-instruction
        disposition.  Each receiver-side input record MUST also be accounted
        for as matched, orphaned, duplicated, or invalid.</t>

        <t>If the implementation cannot define a closed population, it MUST NOT
        claim complete delivery, complete failure detection, or complete
        reconciliation.  It MAY report per-record results with an explicit open
        population scope.</t>
      </section>

      <section anchor="r-cd-12">
        <name>R-CD-12: Resolution Failure</name>

        <t>If a control instruction refers to an external decision, policy,
        action, task, target, key, or evidence binding, the applicable protocol
        or profile MUST define behavior when that reference cannot be resolved,
        is stale, resolves ambiguously, or resolves to inconsistent content.
        Unresolved or ambiguous bindings MUST NOT be treated as verified
        delivery or successful enforcement.</t>
      </section>

      <section anchor="r-cd-13">
        <name>R-CD-13: Scope and Non-Claims</name>

        <t>Evidence producers and reconcilers MUST state what each result covers
        and what it does not cover.  At minimum, integrity, attribution,
        delivery, enforcement, observed control effect, ordering, completeness,
        and independent corroboration MUST NOT be implied unless each is
        separately supported under the declared trust model.</t>

        <t>A signature establishes only the properties supported by the verified
        key binding and signature input.  A transparency receipt establishes
        only the registration or inclusion properties supplied by the relevant
        transparency service.  Neither establishes the truth of a producer's
        event assertion by itself.</t>
      </section>

      <section anchor="r-cd-14">
        <name>R-CD-14: Consumption and Fail-Safe Handling</name>

        <t>An unacknowledged or unresolved safety-relevant control instruction
        MUST NOT be consumed as delivered.  A relying system SHOULD expose
        UNCONFIRMED, CONFLICT, INVALID, and INDETERMINATE results to operational
        policy and SHOULD define a fail-safe, retry, escalation, or human
        notification behavior appropriate to the controlled risk.</t>

        <t>This document does not select the operational response.  It requires
        that uncertainty remain distinguishable at the point where that local
        response is chosen.</t>
      </section>
    </section>

    <section anchor="reconciliation">
      <name>Reconciliation Model</name>

      <section anchor="reconciliation-states">
        <name>Per-Instruction Delivery Dispositions</name>

        <t>A conforming reconciliation profile MUST preserve at least the
        following meanings:</t>

        <dl newline="true" spacing="normal">
          <dt>CONFIRMED</dt>
          <dd><t>A receiver-side observation matches the issuer-side instruction
          identifier and content binding under the declared verification
          rules.</t></dd>

          <dt>EXPLICIT_FAILURE</dt>
          <dd><t>A positive, attributable failure observation applies to the
          identified attempt and boundary.  The result MUST state its scope and
          MUST NOT be generalized to every possible delivery path.</t></dd>

          <dt>UNCONFIRMED</dt>
          <dd><t>An issuer-side instruction exists, but no matching receiver-side
          observation is available at the reconciliation cutoff.</t></dd>

          <dt>SUBSTITUTION</dt>
          <dd><t>Issuer-side and receiver-side records use the same instruction
          identifier but different content bindings.</t></dd>

          <dt>CONFLICT</dt>
          <dd><t>Two or more otherwise applicable records make incompatible
          assertions that the profile cannot deterministically resolve.</t></dd>

          <dt>INVALID</dt>
          <dd><t>The instruction or a required record is malformed, fails native
          verification, or lacks a required binding.</t></dd>

          <dt>INDETERMINATE</dt>
          <dd><t>The available inputs do not support a stronger disposition for a
          reason other than ordinary absence of a receiver observation.</t></dd>
        </dl>

        <t>Receiver-side records that have no issuer-side instruction in the
        declared issuer population are ORPHAN records.  Duplicate and invalid
        receiver records are counted separately for record accounting.  ORPHAN
        is not an instruction disposition because there is no corresponding
        expected issuer instruction.</t>

        <t>The delivery disposition is independent of the enforcement outcome
        and the control-effect result.  For example, an instruction can have
        delivery CONFIRMED, enforcement APPLIED, and control effect UNKNOWN.</t>
      </section>

      <section anchor="reconciliation-algorithm">
        <name>Minimum Reconciliation Procedure</name>

        <t>For a declared bounded population, a reconciler:</t>

        <ol>
          <li><t>freezes the profile revision, trust inputs, inclusion rule,
          observation window, and reconciliation cutoff;</t></li>
          <li><t>parses every input record and retains invalid inputs in an error
          population;</t></li>
          <li><t>performs each artifact's native integrity, identity, freshness,
          and authorization checks before consuming its claims;</t></li>
          <li><t>groups valid records by stable instruction identifier without
          assuming that identifier equality implies content equality;</t></li>
          <li><t>compares content bindings and boundary roles;</t></li>
          <li><t>assigns exactly one delivery disposition to every expected
          issuer instruction;</t></li>
          <li><t>accounts separately for every receiver record as matched,
          orphaned, duplicated, or invalid;</t></li>
          <li><t>reports enforcement and control-effect results as separate
          dimensions; and</t></li>
          <li><t>emits counts, exclusions, and limitations sufficient for a third
          party to repeat the same structural verdict.</t></li>
        </ol>

        <t>Profile-specific conflict resolution MAY select among duplicate or
        superseding records, but the discarded alternatives and the selection
        rule MUST remain reviewable.</t>
      </section>

      <section anchor="population-conservation">
        <name>Population Conservation</name>

        <t>Let I be the bounded set of expected issuer instructions.  A
        reconciliation report that claims complete instruction accounting MUST
        satisfy:</t>

        <artwork align="center"><![CDATA[
|I| = Nconfirmed + Nexplicit_failure + Nunconfirmed
    + Nsubstitution + Nconflict + Ninvalid + Nindeterminate
]]></artwork>

        <t>Let R be the bounded set of receiver-side input records.  Complete
        receiver-record accounting MUST separately satisfy:</t>

        <artwork align="center"><![CDATA[
|R| = Nmatched + Norphan + Nduplicate + Ninvalid_receiver
]]></artwork>

        <t>The equations describe accounting classes, not wire values or IANA
        registries.  Profiles MAY subdivide a class, but the sum of its
        subdivisions MUST preserve the parent count.  Records excluded before
        population construction MUST be reported with the exclusion rule and
        count; otherwise the completeness claim is not reproducible.</t>
      </section>

      <section anchor="global-results">
        <name>Aggregate Results</name>

        <t>A profile MAY define aggregate results such as PASS, FAIL, or
        INCONCLUSIVE.  If it does:</t>

        <ul>
          <li><t>PASS MUST require every expected instruction to meet the
          profile's successful per-instruction conditions;</t></li>
          <li><t>FAIL MUST identify at least one positive failing condition and
          MUST NOT be inferred solely from missing evidence;</t></li>
          <li><t>UNCONFIRMED, CONFLICT, INVALID, or INDETERMINATE input MUST
          prevent PASS unless the profile explicitly excludes that input before
          population construction; and</t></li>
          <li><t>the report MUST publish the complete class counts rather than
          only the aggregate label.</t></li>
        </ul>
      </section>
    </section>

    <section anchor="protocol-attachment">
      <name>Protocol Attachment Points</name>

      <t>A protocol need not carry an audit receipt to preserve the facts needed
      by an external evidence layer.  When a governance-relevant transition
      crosses a protocol or administrative boundary, the protocol or its
      implementation profile SHOULD provide attachment points for:</t>

      <ul>
        <li><t>a stable control-instruction identifier and, where available, a
        stable reference to the upstream decision, action, task, or session;</t></li>
        <li><t>a digest of the exact governed instruction or declared action
        projection;</t></li>
        <li><t>the issuer and intended enforcement-point identities or
        resolution inputs;</t></li>
        <li><t>an attributable outcome that preserves deny, defer, reject,
        timeout, unresolved, and indeterminate states;</t></li>
        <li><t>a way to distinguish transport acceptance from enforcement-point
        receipt;</t></li>
        <li><t>an explicit rule for stale, missing, ambiguous, or inconsistent
        external references; and</t></li>
        <li><t>a stable reference through which an external evidence system can
        bind additional observations without changing the protocol's native
        message format.</t></li>
      </ul>

      <t>These attachment points can be realized as native fields, structured
      errors, acknowledgements, protocol events, or references.  This document
      does not require that evidence artifacts be transferred inline.</t>

      <t>In agent communication requirements work, accountability and auditing
      can remain out of scope while these preservation properties remain in
      scope.  The distinction is that this document does not ask the protocol to
      define what an auditor concludes.  It asks the protocol boundary not to
      erase the identifiers, bindings, outcomes, and failure semantics that any
      downstream verifier would need.</t>
    </section>

    <section anchor="composition">
      <name>Composition with Existing Mechanisms</name>

      <section anchor="native-verification">
        <name>Native Verification First</name>

        <t>Each credential, signature, attestation, authorization result,
        transport acknowledgement, telemetry record, and transparency receipt
        retains its native semantics and verifier.  A reconciler MUST perform or
        consume the result of the native verification before treating the
        artifact as evidence for a control-delivery claim.</t>

        <t>A self-declared algorithm, key identifier, role, or observer label
        MUST NOT drive trust without an externally configured or otherwise
        verified binding.  Composition MUST NOT strengthen the weakest input
        beyond its verified meaning.</t>
      </section>

      <section anchor="scitt-composition">
        <name>SCITT Composition</name>

        <t><xref target="RFC9943"/> defines signed statements and receipts for
        registration in a transparency service.  A control observation or
        reconciliation report can be carried as, or referenced by, a SCITT
        Signed Statement.  A SCITT receipt can then provide evidence of the
        registration properties defined by that service.</t>

        <t>SCITT registration does not, by itself, prove that a control was
        delivered, enforced, correctly observed, or true.  Those meanings still
        depend on the observation boundary, native verification, content
        binding, and reconciliation rules defined here and in the applicable
        profile.</t>
      </section>

      <section anchor="telemetry-composition">
        <name>Telemetry and Trace Composition</name>

        <t>Telemetry systems can carry timestamps, trace identifiers, and
        correlated events.  A trace identifier can help locate related records,
        but trace membership alone does not establish instruction-content
        equality, authority, endpoint receipt, ordering across untrusted clocks,
        or independence.  Profiles using telemetry MUST state which required
        bindings are native, derived, or absent.</t>
      </section>
    </section>

    <section anchor="operational">
      <name>Operational Considerations</name>

      <section anchor="deadlines">
        <name>Deadlines, Retries, and Late Evidence</name>

        <t>Deployments SHOULD define acknowledgement and reconciliation
        deadlines based on the controlled risk and transport characteristics.
        The deadline source, start event, units, and clock basis need to be
        explicit.  A late receiver observation can change UNCONFIRMED to
        CONFIRMED in a later reconciliation run, but the earlier report and its
        cutoff SHOULD remain available.</t>

        <t>Retries SHOULD reuse or relate identifiers according to a declared
        rule.  Reusing one identifier for different instruction content creates
        SUBSTITUTION, not a retry.  Creating a new identifier for every retry
        without a common attempt-group reference can hide repeated delivery
        failures.</t>
      </section>

      <section anchor="durability">
        <name>Durability and Acknowledgement Point</name>

        <t>A profile SHOULD state whether receiver acknowledgement occurs after
        parsing, verification, durable persistence, admission to an enforcement
        queue, or completed enforcement.  Implementations MUST NOT use the same
        acknowledgement value for several of those points unless the profile
        defines the combined semantics and residual failure window.</t>
      </section>

      <section anchor="multi-path">
        <name>Multiple Enforcement Paths</name>

        <t>A control can be ineffective even when one enforcement point applies
        it if an alternate path remains open.  A deployment claiming complete
        control mediation SHOULD enumerate the paths within scope and identify
        the enforcement point for each path.  This document does not prove that
        the enumeration is complete.</t>
      </section>
    </section>

    <section anchor="security">
      <name>Security Considerations</name>

      <t>The evidence described here is security-relevant because it can drive
      escalation, incident response, or claims that an agent was stopped.  An
      attacker can target the instruction, the delivery path, the observer, the
      evidence store, the verifier, or the reconciliation population.</t>

      <section anchor="substitution-replay">
        <name>Substitution, Replay, and Identifier Reuse</name>

        <t>An attacker can reuse an instruction identifier with weaker content,
        replay an old acknowledgement, or correlate a receiver record to the
        wrong attempt.  Stable identifiers, content digests, freshness rules,
        target binding, and attempt-group semantics mitigate these attacks.
        Digest algorithms and canonicalization rules need downgrade-resistant
        selection.</t>
      </section>

      <section anchor="observer-compromise">
        <name>Observer and Key Compromise</name>

        <t>A valid signature proves control of a signing key over the signed
        bytes; it does not prove that the observer actually saw the asserted
        event.  Key-to-observer binding, protected key use, process and storage
        separation, attestation where appropriate, and independent observation
        can improve confidence.  None should be overstated as ground truth.</t>
      </section>

      <section anchor="suppression">
        <name>Evidence Suppression and Selective Population</name>

        <t>A producer can suppress failed controls or choose a favorable subset
        after the fact.  Bounded-population construction, entry-emission rules,
        append-only or transparency mechanisms, and independent counters can
        make suppression more detectable.  An open population cannot support a
        completeness claim.</t>
      </section>

      <section anchor="availability">
        <name>Availability and Fail-Safe Policy</name>

        <t>An attacker can withhold acknowledgements or evidence to force
        fail-safe shutdowns, or flood a reconciler with orphan and invalid
        records.  Implementations need resource limits, authenticated inputs,
        replay control, rate limiting, and a local policy that balances safety
        and availability.  The evidence layer MUST preserve the uncertain state
        even when local policy chooses to continue operation.</t>
      </section>

      <section anchor="semantic-gap">
        <name>Semantic and Physical-World Gaps</name>

        <t>Matching digests do not prove that two implementations assign the
        same meaning to a control verb.  An enforcement assertion does not prove
        a physical-world outcome.  Profiles need versioned control semantics and
        scoped effect predicates.  High-consequence deployments require
        domain-specific validation beyond this document.</t>
      </section>
    </section>

    <section anchor="privacy">
      <name>Privacy Considerations</name>

      <t>Control evidence can reveal agent identities, user relationships,
      incident timing, policy decisions, operational topology, and sensitive
      task state.  Stable identifiers can enable correlation across services
      and observation windows.</t>

      <t>Implementations SHOULD minimize payloads, use scoped or pseudonymous
      identifiers where possible, separate identity resolution from routine
      evidence exchange, apply access controls and retention limits, and support
      selective disclosure.  Raw prompts, chain-of-thought, model context,
      personal data, and proprietary policy SHOULD NOT be included by default.</t>

      <t>Publishing a digest instead of content reduces direct disclosure but
      does not eliminate it.  Digests of low-entropy or enumerable values can be
      guessed.  Profiles SHOULD use commitments, nonces, or access-controlled
      references where dictionary attacks are relevant.</t>

      <t>Independent observation increases corroboration but can also increase
      data replication and linkability.  The independence requirement is scoped
      to claims that explicitly need independent corroboration; it is not a
      requirement to disclose every event to an additional party.</t>
    </section>

    <section anchor="implementation-status" removeInRFC="true">
      <name>Implementation Status</name>

      <t>This section records implementation experience available as of 30
      August 2026 and is intended to be removed before publication as an RFC.</t>

      <t>The AI Runtime Evidence Protocol (AIREP) <xref target="AIREP-REPO"/>
      is one experimental implementation source for the distinctions in this
      document.  AIREP v0.1 remains its recommended implementation target.  Its
      control-delivery profile records issuer, enforcement-point, and witness
      observations and includes a total reconciler.  At repository commit
      617fa1a1903f1fd10c8e157a95592950aebcfde9, the reference runner reproduced
      the expected verdict and per-instruction status for all 12 committed
      control-delivery reconciliation bundles.</t>

      <t>AIREP v0.2.0-alpha.1 <xref target="AIREP-V02"/> is an experimental
      prerelease.  It separates Decision Receipts, Control Evidence, Execution
      Evidence, and Effect Evidence and correlates them through explicit
      identifiers and digests.  Its released artifacts include five JSON Schema
      files -- four artifact-family schemas and one shared definitions schema --
      a 117-fixture two-engine schema-validation corpus, and two separately
      authored first-party class verifiers exercised against a 60-case corpus
      with 15 process probes.  It has no producer implementation, no independent
      third-party producer or audit, and no stable-release claim.  It does not
      supersede v0.1.</t>

      <t>The AIREP artifacts do not establish a deployed end-to-end delivery or
      control-effect claim.  They are cited as implementation and test-vector
      input, not as evidence of broad adoption or IETF consensus.  The protocol
      design and its evaluation are described in <xref target="AIREP-PAPER"/>.</t>

      <t>Additional independently implemented producers, consumers, and
      interoperation results are sought, particularly for paired issuer-side
      and enforcement-point-side evidence across real administrative
      boundaries.</t>
    </section>

    <section anchor="related-work">
      <name>Relationship to Adjacent Work</name>

      <t>The agent communication use-case and requirements work
      <xref target="I-D.agentic-ai-usecases-requirements"/> treats
      accountability and auditing as separate work.  This document is
      compatible with that boundary: it defines only the minimum facts that
      need to survive protocol transitions so an external evidence layer can
      later bind them.</t>

      <t>The auditing architecture in
      <xref target="I-D.kuehlewind-audit-architecture"/> links user intent,
      delegation, authorization, execution, and distributed audit records
      across agent-driven interactions.  This document addresses a narrower
      lifecycle within that architecture: evidence that a governance control
      was emitted, observed at the intended enforcement point, processed, and
      reflected in governed runtime state.  It can therefore serve as a
      specialized control-delivery requirements input without replacing the
      broader audit-context and record architecture.</t>

      <t><xref target="I-D.bu-agentproto-security-principal-binding"/> separates
      claims, carriers, verifiers, bindings, failure behavior, and accepted
      results for agent protocols.  The requirements here specialize that
      discipline for the control-delivery lifecycle and its two boundary
      sides.</t>

      <t>Signed decision records <xref target="I-D.bradleyb-audit-decision-records"/>
      preserve authorization decisions, including denials and non-occurring
      actions, and distinguish correspondence from precedence.  A decision
      record can be an upstream reference for this document.  It does not by
      itself establish that a resulting control instruction reached an
      enforcement point.</t>

      <t>The Action Evidence Boundary
      <xref target="I-D.schrock-action-evidence-boundary"/> defines an
      executor-side processing model for consequential agent effects, including
      action correlation, local authorization, atomic consumption, invocation,
      effect outcomes, and reconciliation.  This document addresses a different
      direction and object: a governance control such as stop or revoke moving
      toward the component that constrains the runtime.  The "control effect"
      here is the governed runtime state, not the consequential business effect
      of the protected action.</t>

      <t>Execution-finality work
      <xref target="I-D.das-agentic-execution-finality"/> distinguishes model
      tool selection from authorized execution at a dispatch-time gate.  A stop
      or revoke control can target such a gate.  The present document asks how
      delivery and enforcement of that control are evidenced, rather than how
      the underlying tool action is authorized.</t>

      <t>The SCITT AI-agent receipt profile
      <xref target="I-D.noa-scitt-ai-agent-receipt"/> defines how an action
      receipt can be registered using SCITT.  This document is format-neutral
      and can supply control-delivery statement semantics for a SCITT-based
      profile without changing SCITT's registration semantics.</t>

      <t>The OWASP Agentic AI Threats and Mitigations project
      <xref target="OWASP-APTS"/> includes a human-oversight requirement that an
      unacknowledged kill instruction not be treated as delivered.  The
      requirements and negative-observation rules in this document generalize
      that implementation concern into a protocol-independent evidence
      contract.</t>
    </section>

    <section anchor="iana">
      <name>IANA Considerations</name>

      <t>This document has no IANA actions.</t>
    </section>

    <section anchor="acknowledgements">
      <name>Acknowledgements</name>

      <t>The author thanks participants in the agent2agent, agentproto, and
      SCITT communities whose discussions helped sharpen the distinction among
      decision, delivery, enforcement, and effect.  Specific names and review
      contributions will be added with permission in a later revision.</t>
    </section>
  </middle>

  <back>
    <references>
      <name>Normative References</name>

      <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119">
        <front>
          <title>Key words for use in RFCs to Indicate Requirement Levels</title>
          <author fullname="Scott Bradner" initials="S." surname="Bradner"/>
          <date month="March" year="1997"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="2119"/>
        <seriesInfo name="DOI" value="10.17487/RFC2119"/>
      </reference>

      <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174">
        <front>
          <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
          <author fullname="Barry Leiba" initials="B." surname="Leiba"/>
          <date month="May" year="2017"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="8174"/>
        <seriesInfo name="DOI" value="10.17487/RFC8174"/>
      </reference>
    </references>

    <references>
      <name>Informative References</name>

      <reference anchor="RFC9943" target="https://www.rfc-editor.org/info/rfc9943">
        <front>
          <title>An Architecture for Trustworthy and Transparent Digital Supply Chains</title>
          <author fullname="H. Birkholz" initials="H." surname="Birkholz"/>
          <author fullname="A. Delignat-Lavaud" initials="A." surname="Delignat-Lavaud"/>
          <author fullname="C. Fournet" initials="C." surname="Fournet"/>
          <author fullname="Y. Deshpande" initials="Y." surname="Deshpande"/>
          <author fullname="S. Lasker" initials="S." surname="Lasker"/>
          <date month="June" year="2026"/>
        </front>
        <seriesInfo name="RFC" value="9943"/>
        <seriesInfo name="DOI" value="10.17487/RFC9943"/>
      </reference>

      <reference anchor="I-D.kuehlewind-audit-architecture" target="https://datatracker.ietf.org/doc/draft-kuehlewind-audit-architecture/">
        <front>
          <title>An Architecture for Auditing AI Agent Delegation and Interactions</title>
          <author fullname="Mirja Kuehlewind" initials="M." surname="Kuehlewind"/>
          <author fullname="Henk Birkholz" initials="H." surname="Birkholz"/>
          <date day="18" month="May" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-kuehlewind-audit-architecture-00"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.agentic-ai-usecases-requirements" target="https://datatracker.ietf.org/doc/draft-agentic-ai-usecases-requirements/">
        <front>
          <title>Agentic AI Use Cases and Requirements</title>
          <author fullname="Tirumaleswar Reddy.K" initials="T." surname="Reddy.K"/>
          <author fullname="Zaheduzzaman Sarker" initials="Z." surname="Sarker"/>
          <author fullname="Kehan Yao" initials="K." surname="Yao"/>
          <date day="26" month="August" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-agentic-ai-usecases-requirements-02"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.bu-agentproto-security-principal-binding" target="https://datatracker.ietf.org/doc/draft-bu-agentproto-security-principal-binding/">
        <front>
          <title>Security Principal and Verifier Binding for Agent Communication Protocols</title>
          <author fullname="Songbo Bu" initials="S." surname="Bu"/>
          <date day="17" month="August" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-bu-agentproto-security-principal-binding-06"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.bradleyb-audit-decision-records" target="https://datatracker.ietf.org/doc/draft-bradleyb-audit-decision-records/">
        <front>
          <title>Signed Decision Records for Agent Authorization: Disclosures, Entry Emission, and Ordering Evidence</title>
          <author fullname="Bradley B" initials="B." surname="B"/>
          <date day="13" month="August" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-bradleyb-audit-decision-records-00"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.schrock-action-evidence-boundary" target="https://datatracker.ietf.org/doc/draft-schrock-action-evidence-boundary/">
        <front>
          <title>The Action Evidence Boundary for Consequential Agent Effects</title>
          <author fullname="Iman Schrock" initials="I." surname="Schrock"/>
          <date day="16" month="August" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-schrock-action-evidence-boundary-04"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.das-agentic-execution-finality" target="https://datatracker.ietf.org/doc/draft-das-agentic-execution-finality/">
        <front>
          <title>Tool Selection Is Not Execution: Finality for Agentic Tool Dispatch</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date day="27" month="August" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-agentic-execution-finality-01"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="I-D.noa-scitt-ai-agent-receipt" target="https://datatracker.ietf.org/doc/draft-noa-scitt-ai-agent-receipt/">
        <front>
          <title>A SCITT Profile for AI-Agent Action Receipts</title>
          <author fullname="Tora Toraman" initials="T." surname="Toraman"/>
          <date day="15" month="August" year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-noa-scitt-ai-agent-receipt-01"/>
        <refcontent>Work in Progress</refcontent>
      </reference>

      <reference anchor="OWASP-APTS" target="https://github.com/OWASP/APTS/blob/2b210945361bac207f37a21440d0f34c05c07ad9/standard/3_Human_Oversight/README.md">
        <front>
          <title>Agentic AI - Threats and Mitigations: Human Oversight</title>
          <author>
            <organization>OWASP Foundation</organization>
          </author>
          <date year="2026"/>
        </front>
        <refcontent>Repository snapshot at commit 2b210945361bac207f37a21440d0f34c05c07ad9</refcontent>
      </reference>

      <reference anchor="AIREP-REPO" target="https://github.com/halvrenofviryel/ai-runtime-evidence-protocol/tree/617fa1a1903f1fd10c8e157a95592950aebcfde9">
        <front>
          <title>AI Runtime Evidence Protocol (AIREP): Repository Snapshot</title>
          <author fullname="Ali Toygar Abak" initials="A. T." surname="Abak"/>
          <date day="27" month="August" year="2026"/>
        </front>
        <refcontent>Commit 617fa1a1903f1fd10c8e157a95592950aebcfde9</refcontent>
      </reference>

      <reference anchor="AIREP-V02" target="https://doi.org/10.5281/zenodo.22101986">
        <front>
          <title>AI Runtime Evidence Protocol v0.2.0-alpha.1</title>
          <author fullname="Ali Toygar Abak" initials="A. T." surname="Abak"/>
          <date day="25" month="August" year="2026"/>
        </front>
        <seriesInfo name="DOI" value="10.5281/zenodo.22101986"/>
      </reference>

      <reference anchor="AIREP-PAPER" target="https://arxiv.org/abs/2608.21363">
        <front>
          <title>AIREP: A Protocol for Per-Decision Evidence in AI Runtime Governance</title>
          <author fullname="Ali Toygar Abak" initials="A. T." surname="Abak"/>
          <date month="August" year="2026"/>
        </front>
        <seriesInfo name="arXiv" value="2608.21363"/>
      </reference>
    </references>

    <section numbered="false" anchor="appendix-logical-record">
      <name>Illustrative Logical Record Set</name>

      <t>The following example is deliberately not a wire format.  Field names
      are descriptive placeholders.  Equivalent facts can be carried in native
      protocol messages and external evidence artifacts.</t>

      <artwork name="Illustrative control-delivery observations" type="application/json"><![CDATA[
{
  "instruction_id": "ctrl-7f3a",
  "instruction_digest": "sha-256:<digest>",
  "decision_ref": "decision-1042",
  "issuer_observation": {
    "boundary": "governor/transport",
    "event": "dispatched",
    "observer": "governor.example",
    "observed_at": "2026-08-27T10:00:00Z"
  },
  "receiver_observation": {
    "boundary": "runtime/enforcement-point",
    "event": "received-and-matched",
    "observer": "ep.example",
    "observed_at": "2026-08-27T10:00:00.120Z"
  },
  "enforcement_outcome": {
    "result": "APPLIED",
    "observer": "ep.example"
  },
  "control_effect": {
    "predicate": "task no longer dispatches tool calls",
    "observer_relationship": "independent",
    "result": "UNKNOWN"
  },
  "scope": {
    "covers": [
      "issuer emission",
      "receiver receipt",
      "EP assertion"
    ],
    "does_not_cover": [
      "independent effect",
      "policy correctness"
    ]
  }
}
]]></artwork>

      <t>The example can support delivery CONFIRMED and enforcement APPLIED.  It
      cannot support an independently observed control effect because that
      result is UNKNOWN.</t>
    </section>

    <section numbered="false" anchor="appendix-tests">
      <name>Minimum Conformance Cases</name>

      <t>A profile claiming conformance to the reconciliation requirements
      SHOULD publish machine-readable test vectors for at least:</t>

      <ol>
        <li><t>matching issuer and receiver records: CONFIRMED;</t></li>
        <li><t>issuer record only at cutoff: UNCONFIRMED;</t></li>
        <li><t>same identifier and different digest: SUBSTITUTION;</t></li>
        <li><t>receiver record only: ORPHAN record accounting;</t></li>
        <li><t>positive transport rejection: scoped EXPLICIT_FAILURE;</t></li>
        <li><t>malformed issuer record: INVALID, retained in counts;</t></li>
        <li><t>malformed receiver record: invalid receiver-record accounting;</t></li>
        <li><t>duplicate matching receiver records: one match plus duplicate
        accounting under the profile's rule;</t></li>
        <li><t>conflicting valid observations: CONFLICT;</t></li>
        <li><t>missing acknowledgement without a negative-observation record:
        UNCONFIRMED, not EXPLICIT_FAILURE;</t></li>
        <li><t>deadline-elapsed negative observation followed by late matching
        receipt: versioned reconciliation results preserving both cutoffs;</t></li>
        <li><t>delivery CONFIRMED with enforcement UNKNOWN;</t></li>
        <li><t>enforcement APPLIED with control effect UNKNOWN;</t></li>
        <li><t>self-declared observer role without verified binding: no
        independence claim;</t></li>
        <li><t>unresolvable external binding: INDETERMINATE or INVALID according
        to the declared profile, never CONFIRMED; and</t></li>
        <li><t>a bounded population whose category counts fail conservation:
        aggregate result rejected or INCONCLUSIVE.</t></li>
      </ol>
    </section>
  </back>
</rfc>
