@vellumai/assistant 0.10.12 → 0.11.0-staging.2

package/src/plugins/defaults/memory/{job-handlers → v1/job-handlers}/index-maintenance.ts

@@ -4,16 +4,16 @@ import {
 } from "@vellumai/plugin-api";
 import { and, eq, isNotNull, like, ne } from "drizzle-orm";
 
-import { getDb } from "../../../../persistence/db-connection.js";
-import { withQdrantBreaker } from "../../../../persistence/embeddings/qdrant-circuit-breaker.js";
+import { getDb } from "../../../../../persistence/db-connection.js";
+import { withQdrantBreaker } from "../../../../../persistence/embeddings/qdrant-circuit-breaker.js";
 import {
   asString,
   requireQdrantClient,
-} from "../../../../persistence/job-utils.js";
+} from "../../../../../persistence/job-utils.js";
 import {
   enqueueMemoryJob,
   type MemoryJob,
-} from "../../../../persistence/jobs-store.js";
+} from "../../../../../persistence/jobs-store.js";
 import {
   mediaAssets,
   memoryEmbeddings,
@@ -22,10 +22,10 @@ import {
   memorySegments,
   memorySummaries,
   messages,
-} from "../../../../persistence/schema/index.js";
-import { getLogger } from "../logging.js";
-import { memoryDbOrNull } from "../memory-db.js";
-import { extractMediaBlockMeta } from "../message-media.js";
+} from "../../../../../persistence/schema/index.js";
+import { getLogger } from "../../logging.js";
+import { memoryDbOrNull } from "../../memory-db.js";
+import { extractMediaBlockMeta } from "../../message-media.js";
 
 const log = getLogger("memory-jobs-worker");
 

package/src/plugins/defaults/memory/{jobs → v1/jobs}/embed-pkb-file.test.ts

