<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE rfc [
  <!ENTITY nbsp "&#160;">
]>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude"
     category="exp"
     docName="draft-watts-sink-attested-closure-00"
     ipr="trust200902"
     submissionType="IETF"
     consensus="true"
     tocInclude="true"
     tocDepth="3"
     sortRefs="true"
     symRefs="true"
     xml:lang="en"
     version="3">

  <front>
    <title abbrev="Sink-Attested Closure Evidence">Sink-Attested Closure Evidence (SACE): Signed Epoch Acknowledgements and Accountable Revocation Closure</title>
    <seriesInfo name="Internet-Draft" value="draft-watts-sink-attested-closure-00"/>
    <author fullname="Deonté O'dell Watts" initials="D. O." surname="Watts">
      <organization>GoodShyt Group Inc.</organization>
      <address>
        <postal>
          <city>San Francisco</city>
          <region>CA</region>
          <country>United States of America</country>
        </postal>
        <email>deonte@goodshyt.fun</email>
        <uri>https://orcid.org/0009-0005-8586-3650</uri>
      </address>
    </author>
    <date year="2026" month="November" day="15"/>
    <area>Security</area>
    <keyword>revocation</keyword>
    <keyword>delegation</keyword>
    <keyword>agent authorization</keyword>
    <keyword>COSE</keyword>
    <keyword>attestation</keyword>
    <abstract>
      <t>Revoking delegated authority in an agentic system is complete only when every place that can still act on that authority has stopped. Existing work defines the states of that process but leaves its evidence format open. This document defines Sink-Attested Closure Evidence (SACE): a small set of COSE-signed objects and one deterministic algorithm. An authority root signs a Scope Manifest naming the sinks a closure claim covers, and a Cut Statement raising the minimum admissible authority epoch. Each sink signs an Epoch Acknowledgement with its own key, binding the cut to the sequence number of the last effect it committed before applying it. Each committed effect yields a signed Effect Receipt. From these objects any party can compute one of three verdicts: CLOSED, UNKNOWN, or VIOLATED. A VIOLATED verdict comes with a transferable proof consisting of two signatures by the same sink. A sink that never acknowledges blocks CLOSED until it is removed from scope. An optional binding ties the acknowledging key to remote attestation evidence. This document makes no claim that a sink which signs an acknowledgement actually enforces it; it makes a sink that does not enforce it provably accountable for every effect it receipts.</t>
    </abstract>
  </front>

  <middle>

    <section anchor="intro">
      <name>Introduction</name>
      <t>A revocation request, a token invalidation, and the end of delegated authority are three different events. <xref target="I-D.watts-oauth-agent-revocation-closure"/> names that distinction, defines authority epochs and closure states, and leaves the wire encoding of closure receipts to a future profile. It defines no acknowledgement signed by an enforcement point, no manifest format, no sequence mechanism, and no state for a detected breach. This document is such a profile.</t>
      <t>A simple two-sink arrangement shows why the gap matters. Sink A commits a cut to epoch 8. Sink B, which has not received the cut, then accepts an epoch-7 request from a delegation descendant that A has never seen. The cut is committed at A, and closure does not hold over {A, B}. Four things are missing in that arrangement:</t>
      <ul>
        <li>A cut delivered to a sink is an update. It is not evidence that the sink applied anything.</li>
        <li>"All sinks" means "all sinks that happened to be known". Without a signed membership list, closure cannot be stated.</li>
        <li>The useful test is not "an old-epoch effect after A's cut". It is "an old-epoch effect at a sink after that sink's own acknowledgement".</li>
        <li>Rejections caused by clock expiry are indistinguishable from rejections caused by revocation.</li>
      </ul>
      <t>SACE answers each point with a concrete object.</t>

      <section anchor="scope">
        <name>Scope</name>
        <t>SACE defines evidence objects and their evaluation. It does not define how cuts are transported, how grants are issued, or any new token format. It works with any authorization system that can attach an integer authority epoch to each admitted request.</t>
      </section>

      <section anchor="related">
        <name>Relationship to Other Work</name>
        <t>The building blocks used here are established. Admission by a monotonically increasing number is the fencing technique long used with leases <xref target="LEASES"/>. The watermark recorded by a sink is a local component of a consistent cut <xref target="SNAPSHOTS"/>. Proofs made of two conflicting signed statements are the basis of accountability in distributed systems <xref target="PEERREVIEW"/>. Signed receipts and transparency are provided by <xref target="RFC9943"/> and <xref target="RFC9942"/>, and per-action agent receipts are profiled in <xref target="I-D.noa-scitt-ai-agent-receipt"/>. Revocation signalling exists in <xref target="RFC7009"/>, <xref target="I-D.chen-oauth-agent-revocation"/>, <xref target="I-D.sweeney-wimse-credential-delegation"/>, and <xref target="CAEP"/>; requirements for revocation freshness across organizations are collected in <xref target="I-D.reece-wimse-cross-org-delegation"/>. Delivery acknowledgement in those systems is a transport property. What this document adds is an acknowledgement signed by the sink that carries the sink's own commit watermark, together with a deterministic verdict over a signed membership list.</t>
        <t>The closest related document is <xref target="I-D.watts-rats-attested-fence-receipt"/>, which defines a receipt emitted by the hardware-rooted Attesting Environment of a sink after it applies an epoch fence, together with a closure evaluation over a declared sink set. That document and this one address the same gap from two sides. The fence receipt answers "what state was the sink's enforcement hardware in when it applied the fence". SACE answers "what did the sink sign, and does anything it signed later contradict it". SACE needs no hardware support, adds a membership list signed by the authority root, adds per-effect receipts, and adds violation proofs that a third party can check from two signatures. <xref target="afr"/> describes how the two are used together.</t>
      </section>

      <section anchor="reqlang">
        <name>Requirements Language</name>
        <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>", "<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" 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>
      </section>
    </section>

    <section anchor="principles">
      <name>Design Principles</name>
      <t>Seven principles constrain the mechanism. Each is enforced by a specific rule later in this document.</t>
      <ol>
        <li>Delivery is not application. Only a statement signed by the sink's own key counts as evidence that the sink applied a cut (<xref target="ack"/>).</li>
        <li>Closure is bounded by a signed list. A verdict names exactly one Scope Manifest and says nothing about any system outside it (<xref target="manifest"/>, <xref target="evaluation"/>).</li>
        <li>Missing evidence is UNKNOWN. No timeout, quorum, or majority converts an absent acknowledgement into closure (<xref target="evaluation"/>).</li>
        <li>An acknowledgement is a safety claim. By signing, a sink commits to a watermark. Anything it later receipts beyond that watermark under a revoked epoch convicts it (<xref target="proofs"/>).</li>
        <li>No clock in the safety predicate. Verdicts depend on epochs and sequence numbers. Timestamps are informational (<xref target="evaluation"/>).</li>
        <li>Agreement is not correctness. Two evaluators producing the same verdict shows that they implement the same function, not that the sinks are honest (<xref target="agreement"/>).</li>
        <li>Attestation describes the signer, not its behaviour. Evidence about the code that signed an acknowledgement does not prove that the code enforces it (<xref target="attestation"/>).</li>
      </ol>
    </section>

    <section anchor="terms">
      <name>Terminology and Roles</name>
      <dl newline="false" spacing="normal">
        <dt>Authority Root (AR):</dt>
        <dd>The party entitled to revoke. Signs Scope Manifests and Cut Statements.</dd>
        <dt>Sink:</dt>
        <dd>A system where delegated authority becomes a durable effect, such as a database write, a payment, or a message sent. Holds its own signing key.</dd>
        <dt>Authority epoch:</dt>
        <dd>An unsigned integer attached to every grant. Opaque to SACE except for ordering.</dd>
        <dt>Floor:</dt>
        <dd>The lowest authority epoch a sink will admit. Raised by a cut, never lowered.</dd>
        <dt>Effect sequence number (seq):</dt>
        <dd>A per-sink, per-scope counter, starting at 1, incremented by exactly one for each committed effect.</dd>
        <dt>Watermark (w):</dt>
        <dd>The value of a sink's seq at the instant it raised its floor; 0 if it had committed nothing.</dd>
        <dt>Evaluator:</dt>
        <dd>Any party that runs the algorithm in <xref target="evaluation"/>. An Evaluator needs no secret.</dd>
        <dt>Digest of an object:</dt>
        <dd>SHA-256 over the complete tagged COSE_Sign1 encoding of that object.</dd>
      </dl>
      <t>All SACE objects are COSE_Sign1 structures <xref target="RFC9052"/> whose payload is a CBOR map with integer keys, encoded using the deterministic encoding requirements of <xref target="RFC8949" section="4.2"/>. The protected header <bcp14>MUST</bcp14> carry "alg", "kid", and "typ" <xref target="RFC9596"/>. A receiver <bcp14>MUST</bcp14> reject an object whose payload is not deterministically encoded, has duplicate keys, or has keys that this document does not define.</t>
    </section>

    <section anchor="overview">
      <name>Protocol Overview</name>
      <t>One closure round has six steps. Transport between parties is out of scope; any channel works because every object is self-authenticating.</t>
      <ol>
        <li>The AR publishes a Scope Manifest listing each sink by identifier and key thumbprint.</li>
        <li>To revoke, the AR signs a Cut Statement that names the manifest by digest and sets a new floor epoch e.</li>
        <li>Each sink that receives the cut, in one atomic step with its effect commits, raises its floor to e and records its current seq as watermark w.</li>
        <li>The sink signs an Epoch Acknowledgement over the cut digest, e, w, and the head of its receipt chain, and returns or publishes it.</li>
        <li>For every effect it commits, before and after the cut, the sink emits an Effect Receipt carrying seq and the authority epoch of the grant it admitted.</li>
        <li>An Evaluator collects the manifest, the cut, the acknowledgements, and any receipts, and computes CLOSED, UNKNOWN, or VIOLATED.</li>
      </ol>
      <t>The admission rule at a sink is one comparison: admit a request only if its authority epoch is greater than or equal to the floor. This is the admission fencing of <xref target="I-D.watts-oauth-agent-revocation-closure"/>; SACE adds the evidence that it happened.</t>
    </section>

    <section anchor="states">
      <name>Sink State Machine</name>
      <t>A sink is in exactly one of four states for each scope. The state, the floor, the sequence counter, and the chain head are a single durable record and change only inside the transaction described for each event.</t>
      <table anchor="tab-states">
        <name>Sink States</name>
        <thead>
          <tr><th>State</th><th>Meaning</th><th>Requests in the scope</th></tr>
        </thead>
        <tbody>
          <tr><td>UNENROLLED</td><td>The sink holds no manifest that lists it.</td><td>Refused.</td></tr>
          <tr><td>ACTIVE(f)</td><td>The sink is listed and its floor is f.</td><td>Admitted if the authority epoch is at least f.</td></tr>
          <tr><td>HALTED</td><td>The sink cannot show that its durable record is current.</td><td>Refused until the sink re-acknowledges the latest cut.</td></tr>
          <tr><td>RETIRED</td><td>A later manifest no longer lists the sink.</td><td>Refused.</td></tr>
        </tbody>
      </table>
      <table anchor="tab-events">
        <name>Sink Events</name>
        <thead>
          <tr><th>Event</th><th>From</th><th>To</th><th>Action in one transaction</th></tr>
        </thead>
        <tbody>
          <tr><td>Manifest lists the sink</td><td>UNENROLLED</td><td>HALTED</td><td>Store the manifest digest; seq = 0; chain head = zero.</td></tr>
          <tr><td>Cut with epoch e &gt; f</td><td>ACTIVE(f) or HALTED</td><td>ACTIVE(e)</td><td>Set floor to e; record w = seq; sign and store the SEA.</td></tr>
          <tr><td>Cut with epoch e &lt;= f</td><td>ACTIVE(f)</td><td>ACTIVE(f)</td><td>None; return the stored SEA for f.</td></tr>
          <tr><td>Request with epoch &gt;= f</td><td>ACTIVE(f)</td><td>ACTIVE(f)</td><td>seq = seq + 1; write the effect; sign and store the ER; advance the chain head.</td></tr>
          <tr><td>Request with epoch &lt; f</td><td>ACTIVE(f)</td><td>ACTIVE(f)</td><td>None; refuse with reason "floor".</td></tr>
          <tr><td>Restore, or rollback-resistant counter disagrees with the record</td><td>ACTIVE(f)</td><td>HALTED</td><td>None; refuse all requests.</td></tr>
          <tr><td>New manifest omits the sink</td><td>any</td><td>RETIRED</td><td>Store the manifest digest.</td></tr>
        </tbody>
      </table>
      <t>A newly listed sink starts in HALTED, not ACTIVE, so that it cannot admit a request before it has acknowledged the latest cut. Its first SEA has watermark 0.</t>
      <t>Three invariants follow from the table and are what an implementation needs to preserve:</t>
      <dl newline="false" spacing="normal">
        <dt>I1 (monotonic floor):</dt>
        <dd>The floor never decreases.</dd>
        <dt>I2 (dense sequence):</dt>
        <dd>The sequence counter increases by exactly one per committed effect, and each value is used once.</dd>
        <dt>I3 (atomic fence):</dt>
        <dd>The floor raise and the watermark read are one atomic step with respect to every effect commit. No effect commit observes the old floor and receives a sequence number above the watermark.</dd>
      </dl>
    </section>

    <section anchor="manifest">
      <name>Scope Manifest</name>
      <t>A Scope Manifest is the signed, complete list of sinks that one closure claim covers. Its "typ" is "application/sace-manifest+cose". It is signed by the AR.</t>
      <table anchor="tab-manifest">
        <name>Scope Manifest Payload</name>
        <thead>
          <tr><th>Key</th><th>Name</th><th>Type</th><th>Rule</th></tr>
        </thead>
        <tbody>
          <tr><td>1</td><td>scope_id</td><td>bstr, 16 bytes</td><td>Random; fixed for the life of the scope.</td></tr>
          <tr><td>2</td><td>manifest_seq</td><td>uint</td><td>Starts at 1. Each new manifest increments it by one.</td></tr>
          <tr><td>3</td><td>prev_manifest</td><td>bstr / null</td><td>Digest of the preceding manifest; null when manifest_seq is 1.</td></tr>
          <tr><td>4</td><td>members</td><td>array of member</td><td>Sorted by sink_id in bytewise order. No duplicates.</td></tr>
          <tr><td>5</td><td>att_profile</td><td>tstr</td><td>OPTIONAL. If present, every acknowledgement carries attestation under this profile (<xref target="attestation"/>).</td></tr>
        </tbody>
      </table>
      <t>Each member is an array [sink_id, key_thumbprint, class]: a text identifier, the COSE Key Thumbprint <xref target="RFC9679"/> (SHA-256) of the sink's acknowledgement key, and a text label for the sink class.</t>
      <t>The following rules apply:</t>
      <ul>
        <li>A grant issued within a scope <bcp14>MUST</bcp14> name scope_id, and its audience <bcp14>MUST</bcp14> be a sink_id present in the current manifest.</li>
        <li>A sink <bcp14>MUST</bcp14> refuse any request in a scope for which it holds a manifest if its own sink_id and key are not in that manifest. This turns an unlisted sink from a silent gap into a refusal.</li>
        <li>Adding or removing a sink requires a new manifest. A sink added by manifest n+1 starts in HALTED (<xref target="states"/>) and <bcp14>MUST</bcp14> acknowledge the latest cut before it admits any request in the scope; its watermark is 0.</li>
        <li>A closure verdict over manifest n is not a verdict over manifest n+1.</li>
      </ul>
    </section>

    <section anchor="cut">
      <name>Cut Statement</name>
      <t>A Cut Statement raises the floor for one scope. Its "typ" is "application/sace-cut+cose". It is signed by the AR.</t>
      <table anchor="tab-cut">
        <name>Cut Statement Payload</name>
        <thead>
          <tr><th>Key</th><th>Name</th><th>Type</th><th>Rule</th></tr>
        </thead>
        <tbody>
          <tr><td>1</td><td>scope_id</td><td>bstr</td><td>As in the manifest.</td></tr>
          <tr><td>2</td><td>manifest</td><td>bstr</td><td>Digest of the Scope Manifest this cut applies to.</td></tr>
          <tr><td>3</td><td>epoch</td><td>uint</td><td>The new floor e. Authority epochs below e are revoked.</td></tr>
          <tr><td>4</td><td>prev_epoch</td><td>uint</td><td>The floor this cut supersedes. Less than epoch.</td></tr>
          <tr><td>5</td><td>cut_nonce</td><td>bstr, 16 bytes</td><td>Random. Makes two cuts to the same epoch distinguishable.</td></tr>
          <tr><td>6</td><td>issued_at</td><td>uint</td><td>Seconds since the Unix epoch. Informational only.</td></tr>
        </tbody>
      </table>
      <t>A sink processes a Cut Statement as follows, entirely inside the same serializable transaction that guards effect commits:</t>
      <ol>
        <li>Verify the AR signature and that "manifest" matches a manifest that the sink holds and is listed in.</li>
        <li>If "epoch" is less than or equal to the current floor, change nothing and return the stored acknowledgement for the current floor.</li>
        <li>Otherwise, set the floor to "epoch", set w to the current seq, and durably store both together with the cut digest.</li>
      </ol>
      <t>Step 2 makes reordered and replayed cuts harmless: a cut to 9 arriving before a cut to 8 leaves the floor at 9, and a replayed cut to 7 cannot lower it. A sink <bcp14>MUST</bcp14> store the exact bytes of each acknowledgement it signs and return those bytes on any repeat, so that an honest sink never produces two different acknowledgements for one cut.</t>
    </section>

    <section anchor="ack">
      <name>Sink Epoch Acknowledgement</name>
      <t>A Sink Epoch Acknowledgement (SEA) is a sink's own signed statement that it raised its floor, and where its effect counter stood when it did. Its "typ" is "application/sace-ack+cose". It <bcp14>MUST</bcp14> be signed by the key whose thumbprint the manifest lists for that sink. An acknowledgement signed by the AR, a proxy, or a coordinator on the sink's behalf is not an SEA.</t>
      <table anchor="tab-ack">
        <name>Sink Epoch Acknowledgement Payload</name>
        <thead>
          <tr><th>Key</th><th>Name</th><th>Type</th><th>Rule</th></tr>
        </thead>
        <tbody>
          <tr><td>1</td><td>scope_id</td><td>bstr</td><td>As in the manifest.</td></tr>
          <tr><td>2</td><td>manifest</td><td>bstr</td><td>Digest of the manifest the sink is listed in.</td></tr>
          <tr><td>3</td><td>sink_id</td><td>tstr</td><td>The sink's identifier in that manifest.</td></tr>
          <tr><td>4</td><td>cut</td><td>bstr</td><td>Digest of the Cut Statement that caused this floor.</td></tr>
          <tr><td>5</td><td>applied_epoch</td><td>uint</td><td>The floor now in force at this sink.</td></tr>
          <tr><td>6</td><td>prev_epoch</td><td>uint</td><td>The floor it replaced at this sink.</td></tr>
          <tr><td>7</td><td>watermark</td><td>uint</td><td>w: the sink's seq at the instant the floor was raised.</td></tr>
          <tr><td>8</td><td>chain_head</td><td>bstr</td><td>Digest of the Effect Receipt with seq = w; 32 zero bytes if w is 0.</td></tr>
          <tr><td>9</td><td>applied_at</td><td>uint</td><td>Sink-local time. Informational only.</td></tr>
          <tr><td>10</td><td>attestation</td><td>bstr</td><td>OPTIONAL. An EAT, per <xref target="attestation"/>.</td></tr>
        </tbody>
      </table>
      <t>By signing an SEA, a sink asserts two things and nothing else:</t>
      <ul>
        <li>Every effect it committed under an authority epoch below applied_epoch has seq less than or equal to watermark.</li>
        <li>It will commit no further effect under an authority epoch below applied_epoch.</li>
      </ul>
      <t>The watermark is what makes the second assertion checkable. Without it, an old-epoch receipt could always be explained as having been committed just before the cut. With it, the sink has fixed in advance which side of the line every sequence number falls on.</t>
      <t>An SEA satisfies a cut with epoch e if it is validly signed, names the same scope and manifest, and has applied_epoch greater than or equal to e. A sink that moved directly to a later epoch therefore also acknowledges every earlier cut.</t>
    </section>

    <section anchor="effect">
      <name>Effect Receipt</name>
      <t>An Effect Receipt (ER) is a sink's signed record of one committed effect. Its "typ" is "application/sace-effect+cose". It is signed by the same key as the sink's SEAs.</t>
      <table anchor="tab-effect">
        <name>Effect Receipt Payload</name>
        <thead>
          <tr><th>Key</th><th>Name</th><th>Type</th><th>Rule</th></tr>
        </thead>
        <tbody>
          <tr><td>1</td><td>scope_id</td><td>bstr</td><td>As in the manifest.</td></tr>
          <tr><td>2</td><td>sink_id</td><td>tstr</td><td>As in the manifest.</td></tr>
          <tr><td>3</td><td>seq</td><td>uint</td><td>Previous seq plus one. No gaps, no reuse.</td></tr>
          <tr><td>4</td><td>authority_epoch</td><td>uint</td><td>The epoch of the grant under which the effect was admitted.</td></tr>
          <tr><td>5</td><td>effect</td><td>bstr</td><td>SHA-256 of the canonical effect description. Never the effect itself.</td></tr>
          <tr><td>6</td><td>prev</td><td>bstr</td><td>Digest of the ER with seq minus one; 32 zero bytes when seq is 1.</td></tr>
        </tbody>
      </table>
      <t>The sink <bcp14>MUST</bcp14> assign seq, write the effect, and persist the ER in one atomic transaction. An effect without a receipt, or a receipt without an effect, is a sink fault.</t>
      <t>A deployment that already emits per-action receipts in another format, for example a signed statement as in <xref target="I-D.noa-scitt-ai-agent-receipt"/>, <bcp14>MAY</bcp14> use that format instead, provided that each receipt is signed by the manifest-listed key and carries sink_id, seq, authority_epoch, and prev under the sink's signature. Registering receipts in a Transparency Service <xref target="RFC9943"/> is <bcp14>RECOMMENDED</bcp14> where a sink might withhold them (<xref target="security"/>).</t>
    </section>

    <section anchor="evaluation">
      <name>Closure Evaluation</name>
      <t>The verdict is a pure function of its inputs: one Scope Manifest M, one Cut Statement C with epoch e, a set of SEAs, a set of ERs, an optional set of Checkpoints (<xref target="checkpoint"/>), and, when M sets att_profile, the Evaluator's appraisal policy for that profile (<xref target="attestation"/>). It uses no clock and no network.</t>
      <t>A sink makes a sequence commitment whenever it signs a statement that binds a sequence number n to a receipt digest d. Four statements do so:</t>
      <ul>
        <li>An ER with seq n commits (n, digest of that ER).</li>
        <li>An ER with seq n greater than 1 commits (n - 1, its "prev").</li>
        <li>An SEA with watermark w greater than 0 commits (w, its chain_head).</li>
        <li>A Checkpoint with seq n greater than 0 commits (n, its chain_head).</li>
      </ul>
      <t>For each member s of M, an Evaluator computes a member status:</t>
      <ol>
        <li>Discard every SEA, ER, and Checkpoint that is not validly signed by the key M lists for s, that names a different scope, or, for an SEA, that names a different manifest.</li>
        <li>If two SEAs from s have the same "cut" but are not byte-identical, s is VIOLATED (equivocation).</li>
        <li>If two sequence commitments from s bind the same n to different digests, s is VIOLATED (forked chain).</li>
        <li>If any SEA A from s and any ER from s satisfy authority_epoch &lt; A.applied_epoch and seq &gt; A.watermark, s is VIOLATED (stale commit).</li>
        <li>If no remaining SEA satisfies C, s is UNACKED.</li>
        <li>If M has att_profile and no SEA satisfying C carries attestation that passes <xref target="attestation"/>, s is UNACKED.</li>
        <li>Otherwise, s is ACKED.</li>
      </ol>
      <t>Steps 2 to 4 apply to every SEA from s, not only to those that satisfy C. The reported watermark of s is that of the satisfying SEA with the lowest applied_epoch, or null if there is none. It is reported for UNACKED and VIOLATED members too, when a satisfying SEA exists.</t>
      <t>The verdict over M and C is then:</t>
      <table anchor="tab-verdict">
        <name>Verdicts</name>
        <thead>
          <tr><th>Verdict</th><th>Condition</th><th>State in the base model</th></tr>
        </thead>
        <tbody>
          <tr><td>VIOLATED</td><td>At least one member is VIOLATED.</td><td>FAILED, with proof attached</td></tr>
          <tr><td>CLOSED</td><td>Every member is ACKED, and the non-vacuity check passes.</td><td>CLOSED</td></tr>
          <tr><td>UNKNOWN</td><td>Anything else.</td><td>PROPAGATING, PARTIAL, or UNKNOWN</td></tr>
        </tbody>
      </table>
      <dl newline="true" spacing="normal">
        <dt>Non-vacuity:</dt>
        <dd>CLOSED additionally requires a witness: either an ER from a member with a satisfying SEA, with authority_epoch below e and seq at or below that member's watermark; or a Checkpoint from such a member, with seq at or below its watermark, whose "counts" map gives a non-zero count for some epoch below e. This corresponds to the normal-path witness of <xref target="I-D.watts-oauth-agent-revocation-closure"/>: it shows that the revoked authority could reach a sink before the cut, so the result is not closure of an empty graph. Without a witness, the verdict is UNKNOWN.</dd>
        <dt>Monotonicity:</dt>
        <dd>Adding evidence can move a verdict from UNKNOWN to CLOSED, and from anything to VIOLATED. Nothing moves a verdict out of VIOLATED.</dd>
      </dl>
      <section anchor="silent">
        <name>The Silent-Sink Rule</name>
        <t>A member that has not signed a satisfying SEA is UNACKED, and a verdict with an UNACKED member is not CLOSED. No other evidence changes this. In particular, an Evaluator <bcp14>MUST NOT</bcp14> report CLOSED on the basis of:</t>
        <ul>
          <li>elapsed time since the cut, or any timeout;</li>
          <li>acknowledgements from a majority or any other proportion of members;</li>
          <li>activity by the member under the new epoch, receipts, or Checkpoints, none of which is an acknowledgement;</li>
          <li>a statement by the AR, a transport, or another member that the cut was delivered;</li>
          <li>a verdict record from another Evaluator.</li>
        </ul>
        <t>The only way to reach CLOSED without a member's acknowledgement is to remove the member from scope: the AR issues a new manifest that omits it and a new cut over that manifest. The verdict over the old manifest stays UNKNOWN and is retained (<xref target="operations"/>). Removal is therefore always visible as a change of scope and never as a closure.</t>
        <t>This rule chooses safety over liveness. A deployment that cannot tolerate one unresponsive sink blocking closure needs smaller scopes, not a weaker rule.</t>
      </section>
    </section>

    <section anchor="proofs">
      <name>Violation Proofs</name>
      <t>Every VIOLATED status is backed by exactly two objects signed by the same sink key. Anyone holding the manifest can check the proof offline, and the sink cannot attribute it to the network, the AR, or another sink.</t>
      <table anchor="tab-proofs">
        <name>Violation Proof Types</name>
        <thead>
          <tr><th>Type</th><th>The two objects</th><th>What they show</th></tr>
        </thead>
        <tbody>
          <tr><td>1: Stale commit</td><td>An SEA with applied_epoch = a and watermark = w; an ER with authority_epoch &lt; a and seq &gt; w</td><td>The sink committed revoked authority after stating that it had stopped.</td></tr>
          <tr><td>2: Equivocation</td><td>Two SEAs with the same cut and any differing field</td><td>The sink told two parties different things about one cut.</td></tr>
          <tr><td>3: Forked chain</td><td>Two objects, each an ER, an SEA, or a Checkpoint, that make conflicting sequence commitments (<xref target="evaluation"/>)</td><td>The sink keeps two histories, or acknowledged a chain head it did not have.</td></tr>
        </tbody>
      </table>
      <t>A violation proof is a CBOR array [proof_type, object_1, object_2]. It needs no signature of its own, because its force comes from the two signatures it contains. Type 3 covers four concrete forms, all detected by one rule: two ERs with the same seq; an ER whose "prev" disagrees with the receipt it names; an SEA whose chain_head disagrees with the receipt at its watermark; and a Checkpoint whose chain_head disagrees with a receipt, an SEA, or another Checkpoint.</t>
      <t>To verify a proof, a party holding the manifest checks that both objects are validly signed by the same manifest-listed key, that they are different objects, and that running steps 2 to 4 of <xref target="evaluation"/> over those two objects alone yields the stated type. A pair that does not convict on its own is not a proof, even if the member is VIOLATED on other evidence.</t>
      <t>The distinction from simpler tests is deliberate. "An old-epoch effect after A's cut" proves nothing about B. "An old-epoch effect at B beyond B's own signed watermark" proves that B broke its word.</t>
      <t>A sink restored from a backup taken before a cut will have a lower floor and will produce a stale-commit proof against itself once it commits. Sinks therefore <bcp14>MUST</bcp14> persist the floor in storage that a restore cannot roll back, or refuse all requests in the scope after a restore until they have re-acknowledged the latest cut.</t>
    </section>
    <section anchor="verdict-record">
      <name>Signed Verdict Record</name>
      <t>An Evaluator <bcp14>MAY</bcp14> publish its result as a Verdict Record. Its "typ" is "application/sace-verdict+cose". It is signed by the Evaluator's key and is a wire encoding for the closure receipt of <xref target="I-D.watts-oauth-agent-revocation-closure"/>.</t>
      <table anchor="tab-vrec">
        <name>Verdict Record Payload</name>
        <thead>
          <tr><th>Key</th><th>Name</th><th>Type</th><th>Rule</th></tr>
        </thead>
        <tbody>
          <tr><td>1</td><td>manifest</td><td>bstr</td><td>Digest of the manifest evaluated.</td></tr>
          <tr><td>2</td><td>cut</td><td>bstr</td><td>Digest of the cut evaluated.</td></tr>
          <tr><td>3</td><td>verdict</td><td>uint</td><td>0 UNKNOWN, 1 CLOSED, 2 VIOLATED.</td></tr>
          <tr><td>4</td><td>members</td><td>array</td><td>[sink_id, status, watermark / null] per member, sorted by sink_id.</td></tr>
          <tr><td>5</td><td>verdict_digest</td><td>bstr</td><td>As defined in <xref target="agreement"/>, over keys 1 to 4.</td></tr>
          <tr><td>6</td><td>proofs</td><td>array</td><td>Present if and only if the verdict is VIOLATED. One violation proof per VIOLATED member.</td></tr>
        </tbody>
      </table>
      <t>A relying party that receives a Verdict Record <bcp14>MUST</bcp14> check, in order:</t>
      <ol>
        <li>The signature, against an Evaluator key it trusts. How Evaluator keys become trusted is out of scope.</li>
        <li>That verdict_digest equals the digest recomputed from keys 1 to 4.</li>
        <li>That the verdict is VIOLATED if and only if some member has status 2, and that key 6 is present exactly when it is.</li>
        <li>That a CLOSED verdict has every member at status 1.</li>
        <li>If it holds the manifest: that the manifest digest matches key 1, and that every proof in key 6 verifies under <xref target="proofs"/>.</li>
      </ol>
      <t>These checks establish less than re-evaluation does, and the difference matters:</t>
      <ul>
        <li>A VIOLATED record whose proofs verify is self-supporting. Anyone with the manifest can confirm the conviction without trusting the Evaluator.</li>
        <li>A CLOSED or UNKNOWN record is a signed claim by the Evaluator. Step 4 stops a record from claiming CLOSED with a member that is not ACKED, but nothing in the record proves that a member is ACKED or that the non-vacuity witness exists. A relying party that needs that assurance re-runs <xref target="evaluation"/> over the objects.</li>
        <li>A record speaks only for the objects its Evaluator held. A later object can turn UNKNOWN into CLOSED, or anything into VIOLATED. A CLOSED record is superseded by any valid violation proof against a member.</li>
      </ul>
    </section>


    <section anchor="properties">
      <name>Properties</name>
      <t>This section states what the mechanism guarantees, under which assumptions, and what it does not guarantee. The arguments are informal sketches, not machine-checked proofs.</t>
      <t>A sink is called honest if it follows Sections <xref target="states" format="counter"/> to <xref target="effect" format="counter"/>, its signing key is not known to any other party, and its durable record is not rolled back.</t>
      <section anchor="prop-sound">
        <name>P1: An Honest Sink Is Never Convicted</name>
        <t>Claim: no set of objects signed by an honest sink contains a violation proof.</t>
        <t>Sketch. Stale commit: let the sink sign an SEA with applied_epoch a and watermark w. By I3, every effect committed after the fence has seq above w and was admitted against a floor of at least a (by I1), so its authority_epoch is at least a. Every effect with authority_epoch below a was therefore committed before the fence and has seq at most w. Equivocation: the sink stores the bytes of each SEA and returns them on repeat, so it signs one SEA per floor value. Forked chain: by I2 each seq value is assigned once, so one ER exists per seq.</t>
        <t>This property holds under any message ordering, partition, or clock offset, because none of them is an input to the sink's transaction or to the evaluation.</t>
      </section>
      <section anchor="prop-complete">
        <name>P2: Every Receipted Breach Is Detectable</name>
        <t>Claim: if a sink signs an SEA with applied_epoch a and watermark w, and also signs an ER with authority_epoch below a and seq above w, then every Evaluator that holds both objects and the manifest reports the member, and the verdict, as VIOLATED.</t>
        <t>Sketch. Both objects pass step 1 of <xref target="evaluation"/> because they are validly signed by the listed key. Step 4 compares every SEA with every ER from the same member, so the pair is found regardless of which cut is being evaluated.</t>
        <t>The claim is conditional on the Evaluator holding both objects. A sink that never emits the ER is outside it; see <xref target="security"/>.</t>
      </section>
      <section anchor="prop-mono">
        <name>P3: Evidence Is Monotone and VIOLATED Is Terminal</name>
        <t>Claim: for evidence sets X and Y with X a subset of Y, if the verdict over X is VIOLATED then the verdict over Y is VIOLATED, and if the verdict over Y is UNKNOWN then the verdict over X is not CLOSED.</t>
        <t>Sketch. A violation proof contained in X is contained in Y. A member that is ACKED over X has a satisfying SEA in X, which is also in Y, so it is ACKED or VIOLATED over Y; the non-vacuity witness in X is also in Y. Hence CLOSED over X implies CLOSED or VIOLATED over Y.</t>
      </section>
      <section anchor="prop-order">
        <name>P4: The Verdict Is a Function of the Object Set</name>
        <t>Claim: the verdict, the member statuses, and the verdict digest depend only on the set of valid objects supplied, not on their order, their arrival time, or the Evaluator's clock.</t>
        <t>Sketch. Every step of <xref target="evaluation"/> quantifies over sets. The member list is sorted before the digest is taken. Where more than one SEA satisfies the cut, the reported watermark is taken from the one with the lowest applied_epoch, which is unique for an unconvicted member.</t>
      </section>
      <section anchor="prop-closed">
        <name>P5: What CLOSED Implies, and Under Which Assumptions</name>
        <t>Claim: if the verdict over manifest M and a cut to epoch e is CLOSED, and (A1) every member of M is honest, and (A2) every system able to commit an effect under a grant in the scope is a member of M, then no effect under an authority epoch below e is committed anywhere after the last member's acknowledgement.</t>
        <t>Sketch. By A1 and P1's argument, each member commits no such effect after its own fence. By A2 there is no other place where one could be committed.</t>
        <t>Neither assumption is established by SACE. A1 is supported, not proven, by attestation (<xref target="attestation"/>) and by the accountability of P2. A2 is a statement about the deployment: the manifest is the authority root's signed assertion of it, and the rules of <xref target="manifest"/> make a compliant unlisted sink refuse, but a non-compliant unlisted system is invisible to every object defined here.</t>
      </section>
      <section anchor="prop-non">
        <name>What Is Not Guaranteed</name>
        <ul>
          <li>Liveness. No bound exists on the time to reach CLOSED. Under a partition that isolates one member, CLOSED is unreachable until the partition heals or a new manifest removes the member. This is a deliberate choice of safety over availability.</li>
          <li>Prevention. A dishonest sink can commit a stale effect. SACE makes that provable if the effect is receipted.</li>
          <li>Unreceipted effects. A sink that commits without signing a receipt leaves no proof. Detection then depends on parties that observe the effect requiring a receipt for it.</li>
          <li>Reversal. Effects at or below a watermark stand.</li>
        </ul>
      </section>
    </section>

    <section anchor="checkpoint">
      <name>Checkpoints and Retention</name>
      <t>Effect Receipts accumulate without bound. A Checkpoint lets a sink commit to its history up to a sequence number so that evidence stores can discard older receipts without losing the ability to detect a fork. Checkpoints are <bcp14>OPTIONAL</bcp14>. Its "typ" is "application/sace-checkpoint+cose". It is signed by the sink key.</t>
      <table anchor="tab-checkpoint">
        <name>Checkpoint Payload</name>
        <thead>
          <tr><th>Key</th><th>Name</th><th>Type</th><th>Rule</th></tr>
        </thead>
        <tbody>
          <tr><td>1</td><td>scope_id</td><td>bstr</td><td>As in the manifest.</td></tr>
          <tr><td>2</td><td>sink_id</td><td>tstr</td><td>As in the manifest.</td></tr>
          <tr><td>3</td><td>seq</td><td>uint</td><td>The sequence number the checkpoint covers up to and including.</td></tr>
          <tr><td>4</td><td>chain_head</td><td>bstr</td><td>Digest of the ER with that seq.</td></tr>
          <tr><td>5</td><td>floor</td><td>uint</td><td>The sink's floor when the checkpoint was signed.</td></tr>
          <tr><td>6</td><td>counts</td><td>map</td><td>For each authority epoch that appears in receipts 1..seq, the number of such receipts.</td></tr>
        </tbody>
      </table>
      <t>An evidence store <bcp14>MAY</bcp14> discard the bytes of an ER from a sink once all of the following hold:</t>
      <ol>
        <li>The store holds a valid Checkpoint from that sink with seq at or above the ER's seq, and has verified the receipt chain from seq 1, or from the previous retained Checkpoint, up to the Checkpoint's chain_head.</li>
        <li>Every SEA held from that sink has been compared with every ER to be discarded, no comparison yields a stale-commit proof, and a valid verdict record (<xref target="verdict-record"/>) covering that sink is retained.</li>
        <li>The store retains the pair (seq, digest) for the ER.</li>
      </ol>
      <t>Condition 2 preserves stale-commit detection: an ER can convict a sink only against an SEA whose watermark is below its seq, and those comparisons have been made. Condition 3 preserves fork detection: a conflicting ER presented later for the same seq has a different digest. The "counts" map preserves the non-vacuity witness after the receipts that supplied it are gone: a non-zero count for an epoch below e in a Checkpoint with seq at or below the member's watermark is an acceptable witness.</t>
      <t>A Checkpoint makes a sequence commitment, so a Checkpoint that disagrees with a receipt, an SEA, or another Checkpoint about the digest at some seq is a forked-chain proof (type 3). After discarding, the retained (seq, digest) pairs keep this detectable: a conflicting ER presented later is checked against them.</t>
      <t>A Checkpoint is not an acknowledgement. It never makes a member ACKED, whatever floor it reports (<xref target="silent"/>).</t>
      <t>A sink <bcp14>MUST NOT</bcp14> discard its own receipts or acknowledgements on the strength of a Checkpoint. Checkpoints permit pruning by evidence stores, not by the party the evidence is about.</t>
    </section>

    <section anchor="attestation">
      <name>Attestation Binding</name>
      <t>An SEA says that a key signed a promise. Attestation says what software held that key. This section is <bcp14>OPTIONAL</bcp14> unless the manifest sets att_profile.</t>
      <t>When present, the "attestation" field of an SEA is an Entity Attestation Token <xref target="RFC9711"/> in CWT form, used as Evidence or as an Attestation Result in the sense of <xref target="RFC9334"/>. The following rules bind it to the acknowledgement:</t>
      <ul>
        <li>The "eat_nonce" claim <bcp14>MUST</bcp14> equal SHA-256 of the concatenation of the cut digest and the sink's key thumbprint. This ties the evidence to this cut and this key, and prevents replay of earlier evidence.</li>
        <li>The token <bcp14>MUST</bcp14> contain a "cnf" claim <xref target="RFC8747"/> holding the public key that signs the SEA. A verifier <bcp14>MUST</bcp14> check that it matches the manifest thumbprint.</li>
        <li>The token's measurement claims <bcp14>MUST</bcp14> cover the code that implements floor storage, admission, and receipt signing.</li>
        <li>The "eat_profile" claim <bcp14>MUST</bcp14> equal the manifest's att_profile.</li>
      </ul>
      <t>An Evaluator appraises the token under a policy for the profile that names the attester keys it accepts and the reference values for the measurement claims. The token passes only if it is signed by an accepted attester key, its "eat_nonce" and "cnf" claims match as above, and every measurement claim the profile defines equals a reference value. Any other outcome, including a missing token, an unknown profile, or a policy the Evaluator does not hold, leaves the member UNACKED. It never makes the member VIOLATED: a failed appraisal shows that the evidence is insufficient, not that the sink broke a promise.</t>
      <t>This document does not define a concrete profile. A profile document specifies the measurement claims, their encoding, and how attester keys are endorsed. The test vectors in <xref target="vectors"/> use a test-only profile, "urn:example:sace-sim-attester:1", with a software attester key and a single 32-byte measurement claim under the private-use claim key -75000. It demonstrates the binding rules above and has no security value.</t>
      <t>Where a sink is an agent runtime built on a layered device identity, in which a device secret is extended through each boot stage and the model weights and runtime configuration are measured before any key is released, a profile <bcp14>SHOULD</bcp14> require the model digest and the configuration digest among the measured components. An acknowledgement is then tied to one exact model and configuration, and stops verifying when either changes.</t>
      <t>The limit of this section is as follows. Attestation appraises the signer's software state at signing time. It does not show that the software is correct, that it enforces the floor, or that it stays in that state afterwards. A member with valid attestation that later produces a stale-commit proof is VIOLATED like any other.</t>
    </section>

    <section anchor="afr">
      <name>Use with Attested Fence Receipts</name>
      <t><xref target="I-D.watts-rats-attested-fence-receipt"/> defines an EAT profile in which a sink's Attesting Environment reports, among other claims, the sink-local sequence number at which the fence took effect and the highest sequence number of any effect committed under the previous epoch. Those two claims carry the same information as the SACE watermark.</t>
      <t>A deployment can combine the documents in either of two ways:</t>
      <ul>
        <li>Nested: the manifest sets att_profile to the fence-receipt profile, and the "attestation" field of each SEA carries a fence receipt for the same cut. An Evaluator <bcp14>MUST</bcp14> then treat a member as UNACKED unless the fence receipt verifies under that document's procedure and its fence sequence claim is consistent with the SEA watermark. An inconsistency between the two, both produced by the same sink, is evidence against the sink and <bcp14>SHOULD</bcp14> be retained.</li>
        <li>Side by side: fence receipts are evaluated under their own document and SEAs under this one. The two verdicts are reported separately. A relying party that requires both <bcp14>MUST NOT</bcp14> treat one as a substitute for the other.</li>
      </ul>
      <t>The division of labour is as follows. The fence receipt carries hardware-rooted evidence of the sink's enforcement state at one moment. SACE carries the signed membership list, the per-effect record after that moment, and the two-signature proof when the record contradicts the acknowledgement. The exact claim-by-claim mapping, including whether the fence sequence number equals the watermark or the watermark plus one, is left to a profile document, because it depends on the numbering convention of the fence-receipt profile.</t>
    </section>

    <section anchor="agreement">
      <name>Cross-Implementation Agreement</name>
      <t>A verdict that depends on which library computed it is not evidence. Two Evaluators written independently, in different programming languages, given the same input objects, <bcp14>MUST</bcp14> produce the same verdict digest.</t>
      <t>The verdict digest is SHA-256 over the deterministic CBOR encoding of:</t>
      <sourcecode type="cddl"><![CDATA[
verdict-input = [
  manifest_digest : bstr,
  cut_digest      : bstr,
  verdict         : 0 / 1 / 2,   ; UNKNOWN / CLOSED / VIOLATED
  members         : [ + [ sink_id   : tstr,
                          status    : 0 / 1 / 2,
                                      ; UNACKED / ACKED / VIOLATED
                          watermark : uint / null ] ]
                    ; sorted by sink_id
]
]]></sourcecode>
      <t>Conformance requirements:</t>
      <ul>
        <li>An implementation <bcp14>MUST</bcp14> reject, not repair, any input that is not deterministically encoded. Lenient parsing is a common way for two implementations to come to disagree.</li>
        <li>An implementation <bcp14>MUST</bcp14> derive every verification result itself. It <bcp14>MUST NOT</bcp14> accept a field in which the sender asserts that a signature or attestation was already checked.</li>
        <li>A conformance corpus <bcp14>MUST</bcp14> include negative vectors for each rejection rule and for each of the three violation types, and each vector <bcp14>MUST</bcp14> state the expected verdict digest.</li>
      </ul>
      <t>The verdict digest identifies the outcome: who is convicted, who is acknowledged, at which watermark. It does not identify the evidence. Two evaluations that convict the same member on different proofs, or over different but equivalent sets of objects, produce the same digest. This is intended, because Evaluators holding different copies of the same evidence should agree. Proofs are compared separately, by verifying them.</t>
      <t>Matching digests show that two Evaluators compute the same function. They show nothing about whether the sinks told the truth. Agreement is a precondition for trusting a verdict, not a reason to trust it.</t>
    </section>

    <section anchor="database">
      <name>Implementation Guidance for Database-Backed Sinks</name>
      <t>Most sinks are, or sit in front of, a transactional database. This section shows how the three invariants of <xref target="states"/> map onto ordinary database features. It is guidance; the normative requirements are in Sections <xref target="states" format="counter"/> to <xref target="effect" format="counter"/>.</t>
      <section anchor="db-schema">
        <name>Schema</name>
        <t>Three tables hold the SACE state. They live in the same database as the application data they protect, so that one transaction can cover both.</t>
        <sourcecode type="sql"><![CDATA[
CREATE TABLE sace_state (
  scope_id  BLOB PRIMARY KEY,
  sink_id   TEXT NOT NULL,
  manifest  BLOB NOT NULL,     -- digest of the current manifest
  floor     INTEGER NOT NULL,  -- lowest admissible authority epoch
  seq       INTEGER NOT NULL,  -- last assigned sequence number
  head      BLOB NOT NULL      -- digest of the receipt with that seq
);

CREATE TABLE sace_ack (
  scope_id      BLOB NOT NULL,
  applied_epoch INTEGER NOT NULL,
  cut           BLOB NOT NULL,
  watermark     INTEGER NOT NULL,
  raw           BLOB NOT NULL, -- exact signed bytes
  PRIMARY KEY (scope_id, applied_epoch)
);

CREATE TABLE sace_effect (
  scope_id        BLOB NOT NULL,
  seq             INTEGER NOT NULL,
  authority_epoch INTEGER NOT NULL,
  effect          BLOB NOT NULL,
  raw             BLOB NOT NULL,
  PRIMARY KEY (scope_id, seq)
);
]]></sourcecode>
        <t>The primary key on sace_effect enforces I2: a second receipt with the same seq cannot be stored. The primary key on sace_ack enforces one acknowledgement per floor value.</t>
      </section>
      <section anchor="db-effect">
        <name>Committing an Effect</name>
        <t>Admission, the application write, the receipt, and the counter update are one transaction. The state row is read with a write lock so that no cut can be applied between the admission check and the commit.</t>
        <sourcecode type="sql"><![CDATA[
BEGIN;  -- with a write lock on sace_state; see below
SELECT floor, seq, head FROM sace_state
 WHERE scope_id = :scope FOR UPDATE;
-- refuse here if :authority_epoch < floor (reason: floor)
-- refuse here if :audience <> this sink   (reason: audience)
-- application write(s) for the effect
INSERT INTO sace_effect
  (scope_id, seq, authority_epoch, effect, raw)
VALUES
  (:scope, :seq_plus_1, :authority_epoch, :effect_digest, :er);
UPDATE sace_state SET seq = :seq_plus_1, head = :er_digest
 WHERE scope_id = :scope;
COMMIT;
]]></sourcecode>
        <t>The receipt is signed inside the transaction, after seq and head are known and before COMMIT. If signing fails, the transaction is rolled back and no effect is committed.</t>
      </section>
      <section anchor="db-cut">
        <name>Applying a Cut</name>
        <sourcecode type="sql"><![CDATA[
BEGIN;
SELECT manifest, floor, seq, head FROM sace_state
 WHERE scope_id = :scope FOR UPDATE;
-- if :epoch <= floor:
--   read sace_ack for floor, COMMIT, return its raw
UPDATE sace_state SET floor = :epoch WHERE scope_id = :scope;
INSERT INTO sace_ack
  (scope_id, applied_epoch, cut, watermark, raw)
VALUES
  (:scope, :epoch, :cut_digest, :seq, :sea);
COMMIT;
]]></sourcecode>
        <t>The watermark written into the SEA is the seq value read under the same lock. This is I3.</t>
      </section>
      <section anchor="db-isolation">
        <name>Isolation and Durability</name>
        <ul>
          <li>The row lock on sace_state serializes effect commits and cut application for a scope. A database without row locks can use a single writer per scope, or serializable isolation with retry. Snapshot isolation without the lock is not sufficient: two transactions could each read the same seq, or an effect could be admitted against a floor that a concurrent cut has already raised.</li>
          <li>The recipes above use "FOR UPDATE" as found in most relational databases. An embedded database with a single writer, such as SQLite, obtains the same effect by starting the transaction in its immediate (write-locking) mode.</li>
          <li>The lock makes each scope a single-writer sequence. Throughput for one scope at one sink is therefore bounded by the commit rate of that row. Deployments needing more can partition a workload into several scopes, each with its own counter.</li>
          <li>An acknowledgement <bcp14>MUST NOT</bcp14> leave the sink before its transaction is durable. With asynchronous commit, a crash could lose the floor raise after the SEA was sent, which produces a stale-commit proof against an otherwise correct sink.</li>
          <li>Replicas: a read replica <bcp14>MUST NOT</bcp14> admit requests. In a failover, the new primary <bcp14>MUST</bcp14> have applied every transaction for which an SEA was released, or enter HALTED. Synchronous replication of the sace_ tables satisfies this.</li>
          <li>Queues and deferred work: a request that is admitted now and executed later is checked against the floor at execution time, inside the commit transaction, not at enqueue time.</li>
        </ul>
      </section>
      <section anchor="db-rollback">
        <name>Rollback Resistance</name>
        <t>A restore from backup returns the floor to an earlier value. Three techniques, in increasing strength, keep a restored sink from admitting revoked authority:</t>
        <ol>
          <li>Procedure: after any restore the sink starts in HALTED and obtains the latest Cut Statement before admitting.</li>
          <li>External high-water mark: the sink records each floor in a second system that is not part of the backup set, and compares on start.</li>
          <li>Hardware counter: the floor is bound to a monotonic counter in a secure element or trusted execution environment, as in <xref target="I-D.watts-rats-attested-fence-receipt"/>.</li>
        </ol>
      </section>
    </section>

    <section anchor="store">
      <name>Evidence Store and Analysis</name>
      <t>An Evaluator that follows many scopes and sinks needs to keep the objects it receives and to ask questions of them. This section describes an evidence store and the analysis queries that correspond to the rules of <xref target="evaluation"/>. A query result is a lead, not a verdict: every finding is confirmed by running the evaluation algorithm over the signed objects the query points to.</t>
      <section anchor="store-rules">
        <name>Store Rules</name>
        <ul>
          <li>Append-only. Objects are never updated. Deletion happens only under <xref target="checkpoint"/>.</li>
          <li>Verify before indexing. An object is parsed strictly and its signature checked against the manifest-listed key before any of its fields are written to an index table. Fields from unverified objects are never queryable.</li>
          <li>Keep the bytes. The index tables are derived data. The signed bytes are the evidence, addressed by their digest.</li>
          <li>Record receipt time separately. The time an object arrived is useful for latency analysis and is never an input to a verdict.</li>
        </ul>
        <sourcecode type="sql"><![CDATA[
CREATE TABLE ev_object (
  digest      BLOB PRIMARY KEY,
  typ         TEXT NOT NULL,
  scope_id    BLOB NOT NULL,
  sink_id     TEXT,
  raw         BLOB NOT NULL,
  received_at INTEGER NOT NULL
);
CREATE TABLE ev_ack (
  digest BLOB PRIMARY KEY REFERENCES ev_object(digest),
  scope_id BLOB, manifest BLOB, sink_id TEXT, cut BLOB,
  applied_epoch INTEGER, prev_epoch INTEGER,
  watermark INTEGER, chain_head BLOB
);
CREATE TABLE ev_effect (
  digest BLOB PRIMARY KEY REFERENCES ev_object(digest),
  scope_id BLOB, sink_id TEXT, seq INTEGER,
  authority_epoch INTEGER, effect BLOB, prev BLOB
);
CREATE TABLE manifest_member (
  manifest BLOB, sink_id TEXT, thumbprint BLOB, class TEXT,
  PRIMARY KEY (manifest, sink_id)
);
CREATE INDEX ev_effect_ix ON ev_effect (scope_id, sink_id, seq);
CREATE INDEX ev_ack_ix ON ev_ack (scope_id, sink_id, applied_epoch);
]]></sourcecode>
      </section>
      <section anchor="store-queries">
        <name>Analysis Queries</name>
        <t>Stale commits: every pair of an acknowledgement and a later receipt under a revoked epoch.</t>
        <sourcecode type="sql"><![CDATA[
SELECT a.sink_id, a.digest AS sea, e.digest AS er
  FROM ev_ack a JOIN ev_effect e
    ON e.scope_id = a.scope_id AND e.sink_id = a.sink_id
 WHERE e.authority_epoch < a.applied_epoch
   AND e.seq > a.watermark;
]]></sourcecode>
        <t>Equivocation and forked chains: two different objects where one is allowed.</t>
        <sourcecode type="sql"><![CDATA[
SELECT a.sink_id, a.digest, b.digest
  FROM ev_ack a JOIN ev_ack b
    ON a.scope_id = b.scope_id AND a.sink_id = b.sink_id
   AND a.cut = b.cut
 WHERE a.digest < b.digest;

SELECT a.sink_id, a.digest, b.digest
  FROM ev_effect a JOIN ev_effect b
    ON a.scope_id = b.scope_id AND a.sink_id = b.sink_id
   AND a.seq = b.seq
 WHERE a.digest < b.digest;
]]></sourcecode>
        <t>Members that have not acknowledged a cut to epoch e. The member list comes from the manifest.</t>
        <sourcecode type="sql"><![CDATA[
SELECT m.sink_id FROM manifest_member m
 WHERE m.manifest = :manifest
   AND NOT EXISTS (SELECT 1 FROM ev_ack a
        WHERE a.scope_id = :scope AND a.manifest = :manifest
          AND a.sink_id = m.sink_id AND a.applied_epoch >= :e);
]]></sourcecode>
        <t>Withheld receipts: gaps in a sink's sequence, and receipts whose "prev" does not match the stored predecessor.</t>
        <sourcecode type="sql"><![CDATA[
SELECT sink_id, seq + 1 AS missing_from FROM ev_effect e
 WHERE scope_id = :scope
   AND seq < (SELECT MAX(seq) FROM ev_effect
               WHERE scope_id = e.scope_id AND sink_id = e.sink_id)
   AND NOT EXISTS (SELECT 1 FROM ev_effect n
        WHERE n.scope_id = e.scope_id AND n.sink_id = e.sink_id
          AND n.seq = e.seq + 1);

SELECT e.sink_id, e.seq FROM ev_effect e JOIN ev_effect p
    ON p.scope_id = e.scope_id AND p.sink_id = e.sink_id
   AND p.seq = e.seq - 1
 WHERE e.prev <> p.digest;
]]></sourcecode>
        <t>A gap is not a violation proof. It shows that the store is missing a receipt, which may be the sink's doing or the transport's. A gap that persists after the sink has been asked for the missing sequence numbers is a reason to treat the sink's receipts as incomplete.</t>
      </section>
      <section anchor="store-metrics">
        <name>Operational Measures</name>
        <t>The following measures are derived from the store. They describe a deployment; none of them is an input to a verdict.</t>
        <table anchor="tab-metrics">
          <name>Measures</name>
          <thead>
            <tr><th>Measure</th><th>Definition</th><th>Use</th></tr>
          </thead>
          <tbody>
            <tr><td>Acknowledgement coverage</td><td>Members with a satisfying SEA, divided by members in the manifest.</td><td>Progress of a closure round. Below 1 the verdict cannot be CLOSED.</td></tr>
            <tr><td>Acknowledgement latency</td><td>For each member, received_at of its SEA minus received_at of the cut.</td><td>Sizing a closure budget. Uses store clocks only.</td></tr>
            <tr><td>Exposure window count</td><td>For each member, the number of receipts under an epoch below e with seq at or below its watermark and received after the cut.</td><td>How much revoked authority was exercised between the AR's cut and the sink's fence. These effects are permitted and stand.</td></tr>
            <tr><td>Receipt completeness</td><td>Receipts held for a sink divided by its highest seen seq.</td><td>Detecting withheld receipts.</td></tr>
            <tr><td>Refusal breakdown</td><td>Counts of refusals at each sink by reason: floor, audience, expired, not enrolled.</td><td>Separating revocation effects from clock and configuration effects. Reported by sinks; not signed evidence.</td></tr>
          </tbody>
        </table>
        <t>The exposure window count is the quantity that revocation latency actually costs. It can be read directly from signed objects, which is not true of a timeout-based estimate.</t>
      </section>
    </section>

    <section anchor="operations">
      <name>Operational Management</name>
      <dl newline="true" spacing="normal">
        <dt>Backup and restore:</dt>
        <dd>Back up the sace_ tables together with the application data, in one consistent snapshot. After a restore, the sink is HALTED (<xref target="states"/>). It fetches the latest Cut Statement, applies it, and resumes. Effects committed between the backup and the failure are lost from the sink but their receipts may exist elsewhere; the restored sink <bcp14>MUST</bcp14> continue its sequence from the highest seq for which any receipt was released, not from the backup's seq, or it will fork its own chain. If that value cannot be established, the sink key is retired and the sink re-enters under a new key and a new manifest.</dd>
        <dt>Sink key rotation:</dt>
        <dd>A new key is a new manifest entry. The AR issues manifest n+1 with the new thumbprint; the sink acknowledges the latest cut under the new key with the watermark it holds. Objects signed by the old key remain valid evidence about the period in which manifest n was current.</dd>
        <dt>AR key rotation:</dt>
        <dd>The new AR key is introduced by a manifest signed by the old key whose successor is signed by the new key. Relying parties that pin the prev_manifest chain follow the change. How relying parties first learn an AR key is out of scope.</dd>
        <dt>Removing a silent sink:</dt>
        <dd>A sink that will not acknowledge blocks CLOSED for its manifest indefinitely. The AR resolves this by issuing a manifest without it and a cut over the new manifest. The verdict record for the old manifest stays UNKNOWN and <bcp14>SHOULD</bcp14> be retained, so that the removal is visible as a change of scope and not as a closure.</dd>
        <dt>Monitoring:</dt>
        <dd>Operators watch acknowledgement coverage per open cut, sequence gaps per sink, and any non-empty result from the stale-commit, equivocation, and fork queries. The last three warrant immediate action; each is one evaluation run away from a transferable proof.</dd>
        <dt>Schema migration:</dt>
        <dd>Changes to the sace_ tables are made without rewriting the "raw" columns. The signed bytes are never re-encoded.</dd>
      </dl>
    </section>

    <section anchor="impl">
      <name>Implementation Status</name>
      <t>This section records the status of known implementations at the time of posting, per <xref target="RFC7942"/>. It is to be removed before publication as an RFC.</t>
      <t>Two implementations exist, both written by the author of this document.</t>
      <section>
        <name>sace_ref (Python)</name>
        <dl newline="false" spacing="normal">
          <dt>Size:</dt><dd>About 670 lines of implementation and 880 lines of tests.</dd>
          <dt>Coverage:</dt><dd>Every object in this document as COSE_Sign1 with EdDSA, with strict deterministic decoding; the evaluation algorithm of <xref target="evaluation"/> including sequence commitments, all forms of the three violation proofs, the Checkpoint witness, and the silent-sink rule; attestation appraisal under the test-only profile of <xref target="attestation"/>; proof verification; signing and verification of Verdict Records; a sink on SQLite following <xref target="database"/>, including Checkpoint signing; an evidence store with the queries of <xref target="store"/> and pruning under the conditions of <xref target="checkpoint"/>.</dd>
          <dt>Not implemented:</dt><dd>A real attestation profile or hardware attester; the attester is a software key. Sink-side rollback resistance beyond the HALTED-after-restore procedure.</dd>
          <dt>Tests:</dt><dd>92 tests pass. Beyond the cases listed in earlier revisions, they cover attestation (accepted, missing, wrong measurement, unknown attester, replayed from another cut, bound to another key, and an attested sink that is still convicted), Checkpoints (witness after receipts are gone, Checkpoint after the watermark not a witness, and conflicts with receipts, SEAs, and other Checkpoints), broken prev links, Verdict Records (round trip, wrong signer, altered statuses, fabricated proofs), pruning (success, incomplete chain, unreported stale commit, later fork against retained digests), the silent-sink rule, and 40 randomized runs in which the VIOLATED status of each member is compared with a ground-truth record of whether that member committed a stale effect.</dd>
          <dt>Concurrency and crashes:</dt><dd>Five operating-system processes write to one sink database while the cut is applied; the test checks a dense, correctly linked chain and that no epoch-7 effect lies above the watermark. The test fails when the write lock of <xref target="db-effect"/> is removed. A second test kills three writers with SIGKILL mid-run and checks that the chain is intact and the sink resumes.</dd>
        </dl>
      </section>
      <section>
        <name>sace-eval (Go)</name>
        <dl newline="false" spacing="normal">
          <dt>Size:</dt><dd>About 520 lines, Go standard library only.</dd>
          <dt>Coverage:</dt><dd>The Evaluator only: its own strict CBOR decoder (shortest-form arguments, sorted unique map keys, no indefinite lengths), COSE_Sign1 verification, attestation appraisal, sequence commitments, the three violation types, the Checkpoint witness, and the verdict digest. It does not produce proofs, only verdicts.</dd>
          <dt>Agreement:</dt><dd>It reproduces the verdict and verdict digest of all 13 vectors in <xref target="vectors"/>. Disabling each of eight checks in turn (stale commit, prev link, SEA chain head, Checkpoint chain head, equivocation, measurement comparison, non-vacuity, Checkpoint witness) changes the result of exactly the vector intended to exercise it. It rejects a manifest with a corrupted signature, and ignores an acknowledgement with a corrupted signature, a non-shortest length encoding, or a key that does not match the manifest.</dd>
        </dl>
      </section>
      <section>
        <name>Limits of This Evidence</name>
        <t>Both implementations have the same author and were written against the same text, so they share any misreading of it. Their agreement is evidence that the text is precise enough to implement twice, not the independent agreement that <xref target="agreement"/> asks for. All tests ran on one host. The partition is simulated by not delivering a cut, and the dishonest sink is the honest code with its admission check disabled. The conditions for an independent run in <xref target="validation"/> are not yet met.</t>
      </section>
    </section>

    <section anchor="analysis">
      <name>Evidence Analysis</name>
      <t>Each object supports a narrow statement. Reading more into an object than the table below allows is the most likely way to misuse this document.</t>
      <table anchor="tab-evidence">
        <name>What Each Object Shows</name>
        <thead>
          <tr><th>Object</th><th>Signed by</th><th>Shows</th><th>Does not show</th></tr>
        </thead>
        <tbody>
          <tr><td>Scope Manifest</td><td>AR</td><td>Which sinks and keys the AR asserts are the complete set for the scope.</td><td>That the set is in fact complete.</td></tr>
          <tr><td>Cut Statement</td><td>AR</td><td>That the AR ordered the floor raised to e.</td><td>That any sink received or applied it.</td></tr>
          <tr><td>SEA</td><td>Sink</td><td>That the holder of the sink key states its floor is a and its counter stood at w.</td><td>That the sink enforces the floor.</td></tr>
          <tr><td>SEA with attestation</td><td>Sink and its attester</td><td>Additionally, the measured software that held the key at signing.</td><td>That the software is correct or unchanged since.</td></tr>
          <tr><td>Effect Receipt</td><td>Sink</td><td>That the sink states it committed effect number seq under a given epoch.</td><td>That no other effect was committed.</td></tr>
          <tr><td>Violation proof</td><td>Sink, twice</td><td>That the key holder made two statements that cannot both be true of an honest sink.</td><td>Whether the cause was malice, a bug, a rollback, or key theft.</td></tr>
          <tr><td>Verdict record</td><td>Evaluator</td><td>The result of the algorithm over a stated set of objects.</td><td>Anything about objects the Evaluator did not hold.</td></tr>
        </tbody>
      </table>
      <t>The following table places the acknowledgement defined here beside the nearest existing mechanisms, as this document reads them. It compares only the property at issue: evidence that a specific enforcement point stopped. The rows refer, in order, to <xref target="RFC7009"/>, <xref target="CAEP"/>, <xref target="I-D.noa-scitt-ai-agent-receipt"/>, <xref target="I-D.watts-rats-attested-fence-receipt"/>, and this document.</t>
      <table anchor="tab-compare">
        <name>Comparison of Revocation Evidence</name>
        <thead>
          <tr><th>Mechanism</th><th>Statement signed or returned by</th><th>Says the enforcement point applied the revocation</th><th>Later breach provable from signatures</th></tr>
        </thead>
        <tbody>
          <tr><td>Revocation endpoint response</td><td>Authorization server</td><td>No; the request was processed by the server.</td><td>No</td></tr>
          <tr><td>Session-revoked event with delivery acknowledgement</td><td>Transmitter; receiver acknowledges delivery</td><td>No; delivery only.</td><td>No</td></tr>
          <tr><td>Per-action receipt</td><td>The recording boundary</td><td>Not its purpose; it records individual actions.</td><td>Not by itself; it has no acknowledgement to contradict.</td></tr>
          <tr><td>Attested fence receipt</td><td>Sink's Attesting Environment</td><td>Yes, with hardware-rooted state.</td><td>Within the receipt itself, when its own sequence claims conflict.</td></tr>
          <tr><td>SEA (this document)</td><td>Sink key</td><td>Yes, as a signed claim with a watermark.</td><td>Yes; an SEA and a later ER form the proof.</td></tr>
        </tbody>
      </table>
    </section>

    <section anchor="security">
      <name>Security Considerations</name>
      <t>SACE gives accountability for what sinks sign. It does not give prevention, and it does not see what sinks decline to sign.</t>
      <dl newline="true" spacing="normal">
        <dt>Sink acknowledges, then commits stale effects and receipts them:</dt>
        <dd>A stale-commit proof results (<xref target="proofs"/>). Detection is after the fact; irreversible effects stay done.</dd>
        <dt>Sink acknowledges, then commits stale effects without receipts:</dt>
        <dd>SACE does not detect this directly. Downstream systems <bcp14>SHOULD</bcp14> refuse effects that arrive without a receipt, and receipts <bcp14>SHOULD</bcp14> be registered in a Transparency Service so that gaps in seq are visible.</dd>
        <dt>Sink never acknowledges:</dt>
        <dd>The verdict stays UNKNOWN. One silent sink blocks CLOSED; this is intended. Removing the sink requires a new manifest.</dd>
        <dt>Sink outside the manifest holds live authority:</dt>
        <dd>Grants name a listed audience and unlisted sinks refuse (<xref target="manifest"/>). A sink that ignores both rules is outside SACE's reach, and CLOSED never covers it.</dd>
        <dt>Compromised sink key:</dt>
        <dd>An attacker can sign a false SEA. Recovery is by a new manifest. Attestation with key binding narrows the exposure to compromise of the measured environment.</dd>
        <dt>Compromised AR key:</dt>
        <dd>An attacker can issue cuts and manifests. Because cuts only raise floors, forged cuts cause denial of service rather than restored authority. Forged manifests can shrink the scope; relying parties <bcp14>SHOULD</bcp14> pin the prev_manifest chain.</dd>
        <dt>Replayed or reordered cuts:</dt>
        <dd>The floor is monotonic and repeats return stored bytes (<xref target="cut"/>).</dd>
        <dt>State rollback at a sink:</dt>
        <dd>Rollback produces a stale-commit proof against the sink. Rollback-resistant floor storage is required (<xref target="proofs"/>).</dd>
        <dt>Clock skew:</dt>
        <dd>Clocks have no effect on verdicts. Grant expiry still depends on clocks; implementations <bcp14>MUST</bcp14> report expiry rejections separately from floor rejections.</dd>
        <dt>Colluding sink and Evaluator:</dt>
        <dd>The evidence is public and any other Evaluator can recompute the verdict. This holds only as far as the objects remain available.</dd>
      </dl>
      <t>Closure is prospective. Effects with seq at or below w were committed under authority that was valid at the time. SACE identifies them; it does not reverse them.</t>
      <t>A CLOSED verdict means that every listed sink has signed that it stopped, and that no signed evidence contradicts any of them. It does not mean that the sinks stopped.</t>
      <section anchor="privacy">
        <name>Privacy Considerations</name>
        <t>Effect Receipts carry digests, not effect contents. Sequence numbers and sink identifiers still reveal activity volume per sink. Deployments that publish receipts need to consider whether that volume is sensitive.</t>
      </section>
    </section>

    <section anchor="iana">
      <name>IANA Considerations</name>
      <t>IANA is requested to register six media types in the "Media Types" registry. The template below is for the first; the other five are identical except for the subtype name and the object named under "Applications that use this media type".</t>
      <dl newline="false" spacing="compact">
        <dt>Type name:</dt><dd>application</dd>
        <dt>Subtype name:</dt><dd>sace-manifest+cose</dd>
        <dt>Required parameters:</dt><dd>N/A</dd>
        <dt>Optional parameters:</dt><dd>N/A</dd>
        <dt>Encoding considerations:</dt><dd>binary (CBOR)</dd>
        <dt>Security considerations:</dt><dd><xref target="security"/> of this document</dd>
        <dt>Interoperability considerations:</dt><dd>Payloads use deterministic CBOR encoding; see <xref target="terms"/>.</dd>
        <dt>Published specification:</dt><dd>This document</dd>
        <dt>Applications that use this media type:</dt><dd>Revocation closure evaluation; carries a Scope Manifest.</dd>
        <dt>Fragment identifier considerations:</dt><dd>N/A</dd>
        <dt>Person to contact for further information:</dt><dd>See the Author's Address section.</dd>
        <dt>Intended usage:</dt><dd>COMMON</dd>
        <dt>Restrictions on usage:</dt><dd>None</dd>
        <dt>Change controller:</dt><dd>IETF</dd>
      </dl>
      <table anchor="tab-iana">
        <name>Media Types</name>
        <thead>
          <tr><th>Media type</th><th>Object</th></tr>
        </thead>
        <tbody>
          <tr><td>application/sace-manifest+cose</td><td>Scope Manifest</td></tr>
          <tr><td>application/sace-cut+cose</td><td>Cut Statement</td></tr>
          <tr><td>application/sace-ack+cose</td><td>Sink Epoch Acknowledgement</td></tr>
          <tr><td>application/sace-effect+cose</td><td>Effect Receipt</td></tr>
          <tr><td>application/sace-verdict+cose</td><td>Verdict record</td></tr>
          <tr><td>application/sace-checkpoint+cose</td><td>Checkpoint</td></tr>
        </tbody>
      </table>
      <t>Payload map keys are scoped to each object type and need no registry. An EAT profile identifier for <xref target="attestation"/> would be registered by a document defining a concrete profile, not by this one.</t>
    </section>

  </middle>

  <back>
    <references>
      <name>References</name>
      <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 initials="S." surname="Bradner" fullname="S. Bradner"/>
            <date year="1997" month="March"/></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 initials="B." surname="Leiba" fullname="B. Leiba"/>
            <date year="2017" month="May"/></front>
          <seriesInfo name="BCP" value="14"/><seriesInfo name="RFC" value="8174"/><seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
        <reference anchor="RFC8610" target="https://www.rfc-editor.org/info/rfc8610">
          <front><title>Concise Data Definition Language (CDDL): A Notational Convention to Express Concise Binary Object Representation (CBOR) and JSON Data Structures</title>
            <author initials="H." surname="Birkholz" fullname="H. Birkholz"/>
            <author initials="C." surname="Vigano" fullname="C. Vigano"/>
            <author initials="C." surname="Bormann" fullname="C. Bormann"/>
            <date year="2019" month="June"/></front>
          <seriesInfo name="RFC" value="8610"/><seriesInfo name="DOI" value="10.17487/RFC8610"/>
        </reference>
        <reference anchor="RFC8747" target="https://www.rfc-editor.org/info/rfc8747">
          <front><title>Proof-of-Possession Key Semantics for CBOR Web Tokens (CWTs)</title>
            <author initials="M." surname="Jones" fullname="M. Jones"/>
            <author initials="L." surname="Seitz" fullname="L. Seitz"/>
            <author initials="G." surname="Selander" fullname="G. Selander"/>
            <author initials="S." surname="Erdtman" fullname="S. Erdtman"/>
            <author initials="H." surname="Tschofenig" fullname="H. Tschofenig"/>
            <date year="2020" month="March"/></front>
          <seriesInfo name="RFC" value="8747"/><seriesInfo name="DOI" value="10.17487/RFC8747"/>
        </reference>
        <reference anchor="RFC8949" target="https://www.rfc-editor.org/info/rfc8949">
          <front><title>Concise Binary Object Representation (CBOR)</title>
            <author initials="C." surname="Bormann" fullname="C. Bormann"/>
            <author initials="P." surname="Hoffman" fullname="P. Hoffman"/>
            <date year="2020" month="December"/></front>
          <seriesInfo name="STD" value="94"/><seriesInfo name="RFC" value="8949"/><seriesInfo name="DOI" value="10.17487/RFC8949"/>
        </reference>
        <reference anchor="RFC9052" target="https://www.rfc-editor.org/info/rfc9052">
          <front><title>CBOR Object Signing and Encryption (COSE): Structures and Process</title>
            <author initials="J." surname="Schaad" fullname="J. Schaad"/>
            <date year="2022" month="August"/></front>
          <seriesInfo name="STD" value="96"/><seriesInfo name="RFC" value="9052"/><seriesInfo name="DOI" value="10.17487/RFC9052"/>
        </reference>
        <reference anchor="RFC9596" target="https://www.rfc-editor.org/info/rfc9596">
          <front><title>CBOR Object Signing and Encryption (COSE) "typ" (type) Header Parameter</title>
            <author initials="M." surname="Jones" fullname="M. Jones"/>
            <author initials="O." surname="Steele" fullname="O. Steele"/>
            <date year="2024" month="June"/></front>
          <seriesInfo name="RFC" value="9596"/><seriesInfo name="DOI" value="10.17487/RFC9596"/>
        </reference>
        <reference anchor="RFC9679" target="https://www.rfc-editor.org/info/rfc9679">
          <front><title>CBOR Object Signing and Encryption (COSE) Key Thumbprint</title>
            <author initials="K." surname="Isobe" fullname="K. Isobe"/>
            <author initials="H." surname="Tschofenig" fullname="H. Tschofenig"/>
            <author initials="O." surname="Steele" fullname="O. Steele"/>
            <date year="2024" month="December"/></front>
          <seriesInfo name="RFC" value="9679"/><seriesInfo name="DOI" value="10.17487/RFC9679"/>
        </reference>
        <reference anchor="RFC9711" target="https://www.rfc-editor.org/info/rfc9711">
          <front><title>The Entity Attestation Token (EAT)</title>
            <author initials="L." surname="Lundblade" fullname="L. Lundblade"/>
            <author initials="G." surname="Mandyam" fullname="G. Mandyam"/>
            <author initials="J." surname="O'Donoghue" fullname="J. O'Donoghue"/>
            <author initials="C." surname="Wallace" fullname="C. Wallace"/>
            <date year="2025" month="April"/></front>
          <seriesInfo name="RFC" value="9711"/><seriesInfo name="DOI" value="10.17487/RFC9711"/>
        </reference>
      </references>
      <references>
        <name>Informative References</name>
        <reference anchor="RFC7009" target="https://www.rfc-editor.org/info/rfc7009">
          <front><title>OAuth 2.0 Token Revocation</title>
            <author initials="T." surname="Lodderstedt" fullname="T. Lodderstedt" role="editor"/>
            <author initials="S." surname="Dronia" fullname="S. Dronia"/>
            <author initials="M." surname="Scurtescu" fullname="M. Scurtescu"/>
            <date year="2013" month="August"/></front>
          <seriesInfo name="RFC" value="7009"/><seriesInfo name="DOI" value="10.17487/RFC7009"/>
        </reference>
        <reference anchor="RFC7942" target="https://www.rfc-editor.org/info/rfc7942">
          <front><title>Improving Awareness of Running Code: The Implementation Status Section</title>
            <author initials="Y." surname="Sheffer" fullname="Y. Sheffer"/>
            <author initials="A." surname="Farrel" fullname="A. Farrel"/>
            <date year="2016" month="July"/></front>
          <seriesInfo name="BCP" value="205"/><seriesInfo name="RFC" value="7942"/><seriesInfo name="DOI" value="10.17487/RFC7942"/>
        </reference>
        <reference anchor="RFC9334" target="https://www.rfc-editor.org/info/rfc9334">
          <front><title>Remote ATtestation procedureS (RATS) Architecture</title>
            <author initials="H." surname="Birkholz" fullname="H. Birkholz"/>
            <author initials="D." surname="Thaler" fullname="D. Thaler"/>
            <author initials="M." surname="Richardson" fullname="M. Richardson"/>
            <author initials="N." surname="Smith" fullname="N. Smith"/>
            <author initials="W." surname="Pan" fullname="W. Pan"/>
            <date year="2023" month="January"/></front>
          <seriesInfo name="RFC" value="9334"/><seriesInfo name="DOI" value="10.17487/RFC9334"/>
        </reference>
        <reference anchor="RFC9942" target="https://www.rfc-editor.org/info/rfc9942">
          <front><title>CBOR Object Signing and Encryption (COSE) Receipts</title>
            <author initials="O." surname="Steele" fullname="O. Steele"/>
            <author initials="H." surname="Birkholz" fullname="H. Birkholz"/>
            <author initials="A." surname="Delignat-Lavaud" fullname="A. Delignat-Lavaud"/>
            <author initials="C." surname="Fournet" fullname="C. Fournet"/>
            <date year="2026" month="June"/></front>
          <seriesInfo name="RFC" value="9942"/><seriesInfo name="DOI" value="10.17487/RFC9942"/>
        </reference>
        <reference anchor="RFC9943" target="https://www.rfc-editor.org/info/rfc9943">
          <front><title>An Architecture for Trustworthy and Transparent Digital Supply Chains</title>
            <author initials="H." surname="Birkholz" fullname="H. Birkholz"/>
            <author initials="A." surname="Delignat-Lavaud" fullname="A. Delignat-Lavaud"/>
            <author initials="C." surname="Fournet" fullname="C. Fournet"/>
            <author initials="Y." surname="Deshpande" fullname="Y. Deshpande"/>
            <author initials="S." surname="Lasker" fullname="S. Lasker"/>
            <date year="2026" month="June"/></front>
          <seriesInfo name="RFC" value="9943"/><seriesInfo name="DOI" value="10.17487/RFC9943"/>
        </reference>
        <reference anchor="I-D.watts-oauth-agent-revocation-closure" target="https://datatracker.ietf.org/doc/html/draft-watts-oauth-agent-revocation-closure-02">
          <front><title>Revocation Closure and Authority Epochs for Agent Delegation</title>
            <author initials="D. O." surname="Watts" fullname="Deonté O'dell Watts"/>
            <date year="2026" month="October"/></front>
          <seriesInfo name="Internet-Draft" value="draft-watts-oauth-agent-revocation-closure-02"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.watts-rats-attested-fence-receipt">
          <front><title>Attested Fence Receipts: Hardware-Rooted Evidence of Authority-Epoch Enforcement at Consequential Sinks</title>
            <author initials="D. O." surname="Watts" fullname="Deonté O'dell Watts"/>
            <date year="2026" month="November" day="14"/></front>
          <seriesInfo name="Internet-Draft" value="draft-watts-rats-attested-fence-receipt-00"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.chen-oauth-agent-revocation" target="https://datatracker.ietf.org/doc/html/draft-chen-oauth-agent-revocation-00">
          <front><title>OAuth 2.0 Agent Authorization Explicit Revocation</title>
            <author initials="M." surname="Chen" fullname="M. Chen"/>
            <author initials="L." surname="Su" fullname="L. Su"/>
            <date year="2026" month="April" day="27"/></front>
          <seriesInfo name="Internet-Draft" value="draft-chen-oauth-agent-revocation-00"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.sweeney-wimse-credential-delegation" target="https://datatracker.ietf.org/doc/html/draft-sweeney-wimse-credential-delegation-02">
          <front><title>Credential Delegation Protocol for AI Agents in Multi-System Environments</title>
            <author initials="K." surname="Sweeney" fullname="K. Sweeney"/>
            <date year="2026" month="October"/></front>
          <seriesInfo name="Internet-Draft" value="draft-sweeney-wimse-credential-delegation-02"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.reece-wimse-cross-org-delegation" target="https://datatracker.ietf.org/doc/html/draft-reece-wimse-cross-org-delegation-01">
          <front><title>Cross-Organizational Delegation for Workload and Agent Identity: Problem Statement and Requirements</title>
            <author initials="M." surname="Reece" fullname="M. Reece"/>
            <date year="2026" month="July"/></front>
          <seriesInfo name="Internet-Draft" value="draft-reece-wimse-cross-org-delegation-01"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.noa-scitt-ai-agent-receipt" target="https://datatracker.ietf.org/doc/html/draft-noa-scitt-ai-agent-receipt-01">
          <front><title>A SCITT Profile for AI-Agent Action Receipts</title>
            <author initials="T." surname="Toraman" fullname="T. Toraman"/>
            <date year="2026" month="August" day="15"/></front>
          <seriesInfo name="Internet-Draft" value="draft-noa-scitt-ai-agent-receipt-01"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="CAEP" target="https://openid.net/specs/openid-caep-1_0.html">
          <front><title>OpenID Continuous Access Evaluation Profile 1.0</title>
            <author initials="T." surname="Cappalli" fullname="T. Cappalli"/>
            <author initials="A." surname="Tulshibagwale" fullname="A. Tulshibagwale"/>
            <date year="2025" month="August"/></front>
          <refcontent>OpenID Foundation</refcontent>
        </reference>
        <reference anchor="LEASES">
          <front><title>Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency</title>
            <author initials="C." surname="Gray" fullname="C. Gray"/>
            <author initials="D." surname="Cheriton" fullname="D. Cheriton"/>
            <date year="1989" month="December"/></front>
          <refcontent>Proceedings of the Twelfth ACM Symposium on Operating Systems Principles (SOSP)</refcontent>
        </reference>
        <reference anchor="SNAPSHOTS">
          <front><title>Distributed Snapshots: Determining Global States of Distributed Systems</title>
            <author initials="K. M." surname="Chandy" fullname="K. Mani Chandy"/>
            <author initials="L." surname="Lamport" fullname="Leslie Lamport"/>
            <date year="1985" month="February"/></front>
          <refcontent>ACM Transactions on Computer Systems, Vol. 3, No. 1</refcontent>
        </reference>
        <reference anchor="PEERREVIEW">
          <front><title>PeerReview: Practical Accountability for Distributed Systems</title>
            <author initials="A." surname="Haeberlen" fullname="A. Haeberlen"/>
            <author initials="P." surname="Kouznetsov" fullname="P. Kouznetsov"/>
            <author initials="P." surname="Druschel" fullname="P. Druschel"/>
            <date year="2007" month="October"/></front>
          <refcontent>Proceedings of the 21st ACM Symposium on Operating Systems Principles (SOSP)</refcontent>
        </reference>
      </references>
    </references>

    <section anchor="cddl">
      <name>CDDL</name>
      <t>This appendix gives payload definitions for the five objects in the notation of <xref target="RFC8610"/>. Each payload is carried in a COSE_Sign1.</t>
      <sourcecode type="cddl"><![CDATA[
digest      = bstr .size 32
scope-id    = bstr .size 16
epoch       = uint
sink-id     = tstr

manifest = {
  1 => scope-id,
  2 => uint,                 ; manifest_seq
  3 => digest / null,        ; prev_manifest
  4 => [ + member ],         ; sorted by sink-id
  ? 5 => tstr                ; att_profile
}
member = [ sink-id, digest, tstr ]
         ; id, key thumbprint, class

cut = {
  1 => scope-id,
  2 => digest,               ; manifest
  3 => epoch,                ; new floor
  4 => epoch,                ; prev_epoch
  5 => bstr .size 16,        ; cut_nonce
  6 => uint                  ; issued_at (informational)
}

ack = {
  1 => scope-id,
  2 => digest,               ; manifest
  3 => sink-id,
  4 => digest,               ; cut
  5 => epoch,                ; applied_epoch
  6 => epoch,                ; prev_epoch
  7 => uint,                 ; watermark
  8 => digest,               ; chain_head
  9 => uint,                 ; applied_at (informational)
  ? 10 => bstr               ; attestation (EAT, CWT)
}

effect = {
  1 => scope-id,
  2 => sink-id,
  3 => uint,                 ; seq
  4 => epoch,                ; authority_epoch
  5 => digest,               ; effect
  6 => digest                ; prev
}

verdict-record = {
  1 => digest,               ; manifest
  2 => digest,               ; cut
  3 => 0 / 1 / 2,            ; UNKNOWN / CLOSED / VIOLATED
  4 => [ + [ sink-id, 0 / 1 / 2, uint / null ] ],
  5 => digest,               ; verdict digest
  ? 6 => [ + violation-proof ]
}

violation-proof = [ 1 / 2 / 3, bstr, bstr ]
  ; 1 stale commit: ack, effect
  ; 2 equivocation: ack, ack
  ; 3 forked chain: any two of ack, effect, checkpoint

checkpoint = {
  1 => scope-id,
  2 => sink-id,
  3 => uint,                 ; seq covered
  4 => digest,               ; chain_head at seq
  5 => epoch,                ; floor
  6 => { * epoch => uint }   ; receipt counts by authority epoch
}
]]></sourcecode>
    </section>

    <section anchor="validation">
      <name>Validation Plan</name>
      <t>This appendix describes the experiment that would test this specification, stating first the outcomes that would count against it. The two single-author implementations described in <xref target="impl"/> exercise these arms in simulation; they do not meet the conditions for an independent run listed at the end of this appendix.</t>
      <dl newline="true" spacing="normal">
        <dt>Primary falsifier:</dt>
        <dd>An effect with authority epoch below e commits at a listed sink, with seq above that sink's signed watermark, and an Evaluator reports anything other than VIOLATED. One such run falsifies the evaluation algorithm.</dd>
        <dt>Design falsifier:</dt>
        <dd>An honest sink, following Sections <xref target="states" format="counter"/> to <xref target="effect" format="counter"/> exactly, is reported VIOLATED under any ordering, partition, or clock offset. One such run means that the protocol convicts the innocent and the watermark rule is wrong.</dd>
        <dt>Usefulness falsifier:</dt>
        <dd>Under partition, an arrangement using only AR-side cut commitment reaches the same correct verdicts as SACE. In that case the acknowledgement adds nothing.</dd>
      </dl>
      <table anchor="tab-arms">
        <name>Experiment Arms</name>
        <thead>
          <tr><th>Arm</th><th>Link AR to sink B</th><th>Cut ordering</th><th>Clock at B</th><th>Expected verdict</th></tr>
        </thead>
        <tbody>
          <tr><td>Baseline</td><td>up</td><td>in order</td><td>true</td><td>CLOSED, no stale commits</td></tr>
          <tr><td>Partition</td><td>down</td><td>none delivered</td><td>true</td><td>UNKNOWN</td></tr>
          <tr><td>Repair with reorder</td><td>up</td><td>9 before 8</td><td>true</td><td>CLOSED at 9 and at 8</td></tr>
          <tr><td>Replayed old cut</td><td>up</td><td>7 after 8</td><td>true</td><td>CLOSED, floor unchanged</td></tr>
          <tr><td>Skew only</td><td>up</td><td>in order</td><td>+5 min</td><td>CLOSED; expiry rejections counted separately</td></tr>
          <tr><td>Unlisted descendant</td><td>up</td><td>in order</td><td>true</td><td>Refused by audience rule; verdict unaffected</td></tr>
          <tr><td>Listed descendant, unseen by A</td><td>late</td><td>in order</td><td>true</td><td>UNKNOWN until B acknowledges; then CLOSED</td></tr>
          <tr><td>Dishonest sink</td><td>up</td><td>in order</td><td>true</td><td>VIOLATED with stale-commit proof</td></tr>
          <tr><td>Rolled-back sink</td><td>up</td><td>in order</td><td>true</td><td>VIOLATED, or refusal if rollback-resistant</td></tr>
          <tr><td>Vacuous scope</td><td>up</td><td>in order</td><td>true</td><td>UNKNOWN (non-vacuity fails)</td></tr>
        </tbody>
      </table>
      <t>The following conditions apply to any run reported as a test of this document:</t>
      <ul>
        <li>The descendant in the "listed descendant" arm is pinned at B and signs for B's audience. Otherwise B rejects it for an unrelated reason and the epoch rule is never exercised.</li>
        <li>Outcome columns separate floor denial, missing acknowledgement, and clock expiry.</li>
        <li>The two sinks are written by different implementers, not only in different languages, and run on separately administered hosts. A run that does not meet this is reported as cross-language on one host, not as independent.</li>
        <li>Both Evaluators produce identical verdict digests on every arm.</li>
      </ul>
    </section>
    <section anchor="vectors">
      <name>Test Vectors</name>
      <t>13 vectors accompany this document as a JSON file. Each gives the AR public key, the sink public keys, the full bytes of the manifest, cut, acknowledgements, effect receipts, and Checkpoints in hexadecimal, the attester policy where one applies, and the expected result. Signing keys are derived from fixed test labels and are for testing only. Two sinks, sink-a and sink-b, are listed; each commits one epoch-7 effect before a cut to epoch 8, except where noted.</t>
      <sourcecode type="test-vectors"><![CDATA[
manifest digest, no att_profile (all but two vectors)
  6e57db47d44c041d513e6473e4328588dc92d04c2270de558f9be16538ae8497
cut digest over that manifest (epoch 8, prev_epoch 7)
  40c8147351189afe761875dd5c8adca31e0a8d0c05eab7e20135a47085847c68
manifest digest with att_profile (attested-*, attestation-*)
  3a04fd4cc0477f1508cf88d57daf5f253945c00251d0c16edefa72ad28dbde4f
cut digest over that manifest
  ea22aeca5b7e133c6f66d865ccb591bfb39c1853494b1d64746da2e2380a32bf
]]></sourcecode>
      <table anchor="tab-vectors">
        <name>Expected Results</name>
        <thead>
          <tr><th>Vector</th><th>Members (sink:status/watermark)</th><th>Verdict</th><th>Proof types</th></tr>
        </thead>
        <tbody>
          <tr><td>baseline-closed</td><td>sink-a:1/1 sink-b:1/1</td><td>CLOSED</td><td>-</td></tr>
          <tr><td>partition-unknown</td><td>sink-a:1/1 sink-b:0/-</td><td>UNKNOWN</td><td>-</td></tr>
          <tr><td>stale-commit-violated</td><td>sink-a:1/1 sink-b:2/1</td><td>VIOLATED</td><td>1</td></tr>
          <tr><td>vacuous-unknown</td><td>sink-a:1/0 sink-b:1/0</td><td>UNKNOWN</td><td>-</td></tr>
          <tr><td>attested-closed</td><td>sink-a:1/1 sink-b:1/1</td><td>CLOSED</td><td>-</td></tr>
          <tr><td>attestation-mismatch-unknown</td><td>sink-a:1/1 sink-b:0/1</td><td>UNKNOWN</td><td>-</td></tr>
          <tr><td>checkpoint-witness-closed</td><td>sink-a:1/1 sink-b:1/1</td><td>CLOSED</td><td>-</td></tr>
          <tr><td>equivocation-violated</td><td>sink-a:1/1 sink-b:2/1</td><td>VIOLATED</td><td>2</td></tr>
          <tr><td>forked-chain-violated</td><td>sink-a:1/1 sink-b:2/1</td><td>VIOLATED</td><td>3</td></tr>
          <tr><td>ack-head-fork-violated</td><td>sink-a:1/1 sink-b:2/1</td><td>VIOLATED</td><td>3</td></tr>
          <tr><td>checkpoint-fork-violated</td><td>sink-a:1/1 sink-b:2/1</td><td>VIOLATED</td><td>3</td></tr>
          <tr><td>broken-prev-link-violated</td><td>sink-a:1/1 sink-b:2/1</td><td>VIOLATED</td><td>3</td></tr>
          <tr><td>silent-sink-unknown</td><td>sink-a:1/1 sink-b:0/-</td><td>UNKNOWN</td><td>-</td></tr>
        </tbody>
      </table>
      <t>Expected verdict digests:</t>
      <sourcecode type="test-vectors"><![CDATA[
baseline-closed
  ae4bb0ce0590efcb55fcf0effed92139f9b610bf0c99243e0cd35fbfa5b56199
partition-unknown
  f647d8963f1d868b7bdc037fea06a1cf7530b4f75487a2f04897f2d7a474f100
stale-commit-violated
  09f64b653e191e8d6cff34f11ac5f022b64d1b366e033a97e19915db290cecf2
vacuous-unknown
  baee56483dc6332bb653481c90c0ffa1d2cfe005c3d75873621d5b2c2b72c723
attested-closed
  b3b28e877b38da9ec86a629ef1db9a90a6bbd3d532b9a43010a0b7e8408eb3ac
attestation-mismatch-unknown
  8fc77f708789b841d6923df3098b29d3adf6a538485a44aa40ce31c996dd7e07
checkpoint-witness-closed
  ae4bb0ce0590efcb55fcf0effed92139f9b610bf0c99243e0cd35fbfa5b56199
equivocation-violated
  09f64b653e191e8d6cff34f11ac5f022b64d1b366e033a97e19915db290cecf2
forked-chain-violated
  09f64b653e191e8d6cff34f11ac5f022b64d1b366e033a97e19915db290cecf2
ack-head-fork-violated
  09f64b653e191e8d6cff34f11ac5f022b64d1b366e033a97e19915db290cecf2
checkpoint-fork-violated
  09f64b653e191e8d6cff34f11ac5f022b64d1b366e033a97e19915db290cecf2
broken-prev-link-violated
  09f64b653e191e8d6cff34f11ac5f022b64d1b366e033a97e19915db290cecf2
silent-sink-unknown
  f647d8963f1d868b7bdc037fea06a1cf7530b4f75487a2f04897f2d7a474f100
]]></sourcecode>
      <t>Several vectors are worth reading closely. In vacuous-unknown both members are ACKED and the verdict is UNKNOWN, because no epoch-7 effect exists. In attestation-mismatch-unknown, sink-b's acknowledgement carries a token with the wrong measurement: sink-b is UNACKED, not VIOLATED, and its watermark is still reported. In checkpoint-witness-closed no receipts are supplied and the Checkpoints alone provide the witness. In silent-sink-unknown, sink-a has acknowledged and committed five further effects and signed a Checkpoint, and sink-b has signed nothing; the verdict and its digest are identical to partition-unknown. All five VIOLATED vectors share one verdict digest because they convict the same member (<xref target="agreement"/>).</t>
      <t>These results were produced by the Python implementation and reproduced by the Go implementation described in <xref target="impl"/>.</t>
    </section>

    <section anchor="example">
      <name>Worked Example</name>
      <t>Two sinks, sink-a and sink-b, are listed in manifest 1 of a scope. Both have floor 7. Each has committed one effect under epoch 7, so each has seq = 1.</t>
      <t>Case 1, both acknowledge. The AR signs a cut to epoch 8. Each sink raises its floor to 8 and signs an SEA with applied_epoch = 8, prev_epoch = 7, watermark = 1. An Evaluator holding the manifest, the cut, both SEAs, and the two ERs finds both members ACKED and the non-vacuity witness present (an epoch-7 ER with seq 1 at or below watermark 1). The verdict is CLOSED.</t>
      <t>Case 2, partition. Only sink-a receives the cut. sink-b, still at floor 7, admits a further epoch-7 request and receipts it with seq = 2. The Evaluator finds sink-a ACKED and sink-b UNACKED. The verdict is UNKNOWN. The epoch-7 effect at sink-b is not a violation: sink-b has signed nothing that it contradicts. When the cut reaches sink-b, its SEA carries watermark = 2, and the verdict becomes CLOSED. The watermark records that the second effect fell on the permitted side of sink-b's own line.</t>
      <t>Case 3, breach. Both sinks acknowledge as in case 1, with watermark = 1. sink-b then commits an epoch-7 request and receipts it with seq = 2. The Evaluator finds an SEA from sink-b with applied_epoch 8 and watermark 1, and an ER from sink-b with authority_epoch 7 and seq 2. Since 7 is below 8 and 2 is above 1, sink-b is VIOLATED, and the verdict is VIOLATED. The proof is the array [1, SEA, ER].</t>
      <t>The only difference between the permitted effect in case 2 and the breach in case 3 is the position of seq 2 relative to the watermark that sink-b itself signed.</t>
    </section>

    <section anchor="changes">
      <name>Changes</name>
      <t>This section is to be removed before publication as an RFC.</t>
      <section>
        <name>Since -02</name>
        <ul>
          <li>Generalized the forked-chain rule to sequence commitments, so that broken prev links, false SEA chain heads, and conflicting Checkpoints are all type 3 proofs (<xref target="evaluation"/>, <xref target="proofs"/>).</li>
          <li>Stated the silent-sink rule normatively, with the list of evidence that cannot substitute for an acknowledgement (<xref target="silent"/>).</li>
          <li>Added Checkpoints as a source of the non-vacuity witness, and stated that a Checkpoint is never an acknowledgement.</li>
          <li>Specified attestation appraisal and its outcome: failure makes a member UNACKED, never VIOLATED (<xref target="attestation"/>).</li>
          <li>Added the Verdict Record section with its verification procedure and what that procedure does not establish (<xref target="verdict-record"/>).</li>
          <li>Defined proof verification for a single pair of objects.</li>
          <li>Noted that the verdict digest identifies the outcome, not the evidence.</li>
          <li>Second implementation in Go; 13 vectors; concurrency and crash tests (<xref target="impl"/>, <xref target="vectors"/>).</li>
        </ul>
      </section>
      <section>
        <name>Since -01</name>
        <ul>
          <li>Added implementation guidance for database-backed sinks: schema, transaction recipes, isolation, durability, and rollback resistance (<xref target="database"/>).</li>
          <li>Added the evidence store, its analysis queries, and operational measures (<xref target="store"/>).</li>
          <li>Added operational management: backup and restore, key rotation, removal of a silent sink, monitoring (<xref target="operations"/>).</li>
          <li>Added the optional Checkpoint object and retention rules (<xref target="checkpoint"/>).</li>
          <li>Added an implementation status section and test vectors (<xref target="impl"/>, <xref target="vectors"/>).</li>
        </ul>
      </section>
      <section>
        <name>Since -00</name>
        <ul>
          <li>Positioned the document against the attested fence receipt draft and added <xref target="afr"/> on combined use.</li>
          <li>Added the sink state machine and its three invariants (<xref target="states"/>).</li>
          <li>Added a properties section with five claims, their assumptions, and what is not guaranteed (<xref target="properties"/>).</li>
          <li>Added an evidence analysis and a comparison with neighbouring mechanisms (<xref target="analysis"/>).</li>
          <li>Newly listed sinks now start in HALTED and acknowledge before admitting.</li>
          <li>Added a full media type registration template and a worked example (<xref target="example"/>).</li>
        </ul>
      </section>
    </section>
  </back>
</rfc>
