@fgv/ts-agent-memory 5.1.0-46 → 5.1.0-48

package/dist/ts-agent-memory.d.ts

@@ -329,6 +329,8 @@ export declare class FileTreeMemoryStore implements IMemoryStore {
     private readonly _writePolicies;
     private readonly _codecs;
     private readonly _rankProjectors;
+    /** `undefined` = no declaration = every kind participates. */
+    private readonly _embedKinds;
     private readonly _defaultCodec;
     private readonly _defaultPolicy;
     private readonly _scopeEncoding;
@@ -336,11 +338,9 @@ export declare class FileTreeMemoryStore implements IMemoryStore {
     private readonly _index;
     private readonly _hasher;
     private readonly _observers;
+    /** Record- and fragment-vector maintenance; every operation is best-effort. */
+    private readonly _vectors;
     private readonly _logger;
-    private readonly _vectorIndex;
-    private readonly _embed;
-    private readonly _fragmentIndex;
-    private readonly _fragmentEmbedder;
     /**
      * Records the initial walk could not load. Populated during `create()` in
      * {@link MemoryRecordErrorMode | `'skip'` mode}; empty otherwise.
@@ -457,39 +457,6 @@ export declare class FileTreeMemoryStore implements IMemoryStore {
      * later eviction failure never loses data with nothing written in its place.
      */
     private _admitWrite;
-    /**
-     * Best-effort embed-on-write. When a vector index AND an embedder are wired,
-     * embeds the built record, `add`s the vector (replace semantics handle a same-id
-     * re-embed — no explicit remove), and stamps the returned `embeddingRef`. A
-     * failure (returned `fail` OR a thrown/rejected hook) is logged and the
-     * unembedded record is returned unchanged — the put still persists, and the
-     * derived index is reconciled by a later `rebuild`. A pass-through no-op when
-     * unwired (byte-identical record).
-     *
-     * Always succeeds (`Result` is the chain's shape, never a vector-induced
-     * failure).
-     */
-    private _embedOnWrite;
-    /**
-     * Best-effort fragment-embed-on-write. When a fragment index AND a fragment
-     * embedder are wired, chunks + embeds the built record and replaces its
-     * fragments in the index (`addFragments` is whole-record-replace, so a re-authored
-     * document never leaves stale fragments behind — no explicit remove needed). A
-     * failure (returned `fail` OR a thrown/rejected hook) is logged and the record is
-     * returned unchanged — the put still persists, and the fragment index is a derived
-     * view a later `rebuild` reconciles. Unlike {@link FileTreeMemoryStore._embedOnWrite}
-     * it stamps nothing on the record (fragments have no per-record `embeddingRef`
-     * analog). A pass-through no-op when unwired (byte-identical record).
-     */
-    private _embedFragmentsOnWrite;
-    /**
-     * Best-effort fragment removal. A no-op unless the full fragment lifecycle is
-     * wired (both an index AND an embedder), so an unwired store does no fragment
-     * work and behaves byte-identically. Failures are logged, never surfaced — a
-     * committed delete/eviction must not fail because a derived fragment index could
-     * not be pruned.
-     */
-    private _removeFragmentsBestEffort;
     /**
      * Evict the records named by a `cull-oldest` decision, best-effort. Runs only
      * after the authoritative `_persist`, so a failed eviction is logged (never
@@ -498,26 +465,6 @@ export declare class FileTreeMemoryStore implements IMemoryStore {
      * `accept` / `reject` decisions evict nothing.
      */
     private _applyEvictions;
-    /**
-     * Best-effort vector removal for each evicted record (never fails the put).
-     * Every evicted record is in the same `scope` as the incoming write (the
-     * cull-oldest cohort is the incoming record's `(scope, kind)` cohort), so that
-     * scope qualifies each removal target.
-     */
-    private _removeEvictedVectors;
-    /**
-     * Run a consumer-supplied vector hook, normalizing a thrown/rejected hook into a
-     * `Failure` and logging any failure at `warn`. Best-effort: the caller proceeds
-     * regardless, since the index is rebuildable.
-     */
-    private _tryVectorOp;
-    /**
-     * Best-effort vector removal. A no-op unless the full vector lifecycle is wired
-     * (both an index AND an embedder), so an unwired store does no vector work and
-     * behaves byte-identically. Failures are logged, never surfaced — a committed
-     * delete/eviction must not fail because a derived index could not be pruned.
-     */
-    private _removeVectorBestEffort;
     /**
      * Build the record to persist. On a first write the incoming envelope is the
      * base (final content equals the incoming content, so the dedup `hash` is
@@ -649,6 +596,10 @@ export declare class FileTreeMemoryStore implements IMemoryStore {
     private _stampRank;
     private _codecFor;
     private _policyFor;
+    /** {@inheritDoc IMemoryStore.dedupScopeFor} */
+    dedupScopeFor(kind: Kind): DedupScope;
+    /** {@inheritDoc IMemoryStore.embedsKind} */
+    embedsKind(kind: Kind): boolean;
     /**
      * Read and validate the record at `<scope>/<idStem>.md`, returning `undefined`
      * when the scope directory or file is absent. Verifies the on-disk id ↔
@@ -1172,6 +1123,37 @@ export declare interface IFileTreeMemoryStoreCreateParams {
      * guard-host-callbacks conventions).
      */
     readonly rankProjectors?: ReadonlyMap<Kind, RankProjector>;
+    /**
+     * The kinds whose records participate in the **record-granular** vector index.
+     *
+     * @remarks
+     * **Absent means every kind participates**, which is the pre-existing behavior —
+     * so omitting this is byte-identical to before it existed. Supplying it makes the
+     * set an allowlist: a kind outside it is never handed to the {@link MemoryEmbedder}
+     * on write, and is omitted from {@link IMemoryStore.asRecordSource | asRecordSource},
+     * so a rebuild driven from this store does not pay for it either.
+     *
+     * Two costs motivate it, and the second is the one that is easy to miss:
+     *
+     * - **Embedder work on the critical path.** Embed-on-write is synchronous with
+     *   the write. A bookkeeping row — a status, a counter, a lease — that no query
+     *   will ever return still pays a full embedding round trip, and on a
+     *   locally-hosted model the first call after a restart pays a cold model load
+     *   on top.
+     * - **Un-queried kinds crowd the `topK` window.** `IVectorIndex.query` applies
+     *   `topK` *before* any kind filter the retriever adds, so vectors that can never
+     *   be returned still occupy candidate slots. Over-fetching to compensate hides
+     *   this until the un-queried kinds start scoring well — at which point recall is
+     *   silently lost. Restricting what is indexed fixes the recall problem, not just
+     *   the cost.
+     *
+     * Applies to the record-granular path only. The fragment path
+     * ({@link IFileTreeMemoryStoreCreateParams.fragmentIndex | fragmentIndex} /
+     * `fragmentEmbedder`) is independent and unaffected — a kind may legitimately be
+     * fragment-embedded and not record-embedded, which is the right shape for a long
+     * document whose whole body exceeds the model's context.
+     */
+    readonly embedKinds?: ReadonlySet<Kind>;
     /** Default codec for kinds without an explicit entry. */
     readonly defaultCodec?: IIdentityCodec;
     /**
@@ -1828,6 +1810,12 @@ export declare interface IMemoryObservationQuery {
     readonly phase?: MemoryObservationPhase;
     /** Only records with this outcome. */
     readonly outcome?: MemoryObservationOutcome;
+    /**
+     * Only `'write'` records with this embed outcome. Records carrying no embed
+     * outcome never match, so `embed: 'failed'` answers "which writes left the
+     * index short?" without a full scan of every record's `embeddingRef`.
+     */
+    readonly embed?: MemoryEmbedOutcome;
 }
 
 /**
@@ -1863,6 +1851,12 @@ export declare interface IMemoryObservationRecord {
     readonly error?: string;
     /** Structured provenance of the write, when the operation carried one. */
     readonly provenance?: IProvenance;
+    /**
+     * For `'write'` observations: what the record-granular vector index did about
+     * this record. Absent when the question does not apply — see
+     * {@link MemoryEmbedOutcome}.
+     */
+    readonly embed?: MemoryEmbedOutcome;
     /**
      * For `'retrieve'` observations: an opaque snapshot of the query that drove
      * the retrieval. Carried verbatim; never interpreted by the store.
@@ -2081,12 +2075,67 @@ export declare interface IMemoryStore {
     /**
      * Adapt this store to the {@link IMemoryRecordSource} seam so it can drive
      * {@link IVectorIndex} rebuilds (e.g. `InMemoryCosineIndex.rebuild`). The
-     * returned source's `list()` delegates to {@link IMemoryStore.listScoped}. The
-     * store cannot implement {@link IMemoryRecordSource} directly because its
+     * returned source's `list()` delegates to {@link IMemoryStore.listScoped},
+     * **filtered to the kinds {@link IMemoryStore.embedsKind | embedsKind} reports** —
+     * this source exists to feed the record vector index, so a kind excluded from
+     * that index is excluded here too, and a reopen does not re-embed records the
+     * index will never return. With no
+     * {@link IFileTreeMemoryStoreCreateParams.embedKinds | embedKinds} declaration
+     * every kind participates and the filter is the identity. `listScoped` itself is
+     * **not** filtered and remains the whole-vault surface.
+     *
+     * The store cannot implement {@link IMemoryRecordSource} directly because its
      * `list(filter?)` returns bare records (the ergonomic query surface) while the
      * seam's `list()` returns scope-qualified records.
      */
     asRecordSource(): IMemoryRecordSource;
+    /**
+     * The EFFECTIVE {@link DedupScope} for `kind` — the granularity at which a
+     * write for this kind deduplicates against the existing vault.
+     *
+     * @remarks
+     * This is a **read accessor over the store's already-injected write policies**,
+     * and it is the single place any caller — the store's own write path included —
+     * asks what a kind's dedup granularity is. It resolves the full chain the store
+     * applies on write: the kind's registered {@link IWritePolicy}, falling back to
+     * the store's default policy, then that policy's
+     * {@link IWritePolicy.dedupScope | dedupScope}, falling back to
+     * {@link DEFAULT_DEDUP_SCOPE}. Note the store's default policy is a
+     * {@link KnowledgeLwwPolicy}, which declares `'content'` — so a kind with NO
+     * registered policy resolves to `'content'`, not to `DEFAULT_DEDUP_SCOPE`.
+     *
+     * It exists so a caller that must agree with the store about dedup granularity
+     * — notably the ingest orchestrator's stage-4 layer-1 exact match — can read the
+     * declaration through this seam instead of being handed a second copy of the
+     * policy map. A second declaration site is precisely the defect this accessor
+     * was added to remove.
+     *
+     * Deliberately synchronous, total, and NOT `Result`-returning: it reads
+     * constructor-injected configuration, touches no I/O, and cannot fail (every
+     * link in the fallback chain has a total default). It exposes only the scope,
+     * never the {@link IWritePolicy} itself, so it can never become a back door for
+     * invoking admission or merge logic out of band.
+     */
+    dedupScopeFor(kind: Kind): DedupScope;
+    /**
+     * Whether records of `kind` participate in the **record-granular** vector index.
+     *
+     * @remarks
+     * A read accessor over the store's injected {@link IFileTreeMemoryStoreCreateParams.embedKinds | embedKinds}
+     * declaration, in the same spirit as {@link IMemoryStore.dedupScopeFor} — one
+     * place to ask, so the store's write path and any caller reasoning about index
+     * coverage cannot disagree. `true` for every kind when no declaration was made.
+     *
+     * **This is distinct from a {@link MemoryEmbedder} decline, and the difference is
+     * cost.** An embedder that returns `undefined` has already been called: the
+     * round trip is paid, and on a locally-hosted model that round trip is the
+     * expense. A kind excluded here is never handed to the embedder at all. The
+     * decline makes the intent *expressible*; this makes it *free*.
+     *
+     * Deliberately synchronous, total, and NOT `Result`-returning: it reads
+     * constructor-injected configuration, touches no I/O, and cannot fail.
+     */
+    embedsKind(kind: Kind): boolean;
     /**
      * Write a record. Validates the body, computes a content hash, deduplicates
      * (scope-wide, before policy), applies the kind's {@link IWritePolicy}, stamps
@@ -2239,17 +2288,40 @@ export declare class InMemoryCosineIndex implements IVectorIndex {
     /**
      * Re-embed every record from `source` and rebuild the index from scratch.
      * Clears the current contents (and the established dimension) first, so a
-     * re-embed with a different model is supported. Returns the number of vectors
-     * indexed.
+     * re-embed with a different model is supported. Returns an
+     * {@link IVectorRebuildReport} describing what was indexed, declined and skipped.
      *
-     * On any failure (list, embed, or add) the index is rolled back to empty
-     * rather than left in a partially-rebuilt state — a caller that retries a query
-     * after a failed rebuild sees a clean empty index, never a half-populated one.
+     * @remarks
+     * **A failure to LIST is always fatal**, under either mode — and **leaves the
+     * existing index untouched**: an unreadable source says nothing about which
+     * records exist, so there is neither an honest partial to report nor any reason
+     * to discard what is already held.
+     *
+     * Per-record embed/add failures are governed by
+     * {@link IVectorRebuildOptions.onRecordError}, which defaults to `'fail'` —
+     * **the historical all-or-nothing contract, unchanged**: the index is rolled back
+     * to empty rather than left partially rebuilt, so a caller that retries a query
+     * sees a clean empty index it can reason about.
+     *
+     * `'skip'` opts into the lenient shape the store's own open already uses: the
+     * rebuild continues and every casualty is returned structurally on
+     * {@link IVectorRebuildReport.skipped}. **It reports more, it does not report
+     * less** — the point is to stop one bad record emptying an entire index, not to
+     * make failures quieter. A caller that ignores `skipped` under `'skip'` has
+     * chosen to, rather than been given no way to know.
+     *
+     * A {@link MemoryEmbedder} decline is not a failure under either mode: it is
+     * counted on {@link IVectorRebuildReport.declined} and never appears in `skipped`.
+     *
+     * Both consumer-supplied hooks are capture-wrapped, so a `source` or `embed`
+     * that throws or rejects becomes a `Failure` on the path above rather than an
+     * exception escaping mid-rebuild — which would bypass the rollback entirely.
      *
      * @param source - The scope-qualified record source to re-embed.
      * @param embed - The embedder applied to each record.
+     * @param options - Rebuild options; omit for the historical `'fail'` behavior.
      */
-    rebuild(source: IMemoryRecordSource, embed: MemoryEmbedder): Promise<Result<number>>;
+    rebuild(source: IMemoryRecordSource, embed: MemoryEmbedder, options?: IVectorRebuildOptions): Promise<Result<IVectorRebuildReport>>;
     /** Empty the index and forget the established dimension. */
     private _reset;
     /** The Euclidean magnitude (L2 norm) of a vector. */
@@ -2320,6 +2392,13 @@ export declare class InMemoryFragmentCosineIndex implements IFragmentVectorIndex
      * On any failure (list, embed, or add) the index is rolled back to empty rather
      * than left in a partially-rebuilt state.
      *
+     * @remarks
+     * **Deliberately still returns a bare count**, unlike the record-granular
+     * {@link InMemoryCosineIndex.rebuild}, which reports an
+     * {@link IVectorRebuildReport}. The asymmetry is scope, not oversight: the
+     * fragment path is tracked separately and gains the same treatment when the
+     * `IVectorIndex`/`IFragmentVectorIndex` contracts are revisited together.
+     *
      * @param source - The scope-qualified record source to re-embed.
      * @param embed - The fragment embedder applied to each record.
      */
@@ -2465,6 +2544,19 @@ export declare interface ISkippedRecord {
     readonly error: string;
 }
 
+/**
+ * A record a rebuild could not index — because the embed failed or because the
+ * subsequent add did — retained so a partial rebuild reports what it lost rather
+ * than merely how much it kept.
+ * @public
+ */
+export declare interface ISkippedVectorRecord {
+    /** The scope-qualified address of the record that could not be indexed. */
+    readonly target: IEdgeTarget;
+    /** The failure message, from either the embed or the subsequent add. */
+    readonly error: string;
+}
+
 /**
  * Narrow an {@link IIdentityCodec} to {@link ITemporalIdentityCodec} by probing
  * for the versioned methods. Used by the store when an `encode` result reports
@@ -2582,6 +2674,45 @@ export declare interface IVectorIndex {
      * Return the `topK` nearest records to `vector`, in descending score order.
      */
     query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>>;
+    /**
+     * The number of vectors currently held.
+     *
+     * @remarks
+     * On the contract because without it a caller cannot distinguish *"the index is
+     * empty"* from *"nothing matched"*: {@link IVectorIndex.query} answers an empty
+     * index with `succeed([])`, which is indistinguishable from a genuine miss. The
+     * only other check available to a caller — "is a vector index wired?" — tests the
+     * **wiring**, and that stays true while the index holds nothing.
+     *
+     * Note the narrow scope: this answers *how many vectors are held*, **not** how
+     * many there ought to be. Full coverage — "is every record that should be indexed
+     * actually indexed?" — still requires comparing against the record source and
+     * {@link IMemoryStore.embedsKind}.
+     *
+     * Synchronous and non-`Result` because both shipped implementations can answer it
+     * without I/O that can fail — the in-memory index reads a `Map`'s size, and the
+     * SQLite-backed one a prepared `COUNT` against an open connection it already owns.
+     */
+    readonly size: number;
+    /**
+     * Re-embed every record from `source` and rebuild the index from scratch — the
+     * **backfill / reconcile** operation.
+     *
+     * @remarks
+     * On the contract because a persisted index is unusable without it. Records
+     * written while the index was unwired, a re-embed after a dimension change (where
+     * the backend supports one — a `vec0`-backed table's dimension is fixed at
+     * creation, so there it needs a drop-and-re-index instead), and reconciliation
+     * after a swallowed embed-on-write failure are all unreachable otherwise — and the store's own docstring already promises *"the derived index
+     * is reconciled by a later `rebuild`"*, a promise the contract could not keep for
+     * any index but the bundled one. A caller moving from the bundled implementation
+     * to a persistent one found the swap type-checked everywhere **except** the one
+     * place it backfills, which is the place that mattered.
+     *
+     * See {@link IVectorRebuildReport} for what it reports and
+     * {@link IVectorRebuildOptions} for the failure mode.
+     */
+    rebuild(source: IMemoryRecordSource, embed: MemoryEmbedder, options?: IVectorRebuildOptions): Promise<Result<IVectorRebuildReport>>;
 }
 
 /**
@@ -2640,6 +2771,43 @@ export declare interface IVectorQueryHit {
     readonly fragmentId?: string;
 }
 
+/**
+ * Options for a vector-index rebuild.
+ * @public
+ */
+export declare interface IVectorRebuildOptions {
+    /**
+     * How to treat a record the rebuild cannot index — an embed failure OR an add
+     * failure. Defaults to `'fail'` — the historical behavior, unchanged for every
+     * existing caller.
+     */
+    readonly onRecordError?: VectorRebuildErrorMode;
+}
+
+/**
+ * What a rebuild actually did — the structural answer to "is this index complete?".
+ *
+ * @remarks
+ * A bare count cannot distinguish the three ways a record can be absent from the
+ * index, and that distinction is the entire point: **`declined` was intentional,
+ * `skipped` was a fault, and neither is the same as "never attempted"**. A caller
+ * deriving coverage from a count alone cannot tell an embedder outage from a
+ * deliberate policy, which is precisely the confusion this type exists to end.
+ * @public
+ */
+export declare interface IVectorRebuildReport {
+    /** Records embedded and added to the index. */
+    readonly indexed: number;
+    /** Records the embedder deliberately declined (resolved `undefined`). */
+    readonly declined: number;
+    /**
+     * Records whose embedding or add FAILED and were skipped. Non-empty only under
+     * {@link VectorRebuildErrorMode | `onRecordError: 'skip'`} — under `'fail'` the
+     * first failure aborts the rebuild and no report is returned at all.
+     */
+    readonly skipped: ReadonlyArray<ISkippedVectorRecord>;
+}
+
 /**
  * A per-kind write policy, injected at store construction. Invoked AFTER
  * content-hash dedup (dedup is always pre-policy). The policy decides
@@ -2989,9 +3157,81 @@ export declare type MemoryDetailTier = 'gist' | 'full';
  * Async and `Result`-returning, since a real embedder does a network call (cloud
  * provider) or in-process model inference. The consumer wires this — the core
  * package never calls an embedding provider directly, staying embedder-agnostic.
+ *
+ * @remarks
+ * Resolving to `undefined` means **"intentionally not embedded"** — a deliberate
+ * decline, not an error. The record is stored without an embedding reference, no
+ * failure is reported, and **the decline itself logs nothing**. This is distinct
+ * from a `Failure`, which means the embedder *tried and could not*.
+ *
+ * "Logs nothing" is a statement about the decline, not a promise of silence: a
+ * decline on a record that was already embedded also prunes the vector that
+ * reference named, and if that prune fails it is a genuine fault and warns like
+ * any other. What a decline never does is warn merely for having happened.
+ *
+ * The distinction is load-bearing wherever the two are treated differently. On the
+ * rebuild path a declined record is **excluded** from the index and counted on
+ * {@link IVectorRebuildReport.declined}; a failed one is a genuine error and, under
+ * `onRecordError: 'skip'`, is reported on {@link IVectorRebuildReport.skipped}. Collapsing "I chose not to" into `fail` would
+ * make a deliberate policy indistinguishable from an embedder outage in the logs,
+ * and would put a routine decision on whatever error path the caller has wired.
+ *
+ * The embedder receives the whole record, so the usual reason to decline is the
+ * record's `kind` — a control or bookkeeping row that no query should ever return.
+ *
+ * @public
+ */
+export declare type MemoryEmbedder = (record: IMemoryRecord<unknown>) => Promise<Result<Float32Array | undefined>>;
+
+/**
+ * What the record-granular vector index did about a written record.
+ *
+ * @remarks
+ * This exists because **`embeddingRef` absence is three-ways ambiguous**: a
+ * record with no reference may have been declined, excluded, or genuinely
+ * failed to embed, and the `put`'s own `outcome` cannot tell you which — it is
+ * `'success'` in all three, because embed-on-write is best-effort by design and
+ * never fails a durable write. Deriving index coverage from the absent field
+ * alone therefore cannot distinguish a policy decision from an outage.
+ *
+ * - `'embedded'` — embedded and added; the record carries an `embeddingRef`.
+ * - `'declined'` — the {@link MemoryEmbedder} resolved `undefined`: deliberately
+ *   not embedded. Not a fault.
+ * - `'excluded'` — the record's kind is outside the store's `embedKinds`
+ *   declaration, so the embedder was never called. Also not a fault, and the
+ *   cheaper of the two.
+ * - `'failed'` — the embedder returned a `Failure` (or threw), **or** the index
+ *   `add` did. Both are faults, and what they leave behind depends on whether
+ *   the record had been embedded before: a **first** write ends up with no
+ *   `embeddingRef` and nothing in the index, while an **update** keeps the
+ *   reference and vector it already had — so the index goes on answering on the
+ *   record's **previous** content until a `rebuild` reconciles it. Stale, not
+ *   absent. The store's diagnostic logger names which fault it was, because the
+ *   remediation differs (an embedder outage versus an index outage) while the
+ *   coverage answer — "this record needs a re-embed" — does not.
+ *
+ * Absent on a write observation means **no outcome is being reported**, which
+ * covers three cases:
+ *
+ * 1. no vector index / embedder is wired, so there is no index for the record to
+ *    be absent from;
+ * 2. the `put` was a dedup no-op, which attempted nothing;
+ * 3. the `put` **failed** (`outcome: 'failure'`). An embed step may well have run
+ *    before the failure — a record can even have been added to the index and then
+ *    lost its durable write, leaving an orphan vector that a later `rebuild`
+ *    reconciles. That is deliberately not reported here: the field answers
+ *    "is this *stored* record in the index?", and on a failed write there is no
+ *    stored record for it to be a statement about.
+ *
+ * So `embed` is a property of successful writes. Never present on `'read'` /
+ * `'delete'` / `'retrieve'`.
+ *
+ * Record-granular only. The fragment path is independent and reports nothing
+ * here — a record may be fragment-embedded while its record-level outcome is
+ * `'excluded'`.
  * @public
  */
