@serfab/cadre-core 1.17.0 → 1.19.0

package/dist/cadre-node.d.ts

@@ -28,8 +28,8 @@ import { type ConnectionPathSummary } from './diagnostics/connection-path.js';
  *
  * Ten minutes sits comfortably inside the peerStore's one-hour address expiry
  * (`MAX_ADDRESS_AGE`, see `peer-addr-book.ts`) with headroom for several missed
- * passes, and far above the 15 s reconcile cadence the refresh rides on, so the
- * strand-addr RPC fan-out stays cheap.
+ * passes, and far above the reconcile pass's 2-minute backstop the refresh rides
+ * on, so the strand-addr RPC fan-out stays cheap.
  */
 export declare const STRAND_PEER_ADDR_REFRESH_MS: number;
 /**
@@ -38,8 +38,9 @@ export declare const STRAND_PEER_ADDR_REFRESH_MS: number;
  * phone asking before its `CadrePeer` row has replicated to the sibling is refused
  * and its delegate grant goes unrecorded, and waiting the full
  * {@link STRAND_PEER_ADDR_REFRESH_MS} for the next try is the delay this bounds.
- * Four reconcile ticks, so a sibling that keeps failing costs one timed-out RPC a
- * minute rather than one a tick.
+ * A pass arms its own wake for the earliest due time it leaves behind
+ * (`nextReconcileWakeMs`), so a sibling that keeps failing costs one timed-out
+ * RPC a minute, with no pass in between.
  */
 export declare const STRAND_PEER_ADDR_RETRY_MS: number;
 /**
@@ -240,8 +241,8 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * Cleared by {@link cleanup} only, deliberately NOT by {@link detachStrand}: the watcher's
      * filter rejection stops a replica through that very method, and forgetting the id there
-     * would have the next poll find it unknown again, re-admit the strand provisionally and
-     * relaunch the replica — once every other poll, forever. A strand id's sApp never changes,
+     * would have the next watcher run find it unknown again, re-admit the strand provisionally
+     * and relaunch the replica — on every other run, forever. A strand id's sApp never changes,
      * and the map is bounded by the strands this party has published, like
      * {@link discoveredStrands}.
      */
