@serfab/cadre-core 1.13.0 → 1.14.0

package/dist/link-budget.js

@@ -73,9 +73,7 @@
  * Every row that opens a relayed connection counts opening the relay connection too
  * ({@link RELAYED_DIAL_ROUND_TRIPS}), because a dialer cannot know beforehand whether it holds
  * one, and a budget that is too short fails as silently as an absent peer. The
- * reservation-request row is {@link RELAY_RESERVE_REQUEST_ROUND_TRIPS}, which also sizes how long
- * a party-run relay waits for a stranger's reservation ({@link relayAdmissionReserveDeadlineMs}).
- * The commit row is a measurement of a whole write, not a count of exchanges; its doc comment
+ * reservation-request row is {@link RELAY_RESERVE_REQUEST_ROUND_TRIPS}. The commit row is a measurement of a whole write, not a count of exchanges; its doc comment
  * ({@link COMMIT_ROUND_TRIPS}) holds the figures and says when to re-measure it.
  *
  * **Measured** 2026-09-26, one Windows machine, loopback dedicated relay: a relayed dial over a
@@ -198,10 +196,10 @@
  *   the host derives its provisioning budget from its own, so a joiner declaring a faster
  *   link than the host gives up on a reply the host is still entitled to send. Declare the
  *   same link on every machine of a party.
