@serfab/cadre-core 1.8.0 → 1.9.0

package/dist/strand-peer-book.js

@@ -1,361 +0,0 @@
-/**
- * Node-local, NON-replicated **strand peer book**: for each strand this node runs,
- * the strand peers it knows an address for — the other parties' strand transport
- * peers, learned at formation and observed on every connection — with their
- * last-known strand-network addresses and when this node last held a connection
- * to them. Read on every launch, hibernation resume and periodic address refresh,
- * so a machine that restarts dials the peers it was talking to BEFORE it does
- * anything else, instead of coming back up alone.
- *
- * Why it exists (gotchoices/sereus#18): a cross-party strand learned the other
- * party's strand addresses exactly once, at formation, into an in-memory map, and
- * the strand-addr RPC answers own-party siblings only. After a restart neither
- * relay-only party had any address for the other: the FRET ring and the Optimystic
- * cohort each held only self, the strand reported `active`, local writes
- * succeeded, nothing replicated.
- *
- * NOTE: interim, to be replaced (maintainer decision, 2026-09-28). FRET's
- * `plan/10-feat-address-hints-in-neighbor-exchange` carries signed peer records in
- * its neighbour exchange and its saved routing table. Once a FRET release with it
- * reaches `@optimystic/db-p2p`, remove this book and the swap and pass db-p2p
- * `persistence` for strand nodes instead; `blocked/retire-strand-peer-book-for-fret-address-hints`
- * tracks that.
- *
- * NOTE: accepted design boundary (maintainer decision, 2026-09-27) — this is a
- * per-machine record in the machine's own storage, NOT a registry inside the
- * strand database. An in-strand registry (`Strand.MemberPeer` rows carrying
- * addresses) would let a member reach peers it has never connected to while they
- * are offline; nothing needs that today, and it is ruled out for now. Revisit only
- * if a case needs addresses to reach members that are offline.
- *
- * Three implementations mirroring `bootstrap-peer-store.ts` (read that first —
- * same "must outlive the process, storage differs per platform" problem, both
- * persistent forms share `node-local-snapshot.ts`):
- *  - {@link MemoryStrandPeerBookStore} (this module, cross-platform) — ephemeral;
- *    the default when no store is injected via `CadreNodeConfig.strandPeers`. A
- *    node using it is exactly the pre-#18 shape after a restart.
- *  - {@link PersistentStrandPeerBookStore} (this module, cross-platform) — durable
- *    over any `DurableSlot` the embedding app supplies.
- *  - `FileStrandPeerBookStore` — the above over a Node file in the node's state
- *    directory; Node-only, behind the subpath
- *    `@serfab/cadre-core/strand-peer-book-file` (same isolation pattern as
- *    `bootstrap-peer-store-file`) so `node:fs` never lands in the RN/browser graph.
- *
- * One store per NODE holding every strand, rather than one slot per strand: the
- * snapshot machinery writes one slot whole, and a node runs a handful of strands
- * with at most {@link MAX_STRAND_PEERS} peers each — a few KB. The embedder
- * therefore wires one slot, like the other node-local stores.
- *
- * **Nothing here is trust-bearing.** An address grants no authority: the dialed
- * peer authenticates by peer id at the handshake, and every address is bound to
- * the peer id it is filed under (see {@link StrandPeerEntry.addrs}), so a dial
- * cannot be redirected to whoever answers. A junk address costs one failed dial per
- * launch until it ages out or the peer's next connection replaces the entry. What a
- * persistent backend's loader DOES owe is dropping structurally junk entries rather
- * than carrying them into the dial loop.
- */
-import debug from 'debug';
-import { peerIdFromString } from '@libp2p/peer-id';
-import { NodeLocalSnapshot } from './node-local-snapshot.js';
-import { groupAddrsByPeerId } from './peer-addr-book.js';
-import { orderSignalingFirst } from './peer-record.js';
-import { MAX_STRAND_ADDRS } from './strand-formation-protocol.js';
-const log = debug('sereus:cadre:strand-peer-book');
-/**
- * Cap on the peers remembered per strand. When full, the entry with the smallest
- * `max(issuedAt, lastSeenAt)` is evicted. Sixteen is generous for the parties a
- * strand has today (two, occasionally a few), and it bounds the worst case of a
- * launch dialing dead entries: a failed relayed dial costs up to 16 s at the
- * declared link, so the cap — with aging — is what keeps a stale book from
- * stalling bring-up for minutes.
- */
-export const MAX_STRAND_PEERS = 16;
-/**
- * Default age after which an entry nobody has refreshed is dropped: 14 days from
- * `max(issuedAt, lastSeenAt)`. A live peer refreshes its entry on every connection,
- * so only a peer this node has not reached in two weeks ages out. Overridable per
- * store via {@link StrandPeerBookOptions.maxAgeMs}.
- */
-export const STRAND_PEER_MAX_AGE_MS = 14 * 24 * 60 * 60 * 1000;
-function resolveOptions(options) {
-    return { maxAgeMs: options?.maxAgeMs ?? STRAND_PEER_MAX_AGE_MS, now: options?.now ?? Date.now };
-}
-/** The moment an entry was last vouched for, by whichever clock spoke last. */
-export function strandPeerFreshness(entry) {
-    return Math.max(entry.issuedAt, entry.lastSeenAt);
-}
-/**
- * The merge rule, in one place. Returns the entry to hold for `incoming.peerId`
- * given what is already held — always a NEW object, so a held entry is never mutated
- * in place (the persistent backend's snapshot `put` replaces rather than patches).
- * `incoming` is assumed sanitized ({@link sanitizeStrandPeerEntry}).
- *
- * - A signed entry never yields to an unsigned one for the same peer: the peer's own
- *   statement outranks this node's observation of it.
- * - Between two signed entries the greater `issuedAt` wins; between two unsigned
- *   entries the greater `lastSeenAt` wins. A tie goes to `incoming`.
- * - `lastSeenAt` is always the max of old and new whichever entry wins, because it
- *   is this node's own observation and no remote statement can lower it.
- */
-export function mergeStrandPeerEntry(existing, incoming) {
-    const winner = existing === undefined || incomingWins(existing, incoming) ? incoming : existing;
-    return {
-        ...winner,
-        addrs: [...winner.addrs],
-        lastSeenAt: Math.max(existing?.lastSeenAt ?? 0, incoming.lastSeenAt)
-    };
-}
-function incomingWins(existing, incoming) {
-    if (existing.sig !== undefined && incoming.sig === undefined)
-        return false;
-    if (existing.sig === undefined && incoming.sig !== undefined)
-        return true;
-    return existing.sig !== undefined
-        ? incoming.issuedAt >= existing.issuedAt
-        : incoming.lastSeenAt >= existing.lastSeenAt;
-}
-/**
- * Shape an entry for storage: the peer id must parse (else `undefined` — not a dial
- * target at all), and `addrs` is reduced to the entries that attribute to `peerId`
- * under `groupAddrsByPeerId`'s rule, de-duplicated, capped at `MAX_STRAND_ADDRS`, and
- * — for an UNSIGNED entry only — reordered signaling-first. A signed entry keeps the
- * signer's order: its signature covers the address list as signed, and the swap
- * forwards the stored copy, so any reordering here would make every forwarded entry
- * fail verification at the next peer (every signer already orders signaling-first). An
- * entry may legitimately end up with NO addresses — a signed "not reachable right
- * now" from the swap protocol is truthful and displaces a stale reachable list — so
- * an empty list is kept, not rejected.
- */
-export function sanitizeStrandPeerEntry(entry) {
-    try {
-        peerIdFromString(entry.peerId);
-    }
-    catch (error) {
-        log('dropping entry for unparsable peer id %s: %o', entry.peerId, error);
-        return undefined;
-    }
-    const attributed = (groupAddrsByPeerId([...entry.addrs]).get(entry.peerId) ?? []).map((ma) => ma.toString());
-    const addrs = (entry.sig === undefined ? orderSignalingFirst(attributed) : attributed).slice(0, MAX_STRAND_ADDRS);
-    if (addrs.length < entry.addrs.length) {
-        log('peer %s: kept %d of %d addr(s) — the rest do not attribute to it or exceed the cap', entry.peerId, addrs.length, entry.addrs.length);
-    }
-    return {
-        peerId: entry.peerId,
-        addrs,
-        issuedAt: entry.issuedAt,
-        ...(entry.sig !== undefined && { sig: entry.sig }),
-        lastSeenAt: entry.lastSeenAt
-    };
-}
-/**
- * Apply {@link mergeStrandPeerEntry} to one strand's map and re-bound it: aged-out
- * entries dropped, then the stalest evicted past {@link MAX_STRAND_PEERS}. Returns a
- * NEW map (the persistent backend's snapshot `put` replaces rather than mutates),
- * or `undefined` when the incoming entry was unusable and nothing changed.
- *
- * NOTE: aging is time-based only. The book cannot see dial outcomes (dials happen
- * inside libp2p and Optimystic), so a dead entry is re-dialed on every launch and
- * refresh until it ages out or the peer's next connection replaces it — bounded by
- * the peer cap and the 14-day age. If a case ever shows a dead entry re-dialed every
- * tick for two weeks, the lever is observing `connection:close` / dial failures
- * here, not a shorter age.
- */
-function mergeIntoStrand(strand, incoming, options) {
-    const entry = sanitizeStrandPeerEntry(incoming);
-    if (!entry)
-        return undefined;
-    const merged = mergeStrandPeerEntry(strand?.[entry.peerId], entry);
-    // Pruned AFTER the insert, so an incoming entry that is already past the age
-    // (a swap forwarding a months-old statement) never lands at all.
-    return evictPastCap(pruneAged({ ...strand, [entry.peerId]: merged }, options));
-}
-/**
- * The strand's map without the entries older than `maxAgeMs` (a new object only when
- * something dropped).
- *
- * Nothing is exempt, the node's OWN entry included: the book swap
- * (`strand-peer-book-swap.ts`) keeps the entry it SENDS in memory and re-signs it on
- * every address change and every launch, so the stored copy is a record for
- * diagnostics and the seed's self-skip, and losing it to age costs nothing. That is
- * why the store need not tell self from a peer.
- */
-function pruneAged(strand, options) {
-    const cutoff = options.now() - options.maxAgeMs;
-    const live = Object.values(strand).filter((entry) => strandPeerFreshness(entry) >= cutoff);
-    return live.length === Object.keys(strand).length ? strand : Object.fromEntries(live.map((e) => [e.peerId, e]));
-}
-/**
- * Drop the stalest entries until the strand holds at most {@link MAX_STRAND_PEERS}.
- *
- * NOTE: freshness ranks a forwarded statement (signer's `issuedAt`, up to five minutes
- * ahead of this clock) above a peer this node has itself connected to, so one swap
- * frame of sixteen fresh self-signed entries evicts every met peer — see
- * `backlog/debt-strand-peer-book-remote-write-bounds`.
- */
-function evictPastCap(strand) {
-    const entries = Object.values(strand);
-    if (entries.length <= MAX_STRAND_PEERS)
-        return strand;
-    const kept = sortFreshestFirst(entries).slice(0, MAX_STRAND_PEERS);
-    log('evicting %d stalest peer(s) past the %d-peer cap', entries.length - kept.length, MAX_STRAND_PEERS);
-    return Object.fromEntries(kept.map((e) => [e.peerId, e]));
-}
-function sortFreshestFirst(entries) {
-    return [...entries].sort((a, b) => strandPeerFreshness(b) - strandPeerFreshness(a));
-}
-/** The live entries of one strand, freshest first, copied. */
-function liveEntries(strand, options) {
-    if (!strand)
-        return [];
-    return sortFreshestFirst(Object.values(pruneAged(strand, options)))
-        .map((entry) => ({ ...entry, addrs: [...entry.addrs] }));
-}
-/** The strand's map without `peerId`, or `undefined` when that leaves nothing (or nothing was there). */
-function withoutPeer(strand, peerId) {
-    if (!strand || !(peerId in strand))
-        return strand;
-    const { [peerId]: _dropped, ...rest } = strand;
-    return Object.keys(rest).length === 0 ? undefined : rest;
-}
-/**
- * Ephemeral in-memory book for nodes without durable storage (tests, and the
- * default when nothing is injected). Same contract, no disk: a node using this
- * forgets every strand peer on restart — the #18 shape.
- */
-export class MemoryStrandPeerBookStore {
-    constructor(partyId, options) {
-        this.partyId = partyId;
-        this.strands = new Map();
-        this.options = resolveOptions(options);
-    }
-    entries(strandId) {
-        return liveEntries(this.strands.get(strandId), this.options);
-    }
-    async merge(strandId, entry) {
-        const next = mergeIntoStrand(this.strands.get(strandId), entry, this.options);
-        if (next) {
-            this.strands.set(strandId, next);
-            log('strand %s: peer %s merged (party=%s, addrs=%d)', strandId, entry.peerId, this.partyId, entry.addrs.length);
-        }
-    }
-    async forget(strandId, peerId) {
-        if (peerId === undefined) {
-            if (this.strands.delete(strandId)) {
-                log('strand %s: book forgotten (party=%s)', strandId, this.partyId);
-            }
-            return;
-        }
-        const next = withoutPeer(this.strands.get(strandId), peerId);
-        if (next === undefined) {
-            this.strands.delete(strandId);
-        }
-        else {
-            this.strands.set(strandId, next);
-        }
-    }
-}
-/**
- * What the store persists: `strands` maps strandId -> (peerId -> {@link StrandPeerEntry}).
- *
- * A structurally junk PEER entry is dropped and its siblings retained; a strand
- * whose value is not a record, or that holds no usable peer, is dropped as a whole
- * (`drop-entry`) — nothing here is trust-bearing (see the module comment) and the
- * book is a restarted node's only way back to the other parties, so discarding the
- * whole set over one bad entry would be strictly worse. What "junk" means: a peer id
- * that does not parse, a non-array or non-string address list, a non-number
- * `issuedAt` / `lastSeenAt`, or a non-string `sig`. Aged-out entries are dropped at
- * load too, so a slot last written months ago yields nothing to dial.
- */
-function strandPeerBookSnapshotSpec(options) {
-    return {
-        label: 'strand peer book',
-        payloadKey: 'strands',
-        unusableEntry: 'drop-entry',
-        acceptEntry: (strandId, raw) => {
-            if (typeof raw !== 'object' || raw === null || Array.isArray(raw))
-                return undefined;
-            let strand = {};
-            for (const [peerId, value] of Object.entries(raw)) {
-                const entry = acceptPeerEntry(peerId, value);
-                if (!entry) {
-                    log('strand %s: dropping unusable persisted entry for %s', strandId, peerId);
-                    continue;
-                }
-                strand[peerId] = entry;
-            }
-            strand = pruneAged(strand, options);
-            return Object.keys(strand).length === 0 ? undefined : strand;
-        }
-    };
-}
-function acceptPeerEntry(peerId, value) {
-    if (typeof value !== 'object' || value === null)
-        return undefined;
-    const { addrs, issuedAt, sig, lastSeenAt } = value;
-    if (!Array.isArray(addrs) || addrs.some((addr) => typeof addr !== 'string' || addr.length === 0))
-        return undefined;
-    if (typeof issuedAt !== 'number' || typeof lastSeenAt !== 'number')
-        return undefined;
-    if (sig !== undefined && typeof sig !== 'string')
-        return undefined;
-    return sanitizeStrandPeerEntry({
-        peerId,
-        addrs: addrs,
-        issuedAt,
-        ...(sig !== undefined && { sig }),
-        lastSeenAt
-    });
-}
-/**
- * Durable {@link StrandPeerBookStore} over an app-supplied {@link DurableSlot} —
- * the cross-platform half of every persistent backend (the Node
- * `FileStrandPeerBookStore` is this class over a file slot).
- *
- * Construct via {@link open}. Load and persist policy — what an absent, corrupt,
- * foreign-party or unreadable slot does (the last one THROWS, as
- * `PersistentBootstrapPeerStore.open` does), and what a failed persist does — is
- * documented once on `NodeLocalSnapshot`; this class only supplies the payload shape
- * and the drop-the-bad-entry policy above. Writes are serialised in-process by the
- * snapshot's write chain, so several strands' identify handlers merging at once
- * cannot interleave partial snapshots.
- */
-export class PersistentStrandPeerBookStore {
-    constructor(snapshot, options) {
-        this.snapshot = snapshot;
-        this.options = options;
-    }
-    /** Load (or cold-start) the party's book from `slot`. */
-    static async open(slot, partyId, options) {
-        const resolved = resolveOptions(options);
-        return new PersistentStrandPeerBookStore(await NodeLocalSnapshot.open(slot, partyId, strandPeerBookSnapshotSpec(resolved)), resolved);
-    }
-    get partyId() {
-        return this.snapshot.partyId;
-    }
-    entries(strandId) {
-        return liveEntries(this.snapshot.entrySnapshot().get(strandId), this.options);
-    }
-    /** Merge, visible via {@link entries} synchronously, then the full snapshot is persisted. */
-    merge(strandId, entry) {
-        const next = mergeIntoStrand(this.snapshot.entrySnapshot().get(strandId), entry, this.options);
-        if (!next)
-            return Promise.resolve();
-        log('strand %s: peer %s merged (party=%s, addrs=%d); persisting', strandId, entry.peerId, this.partyId, entry.addrs.length);
-        return this.snapshot.put(strandId, next);
-    }
-    /** Forget, gone from {@link entries} synchronously, then persisted — unless nothing was there. */
-    forget(strandId, peerId) {
-        if (peerId === undefined) {
-            if (this.snapshot.has(strandId)) {
-                log('strand %s: book forgotten (party=%s); persisting', strandId, this.partyId);
-            }
-            return this.snapshot.remove(strandId);
-        }
-        const current = this.snapshot.entrySnapshot().get(strandId);
-        const next = withoutPeer(current, peerId);
-        if (next === current)
-            return Promise.resolve();
-        return next === undefined ? this.snapshot.remove(strandId) : this.snapshot.put(strandId, next);
-    }
-}
-//# sourceMappingURL=strand-peer-book.js.map

