@serfab/cadre-core 0.12.0 → 0.13.0

package/README.md

@@ -168,9 +168,10 @@ The main entry point for cadre participation.
 | `stop()` | Gracefully disconnect from all networks |
 | `getStrands()` | Get all active strand instances |
 | `getStrand(id)` | Get a specific strand instance |
-| `addStrand(row)` | Manually add a strand (testing/direct API) |
+| `foundStrand(config)` | **Create a strand**: publish its `Strand` row and start it locally as founder, in one call that is safe to re-run after an interruption. Returns the instance plus the row it actually runs under — for a closed strand read the membership key from there, since a resumed founding keeps the stored key |
+| `addStrand(row)` | Attach only — start a local instance for a row that already exists (the join path; also testing/direct API). Does **not** publish |
 | `stopStrand(id)` | Stop a strand on this node only (the shared `Strand` row stays; rediscovered on restart) |
-| `publishStrand(id, type?, memberKey?)` | Owner-signed `Strand` row insert — makes the strand visible cadre-wide |
+| `publishStrand(id, type?, memberKey?)` | Owner-signed `Strand` row insert — makes the strand visible cadre-wide. Idempotent: a live row with the same `(Type, MemberPrivateKey)` is returned unwritten; different content on the same id throws. Prefer `foundStrand` when creating a strand |
 | `unpublishStrand(id)` | Owner-signed party-wide removal — deletes this party's `Strand` row; every node stops the strand. Destroys a closed strand's `MemberPrivateKey` |
 | `getEnrollmentService()` | Access peer enrollment API |
 

package/dist/cadre-node.d.ts

@@ -1,9 +1,10 @@
 import type { Libp2p, PeerId } from '@libp2p/interface';
 import type { Multiaddr } from '@multiformats/multiaddr';
-import type { CadreNodeConfig, StrandInstance, StrandConfig, SAppConfig, CadreNodeEvents, ControlNetworkSeed, ApplySeedResult, AddDroneOptions, AddPhoneOptions, DroneInitResult, InviteResult, CadreInvite, OpenInvitation, FormStrandResult, StrandFormationDisclosure, ResolveOpts, SelfRegistrationOutcome, ServiceWakeResult, PushPlatform, DeviceTokenRecord, ResolveDeviceTokenOpts } from './types.js';
+import type { CadreNodeConfig, StrandInstance, StrandRow, StrandConfig, FoundStrandConfig, FoundStrandResult, SAppConfig, CadreNodeEvents, ControlNetworkSeed, ApplySeedResult, AddDroneOptions, AddPhoneOptions, DroneInitResult, InviteResult, CadreInvite, OpenInvitation, FormStrandResult, StrandFormationDisclosure, ResolveOpts, SelfRegistrationOutcome, ServiceWakeResult, PushPlatform, DeviceTokenRecord, ResolveDeviceTokenOpts } from './types.js';
 import { type Ed25519KeyPair } from './ed25519-key.js';
 import { type TrustedOwnerStore, type TrustSource } from './trusted-owner-store.js';
 import { type BootstrapPeerStore } from './bootstrap-peer-store.js';
+import { type EnrolledMachineStore } from './enrolled-machine-store.js';
 import { type SAppIdLookup } from './strand-watcher.js';
 import { EnrollmentService } from './enrollment.js';
 import { ControlDatabase } from './control-database.js';