- *   Relay admission too: a party-run relay derives how long a stranger has to ask for a
- *   reservation from ITS declaration ({@link relayAdmissionReserveDeadlineMs}), so a relay
- *   declaring a faster link than a client closes that client's connection before its request
- *   arrives.
+ *   Provisional admission too: a member derives how long it keeps a connection from a peer it
+ *   cannot place from ITS declaration ({@link relayedRequestBudgetMs}), so a member declaring a
+ *   faster link than a redeeming device can close that device's connection while the device is
+ *   still waiting on its redemption.
  */
 import { resolveLinkDeadlines } from '@optimystic/db-p2p';
 /**
@@ -255,20 +253,19 @@ export const RELAY_DIAL_ROUND_TRIPS = 1;
  */
 export const RELAYED_DIAL_ROUND_TRIPS = RELAY_DIAL_ROUND_TRIPS + CIRCUIT_DIAL_ROUND_TRIPS;
 /**
- * Link round trips from the moment a party-run relay admits a stranger's connection for relay
- * use to the moment that stranger's RESERVE request reaches it. libp2p's reservation store
- * (`@libp2p/circuit-relay-v2`'s `addRelay`) opens the hop stream the instant its dial resolves,
- * without waiting for identify, so:
+ * Link round trips from the moment a relay accepts a client's connection to the moment that
+ * client's RESERVE request reaches it. libp2p's reservation store (`@libp2p/circuit-relay-v2`'s
+ * `addRelay`) opens the hop stream the instant its dial resolves, without waiting for identify,
+ * so:
  *
  * 1. The client's last Noise handshake message and its hop-stream open arrive at the relay
- *    together. The relay's gate runs on the handshake message (and arms the reserve deadline),
- *    then the relay answers the protocol negotiation.
+ *    together. A party-run relay's gate runs on the handshake message, then the relay answers
+ *    the protocol negotiation.
  * 2. The answer reaches the client and the client's RESERVE request reaches the relay: one round
  *    trip on the client-to-relay hop, which is the whole link round trip when all of the link's
  *    delay is on the client's own hop (a phone on a congested mobile link).
  *
- * The relay's decision on that request is local time, not link time;
- * {@link relayAdmissionReserveDeadlineMs} adds it separately.
+ * The relay's decision on that request is local time, not link time.
  */
 export const RELAY_RESERVE_REQUEST_ROUND_TRIPS = 1;
 /**
@@ -489,22 +486,6 @@ export function commitBudgetMs(linkRoundTripMs) {
 export function relayReservationBudgetMs(linkRoundTripMs) {
     return RELAY_RESERVATION_ROUND_TRIPS * resolveLinkRoundTripMs(linkRoundTripMs) + 2 * ADMISSION_DECISION_TIMEOUT_MS;
 }
-/**
- * How long a party-run relay keeps a connection it admitted only for relay use
- * (`membership-connection-gater.ts`'s `'admit-for-relay'`) before closing it, unless a
- * reservation is admitted on it first: {@link RELAY_RESERVE_REQUEST_ROUND_TRIPS} at the declared
- * link round trip, plus one {@link ADMISSION_DECISION_TIMEOUT_MS} for the relay's own decision on
- * the reservation (`denyInboundRelayReservation`), which disarms the timer only once it settles.
- * 3 500 + 2 000 = 5 500 ms at the default declaration.
- *
- * The declaration is the RELAY's own, because the relay is the machine that decides.
- *
- * What it costs, against the fixed 5 000 ms it replaced: a stranger that connects and never
- * reserves holds a mute connection 0.5 s longer at the default declaration.
- */
-export function relayAdmissionReserveDeadlineMs(linkRoundTripMs) {
-    return RELAY_RESERVE_REQUEST_ROUND_TRIPS * resolveLinkRoundTripMs(linkRoundTripMs) + ADMISSION_DECISION_TIMEOUT_MS;
-}
 /**
  * Deadline for one request and its answer over a circuit that is already open —
  * {@link CIRCUIT_REQUEST_ROUND_TRIPS} at the declared link round trip, plus `transferAllowanceMs`
@@ -522,6 +503,10 @@ export function circuitRequestBudgetMs(linkRoundTripMs, transferAllowanceMs = PU
  *
  * No transfer allowance, unlike {@link circuitRequestBudgetMs}: the requests this bounds are a few
  * hundred bytes to a few KB, so their bytes cost nothing a round trip does not already cover.
+ *
+ * A control node also keeps a connection it admitted provisionally this long, at its own
+ * declaration, because a cadre invitation redemption is bounded by this budget on the device's
+ * side (`membership-connection-gater.ts`, `PROVISIONAL_ADMISSION_DEADLINE_MS`).
  */
 export function relayedRequestBudgetMs(linkRoundTripMs) {
     return relayedDialBudgetMs(linkRoundTripMs) + CIRCUIT_REQUEST_ROUND_TRIPS * resolveLinkRoundTripMs(linkRoundTripMs);

package/dist/link-budget.js.map

@@ -1 +1 @@
-{"version":3,"file":"link-budget.js","sourceRoot":"","sources":["../src/link-budget.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4MG;AAEH,OAAO,EAAE,oBAAoB,EAA2D,MAAM,oBAAoB,CAAC;AAEnH;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAEhD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAE1C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAExC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,sBAAsB,GAAG,wBAAwB,CAAC;AAE1F;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAAC,CAAC;AAEnD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,GAAG,CAAC,sBAAsB,GAAG,iCAAiC,CAAC,CAAC;AAE9G;;;;GAIG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,gCAAgC,GAAG,CAAC,CAAC;AAEhF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAErC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,wBAAwB,GAAG,2BAA2B,CAAC;AAElG;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC;AAE/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AACH,sPAAsP;AACtP,MAAM,CAAC,MAAM,6BAA6B,GAAG,IAAK,CAAC;AAEnD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,sBAAsB,CAAC,eAAwB;IAC9D,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,2BAA2B,CAAC;IACpC,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,eAAe,IAAI,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,KAAK,CACd,mFAAmF,MAAM,CAAC,eAAe,CAAC,EAAE,CAC5G,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAE1C;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CAAC,eAAwB;IAC3D,OAAO,wBAAwB,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,wBAAwB,GAAG,6BAA6B,CAAC;AACtI,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CAAC,eAAwB;IACjE,OAAO,mBAAmB,CAAC,eAAe,CAAC,GAAG,gCAAgC,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AAC1H,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,eAAwB;IACtD,OAAO,kBAAkB,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CAAC,eAAwB;IAChE,OAAO,6BAA6B,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,6BAA6B,CAAC;AACpH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,+BAA+B,CAAC,eAAwB;IACvE,OAAO,iCAAiC,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,6BAA6B,CAAC;AACpH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACrC,eAAwB,EACxB,mBAAmB,GAAG,0BAA0B;IAEhD,OAAO,2BAA2B,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,mBAAmB,CAAC;AACpG,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,sBAAsB,CAAC,eAAwB;IAC9D,OAAO,mBAAmB,CAAC,eAAe,CAAC,GAAG,2BAA2B,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AACrH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,MAAM,UAAU,oBAAoB,CAAC,eAAwB;IAC5D,OAAO,2BAA2B,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AAC9E,CAAC;AAUD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,4BAA4B,CAAC,OAA8B;IAC1E,OAAO,OAAO,EAAE,oBAAoB;WAChC,CAAC,OAAO,EAAE,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC;AAC1G,CAAC;AAUD;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,eAAwB;IAC1D,OAAO;QACN,aAAa,EAAE,mBAAmB,CAAC,eAAe,CAAC;QACnD,iBAAiB,EAAE,sBAAsB,CAAC,eAAe,CAAC;KAC1D,CAAC;AACH,CAAC;AAUD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,oBAAoB,CAAC,eAAwB;IAC5D,MAAM,OAAO,GAAG,oBAAoB,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAG,wBAAwB,GAAG,6BAA6B,CAAC;IAC7E,OAAO;QACN,iBAAiB,EAAE;YAClB,kBAAkB,EAAE,OAAO,CAAC,oBAAoB,GAAG,WAAW;YAC9D,WAAW,EAAE,OAAO,CAAC,mBAAmB,GAAG,WAAW;SACtD;QACD,YAAY,EAAE,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,GAAG,WAAW,EAAE;KACpE,CAAC;AACH,CAAC"}
+{"version":3,"file":"link-budget.js","sourceRoot":"","sources":["../src/link-budget.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0MG;AAEH,OAAO,EAAE,oBAAoB,EAA2D,MAAM,oBAAoB,CAAC;AAEnH;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAEhD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAE1C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAExC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,sBAAsB,GAAG,wBAAwB,CAAC;AAE1F;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAAC,CAAC;AAEnD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,GAAG,CAAC,sBAAsB,GAAG,iCAAiC,CAAC,CAAC;AAE9G;;;;GAIG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,gCAAgC,GAAG,CAAC,CAAC;AAEhF;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAErC;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,wBAAwB,GAAG,2BAA2B,CAAC;AAElG;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC;AAE/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AACH,sPAAsP;AACtP,MAAM,CAAC,MAAM,6BAA6B,GAAG,IAAK,CAAC;AAEnD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,sBAAsB,CAAC,eAAwB;IAC9D,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO,2BAA2B,CAAC;IACpC,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,eAAe,IAAI,CAAC,EAAE,CAAC;QAC/D,MAAM,IAAI,KAAK,CACd,mFAAmF,MAAM,CAAC,eAAe,CAAC,EAAE,CAC5G,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC;AAE1C;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,mBAAmB,CAAC,eAAwB;IAC3D,OAAO,wBAAwB,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,wBAAwB,GAAG,6BAA6B,CAAC;AACtI,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CAAC,eAAwB;IACjE,OAAO,mBAAmB,CAAC,eAAe,CAAC,GAAG,gCAAgC,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AAC1H,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,eAAwB;IACtD,OAAO,kBAAkB,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AACrE,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CAAC,eAAwB;IAChE,OAAO,6BAA6B,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,6BAA6B,CAAC;AACpH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACrC,eAAwB,EACxB,mBAAmB,GAAG,0BAA0B;IAEhD,OAAO,2BAA2B,GAAG,sBAAsB,CAAC,eAAe,CAAC,GAAG,mBAAmB,CAAC;AACpG,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,sBAAsB,CAAC,eAAwB;IAC9D,OAAO,mBAAmB,CAAC,eAAe,CAAC,GAAG,2BAA2B,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AACrH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,MAAM,UAAU,oBAAoB,CAAC,eAAwB;IAC5D,OAAO,2BAA2B,GAAG,sBAAsB,CAAC,eAAe,CAAC,CAAC;AAC9E,CAAC;AAUD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,4BAA4B,CAAC,OAA8B;IAC1E,OAAO,OAAO,EAAE,oBAAoB;WAChC,CAAC,OAAO,EAAE,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC;AAC1G,CAAC;AAUD;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,eAAwB;IAC1D,OAAO;QACN,aAAa,EAAE,mBAAmB,CAAC,eAAe,CAAC;QACnD,iBAAiB,EAAE,sBAAsB,CAAC,eAAe,CAAC;KAC1D,CAAC;AACH,CAAC;AAUD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,oBAAoB,CAAC,eAAwB;IAC5D,MAAM,OAAO,GAAG,oBAAoB,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC,CAAC;IAC9E,MAAM,WAAW,GAAG,wBAAwB,GAAG,6BAA6B,CAAC;IAC7E,OAAO;QACN,iBAAiB,EAAE;YAClB,kBAAkB,EAAE,OAAO,CAAC,oBAAoB,GAAG,WAAW;YAC9D,WAAW,EAAE,OAAO,CAAC,mBAAmB,GAAG,WAAW;SACtD;QACD,YAAY,EAAE,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,GAAG,WAAW,EAAE;KACpE,CAAC;AACH,CAAC"}

package/dist/membership-connection-gater.d.ts

@@ -1,121 +1,159 @@
 /**
- * Control-network inbound admission gates (defense-in-depth): the
- * encrypted-connection checkpoint and the circuit-relay reservation checkpoint.
- *
- * Layer 2 of the membership enforcement chain: the PRIMARY gates are per-stream
- * — every sensitive sereus control protocol rejects a peer that fails the
- * voucher-anchored membership check (wake and strand-addr via
- * `CadreNode.isAuthorizedMember`; the Optimystic control-DB protocols via the
- * materialized-snapshot gate `CadreNode.authorizeInboundControlStream`), and
- * the replicated rows an outsider *can* still write are disbelieved at read
- * time. This module adds the opportunistic connection-level layer on top: a
- * peer this node can positively determine is NOT authorized is refused at the
- * encrypted-connection checkpoint, before any protocol negotiation, so a
- * known-nothing outsider is never even in the conversation — EXCEPT on a node
- * that runs the circuit-relay server, where the refusal moves to the
- * relay-reservation checkpoint instead (see "The relay-reservation seam").
- *
- * ## The stranger allowlist (the ONE place it is defined)
- *
- * A libp2p connection gater decides per CONNECTION, before protocols are
- * negotiated, so "allow seed, deny repo" cannot be expressed here — instead the
- * policy admits a connection whenever a legitimate stranger interaction could be
- * riding it, and the per-stream gates take over. The complete set of protocols a
- * NOT-yet-authorized peer may legitimately speak on a control node is:
- *
- *  - `/sereus/seed/1.0.0` ({@link SEED_PROTOCOL}) — enrollment seed delivery.
+ * Control-network inbound admission gates: the encrypted-connection checkpoint
+ * and the circuit-relay reservation checkpoint.
+ *
+ * The fail-closed layer of the membership enforcement chain is per-stream: the
+ * control node's protocol guard (`control-protocol-guard.ts`) refuses a peer that
+ * is not an authorized member on every protocol not declared open to strangers,
+ * before its handler runs, and the replicated rows an outsider *can* still write
+ * are disbelieved at read time. This module is NOT a stranger boundary on an
+ * enrolled node — outside the bring-up quiet period it admits every inbound
+ * connection. Its jobs are:
+ *
+ *  - the bring-up quiet period (below), the one state in which it denies;
+ *  - deciding which admitted peers carry a deadline: a peer the policy cannot
+ *    place is admitted PROVISIONALLY, and its connection is closed at the
+ *    deadline unless the policy admits it by then (see "Provisional admission");
+ *  - handing circuit-relay reservations to the reservation policy (see "The
+ *    relay-reservation seam").
+ *
+ * Why a stranger's connection is admitted at all: the gate sees only a peer id,
+ * after the encrypted handshake and before any protocol, so it cannot tell an
+ * outsider from a device carrying a cadre invitation this node has not received
+ * yet, or from a sibling whose membership row is still replicating. Refusing
+ * would fail those at the connection; admitting costs a mute connection for a
+ * bounded time, because the protocol guard refuses it every members-only protocol.
+ *
+ * ## Admitted outright
+ *
+ * A peer the policy CAN place gets no deadline. Besides members, configured
+ * infrastructure and an un-enrolled node's whole world (empty anchor or empty
+ * authorized set), that covers the stranger windows: states in which this node
+ * expects a stranger on one of the `stranger-open` protocols declared in
+ * `controlProtocolClasses` (`control-protocol-guard.ts`):
+ *
+ *  - `/sereus/seed/1.0.0` — enrollment seed delivery.
  *    An owner dials a brand-new node to seed it (the new node has no members
- *    yet, so its gate is inert), and an invited phone dials the owner before it
- *    is authorized (admitted via the enrollment window `CadreNode.createInvite`
- *    opens). The handler's own trust decision is the anchored seed-trust policy.
- *  - `/sereus/formation/1.0.0` ({@link FORMATION_PROTOCOL}) — cross-party
+ *    yet, so it admits everyone outright). The handler's own trust decision is the
+ *    anchored seed-trust policy — or, on a node started with a claim secret
+ *    (`CadreNodeConfig.claim`), the claim-secret policy. Such a node is the one
+ *    stranger-facing state that is NOT "admit the connection and let the
+ *    per-stream gates sort it out": while it waits to be claimed
+ *    (`CadreNode.isAwaitingClaim`) its connection is admitted, because the claim
+ *    seed has to ride one, but its control-DB streams and relay reservations are
+ *    refused ahead of every admission below, the empty-anchor one included. An
+ *    unclaimed node has no siblings to replicate from, and one on a public
+ *    address must not relay for anyone. The claim anchors the owner, after which
+ *    the ordinary rules apply.
+ *  - `/sereus/formation/1.0.0` — cross-party
  *    strand formation via open invitations. Stranger-facing BY DESIGN: the
  *    initiator is another party, and its token is only checkable inside the
- *    protocol. The exemption is therefore keyed on EXPECTATION of a stranger,
- *    not capability to serve one: stranger denial is suspended only while this
- *    node has at least one UNEXPIRED, NOT-FULLY-CONSUMED open invitation
- *    outstanding (`StrandSolicitationService.hasOutstandingInvitation` — the
- *    tokens this process minted or published, plus any still-redeemable
- *    `FormationInvite` row the usage recorder can see). Registering the
- *    responder does NOT suspend it, so every node — each registers one at
- *    `CadreNode.start` — keeps a live gate. The
+ *    protocol. The window is keyed on EXPECTATION of a stranger, not capability
+ *    to serve one: it is open only while this node has at least one UNEXPIRED,
+ *    NOT-FULLY-CONSUMED open invitation outstanding
+ *    (`StrandSolicitationService.hasOutstandingInvitation` — the tokens this
+ *    process minted or published, plus any still-redeemable `FormationInvite`
+ *    row the usage recorder can see). Registering the responder does NOT open
+ *    it, so on every node — each registers one at `CadreNode.start` — a stranger
+ *    with no invitation in play stays on the provisional deadline. The
  *    handler's own trust decision remains the per-token check, which is
  *    strictly finer than this one: a peer admitted here can still be rejected
  *    in-protocol for a bogus or spent token.
+ *  - `/sereus/cadre-invite/1.0.0` — redemption
+ *    of a cadre invitation at any member machine. Stranger-facing BY DESIGN:
+ *    the device is not a member until the redemption writes its row, and its
+ *    proof of possession (a signature with the invitation's private key) is
+ *    only checkable inside the protocol. Keyed on expectation, as formation's
+ *    is: open only while this node holds at least one LIVE `CadreInvite` row
+ *    (`ControlDatabase.hasLiveCadreInvite`: not withdrawn, unexpired, uses left,
+ *    issuer still an owner). A member that has not yet received the device's
+ *    row by replication admits the device provisionally instead, seats the row
+ *    from the invitation bundle during the redemption, and so admits it at the
+ *    deadline's re-check.
  *
  * There is one further connection-level carve-out, which is NOT a protocol
- * exemption and needs no stranger window:
+ * window:
  *
  *  - **Announced delegate peers** (`delegate-admission.ts`). A member's strand
  *    node runs as a separate libp2p identity whose peerId no sibling can
  *    recompute. Before starting a strand node, a member's control node
  *    announces that peerId over the already-authenticated strand-addr RPC, and
  *    the receiver holds a short-lived grant for it
- *    (`CadreNode.grantDelegateAdmission`). The grant admits the CONNECTION,
- *    admits the peer's RESERVATION at the seam below (without spending the
- *    unauthorized budget), and nothing else — it is deliberately invisible to
- *    the per-stream gate, so a delegate still gets refused on every
+ *    (`CadreNode.grantDelegateAdmission`). The grant admits the CONNECTION
+ *    outright, admits the peer's RESERVATION at the seam below (without
+ *    spending the unauthorized budget), and nothing else — it is deliberately
+ *    invisible to the protocol guard, so a delegate still gets refused on every
  *    members-only protocol.
  *
+ * ## Provisional admission
+ *
+ * A peer the policy cannot place (`'admit-provisionally'`) gets its connection
+ * and a deadline — {@link PROVISIONAL_ADMISSION_DEADLINE_MS} at the default
+ * declaration; `CadreNode` passes the one derived from its OWN declared link,
+ * because the member is the machine that decides. At the deadline the gate asks
+ * the policy again:
+ *
+ *  - `'admit'` — the peer has since become a member, holds a delegate grant, or
+ *    this node now holds a live invitation (a redeeming device's row was
+ *    seated): the connection stays, and nothing is re-armed;
+ *  - `'admit-provisionally'` — the connection is closed (a bounded graceful
+ *    close, with an abort only as the escalation);
+ *  - the question throws or outlasts the decision deadline — the connection
+ *    stays (see "Fail-open, deliberately").
+ *
+ * A connection that is already gone by then costs no question. One peer may hold
+ * several provisional connections; each deadline re-asks on its own.
+ *
+ * NOTE: the gate does not stop a provisionally admitted stranger from being
+ * counted into this node's FRET ring and control-database cohort by opening or
+ * advertising the party's protocols — FRET and Optimystic decide that from the
+ * protocols libp2p records the peer as serving. Ticket
+ * `stranger-joins-the-control-cohort-by-advertising-protocols` (blocked).
+ *
  * ## The relay-reservation seam
  *
  * A circuit-relay reservation is established by the reserving peer DIALING the
- * relay, so at the relay it is an inbound connection — and killing that
+ * relay, so at the relay it rides an inbound connection — and closing that
  * connection kills the reservation. For a genuine member whose `CadrePeer` row
- * has not yet replicated to this node, a connection-level deny here is NOT
- * self-healing the way a data connection's is: an outbound reconcile dial
- * re-establishes a data link, but no outbound dial can grant the REMOTE peer a
- * reservation, and a relay-only peer has no address of its own to dial back —
- * the reservation IS its address. Boot ordering makes the window ordinary (a
- * node's circuit listener runs inside `libp2p.start()`, before its own row
- * could have replicated anywhere), and a stalled replication makes it
- * unbounded. So the relay would be answering a RELAY question ("may this peer
- * use my forwarding capacity?") with a MEMBERSHIP answer, at a checkpoint where
- * a wrong answer is unrecoverable.
- *
- * On a node whose relay server is enabled the two questions are separated:
- *
- *  - The policy returns `'admit-for-relay'` instead of `'deny'`, and the
- *    connection is ADMITTED. The fail-closed per-stream gates still refuse such
- *    a peer every members-only protocol, so it gains identify/ping and the
- *    relay hop protocol, nothing else.
- *  - The reservation itself is decided at libp2p's
- *    `denyInboundRelayReservation` hook (the circuit-relay server consults it
- *    per RESERVE request): the policy admits members, delegates and configured
- *    infra outright, and admits peers it cannot place only within a bounded
- *    budget ({@link UnauthorizedReservationBudget}) — a member whose row is in
- *    flight always finds a slot under any sane cap, while outsiders cannot
- *    annex the party's relay capacity. COUNT and lifetime are the only bounds
- *    on such a peer: a party-run relay forwards without libp2p's per-connection
- *    data and duration limit by default (`relay-server.ts`), so what a granted
- *    slot carries is not capped.
- *  - An `'admit-for-relay'` connection that is NOT reserving is dropped: it has
- *    {@link RELAY_ADMISSION_RESERVE_DEADLINE_MS} to get a reservation ADMITTED
- *    at that hook, after which the gate CLOSES the underlying connection so
- *    both ends let go of the socket. The guarantee above thus weakens on
- *    relay-enabled nodes from "never in the conversation" to "in it briefly,
- *    and can speak nothing".
+ * has not yet replicated to this node that would NOT be self-healing the way a
+ * data connection's close is: an outbound reconcile dial re-establishes a data
+ * link, but no outbound dial can grant the REMOTE peer a reservation, and a
+ * relay-only peer has no address of its own to dial back — the reservation IS
+ * its address. Boot ordering makes the window ordinary (a node reserves at the
+ * end of its own `start()`, before its row could have replicated anywhere), and
+ * a stalled replication makes it unbounded. So the reservation is decided on its
+ * own terms, not by the connection's:
+ *
+ *  - It is decided at libp2p's `denyInboundRelayReservation` hook (the
+ *    circuit-relay server consults it per RESERVE request): the policy admits
+ *    members, delegates and configured infra outright, and admits peers it
+ *    cannot place only within a bounded budget
+ *    ({@link UnauthorizedReservationBudget}) — a member whose row is in flight
+ *    always finds a slot under any sane cap, while outsiders cannot annex the
+ *    party's relay capacity. COUNT and lifetime are the only bounds on such a
+ *    peer: a party-run relay forwards without libp2p's per-connection data and
+ *    duration limit by default (`relay-server.ts`), so what a granted slot
+ *    carries is not capped.
+ *  - An ADMITTED reservation disarms every provisional deadline the peer holds
+ *    here, so its connection outlives the deadline even while the peer is still
+ *    unplaced. A refused one disarms nothing.
  *
  * The deadline clears on reservation ADMISSION, not on the reservation's own
  * success: this gate cannot observe the server-side `reserve()` outcome, so a
  * peer whose admitted reservation is then refused for server capacity keeps its
  * connection until either side closes it — bounded and mute, so harmless.
  *
- * Everything else a control node handles — the Optimystic control-DB protocols
- * (`/optimystic/control-<party>/{repo,cluster,sync,block-transfer}/…`), wake
- * (`/sereus/strand-wake/1.0.0`), and strand-addr (`/sereus/strand-addr/1.0.0`)
- * — is members-only, and every one of them enforces that per-stream. Wake and
- * strand-addr check `isAuthorizedMember` inside their handlers; the four
- * control-DB protocols are gated by the fail-closed
- * `CadreNode.authorizeInboundControlStream` (wired as libp2p's
- * `authorizeInboundStream` upstream hook), which judges each inbound stream
- * against the MATERIALIZED authorized-peer snapshot — synchronous and
- * in-memory, because a live DB read from inside the gate would deadlock into
- * mutual denial. The two layers complement, not duplicate: this connection
- * gate is fail-open over a live DB read (deny only on positive proof of an
- * outsider), the stream gate is fail-closed over the snapshot and has NO
- * stranger carve-outs — an enrollment window admits a stranger's connection
- * for seed delivery, yet its repo streams are still refused.
+ * Everything else a control node serves is either libp2p plumbing open to any
+ * connection (identify, ping, hole punching, AutoNAT, the relay protocols) or
+ * members-only — wake, strand-addr, the Optimystic control-DB protocols and FRET —
+ * and the fail-closed layer for all of it is the protocol guard
+ * (`control-protocol-guard.ts`), one seam that wraps every handler at dispatch,
+ * with a protocol nobody classed treated as members-only. The two layers
+ * complement, not duplicate: this connection gate is fail-open over a live DB
+ * read and decides only how long a connection lasts, the protocol guard is
+ * fail-closed and has NO stranger carve-outs — a live invitation admits a
+ * stranger's connection outright for redemption, yet its repo and FRET streams
+ * are still refused.
  *
  * ## The bring-up quiet period
  *
@@ -151,55 +189,49 @@
  *
  * ## Fail-open, deliberately
  *
- * Outside that window this layer only ever denies on a POSITIVE determination of
- * "unauthorized outsider while no stranger path is open". Any error, missing
- * dependency, or ambiguous state admits the connection (and the reservation) and
- * defers to the fail-closed stream gates — a DB hiccup must not partition a
- * legitimate cadre.
+ * Outside that window this layer never denies, and it closes a provisional
+ * connection only on a positive answer that the peer is still unplaced. Any
+ * error, missing dependency, timeout or ambiguous state admits the connection
+ * outright (and the reservation), or keeps a provisional connection at its
+ * deadline, and defers to the fail-closed stream gates — a DB hiccup must not
+ * partition a legitimate cadre.
  */
 import type { ConnectionGater } from '@libp2p/interface';
 /**
- * The protocols a not-yet-authorized peer may legitimately speak on a control
- * node (see the module doc above for why each is open and where its own trust
- * decision lives). Exported as the single reference point so the allowlist
- * cannot silently drift across modules.
- */
-export declare const STRANGER_OPEN_PROTOCOLS: readonly string[];
-/**
- * How long `CadreNode.createInvite` holds the inbound gate open for strangers
- * when the invite carries no explicit expiry: the invitee must dial in before
- * it is authorized, and an expiry-less invite gives the gate no bound of its
- * own. Redeeming after this window still works once the owner re-mints (or the
- * caller re-opens the window via `CadreNode.openEnrollmentWindow`).
- */
-export declare const DEFAULT_ENROLLMENT_WINDOW_MS: number;
-/**
- * How long an `'admit-for-relay'` connection may exist without a relay
- * reservation being ADMITTED at the `denyInboundRelayReservation` hook, after
- * which the gate closes the underlying connection. A reserving client asks for
- * its slot immediately after the connection upgrades (`relay-reservation.ts`
- * dials and requests in one drive; a strand node's configured circuit listener
- * does the same from inside its own `listen()`), so a connection idle past this
- * deadline is not reserving.
- *
- * Derived from the link ({@link relayAdmissionReserveDeadlineMs}): one link round trip for the
- * request to arrive plus one admission decision on it. This is the value at the default
- * declaration; `CadreNode` passes the one derived from the relay's OWN declaration, because the
- * relay is the machine that decides.
+ * How long a provisionally admitted connection lasts before the gate re-asks the
+ * policy and closes it unless the peer is admissible by then (see the module
+ * doc's "Provisional admission").
+ *
+ * {@link relayedRequestBudgetMs}: 28 500 ms at the default declaration. The
+ * longest exchange a stranger legitimately starts on a fresh connection is a
+ * cadre invitation redemption, and the device abandons each member address after
+ * that same budget of its own declared link (`redeemAtMembers`): it covers the
+ * dial, the request, the member's catch-up push, the seat and the redemption. So
+ * a member never cuts an exchange the device is still waiting on, and a
+ * reservation request lands well inside it. This is the value at the default
+ * declaration; `CadreNode` passes the one derived from its OWN declaration.
+ *
+ * NOTE: accepted tradeoff — any stranger can hold a mute connection to any
+ * enrolled member for this long, weighed against letting a device redeem an
+ * invitation at a member that has not yet received its row (maintainer,
+ * 2026-10-07, plan `cadre-invite-redeemable-before-the-row-replicates`). It can
+ * open only stranger-open and transport streams (the protocol guard), and
+ * libp2p's connection-manager limits bound how many it holds. Revisit if stranger
+ * connections show up as load on a member.
  */
-export declare const RELAY_ADMISSION_RESERVE_DEADLINE_MS: number;
+export declare const PROVISIONAL_ADMISSION_DEADLINE_MS: number;
 /**
- * Bound on the graceful close of an expired relay-only connection. It exists
+ * Bound on the graceful close of an expired provisional connection. It exists
  * because `AbstractMultiaddrConnection.close()` awaits an `idle`/`drain` event
  * when the connection still has unsent bytes, and that wait has no timeout of
  * its own — an unsignalled one never ends. This gate writes nothing to a
- * stranger, so the wait is not reachable today; the bound is here so a timer
+ * stranger, so the wait is not reachable from here; the bound is here so a timer
  * callback can never hold an unending await.
  *
  * Applied through {@link withDeadline}, not `AbortSignal.timeout`: the latter is
  * not reliably present on React Native/Hermes, which loads this same module.
  */
-export declare const RELAY_ADMISSION_CLOSE_TIMEOUT_MS = 2000;
+export declare const PROVISIONAL_ADMISSION_CLOSE_TIMEOUT_MS = 2000;
 /**
  * Default cap on concurrent relay reservations held by peers the membership
  * check could not place (see {@link UnauthorizedReservationBudget}). Small on
@@ -221,15 +253,16 @@ export declare const MAX_UNAUTHORIZED_RELAY_RESERVATIONS = 8;
 /**
  * The connection-level outcome of the admission policy:
  *  - `'admit'` — a peer with a legitimate claim on the connection (member,
- *    delegate, infra, open stranger window, or any fail-open state).
- *  - `'deny'` — positively an outsider, and this node runs no relay server, so
- *    the connection can carry nothing legitimate.
- *  - `'admit-for-relay'` — positively an outsider (or an unreplicated member —
- *    indistinguishable), but this node runs the relay server: admit the
- *    connection so a reservation can be asked for, decide at the reservation
- *    seam, and drop the connection if no reservation is admitted in time.
+ *    delegate, infra, open stranger window, or any fail-open state); no deadline.
+ *  - `'admit-provisionally'` — a peer the policy cannot place (an outsider, a
+ *    device whose invitation row this node does not hold yet, or a member whose
+ *    row is still replicating — indistinguishable here): admit the connection,
+ *    and at the deadline ask again and close it unless the answer is `'admit'`.
+ *
+ * There is no deny: the gate's only denial is the bring-up quiet period, which
+ * is not a judgement of the peer.
  */
-export type InboundConnectionVerdict = 'admit' | 'deny' | 'admit-for-relay';
+export type InboundConnectionVerdict = 'admit' | 'admit-provisionally';
 /**
  * The admission decisions the gate defers to — implemented by
  * `CadreNode.admitInboundControlConnection` /
@@ -239,7 +272,10 @@ export type InboundConnectionVerdict = 'admit' | 'deny' | 'admit-for-relay';
  * composition/fail-open behavior is unit-testable without a full node.
  */
 export interface InboundAdmissionPolicy {
-    /** Verdict on an inbound encrypted connection from this peer. */
+    /**
+     * Verdict on an inbound encrypted connection from this peer. Asked again at a
+     * provisional connection's deadline, so it must answer from current state.
+     */
     admitInbound(remotePeerId: string): Promise<InboundConnectionVerdict> | InboundConnectionVerdict;
     /** Should this peer be granted a circuit-relay reservation slot? */
     admitRelayReservation(remotePeerId: string): Promise<boolean> | boolean;
@@ -304,27 +340,30 @@ export declare class UnauthorizedReservationBudget {
  * membership — this node decides for itself who to talk to.
  *
  * Composition semantics: every hook of `base` is preserved as-is; on the three
- * composed hooks a deny from EITHER the base gater or the admission policy
- * denies. A policy error — or a decision slower than `decisionTimeoutMs` —
- * takes the fail-open outcome (connection admitted / reservation admitted, see
- * module doc); the base gater's verdict is still honored first.
+ * composed hooks a deny from the base gater denies, and so does the quiet
+ * period. The admission policy never denies a connection. A policy error — or a
+ * decision slower than `decisionTimeoutMs` — takes the fail-open outcome
+ * (connection admitted outright / reservation admitted, see module doc); the
+ * base gater's verdict is still honored first.
  *
- * An `'admit-for-relay'` verdict admits the connection and arms a
- * `reserveDeadlineMs` timer against it; the timer is disarmed when a
- * reservation for that peer is ADMITTED at the reservation hook, and closes the
- * underlying `MultiaddrConnection` when it fires first.
+ * An `'admit-provisionally'` verdict admits the connection and arms a
+ * `provisionalDeadlineMs` timer against it. When the timer fires the policy is
+ * asked again, and the underlying `MultiaddrConnection` is closed unless it now
+ * answers `'admit'`; a reservation for that peer ADMITTED at the reservation
+ * hook disarms the timer first.
  *
  * NOTE: `base` is spread, so a gater passed as a CLASS INSTANCE would lose its
  * prototype methods; every caller in this repo (and libp2p's own default)
  * supplies a plain object. If a class-based gater ever shows up, delegate
  * per-hook instead of spreading.
  *
- * Deny timing, as observed by the denied dialer: noise negotiates the muxer in
- * the security handshake's early data, so the DIALER's upgrade may complete
- * (its `dial()` resolves) before this receiver-side hook runs. The deny then
- * aborts the receiver's upgrade — the receiver never registers the connection
- * and never creates its muxer, so no protocol can ever be negotiated — and the
- * dialer sees its "open" connection close moments later.
+ * Deny timing, as observed by the denied dialer (a quiet-period or base-gater
+ * deny): noise negotiates the muxer in the security handshake's early data, so
+ * the DIALER's upgrade may complete (its `dial()` resolves) before this
+ * receiver-side hook runs. The deny then aborts the receiver's upgrade — the
+ * receiver never registers the connection and never creates its muxer, so no
+ * protocol can ever be negotiated — and the dialer sees its "open" connection
+ * close moments later.
  *
  * Control node only: strand cohort nodes legitimately connect cross-party
  * peers, so cadre membership never gates them. An OPEN strand's node receives
@@ -333,7 +372,7 @@ export declare class UnauthorizedReservationBudget {
  * evidence, not this module's membership admission — see
  * `strand-revocation-enforcer.ts`.
  */
-export declare function createMembershipConnectionGater(policy: InboundAdmissionPolicy, base?: ConnectionGater, decisionTimeoutMs?: number, reserveDeadlineMs?: number): ConnectionGater;
+export declare function createMembershipConnectionGater(policy: InboundAdmissionPolicy, base?: ConnectionGater, decisionTimeoutMs?: number, provisionalDeadlineMs?: number): ConnectionGater;
 /**
  * Run one admission decision under `timeoutMs`, resolving to `fallback` (the
  * fail-open outcome) if it has not settled in time — see