package/dist/strand-peer-book.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"strand-peer-book.js","sourceRoot":"","sources":["../src/strand-peer-book.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuDG;AACH,OAAO,KAAK,MAAM,OAAO,CAAC;AAC1B,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,EAAE,iBAAiB,EAAgD,MAAM,0BAA0B,CAAC;AAC3G,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,MAAM,GAAG,GAAG,KAAK,CAAC,+BAA+B,CAAC,CAAC;AAEnD;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAEnC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAyF/D,SAAS,cAAc,CAAC,OAA+B;IACtD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,IAAI,sBAAsB,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;AACjG,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,mBAAmB,CAAC,KAAsB;IACzD,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CACnC,QAAqC,EACrC,QAAyB;IAEzB,MAAM,MAAM,GAAG,QAAQ,KAAK,SAAS,IAAI,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IAChG,OAAO;QACN,GAAG,MAAM;QACT,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;QACxB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,IAAI,CAAC,EAAE,QAAQ,CAAC,UAAU,CAAC;KACpE,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,QAAyB,EAAE,QAAyB;IACzE,IAAI,QAAQ,CAAC,GAAG,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC3E,IAAI,QAAQ,CAAC,GAAG,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC1E,OAAO,QAAQ,CAAC,GAAG,KAAK,SAAS;QAChC,CAAC,CAAC,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ;QACxC,CAAC,CAAC,QAAQ,CAAC,UAAU,IAAI,QAAQ,CAAC,UAAU,CAAC;AAC/C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAsB;IAC7D,IAAI,CAAC;QACJ,gBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAChB,GAAG,CAAC,8CAA8C,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACzE,OAAO,SAAS,CAAC;IAClB,CAAC;IACD,MAAM,UAAU,GAAG,CAAC,kBAAkB,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC7G,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IAClH,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACvC,GAAG,CAAC,oFAAoF,EACvF,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IACD,OAAO;QACN,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,KAAK;QACL,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC;QAClD,UAAU,EAAE,KAAK,CAAC,UAAU;KAC5B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,eAAe,CACvB,MAA+B,EAC/B,QAAyB,EACzB,OAAwB;IAExB,MAAM,KAAK,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAChD,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAC7B,MAAM,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;IACnE,6EAA6E;IAC7E,iEAAiE;IACjE,OAAO,YAAY,CAAC,SAAS,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;AAChF,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,SAAS,CAAC,MAAmB,EAAE,OAAwB;IAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC;IAC3F,OAAO,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACjH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,MAAmB;IACxC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,OAAO,CAAC,MAAM,IAAI,gBAAgB;QAAE,OAAO,MAAM,CAAC;IACtD,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;IACnE,GAAG,CAAC,kDAAkD,EAAE,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACxG,OAAO,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,iBAAiB,CAAC,OAA0B;IACpD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,8DAA8D;AAC9D,SAAS,WAAW,CAAC,MAA+B,EAAE,OAAwB;IAC7E,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IACvB,OAAO,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;SACjE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,yGAAyG;AACzG,SAAS,WAAW,CAAC,MAA+B,EAAE,MAAc;IACnE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IAClD,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC;IAC/C,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,yBAAyB;IAIrC,YAAqB,OAAe,EAAE,OAA+B;QAAhD,YAAO,GAAP,OAAO,CAAQ;QAHnB,YAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAIzD,IAAI,CAAC,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,CAAC,QAAgB;QACvB,OAAO,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9D,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,QAAgB,EAAE,KAAsB;QACnD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9E,IAAI,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACjC,GAAG,CAAC,gDAAgD,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACjH,CAAC;IACF,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,QAAgB,EAAE,MAAe;QAC7C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnC,GAAG,CAAC,sCAAsC,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACrE,CAAC;YACD,OAAO;QACR,CAAC;QACD,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;IACF,CAAC;CACD;AAED;;;;;;;;;;;GAWG;AACH,SAAS,0BAA0B,CAAC,OAAwB;IAC3D,OAAO;QACN,KAAK,EAAE,kBAAkB;QACzB,UAAU,EAAE,SAAS;QACrB,aAAa,EAAE,YAAY;QAC3B,WAAW,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,EAAE;YAC9B,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAC;YACpF,IAAI,MAAM,GAAgB,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAA8B,CAAC,EAAE,CAAC;gBAC9E,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;oBACZ,GAAG,CAAC,qDAAqD,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;oBAC7E,SAAS;gBACV,CAAC;gBACD,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;YACxB,CAAC;YACD,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACpC,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9D,CAAC;KACD,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,MAAc,EAAE,KAAc;IACtD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IAClE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,KAAgC,CAAC;IAC9E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACnH,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,UAAU,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IACrF,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IACnE,OAAO,uBAAuB,CAAC;QAC9B,MAAM;QACN,KAAK,EAAE,KAAiB;QACxB,QAAQ;QACR,GAAG,CAAC,GAAG,KAAK,SAAS,IAAI,EAAE,GAAG,EAAE,CAAC;QACjC,UAAU;KACV,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,6BAA6B;IACzC,YACkB,QAAwC,EACxC,OAAwB;QADxB,aAAQ,GAAR,QAAQ,CAAgC;QACxC,YAAO,GAAP,OAAO,CAAiB;IACvC,CAAC;IAEJ,yDAAyD;IACzD,MAAM,CAAC,KAAK,CAAC,IAAI,CAChB,IAAiB,EACjB,OAAe,EACf,OAA+B;QAE/B,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,IAAI,6BAA6B,CACvC,MAAM,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC,EACjF,QAAQ,CACR,CAAC;IACH,CAAC;IAED,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;IAC9B,CAAC;IAED,OAAO,CAAC,QAAgB;QACvB,OAAO,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/E,CAAC;IAED,6FAA6F;IAC7F,KAAK,CAAC,QAAgB,EAAE,KAAsB;QAC7C,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/F,IAAI,CAAC,IAAI;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QACpC,GAAG,CAAC,4DAA4D,EAC/D,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,kGAAkG;IAClG,MAAM,CAAC,QAAgB,EAAE,MAAe;QACvC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjC,GAAG,CAAC,kDAAkD,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACjF,CAAC;YACD,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,OAAO;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAC/C,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAChG,CAAC;CACD"}