@@ -17,20 +17,20 @@ mock.module("../pkb/pkb-index.js", () => ({
 // helper consults memory.v2.enabled.
 let v2Enabled = false;
 
-mock.module("../config.js", () => ({
+mock.module("../../config.js", () => ({
   getMemoryConfig: () => ({ v2: { enabled: v2Enabled } }),
 }));
 
-import { DEFAULT_CONFIG } from "../../../../config/defaults.js";
-import type { AssistantConfig } from "../../../../config/types.js";
-import { getMemoryDb } from "../../../../persistence/db-connection.js";
-import { initializeDb } from "../../../../persistence/db-init.js";
+import { DEFAULT_CONFIG } from "../../../../../config/defaults.js";
+import type { AssistantConfig } from "../../../../../config/types.js";
+import { getMemoryDb } from "../../../../../persistence/db-connection.js";
+import { initializeDb } from "../../../../../persistence/db-init.js";
 import {
   claimMemoryJobs,
   type MemoryJob,
   type MemoryJobType,
-} from "../../../../persistence/jobs-store.js";
-import { memoryJobs } from "../../../../persistence/schema/index.js";
+} from "../../../../../persistence/jobs-store.js";
+import { memoryJobs } from "../../../../../persistence/schema/index.js";
 import { embedPkbFileJob, enqueuePkbIndexJob } from "./embed-pkb-file.js";
 
 const TEST_CONFIG: AssistantConfig = DEFAULT_CONFIG;

package/src/plugins/defaults/memory/{jobs → v1/jobs}/embed-pkb-file.ts

@@ -1,12 +1,12 @@
-import { usesConceptPageMemory } from "../../../../config/memory-v3-gate.js";
-import type { AssistantConfig } from "../../../../config/types.js";
-import { asString } from "../../../../persistence/job-utils.js";
+import { usesConceptPageMemory } from "../../../../../config/memory-v3-gate.js";
+import type { AssistantConfig } from "../../../../../config/types.js";
+import { asString } from "../../../../../persistence/job-utils.js";
 import {
   enqueueMemoryJob,
   isMemoryEnabled,
   type MemoryJob,
-} from "../../../../persistence/jobs-store.js";
-import { getMemoryConfig } from "../config.js";
+} from "../../../../../persistence/jobs-store.js";
+import { getMemoryConfig } from "../../config.js";
 import { indexPkbFile } from "../pkb/pkb-index.js";
 
 /**

package/src/plugins/defaults/memory/{pkb → v1/pkb}/autoinject.ts

@@ -10,7 +10,7 @@
 import { existsSync, readFileSync } from "node:fs";
 import { join } from "node:path";
 
-import { stripCommentLines } from "../host-utils.js";
+import { stripCommentLines } from "../../host-utils.js";
 
 const PKB_DEFAULT_FILES = [
   "INDEX.md",

package/src/plugins/defaults/memory/{pkb → v1/pkb}/context.ts

@@ -1,8 +1,8 @@
 import { existsSync, readFileSync } from "node:fs";
 import { join, resolve } from "node:path";
 
-import { stripCommentLines } from "../host-utils.js";
-import { getWorkspaceDir } from "../paths.js";
+import { stripCommentLines } from "../../host-utils.js";
+import { getWorkspaceDir } from "../../paths.js";
 import { getPkbAutoInjectList } from "./autoinject.js";
 
 /** Max buffer.md lines injected into prompts — keeps context bounded even when filing is off. */

package/src/plugins/defaults/memory/{pkb → v1/pkb}/pkb-index.test.ts

@@ -12,7 +12,7 @@ const embedAndUpsertCalls: Array<{
   extraPayload: unknown;
 }> = [];
 
-mock.module("../../../../persistence/job-utils.js", () => ({
+mock.module("../../../../../persistence/job-utils.js", () => ({
   embedAndUpsert: async (
     config: unknown,
     targetType: string,
@@ -53,7 +53,7 @@ const qdrantScrollCalls: Array<{
   path?: string;
 }> = [];
 
-mock.module("../../../../persistence/embeddings/qdrant-client.js", () => ({
+mock.module("../../../../../persistence/embeddings/qdrant-client.js", () => ({
   getQdrantClient: () => ({
     deleteByTargetTypeAndPath: async (targetType: string, path: string) => {
       qdrantDeleteCalls.push({ targetType, path });
@@ -80,7 +80,7 @@ mock.module("../../../../persistence/embeddings/qdrant-client.js", () => ({
 
 // The circuit breaker is a thin wrapper; just call the function through.
 mock.module(
-  "../../../../persistence/embeddings/qdrant-circuit-breaker.js",
+  "../../../../../persistence/embeddings/qdrant-circuit-breaker.js",
   () => ({
     withQdrantBreaker: async <T>(fn: () => Promise<T>) => fn(),
   }),

package/src/plugins/defaults/memory/{pkb → v1/pkb}/pkb-index.ts

@@ -17,8 +17,8 @@ import { join, relative } from "node:path";
 
 import { embedAndUpsert } from "@vellumai/plugin-api";
 
-import { withQdrantBreaker } from "../../../../persistence/embeddings/qdrant-circuit-breaker.js";
-import { getQdrantClient } from "../../../../persistence/embeddings/qdrant-client.js";
+import { withQdrantBreaker } from "../../../../../persistence/embeddings/qdrant-circuit-breaker.js";
+import { getQdrantClient } from "../../../../../persistence/embeddings/qdrant-client.js";
 import type { PkbIndexEntry } from "./types.js";
 import { PKB_TARGET_TYPE } from "./types.js";
 

package/src/plugins/defaults/memory/{pkb → v1/pkb}/pkb-reconcile.test.ts

@@ -20,7 +20,7 @@ mock.module("../jobs/embed-pkb-file.js", () => ({
 let scrollPoints: Array<{ id: string; payload: Record<string, unknown> }> = [];
 const deleteCalls: Array<{ path: string }> = [];
 
-mock.module("../../../../persistence/embeddings/qdrant-client.js", () => ({
+mock.module("../../../../../persistence/embeddings/qdrant-client.js", () => ({
   getQdrantClient: () => ({
     scrollByTargetType: async (_targetType: string) => scrollPoints,
     deleteByTargetTypeAndPath: async (_targetType: string, path: string) => {
@@ -32,7 +32,7 @@ mock.module("../../../../persistence/embeddings/qdrant-client.js", () => ({
 
 // Circuit breaker — pass-through.
 mock.module(
-  "../../../../persistence/embeddings/qdrant-circuit-breaker.js",
+  "../../../../../persistence/embeddings/qdrant-circuit-breaker.js",
   () => ({
     withQdrantBreaker: async <T>(fn: () => Promise<T>) => fn(),
   }),
@@ -41,7 +41,7 @@ mock.module(
 // indexPkbFile is not invoked from the reconcile path (we enqueue jobs
 // instead), but the pkb-index module imports the embedding pipeline which
 // pulls in a config. Stub it so module import doesn't explode.
-mock.module("../../../../persistence/job-utils.js", () => ({
+mock.module("../../../../../persistence/job-utils.js", () => ({
   embedAndUpsert: async () => {},
 }));
 

package/src/plugins/defaults/memory/{pkb → v1/pkb}/pkb-reconcile.ts

@@ -13,9 +13,9 @@
 
 import { join } from "node:path";
 
-import { getQdrantClient } from "../../../../persistence/embeddings/qdrant-client.js";
+import { getQdrantClient } from "../../../../../persistence/embeddings/qdrant-client.js";
+import { getLogger } from "../../logging.js";
 import { enqueuePkbIndexJob } from "../jobs/embed-pkb-file.js";
-import { getLogger } from "../logging.js";
 import { deletePkbFilePoints, scanPkbFiles } from "./pkb-index.js";
 import { PKB_TARGET_TYPE } from "./types.js";
 

package/src/plugins/defaults/memory/{pkb → v1/pkb}/pkb-search.test.ts

@@ -3,7 +3,7 @@ import { beforeEach, describe, expect, mock, test } from "bun:test";
 // This test exercises the v1 PKB search path. `config.memory.v2.enabled`
 // (default `true`) makes pkb-search short-circuit to keep traffic off the
 // legacy collection — force it off so the v1 path stays under test.
-mock.module("../config.js", () => ({
+mock.module("../../config.js", () => ({
   getMemoryConfig: () => ({ v2: { enabled: false } }),
 }));
 
@@ -36,14 +36,14 @@ let hybridThrows: Error | null = null;
 let denseThrows: Error | null = null;
 
 mock.module(
-  "../../../../persistence/embeddings/qdrant-circuit-breaker.js",
+  "../../../../../persistence/embeddings/qdrant-circuit-breaker.js",
   () => ({
     isQdrantBreakerOpen: () => breakerOpen,
     withQdrantBreaker: async <T>(fn: () => Promise<T>): Promise<T> => fn(),
   }),
 );
 
-mock.module("../../../../persistence/embeddings/qdrant-client.js", () => ({
+mock.module("../../../../../persistence/embeddings/qdrant-client.js", () => ({
   getQdrantClient: () => ({
     hybridSearch: async (params: {
       denseVector: number[];

package/src/plugins/defaults/memory/{pkb → v1/pkb}/pkb-search.ts

@@ -2,18 +2,18 @@
 // PKB — Qdrant hybrid search for indexed PKB markdown files
 // ---------------------------------------------------------------------------
 
-import { usesConceptPageMemory } from "../../../../config/memory-v3-gate.js";
+import { usesConceptPageMemory } from "../../../../../config/memory-v3-gate.js";
 import {
   isQdrantBreakerOpen,
   withQdrantBreaker,
-} from "../../../../persistence/embeddings/qdrant-circuit-breaker.js";
+} from "../../../../../persistence/embeddings/qdrant-circuit-breaker.js";
 import type {
   QdrantSearchResult,
   QdrantSparseVector,
-} from "../../../../persistence/embeddings/qdrant-client.js";
-import { getQdrantClient } from "../../../../persistence/embeddings/qdrant-client.js";
-import { getMemoryConfig } from "../config.js";
-import { getLogger } from "../logging.js";
+} from "../../../../../persistence/embeddings/qdrant-client.js";
+import { getQdrantClient } from "../../../../../persistence/embeddings/qdrant-client.js";
+import { getMemoryConfig } from "../../config.js";
+import { getLogger } from "../../logging.js";
 import type { PkbSearchResult } from "./types.js";
 import { PKB_TARGET_TYPE } from "./types.js";
 

package/src/plugins/defaults/memory/{pkb → v1/pkb}/types.ts

@@ -1,13 +1,11 @@
 /**
- * Shared types and constants for PKB (Personal Knowledge Base) indexing.
- *
- * Scaffolding for upcoming PKB Qdrant indexing work — consumers (search,
- * index writer) land in later PRs.
+ * Shared types and constants for PKB (Personal Knowledge Base) indexing —
+ * consumed by the index writer (`pkb-index.ts`) and search (`pkb-search.ts`).
  */
 
 import { join } from "node:path";
 
-import { getWorkspaceDir } from "../paths.js";
+import { getWorkspaceDir } from "../../paths.js";
 
 export const PKB_TARGET_TYPE = "pkb_file" as const;
 

package/src/plugins/defaults/memory/{pkb-schedule.ts → v1/pkb-schedule.ts}

@@ -10,8 +10,8 @@
 import { existsSync, readFileSync } from "node:fs";
 import { join } from "node:path";
 
-import { stripCommentLines } from "./host-utils.js";
-import { getWorkspaceDir } from "./paths.js";
+import { stripCommentLines } from "../host-utils.js";
+import { getWorkspaceDir } from "../paths.js";
 
 /**
  * Whether `pkb/buffer.md` has any filable content (comment lines and

package/src/plugins/defaults/memory/{search/semantic.ts → v1/semantic-search.ts}

@@ -14,7 +14,7 @@ import {
 } from "../../../../persistence/schema/index.js";
 import { getMemoryConfig } from "../config.js";
 import { mapCosineToUnit } from "../validation.js";
-// ── Types (inlined from deleted types.ts) ──────────────────────────
+// ── Types ──────────────────────────────────────────────────────────
 
 type CandidateType = "segment" | "item" | "summary" | "media";
 

package/src/plugins/defaults/memory/v2/__tests__/activation-store.test.ts

@@ -13,7 +13,7 @@ import {
 } from "../../../../../persistence/db-singleton.js";
 import { migrateActivationState } from "../../../../../persistence/migrations/232-activation-state.js";
 import * as schema from "../../../../../persistence/schema/index.js";
-import type { ActivationState } from "../../v3/substrate/types.js";
+import type { ActivationState } from "../../substrate/types.js";
 import {
   clearEverInjected,
   forkActivationState,

package/src/plugins/defaults/memory/v2/__tests__/activation.test.ts

@@ -7,9 +7,6 @@
  *   - `computeOwnActivation`: applies `A_o = d·prev + c_user·simU + c_a·simA +
  *      c_now·simN`; clamps to [0,1]; orphan in candidates returns 0 when no
  *      sim hits.
- *   - `spreadActivation`: orphan yields A == A_o; spread walks incoming edges
- *      only (A→B boosts B but not A); hops=2 reaches second-degree predecessors
- *      but not third; bounded in [0,1].
  *   - `selectInjections`: top-K rank, deterministic tie-break, delta against
  *      `everInjected`.
  *
@@ -127,11 +124,15 @@ mock.module("../reranker.js", () => ({
       candidates: [...candidates],
     });
     return queries.map(() => {
-      if (rerankState.scores === null) return new Map();
+      if (rerankState.scores === null) {
+        return new Map();
+      }
       const out = new Map<string, number>();
       for (const slug of candidates) {
         const v = rerankState.scores.get(slug);
-        if (v !== undefined) out.set(slug, v);
+        if (v !== undefined) {
+          out.set(slug, v);
+        }
       }
       return out;
     });
@@ -141,17 +142,12 @@ mock.module("../reranker.js", () => ({
 
 // Static `import type` is fine — types erase, so they don't run module-init
 // code that would race the mocks above.
-import type { EdgeIndex } from "../../v3/substrate/edge-index.js";
-import type { ActivationState } from "../../v3/substrate/types.js";
-
-const {
-  computeOwnActivation,
-  selectCandidates,
-  selectInjections,
-  spreadActivation,
-} = await import("../activation.js");
+import type { ActivationState } from "../../substrate/types.js";
+
+const { computeOwnActivation, selectCandidates, selectInjections } =
+  await import("../activation.js");
 const { _resetMemoryV2QdrantForTests } =
-  await import("../../v3/substrate/qdrant.js");
+  await import("../../substrate/qdrant.js");
 
 // ---------------------------------------------------------------------------
 // Helpers
@@ -874,265 +870,6 @@ describe("computeOwnActivation", () => {
   });
 });
 
-// ---------------------------------------------------------------------------
-// spreadActivation
-// ---------------------------------------------------------------------------
-
-/**
- * Build a directed `EdgeIndex` from a flat list of `[from, to]` pairs. Each
- * entry is interpreted as a directed edge `from → to`; self-loops are dropped.
- */
-function buildEdgeIndex(edges: Array<[string, string]>): EdgeIndex {
-  const outgoing = new Map<string, Set<string>>();
-  const incoming = new Map<string, Set<string>>();
-  for (const [from, to] of edges) {
-    if (from === to) continue;
-    let outSet = outgoing.get(from);
-    if (!outSet) {
-      outSet = new Set<string>();
-      outgoing.set(from, outSet);
-    }
-    outSet.add(to);
-    let inSet = incoming.get(to);
-    if (!inSet) {
-      inSet = new Set<string>();
-      incoming.set(to, inSet);
-    }
-    inSet.add(from);
-  }
-  return { outgoing, incoming };
-}
-
-describe("spreadActivation", () => {
-  test("orphan node yields A == A_o", () => {
-    const edges = buildEdgeIndex([]);
-    const own = new Map([["alice", 0.7]]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    expect(out.final.get("alice")).toBeCloseTo(0.7, 6);
-  });
-
-  test("directed edge boosts only the target, not the source", () => {
-    // Edge alice→bob: alice activation flows into bob; bob does NOT push back
-    // into alice. alice (a pure source under this graph) keeps its own value.
-    const edges = buildEdgeIndex([["alice", "bob"]]);
-    const own = new Map([
-      ["alice", 0.6],
-      ["bob", 0.0],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    // alice has no incoming edges → final == own.
-    expect(out.final.get("alice")).toBeCloseTo(0.6, 6);
-    // bob's incoming = {alice}: numerator = 0 + 0.5*0.6 = 0.3, denom = 1.5.
-    expect(out.final.get("bob")).toBeCloseTo(0.3 / 1.5, 6);
-  });
-
-  test("two-cycle (A→B and B→A) lets activation flow both ways", () => {
-    // With both directions present, each node is the other's predecessor.
-    const edges = buildEdgeIndex([
-      ["alice", "bob"],
-      ["bob", "alice"],
-    ]);
-    const own = new Map([
-      ["alice", 0.0],
-      ["bob", 0.8],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    // alice: incoming {bob}=0.8 → numerator = 0 + 0.5*0.8 = 0.4, denom = 1.5.
-    expect(out.final.get("alice")).toBeCloseTo(0.4 / 1.5, 6);
-    // bob:   incoming {alice}=0.0 → numerator = 0.8 + 0 = 0.8, denom = 1.5.
-    expect(out.final.get("bob")).toBeCloseTo(0.8 / 1.5, 6);
-  });
-
-  test("pure source (high outgoing, zero incoming) collapses to final == own", () => {
-    // alice → bob → carol; alice has no incoming edges.
-    const edges = buildEdgeIndex([
-      ["alice", "bob"],
-      ["bob", "carol"],
-    ]);
-    const own = new Map([
-      ["alice", 0.5],
-      ["bob", 0.0],
-      ["carol", 0.0],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    expect(out.final.get("alice")).toBeCloseTo(0.5, 6);
-  });
-
-  test("hops=2 reaches second-degree predecessors but stops there", () => {
-    // Directed path: alice → bob → carol → delta
-    // From delta's perspective: carol is 1-hop predecessor, bob is 2-hop,
-    // alice is 3-hop. Activation on bob (2-hop) reaches delta; activation on
-    // alice (3-hop) does NOT.
-    const edges = buildEdgeIndex([
-      ["alice", "bob"],
-      ["bob", "carol"],
-      ["carol", "delta"],
-    ]);
-    const own = new Map([
-      ["alice", 1.0], // 3-hop predecessor of delta — must NOT contribute
-      ["bob", 1.0], // 2-hop predecessor of delta
-      ["carol", 0.0],
-      ["delta", 0.0],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    // delta: 1-hop {carol}=0, 2-hop {bob}=1.0.
-    //   numerator   = 0 + 0.5*0 + 0.25*1.0 = 0.25
-    //   denominator = 1 + 0.5*1 + 0.25*1   = 1.75
-    //   A = 0.25 / 1.75 ≈ 0.142857
-    expect(out.final.get("delta")).toBeCloseTo(0.25 / 1.75, 6);
-  });
-
-  test("output is bounded in [0, 1] for arbitrary inputs", () => {
-    const edges = buildEdgeIndex([
-      ["alice", "bob"],
-      ["bob", "carol"],
-      ["alice", "carol"],
-    ]);
-    const own = new Map([
-      ["alice", 1.0],
-      ["bob", 1.0],
-      ["carol", 1.0],
-    ]);
-    const out = spreadActivation(own, edges, 0.99, 2);
-    for (const [, value] of out.final) {
-      expect(value).toBeGreaterThanOrEqual(0);
-      expect(value).toBeLessThanOrEqual(1);
-    }
-  });
-
-  test("hops=0 collapses to A == A_o", () => {
-    const edges = buildEdgeIndex([["alice", "bob"]]);
-    const own = new Map([
-      ["alice", 0.4],
-      ["bob", 0.9],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 0);
-    expect(out.final.get("alice")).toBeCloseTo(0.4, 6);
-    expect(out.final.get("bob")).toBeCloseTo(0.9, 6);
-  });
-
-  test("k=0 collapses to A == A_o", () => {
-    const edges = buildEdgeIndex([["alice", "bob"]]);
-    const own = new Map([
-      ["alice", 0.4],
-      ["bob", 0.9],
-    ]);
-    const out = spreadActivation(own, edges, 0, 5);
-    expect(out.final.get("alice")).toBeCloseTo(0.4, 6);
-    expect(out.final.get("bob")).toBeCloseTo(0.9, 6);
-  });
-
-  test("predecessors not in the candidate set are dropped from both numerator and denominator", () => {
-    // Edge alice→bob: bob has structural predecessor alice, but alice is not
-    // in `ownActivation`. With the new formula she contributes nothing —
-    // hop1 has no active predecessors so the whole hop drops out of both
-    // sides of the ratio. Bob therefore stays at his own activation.
-    const edges = buildEdgeIndex([["alice", "bob"]]);
-    const own = new Map([["bob", 0.6]]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    expect(out.final.get("bob")).toBeCloseTo(0.6, 6);
-  });
-
-  test("L_2 norm over multiple active predecessors rewards strong outliers more than avg would", () => {
-    // bob has 4 predecessors in the candidate set: one strong, three weak.
-    // L_2 = √((0.8² + 0.1² + 0.1² + 0.1²) / 4) = √(0.1675) ≈ 0.40927
-    // Plain avg of the same set = 0.275, so L_2 lifts bob more than avg
-    // would — the design goal of preferring quality over quantity.
-    const edges = buildEdgeIndex([
-      ["a1", "bob"],
-      ["a2", "bob"],
-      ["a3", "bob"],
-      ["a4", "bob"],
-    ]);
-    const own = new Map([
-      ["a1", 0.8],
-      ["a2", 0.1],
-      ["a3", 0.1],
-      ["a4", 0.1],
-      ["bob", 0.0],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    const rms = Math.sqrt((0.8 * 0.8 + 3 * 0.1 * 0.1) / 4);
-    // numerator   = 0 + 0.5 · rms
-    // denominator = 1 + 0.5
-    expect(out.final.get("bob")).toBeCloseTo((0.5 * rms) / 1.5, 6);
-  });
-
-  test("high-in-degree hub with mostly-inactive predecessors stays near A_o", () => {
-    // 100 structural predecessors point at hub; only one (`pred0`) is in
-    // the candidate set. The old formula would crush hub by the structural
-    // count (denominator ≈ 51); the new formula folds the empty bulk out
-    // and the L_2 averages over the single active predecessor only.
-    const rawEdges: Array<[string, string]> = [];
-    for (let i = 0; i < 100; i++) rawEdges.push([`pred${i}`, "hub"]);
-    const edges = buildEdgeIndex(rawEdges);
-    const own = new Map([
-      ["hub", 0.6],
-      ["pred0", 0.5],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    // hop1 active = {pred0}, L_2([0.5]) = 0.5.
-    //   numerator   = 0.6 + 0.5 · 0.5 = 0.85
-    //   denominator = 1 + 0.5         = 1.5
-    expect(out.final.get("hub")).toBeCloseTo(0.85 / 1.5, 6);
-  });
-
-  test("empty own-activation map returns empty result", () => {
-    const out = spreadActivation(
-      new Map(),
-      buildEdgeIndex([["a", "b"]]),
-      0.5,
-      2,
-    );
-    expect(out.final.size).toBe(0);
-    expect(out.contribution.size).toBe(0);
-  });
-
-  test("contribution equals final - own for each slug", () => {
-    // Two-cycle: A→B and B→A so both nodes have predecessors and the spread
-    // moves each off its own value in opposite directions.
-    const edges = buildEdgeIndex([
-      ["alice", "bob"],
-      ["bob", "alice"],
-    ]);
-    const own = new Map([
-      ["alice", 0.0],
-      ["bob", 0.8],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 2);
-    for (const [slug, finalValue] of out.final) {
-      const ownValue = own.get(slug) ?? 0;
-      expect(out.contribution.get(slug)).toBeCloseTo(finalValue - ownValue, 6);
-    }
-    // alice gained spread (predecessor bob=0.8); bob lost some (predecessor
-    // alice=0 dilutes its own 0.8).
-    expect(out.contribution.get("alice")).toBeGreaterThan(0);
-    expect(out.contribution.get("bob")).toBeLessThan(0);
-  });
-
-  test("contribution is 0 for every slug when hops == 0", () => {
-    const edges = buildEdgeIndex([["alice", "bob"]]);
-    const own = new Map([
-      ["alice", 0.4],
-      ["bob", 0.9],
-    ]);
-    const out = spreadActivation(own, edges, 0.5, 0);
-    expect(out.contribution.get("alice")).toBe(0);
-    expect(out.contribution.get("bob")).toBe(0);
-  });
-
-  test("contribution is 0 for every slug when k == 0", () => {
-    const edges = buildEdgeIndex([["alice", "bob"]]);
-    const own = new Map([
-      ["alice", 0.4],
-      ["bob", 0.9],
-    ]);
-    const out = spreadActivation(own, edges, 0, 5);
-    expect(out.contribution.get("alice")).toBe(0);
-    expect(out.contribution.get("bob")).toBe(0);
-  });
-});
-
 // ---------------------------------------------------------------------------
 // selectInjections
 // ---------------------------------------------------------------------------