<?xml version="1.0" encoding="UTF-8"?>
<!-- generated by draft/build.py from draft-chandra-wimse-partition-tolerant-renewal-00.mkd; edit the .mkd, not this file -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-chandra-wimse-partition-tolerant-renewal-00"
     category="exp" submissionType="IETF"
     tocInclude="true" sortRefs="true" symRefs="true" version="3">
<front>
<title abbrev="Partition-Tolerant Authority Renewal">Extend-Only, Threshold-Attested Authority Renewal for Partitioned Agent Meshes</title>
<seriesInfo name="Internet-Draft" value="draft-chandra-wimse-partition-tolerant-renewal-00"/>
<author initials="S." surname="Chandra" fullname="Sharath Chandra">
<organization>Stellarminds.ai</organization>
<address><postal><city>Richmond</city><region>California</region><country>United States of America</country></postal>
<email>sharath@stellarminds.ai</email><uri>https://stellarminds.ai</uri></address>
</author>
<date year="2026" month="November" day="17"/>
<area>Security</area>
<workgroup>Workload Identity in Multi System Environments</workgroup>
<keyword>workload identity</keyword><keyword>WIMSE</keyword><keyword>partition tolerance</keyword><keyword>agent mesh</keyword><keyword>threshold attestation</keyword><keyword>renewal</keyword><keyword>local issuance</keyword>
<abstract><t>Every workload identity architecture in deployment today assumes its credential issuer is reachable: short-lived tokens, fast rotation and timely revocation are guarantees about the connected case. This document specifies what a workload does when that assumption fails, when its credential is nearing or past expiry and its issuer cannot be reached. It defines extend-only, threshold-attested authority renewal. Before any partition, the issuer signs a Mesh Manifest that appoints a bounded set of peers as a limited-authority local issuer: it names the members, fixes a ceiling on total extension, caps the scope any renewal may carry, and sets a validity window. During a partition, a severed workload broadcasts a signed renewal request to those peers; each peer independently verifies that the request extends existing authority without widening it, within the manifest's ceiling, and against its own first-hand observation of the requester's health; each attestation signs the digest of the entire request, so scope, requester, timestamps and predecessor are all under the peer's signature; once a two-thirds threshold of the peers (ceil(2N/3) of N &gt;= 4) has attested, the workload treats its authority as extended through a bounded expiry. Rounds are hash-linked, so a chain's signatures commit to the exact history being extended. The document specifies the manifest, the message formats, the independent-evaluation procedure, the renewal-chain construction for partitions outlasting one round, and the verification procedure a relying party runs given the manifest, the chain and the original credential it already trusts. It also specifies, normatively, what this mechanism does not provide: it is not a consensus protocol, it does not establish that a workload is uncompromised, and a revocation issued during a partition is not enforceable until the partition heals; an implementation MUST NOT represent this mechanism as providing partition-proof revocation.</t></abstract>
</front>
<middle>
<section anchor="sec-introduction"><name>Introduction</name>
<t>Workload identity architectures, including the WIMSE architecture <xref target="WIMSEARCH"/> and its credential formats <xref target="WIMSECREDS"/>, and the SPIFFE/SPIRE framework <xref target="SPIFFE"/> that preceded them, treat short credential lifetimes as a security feature: a stolen token is useful only briefly, provided the workload can reach its issuer for a fresh one before the old one expires. No normative guidance exists for the case where a workload is healthy, mutually authenticated with its peers, and mid-task, but cannot reach its issuer before its credential's stated expiry.</t>
<t>The WIMSE working group charter identifies the shape of an answer: a work item for local issuance of WIMSE tokens where the local issuer operates with limited authority, naming as a candidate local issuer the workload itself or another workload deployed nearby <xref target="WIMSECHARTER"/>. This document specifies a hardening of that idea for the adversarial, disconnected case. No single nearby workload is trusted as a local issuer; a two-thirds threshold of a peer set is, and the peer set is not a local configuration choice but an appointment the issuer itself signed before the partition, in a Mesh Manifest (Section 5). The manifest is what makes the quorum a limited-authority local issuer in the charter's sense rather than a second authority standing beside the first.</t>
<t>This document defines the wire formats and verification procedure for that mechanism: extend-only, threshold-attested authority renewal. It normatively fixes the <tt>MeshManifest</tt> an issuer signs at provisioning time (Section 5), the <tt>RenewalRequest</tt> a severed workload broadcasts (Section 6), the <tt>PeerAttestation</tt> a peer returns after independent evaluation (Section 7), the <tt>RenewalProof</tt> aggregating a quorum of attestations (Section 8), the <tt>RenewalChain</tt> covering a partition of more than one round (Section 9), and the verification procedure a relying party runs against a presented chain (Section 9.2). It normatively states what this mechanism does not defend (Section 11): it introduces no independent root of authority but does add trust assumptions, it is a threshold and not a consensus protocol, health evidence establishes activity and not authorization, and the revocation residual is bounded, not removed.</t>
<t>This document is intended as an Experimental contribution to the WIMSE working group's local-issuance discussion. A reference implementation and a deterministic conformance corpus exist (Appendix A); interoperability between independent implementations has not yet been demonstrated.</t>
</section>
<section anchor="sec-conventions-and-definitions"><name>Conventions and Definitions</name>
<t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they appear in all capitals, as shown here.</t>
<t><strong>Issuer:</strong> The authority that issued the original credential. It takes part in this procedure exactly once, before any partition, by signing the <tt>MeshManifest</tt>; it is unreachable for the remainder by definition.</t>
<t><strong>Requester:</strong> The workload whose credential is nearing or past expiry and whose issuer is unreachable.</t>
<t><strong>Attester (peer):</strong> A member of the mesh, named in the <tt>MeshManifest</tt>, that independently evaluates a renewal request and, if it passes every check in Section 7.2, signs a <tt>PeerAttestation</tt>.</t>
<t><strong>Relying party:</strong> Any party, peer or otherwise, that receives a request from the requester after its nominal expiry and must decide whether to honor it by verifying the <tt>RenewalChain</tt> presented alongside it, under the <tt>MeshManifest</tt>.</t>
<t><strong>Mesh Manifest:</strong> The issuer-signed object naming the members of the mesh and fixing the ceiling, clock tolerance, scope ceiling and validity window under which renewals may be attested (Section 5).</t>
<t><strong>Peer set:</strong> For a given requester, the manifest's members minus that requester. <tt>N</tt> is its size and MUST be at least 4.</t>
<t><strong>Quorum:</strong> <tt>ceil(2 * N / 3)</tt>, the threshold over the peer set. Two quorums over the same peer set share at least <tt>N/3</tt> members; that intersection property, not any agreement protocol, is what the threshold provides.</t>
<t><strong>Ceiling:</strong> <tt>ceiling_seconds</tt>, the maximum total peer-attested extension, measured from the original credential's issuance and fixed by the issuer in the manifest.</t>
<t><strong>Renewal Request:</strong> The signed object a requester broadcasts naming its original credential, its requested extension, the manifest it is made under, a fresh nonce, its round number and the digest of the proof it extends (Section 6).</t>
<t><strong>Peer Attestation:</strong> The signed object a peer returns after passing every independent-evaluation check for one <tt>RenewalRequest</tt>; it commits to the digest of the whole request (Section 7).</t>
<t><strong>Renewal Proof:</strong> The signed <tt>RenewalRequest</tt> together with at least a quorum of valid, distinct <tt>PeerAttestation</tt> objects for it (Section 8). It carries no signature of its own; every field a verifier acts on is inside the signed request or recomputed.</t>
<t><strong>Renewal Chain:</strong> The ordered sequence of <tt>RenewalProof</tt> objects issued during one continuous partition, each extending the expiry granted by the one before it and committing to it by digest (Section 9).</t>
</section>
<section anchor="sec-roles-and-preconditions"><name>Roles and Preconditions</name>
<t>The following are established before any partition:</t>
<ul><li>The issuer has signed a <tt>MeshManifest</tt> (Section 5) and every member holds a copy. Every parameter of the mesh (membership, ceiling, clock tolerance, scope ceiling) is read from the manifest and never configured locally; two peers holding different manifests are in different meshes.</li><li>The issuer's signature over the requester's original credential is verifiable by every peer.</li><li>The requester holds its original credential as the issuer signed it. It presents the credential alongside every <tt>RenewalRequest</tt> it broadcasts and alongside every <tt>RenewalChain</tt> it presents, since a peer or relying party may not have cached it before the partition; an evaluator that already holds the credential MAY use its own copy. Either way, the evaluator authenticates the credential itself (Section 7.2, item 3; Section 9.2, step 2).</li><li>Every member can resolve the issuer's identity to verify the manifest signature. No other key material is distributed for this procedure.</li></ul>
<t>A requester MUST NOT invoke this procedure before attempting and failing to reach its issuer through its normal channel.</t>
</section>
<section anchor="sec-identity-and-encoding"><name>Identity and Encoding</name>
<t>Every signing identity in this document is assumed to be an Ed25519 key resolvable to a <tt>did:key</tt> <xref target="DIDKEY"/>, consistent with WIMSE Workload Identifier practice <xref target="WIMSEID"/>. Every signed object MUST be canonicalized per RFC 8785 (JCS) <xref target="RFC8785"/> before signing or verifying; a signature covers the canonical JSON of every field except <tt>signature</tt> itself. Signatures and nonces are standard base64 in the canonical form of <xref target="RFC4648"/>, Section 4 (padded, no other characters, pad bits zero); a signature is exactly 64 octets of raw Ed25519 signature. A verifier MUST reject any other spelling of the same octets: each spelling gives the signed object a different digest, so a lenient decoder would let anyone who sees a request mint copies of it that attesters sign (Section 11). Timestamps are RFC 3339 <xref target="RFC3339"/>, second precision, UTC, <tt>Z</tt> suffix.</t>
<t>Every wire object defined by this document (<tt>MeshManifest</tt>, <tt>RenewalRequest</tt>, <tt>PeerAttestation</tt>, <tt>RenewalProof</tt>) has a closed field set: a verifier MUST reject an object carrying any member not listed in that object's required-members list, in addition to rejecting one missing a required member, even when the extra member was present at signing time and the signature is otherwise valid.</t>
<t>Every wire object MUST be I-JSON <xref target="RFC7493"/>, which RFC 8785 presumes: no string contains an unpaired surrogate, and no integer member exceeds 2^53 - 1 (none is negative in this document). Appendix B states the structure of every wire object in CDDL <xref target="RFC8610"/>; an object that does not match it is malformed, as is one that breaks a constraint stated only in prose (ordering, uniqueness, the relation between two members). A verifier MUST reject a malformed object, an object it cannot canonicalize, and an arithmetic result it cannot represent (an expiry after 9999-12-31T23:59:59Z, the last instant RFC 3339 can write) with the same outcome as any other failed check. It MUST NOT abort or fail open on one: every object this document defines can arrive from an adversary.</t>
</section>
<section anchor="sec-mesh-manifest"><name>Mesh Manifest</name>
<t>A <tt>MeshManifest</tt> is a signed JSON object produced by the issuer at provisioning time. It is the single object a relying party verifies first, and the only place the mesh's parameters live. Required members: <tt>version</tt> (MUST equal <tt>"renewal/0.3"</tt>), <tt>manifest_id</tt> (a non-empty opaque string chosen by the issuer; UUIDv4 recommended), <tt>issuer_did</tt> (the issuer's <tt>did:key</tt>), <tt>members</tt> (array of <tt>did:key</tt> strings, sorted lexicographically, unique, at least 5 entries, so that every member's peer set has at least 4), <tt>ceiling_seconds</tt> (positive integer), <tt>max_clock_skew_seconds</tt> (non-negative integer), <tt>scope_ceiling</tt> (array of strings, sorted, unique: every scope claim a renewal under this manifest may carry), <tt>issued_at</tt> and <tt>expires_at</tt> (RFC 3339; <tt>expires_at</tt> MUST be after <tt>issued_at</tt>), and <tt>signature</tt> (Ed25519 by <tt>issuer_did</tt> over the canonical manifest minus this field).</t>
<section anchor="sec-verification"><name>Verification</name>
<t>Any party, attester or relying party, MUST, before evaluating anything else under a manifest: check the closed field set and every type and ordering constraint above; resolve <tt>issuer_did</tt> and verify <tt>signature</tt>; and compute <tt>manifest_hash</tt> as <tt>"sha256:"</tt> followed by the lowercase hexadecimal SHA-256 of the JCS canonical form of the manifest including its signature, so that a re-signed manifest with identical fields is a distinct manifest. A manifest failing either check is rejected and nothing under it is evaluated.</t>
</section>
<section anchor="sec-peer-set"><name>Peer Set</name>
<t>For a requester <tt>R</tt>, the peer set is <tt>members</tt> minus <tt>R</tt>, and <tt>N</tt> is its size. <tt>N</tt> MUST be at least 4. A requester is always a member, so <tt>N</tt> is the size of <tt>members</tt> minus one, which is why Section 5 requires at least 5 members. A requester not listed in <tt>members</tt> is not a member of the mesh and cannot be attested under it, since the issuer signed the credential of a member it named (Section 7.2, item 3).</t>
</section>
<section anchor="sec-binding"><name>Binding</name>
<t>Every <tt>RenewalRequest</tt>, <tt>PeerAttestation</tt> and <tt>RenewalProof</tt> carries <tt>manifest_hash</tt>. A verifier MUST compare each one to the hash of the manifest it is evaluating under and MUST reject a mismatch. Nothing produced under one manifest can be spliced into a chain evaluated under another, even when both manifests come from the same issuer and name the same members.</t>
</section>
<section anchor="sec-lifecycle"><name>Lifecycle</name>
<t>The issuer rotates the mesh by signing a new manifest; it ends the mechanism by letting the manifest expire or by revoking it through whatever revocation channel it already operates for credentials. A new manifest does not reach into an old signed delegation: a party that has not learned of the rotation or revocation continues to honor the old manifest until it does, which is why <tt>expires_at</tt>, the one bound that needs no delivery, is the issuer's real lever. A revoked <tt>manifest_hash</tt> MUST be treated exactly like a revoked <tt>original_credential_hash</tt> (Section 7.2, item 4; Section 9.2). Revocation of a manifest during a partition has the same structural limit as revocation of a credential (Section 11): it takes effect when the partition heals.</t>
</section>
</section>
<section anchor="sec-renewal-request"><name>Renewal Request</name>
<t>A <tt>RenewalRequest</tt> is a signed JSON object with the following required members: <tt>version</tt> (MUST equal <tt>"renewal/0.3"</tt>), <tt>request_id</tt> (UUIDv4), <tt>requester_did</tt> (MUST be listed in the manifest's <tt>members</tt>), <tt>manifest_hash</tt> (Section 5.1), <tt>original_credential_hash</tt> (<tt>sha256:</tt> followed by the lowercase hexadecimal SHA-256 of the original credential: of its JCS form when the credential is a JSON object, otherwise of the exact octets the issuer produced, such as a JWT's compact serialization), <tt>original_issuer_did</tt> (MUST equal the manifest's <tt>issuer_did</tt>), <tt>original_scope</tt> (array of strings, sorted, fixed for the life of the chain, MUST be a subset of the manifest's <tt>scope_ceiling</tt>), <tt>original_issued_at</tt> and <tt>original_expiry</tt> (RFC 3339; <tt>original_expiry</tt> MUST be after <tt>original_issued_at</tt>), <tt>requested_extension_seconds</tt> (positive integer), <tt>nonce</tt> (base64, &gt;= 16 bytes, fresh per request), <tt>round</tt> (integer, <tt>1</tt> for the first round of a partition), <tt>prior_proof_digest</tt> (<tt>null</tt> when <tt>round</tt> is <tt>1</tt>, otherwise the digest of the immediately preceding <tt>RenewalProof</tt>, Section 8.2), <tt>created_at</tt> (RFC 3339, MUST lie within the manifest's validity window), and <tt>signature</tt> (Ed25519 by <tt>requester_did</tt> over the canonical request minus this field). The prior chain is not embedded; it travels alongside the request, as does the original credential (Section 3).</t>
<t>The request digest is <tt>"sha256:"</tt> followed by the lowercase hexadecimal SHA-256 of the JCS canonical form of the signed request including <tt>signature</tt>. Every attestation carries it (Section 7), so a request cannot be re-signed with different content after attestation without every attestation ceasing to bind.</t>
<t>A <tt>RenewalRequest</tt> carries no field capable of widening <tt>original_scope</tt>; there is no field to smuggle a wider claim into. <tt>original_scope</tt>, <tt>original_issued_at</tt>, <tt>original_expiry</tt> and <tt>requester_did</tt> are nonetheless the requester's copy of the credential's claims, and attesters (Section 7.2, item 3) and relying parties (Section 9.2, step 2) MUST check them against the credential the issuer actually signed. <tt>requested_extension_seconds</tt>, combined with the cumulative extension already granted by the prior chain, MUST NOT push the resulting effective expiry past <tt>original_issued_at + ceiling_seconds</tt>; a request that would MUST be rejected by every honest evaluator at the arithmetic stage (Section 8.1), independent of quorum. An effective expiry RFC 3339 cannot write is past every ceiling.</t>
</section>
<section anchor="sec-peer-attestation"><name>Peer Attestation</name>
<t>A <tt>PeerAttestation</tt> is a signed JSON object with required members: <tt>version</tt> (<tt>"renewal/0.3"</tt>), <tt>attester_did</tt> (MUST be in the manifest peer set for the requester and MUST NOT equal the request's <tt>requester_did</tt>), <tt>manifest_hash</tt>, <tt>request_digest</tt> (the digest of the signed request, Section 6; this is the binding, committing the attester to every field of the request and not only those repeated here), <tt>request_id</tt> and <tt>nonce</tt> (copied verbatim from the request), <tt>original_credential_hash</tt> (copied verbatim), <tt>granted_extension_seconds</tt> (MUST equal the request's <tt>requested_extension_seconds</tt>; attestation is binary, never a counter-offer), <tt>as_of</tt> (RFC 3339, the peer's own timestamp for its health observation), <tt>health_evidence</tt> (one of the closed vocabulary below), and <tt>signature</tt> (Ed25519 by <tt>attester_did</tt>).</t>
<t><tt>health_evidence</tt> MUST be one of: <tt>heartbeat_current</tt>, <tt>task_participation</tt>, <tt>consensus_round</tt>, or <tt>other</tt>. A strict verifier MAY refuse to honor an <tt>other</tt> attestation.</t>
<section anchor="sec-health-evidence"><name>Health Evidence</name>
<t>The vocabulary is deliberately small. <tt>heartbeat_current</tt> means the attester received a signed heartbeat from the requester within its own freshness window; <tt>task_participation</tt> means the attester directly observed the requester taking part in a shared task or protocol round; <tt>consensus_round</tt> means the attester and requester jointly completed a coordination round; <tt>other</tt> is a mesh-specific signal that deployments SHOULD document. In every case the evidence is the attester's own first-hand observation, never a claim relayed by the requester. It establishes that the requester was recently active, not that it is uncompromised or still entitled to its permissions; the issuer accepts that distinction when it signs a manifest, and an attestation MUST NOT be represented as more than it is.</t>
</section>
<section anchor="sec-independent-evaluation"><name>Independent Evaluation</name>
<t>Before signing a <tt>PeerAttestation</tt>, an attester MUST verify all of the following and MUST NOT sign if any check fails:</t>
<ol><li>The <tt>MeshManifest</tt> verifies per Section 5.1; the request's <tt>manifest_hash</tt> equals its hash; <tt>original_issuer_did</tt> equals the manifest's <tt>issuer_did</tt>; <tt>original_scope</tt> is within <tt>scope_ceiling</tt>; <tt>created_at</tt> is within the manifest's validity window and within <tt>max_clock_skew_seconds</tt> of the attester's own clock; and the attester's own identity is in the peer set for this requester (Section 5.2).</li><li><tt>attester_did</tt> (its own identity) MUST NOT equal <tt>requester_did</tt>. An attester MUST NOT sign an attestation about itself, under any identity it holds.</li><li><tt>signature</tt> on the <tt>RenewalRequest</tt> verifies against <tt>requester_did</tt>; the credential presented alongside the request (or the attester's own copy, Section 3) hashes to <tt>original_credential_hash</tt> and carries a valid signature by <tt>original_issuer_did</tt>; and the request's <tt>requester_did</tt>, <tt>original_scope</tt>, <tt>original_issued_at</tt> and <tt>original_expiry</tt> equal the corresponding claims of that credential. (The mechanism for authenticating the credential is outside this document's scope; it depends on the credential's own format, e.g. <xref target="WIMSECREDS"/>. The comparison is not optional.)</li><li>Neither the credential identified by <tt>original_credential_hash</tt> nor the manifest identified by <tt>manifest_hash</tt> is present in the attester's own cached revocation state.</li><li>The chain the requester presents alongside the request has exactly <tt>round - 1</tt> proofs; if non-empty, it verifies per Section 9.1 under the same manifest, <tt>prior_proof_digest</tt> equals the digest of its last proof, and the request repeats the root request's <tt>requester_did</tt>, <tt>manifest_hash</tt>, <tt>original_credential_hash</tt>, <tt>original_issuer_did</tt>, <tt>original_scope</tt>, <tt>original_issued_at</tt> and <tt>original_expiry</tt> verbatim. The request's <tt>nonce</tt> MUST differ from the <tt>nonce</tt> of every request in that chain, and its <tt>created_at</tt> MUST NOT be earlier than that of the chain's last request (Section 9.1, items 5 and 9). An attester that did not sign an earlier round never saw that round's nonce, so item 9 alone cannot catch its reuse.</li><li>The resulting effective expiry does not exceed <tt>original_issued_at + ceiling_seconds</tt>.</li><li><tt>original_scope</tt> is unchanged across every entry in the prior chain and this request.</li><li>The requester is healthy per the attester's own fresh, first-hand observation, not a claim relayed by the requester or a third party.</li><li>The attester has not already signed an attestation carrying this exact <tt>nonce</tt>.</li><li>The attester has not already signed an attestation for a different request extending the same chain position: the same <tt>prior_proof_digest</tt>, or for round 1 the same <tt>original_credential_hash</tt>. One attestation per position per attester is what makes two conflicting proofs for one position require at least <tt>N/3</tt> equivocating peers (Section 8.1).</li></ol>
<t>An attestation produced without all ten checks passing is non-conformant, independent of whether the resulting <tt>RenewalProof</tt> happens to reach quorum. Items 1 and 2 MUST be re-verified independently by every relying party at verification time (Section 8.1, Section 9.1), not only by the attester at signing time: a verifier that trusts an assembled <tt>RenewalProof</tt> or <tt>RenewalChain</tt> without re-checking membership and self-attestation can be shown an attestation from a key the issuer never named, or a self-signed one, spliced in after assembly, bypassing whatever an honest assembler would have filtered.</t>
</section>
</section>
<section anchor="sec-renewal-proof"><name>Renewal Proof</name>
<t>A requester assembles a <tt>RenewalProof</tt> once it holds quorum-many attestations for one <tt>RenewalRequest</tt>. Required members: <tt>version</tt>, <tt>manifest_hash</tt>, <tt>request</tt> (the complete signed <tt>RenewalRequest</tt> this proof answers; everything a verifier needs about the round is read from here, under the requester's signature and, via <tt>request_digest</tt>, under every attester's), <tt>effective_expiry</tt> (RFC 3339; MUST equal the baseline expiry, which is the original expiry or the prior proof's <tt>effective_expiry</tt> in a chain, plus the request's <tt>requested_extension_seconds</tt>, exactly; a verifier MUST recompute and compare, not trust the field alone), and <tt>attestations</tt> (array of <tt>PeerAttestation</tt>, at least quorum-many, pairwise-distinct <tt>attester_did</tt>).</t>
<t>A <tt>RenewalProof</tt> carries no signature of its own and needs none: every field a verifier acts on is inside the signed request or is recomputed, and every attestation commits to the request by digest.</t>
<section anchor="sec-quorum-arithmetic"><name>Quorum Arithmetic</name>
<t>Let <tt>N</tt> be the size of the manifest peer set for the requester (Section 5.2). The quorum is <tt>quorum(N) = ceil(2 * N / 3)</tt>. <tt>N</tt> MUST be at least 4. A <tt>RenewalProof</tt> is valid only if <tt>attestations</tt> contains at least <tt>quorum(N)</tt> entries with pairwise-distinct <tt>attester_did</tt> values, and every attestation it contains passes items 1 to 7 below. A relying party cannot re-run the attester-local checks of Section 7.2 (items 8 to 10); the quorum is what it relies on for those.</t>
<t>What the threshold establishes, and what it does not: <tt>quorum(N)</tt> signatures establish that at least that many keys the issuer named signed this exact request. Because any two sets of <tt>quorum(N)</tt> peers out of <tt>N</tt> share at least <tt>2 * quorum(N) - N &gt;= N/3</tt> members, and an honest attester signs at most one request per chain position (Section 7.2, item 10), two conflicting proofs for the same position cannot both exist unless at least <tt>N/3</tt> peers equivocated. That is the whole of the guarantee. The procedure does not run an agreement protocol, does not lock a predecessor before signing, and does not establish that the peers agree on one authoritative history; a relying party learns only that the history it was shown is one a threshold of named peers signed in full. This document does not describe the mechanism as consensus.</t>
<t>A verifier counting attestations toward quorum, whether an attester validating the presented chain per Section 7.2 or a relying party verifying a presented proof or chain per Section 9.2, MUST independently confirm, for every attestation in the proof, all of the following, and MUST reject the proof if any attestation fails any of them. A proof is one object: the next round commits to its entire attestation set through <tt>prior_proof_digest</tt> (Section 8.2), so a proof is never repaired by dropping the attestations that fail:</t>
<ol><li>The attestation MUST be well formed (Section 4, Section 7) and its <tt>signature</tt> MUST verify against <tt>attestation.attester_did</tt>; <tt>attestation.manifest_hash</tt> MUST equal the hash of the manifest being verified under; and <tt>attestation.attester_did</tt> MUST be in the manifest peer set for the proof's <tt>requester_did</tt>. A validly signed attestation from a key the issuer did not name is not an attestation.</li><li><tt>attestation.attester_did</tt> MUST NOT equal the proof's own <tt>requester_did</tt>. This MUST be re-checked here regardless of whether the proof's assembler already filtered it.</li><li><tt>attestation.request_digest</tt> MUST equal the digest of the proof's <tt>request</tt>. This is the check that binds the signature to the whole decision; items 4 to 6 are redundant with it and kept as cheap, explicit consistency checks.</li><li><tt>attestation.request_id</tt> and <tt>attestation.nonce</tt> MUST equal the request's.</li><li><tt>attestation.original_credential_hash</tt> MUST equal the request's.</li><li><tt>attestation.granted_extension_seconds</tt> MUST equal the request's <tt>requested_extension_seconds</tt>.</li><li>Every <tt>as_of</tt> MUST lie within <tt>max_clock_skew_seconds</tt> of the request's <tt>created_at</tt> and within the manifest's validity window widened by <tt>max_clock_skew_seconds</tt>, and the <tt>as_of</tt> values within one proof MUST lie within <tt>max_clock_skew_seconds</tt> of one another. The mesh has no trusted clock; these are consistency checks, not ground truth.</li></ol>
<t>Without item 3, a genuinely-signed attestation collected for a different request is individually valid and can be spliced into an unrelated proof to pad it to quorum, and, worse, a requester can collect attestations on one request and present a re-signed request with the same <tt>request_id</tt> and <tt>nonce</tt> but different content. The digest closes both. Without item 1, an adversary enlarges the electorate by generating keys.</t>
</section>
<section anchor="sec-proof-digest"><name>Proof Digest</name>
<t>The proof digest is <tt>"sha256:"</tt> followed by the lowercase hexadecimal SHA-256 of the JCS canonical form of the entire <tt>RenewalProof</tt>, attestations included. The next round's request carries it as <tt>prior_proof_digest</tt>; since that request is then signed by the requester and digested into every attestation of the next round, the chain is linked by hash from the last round back to the root.</t>
</section>
</section>
<section anchor="sec-renewal-chain"><name>Renewal Chain</name>
<t>A partition MAY outlast one <tt>RenewalProof</tt>'s extension. A <tt>RenewalChain</tt> is the ordered array of every <tt>RenewalProof</tt> issued during one continuous partition, each extending the one before it.</t>
<section anchor="sec-chain-validity"><name>Chain Validity</name>
<t>A chain <tt>[p_1, ..., p_k]</tt> is valid under a manifest if and only if, for every <tt>p_i</tt>:</t>
<ol><li><tt>p_i.manifest_hash</tt> equals the hash of the manifest the chain is being verified under (Section 5.3).</li><li><tt>p_i.request</tt> is structurally valid, its signature verifies against its <tt>requester_did</tt>, its <tt>round</tt> is <tt>i</tt>, and its <tt>prior_proof_digest</tt> is <tt>null</tt> for <tt>i = 1</tt> and equal to the digest of <tt>p_{i-1}</tt> (Section 8.2) otherwise. A chain whose rounds are not linked this way is not a chain, whatever its arithmetic says.</li><li><tt>p_i.request</tt> repeats <tt>p_1.request</tt>'s <tt>requester_did</tt>, <tt>manifest_hash</tt>, <tt>original_credential_hash</tt>, <tt>original_issuer_did</tt>, <tt>original_scope</tt>, <tt>original_issued_at</tt> and <tt>original_expiry</tt> verbatim. A round for a different requester MUST NOT be accepted merely because its credential hash happens to match.</li><li><tt>p_i.attestations</tt> independently satisfies Section 8.1 (quorum, distinctness, membership, and per-attestation binding to <tt>p_i.request</tt> by digest) against the peer set derived from the same manifest.</li><li><tt>p_i.request.nonce</tt> differs from <tt>p_j.request.nonce</tt> for every <tt>j &lt; i</tt>. Every attestation carries its request's nonce (Section 8.1, item 4), so the attestations of one round share it; the rule constrains reuse across rounds, and item 4 extends it to every attestation.</li><li><tt>p_i.effective_expiry</tt> equals <tt>p_{i-1}.effective_expiry</tt> (or <tt>original_expiry</tt>, for <tt>p_1</tt>) plus <tt>p_i.request.requested_extension_seconds</tt> exactly. A verifier MUST recompute this, not trust <tt>effective_expiry</tt> as an independent claim.</li><li><tt>p_i.effective_expiry</tt> is strictly greater than <tt>p_{i-1}.effective_expiry</tt> (or than <tt>original_expiry</tt>, for <tt>p_1</tt>).</li><li>The cumulative extension represented by <tt>p_i.effective_expiry - original_issued_at</tt> MUST NOT exceed the manifest's <tt>ceiling_seconds</tt>.</li><li>For <tt>i &gt; 1</tt>, <tt>p_i.request.created_at</tt> is not earlier than <tt>p_{i-1}.request.created_at</tt>. Round <tt>i</tt> extends a proof that exists only after round <tt>i-1</tt> was requested; a chain whose request times run backwards was not produced in the order it claims.</li></ol>
<t>A chain failing any of these at round <tt>i</tt> is valid only through round <tt>i-1</tt>.</t>
</section>
<section anchor="sec-relying-party-verification"><name>Relying-Party Verification</name>
<t>This section binds only a relying party that has adopted this procedure for a given issuer: one that already trusts the issuer for the original credential and has decided, as policy, to honor that issuer's manifests. A relying party that has not adopted it is unaffected by this document and rejects an expired credential as it always did.</t>
<t>An adopting relying party receiving a request from the requester after <tt>original_expiry</tt> MUST NOT reject solely on that basis. It MUST instead:</t>
<ol><li>Obtain the <tt>MeshManifest</tt> (from the requester alongside the chain, or from its own provisioning) and verify it per Section 5.1, resolving <tt>issuer_did</tt> through the same trust configuration under which it accepts that issuer's credentials. The manifest supplies the peers, the quorum and the ceiling; it does not supply a reason to trust the issuer, which the relying party must already have.</li><li>Authenticate the original credential, as presented by the requester alongside the chain or from its own copy (Section 3), in its own format; check that it hashes to the root request's <tt>original_credential_hash</tt>; and compare the chain's root request against it: <tt>requester_did</tt>, <tt>original_scope</tt>, <tt>original_issued_at</tt>, <tt>original_expiry</tt> and <tt>original_issuer_did</tt> MUST match. A relying party that cannot authenticate the original credential has no basis for the chain and MUST NOT accept it.</li><li>Verify the requester's current <tt>RenewalChain</tt> per Section 9.1 under that manifest.</li><li>Verify its own cached revocation state covers neither <tt>original_credential_hash</tt> nor <tt>manifest_hash</tt>.</li><li>Treat the requester's effective authority as valid through the last chain entry's <tt>effective_expiry</tt>, at <tt>original_scope</tt>, and no further.</li></ol>
<t>Any failure in steps 1 to 4 means the credential MUST be treated as expired. Beyond what it already needed to accept the original credential, a relying party needs only the manifest and the chain; that is what distinguishes the manifest from a local configuration that happened to be shared.</t>
</section>
</section>
<section anchor="sec-settlement"><name>Settlement</name>
<t>On reconnection to its issuer, the requester MUST request a fresh, issuer-signed credential before processing any further peer attestations, transmit its full <tt>RenewalChain</tt> to the issuer for audit, and synchronize its revocation cache from the issuer before honoring or issuing any further attestation. An issuer-issued credential supersedes any peer-attested <tt>RenewalChain</tt> on sight.</t>
</section>
<section anchor="sec-security-considerations"><name>Security Considerations</name>
<t><strong>What is new trust, and what is not.</strong> No independent root of authority is introduced: every signature a verifier checks resolves to the issuer's key (the manifest) or to a key the issuer named (the attestations), and the quorum is a limited-authority local issuer the issuer appointed. That is a narrower claim than "no new trust assumptions", and this document does not make the broader one. Relative to the connected case, a deployment newly assumes that the manifest was provisioned honestly, that mesh clocks agree within the manifest's tolerance, and that attesters report health in good faith. Each is named below.</t>
<t><strong>No unilateral self-grant.</strong> A requester's own signature is never part of any attestation and never counts toward quorum. This MUST be enforced independently at two points: an honest attester refuses to sign a self-attestation (Section 7.2), and every verifier of an assembled proof or chain, including a relying party that did not itself assemble it, independently re-checks that no counted attestation's <tt>attester_did</tt> equals the proof's <tt>requester_did</tt> (Section 8.1). The second check is not redundant with the first: an adversary who controls the requester can hand-craft a <tt>RenewalProof</tt> directly, bypassing whatever an honest assembly routine would have filtered, and splice in a validly self-signed attestation to reach quorum. A verifier that skips the second check because assembly should have handled it is not actually enforcing this property.</t>
<t><strong>The manifest is the delegation.</strong> Without the manifest, a peer set is whatever each peer was configured with, and a quorum of peers grants authority the issuer never delegated; a relying party outside the mesh has no way to learn the peer set, the quorum, or the ceiling it is supposed to check against. With it, the quorum is a limited-authority local issuer the issuer appointed in writing: the ceiling a verifier applies is the one under the issuer's signature, the scope a renewal may carry is capped by the issuer, and the electorate is the issuer's list. The membership check (Section 8.1, item 1) is load-bearing in the same way the self-attestation check is: without it, an adversary who cannot coerce honest peers simply generates <tt>N</tt> keys of its own. Every object carries <tt>manifest_hash</tt> so that nothing produced under one manifest verifies under another. Rotating the manifest invalidates everything produced under the old one for every party that holds the new one or has learned the old one is revoked; a party that has not will honor the old delegation until it does, which is the same residual as credential revocation below and the reason <tt>expires_at</tt> is the issuer's real lever.</t>
<t><strong>Binding to the whole decision.</strong> Each attestation carries <tt>request_digest</tt>, the hash of the complete signed request. An attestation that signed only the fields it repeats (request identifier, nonce, credential hash, extension) would not bind the scope, the requester, the timestamps or the predecessor; since <tt>request_id</tt> is requester-chosen, a requester could collect attestations on a narrow-scope request and present a re-signed copy with the same identifier and nonce and a wider scope, and every per-field check would pass. The digest closes that; and because consistency across a chain is not truth, Section 9.2 step 2 separately requires the relying party to check the root request's claims against the credential the issuer actually signed.</t>
<t><strong>Predecessor binding and forks.</strong> A request carries <tt>prior_proof_digest</tt>; the digest of the signed request is in every attestation; so a quorum's signatures commit to the exact history being extended, not merely to an extension amount that happens to add up. A relying party shown a different predecessor than the one a round was attested against sees the link break. Separately, an honest attester signs at most one request per chain position (Section 7.2, item 10); two sets of <tt>ceil(2N/3)</tt> peers share at least <tt>N/3</tt> members, so two conflicting proofs for one position require at least <tt>N/3</tt> equivocating peers. That is a bound on forks, not agreement: the protocol does not establish that the peers hold one authoritative history, only that any history a relying party is shown was signed in full by a threshold of named peers. The threshold is borrowed from Byzantine fault tolerant systems for its intersection property; this document is not a consensus protocol and does not claim to be.</t>
<t><strong>Forgery bound.</strong> Assembling a valid <tt>RenewalProof</tt> requires <tt>ceil(2N/3)</tt> distinct, independently verifying signatures from the peer set the issuer named, each independently bound by digest to the manifest and to that specific request (Section 8.1). A colluding minority of up to <tt>N - ceil(2N/3)</tt> peers cannot forge a proof without honest participation. The digest binding is load-bearing for this bound, not incidental: without it, a genuinely-signed attestation collected for a different request, even one signed by an honest peer for an unrelated requester, is individually valid and can be spliced into an unrelated proof to pad it to quorum, without forging or coercing anything.</t>
<t><strong>Malformed input is a reject.</strong> Every check in Sections 5 to 9 runs on input an adversary chose: the presented manifest, the request, the attestations and the chain. A verifier that aborts on an object it cannot canonicalize, an integer outside the I-JSON range, or an expiry RFC 3339 cannot write, instead of rejecting it, turns any member's malformed message into a denial of service against its peers and relying parties. Section 4 requires the reject.</t>
<t><strong>One spelling per signature.</strong> A base64 decoder that ignores stray characters or nonzero pad bits reads many strings as the same signature, and each string gives the request a different <tt>request_digest</tt>. An on-path party that cannot sign anything could then rebroadcast copies of a genuine request, and an honest attester that signed a copy has spent its one attestation for that chain position (Section 7.2, item 10): spreading copies across the peer set denies the round its quorum. Requiring the canonical encoding (Section 4) leaves one valid request per signature.</t>
<t><strong>Liveness bound, not a backdoor.</strong> A malicious or unavailable minority can withhold attestation and force fail-closed (deny a renewal); it cannot force an unauthorized grant.</t>
<t><strong>Bounded exposure.</strong> <tt>ceiling_seconds</tt>, fixed by the issuer in the signed manifest and measured from the original credential's issuance, terminates peer-attested authority even if the partition never heals. The manifest's own <tt>expires_at</tt> bounds the window in which any request can be made at all. Both numbers are the issuer's; a peer cannot raise either locally.</t>
<t><strong>Monotonic scope.</strong> <tt>original_scope</tt> is verified unchanged, byte for byte, by every attester at grant time and every relying party at use time, across every round of a chain, and it MUST lie within the manifest's <tt>scope_ceiling</tt>. No field in <tt>RenewalRequest</tt> or <tt>PeerAttestation</tt> is capable of carrying a wider claim.</t>
<t><strong>Front-loading.</strong> Health is observed once per round, and this revision bounds neither the extension one round may request nor how long before the current expiry a round may be requested. A requester can therefore secure the whole of <tt>ceiling_seconds</tt> on one quorum's observation, in a single round or in rounds requested back to back early in a partition, and no later observation is needed to keep it. The ceiling, not the round, bounds the exposure; an issuer that wants health re-observed at intervals sets a short ceiling. Chain validity requires request times to run forwards (Section 9.1, item 9) but does not tie them to the expiry being extended. A per-round extension limit and a lead time (how long before the expiry it extends a round may be requested), both signed in the manifest, would make step-wise renewal enforceable; Appendix E lists them as an open issue.</t>
<t><strong>The revocation residual.</strong> If the issuer revokes the original credential, or the manifest, while the requester is partitioned, the revocation cannot take effect until the partition heals. Peers attesting in good faith, against their own last-cached revocation state, may extend a credential the issuer has already condemned, up to the ceiling. This is a structural property of every credential system under partition; it is not eliminated by this document's mechanism, only bounded (by the ceiling and the manifest window) and priced (by the mandatory revocation resynchronization at settlement, Section 10). An implementation MUST NOT represent this mechanism as providing partition-proof revocation.</t>
<t><strong>Manifest provisioning and clock agreement are trusted computing base.</strong> This document specifies how a manifest is verified, not whom the issuer should list in it. A manifest signed by a compromised issuer key, or one into which a hostile member was admitted before signing, is honored exactly as written. Membership change during a partition is not supported: a new manifest cannot reach a severed mesh. This document does not provide a trusted clock; <tt>as_of</tt> and <tt>created_at</tt> are validated for well-formedness, against the manifest's validity window, for mutual consistency within <tt>max_clock_skew_seconds</tt> and for order along a chain, not against ground truth.</t>
<t><strong>Health evidence is attester-asserted, and establishes activity, not authorization.</strong> <tt>health_evidence</tt> is what the attester claims to have observed, not something this mechanism independently measures, and at best it establishes that the requester was recently active: it sent a heartbeat, took part in a task, completed a round. That is not evidence that the requester is uncompromised or still entitled to its permissions. The issuer accepts that distinction when it signs a manifest; the quorum bound limits the damage from a misreporting attester; neither resolves the distinction, and this document does not claim they do.</t>
</section>
<section anchor="sec-iana-considerations"><name>IANA Considerations</name>
<t>This document requests no IANA actions. The <tt>version</tt> string (<tt>renewal/0.3</tt>) and the <tt>health_evidence</tt> vocabulary are governed by this document and its successors. A future revision MAY register a media type for the <tt>RenewalChain</tt> object (candidate: <tt>application/renewal-chain+json</tt>) once transport contexts warrant it.</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"/><date month="March" year="1997"/></front><seriesInfo name="BCP" value="14"/><seriesInfo name="RFC" value="2119"/></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"/><date month="May" year="2017"/></front><seriesInfo name="BCP" value="14"/><seriesInfo name="RFC" value="8174"/></reference><reference anchor="RFC3339" target="https://www.rfc-editor.org/info/rfc3339"><front><title>Date and Time on the Internet: Timestamps</title><author initials="G." surname="Klyne"/><author initials="C." surname="Newman"/><date month="July" year="2002"/></front><seriesInfo name="RFC" value="3339"/></reference><reference anchor="RFC4648" target="https://www.rfc-editor.org/info/rfc4648"><front><title>The Base16, Base32, and Base64 Data Encodings</title><author initials="S." surname="Josefsson"/><date month="October" year="2006"/></front><seriesInfo name="RFC" value="4648"/></reference><reference anchor="RFC7493" target="https://www.rfc-editor.org/info/rfc7493"><front><title>The I-JSON Message Format</title><author initials="T." surname="Bray"/><date month="March" year="2015"/></front><seriesInfo name="RFC" value="7493"/></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"/><author initials="C." surname="Vigano"/><author initials="C." surname="Bormann"/><date month="June" year="2019"/></front><seriesInfo name="RFC" value="8610"/></reference><reference anchor="RFC8785" target="https://www.rfc-editor.org/info/rfc8785"><front><title>JSON Canonicalization Scheme (JCS)</title><author initials="A." surname="Rundgren"/><author initials="B." surname="Jordan"/><author initials="S." surname="Erdtman"/><date month="June" year="2020"/></front><seriesInfo name="RFC" value="8785"/></reference></references>
<references><name>Informative References</name><reference anchor="RFC4838" target="https://www.rfc-editor.org/info/rfc4838"><front><title>Delay-Tolerant Networking Architecture</title><author initials="V." surname="Cerf"/><author initials="S." surname="Burleigh"/><author initials="A." surname="Hooke"/><author initials="L." surname="Torgerson"/><author initials="R." surname="Durst"/><author initials="K." surname="Scott"/><author initials="K." surname="Fall"/><author initials="H." surname="Weiss"/><date month="April" year="2007"/></front><seriesInfo name="RFC" value="4838"/></reference><reference anchor="WIMSEARCH" target="https://datatracker.ietf.org/doc/draft-ietf-wimse-arch/"><front><title>Workload Identity in a Multi System Environment (WIMSE) Architecture</title><author initials="J." surname="Salowey"/><author initials="Y." surname="Rosomakho"/><author initials="H." surname="Tschofenig"/><date year="2026" month="November"/></front><seriesInfo name="Internet-Draft" value="draft-ietf-wimse-arch"/></reference><reference anchor="WIMSECREDS" target="https://datatracker.ietf.org/doc/draft-ietf-wimse-workload-creds/"><front><title>WIMSE Workload Credentials</title><author initials="B." surname="Campbell"/><author initials="J." surname="Salowey"/><author initials="A." surname="Schwenkschuster"/><author initials="Y." surname="Sheffer"/><author initials="Y." surname="Rosomakho"/><date year="2026" month="October"/></front><seriesInfo name="Internet-Draft" value="draft-ietf-wimse-workload-creds"/></reference><reference anchor="WIMSEID" target="https://datatracker.ietf.org/doc/draft-ietf-wimse-identifier/"><front><title>Workload Identifier</title><author initials="Y." surname="Rosomakho"/><author initials="J." surname="Salowey"/><date year="2026" month="October"/></front><seriesInfo name="Internet-Draft" value="draft-ietf-wimse-identifier"/></reference><reference anchor="WIMSECHARTER" target="https://datatracker.ietf.org/wg/wimse/about/"><front><title>Workload Identity in Multi System Environments (WIMSE) - Working Group Charter</title><author><organization>IETF</organization></author><date year="2026"/></front></reference><reference anchor="SPIFFE" target="https://github.com/spiffe/spiffe/blob/main/standards/SPIFFE.md"><front><title>Secure Production Identity Framework for Everyone (SPIFFE)</title><author><organization>Cloud Native Computing Foundation</organization></author><date/></front></reference><reference anchor="PBFT" target="https://pmg.csail.mit.edu/papers/osdi99.pdf"><front><title>Practical Byzantine Fault Tolerance</title><author initials="M." surname="Castro"/><author initials="B." surname="Liskov"/><date year="1999" month="February"/></front><seriesInfo name="OSDI" value="1999"/></reference><reference anchor="RAR" target="https://datatracker.ietf.org/doc/draft-raskar-agentic-web-federated-resolution/03/"><front><title>Registry-Assisted Resolution for Known Subjects Without DNS Discovery Anchors</title><author initials="R." surname="Raskar"/><author initials="S." surname="Sharaf"/><author initials="P." surname="Chari"/><date year="2026" month="November"/></front><seriesInfo name="Internet-Draft" value="draft-raskar-agentic-web-federated-resolution-03"/></reference><reference anchor="CORROB" target="https://datatracker.ietf.org/doc/draft-chandra-agent-registry-corroboration/"><front><title>Multi-Source Corroboration for AI Agent Discovery</title><author initials="S." surname="Chandra"/><date year="2026" month="October"/></front><seriesInfo name="Internet-Draft" value="draft-chandra-agent-registry-corroboration-02"/></reference><reference anchor="NANDAINDEX" target="https://arxiv.org/abs/2507.14263"><front><title>Beyond DNS: Unlocking the Internet of AI Agents via the NANDA Index and Verified AgentFacts</title><author initials="R." surname="Raskar"/><author initials="P." surname="Chari"/><date year="2025" month="July"/></front></reference><reference anchor="DIDKEY" target="https://w3c-ccg.github.io/did-key-spec/"><front><title>The did:key Method</title><author><organization>W3C Credentials Community Group</organization></author><date year="2024"/></front></reference></references>
</references>
<section anchor="sec-mapping-to-the-reference-implementation"><name>Mapping to the Reference Implementation</name>
<t>Every normative element of this document is implemented in the reference implementation, sm-renewal (version 0.4.0): the <tt>MeshManifest</tt> (Section 5), the <tt>RenewalRequest</tt>, <tt>PeerAttestation</tt>, <tt>RenewalProof</tt> and <tt>RenewalChain</tt> wire shapes with their digests (Sections 6-9), the independent-evaluation procedure including the credential-claims comparison and the one-attestation-per-position rule (Section 7.2), the quorum, membership, binding and ceiling arithmetic (Section 8.1), and the chain and relying-party verification procedures (Section 9) are all covered by a deterministic conformance corpus of 35 vectors (3 valid chains and 32 hostile paths, including a request re-signed with wider scope after attestation, a broken predecessor link, a credential-claims mismatch, a relying party holding incomplete credential claims, an attester outside the peer set, a full quorum padded with one non-member attestation, a manifest too small for any requester, a tampered manifest signature, request times running backwards, an integer outside the I-JSON range, an unpaired surrogate, an expiry past what RFC 3339 can write and a genuine request signature re-spelled with a nonzero pad bit) and a test suite. The test suite checks the CDDL in Appendix B against every vector, and it was cross-checked with the reference CDDL tool: every well-formed object matches it, and every object malformed in a way CDDL can state does not. Each vector names the first failing check with a stage label; the accept or reject outcome is what a second implementation must reproduce, and the labels are informative. Conformance vectors demonstrate that the implementation enforces what this document states; they are not a proof that the design has no further gaps, and independent review is invited. The reference implementation is available (MIT License) at https://pypi.org/project/sm-renewal/; its source distribution includes this document, the specification and the conformance corpus.</t>
</section>
<section anchor="sec-cddl"><name>CDDL</name>
<t>The structure of each wire object, in CDDL <xref target="RFC8610"/> applied to JSON. A map lists every member its object may carry, so a member it does not list is malformed (Section 4). <tt>.regexp</tt> patterns match the whole string. The prose states the rules CDDL does not: sorting and uniqueness of the <tt>members</tt>, <tt>scope_ceiling</tt> and <tt>original_scope</tt> arrays, the quorum size of <tt>attestations</tt>, <tt>original_expiry</tt> after <tt>original_issued_at</tt>, <tt>expires_at</tt> after <tt>issued_at</tt>, and every rule relating one object to another.</t>
<sourcecode type="cddl"><![CDATA[
; renewal/0.3 wire objects in CDDL (RFC 8610), as JSON.
; Maps are closed: a member not listed is a reject (Section 4).
; Sorting, uniqueness, quorum size and cross-field rules are in
; the prose and are not repeated here.

renewal-chain = [+ renewal-proof]

mesh-manifest = {
  version: renewal-version,
  manifest_id: tstr .ne "",
  issuer_did: did-key,
  members: [5* did-key],
  ceiling_seconds: positive-int,
  max_clock_skew_seconds: non-negative-int,
  scope_ceiling: [* tstr],
  issued_at: timestamp,
  expires_at: timestamp,
  signature: signature-b64,
}

renewal-request = {
  version: renewal-version,
  request_id: uuid-v4,
  requester_did: did-key,
  manifest_hash: digest,
  original_credential_hash: digest,
  original_issuer_did: did-key,
  original_scope: [* tstr],
  original_issued_at: timestamp,
  original_expiry: timestamp,
  requested_extension_seconds: positive-int,
  nonce: nonce-b64,
  round-position,
  created_at: timestamp,
  signature: signature-b64,
}

; Round 1 extends the credential; a later round extends a proof.
round-position = (
  round: 1, prior_proof_digest: null //
  round: 2..9007199254740991, prior_proof_digest: digest
)

peer-attestation = {
  version: renewal-version,
  attester_did: did-key,
  manifest_hash: digest,
  request_digest: digest,
  request_id: uuid-v4,
  nonce: nonce-b64,
  original_credential_hash: digest,
  granted_extension_seconds: positive-int,
  as_of: timestamp,
  health_evidence: health-evidence,
  signature: signature-b64,
}

renewal-proof = {
  version: renewal-version,
  manifest_hash: digest,
  request: renewal-request,
  effective_expiry: timestamp,
  attestations: [+ peer-attestation],
}

renewal-version = "renewal/0.3"
health-evidence = "heartbeat_current" / "task_participation" /
                  "consensus_round" / "other"

; Integers stay in the I-JSON range (RFC 7493), as RFC 8785 needs.
positive-int = 1..9007199254740991
non-negative-int = 0..9007199254740991

; RFC 3339, second precision, UTC, "Z" suffix.
timestamp = tstr .regexp
  "[0-9]{4}(-[0-9]{2}){2}T[0-9]{2}(:[0-9]{2}){2}Z"
digest = tstr .regexp "sha256:[0-9a-f]{64}"
did-key = tstr .regexp "did:key:z6Mk[1-9A-HJ-NP-Za-km-z]+"
uuid-v4 = tstr .regexp
"[0-9a-f]{8}-[0-9a-f]{4}-4[0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}"

; Canonical standard base64 (RFC 4648, Section 4): padded, and the
; pad bits of the last character are zero. A nonce is at least 16
; octets (24 characters); a signature is exactly 64 octets.
b64 = b64-whole / b64-pad1 / b64-pad2
b64-whole = tstr .regexp "([A-Za-z0-9+/]{4})*"
b64-pad1 = tstr .regexp
  "([A-Za-z0-9+/]{4})*[A-Za-z0-9+/]{2}[AEIMQUYcgkosw048]="
b64-pad2 = tstr .regexp "([A-Za-z0-9+/]{4})*[A-Za-z0-9+/][AQgw]=="
nonce-b64 = b64 .and (tstr .regexp ".{24,}")
signature-b64 = tstr .regexp "[A-Za-z0-9+/]{85}[AQgw]=="
]]></sourcecode>
</section>
<section anchor="sec-worked-example"><name>Worked Example</name>
<t>Seven workloads coordinate at a remote site, each holding a 4-hour WIMSE Workload Identity Token <xref target="WIMSECREDS"/>. At provisioning, their issuer signed a <tt>MeshManifest</tt> listing all seven, with a 12-hour ceiling, a 5-minute clock tolerance, a scope ceiling of the two scopes any of them was issued, and a one-year validity window. The WAN drops for 45 minutes. One workload, 20 minutes from expiry, fails its issuer contact and broadcasts a <tt>RenewalRequest</tt> (a one-hour extension, round 1, fresh nonce, the manifest's hash) to its six peers, together with its token. <tt>N = 6</tt>, so <tt>quorum(6) = ceil(2*6/3) = 4</tt>. Five peers independently verify the manifest, their own membership, the issuer signature and the token's actual claims, cached revocation state, extend-only scope within the ceiling, ceiling headroom, and the requester's task participation within the last minute, and each signs a <tt>PeerAttestation</tt> over the digest of the request; four would have sufficed. The requester assembles a <tt>RenewalProof</tt> and continues; any peer receiving its subsequent requests verifies the chain independently, and a relying party that already trusts the operator's credential service and has adopted this procedure can do the same from the manifest, the chain and the token. Thirty minutes later the WAN returns; the requester requests a fresh token, transmits its <tt>RenewalChain</tt> for audit, and synchronizes revocation state. Total protocol overhead: one manifest signed once at provisioning, one broadcast, four-to-five signatures, read-only verification by each relying party. No independent root authority introduced; the issuer delegated bounded renewal authority to peers it named, and the deployment now relies on that manifest, on its clocks, and on its peers' honesty about what they observed.</t>
</section>
<section anchor="sec-related-work"><name>Related Work</name>
<t>This document extends credentials issued under the WIMSE architecture <xref target="WIMSEARCH"/> and credential formats <xref target="WIMSECREDS"/> without modifying them. It is an instantiation of the WIMSE charter's local-issuance work item <xref target="WIMSECHARTER"/>, which as of this writing has no adopted draft, for the adversarial, disconnected case, with an issuer-appointed peer quorum as the bounded local issuer and the manifest as the written form of the delegation. None of the working group's current drafts addresses credential continuity when the issuer is unreachable; this document is offered as an Experimental input to that discussion rather than as a competing architecture. It gives SPIFFE/SPIRE-compatible deployments <xref target="SPIFFE"/> a severed-mode bridge without touching the SPIFFE specification. Delay-Tolerant Networking <xref target="RFC4838"/> addresses store-carry-forward message delivery across partitions and is silent on authority continuity for nodes operating inside one; the two are complementary, and DTN transport MAY carry the messages this document defines. The quorum threshold borrows the two-thirds bound of classical Byzantine fault tolerant consensus <xref target="PBFT"/> for its intersection property, applied here to attestation collection; this document is not a consensus protocol and Section 8.1 states what the threshold does and does not establish.</t>
<t>The same shape recurs outside workload identity. Registry-assisted resolution for known subjects <xref target="RAR"/> defines a Resolution Target Object: a registry's time-limited, renewable binding from a subject identity to a target, carrying <tt>expiresAt</tt>, an optional revocation URL, and a sequence number that increases within the subject-authority scope. A resolution lease is therefore an issuer-bounded, time-limited authority in exactly the sense of this document, and it lapses when the registry is unreachable. The procedure here applies to it unchanged, with the registry as issuer, a manifest naming the peers that may vouch for the binding's continuity, and the lease's digest as <tt>original_credential_hash</tt>; the resulting chain is the mesh's evidence that a binding the registry would show as expired was extended under the registry's own pre-authorization. This document cites that draft and is not affiliated with it. A settled <tt>RenewalChain</tt> is also a natural evidence artifact for agent registry systems such as the NANDA Index and its verified AgentFacts <xref target="NANDAINDEX"/> to reference, and a natural claim for a corroboration record <xref target="CORROB"/> to carry alongside a registry's own view, so that the divergence between what the registry reports and what the mesh extended is recorded rather than silent.</t>
</section>
<section anchor="sec-open-issues"><name>Open Issues</name>
<ul><li><strong>Step-wise renewal.</strong> This revision lets one round, or several early rounds, reach the ceiling (Section 11, "Front-loading"). Candidate manifest members: a per-round extension limit, and a lead time bounding how long before the expiry it extends a round may be requested. Together they would bound how far peer-attested authority can run past the last quorum's health observation. Adding them changes the manifest's closed field set and so the version string.</li><li><strong>Transport.</strong> This document defines objects and checks, not how a request, its credential and its chain reach peers and relying parties. A binding to an existing WIMSE transport, and the media type in Section 12, are left to a later revision.</li></ul>
</section>
<section anchor="sec-acknowledgements" numbered="false"><name>Acknowledgements</name>
<t>The WIMSE working group's charter framed the local-issuance problem this document builds on. The registry-lease application in the Related Work section is prompted by the registry-assisted resolution work of Ramesh Raskar, Samuel Sharaf and Pradyumna Chari; any misreading of their draft is the author's own. An anonymous security review of an earlier text of this document identified that the attestations did not bind the whole request, that rounds were not cryptographically linked, and that several claims were stronger than the format supported; the request digest, the proof digest, the credential-claims requirement, the equivocation rule and the corrected claims language in this revision are the response.</t>
</section>
</back>
</rfc>