package/dist/strand-peer-observer.d.ts

@@ -1,88 +0,0 @@
-import type { Connection, Libp2p, PeerId } from '@libp2p/interface';
-/** Minimum gap between two reports of ONE peer with an unchanged address set. */
-export declare const STRAND_PEER_OBSERVE_THROTTLE_MS: number;
-/** One strand peer seen live: its strand transport peer id and the addresses it is dialable at. */
-export interface StrandPeerObservation {
-    peerId: string;
-    /** Bound to `peerId`, signaling-first, at most `MAX_STRAND_ADDRS`. */
-    addrs: string[];
-}
-export interface StrandPeerObserverDeps {
-    /** For logs (the strand id). */
-    label: string;
-    /** The strand's libp2p node. */
-    libp2p: Libp2p;
-    /** This strand network's `/optimystic/<networkName>` prefix — the block-transfer gate. */
-    protocolPrefix: string;
-    /** Called for every (throttled) observation; must not throw. */
-    onObserved: (observation: StrandPeerObservation) => void;
-}
-export interface StrandPeerObserverOptions {
-    /** Default {@link STRAND_PEER_OBSERVE_THROTTLE_MS}. */
-    throttleMs?: number;
-    /** Clock, for tests. Default `Date.now`. */
-    now?: () => number;
-}
-/**
- * Anything that prints as a multiaddr. libp2p's identify result and peer store hand
- * back its nested `@multiformats/multiaddr` copy, a structurally different type from
- * this package's, so addresses are taken by their string form and re-parsed here.
- */
-export interface AddrLike {
-    toString(): string;
-}
-/** One connected peer as the peer store knows it: what identify recorded, plus its open connections. */
-export interface ConnectedIdentifiedPeer {
-    peerId: PeerId;
-    protocols: string[];
-    /** The stored addresses: identify-announced, plus whatever else was merged in. */
-    addrs: AddrLike[];
-    connections: Connection[];
-}
-/**
- * Every peer `libp2p` holds a connection to AND has already identified (it is in the
- * peer store), grouped per peer. A connected peer whose identify has not finished is
- * left out: its `peer:identify` event is still to come, and every listener that walks
- * this list at start subscribes to that event too. Shared by the peer-book observer
- * and the book swap (`strand-peer-book-swap.ts`), which both arm right after the
- * node exists and may already have missed an early peer's identify.
- */
-export declare function connectedIdentifiedPeers(libp2p: Libp2p, label: string): Promise<ConnectedIdentifiedPeer[]>;
-export declare class StrandPeerObserver {
-    private readonly deps;
-    private readonly throttleMs;
-    private readonly now;
-    private readonly lastReports;
-    private readonly onPeerIdentify;
-    private started;
-    private stopped;
-    constructor(deps: StrandPeerObserverDeps, options?: StrandPeerObserverOptions);
-    /** Subscribe to `peer:identify` and report the peers already connected and identified. */
-    start(): void;
-    /** Unsubscribe; later identify results are ignored. */
-    stop(): void;
-    /**
-     * Report every connected peer the peer store already knows speaks this strand's
-     * protocol, with its stored addresses. A peer not yet in the store (identify has
-     * not finished) is left to the `peer:identify` handler. Returns the number of
-     * identified peers considered.
-     *
-     * NOTE: the stored addresses include what `CadreNode.mergeStrandPeerAddrs` merged
-     * INTO the peer store from the book, so this walk can re-vouch a dead address the
-     * book already held, until the peer's next `peer:identify` replaces the set with
-     * what it announces now. Bounded by the address cap; if a dead address ever shows
-     * up surviving across resumes, read only the peer store's identify-sourced
-     * addresses here rather than shortening the age.
-     */
-    private observeConnectedPeers;
-    /** Shape, throttle and report one peer. Never throws. */
-    private observe;
-    /** One report per peer per throttle window, unless the address set changed. */
-    private shouldReport;
-}
-/**
- * The addresses to file for `peerId`: its announced listen addrs plus every relayed
- * connection addr, each bound to `peerId`, de-duplicated, signaling-first, capped.
- * Re-parsed through this package's own `multiaddr` (see {@link AddrLike}).
- */
-export declare function dialableAddrs(peerId: string, listenAddrs: AddrLike[], connections: Connection[]): string[];