@@ -269,19 +270,24 @@ export declare class CadreNode implements SAppIdLookup {
      * wait that ends in mutual denial (the upstream gate is fail-closed on
      * timeout, unlike the fail-open connection gater). Optimystic's predicate is
      * synchronous by contract. So the set is refreshed OUT OF BAND instead — after
-     * start, on every {@link reconcileControlCohort} pass (15s cadence), and
-     * immediately after every LOCAL membership mutation so a just-vouched peer
-     * is admitted without waiting for the timer. That last refresh is AUTOMATIC:
-     * the control database notifies {@link refreshMembershipGate} after every
+     * start, at the head of every {@link reconcileControlCohort} pass, whenever a
+     * membership table changes (the gate watch {@link start} takes through
+     * `ControlDatabase.watchMembershipTables`, which hears a local commit and a change
+     * replicated into this node's storage alike, within a 50 ms window), and immediately
+     * after every LOCAL membership mutation so a just-vouched peer is admitted
+     * before the writer's call returns. That last refresh is AUTOMATIC: the
+     * control database notifies {@link refreshMembershipGate} after every
      * committed `CadrePeer` write (see `ControlDatabase.mutateCadrePeer`), so no
-     * writer has to remember. A change that arrives by REPLICATION is picked up
-     * on the next timed refresh — bounded staleness, acceptable because this gate
-     * is defense in depth: rows an unadmitted peer manages to write are still
-     * disbelieved at read time by the voucher-anchored predicate. For cohort
-     * choice the same window means a member whose row arrived by replication is
-     * left out of this node's control-block cohorts until that refresh.
-     * Optimystic reads the predicate live on every lookup, so replacing this set
-     * is the whole re-evaluation; there is no per-peer reclassify call to make.
+     * writer has to remember. A change this node's storage never hears of — a
+     * machine outside the block's cohort on a party larger than the replication
+     * breadth — is picked up at the pass's 2-minute backstop: bounded staleness,
+     * acceptable because this gate is defense in depth: rows an unadmitted peer
+     * manages to write are still disbelieved at read time by the voucher-anchored
+     * predicate. For cohort choice the same window means a member whose row
+     * arrived by replication is left out of this node's control-block cohorts
+     * until that refresh. Optimystic reads the predicate live on every lookup, so
+     * replacing this set is the whole re-evaluation; there is no per-peer
+     * reclassify call to make.
      */
     private authorizedControlPeers;
     /**
@@ -339,9 +345,9 @@ export declare class CadreNode implements SAppIdLookup {
      * When this node last ANNOUNCED a delegate, keyed `<targetPeerId>\n<strandId>`
      * (the peer announced TO, not the delegate). Throttles
      * {@link refreshDelegateGrants} to once per `DELEGATE_GRANT_TTL_MS / 2` per
-     * (relay, strand) so the 15 s reconcile tick never becomes per-tick RPC
-     * chatter; the launch/resume announce passes record here too. Keys whose
-     * strand is no longer running are pruned on each reconcile pass.
+     * (relay, strand) so a run of change-driven reconcile passes never becomes
+     * per-pass RPC chatter; the launch/resume announce passes record here too.
+     * Keys whose strand is no longer running are pruned on each reconcile pass.
      */
     private readonly delegateAnnounceAt;
     /**
@@ -368,12 +374,13 @@ export declare class CadreNode implements SAppIdLookup {
      * strand, keyed `peerStrandKey(siblingControlPeerId, strandId)` → epoch ms; a
      * missing key is due. Bounds {@link refreshStrandPeerAddrs}'s fan-out per
      * (sibling, strand) rather than per strand, so a sibling that connects after a
-     * pass is asked on the next 15 s tick instead of waiting out a stamp another
-     * sibling's answer set. An answer (even an empty one) makes the sibling due again
-     * in {@link STRAND_PEER_ADDR_REFRESH_MS}; no answer, in
-     * {@link STRAND_PEER_ADDR_RETRY_MS}. Keys whose strand stopped running or whose
-     * sibling is no longer connected are pruned every pass, so a resumed strand and a
-     * reconnected sibling are both asked at once.
+     * pass is asked on the pass its connection starts instead of waiting out a stamp
+     * another sibling's answer set. An answer (even an empty one) makes the sibling
+     * due again in {@link STRAND_PEER_ADDR_REFRESH_MS}; no answer, in
+     * {@link STRAND_PEER_ADDR_RETRY_MS}, and each pass arms its own wake for the
+     * earliest due time it leaves behind (`nextReconcileWakeMs`). Keys whose strand
+     * stopped running or whose sibling is no longer connected are pruned every pass,
+     * so a resumed strand and a reconnected sibling are both asked at once.
      */
     private readonly strandAddrAskDueAt;
     /**
@@ -455,6 +462,18 @@ export declare class CadreNode implements SAppIdLookup {
      * `unpublishStrand` / `forgetJoinedStrand` as {@link formationStrandAddrs} is.
      */
     private readonly pendingMembershipInvites;
+    /**
+     * The party key {@link adoptFormationMembershipInvite} just seated or read, by strand id,
+     * so the launch that follows a join does not read the `StrandPartyKey` row again. Taken
+     * (deleted) by the {@link resolveStrandPartyKey} that uses it, so any later launch reads
+     * the row; dropped by {@link detachStrand}. The joiner's counterpart of the founder's
+     * `StrandConfig.partyMemberPrivateKey`, without the app carrying the secret.
+     *
+     * NOTE: an entry is not dropped when the row is removed, because no `CadreNode` path removes
+     * it; an embedder calling `getControlDatabase().deleteStrandPartyKey` between a join and its
+     * launch would get the deleted key. If a node-level rotation is added, drop the entry there.
+     */
+    private readonly formedPartyKeys;
     /**
      * Invite keys of the membership invitations this process has staged, by
      * {@link adoptFormationMembershipInvite} or from a `JoinSuccess` row
@@ -548,7 +567,7 @@ export declare class CadreNode implements SAppIdLookup {
     private joinedStrandStore;
     /**
      * This session's joined strands: {@link joinedStrandStore} and the party-wide
-     * `JoinedStrand` table, unioned with the control rows each watcher poll, published and
+     * `JoinedStrand` table, unioned with the control rows each watcher run, published and
      * removed by the reconcile pass. Per SESSION, unlike the store — rebuilt at every
      * {@link start}, which is what ends a revoked join's "keep offering until this session
      * ends" (see `JoinedStrandSession.forgetAfterThisSession`).
@@ -579,17 +598,41 @@ export declare class CadreNode implements SAppIdLookup {
     /** Listener that re-publishes the self record when reachable addresses change. */
     private selfPeerUpdateHandler;
     /**
-     * Recurring proactive control-cohort dial cadence (see
-     * {@link reconcileControlCohort}). Wired alongside {@link recordRefreshTimer}
-     * in {@link startRecordRefresh} and torn down symmetrically in
-     * {@link stopRecordRefresh}; `.unref()`'d so it never keeps the loop alive.
-     */
-    private controlCohortReconcileTimer;
-    /**
-     * Single-flight guard for {@link reconcileControlCohort}. The eager start pass,
-     * the recurring interval, and the `self:peer:update` trigger can fire close
-     * together; collapsing concurrent passes into one in-flight run prevents two
-     * passes from double-dialing the same siblings (mirrors {@link registerSelfInFlight}).
+     * The reconcile pass's schedule (see {@link reconcileControlCohort}): single-flight
+     * runs on `table-change-watch.ts`'s rule, with no table subscription of its own — the
+     * gate watch ({@link membershipGateWatch}), the control connection listeners,
+     * `self:peer:update`, and the pass's own wake ({@link armReconcileWake}) `trigger` it,
+     * and its backstop (`network.controlCohort.reconcileMs`, default
+     * `DEFAULT_CONTROL_COHORT_RECONCILE_MS`) runs it when nothing has. Built alongside
+     * {@link recordRefreshTimer} in {@link startRecordRefresh}, about 1 s after start, and
+     * disposed in {@link stopRecordRefresh}; its timers never keep the loop alive.
+     */
+    private controlReconcileRuns;
+    /**
+     * The subscription on the membership tables (`ControlDatabase.watchMembershipTables`) that
+     * re-materializes the membership gate and triggers {@link controlReconcileRuns} on every
+     * change ({@link onMembershipGateTablesChanged}).
+     * Taken in {@link start} right after the membership listener is wired, disposed in
+     * {@link cleanup} before the control database closes.
+     */
+    private membershipGateWatch;
+    /** The second membership-view drop after a sibling connects ({@link armMembershipViewReload}); cleared in {@link stopRecordRefresh}. */
+    private membershipViewReloadTimer;
+    /**
+     * Consecutive passes whose dial of a selected sibling or a cold-start bootstrap peer
+     * failed (`ControlCohortPassOutcome.unconnected`), for the redial ladder
+     * ({@link armReconcileWake}); 0 after a pass none of whose dials did. Per session:
+     * reset in {@link stopRecordRefresh}.
+     */
+    private reconcileRedialStreak;
+    /** Peers a {@link redialClaimedNode} loop is running for, so a repeated claim starts no second one. */
+    private readonly claimRedialPeers;
+    /**
+     * Single-flight guard for {@link reconcileControlCohort}. An explicit call, the
+     * `self:peer:update` trigger and a scheduled run can fire close together; collapsing
+     * concurrent passes into one in-flight run prevents two passes from double-dialing the
+     * same siblings (mirrors {@link registerSelfInFlight}). A scheduled run waits for this
+     * pass and then starts its own rather than joining it.
      */
     private reconcileControlCohortInFlight;
     /**
@@ -612,18 +655,26 @@ export declare class CadreNode implements SAppIdLookup {
      * machine in the party is already discarding this node's address as stale.
      */
     private lastSelfRecordPublishAt;
+    /**
+     * The newest record this process signed for its own `CadrePeer` row: written by either path
+     * of {@link publishSelfRecord}, or handed to a member to write by {@link redeemCadreInvitation}.
+     * What {@link publishSelfRecordUnlessCurrent} compares the row against. Per session, cleared
+     * with {@link lastSelfRecordPublishAt}: a row carried over from an earlier process is never
+     * taken as current.
+     */
+    private lastSignedSelfRecord;
     /** Say-once latch for {@link escalateIfSelfRecordStale}; re-armed by the next publish. */
     private selfRecordStaleWarned;
     /**
      * Re-replication queue for owner `authorizePeer` writes that committed while
-     * this node was alone — `controlNode.getConnections().length === 0` at write
-     * time means the Optimystic commit was local-only (the block's cluster was ≤1)
-     * and never broadcast. Maps the affected subject peerId → 'authorize', to
+     * this node was alone ({@link committedAlone}) — the Optimystic commit was
+     * local-only (the block's cohort was this node) and never broadcast. Maps the
+     * affected subject peerId → 'authorize', to
      * re-issue once the cohort grows. Removals are NOT tracked here — a delete
      * leaves a `Revocation` tombstone, tracked by {@link pendingRevocations}; a
      * removePeer also clears any queued authorize for the same subject (the row is
-     * gone, so re-issuing the insert would be wrong). Drained on the 0→≥1
-     * control-connection transition by {@link drainPendingControlReplication}.
+     * gone, so re-issuing the insert would be wrong). Drained when a sibling becomes
+     * reachable ({@link updateControlSiblingReachability}) by {@link drainPendingControlReplication}.
      */
     private pendingPeerWrites;
     /**
@@ -647,14 +698,6 @@ export declare class CadreNode implements SAppIdLookup {
      * exactly a "removals from before this lifetime" case).
      */
     private reissuedHeldRevocations;
-    /**
-     * Whether this process has seen the singleton `Revocation` ledger marker filed — its own
-     * `'opened'` or an `'already-open'` answer, in {@link openRevocationLedgerIfDue}. A
-     * record of work done, not a cached authorization answer: the marker can never be
-     * deleted (`NoDelete`), so this can only go stale if the database itself is replaced,
-     * which is why stop() clears it with the other per-process replication state.
-     */
-    private revocationLedgerOpened;
     /** This node's own `CadrePeer` self-write committed local-only (re-touched on growth). */
     private pendingSelfPeerWrite;
     /** This node's own `DeviceToken` self-write committed local-only (re-touched on growth). */
@@ -669,14 +712,24 @@ export declare class CadreNode implements SAppIdLookup {
     /** Single-flight guard for the re-replication drain (mirrors {@link registerSelfInFlight}). */
     private drainControlReplicationInFlight;
     /**
-     * Tracks the control-connection presence edge so the drain fires only on the
-     * 0→≥1 transition (the earliest point a re-issue can broadcast), not on every
-     * subsequent `connection:open`. Re-armed to false once connections return to 0.
+     * Connected control peers whose identify says they serve the control database
+     * ({@link onControlPeerIdentified}): the peers Optimystic can count into a control block's
+     * cohort, before its membership check. A peer joins on its first `peer:identify` of a
+     * connected period, not on `connection:open`: until it identifies, every control block's
+     * cohort is this node alone. It leaves when its last connection closes. Read through
+     * {@link hasReachableControlSibling}, which applies the membership check.
+     */
+    private readonly identifiedControlPeers;
+    /**
+     * {@link hasReachableControlSibling} at its last evaluation, so the drain fires on the
+     * false→true edge only (the earliest point a re-issue reaches the cohort), not on every later
+     * identify. Re-armed to false when no reachable sibling remains
+     * ({@link updateControlSiblingReachability}).
      */
-    private hasControlConnection;
-    /** `connection:open` listener driving the growth-triggered drain (teardown in {@link stopRecordRefresh}). */
-    private controlConnectionOpenHandler;
-    /** `connection:close` listener re-arming the growth edge (teardown in {@link stopRecordRefresh}). */
+    private controlSiblingReachable;
+    /** `peer:identify` listener: {@link onControlPeerIdentified} (teardown in {@link stopRecordRefresh}). */
+    private controlPeerIdentifyHandler;
+    /** `connection:close` listener: {@link onControlConnectionClosed} (teardown in {@link stopRecordRefresh}). */
     private controlConnectionCloseHandler;
     constructor(config: CadreNodeConfig);
     /**
@@ -1002,8 +1055,8 @@ export declare class CadreNode implements SAppIdLookup {
     private controlNetworkName;
     /**
      * Arm the CONTROL network's peer-join block catch-up: push every block in the
-     * control database's own raw store to each newly connected AUTHORIZED member
-     * this runtime has not yet caught up. This is what physically replicates
+     * control database's own raw store to each AUTHORIZED member on each
+     * (re)connection, skipping what it is known to hold. This is what physically replicates
      * control blocks committed while the writer was alone — the named
      * collection-header blocks written once at genesis above all, whose revision
      * never moves again, so no later commit ever carries them to a member that
@@ -1012,7 +1065,9 @@ export declare class CadreNode implements SAppIdLookup {
      * for peers it knew about before the restart).
      *
      * Unlike the per-strand instances (see `strand-instance-manager.ts`), pushes
-     * are gated on {@link isAuthorizedMember}, judged at push time: the control
+     * are gated on the authorized-member snapshot ({@link authorizedControlPeers},
+     * which {@link refreshAuthorizedControlPeers} materializes from the same rows and
+     * rule {@link isAuthorizedMember} queries), judged at push time: the control
      * network's inbound connection gate deliberately admits non-members in
      * several states (seed delivery to an un-enrolled node, an open enrollment
      * window, an outstanding invitation, configured bootstrap/relay peers), and
@@ -1028,9 +1083,9 @@ export declare class CadreNode implements SAppIdLookup {
      * The one non-member the gate admits is a device whose invitation
      * redemption this member is admitting ({@link admitRedeemingDevice}).
      *
-     * No-ops (logged) when the embedder configured no control storage or the
-     * node exposes no key network — the backfill would have nothing to read or
-     * no way to dial.
+     * No-ops (logged) when {@link controlBackfillStorage} answers nothing (disabled,
+     * or no control storage configured) or the node exposes no key network — the
+     * backfill would have nothing to read or no way to dial.
      */
     private startControlBackfill;
     /**
@@ -1070,6 +1125,17 @@ export declare class CadreNode implements SAppIdLookup {
      * operation count.
      */
     private resolveControlStorage;
+    /**
+     * The store the control network's peer-join block catch-up reads, or `undefined` when this
+     * runtime does not arm it: `controlBackfill.enabled: false`, or no control storage. Both of
+     * its readers ask here so they cannot disagree: {@link startControlBackfill} arms on it, and
+     * {@link buildControlNodeOptions} turns Optimystic's rebalance reaction off on it.
+     *
+     * Through the resolver, not the {@link controlStorage} memo field: the resolver is
+     * idempotent, so the catch-up cannot be silently disarmed by a future reordering that moves
+     * a read ahead of the one that populated the field.
+     */
+    private controlBackfillStorage;
     /**
      * Warn the operator when `network.announceAddrs` will silently cost this node the
      * relay reachability it also configured.
@@ -1169,8 +1235,8 @@ export declare class CadreNode implements SAppIdLookup {
      * (it redeems here by seating the row from its bundle, after which check 7
      * admits) or from a sibling whose membership row is still replicating (check 5
      * admits once it lands; if it has not landed by the deadline, the connection
-     * is closed and either side's next reconcile dial re-forms it, since outbound
-     * dials are never gated). The protocol guard refuses all of them every
+     * is closed and the reconcile pass the close starts on either side re-forms it,
+     * since outbound dials are never gated). The protocol guard refuses all of them every
      * members-only protocol meanwhile. A circuit-relay reservation admitted by
      * {@link admitControlRelayReservation} disarms the deadline (see
      * `membership-connection-gater.ts` → "The relay-reservation seam").
@@ -1318,6 +1384,15 @@ export declare class CadreNode implements SAppIdLookup {
      * needs a key-based admission.
      */
     private isControlNetworkMember;
+    /**
+     * Whether this node sends control writes to `remotePeerId`: Optimystic's `isNetworkMember`
+     * for the control node (cohort and coordinator choice), and the membership half of
+     * {@link hasReachableControlSibling}. The stream gate's rule ({@link isControlNetworkMember}),
+     * unlogged, because Optimystic asks several times per peer per cohort assembly and counts
+     * refusals on its own debug line; plus a device whose verified redemption is being written
+     * ({@link admittingDevices}), which must hold the rows that admit it.
+     */
+    private isControlCohortMember;
     /**
      * Per-stream authorization for the protocol guard's `members-snapshot` class
      * (`control-protocol-guard.ts`): the four Optimystic control-DB protocols
@@ -1345,7 +1420,8 @@ export declare class CadreNode implements SAppIdLookup {
      * this listener with its write lock HELD (`notifyMembershipChanged`), so a retrying
      * read here would sleep its backoff holding the lock and stall every other local
      * writer. Nothing is lost — this refresh already keeps the previous snapshot on
-     * failure and is re-driven by the next membership write and by the timed reconcile.
+     * failure and is re-driven by the next membership change (local or replicated, through
+     * the gate watch) and by the reconcile pass's backstop.
      *
      * The trusted-owner anchor sync ({@link syncOwnerAnchor}) runs FIRST, so the snapshot
      * built here judges `CadrePeer` rows against the anchor as the `OwnerKey` table now
@@ -1407,9 +1483,10 @@ export declare class CadreNode implements SAppIdLookup {
      */
     private getBootstrapPeerIds;
     /**
-     * What the strand watcher polls: this party's control rows plus a row per cross-party
+     * What the strand watcher reads: this party's control rows plus a row per cross-party
      * join (see {@link joinedStrands}), so a joined strand is offered and relaunched on
-     * the same path as the party's own.
+     * the same path as the party's own. It runs on a change to either table; the
+     * machine-local joins wake it through {@link JoinedStrandSession}'s change callback.
      */
     private createStrandQueryable;
     /**
@@ -1448,6 +1525,10 @@ export declare class CadreNode implements SAppIdLookup {
      * after start (non-blocking). {@link registerSelf} is idempotent and safely
      * no-ops when it cannot yet sign/insert (e.g. owner key not installed),
      * so the timer is harmless even when registration only becomes possible later.
+     * A record this process already put in place that is still current (a founding owner's
+     * explicit publish, a redeemed invitation's admission, a restart's first-growth re-touch) is
+     * not written again ({@link publishSelfRecordUnlessCurrent}). Whether the node is connected
+     * yet does not matter: a device that redeems within a second of starting is.
      */
     private scheduleSelfRegistration;
     /**
@@ -1479,11 +1560,42 @@ export declare class CadreNode implements SAppIdLookup {
     /** The body of {@link registerSelf}; serialised by its single-flight guard. */
     private publishSelfRecord;
     /**
-     * Record that this node's own address record just landed, and re-arm the stale-record
-     * warning. Called from BOTH publishing paths of {@link publishSelfRecord} and nowhere
-     * else — a `skipped` publish wrote nothing, so it must not refresh the stamp.
+     * Bookkeeping for a committed write of this node's own `CadrePeer` row by {@link publishSelfRecord}:
+     * `record` is the one the row holds (for the update path, the one its body signed on the
+     * attempt that committed, not the first it signed). Queued for the drain's re-touch
+     * ({@link pendingSelfPeerWrite}) when no sibling was reachable when the write started or when
+     * it ended: a sibling that identifies while the write is out may do so after the write's cohort
+     * was chosen, and the first-growth drain skips a row holding {@link lastSignedSelfRecord} unless
+     * this flag is set. Both fields are set here together so no write can leave the record without
+     * the flag.
+     */
+    private noteSelfPeerWritten;
+    /**
+     * Record that this node's own address record is in place as of `at`, and re-arm the
+     * stale-record warning. Called for BOTH publishing paths of {@link publishSelfRecord}
+     * ({@link noteSelfPeerWritten}), and by {@link publishSelfRecordUnlessCurrent} with the stamp
+     * of a record already in place — a `skipped` publish wrote nothing and found nothing, so it
+     * must not refresh the stamp.
      */
     private noteSelfRecordPublished;
+    /**
+     * {@link registerSelf}, unless the own row already holds the record this process last signed
+     * ({@link lastSignedSelfRecord}) and that record is current ({@link isCurrentSelfRecord});
+     * then nothing is written and the record counts as published at its own stamp. For a publish
+     * that puts a record in place (the boot timer, the reconcile pass's first publish, the
+     * first-growth drain), never the heartbeat, which exists to re-stamp freshness. `'current'`
+     * is this method's own answer; {@link registerSelf} always writes.
+     */
+    private publishSelfRecordUnlessCurrent;
+    /**
+     * Is `record` still the one to publish: signed less than half a heartbeat ago, with this
+     * node's profile, over the addresses it would publish now, and the signature the own row
+     * holds? The age bound keeps a record that is not re-written fresh for resolvers: at most half
+     * a heartbeat old here and re-stamped by the heartbeat within one more, so never older than
+     * 1.5 heartbeats (11.25 min) against {@link DEFAULT_PEER_RECORD_MAX_AGE_MS}. Cheap checks
+     * first: the row comes from the membership view, the addresses from the app's resolver.
+     */
+    private isCurrentSelfRecord;
     /**
      * Report an abandoned control write to the embedding app.
      *
@@ -1570,12 +1682,17 @@ export declare class CadreNode implements SAppIdLookup {
      * process does not learn it was removed ({@link noteOwnRemoval}), and pays that read on every
      * pass.
      *
-     * Connected-only: a row written elsewhere arrives over a connection, and an owner's publish
-     * committed alone is local-only and forks its own history — a restarted owner whose embedder
-     * runs a pass before it reconnects would write its row on the stale side of the fork, and
-     * then never see rows written while it was down (`cadre-invite-any-member` runs that pass and
-     * fails every time without this condition). The boot-time publish and the first-growth drain already try at the node's lone and
-     * first-connection moments; this retries on the passes after.
+     * Only while a sibling is reachable ({@link hasReachableControlSibling}): a row written
+     * elsewhere arrives from a sibling, and an owner's publish committed alone is local-only and
+     * forks its own history — a restarted owner whose embedder runs a pass before it reconnects
+     * would write its row on the stale side of the fork, and then never see rows written while it
+     * was down (`cadre-invite-any-member` runs that pass and fails every time without this
+     * condition). A connection is not enough: until the sibling identifies, the write's cohort is
+     * this node alone. The boot-time publish and the first-growth drain already try at the
+     * node's lone and first-sibling moments; this retries on the passes after.
+     *
+     * A machine admitted by invitation finds its row already holding the record its redemption
+     * carried, and writes nothing ({@link publishSelfRecordUnlessCurrent}).
      */
     private publishFirstSelfRecord;
     /**
@@ -1592,7 +1709,21 @@ export declare class CadreNode implements SAppIdLookup {
      * stack listeners/timers.
      */
     private startRecordRefresh;
-    /** Tear down the self-record refresh timers + listener (see {@link cleanup}). */
+    /** The reconcile schedule's backstop: `network.controlCohort.reconcileMs`, default `DEFAULT_CONTROL_COHORT_RECONCILE_MS`. */
+    private controlReconcileBackstopMs;
+    /**
+     * The gate watch's run ({@link membershipGateWatch}): re-materialize the gate, so a
+     * replicated revocation hangs up the removed machine now (`hangUpRevokedControlPeers`
+     * ends every refresh), then start a reconcile pass for whatever else the change means
+     * (a new sibling to dial, a tombstoned row to reap). A local membership write refreshes
+     * the gate twice — once from the awaited membership listener, so the writer sees its
+     * change before returning, and once here, 50 ms later. The listener's refresh runs under
+     * the write lock, so its reads take the committed-read path and the view keeps nothing
+     * from them; this refresh is the read that refills the view after the write, which some
+     * later caller would otherwise pay. Accepted: one reload per change, not two.
+     */
+    private onMembershipGateTablesChanged;
+    /** Tear down the self-record refresh timers, the reconcile schedule and the listeners (see {@link cleanup}). */
     private stopRecordRefresh;
     /**
      * Resolve a peer's current, signed, trust-checkable multiaddrs from only its
@@ -1666,37 +1797,49 @@ export declare class CadreNode implements SAppIdLookup {
      * Run one proactive control-cohort dial pass to keep this node connected to its
      * cadre siblings (so the `CadreControl` collections form a replicating cohort).
      * Public so the cohort-growth-driven re-replication path
-     * (`control-write-ensure-replicated`) and tests can trigger a pass on demand;
-     * normally driven by the eager start pass, the recurring interval, and
-     * `self:peer:update` (all wired in {@link startRecordRefresh}).
+     * (`control-write-ensure-replicated`), `addDrone`'s callers, `claimNode`,
+     * `redeemCadreInvitation` and tests can run a pass on demand. On its own a pass
+     * runs when something it acts on changes, and otherwise at a backstop
+     * ({@link controlReconcileRuns}): once after start; on `self:peer:update`; when a
+     * membership table changes, local commit or replicated ({@link membershipGateWatch});
+     * when a control connection to an authorized sibling opens or closes
+     * ({@link onControlSiblingConnectionChange}); on the redial and strand-address wakes
+     * a pass arms for itself ({@link armReconcileWake}); and at the backstop,
+     * `network.controlCohort.reconcileMs` (default `DEFAULT_CONTROL_COHORT_RECONCILE_MS`,
+     * 2 minutes) after the last pass settled. A connection to a relay, a bootstrap node or
+     * another party's machine starts no pass: the pass acts on none of them, beyond
+     * counting them as "connected" for its write steps, which therefore run at the next
+     * membership change or backstop on a one-machine party whose only connection is a
+     * relay.
      *
      * Concurrent triggers collapse into a single in-flight pass
      * (see {@link reconcileControlCohortInFlight}) so two passes never double-dial;
-     * a call that joins an in-flight pass resolves to THAT pass's result.
+     * a call that joins an in-flight pass resolves to THAT pass's result (a scheduled
+     * run waits for it instead, so the change that woke the run is seen).
      * Best-effort throughout: a failure to resolve/dial any one sibling is logged
      * and the pass continues; the whole pass is a no-op when the node is alone.
      *
      * Resolves to the peers the pass dialled ({@link ControlCohortReconcileResult}),
      * so a caller can tell a link this pass opened from one something else opened —
-     * the pass skips a peer that is already connected. The timer and event triggers
-     * discard it.
+     * the pass skips a peer that is already connected. The scheduled runs discard it.
      */
     reconcileControlCohort(): Promise<ControlCohortReconcileResult>;
+    /** One pass, then the wake it earns ({@link armReconcileWake}); the public result is the pass's `dialed`. */
+    private runReconcileControlCohortAndArmWake;
+    /**
+     * After every pass, explicit or scheduled: advance or reset the redial streak and
+     * `trigger` the schedule for the earliest of the pass's own reasons to run again
+     * (`nextReconcileWakeMs`): a redial for a sibling or bootstrap peer it left
+     * unconnected, or a strand-address ask falling due before the backstop. Nothing else
+     * the pass does needs a wake sooner than the backstop: delegate grants re-announce
+     * every 15 minutes inside a 30-minute TTL, the FRET and formation address re-merges
+     * guard a one-hour expiry, and the self record has its own heartbeat. A pass that
+     * runs before the schedule exists (an explicit call during the first second after
+     * start) still counts for the streak.
+     */
+    private armReconcileWake;
     /** Body of {@link reconcileControlCohort}; serialised by its single-flight guard. */
     private runReconcileControlCohort;
-    /**
-     * The owner-only half of the reconcile pass's ledger-marker step: file the singleton
-     * `Revocation` marker ({@link SeedBootstrapService.openRevocationLedger}) unless this
-     * process has already seen it filed. The connectivity gate is the caller's
-     * ({@link runReconcileControlCohort}); why the marker exists is on
-     * {@link ControlDatabase.openRevocationLedger}.
-     *
-     * Sets {@link revocationLedgerOpened} on `'opened'` or `'already-open'`. A node that
-     * cannot sign as an owner does nothing: it picks the owner's marker up the first time it
-     * reads the table, like any other replicated row. Best-effort like every step of the
-     * pass — a failure is logged and leaves the flag clear, so the next connected pass retries.
-     */
-    private openRevocationLedgerIfDue;
     /**
      * Resolve every sibling's signed address record once and merge what resolves
      * into the control node's libp2p **address book** (peerStore). Returns the
@@ -1720,8 +1863,9 @@ export declare class CadreNode implements SAppIdLookup {
      * current ({@link refreshDialHint}).
      *
      * NOTE: this resolves EVERY sibling serially before the dial loop below runs,
-     * so it costs one record query per sibling per reconcile pass (~15s) and each
-     * one delays the pass's first dial. A cadre is a handful of devices, so today
+     * so it costs one record query per sibling per reconcile pass (served from the
+     * membership rows view while it is current) and each one delays the pass's first
+     * dial. A cadre is a handful of devices, so today
      * that is a few extra local reads; if cadres ever grow large, batch the records
      * into one query, merge only on change, or move the warm pass after the dials.
      */
@@ -1783,16 +1927,18 @@ export declare class CadreNode implements SAppIdLookup {
      */
     private collectSiblingStrandAddrs;
     /**
-     * Dial one sibling from its already-resolved addresses, best-effort. Returns
-     * whether the dial resolved (false when no address resolves or the dial fails).
+     * Dial one sibling from its already-resolved addresses, best-effort.
      *
      * A per-peer failure (NAT, offline, relay down, connection-gater denial, or
      * the {@link controlDialBudget} expiring) is logged and swallowed so one
      * unreachable sibling never aborts the pass — exactly like
      * {@link SeedBootstrapService.applySeed}'s owner-dial loop. A failed dial is
-     * simply retried on the next pass. A sibling whose every address relays
-     * through this node ({@link SelfRelayOnlyError}) is not dialed at all and gets
-     * a one-line log instead: only the sibling can reconnect.
+     * retried on the pass's redial ladder ({@link armReconcileWake}: 15 s, 30 s, 60 s,
+     * then every backstop) and on any pass a change starts sooner. A sibling with no
+     * dialable address, or whose every address relays through this node
+     * ({@link SelfRelayOnlyError}), is not dialed at all and is `undialable`: it gets a
+     * one-line log and no redial, since only a change — its record replicating in, or
+     * the sibling connecting — can make it dialable, and each of those starts a pass.
      */
     private dialControlSibling;
     /**
@@ -1836,7 +1982,7 @@ export declare class CadreNode implements SAppIdLookup {
      * These addresses are never merged into the libp2p address book: they are
      * unverified, and the address book takes only verified ones (see
      * `mergePeerAddrs`). Layers that dial by bare peer id use the connection this
-     * dial opens, and after it drops the next reconcile pass dials again.
+     * dial opens, and after it drops the reconcile pass the close starts dials again.
      *
      * NOTE: an entry is consulted here only for a current sibling, so a peer revoked
      * by another owner is not dialed from it, even though the entry stays (only this
@@ -1870,8 +2016,7 @@ export declare class CadreNode implements SAppIdLookup {
      * Called for every seed this node accepts, on BOTH intake paths — the
      * {@link applySeed} wrapper (which may run on a throwaway service, so the
      * service itself is the wrong place to keep this) and the inbound
-     * `/sereus/seed/1.0.0` handler via `onSeedApplied`. Peers with no address are
-     * skipped: there is nothing to dial.
+     * `/sereus/seed/1.0.0` handler via `onSeedApplied`.
      *
      * `preferred` is the seed's own claim about its peers, exactly as
      * `SeedBootstrapService.applySeed` uses it to choose its dial targets. That is
@@ -1879,7 +2024,8 @@ export declare class CadreNode implements SAppIdLookup {
      * signature-checked against a trust-anchored signer before this runs, and the
      * flag only *selects a dial target*; a dial grants no authority.
      *
-     * Addressless peers and self are skipped by {@link retainDialTarget}.
+     * The peers retained are `seedDialTargets` (addressless peers and self dropped), the same
+     * ones the service dials; they are returned for the `seed:applied` payload.
      */
     private recordSeedBootstrapPeers;
     /**
@@ -1894,9 +2040,8 @@ export declare class CadreNode implements SAppIdLookup {
      * failing a seed or an add that has already been accepted.
      *
      * Two peers are never retained. One with no address: there is nothing to dial.
-     * And self: `createSeed` projects EVERY `CadrePeer` row, so an owner that applies
-     * a seed minted after it joined finds itself in the owner list, and `addDrone`
-     * could be handed this node's own id. Retaining self would make the cold-start
+     * And self: `addDrone` could be handed this node's own id (seed intake arrives
+     * already filtered by `seedDialTargets`). Retaining self would make the cold-start
      * pass dial this node forever (the steady-state pass filters self out of its
      * sibling list for the same reason).
      */
@@ -1914,15 +2059,16 @@ export declare class CadreNode implements SAppIdLookup {
      * help: it dials only siblings enumerated from that very table. Retrying here
      * is the only way back in.
      *
-     * Unbounded, at the reconcile cadence, with no backoff: the branch is already
-     * gated by "the control database has no siblings", so it stops the moment the
-     * node is actually in the party, and a node that is stranded MUST keep trying —
-     * a give-up rule would turn a transient outage into a permanent one. The steady
-     * cost is one dial per bootstrap peer per pass (a seed prefers its minter and the
-     * party's always-on machines, a few at most), each failing fast against an
-     * unreachable address.
-     * NOTE: if seeds ever carry many preferred peers, or the reconcile cadence tightens
-     * well below its 15 s default, add per-peer backoff here.
+     * Unbounded: the branch is already gated by "the control database has no
+     * siblings", so it stops the moment the node is actually in the party, and a node
+     * that is stranded MUST keep trying — a give-up rule would turn a transient outage
+     * into a permanent one. A failed dial earns the pass a redial wake on the ladder
+     * {@link armReconcileWake} runs (15 s, 30 s, 60 s, then every backstop, 2 minutes
+     * by default), so the steady cost is one dial per bootstrap peer per backstop (a
+     * seed prefers its minter and the party's always-on machines, a few at most), each
+     * failing fast against an unreachable address.
+     * NOTE: the ladder is per pass, not per peer; if seeds ever carry many preferred
+     * peers, add per-peer backoff here.
      *
      * Best-effort per peer, exactly like {@link dialControlSibling}: one dead
      * address never aborts the pass.
@@ -1941,20 +2087,26 @@ export declare class CadreNode implements SAppIdLookup {
      * encapsulated; an unencapsulatable one is dropped rather than dialed bare.
      */
     private bootstrapDialAddrs;
-    /** Dial one cold-start bootstrap peer, best-effort. Returns whether it connected. */
+    /**
+     * Dial one peer from its retained dial target's addresses, best-effort: a cold-start bootstrap
+     * peer, or a just-claimed node ({@link redialClaimedNode}), which `context` names in the logs.
+     * Returns whether it connected.
+     */
     private dialBootstrapPeer;
     /**
-     * Whether a control write happening now would commit local-only. A sound lower
-     * bound is "no connected control peers": 0 connections ⇒ the block's cluster is
-     * ≤1 ⇒ Optimystic commits without broadcasting. This is the pragmatic proxy for
-     * the precise signal (the block's `getClusterSize`); it over-approximates safely
-     * — a connected-but-not-in-this-block's-cluster write may still be local-only and
-     * is caught by the cohort's periodic pull-on-read instead. Re-issuing an already-
-     * replicated row is harmless (an idempotent monotonic bump), so the coarse proxy
-     * is acceptable as the agreed first cut.
+     * Whether a control write happening now would commit local-only: no sibling is reachable
+     * ({@link hasReachableControlSibling}, the public form, so the two cannot drift). A relay, a
+     * bootstrap node or a peer that has not identified yet holds a connection without being in the
+     * write's cohort, so a write made with only those connected is queued too. One made alone at
+     * the revision the cohort reached meanwhile is a fork no later consult sees, because a consult
+     * compares revision numbers only; the re-issue on the growth edge is what conflicts with the
+     * cohort's copy and pulls it in.
      *
-     * Reads {@link getControlConnectionCount} — the public, embedder-facing form of
-     * the same sample — so the two cannot drift.
+     * Still a proxy for the precise signal (the block's own cohort): a reachable sibling outside
+     * this block's cohort leaves the write local-only, caught by the cohort's pull-on-read. On the
+     * control network every block's cohort is the whole party, so that gap is a party larger than
+     * `CONTROL_REPLICATION_BREADTH`. Re-issuing a replicated row is harmless (an idempotent
+     * monotonic bump).
      */
     private committedAlone;
     /**
@@ -1984,7 +2136,7 @@ export declare class CadreNode implements SAppIdLookup {
     /**
      * Drain the write-while-alone re-replication queue: re-issue the writes that
      * committed local-only now that the cohort can broadcast them. Public so the
-     * 0→≥1 growth trigger ({@link handleControlConnectionChange}) and tests can drive
+     * growth trigger ({@link updateControlSiblingReachability}) and tests can drive
      * it; concurrent calls collapse into one in-flight drain
      * ({@link drainControlReplicationInFlight}) so two growth signals never
      * double-issue. Best-effort throughout — a per-row failure leaves that entry
@@ -2053,8 +2205,11 @@ export declare class CadreNode implements SAppIdLookup {
     private reconstructAuthoredMembership;
     /**
      * Body of {@link reconstructAuthoredMembership}'s sweep: re-issue each candidate
-     * owner-authored row, returning how many were re-touched. A per-row failure is
-     * logged and skipped; a teardown mid-sweep stops it.
+     * owner-authored row, returning how many were re-touched. A row the sweep already holds as
+     * self-published is skipped without a call; the re-touch itself decides again over the row
+     * it reads under the lock, so a row that vanished or was self-published since the sweep's
+     * read is reported, not written. A per-row failure is logged and skipped; a teardown
+     * mid-sweep stops it.
      */
     private reissueAuthoredMembershipRows;
     /**
@@ -2070,9 +2225,10 @@ export declare class CadreNode implements SAppIdLookup {
      */
     private drainPendingPeerWrites;
     /**
-     * Body of {@link drainPendingPeerWrites}' loop. An entry is cleared only on
-     * success (or when there is nothing left to re-issue); a failure is logged and
-     * the entry stays queued for the next cohort growth.
+     * Body of {@link drainPendingPeerWrites}' loop. An entry is cleared on every outcome the
+     * re-touch reports — re-touched, or nothing left to re-issue because the row was removed
+     * since or the peer self-published; the re-touch decides which over the row it reads under
+     * the lock. A failure is logged and the entry stays queued for the next cohort growth.
      */
     private reissuePendingPeerWrites;
     /**
@@ -2080,23 +2236,84 @@ export declare class CadreNode implements SAppIdLookup {
      * `UpdatedAt` strictly above the stored value (and the wall clock) and re-sign via
      * the owner branch of `CadrePeer.AuthorizedUpdate`. The row already exists
      * locally (it committed there, just local-only), so this is an UPDATE, not the
-     * original INSERT.
+     * original INSERT. The bump, and whether the row is still the owner's to re-issue, are
+     * decided over the row as read inside the write ({@link SeedBootstrapService.reauthorizePeer}'s
+     * re-broadcast mode).
      */
     private reissuePeerAuthorize;
     /**
-     * On a control connection opening, detect the 0→≥1 transition and drain the
-     * write-while-alone re-replication queue (single-flight; fires only on the edge,
-     * not on every subsequent `connection:open`). Best-effort — a drain failure is
-     * logged, not thrown.
-     */
-    private handleControlConnectionChange;
-    /** Re-arm the growth edge once all control connections drop, so a later reconnect re-drains. */
-    private handleControlConnectionClose;
-    /**
-     * Wire the control-connection growth listeners that drive write-while-alone
-     * re-replication. Wired in {@link start} (not the delayed refresh path) so no
-     * early `connection:open` is missed; torn down in {@link stopRecordRefresh}.
-     * Idempotent.
+     * Re-evaluate {@link hasReachableControlSibling} and act on its edges: on false→true, drain
+     * the write-while-alone re-replication queue (single-flight; best-effort, a drain failure is
+     * logged, not thrown); on true→false, re-arm, so the next reachable sibling drains again.
+     * Called when a peer identifies, when a connection closes, and after every membership refresh,
+     * where a sibling that connected before this node authorized it (the production join order)
+     * becomes reachable. A device counted in for its admission ({@link admittingDevices}) is not
+     * a trigger: the admission's own writes are in flight, and its row landing refreshes
+     * membership.
+     */
+    private updateControlSiblingReachability;
+    /**
+     * A connected peer identified as serving the control database: count it
+     * ({@link identifiedControlPeers}), re-evaluate the growth edge, and run the sibling-open
+     * reactions, once per connected period. libp2p re-emits `peer:identify` on every
+     * identify-push from a connected peer, and those repeats start nothing.
+     */
+    private onControlPeerIdentified;
+    /**
+     * A control connection closed: `remotePeer` stops counting once it has none left, and the
+     * growth edge re-arms if no reachable sibling remains. The sibling-close reaction runs on every
+     * close. libp2p's connection manager drops the closed connection from `getConnections` before
+     * this listener runs: libp2p dispatches each event on its internal bus, where the connection
+     * manager listens, before re-dispatching it to the node's own listeners.
+     */
+    private onControlConnectionClosed;
+    /**
+     * Count the peers that identified before {@link wireControlConnectionListeners} ran, whose
+     * `peer:identify` has already fired, from their peer-store records. Updates the growth edge
+     * but runs no sibling-open reaction, as a connection that predates the listeners never did. A
+     * peer not yet in the peer store is still identifying, and its own event counts it.
+     */
+    private noteIdentifiedControlPeers;
+    /**
+     * An AUTHORIZED sibling became reachable (its identify, once per connected period:
+     * {@link onControlPeerIdentified}) or one of its connections closed: start a reconcile
+     * pass. On open the pass asks the new sibling for strand addresses and re-arms the
+     * delegate grants; on close it re-dials. First, on open, drop the membership rows
+     * views: a machine that was offline while a sibling committed learns of the commit
+     * only when it next reads the block from storage, and dropping the views makes the
+     * pass's reads do that now rather than after the views' maximum age. Those reads can
+     * fall inside the read-repair window, so the open also arms a second drop past it
+     * ({@link armMembershipViewReload}). Any other
+     * peer — a relay, a bootstrap node, another party's machine — starts nothing.
+     *
+     * On identify rather than `connection:open` because, until the sibling identifies,
+     * Optimystic's cohort for every control block is this node alone: a pass started at the
+     * open writes (the first self-record publish) and reads on a cohort of one.
+     */
+    private onControlSiblingConnectionChange;
+    /**
+     * Drop the membership views again {@link MEMBERSHIP_VIEW_RECONNECT_RELOAD_MS} after a
+     * sibling connects, and start a pass whose reads reload them. This node's reads before
+     * the connection stamped Optimystic's read-repair window on the control blocks, so the
+     * reload the open itself starts is served from the local copy with no cohort consult,
+     * and the view would keep rows that predate the sibling's commits until its maximum age.
+     * The reload past the window starts the consults; one that brings a newer revision
+     * raises the table change that drops the view and refreshes the gate. Re-armed by every
+     * open, so it runs one window after the latest.
+     *
+     * NOTE: a consult Optimystic defers (16 already in flight) starts nothing and leaves the block
+     * unstamped, so the view keeps its rows until the first read past its maximum age, which on an
+     * idle node is the reconcile backstop. If `cluster-tx:read-repair-deferred` lines show at a
+     * reconnect, re-arm this reload once more instead of waiting for the backstop.
+     */
+    private armMembershipViewReload;
+    /**
+     * Wire the control-connection listeners, which keep {@link identifiedControlPeers}: the
+     * growth edge that drives write-while-alone re-replication, and the sibling reconcile
+     * trigger ({@link onControlSiblingConnectionChange}). Wired in {@link start} (not the
+     * delayed refresh path) so no early identify is missed, and reads back the peers that
+     * identified before it ran ({@link noteIdentifiedControlPeers}); torn down in
+     * {@link stopRecordRefresh}. Idempotent.
      */
     private wireControlConnectionListeners;
     /**
@@ -2353,8 +2570,9 @@ export declare class CadreNode implements SAppIdLookup {
      * registered, deliberately: both an explicit retry and the {@link StrandWatcher}'s
      * automatic relaunch need it. A failed launch here hands the strand back to that
      * relaunch — `StrandWatcher.forgetStrand` drops the id from the watcher's
-     * `knownStrands` and records the backoff, so a later poll re-attempts it on the same
-     * `pollInterval * 2^(failures-1)` ladder a watcher-driven failure gets. Because the
+     * `knownStrands`, records the backoff and wakes the watcher when it expires, so the
+     * strand is re-attempted on the same ladder a watcher-driven failure gets
+     * (`min(strandWatchInterval, 5 s) * 2^(failures-1)`, capped at 5 minutes). Because the
      * config stays registered, the retry takes `handleStrandAdded`'s auto-launch branch:
      * what the app sees is `strand:error` per failed retry and `strand:started` when one
      * succeeds, never a second `strand:discovered`. {@link detachStrand} (reached via
@@ -2412,7 +2630,8 @@ export declare class CadreNode implements SAppIdLookup {
      * (the key exists nowhere else). No app-data wipe is needed for either.
      *
      * The insert is signed through this node's owner signer ({@link getOwnerSigner}), in one
-     * approval with a closed strand's party-key mint. The signer's key is persisted on the row
+     * approval and one control transaction with a closed strand's party key
+     * ({@link ControlDatabase.insertFoundingRows}). The signer's key is persisted on the row
      * as `FounderOwnerKey` (the schema pins the column to the verified signer), and this node's
      * peer id as `FounderPeerId` (bound into the signature), which is what later lets any
      * launch derive "this machine is the founder" from the row alone.
@@ -2423,7 +2642,8 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * A CLOSED strand's publish also seats this party's own membership identity key —
      * the `StrandPartyKey` row {@link ensureStrandPartyKey} documents — which is what the
-     * founder bootstrap derives `Member.Key`/`Manager.MemberKey` from. The
+     * founder bootstrap derives `Member.Key`/`Manager.MemberKey` from; a key the party already
+     * holds for the id is kept. The
      * `memberPrivateKey` ARGUMENT stays the strand-wide read secret formation hands to
      * joiners; it derives nobody's identity.
      *
@@ -2443,16 +2663,55 @@ export declare class CadreNode implements SAppIdLookup {
      */
     publishStrand(strandId: string, type?: 'o' | 'c', memberPrivateKey?: string, sign?: OwnerSign): Promise<StrandRow>;
     /**
-     * The write half of {@link publishStrand}: insert `desired`, adopting a matching row a
-     * concurrent founder landed first, then mint a closed strand's party key, all under one
-     * owner approval's `sign`.
+     * The `Strand` row this machine publishes for `strandId`, as {@link publishStrand} and
+     * {@link foundStrand} write it: the id trimmed and checked, this node's owner key and peer id
+     * as its founder.
+     */
+    private founderStrandRow;
+    /**
+     * The write half of {@link publishStrand} and {@link foundStrand}: under one owner approval,
+     * insert `desired`, a closed strand's party key and the requested invitation in one control
+     * transaction ({@link ControlDatabase.insertFoundingRows}), adopting a matching row a
+     * concurrent founder landed first. Reads nothing first: the caller has just read the
+     * `Strand` row, and a stored key or row is resolved from the insert's own rejection.
+     */
+    private writeFoundingRows;
+    /** {@link writeFoundingRows} inside its approval. */
+    private insertOrAdoptFounding;
+    /**
+     * Insert `desired`'s founding rows, minting a closed strand's party key — this party's own
+     * membership identity, which the founder bootstrap derives `Member`/`Manager` from, distinct
+     * from the row's shared `MemberPrivateKey` read secret. A key already stored for the id with
+     * no strand row (one {@link ensureStrandPartyKey} seated, which it would adopt too) refuses
+     * that transaction whole; the rows are then written again without a key.
+     *
+     * @returns The party key this seated; undefined when it seated none, so the launch reads the stored one.
+     */
+    private seatFoundingRows;
+    /**
+     * Resolve a founding refused on `Strand.Id`: re-read the row that landed and adopt it when it
+     * matches `desired` — a concurrent founder, such as two machines of one party on one id —
+     * or throw naming the columns that differ.
      */
-    private insertStrandRow;
+    private adoptConcurrentFounding;
+    /**
+     * Publish a founding's invitation on its own, bound to `strandId`, for a founding that adopted
+     * a stored row rather than writing its own — unless the invitation is already stored, bound to
+     * this strand, as a repeat of a founding whose transaction committed leaves it.
+     *
+     * @param sign - The open approval's `sign`; omitted, the publish asks for its own.
+     */
+    private publishFoundingInviteIfAbsent;
     /**
      * Found a strand — publish its row cadre-wide AND start the local instance as its
      * founder — in one resumable call. The single entry point for creating a strand; a
      * caller joining one someone else founded uses {@link addStrand} alone.
      *
+     * The publish is one control transaction under one owner approval: the `Strand` row, a
+     * closed strand's `StrandPartyKey` row, and the invitation in
+     * {@link FoundStrandConfig.formationInvite} when one is given. The start then uses the party
+     * key the publish seated rather than reading it back.
+     *
      * Safe to re-run from any point of interruption, which hand-rolling
      * {@link publishStrand} + {@link addStrand} is not. Either half can already have
      * happened:
@@ -2511,10 +2770,20 @@ export declare class CadreNode implements SAppIdLookup {
      * so both forms of `foundStrand` reject on it before returning.
      */
     private publishFoundingRow;
+    /** {@link publishFoundingRow} when no row is stored: write the founding rows under this node's owner. */
+    private publishFoundingStrand;
+    /**
+     * {@link publishFoundingRow} over a stored row: adopt it ({@link adoptPublishedStrand}), then
+     * publish the requested invitation on its own, under its own approval.
+     */
+    private resumeFounding;
     /**
      * The start half of {@link foundStrand}. Its timing lines (`addStrand: start`, then the
      * duration or `failed after`) are logged when the start settles, also in the background
      * form, so a start that hangs still shows as a start line with no end line.
+     *
+     * A party key the publish half just seated is handed to the launch, which would otherwise
+     * read back the row the same founding wrote.
      */
     private attachFoundingRow;
     /**
@@ -2530,9 +2799,10 @@ export declare class CadreNode implements SAppIdLookup {
      * inverse of {@link publishStrand}.
      *
      * Party-wide, unlike {@link stopStrand}, which only stops the strand on THIS node: every
-     * cadre node watching the table sees the row vanish on its next poll (default 5 s) and
-     * stops its own instance. This node converges immediately — the method forces a watcher
-     * poll and stops any still-running local instance before resolving. Removing the row
+     * cadre node watching the table hears the row's removal and stops its own instance (a
+     * machine outside the `Strand` block's cohort, on a cadre larger than 16, only at its
+     * watcher's backstop read, default 5 minutes). This node converges immediately — the
+     * method forces a watcher run and stops any still-running local instance before resolving. Removing the row
      * removes OUR party's participation only: other parties in the strand keep their own
      * rows and the strand network carries on, so no cross-party sign-off is involved — this
      * is an owner-signed control-plane write like every other, not "destroy the network".
@@ -2597,9 +2867,11 @@ export declare class CadreNode implements SAppIdLookup {
      * as `MemberPrivateKey`; docs/strands.md → "Closed-Strand Member Key Handling") and is
      * never put on the formation wire.
      *
-     * Called internally by {@link publishStrand} (closed strands mint at publish) and by a
-     * founder launch that finds no row (a publish interrupted before its mint); public so a
-     * test harness — or a joiner flow that persists a formation-issued identity — can seat
+     * A founding seats the key in the same transaction as the strand row, not through here.
+     * Called internally by {@link publishStrand}'s repeat of a published closed strand and by a
+     * founder launch that finds no row, which heal a closed strand row stored without its key
+     * (one seated by `ControlDatabase.insertStrand` directly, or whose key was removed); public
+     * so a test harness — or a joiner flow that persists a formation-issued identity — can seat
      * a specific key deliberately.
      *
      * @param strandId - The strand the key is this party's identity for.
@@ -2616,8 +2888,8 @@ export declare class CadreNode implements SAppIdLookup {
      * Resolve the party membership key a closed strand's launch threads into the founder
      * bootstrap: the explicit attach-time key when given, else the party's persisted
      * `StrandPartyKey` row, else — on the one machine the row names as founder (`FounderPeerId`)
-     * — a freshly minted-and-persisted key, which seats the identity for a publish that was
-     * interrupted before its mint. Everyone else resolves undefined: non-founding
+     * — a freshly minted-and-persisted key, which seats the identity for a closed row stored
+     * without one (see {@link ensureStrandPartyKey}). Everyone else resolves undefined: non-founding
      * machines never mint (no mint race between a party's machines), and only a founder
      * bootstrap needs the key at all.
      *
@@ -2642,8 +2914,8 @@ export declare class CadreNode implements SAppIdLookup {
      * Counterpart to {@link createOpenInvitation}, which only mints the
      * out-of-band {@link OpenInvitation} envelope: persisting the matching
      * `FormationInvite` row is what makes the token *redeemable* — the host's
-     * {@link ControlFormationUsageRecorder} answers `isTokenValid`/`isTokenUsed`
-     * from this row. A host minting a closed-strand invite does both (mint +
+     * {@link ControlFormationUsageRecorder} reads it (`readToken`) to check a
+     * redemption. A host minting a closed-strand invite does both (mint +
      * publish), exactly as the integration harness's `createInvitation` does.
      *
      * Signs through the same owner signer as {@link publishStrand}, whose key must be an
@@ -2663,6 +2935,14 @@ export declare class CadreNode implements SAppIdLookup {
         validationUrl?: string;
         strandId?: string;
     }, sign?: OwnerSign): Promise<void>;
+    /**
+     * Register an invitation this node just published with the strand solicitation service. A
+     * host may publish one whose token was minted elsewhere; registering it locally opens the
+     * connection gate's formation exemption immediately rather than waiting for the durable row
+     * to become readable. A token {@link createOpenInvitation} minted here is already registered,
+     * and this records the same expiry again.
+     */
+    private registerPublishedInvitation;
     /**
      * Enroll an approver public key allowed to sign off on `ValidationUrl` redemptions.
      *
@@ -2744,7 +3024,7 @@ export declare class CadreNode implements SAppIdLookup {
      * fan-out, so a rediscovery costs nothing beyond the map lookup plus the (pure)
      * founder derivation. NOT a silent no-op any more when the launch resolves as a
      * FOUNDER: the tracked instance may have been launched first as a joiner (an app
-     * attach, or this node's own watcher poll winning the `resolveCohortSeed` window
+     * attach, or this node's own watcher run winning the `resolveCohortSeed` window
      * below), which used to drop the founder request and leave the strand headerless —
      * now the tracked instance is founded in place
      * ({@link StrandInstanceManager.foundExistingStrand}), waking it first if quiesced
@@ -2756,9 +3036,9 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * An absent `sAppConfig` launches a storage replica ({@link CadreNodeConfig.hostUnclaimedStrands}),
      * which is ALWAYS a joiner whatever the row says: the founder bootstrap writes the sApp
-     * into `Strand.Header`, and a replica has none. So a self-founded row whose watcher poll
+     * into `Strand.Header`, and a replica has none. So a self-founded row whose watcher run
      * wins the race against its app's `addStrand` after a restart comes up as a replica — and
-     * so does a `foundStrand` whose publish a watcher poll saw before its attach. A claim
+     * so does a `foundStrand` whose publish a watcher run saw before its attach. A claim
      * that finds a tracked replica upgrades it in place, over the same node and store
      * ({@link StrandInstanceManager.attachSApp}), BEFORE any founding: the founder bootstrap
      * needs the sApp the attach supplies.
@@ -2887,7 +3167,7 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * Timestamps are recorded OPTIMISTICALLY, whatever `collectStrandAddrs` reports
      * per peer: recording only on success would re-announce to an unreachable relay
-     * on every reconcile tick, one dial timeout each. A failed INITIAL announce costs
+     * on every reconcile pass, one dial timeout each. A failed INITIAL announce costs
      * the strand supervisor its first attempt only (the relay denies the
      * reservation; every re-drive re-announces first through
      * {@link announceDelegateToRelay}); a failed REFRESH retries within
@@ -2961,9 +3241,11 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * Due times are per (sibling, strand) and set from each sibling's own outcome, so
      * a sibling that connects late — a phone joining after the party's always-on
-     * machines — is asked on the next tick, and one that could not answer or refused
-     * (its view of the membership may not include us yet) is retried within
-     * {@link STRAND_PEER_ADDR_RETRY_MS} rather than {@link STRAND_PEER_ADDR_REFRESH_MS}.
+     * machines — is asked on the pass its connection starts, and one that could not
+     * answer or refused (its view of the membership may not include us yet) is retried
+     * within {@link STRAND_PEER_ADDR_RETRY_MS} rather than
+     * {@link STRAND_PEER_ADDR_REFRESH_MS}; the pass that stamped the retry arms a wake
+     * for it ({@link armReconcileWake}).
      *
      * Distinct from {@link refreshDelegateGrants}, deliberately: that pass covers
      * RELAYS on a `DELEGATE_GRANT_TTL_MS / 2` throttle to keep circuit-relay
@@ -2983,15 +3265,17 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * `connectedSiblingTargets`' membership read is unbounded, and with zero
      * connections its answer is empty whatever the table holds, so decide it from the
-     * connection list instead of paying for the read once a tick.
+     * connection list instead of paying for the read once a pass.
      *
-     * NOTE: otherwise the read runs on EVERY tick with a running strand, not only when
+     * NOTE: otherwise the read runs on EVERY pass with a running strand, not only when
      * some (sibling, strand) is due: pruning a departed sibling needs the current
      * target set, and whether anyone is due cannot be told without it (a connected
-     * non-member never gets a due time to compare). One more `CadrePeer` read per 15 s
-     * tick, on top of the two `runReconcileControlCohort` already makes; if those reads
-     * get costly, share one row-set across the pass (see the NOTE there) rather than
-     * skipping ticks here.
+     * non-member never gets a due time to compare). One more `CadrePeer` read per
+     * pass, on top of the two `runReconcileControlCohort` already makes, all served
+     * from the membership rows view: an in-memory scan while the view is current,
+     * storage only after the table changed or the view's maximum age passed. Sharing
+     * one row set across the pass would save no storage read and was declined (see
+     * the NOTE there).
      *
      * NOTE: one strand-addr RPC per (running strand × due sibling) — each a tiny
      * request/response on an already-open control connection. If a node ever runs
@@ -3036,8 +3320,8 @@ export declare class CadreNode implements SAppIdLookup {
      *
      * NOTE: every pass serialises the whole FRET table (`exportTable()`), verifies one
      * signature per record and makes one `peerStore.merge` per peer, per running strand
-     * per 15 s tick. Fine at strand table sizes, and an unchanged address set writes
-     * nothing in libp2p's persistent peer store. If many strands or large tables make it
+     * per pass — every change-driven pass and the 2-minute backstop. Fine at strand table
+     * sizes, and an unchanged address set writes nothing in libp2p's persistent peer store. If many strands or large tables make it
      * show up, read only the entries whose address stamp is near the one-hour mark.
      *
      * @returns the ids of the peers the table holds a usable record for.
@@ -3194,8 +3478,8 @@ export declare class CadreNode implements SAppIdLookup {
      * The stop + emit are skipped when the strand manager holds no instance for `strandId` —
      * e.g. a party owner that published a strand's row but never ran it locally, or an
      * explicit {@link stopStrand} for an id this node never started. `hibernationManager`
-     * untrack and the `sAppConfigs` / {@link strandLaunchRefusals} / {@link discoveredStrands}
-     * deletes stay unconditional (all no-ops when there is nothing to remove), so a launch
+     * untrack and the `sAppConfigs` / {@link strandLaunchRefusals} / {@link discoveredStrands} /
+     * {@link formedPartyKeys} deletes stay unconditional (all no-ops when there is nothing to remove), so a launch
      * that failed before an instance was ever tracked still gets its stray entries cleared.
      *
      * Dropping the {@link discoveredStrands} entry here covers both callers, and both
@@ -3386,18 +3670,26 @@ export declare class CadreNode implements SAppIdLookup {
      */
     getControlDatabase(): ControlDatabase | null;
     /**
-     * Open control-network connections right now. A lower-bound proxy for replication
-     * reach: 0 connections ⇒ a control write commits local-only. The private
-     * `committedAlone` write-while-alone seam is defined in terms of this.
-     *
-     * It approximates the precise signal (the block's cluster size), and a caller that
-     * samples it AFTER a write samples a slightly wider window than `committedAlone`
-     * does inside the write itself. It exists so an embedder can warn an owner before a
-     * control write that this machine currently sees none of its siblings, and report
-     * after one that the write may not have travelled — a warning shown unconditionally
-     * is a warning people learn to ignore.
+     * Open control-network connections right now, of every kind: siblings, relays, bootstrap
+     * nodes and peers still identifying. A report of connectivity, not of replication reach: a
+     * control write can commit local-only with connections open, and whether one would is
+     * {@link hasReachableControlSibling}.
      */
     getControlConnectionCount(): number;
+    /**
+     * Whether a control write made now reaches another machine: a connected peer has identified
+     * as serving the control database and is one this node sends control writes to (an
+     * authorized member, or a device whose admission it is writing). Optimystic counts a peer
+     * into a control block's cohort on those same terms; with none, a write commits on this node
+     * alone and is queued for re-issue once one is reachable (docs/architecture.md → "Writes made
+     * while alone").
+     *
+     * It exists so an embedder can warn an owner before a control write that this machine
+     * currently reaches none of its siblings, and report after one that the write may not have
+     * travelled; a warning shown unconditionally is a warning people learn to ignore. A caller
+     * that samples it AFTER a write samples a slightly wider window than the write did.
+     */
+    hasReachableControlSibling(): boolean;
     /**
      * Force a poll of the strand watcher (for testing)
      */
@@ -3593,7 +3885,7 @@ export declare class CadreNode implements SAppIdLookup {
      * builds its snapshot against that anchor, which is also what its previous snapshot was
      * judged against. Caught here rather than failing the refresh, because the membership read
      * tolerates an unreachable `Revocation` block on an isolated node
-     * (`ControlDatabase.readRevokedStampRows`) and `queryRevocations` does not: failing the
+     * (`ControlDatabase.readRevocationRowsOrNone`) and `queryRevocations` does not: failing the
      * whole refresh on that would freeze such a node's gate snapshot.
      * NOTE: on such a node the sync is skipped at every refresh until the block is held; if an
      * isolated node ever has to derive owner additions while cut off, give `queryRevocations`
@@ -3602,9 +3894,12 @@ export declare class CadreNode implements SAppIdLookup {
      * NOTE: cost per membership refresh is one `OwnerKey` read and one `Revocation` read (the
      * tombstone list, whose `OwnerKey` stamps are handed to `queryOwnerKeyRows` so it does not
      * read the retired set again, and which the hang-up of removed peers shares through
-     * `loadTombstones`), plus the owner-grant chain when some owner row is grant-seated (the
-     * NOTE in the body). Before the Revocation ledger marker is filed that one read is a cohort
-     * consult per refresh, which `control-founding-consult-budget.spec.ts` pins.
+     * `loadTombstones`), plus the owner-grant chain's two reads when some owner row is
+     * grant-seated. All are served from the control database's membership views, so they reach
+     * storage only after their table changed or the view's maximum age passed
+     * (`control-founding-consult-budget.spec.ts` pins the counts). On a party founded before
+     * genesis created every control collection, whose `Revocation` table has never been
+     * written, each `Revocation` load is a cohort consult until the first tombstone.
      *
      * @param retry - forwarded to every read; `false` on the refresh path, for the reason on
      *   {@link refreshAuthorizedControlPeers}.
@@ -3636,15 +3931,8 @@ export declare class CadreNode implements SAppIdLookup {
     /**
      * The usage and invitation rows {@link hasAnchoredProof} resolves an invitation-admitted
      * `CadrePeer` row through, keyed for lookup. Both reads honour `retry` for
-     * {@link listAuthorizedMembers}' reason.
-     *
-     * NOTE: once invitations are the only admission route (ticket
-     * `cadre-invitations-redeemable-by-any-member`), every cadre with a member not yet
-     * re-vouched pays these two whole-table reads and three ed25519 verifies per row on every
-     * membership refresh. Both tables are append-only and a verified chain never changes (expiry,
-     * use count and withdrawal are not re-checked), so if the gate's admission deadline ever
-     * shows this, memoise verified (row stamp → usage stamp) pairs per node and skip the reads
-     * when every admitted row is already memoised.
+     * {@link listAuthorizedMembers}' reason. The rows come from the membership views, so they
+     * reach storage only after the table changed or the view's maximum age passed.
      */
     private loadInvitationChain;
     /**
@@ -3725,7 +4013,7 @@ export declare class CadreNode implements SAppIdLookup {
      * write-driven refresh never fires for it — yet applying it can ANCHOR a new
      * owner key, which flips rows already present from unauthorized to authorized.
      * Hence the explicit refresh here; without it a peer the freshly anchored owner
-     * vouched for stays denied until the next timed cohort reconcile.
+     * vouched for stays denied until the next membership change or the backstop pass.
      */
     private seedEventCallbacks;
     /**
@@ -3744,13 +4032,14 @@ export declare class CadreNode implements SAppIdLookup {
      * NO `CadrePeer` writer needs to call this: the control database notifies it
      * after every committed member-row write (`ControlDatabase.mutateCadrePeer`,
      * wired in {@link start}), which is exactly what makes the refresh automatic
-     * rather than a caller obligation. It stays public for the changes that write
-     * NO row locally and so raise no notification:
-     *
-     * - a membership row that arrived by REPLICATION (otherwise picked up on the
-     *   next timed cohort reconcile — bounded staleness by design), and
-     * - a newly anchored trusted owner key ({@link applySeed}), which flips rows
-     *   ALREADY present from unauthorized to authorized without touching them.
+     * rather than a caller obligation. A membership row that arrived by REPLICATION
+     * refreshes it too, through the gate watch {@link start} takes on the membership
+     * tables (within its 50 ms window; a change this node's storage never hears of
+     * waits for the reconcile pass's backstop). It stays public for the one change
+     * that writes no row and raises no table event: a newly anchored trusted owner
+     * key ({@link applySeed}), which flips rows ALREADY present from unauthorized to
+     * authorized without touching them. A caller may also await it to observe a
+     * refresh that began after its own change.
      *
      * Coalescing: marks the snapshot stale and resolves once a refresh that began
      * after this call has completed, so a caller that awaits it always observes
@@ -3763,13 +4052,10 @@ export declare class CadreNode implements SAppIdLookup {
      * connected peer it newly covers — the strand-side counterpart to
      * {@link refreshMembershipGate}.
      *
-     * Unlike that one, NOTHING calls this automatically: strand membership is
-     * written through the strand's own `Database` handle
-     * (`strand-membership-writer.ts`), which raises no notification this runtime
-     * can hook, and a revocation that arrives by REPLICATION raises none either.
-     * The gate therefore polls (default 30 s). An app that has just called
-     * `revokeMember` or `leaveStrand` should follow the write with this call so
-     * the cut is immediate rather than up to one poll interval late.
+     * The gate already refreshes on its own when the strand's `Member` or
+     * `MemberPeer` table changes: at once for a `revokeMember` or `leaveStrand`
+     * written on this machine, and when a replicated removal reaches this node's
+     * storage. Call this to await the cut — it resolves after the sweep.
      *
      * Quiet no-op for a strand that is not running, is quiesced, is open, or has
      * the gate disabled. Never rejects; resolves once the sweep has finished.
@@ -3799,8 +4085,8 @@ export declare class CadreNode implements SAppIdLookup {
      * CONCURRENT external write's refresh for the life of the scope: that writer's
      * promise resolves before its peer is admitted, and admission lands at scope
      * exit instead. Acceptable — scope exit is milliseconds away (bounded by the
-     * drain), versus the ~15 s reconcile interval that was the alternative before
-     * any of this existed — but it is the reason these scopes stay short and rare.
+     * drain), versus the reconcile pass that was the alternative before any of this
+     * existed — but it is the reason these scopes stay short and rare.
      */
     private deferMembershipGateRefresh;
     /**
@@ -3892,7 +4178,7 @@ export declare class CadreNode implements SAppIdLookup {
      *   `'self'` or `'alone'`, before any write.
      */
     removeOwner(ownerPublicKeyB64: string, options?: RemoveOwnerOptions): Promise<OwnerKeyRemovalResult>;
-    /** {@link planOwnerKeyRemoval} with the rows it was judged from, which {@link removeOwner} re-vouches dependents by. */
+    /** {@link planOwnerKeyRemoval} over `controlDatabase`, for a caller that already holds it. */
     private planOwnerKeyRemovalWith;
     /**
      * The re-vouch step of {@link removeOwner}: every chosen dependent row is rebound to this
@@ -3901,12 +4187,14 @@ export declare class CadreNode implements SAppIdLookup {
      * the only rebinding `OwnerKey.NoUpdate` allows); peers through the owner re-touch
      * (`reauthorizePeer`), which rewrites `VouchOwner`/`VouchSig` and clears `VouchUsage`.
      *
-     * The peer re-touch keeps the row's `UpdatedAt` where it is. The owner branch of
-     * `CadrePeer.AuthorizedUpdate` does not require a bump, and bumping a self-published row
-     * would leave its `Sig` unverifiable, so unresolvable and unlisted as self-published, until
-     * the machine's next heartbeat (the NOTE on that constraint); the write-while-alone drain
-     * bumps because it re-issues an otherwise unchanged row, whereas here the voucher itself
-     * changes. A row never self-published carries no stamp to keep and gets the clock.
+     * The peer re-touch is the re-vouch mode of `reauthorizePeer`, which leaves the row's
+     * `UpdatedAt` untouched and writes whether or not the machine has self-published. The owner
+     * branch of `CadrePeer.AuthorizedUpdate` does not require a bump, and bumping a self-published
+     * row would leave its `Sig` unverifiable, so unresolvable and unlisted as self-published, until
+     * the machine's next heartbeat (the NOTE on that constraint); the write-while-alone drain's
+     * re-broadcast mode bumps because it re-issues an otherwise unchanged row, whereas here the
+     * voucher itself changes. A dependent whose row vanished since the plan is reported absent and
+     * skipped.
      *
      * A failure rethrows and stops the call before the removal; re-vouches already made stay
      * (the row is only re-signed by a current owner) and the caller retries. An owner re-vouch
@@ -4022,12 +4310,13 @@ export declare class CadreNode implements SAppIdLookup {
      * that connection from the addresses it was handed, on this launch or a later
      * one.
      *
-     * Nothing is dialed here: the drone has not received the seed yet. After
-     * delivering it, call {@link reconcileControlCohort} to dial straight away;
-     * otherwise the next timed reconcile pass does. A pass already in flight is
-     * joined rather than restarted, and one that listed siblings before this add
-     * does not dial the drone, so a caller waiting for the connection should allow
-     * for one more timed pass.
+     * Nothing is dialed here: the drone has not received the seed yet. Its `CadrePeer`
+     * insert is a membership change, so a reconcile pass dials the retained addresses
+     * within about 50 ms of this call returning, whether or not the caller runs one, and
+     * a failed dial is retried on the redial ladder (15 s, 30 s, 60 s, then every
+     * backstop). A caller that wants to await the connection calls
+     * {@link reconcileControlCohort} itself, twice in a row: a call made while a pass is
+     * in flight joins it, and that pass may have listed siblings before this add.
      */
     addDrone(options: AddDroneOptions): Promise<DroneInitResult>;
     /**
@@ -4060,12 +4349,19 @@ export declare class CadreNode implements SAppIdLookup {
      * by the node (its anchored branch), the row insert is a no-op on an existing row
      * (`ControlDatabase.insertCadrePeer`), and the dial target is replaced, not duplicated.
      *
-     * The first dial is kicked (not awaited) so it happens now rather than on the next
-     * timed reconcile pass; a caller that wants to wait for the connection awaits
-     * {@link reconcileControlCohort} itself, with `addDrone`'s caveat that a pass already
-     * in flight is joined rather than restarted. The claimed node dials this one back too,
-     * as the seed's minter, when this node has a listen or relay address; a phone
-     * with neither is reached by its own reconcile pass alone.
+     * Once it has acknowledged, the node restarts into this party (cadre-cli's
+     * `restartIntoClaimedParty`), closing the connection the claim used. The dial target puts
+     * the address that connection was dialed on first, so every later dial tries the address
+     * that just worked before the others (a QR code lists public addresses before LAN ones, and
+     * a home router often drops a connection to its own public address from inside). A
+     * reconcile pass is kicked (not awaited) now, and the vouch's `CadrePeer` insert starts
+     * another about 50 ms later; for the first {@link CONTROL_COHORT_REDIAL_MS} after the
+     * acknowledgement this node also retries the node every second while it restarts
+     * ({@link redialClaimedNode}). A caller that wants to wait for the connection awaits
+     * {@link reconcileControlCohort} itself, with `addDrone`'s caveat that a pass already in
+     * flight is joined rather than restarted. The claimed node dials this one back too, as the
+     * seed's minter, when this node has a listen or relay address; a phone with neither is
+     * reached by its own dials alone.
      *
      * @throws {ClaimRefusedError} when the node was reached and refused the claim.
      * @throws {PeerUnreachableError} when the node was never reached.
@@ -4075,6 +4371,33 @@ export declare class CadreNode implements SAppIdLookup {
         multiaddrs: string[];
         secret: string;
     }): Promise<void>;
+    /**
+     * `addrs` with the address this node's open connection to `peerId` was dialed on moved to
+     * the front, when it is one of them; `addrs` unchanged otherwise. Compared without a
+     * trailing `/p2p/<peerId>`, which a QR code's address may or may not carry ({@link addrKey}).
+     */
+    private connectedAddrFirst;
+    /**
+     * Retry a node this node has just claimed ({@link claimNode}) once every
+     * {@link CLAIM_RESTART_REDIAL_STEP_MS} for {@link CONTROL_COHORT_REDIAL_MS} after it accepted.
+     * The node restarts into this party right after it acknowledges, and while it does, a
+     * reconcile pass's dial either fails or opens a connection the restarting node closes at
+     * once. The first failure puts the pass's next redial 15 s out ({@link armReconcileWake}),
+     * and an owner that cannot be dialed has no other way back to the node.
+     *
+     * Each step dials once from the retained dial target, unless a connection to the node is
+     * open: the one the claim used until the restart closes it, or one to the restarted node
+     * that has not identified yet. A dial that connects does not end the loop, because the
+     * restarting node may still close it. The loop ends once the node has identified as serving
+     * this party's control database ({@link identifiedControlPeers}, which the placeholder node
+     * it ran before the claim never joins), at the window's end, when this node stops, or when
+     * the target is forgotten ({@link removePeer}). Steps run one after another, so a dial
+     * finishes on its own budget first. The redial streak is left alone: the ladder carries on
+     * after the window. One loop per peer: a repeated claim while one runs starts none.
+     */
+    private redialClaimedNode;
+    /** One step of {@link redialClaimedNode}; false ends the loop. */
+    private redialClaimedNodeStep;
     /**
      * Add a phone to the cadre with relay support.
      * Use when both nodes are NAT'd (phone-to-phone).
@@ -4162,11 +4485,13 @@ export declare class CadreNode implements SAppIdLookup {
      * Steps: refuse an invitation for another party; pin its `ownerKeys` into the node-local
      * anchor (`'invite'` provenance — the pin sticks even if the redemption then fails, as it
      * does for a seed invite, so a later attempt or seed from the same owner is anchored);
-     * sign the request; dial the listed members in order (`redeemAtMembers`); on
-     * acceptance verify the reply against the pinned keys, merge its dial hints into the peer
-     * store, retain the answering member as a cold-start dial target, refresh the membership
-     * gate and start a cohort reconcile pass. This node then syncs the control database over
-     * the connection it already holds, the same unified behaviour as after a seed.
+     * sign the request, which carries this node's own signed address record; dial the listed
+     * members in order (`redeemAtMembers`); on acceptance verify the reply against the pinned
+     * keys, merge its dial hints into the peer store, retain the answering member as a
+     * cold-start dial target and start a cohort reconcile pass. This node then syncs the control
+     * database over the connection it already holds, the same unified behaviour as after a seed.
+     * The member writes the record on this node's `CadrePeer` row when its signature verifies, so
+     * the row resolves to this node's addresses from its admission.
      *
      * A device that is already a member (a restart with the invitation still configured) is
      * answered as accepted by the member's idempotent redemption, with no second usage row.
@@ -4304,9 +4629,11 @@ export declare class CadreNode implements SAppIdLookup {
      */
     redeemOwnerGrant(bundle: OwnerGrantBundle, signer: OwnerSigner, options?: RedeemOwnerGrantOptions): Promise<RedeemOwnerGrantResult>;
     /**
-     * {@link redeemOwnerGrant}'s local path: the alone refusal, the seat, the liveness refusal,
-     * then one approval around the consent signature and the write. Every refusal comes before
-     * the approval, so a prompting signer never asks for a redemption this node would refuse.
+     * {@link redeemOwnerGrant}'s local path: the alone refusal, the seat (only when this node holds
+     * no grant row), the liveness refusal, then one approval around the consent signature and the
+     * write. Every refusal comes before the approval, so a prompting signer never asks for a
+     * redemption this node would refuse. The held row is read once and carried into the liveness
+     * check and the write, as the member handler carries it (`MemberRedemptionHandler`).
      */
     private redeemOwnerGrantLocally;
     /**
@@ -4553,6 +4880,10 @@ export declare class CadreNode implements SAppIdLookup {
      * implements): mint a single-use `Strand.Invite` against the LIVE host strand so a
      * validated joiner can seat its own `Strand.Member` row.
      *
+     * `host` is the strand as the formation session resolved it from its `Strand` row, read
+     * once there; this method reads no `Strand` row of its own. A row removed in between is
+     * refused when the consent row is written (the `StrandExists` CHECK).
+     *
      * - Open host strand → `null` (no members, nothing to invite into).
      * - Closed host strand whose founder launch was refused as pre-split
      *   ({@link strandLaunchRefusals}) → rethrow the recorded `PreSplitStrandIdentityError`;