-export declare type MemoryEmbedder = (record: IMemoryRecord<unknown>) => Promise<Result<Float32Array>>;
+export declare type MemoryEmbedOutcome = 'embedded' | 'declined' | 'excluded' | 'failed';
 
 /**
  * Stable file-stem identifier for a memory record. Equals the codec-produced
@@ -3143,7 +3383,9 @@ export declare class MemoryIngestOrchestrator implements IMemoryIngestOrchestrat
     private _planFromVerdict;
     /**
      * Stage 4 — resolve a dedup verdict. Layer 1: an exact `{ kind, body }` match in
-     * the candidate's scope is a `duplicate-of` (design note §1). Layer 2 (only when
+     * the candidate's scope is a `duplicate-of`, at the granularity the kind's
+     * {@link DedupScope} declares — scope-wide for `'content'`, restricted to the
+     * candidate's own entity for `'entity'` (design note §1). Layer 2 (only when
      * a resolver + vector index + embedder are all wired): embed the candidate,
      * surface over-threshold neighbors, and dispatch to the {@link IEntityResolver}.
      * Otherwise the verdict is `new` (the exact-only fall-back path).
@@ -3154,9 +3396,26 @@ export declare class MemoryIngestOrchestrator implements IMemoryIngestOrchestrat
     /** Layer-2 continuation once the candidate has a provisional record to embed. */
     private _resolveViaSimilarityEmbedded;
     /**
-     * Find an existing record in `scope` whose `{ kind, body }` hash matches the
-     * candidate's (layer-1 exact dedup). Invalidated temporal versions are excluded
-     * — only a live (non-temporal or current) record deduplicates a candidate.
+     * Find an existing record whose `{ kind, body }` hash matches the candidate's
+     * (layer-1 exact dedup, design note §1). Invalidated temporal versions are
+     * excluded — only a live (non-temporal or current) record deduplicates a
+     * candidate.
+     *
+     * @remarks
+     * The cohort's granularity is the kind's DECLARED {@link DedupScope}, read
+     * through {@link IMemoryStore.dedupScopeFor} so this layer and the store's own
+     * write path can never disagree:
+     *
+     * - `'content'` — every live same-kind record in the candidate's scope,
+     *   regardless of entity. A cross-id body collision IS a duplicate (the
+     *   knowledge family; unchanged behavior).
+     * - `'entity'` — only records at the candidate's OWN entity address. Two
+     *   distinct entities with byte-identical bodies never collapse into one
+     *   another, which is what the declaration has always meant on the direct-put
+     *   path and now means here too.
+     *
+     * The same-id collapse itself remains the store's job — this layer only decides
+     * whether a cross-id body collision is eligible to be a `duplicate-of` at all.
      */
     private _findExactMatch;
     /**
@@ -3168,8 +3427,46 @@ export declare class MemoryIngestOrchestrator implements IMemoryIngestOrchestrat
     private static _recordBodyString;
     /** The stage-4 exact-dedup key over `{ kind, body }` (design note §1). */
     private _exactKey;