package/dist/strand-peer-observer.js

@@ -1,180 +0,0 @@
-/**
- * The strand peer book's OBSERVATION writer: on one strand libp2p node, every peer
- * whose identify result names this strand's block-transfer protocol — a strand peer,
- * never the circuit relay or a bootstrap node ({@link speaksBlockTransfer}, the
- * same gate `PeerJoinBackfill` schedules on) — is reported with its dialable
- * addresses, so `CadreNode` can merge an unsigned book entry for it
- * (`strand-peer-book.ts`). That is what lets a restarted machine dial the peers it
- * was talking to, instead of only the ones a formation once carried back.
- *
- * Dialable addresses are the peer's announced `listenAddrs` from the identify
- * result, plus the open connection's `remoteAddr` when it is relayed
- * (`/p2p-circuit`) — a relay-only peer announces its circuit listener, but the
- * address this node actually reached it on is the one proven to work. Every
- * address is bound to the peer id (`withTrailingPeerId`), ordered signaling-first
- * and capped like a formation's list, so the book files it under the right peer.
- *
- * Throttled to one report per peer per {@link STRAND_PEER_OBSERVE_THROTTLE_MS}
- * unless the address set changed, so a flapping relayed connection — identify
- * fires on every reconnect, every 16 s at worst — does not rewrite the node-local
- * slot each time. Best-effort throughout: nothing here throws into a libp2p event
- * handler.
- *
- * Lifecycle: one observer per running strand, armed in
- * `StrandInstanceManager.buildStrandRuntime` right after the libp2p node exists
- * (the bootstrap dials that follow `libp2p.start()` are exactly the peers worth
- * observing) and stopped in `releaseRuntime`, so a hibernation wake re-arms it on
- * the rebuilt node. `start` also walks the peers already connected, because
- * identify may have completed for an early peer before this object existed.
- */
-import debug from 'debug';
-import { multiaddr } from '@multiformats/multiaddr';
-import { speaksBlockTransfer } from './peer-join-backfill.js';
-import { isSignalingAddr, orderSignalingFirst, withTrailingPeerId } from './peer-record.js';
-import { MAX_STRAND_ADDRS } from './strand-formation-protocol.js';
-const log = debug('sereus:cadre:strand-peer-observer');
-/** Minimum gap between two reports of ONE peer with an unchanged address set. */
-export const STRAND_PEER_OBSERVE_THROTTLE_MS = 10 * 60 * 1000;
-/**
- * Every peer `libp2p` holds a connection to AND has already identified (it is in the
- * peer store), grouped per peer. A connected peer whose identify has not finished is
- * left out: its `peer:identify` event is still to come, and every listener that walks
- * this list at start subscribes to that event too. Shared by the peer-book observer
- * and the book swap (`strand-peer-book-swap.ts`), which both arm right after the
- * node exists and may already have missed an early peer's identify.
- */
-export async function connectedIdentifiedPeers(libp2p, label) {
-    const byPeer = new Map();
-    for (const connection of libp2p.getConnections()) {
-        const key = connection.remotePeer.toString();
-        const group = byPeer.get(key) ?? { peerId: connection.remotePeer, connections: [] };
-        group.connections.push(connection);
-        byPeer.set(key, group);
-    }
-    const identified = await Promise.all([...byPeer.values()].map(async ({ peerId, connections }) => {
-        try {
-            const peer = await libp2p.peerStore.get(peerId);
-            return { peerId, protocols: peer.protocols, addrs: peer.addresses.map((a) => a.multiaddr), connections };
-        }
-        catch (error) {
-            // NotFoundError: identify has not finished; the event handler will see it.
-            if (error.name !== 'NotFoundError') {
-                log('[%s] peer store read for %s failed — skipping it: %o', label, peerId.toString(), error);
-            }
-            return undefined;
-        }
-    }));
-    return identified.filter((peer) => peer !== undefined);
-}
-export class StrandPeerObserver {
-    constructor(deps, options) {
-        this.deps = deps;
-        this.lastReports = new Map();
-        this.started = false;
-        this.stopped = false;
-        this.throttleMs = options?.throttleMs ?? STRAND_PEER_OBSERVE_THROTTLE_MS;
-        this.now = options?.now ?? Date.now;
-        this.onPeerIdentify = (evt) => {
-            const { peerId, protocols, listenAddrs, connection } = evt.detail;
-            if (speaksBlockTransfer(protocols, this.deps.protocolPrefix)) {
-                this.observe(peerId, listenAddrs, [connection]);
-            }
-        };
-    }
-    /** Subscribe to `peer:identify` and report the peers already connected and identified. */
-    start() {
-        if (this.started || this.stopped)
-            return;
-        this.started = true;
-        this.deps.libp2p.addEventListener('peer:identify', this.onPeerIdentify);
-        void this.observeConnectedPeers().then((seen) => {
-            log('[%s] started (%d peer(s) already connected)', this.deps.label, seen);
-        });
-    }
-    /** Unsubscribe; later identify results are ignored. */
-    stop() {
-        if (this.stopped)
-            return;
-        this.stopped = true;
-        if (this.started) {
-            this.deps.libp2p.removeEventListener('peer:identify', this.onPeerIdentify);
-        }
-        this.lastReports.clear();
-        log('[%s] stopped', this.deps.label);
-    }
-    /**
-     * Report every connected peer the peer store already knows speaks this strand's
-     * protocol, with its stored addresses. A peer not yet in the store (identify has
-     * not finished) is left to the `peer:identify` handler. Returns the number of
-     * identified peers considered.
-     *
-     * NOTE: the stored addresses include what `CadreNode.mergeStrandPeerAddrs` merged
-     * INTO the peer store from the book, so this walk can re-vouch a dead address the
-     * book already held, until the peer's next `peer:identify` replaces the set with
-     * what it announces now. Bounded by the address cap; if a dead address ever shows
-     * up surviving across resumes, read only the peer store's identify-sourced
-     * addresses here rather than shortening the age.
-     */
-    async observeConnectedPeers() {
-        const peers = await connectedIdentifiedPeers(this.deps.libp2p, this.deps.label);
-        for (const { peerId, protocols, addrs, connections } of peers) {
-            if (!this.stopped && speaksBlockTransfer(protocols, this.deps.protocolPrefix)) {
-                this.observe(peerId, addrs, connections);
-            }
-        }
-        return peers.length;
-    }
-    /** Shape, throttle and report one peer. Never throws. */
-    observe(peerId, listenAddrs, connections) {
-        if (this.stopped)
-            return;
-        const id = peerId.toString();
-        // Identify is about remotes, so self never arrives here; belt and braces, since
-        // a node must never file its own addresses as a peer to dial.
-        if (id === this.deps.libp2p.peerId.toString())
-            return;
-        try {
-            const addrs = dialableAddrs(id, listenAddrs, connections);
-            if (!this.shouldReport(id, addrs))
-                return;
-            log('[%s] observed strand peer %s at %d addr(s)', this.deps.label, id, addrs.length);
-            this.deps.onObserved({ peerId: id, addrs });
-        }
-        catch (error) {
-            log('[%s] observing %s failed (ignored): %o', this.deps.label, id, error);
-        }
-    }
-    /** One report per peer per throttle window, unless the address set changed. */
-    shouldReport(peerId, addrs) {
-        const now = this.now();
-        const key = [...addrs].sort().join('\n');
-        const last = this.lastReports.get(peerId);
-        if (last && last.key === key && now - last.at < this.throttleMs) {
-            return false;
-        }
-        this.lastReports.set(peerId, { at: now, key });
-        return true;
-    }
-}
-/**
- * The addresses to file for `peerId`: its announced listen addrs plus every relayed
- * connection addr, each bound to `peerId`, de-duplicated, signaling-first, capped.
- * Re-parsed through this package's own `multiaddr` (see {@link AddrLike}).
- */
-export function dialableAddrs(peerId, listenAddrs, connections) {
-    const candidates = [
-        ...listenAddrs.map((ma) => ma.toString()),
-        ...connections.map((c) => c.remoteAddr.toString()).filter(isSignalingAddr)
-    ];
-    const bound = new Set();
-    for (const candidate of candidates) {
-        const addr = withTrailingPeerId(multiaddr(candidate), peerId);
-        if (addr === null) {
-            log('dropping addr %s — it names a peer other than %s', candidate, peerId);
-            continue;
-        }
-        bound.add(addr.toString());
-    }
-    return orderSignalingFirst([...bound]).slice(0, MAX_STRAND_ADDRS);
-}
-//# sourceMappingURL=strand-peer-observer.js.map