@@ -57,6 +58,14 @@ export declare class CadreNode implements SAppIdLookup {
     private trustedOwnerStore;
     private controlNode;
     private controlDatabase;
+    /**
+     * The CONTROL network's peer-join block catch-up — same module as the
+     * per-strand ones, but membership-gated (see {@link startControlBackfill}).
+     * Created in {@link start} after the control node and database are up, stopped
+     * and dropped in {@link cleanup} before either is torn down, so a stop()→
+     * start() cycle rebuilds it with a fresh caught-up-peer memo.
+     */
+    private controlBackfill;
     private strandWatcher;
     private strandManager;
     private hibernationManager;
@@ -237,6 +246,36 @@ export declare class CadreNode implements SAppIdLookup {
      * stale stamp.
      */
     private readonly strandPeerAddrRefreshAt;
+    /**
+     * CROSS-PARTY strand-network addresses learned at formation, keyed by strandId — the
+     * responder's live strand addrs, carried back on the formation result
+     * (`FormationResultMessage.strandAddrs`) and recorded by {@link formStrand}.
+     *
+     * This is the ONLY cross-party discovery input there is. The strand-addr RPC that
+     * resolves a strand's addresses is membership-gated and answers own-party siblings
+     * only, so without this map a joiner's cohort seed for a two-party strand is empty and
+     * the mesh never forms.
+     *
+     * Read by {@link resolveCohortSeed} (launch + hibernation resume) and re-merged by
+     * every {@link refreshStrandPeerAddrs} pass — the re-merge is what keeps the entries
+     * alive past the peerStore's one-hour address expiry, since nothing can re-resolve
+     * them.
+     *
+     * IN-MEMORY and ONE-SHOT, deliberately (see `docs/strands.md`): the addresses die with
+     * the process, and a restarted initiator with no sibling running the strand is back to
+     * an empty seed until the durability work lands
+     * (`backlog/feat-cross-party-strand-addr-durability`). They are also never refreshed,
+     * so a responder whose relay reservation rotates before the initiator dials leaves a
+     * dead entry behind; recovery today is a fresh invitation.
+     *
+     * NOTE: entries are kept for the node's lifetime, including across a
+     * {@link stopStrand} — a stopped strand may be rediscovered by the watcher and must
+     * still get its seed. Each strand's list is capped at `MAX_STRAND_ADDRS`, but the
+     * number of KEYS is bounded only by the strands this node has ever formed as an
+     * initiator (not by time); if a node ever forms strands at scale, evict on
+     * `unpublishStrand` or cap the map.
+     */
+    private readonly crossPartyStrandAddrs;
     /**
      * Cold-start bootstrap dial targets: the owner-flagged peers of every seed
      * this node has applied, keyed by peer id, valued by the seed's multiaddr
@@ -271,6 +310,34 @@ export declare class CadreNode implements SAppIdLookup {
      * the party if it is ever stranded again.
      */
     private bootstrapPeerStore;
+    /**
+     * Node-local record of the party's enrolled-machine count (see
+     * `enrolled-machine-store.ts`), kept so the CONTROL node can declare a
+     * block-repair yardstick at bring-up. Constructed (or adopted from
+     * `config.enrolledMachines.store`) by {@link initializeEnrolledMachineStore};
+     * written by {@link refreshAuthorizedControlPeers}. Like
+     * {@link bootstrapPeerStore} it is deliberately NOT cleared by {@link cleanup},
+     * so it survives a stop()→start() cycle of the same node instance.
+     */
+    private enrolledMachineStore;
+    /**
+     * The enrolled-machine count this node's CONTROL libp2p node was (or will be)
+     * built with — read out of {@link enrolledMachineStore} during {@link start},
+     * before {@link createControlNode}, and consumed by
+     * {@link buildControlNodeOptions}.
+     *
+     * A captured FIELD rather than a live `store.count()` read, deliberately: the
+     * store moves as membership changes, but Optimystic froze the policy when the
+     * node was built, so this field is the honest answer to "what did this node
+     * actually declare?" and does not drift away from the running node. It is
+     * re-read on each {@link start}, which is what makes a stop()→start() cycle pick
+     * up a count recorded during the previous run.
+     *
+     * `undefined` — a brand-new node, an unreadable slot, or the ephemeral default
+     * store — means "this node does not know", which `controlClusterPolicy` answers
+     * with the frozen base policy itself.
+     */
+    private declaredEnrolledMachines;
     /** Initial self-registration timer (see {@link scheduleSelfRegistration}). */
     private selfRegistrationTimer;
     /** TTL heartbeat that re-publishes the self record before it goes stale. */
@@ -502,6 +569,32 @@ export declare class CadreNode implements SAppIdLookup {
      * must never enter this node's dial loop.
      */
     private initializeBootstrapPeerStore;
+    /**
+     * Construct (or adopt) the node-local enrolled-machine store and capture the
+     * count this run will declare into {@link declaredEnrolledMachines}.
+     *
+     * Synchronous for the same reason {@link initializeBootstrapPeerStore} is: an
+     * injected store has already loaded its persisted count by the time it is handed
+     * in (its `open` is the async part), and the in-memory default has nothing to
+     * load. Must run BEFORE {@link createControlNode} — that is the whole point of
+     * the record; see `enrolled-machine-store.ts`.
+     *
+     * The store instance is kept across stop()→start() (so a count recorded during
+     * the previous run is not lost with the ephemeral default), but the DECLARED
+     * count is re-read every time — which is how a restart applies a number the
+     * previous run learned.
+     *
+     * A store scoped to a different party is a configuration error, fail closed. It
+     * is only a repair hint, but a hint sized by a foreign party's membership is a
+     * number nobody chose, and the mismatch always means a miswired embedder.
+     */
+    private initializeEnrolledMachineStore;
+    /**
+     * The node-local enrolled-machine store (null before {@link start}) — what this
+     * node last knew about its party's size. Exposed for diagnostics and for a host
+     * that wants to show which repair yardstick the next launch will declare.
+     */
+    getEnrolledMachineStore(): EnrolledMachineStore | null;
     /**
      * The node-local cold-start bootstrap-peer store (null before {@link start}) —
      * the retained owner addresses {@link reconcileControlCohort}'s cold-start
@@ -534,6 +627,44 @@ export declare class CadreNode implements SAppIdLookup {
      */
     trustOwnerKeys(keys: Iterable<string>, source: Exclude<TrustSource, 'genesis'>): Promise<void>;
     private createControlNode;
+    /**
+     * The control libp2p node's Optimystic network name — ONE binding for every
+     * derivation from it (`db-p2p` namespaces all of the node's protocol ids as
+     * `/optimystic/<networkName>/...`), so the node options and the block-transfer
+     * protocol prefix the control backfill dials can never drift apart.
+     */
+    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 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
+     * joined after them. Without it, such a member that restarts offline reads
+     * the affected control tables as EMPTY, silently (`isMember()` answers false
+     * 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
+     * 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
+     * pushing the whole control store to such a peer would hand a stranger the
+     * party's entire membership, addresses and strand list. The receiving side
+     * needs no work of its own: `createLibp2pNode` registers the block-transfer
+     * handler on every node it builds, control node included, and this node's
+     * per-stream gate (`authorizeInboundControlStream`) covers the inbound
+     * direction. A denied peer is retried on its next `connection:open`, and —
+     * because the production join order is connect-then-authorize — on every
+     * committed membership change via {@link refreshAuthorizedControlPeers}'s
+     * `scheduleConnectedPeers()` call.
+     *
+     * 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.
+     */
+    private startControlBackfill;
     /**
      * The control database's cache-wrapped raw storage, resolved from
      * `config.storage.provider` on first use and then held in {@link controlStorage}
@@ -857,6 +988,24 @@ export declare class CadreNode implements SAppIdLookup {
      * producing an unresolvable row.
      */
     private getSelfSigningKey;
+    /**
+     * Does the `Strand` row name THIS machine as its founder — i.e. is its
+     * `FounderOwnerKey` this node's own owner key (the key behind its PeerId)?
+     * A null/absent column (a consent-seated strand, or a hand-built row) and a
+     * node with no owner key both derive `false`: without a positive match this
+     * machine must attach, never bootstrap. Pure key derivation, no I/O — cheap
+     * enough for {@link launchStrand}'s tracked-instance early return.
+     *
+     * NOTE: reads "one owner key per machine" — the reference model, where the owner
+     * key IS the key behind the PeerId. Two machines running the SAME identity key
+     * would both derive `true` and each bootstrap on its own replica, which is the
+     * double-`Header` hazard this derivation exists to avoid. Unreachable today: that
+     * configuration also gives both machines one PeerId, which already breaks control
+     * networking well before any strand launches. Revisit if machines ever share an
+     * owner key while holding distinct transport identities — the derivation would
+     * then need a per-machine discriminator (the `CadrePeer` PeerId) on the row.
+     */
+    private isSelfFoundedRow;
     /**
      * The owner keypair (base64url Ed25519) derived from this node's resolved
      * identity key. In the single-key reference model the owner signing key is
@@ -939,10 +1088,15 @@ export declare class CadreNode implements SAppIdLookup {
      * One address bound to `peerId`, or `null` when it cannot be — logged either
      * way, never thrown, so every caller's list-shaping stays total.
      *
+     * Used both to normalize addresses this node DIALS (a `CadrePeer` row, a
+     * seed-supplied bootstrap addr) and to normalize the ones it ANNOUNCES
+     * ({@link getStrandMultiaddrs}); the rule is the same either way — an address
+     * that does not reach `peerId` is not an address for `peerId`.
+     *
      * `withTrailingPeerId` encapsulates `/p2p/<peerId>`, which throws on a peer id
      * that does not parse. Unreachable for a `CadrePeer` row (the binding gate
-     * above parsed it already), reachable for a seed-supplied one
-     * ({@link bootstrapDialAddrs}).
+     * above parsed it already) and for our own node's id, reachable for a
+     * seed-supplied one ({@link bootstrapDialAddrs}).
      */
     private bindAddrToPeer;
     /** Parse multiaddr strings, dropping (and logging) any that fail to parse. */
@@ -1375,8 +1529,8 @@ export declare class CadreNode implements SAppIdLookup {
     /**
      * Rebuild a quiesced strand's runtime, re-resolving the volatile cohort input
      * first: the discovery seed may have grown since the strand last ran. Shared by
-     * the wake (`handleStrandWake`) and check-in (`handleStrandCheckIn`) paths so
-     * both apply the same fresh seed resolution. `resumeStrand` is idempotent
+     * the wake (`handleStrandWake`) and check-in (`handleStrandCheckIn`) paths so both
+     * apply the same fresh resolution. `resumeStrand` is idempotent
      * (returns the live instance unchanged) as a backstop against double-resume.
      */
     private resumeStrandRuntime;
@@ -1437,6 +1591,14 @@ export declare class CadreNode implements SAppIdLookup {
      * Add a strand with its sApp configuration.
      * The hosting application must provide the sApp schema when creating a strand.
      *
+     * This is the ATTACH half only — it starts the local instance and never publishes the
+     * `Strand` row. A joiner (the row arrived over the control network) wants exactly this; a
+     * FOUNDER wants {@link foundStrand}, which publishes and attaches in one resumable call.
+     * With no explicit `founder` flag, founder-ness is derived from the row's
+     * `FounderOwnerKey` (see {@link StrandConfig.founder}) — so attaching a row THIS machine
+     * published (e.g. re-attaching its own orphan after a restart) founds it, and attaching
+     * anyone else's row joins, without the caller needing to know which it is.
+     *
      * A rejected call leaves nothing running but DOES leave the sApp config
      * registered, deliberately: both an explicit retry and the {@link StrandWatcher}'s
      * automatic relaunch need it. So once the strand's row is visible on the control
@@ -1451,16 +1613,41 @@ export declare class CadreNode implements SAppIdLookup {
      * owner identity, so other cadre members discover it via control-network
      * sync (their {@link StrandWatcher} fires `strand:discovered`).
      *
-     * This is the owner-signed `Strand` INSERT that {@link addStrand}
-     * deliberately omits: `addStrand` only starts the LOCAL strand instance,
-     * whereas publishing makes the strand visible cadre-wide. A typical creator
-     * does both (start locally + publish); a discovering peer only does
-     * `addStrand` (the row already exists).
+     * **Founding a strand is TWO steps** — this one (publish the row cadre-wide) and
+     * {@link addStrand} (start the local instance, `founder: true` to write the strand's
+     * `Header`/founding membership). `addStrand` deliberately omits the insert: it only
+     * starts the LOCAL instance, whereas publishing makes the strand visible cadre-wide. A
+     * discovering peer only does `addStrand` (the row already exists). Callers founding a
+     * strand should use {@link foundStrand}, which performs both steps and is safe to
+     * re-run — hand-rolling the pair is what left strands half-founded when an app was
+     * killed between them.
+     *
+     * **Idempotent for identical content.** A live row whose `(Type, MemberPrivateKey)` match
+     * the arguments is the state this call would have produced, so the call logs and returns
+     * that row instead of writing — a publish interrupted after it committed can be repeated.
+     * DIFFERENT content on the same id throws, naming the columns that differ, rather than
+     * surfacing the raw `UNIQUE constraint failed: Strand.Id`: silently accepting it would
+     * let a retry reopen a closed strand or swap the key gating its reads. The read and the
+     * insert are not atomic, so a concurrent founder (two machines of one party, same id) is
+     * caught on the insert's uniqueness rejection and resolved the same way — re-read, no-op
+     * on a match, rethrow otherwise. Never an overwrite either way.
+     *
+     * A tombstoned strand is NOT resurrected here: {@link unpublishStrand} deletes the row, so
+     * the idempotent branch is unreachable and the ordinary publish path re-seats it, exactly
+     * as that method documents.
+     *
+     * **Already stuck on `UNIQUE constraint failed: Strand.Id`?** The row is already published
+     * — attach, do NOT republish: `addStrand` (or {@link foundStrand}) with the id and, for a
+     * closed strand, the `MemberPrivateKey` read back from the row. `unpublishStrand` + a
+     * fresh publish also clears it for an OPEN strand, but is destructive for a closed one
+     * (the key exists nowhere else). No app-data wipe is needed for either.
      *
      * The insert is signed with the ed25519 key behind this node's PeerId — which
      * {@link ed25519KeyPairFromLibp2p} also exposes as the node's owner keypair,
-     * so peer identity and owner key are one and the same. That key must be
-     * enrolled in `OwnerKey` (e.g. via {@link ControlDatabase.ensureOwnerKey}
+     * so peer identity and owner key are one and the same. That key is also persisted on the
+     * row as `FounderOwnerKey` (the schema pins the column to the verified signer), which is
+     * what later lets any launch derive "this machine is the founder" from the row alone.
+     * The key must be enrolled in `OwnerKey` (e.g. via {@link ControlDatabase.ensureOwnerKey}
      * at genesis) or the schema's `Strand.AuthorizedInsert` constraint rejects the write.
      * Failing loudly here is intentional: a silently-unpublished strand would run
      * as a local-only island that no peer could ever discover or join.
@@ -1469,10 +1656,62 @@ export declare class CadreNode implements SAppIdLookup {
      *   {@link addStrand}).
      * @param type - `'o'` for open (default) or `'c'` for closed.
      * @param memberPrivateKey - Optional membership key for a closed strand.
-     * @throws if the node is not started, exposes no owner signing key, the id is blank, or
-     *   the control DB rejects the (unauthorized) insert.
-     */
-    publishStrand(strandId: string, type?: 'o' | 'c', memberPrivateKey?: string): Promise<void>;
+     * @returns The live `Strand` row — the one just inserted, or the matching one already
+     *   there. A closed strand's caller should carry THIS row's `MemberPrivateKey` forward:
+     *   on a repeat it is the stored key, not the argument.
+     * @throws if the node is not started, exposes no owner signing key, the id is blank, a
+     *   row with the same id holds different content, or the control DB rejects the
+     *   (unauthorized) insert.
+     */
+    publishStrand(strandId: string, type?: 'o' | 'c', memberPrivateKey?: string): Promise<StrandRow>;
+    /**
+     * 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.
+     *
+     * Safe to re-run from any point of interruption, which hand-rolling
+     * {@link publishStrand} + {@link addStrand} is not. Either half can already have
+     * happened:
+     *
+     * - **row already published** → the stored row is adopted rather than re-published, so a
+     *   run killed after the insert committed no longer dies on
+     *   `UNIQUE constraint failed: Strand.Id`. For a closed strand the row's STORED
+     *   `MemberPrivateKey` wins over `config.memberPrivateKey`: a caller that mints a key per
+     *   attempt (as the reference apps do) would otherwise present a key that does not match
+     *   the membership already seated in the strand.
+     * - **instance already running** → the tracked instance is returned, and — because the
+     *   `Strand` row records its publishing machine (`FounderOwnerKey`) — a founder request
+     *   against an instance that was first launched as a joiner now runs the (idempotent,
+     *   insert-if-absent) founder bootstrap on it rather than silently skipping it
+     *   ({@link StrandInstanceManager.foundExistingStrand}). So a strand that something else
+     *   attached first — the reference RN app's `strand:discovered` handler after a restart,
+     *   or this node's own {@link StrandWatcher} poll winning `launchStrand`'s
+     *   `resolveCohortSeed` window — still ends up with its `Strand.Header` written.
+     *
+     * Founder-ness is resolved FROM THE ROW, not assumed: this machine founds iff the
+     * resolved row's `FounderOwnerKey` is its own owner key. A fresh publish records this
+     * machine, so the common path founds; a machine that lost a concurrent founding race to
+     * a sibling adopts the sibling's row and ATTACHES instead — deliberately, since two
+     * machines bootstrapping the same strand on separate replicas is the double-`Header`
+     * hazard. The returned {@link FoundStrandResult.founded} says which happened.
+     *
+     * `Type` is compared, not adopted: a stored row of the other type means the caller and
+     * the control plane disagree about what this strand IS, so it throws.
+     *
+     * @returns The instance AND the row the strand actually runs under — read the membership
+     *   key from the returned row, not from a freshly minted one ({@link FoundStrandResult}).
+     * @throws if the node is not started, the id is blank, a published row of the same id has
+     *   a different `Type`, or either half rejects.
+     */
+    foundStrand(config: FoundStrandConfig): Promise<FoundStrandResult>;
+    /**
+     * Resume onto an already-published `Strand` row: keep its stored content, reject a type
+     * disagreement. The stored `MemberPrivateKey` is authoritative — see {@link foundStrand}
+     * for why a caller-minted key must lose here (and why that is NOT the same rule as
+     * {@link publishStrand}'s, which throws on a key mismatch because it is being asked to
+     * WRITE that key, not to resume onto what already exists).
+     */
+    private adoptPublishedStrand;
     /**
      * Remove this party's `Strand` row from the shared control database — the owner-signed
      * inverse of {@link publishStrand}.
@@ -1624,14 +1863,25 @@ export declare class CadreNode implements SAppIdLookup {
      * seed, starts the strand, and registers it with the hibernation manager
      * before emitting `strand:started`.
      *
-     * Idempotent no-op when the strand manager already tracks `strand.Id` — the
-     * ordinary founding sequence is `addStrand` (starts it locally) followed by
-     * `publishStrand` (makes it visible), so this node's own `StrandWatcher`
-     * rediscovers a row it already started and calls this again via
-     * `handleStrandAdded`. Without the guard that re-entry would resolve a fresh
+     * Founder-ness: an explicit `founder` argument wins (the formation/responder flows pass
+     * one deliberately — their consent-seated rows carry a null `FounderOwnerKey`); when
+     * unset it is DERIVED from the row, so the control-discovered path
+     * (`handleStrandAdded`) and a restart's re-attach found this machine's own strands
+     * without the caller having to know. The derivation is pure key comparison — no I/O.
+     *
+     * Idempotent when the strand manager already tracks `strand.Id` — the watcher
+     * rediscovers a row this node already started and calls this again via
+     * `handleStrandAdded`; without the guard that re-entry would resolve a fresh
      * (already-connected) cohort seed and re-emit `strand:started` for an
      * instance that never stopped. The guard runs before the cohort-seed RPC
-     * fan-out, so a rediscovery costs nothing beyond the map lookup.
+     * 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
+     * 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
+     * so the bootstrap actually runs before this resolves.
      */
     private launchStrand;
     /**
@@ -1661,6 +1911,13 @@ export declare class CadreNode implements SAppIdLookup {
      * for a relay we are not yet connected to.
      */
     private resolveCohortSeed;
+    /**
+     * The own-party half of {@link resolveCohortSeed}: strand-network addresses resolved
+     * from CONNECTED cohort siblings over the control-mesh strand-addr RPC, doubling as
+     * the delegate announcement when `delegatePeerId` is given. Empty when the control DB
+     * or node is absent (not yet started / torn down).
+     */
+    private resolveSiblingSeed;
     /**
      * The co-cadre siblings worth sending a strand-addr RPC to right now: cohort
      * members (self excluded) we already hold an open control connection to. They
@@ -1774,9 +2031,18 @@ export declare class CadreNode implements SAppIdLookup {
      */
     private refreshStrandPeerAddrs;
     /**
-     * One strand's share of {@link refreshStrandPeerAddrs}: RPC the siblings, then
-     * merge their answers into this strand's address book. Errors are logged and
-     * swallowed so one strand's failure never costs the others their refresh.
+     * One strand's share of {@link refreshStrandPeerAddrs}: RPC the siblings, union their
+     * answers with this strand's cross-party contact addresses, and merge the lot into the
+     * strand's address book. Errors are logged and swallowed so one strand's failure never
+     * costs the others their refresh.
+     *
+     * `targets` may be EMPTY — a solo node, or one whose only control peers are strangers.
+     * The cross-party addresses still have to be re-merged in that case: they were learned
+     * at formation and can never be re-resolved, so this periodic re-merge is the ONLY
+     * thing standing between them and the peerStore's one-hour expiry. A strand with
+     * neither a sibling to ask nor a contact entry does nothing and leaves its throttle
+     * unstamped, so the next reconcile tick retries rather than sitting out the whole
+     * refresh interval having done nothing.
      */
     private refreshOneStrandPeerAddrs;
     /**
@@ -1797,6 +2063,15 @@ export declare class CadreNode implements SAppIdLookup {
      * handshake, and a bad entry costs one failed dial that ages out at the
      * peerStore's one-hour expiry. No new gating here — cross-party strand trust is
      * `backlog/strand-network-nat-relay-reachability`.
+     *
+     * NOTE: one input does NOT age out — the cross-party addresses a formation
+     * carried back ({@link crossPartyStrandAddrs}). Nothing can re-resolve them, so
+     * {@link refreshStrandPeerAddrs} re-merges the same stored list every pass, which
+     * also means a junk entry from a responder survives for the node's lifetime rather
+     * than an hour. Bounded to {@link MAX_STRAND_ADDRS} per strand, from a party this
+     * node deliberately formed a strand with, and still authority-free — so the
+     * exposure is a handful of failed dials, not a trust hole. Evict on
+     * `unpublishStrand` if that ever stops being an acceptable price.
      */
     private mergeStrandPeerAddrs;
     /**
@@ -2191,6 +2466,23 @@ export declare class CadreNode implements SAppIdLookup {
      * best-effort (a failed read keeps the previous snapshot); never rejects.
      */
     refreshMembershipGate(reason?: string): Promise<void>;
+    /**
+     * Re-materialize a CLOSED strand's revoked-peer deny set now, and hang up any
+     * 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.
+     *
+     * 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.
+     */
+    refreshRevocationEnforcement(strandId: string): Promise<void>;
     /**
      * The single in-flight refresh loop behind {@link refreshMembershipGate}: read
      * until the stale flag stays clear, then release the slot.
@@ -2337,6 +2629,17 @@ export declare class CadreNode implements SAppIdLookup {
      * @returns The member key and strand info if successful
      */
     formStrand(invitation: OpenInvitation, disclosure?: StrandFormationDisclosure): Promise<FormStrandResult>;
+    /**
+     * Remember the responder's strand-network addresses for a strand this node just
+     * formed, so the strand's discovery seed has something to work with when the app
+     * launches it (see {@link crossPartyStrandAddrs}).
+     *
+     * Scoped strictly to `strandId`: these addresses reach ONE strand node of ONE other
+     * party and must never seed another strand's mesh or the control peerStore. An empty
+     * list is recorded as no entry at all rather than an empty one, so a later formation
+     * against the same strand that DOES disclose addresses is not shadowed.
+     */
+    private recordCrossPartyStrandAddrs;
     /**
      * Encode an open invitation for out-of-band delivery (QR, link, etc.).
      */