-    /** Stage 5 — relate (host), validate edges, and run the write-time cycle guard. */
+    /** Stage 5 — relate (host), redirect collapsed targets, validate edges, and run the write-time cycle guard. */
     private _relate;
+    /**
+     * The stage-5 edge-target redirect map for this pass: every `duplicate-of`
+     * candidate's OWN scoped address, mapped to the address of the record its
+     * verdict collapsed it into (design note §3).
+     *
+     * @remarks
+     * A `duplicate-of` verdict means "this candidate IS that record". The candidate
+     * is therefore not written, and its address never becomes a live reference — so
+     * a sibling edge built against it in the same pass would resolve to neither a
+     * written candidate nor an existing record and would fail the WHOLE ingest item.
+     * That is a second-order hazard of collapsing, not a defect in the edge: the
+     * host related two candidates it was correctly told about, and one of them
+     * turned out to already exist.
+     *
+     * Redirecting is the honest repair, and it is independent of {@link DedupScope}
+     * — it applies equally to a `'content'` kind, where the collapse is exactly
+     * right and the ingest still must not fail.
+     *
+     * The map cannot chain: {@link MemoryIngestOrchestrator._planFromVerdict}
+     * requires every target-bearing verdict's target to already exist in the store
+     * snapshot, so a redirect destination is always a persisted record and never
+     * another collapsed candidate. One pass is sufficient by construction.
+     */
+    private static _collapseRedirects;
+    /**
+     * Rewrite each edge whose TARGET names a collapsed candidate to point at the
+     * record that candidate collapsed into.
+     *
+     * @remarks
+     * Only the target is redirected. An edge whose SOURCE is a collapsed candidate
+     * stays untouched and is still rejected by {@link
+     * MemoryIngestOrchestrator._validateEdges}: sources are the records an edge is
+     * written ONTO, a collapsed candidate is never written, and the relation
+     * extractor is only ever offered writable candidates as edge sources in the
+     * first place. Silently relocating such an edge onto an existing record would
+     * attribute a link the host never asked for — the loud failure is correct there.
+     */
+    private static _redirectEdges;
     /**
      * Validate stage-5 edges: each `source` must be a candidate being written; each
      * `target` must resolve to a sibling candidate or an existing store record. All
@@ -3783,4 +4080,25 @@ export declare class TemporalVersionedPolicy implements IWritePolicy {
     private _rebuild;
 }
 
+/**
+ * How a vector-index rebuild treats a record it cannot index — whether the
+ * **embedding** failed or the subsequent **add** did. Both are governed by this
+ * one mode; neither is unconditionally fatal.
+ *
+ * @remarks
+ * Deliberately mirrors the store's own open-time `onRecordError` mode, including
+ * its default: `'fail'` preserves the historical all-or-nothing contract exactly,
+ * and `'skip'` is opt-in. Defined here rather than imported from the store packlet
+ * — the `vector` packlet does not depend on `store`, and the two modes describe
+ * different domains that merely happen to share a shape.
+ *
+ * A **decline** (a {@link MemoryEmbedder} resolving `undefined`) is not an error
+ * and is unaffected by this mode: it is always **excluded** from the index and
+ * counted on {@link IVectorRebuildReport.declined}, **never** appearing in
+ * {@link IVectorRebuildReport.skipped}. The word is worth being careful with here:
+ * `skipped` is now a formal field meaning *a fault*, and a decline is the opposite.
+ * @public
+ */
+export declare type VectorRebuildErrorMode = 'skip' | 'fail';
+
 export { }