package/dist/strand-peer-observer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"strand-peer-observer.js","sourceRoot":"","sources":["../src/strand-peer-observer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,OAAO,KAAK,MAAM,OAAO,CAAC;AAE1B,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAC5F,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,MAAM,GAAG,GAAG,KAAK,CAAC,mCAAmC,CAAC,CAAC;AAEvD,iFAAiF;AACjF,MAAM,CAAC,MAAM,+BAA+B,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAmD9D;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAAC,MAAc,EAAE,KAAa;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyD,CAAC;IAChF,KAAK,MAAM,UAAU,IAAI,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC;QAClD,MAAM,GAAG,GAAG,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACpF,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,EAAgD,EAAE;QAC7I,IAAI,CAAC;YACJ,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAChD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,WAAW,EAAE,CAAC;QAC1G,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,2EAA2E;YAC3E,IAAK,KAAe,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;gBAC/C,GAAG,CAAC,sDAAsD,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YAC9F,CAAC;YACD,OAAO,SAAS,CAAC;QAClB,CAAC;IACF,CAAC,CAAC,CAAC,CAAC;IACJ,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,EAAmC,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;AACzF,CAAC;AAED,MAAM,OAAO,kBAAkB;IAQ9B,YAA6B,IAA4B,EAAE,OAAmC;QAAjE,SAAI,GAAJ,IAAI,CAAwB;QALxC,gBAAW,GAAG,IAAI,GAAG,EAAsB,CAAC;QAErD,YAAO,GAAG,KAAK,CAAC;QAChB,YAAO,GAAG,KAAK,CAAC;QAGvB,IAAI,CAAC,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,+BAA+B,CAAC;QACzE,IAAI,CAAC,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;QACpC,IAAI,CAAC,cAAc,GAAG,CAAC,GAAG,EAAE,EAAE;YAC7B,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;YAClE,IAAI,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC9D,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;YACjD,CAAC;QACF,CAAC,CAAC;IACH,CAAC;IAED,0FAA0F;IAC1F,KAAK;QACJ,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QACzC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,eAAe,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QACxE,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;YAC/C,GAAG,CAAC,6CAA6C,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3E,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,uDAAuD;IACvD,IAAI;QACH,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,eAAe,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,KAAK,CAAC,qBAAqB;QAClC,MAAM,KAAK,GAAG,MAAM,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChF,KAAK,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,KAAK,EAAE,CAAC;YAC/D,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/E,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAC1C,CAAC;QACF,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,yDAAyD;IACjD,OAAO,CAAC,MAAc,EAAE,WAAuB,EAAE,WAAyB;QACjF,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QACzB,MAAM,EAAE,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC7B,gFAAgF;QAChF,8DAA8D;QAC9D,IAAI,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE;YAAE,OAAO;QACtD,IAAI,CAAC;YACJ,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;YAC1D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,EAAE,KAAK,CAAC;gBAAE,OAAO;YAC1C,GAAG,CAAC,4CAA4C,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YACrF,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,GAAG,CAAC,wCAAwC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QAC3E,CAAC;IACF,CAAC;IAED,+EAA+E;IACvE,YAAY,CAAC,MAAc,EAAE,KAAe;QACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACjE,OAAO,KAAK,CAAC;QACd,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC/C,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,MAAc,EAAE,WAAuB,EAAE,WAAyB;IAC/F,MAAM,UAAU,GAAG;QAClB,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;QACzC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC;KAC1E,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,GAAG,CAAC,kDAAkD,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;YAC3E,SAAS;QACV,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,mBAAmB,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACnE,CAAC"}