@inerrata-corporation/errata 2.0.22 → 2.0.23-dev.4682

package/generalize-worker.mjs

@@ -1235,10 +1235,10 @@ function mergeDefs(...defs) {
 function cloneDef(schema) {
   return mergeDefs(schema._zod.def);
 }
-function getElementAtPath(obj, path) {
-  if (!path)
+function getElementAtPath(obj, path2) {
+  if (!path2)
     return obj;
-  return path.reduce((acc, key) => acc?.[key], obj);
+  return path2.reduce((acc, key) => acc?.[key], obj);
 }
 function promiseAllObject(promisesObj) {
   const keys = Object.keys(promisesObj);
@@ -1621,11 +1621,11 @@ function aborted(x, startIndex = 0) {
   }
   return false;
 }
-function prefixIssues(path, issues) {
+function prefixIssues(path2, issues) {
   return issues.map((iss) => {
     var _a2;
     (_a2 = iss).path ?? (_a2.path = []);
-    iss.path.unshift(path);
+    iss.path.unshift(path2);
     return iss;
   });
 }
@@ -1808,7 +1808,7 @@ function formatError(error48, mapper = (issue2) => issue2.message) {
 }
 function treeifyError(error48, mapper = (issue2) => issue2.message) {
   const result = { errors: [] };
-  const processError = (error49, path = []) => {
+  const processError = (error49, path2 = []) => {
     var _a2, _b;
     for (const issue2 of error49.issues) {
       if (issue2.code === "invalid_union" && issue2.errors.length) {
@@ -1818,7 +1818,7 @@ function treeifyError(error48, mapper = (issue2) => issue2.message) {
       } else if (issue2.code === "invalid_element") {
         processError({ issues: issue2.issues }, issue2.path);
       } else {
-        const fullpath = [...path, ...issue2.path];
+        const fullpath = [...path2, ...issue2.path];
         if (fullpath.length === 0) {
           result.errors.push(mapper(issue2));
           continue;
@@ -1850,8 +1850,8 @@ function treeifyError(error48, mapper = (issue2) => issue2.message) {
 }
 function toDotPath(_path) {
   const segs = [];
-  const path = _path.map((seg) => typeof seg === "object" ? seg.key : seg);
-  for (const seg of path) {
+  const path2 = _path.map((seg) => typeof seg === "object" ? seg.key : seg);
+  for (const seg of path2) {
     if (typeof seg === "number")
       segs.push(`[${seg}]`);
     else if (typeof seg === "symbol")
@@ -13828,13 +13828,13 @@ function resolveRef(ref, ctx) {
   if (!ref.startsWith("#")) {
     throw new Error("External $ref is not supported, only local refs (#/...) are allowed");
   }
-  const path = ref.slice(1).split("/").filter(Boolean);
-  if (path.length === 0) {
+  const path2 = ref.slice(1).split("/").filter(Boolean);
+  if (path2.length === 0) {
     return ctx.rootSchema;
   }
   const defsKey = ctx.version === "draft-2020-12" ? "$defs" : "definitions";
-  if (path[0] === defsKey) {
-    const key = path[1];
+  if (path2[0] === defsKey) {
+    const key = path2[1];
     if (!key || !ctx.defs[key]) {
       throw new Error(`Reference not found: ${ref}`);
     }
@@ -14697,7 +14697,7 @@ var CastaliaIngestPayloadSchema = external_exports.object({
 });
 
 // ../../packages/shared/src/history-read.ts
-var CLOUD_ATTR_DUPLICATE_KEYS = ["attrsJson", "embedding"];
+var CLOUD_ATTR_DUPLICATE_KEYS = ["attrsJson", "embedding", "structEmbedding", "structEmbeddedAt"];
 
 // ../../packages/shared/src/history-revision.ts
 var Sha = external_exports.string().regex(/^(?:[a-f0-9]{40}|[a-f0-9]{64})$/);
@@ -14712,6 +14712,17 @@ var HistoryRevisionRequestSchema = external_exports.strictObject({
     dependencyContext: HistoryDependencyContextSchema.optional()
   })).max(50)
 });
+var HistoryCarryRequestSchema = external_exports.strictObject({
+  fromCommit: Sha,
+  atCommit: Sha,
+  parents: external_exports.array(external_exports.strictObject({ commit: Sha, parents: external_exports.array(Sha).max(32) })).max(8192),
+  /** Every symbol in a file the range changed, both sides; `null` = too many to name, treat all as changed. */
+  changedSymbols: external_exports.array(external_exports.string().regex(/^sym_[a-f0-9]{8,64}$/)).max(5e3).nullable(),
+  /** Manifests the range changed; `null` = a lockfile (or too many manifests) changed, treat all as changed. */
+  changedManifests: external_exports.array(external_exports.string().regex(/^hmanifest_[a-f0-9]{32}$/)).max(512).nullable()
+});
+var HISTORY_REVIEW_BUDGET = 48e3;
+var HISTORY_REVIEW_POLICY = `reviewer-view-${HISTORY_REVIEW_BUDGET}`;
 
 // ../../packages/shared/src/edit-placeholder.ts
 var AUTO_MINT_PREFIX = "addressed by an edit to ";
@@ -14773,13 +14784,13 @@ function loadNodeSqlite() {
   }
 }
 var DatabaseSync = loadNodeSqlite().DatabaseSync;
-function openDatabase(path, opts) {
-  const db = opts ? new DatabaseSync(path, opts) : new DatabaseSync(path);
+function openDatabase(path2, opts) {
+  const db = opts ? new DatabaseSync(path2, opts) : new DatabaseSync(path2);
   try {
     db.exec("PRAGMA foreign_keys = ON");
   } catch {
   }
-  if (path !== ":memory:" && !opts?.readOnly) {
+  if (path2 !== ":memory:" && !opts?.readOnly) {
     try {
       db.exec("PRAGMA journal_mode = WAL");
       db.exec("PRAGMA synchronous = NORMAL");
@@ -14788,20 +14799,20 @@ function openDatabase(path, opts) {
     } catch {
     }
   }
-  const wrapStmt = (stmt) => ({
+  const wrapStmt = (stmt2) => ({
     run: (...params) => {
-      const r = stmt.run(...coerceParams(params));
+      const r = stmt2.run(...coerceParams(params));
       return {
         changes: Number(r.changes),
         lastInsertRowid: Number(r.lastInsertRowid)
       };
     },
     get: (...params) => {
-      const r = stmt.get(...coerceParams(params));
+      const r = stmt2.get(...coerceParams(params));
       return r;
     },
     all: (...params) => {
-      const r = stmt.all(...coerceParams(params));
+      const r = stmt2.all(...coerceParams(params));
       return r;
     }
   });
@@ -14855,6 +14866,584 @@ function normalizeParam(v) {
   return v;
 }
 
+// ../../packages/local-shared/src/tag-grammar.ts
+var TAG_CANONICAL_ID_PREFIXES = ["pat", "sol", "drc", "dcause", "dfix", "dprob", "dvuln", "prob", "claim", "err"];
+var TAG_HANDLE_SOURCE = String.raw`\[([a-z0-9][\w-]{0,80})\]|((?:${TAG_CANONICAL_ID_PREFIXES.join("|")})_[0-9a-f]{6,})`;
+var TAG_THREAD_SOURCE = String.raw`#([a-z][\w-]{0,63})`;
+var TAG_PLACEHOLDER_HANDLES = /* @__PURE__ */ new Set([
+  "handle",
+  "its-handle",
+  "another",
+  "a-third",
+  "h",
+  "h1",
+  "h2",
+  "id",
+  "its-id",
+  "a",
+  "b",
+  "\u2026",
+  "..."
+]);
+var TAG_EXAMPLES = {
+  prior: (ref) => `([${ref}])`,
+  problem: () => `[!one line on what's wrong]`,
+  vulnerability: () => `[!vuln: who can do what; observed basis @ path:line]`,
+  suspectedVulnerability: () => `[?vuln: consequence; missing check]`,
+  vulnerabilityThread: () => `[!#v vuln: finding here]`,
+  fix: (ref) => `(fix:[${ref}])`,
+  // CONSTRAINT — the native capture path for a DIFFUSE problem (a constraint/tension/
+  // conflict that shaped a decision). Free text, attaches to the decision sentence the
+  // agent is already writing. Full rationale in the constraint note below + prior-tags.ts.
+  constraint: () => `(constraint: the limitation that forced it)`,
+  // TRIAGE — routes the problem/symptom in scope to its cause. `(cause:[handle])`
+  // links to a cited RootCause/Solution node; `(cause: free text)` mints a RootCause
+  // from the text. Harvested in prior-tags.ts → engine.ts (see the triage note below).
+  triage: (ref) => `(cause:[${ref}])`,
+  // Unlike a bare cause citation, this handle names the Problem being explained.
+  triageExplain: (ref) => `(cause:[${ref}] the mechanism)`,
+  // The MINT form — free-text cause that mints a RootCause. Prime-time surfacing
+  // (recallForFile) pastes this next to an open Problem that has no cause yet, so the
+  // diagnostic moment is cued when the agent is looking at the problem. Kept here so
+  // the grammar can't drift from parseInlineTags' `(cause: …)` acceptance.
+  triageMint: () => `(cause: why it happens)`,
+  // THREAD forms — the witness-declared symptom↔cause/fix binding. A `#id` on the
+  // flag names the diagnosis thread; the same `#id` on a later verb binds to it
+  // explicitly (across sentences AND turns), replacing proximity guessing. Adjacent
+  // tags never need one — the id is for diagnoses that unfold over distance.
+  problemThread: () => `[!#slug one line on what's wrong]`,
+  causeThread: () => `(cause:#slug the mechanism)`,
+  fixThread: (thread = "slug") => `(fix:#${thread} what you changed)`,
+  // ATTEMPT arc — what's being tried and what didn't work. A failed attempt is a
+  // witnessed NEGATIVE result: it saves the next agent the same dead end.
+  tried: () => `(tried: the approach you're attempting)`,
+  failed: () => `(failed: what didn't work and the dead end it rules out)`,
+  // `(failed:[h] …)` on a shown SOLUTION — the refute-by-failure form the context render teaches.
+  failedCite: (ref) => `(failed:[${ref}] what came back)`,
+  // LINK verbs (AC epic) — bind the problem in scope to CANONICAL priors and
+  // abstractions. Multi-target by design: single links are weak; ~3 links to 3
+  // DIFFERENT relevant priors is the target shape (see linkBullet).
+  instance: (ref) => `(instance:[${ref}],[another],[a-third])`,
+  pattern: () => `(pattern: name the general shape)`,
+  // DOMAIN — the abstract area a problem is about; the concept layer an
+  // anchor-less problem clusters on. Mints/resolves a Domain by name.
+  domain: () => `(domain: The Area)`,
+  // PACKAGE/COMPONENT — agent-named public anchors (OM-agent-anchors): the
+  // package a problem is ABOUT (even when not a dependency) and the
+  // framework/product-level unit it concerns. Public spine anchors → the
+  // knowledge can cross to the collective.
+  package: () => `(package: the-package-name)`,
+  component: () => `(component: The Component)`,
+  aids: (ref) => `(aids:[${ref}])`,
+  // SOLUTION-STRUCTURE (SS-structure) — taught in the link bullet; Solution→Solution.
+  buildsOn: (ref) => `(builds-on:[${ref}])`,
+  supersedes: (ref) => `(supersedes:[${ref}])`,
+  alternative: (ref) => `(alternative:[${ref}])`,
+  // VERDICT (VS-verdict-tags) — a judgment on a SHOWN prior, distinct from leaning on it.
+  // `confirm` rides the corroborate channel (it held); `refute` the contradict channel
+  // (it's wrong / didn't hold) and REQUIRES a reason. This is the inline producer the
+  // evidence channels lacked — refute sat dead (contradictionPressure 0) until now, while
+  // lean-on corroboration lived, because only corroboration had an inline path. Grammar
+  // single-sourced with parseInlineTags' CONFIRM_PREFIX/REFUTE_PREFIX.
+  confirm: (ref) => `(confirm:[${ref}])`,
+  refute: (ref) => `(refute:[${ref}] one line why)`,
+  // RETRACT — "not a real problem": the errata-resolved block with a disposition
+  // (parseDesignResolutions, turn.ts). No inline form exists; the block is the grammar.
+  retract: (id) => ["```errata-resolved", `id: ${id}`, "disposition: false_positive", "reason: why it was never a real problem", "```"].join("\n")
+};
+var P = "Problem";
+var S = "Solution";
+var RC = "RootCause";
+var CITE_LOWERING = [
+  { target: RC, writes: [{ from: P, edge: "CAUSED_BY", to: RC }] },
+  { target: S, writes: [{ from: P, edge: "SOLVED_BY", to: S }] },
+  { target: "Pattern", writes: [{ from: P, edge: "INSTANCE_OF", to: "Pattern" }, { from: "Pattern", edge: "ANCHORED_AT", to: "File" }], note: "cite-anchor promotion after 2 sessions", decision: "d", knownViolation: { edge: "ANCHORED_AT", finding: "motif cite-anchor promotion writes a refused ANCHORED_AT" } },
+  { target: "Package", writes: [{ from: P, edge: "DEPENDS_ON", to: "Package" }] },
+  { target: "Language", writes: [{ from: P, edge: "OCCURS_IN", to: "Language" }] },
+  { target: "Tool", writes: [{ from: P, edge: "CONCERNS", to: "Tool" }] },
+  { target: "Component", writes: [{ from: P, edge: "CONCERNS", to: "Component" }] },
+  { target: P, writes: [{ from: P, edge: "RELATES_TO", to: P }, { from: P, edge: "ANCHORED_AT", to: "File" }], note: "corroboration witness + cite-anchor promotion" },
+  { target: "AntiPattern", writes: [{ from: P, edge: "RELATES_TO", to: "AntiPattern" }, { from: "AntiPattern", edge: "ANCHORED_AT", to: "File" }], decision: "e", knownViolation: { edge: "ANCHORED_AT", finding: "motif cite-anchor promotion writes a refused ANCHORED_AT" } },
+  { target: "Technique", writes: [{ from: P, edge: "RELATES_TO", to: "Technique" }, { from: "Technique", edge: "ANCHORED_AT", to: "File" }], decision: "e", knownViolation: { edge: "ANCHORED_AT", finding: "motif cite-anchor promotion writes a refused ANCHORED_AT" } },
+  { target: "Weakness", writes: [{ from: P, edge: "RELATES_TO", to: "Weakness" }], decision: "e" },
+  { target: "Domain", writes: [{ from: P, edge: "RELATES_TO", to: "Domain" }], decision: "e" },
+  { target: "Claim", writes: [{ from: P, edge: "RELATES_TO", to: "Claim" }, { from: "Claim", edge: "ANCHORED_AT", to: "File" }] }
+];
+var INSTANCE_LOWERING = [
+  { target: "Pattern", writes: [{ from: P, edge: "INSTANCE_OF", to: "Pattern" }] },
+  { target: P, writes: [{ from: P, edge: "RELATES_TO", to: P }] },
+  { target: S, writes: [{ from: P, edge: "SOLVED_BY", to: S }], note: "an instance cite on a Solution claims the problem is solved by it", decision: "a" },
+  { target: RC, writes: [{ from: P, edge: "CAUSED_BY", to: RC }] },
+  { target: "AntiPattern", writes: [{ from: P, edge: "RELATES_TO", to: "AntiPattern" }], decision: "e" },
+  { target: "Technique", writes: [{ from: P, edge: "RELATES_TO", to: "Technique" }], decision: "e" },
+  { target: "Weakness", writes: [{ from: P, edge: "RELATES_TO", to: "Weakness" }], decision: "e" },
+  { target: "Domain", writes: [{ from: P, edge: "RELATES_TO", to: "Domain" }], decision: "e" },
+  { target: "Package", writes: [{ from: P, edge: "DEPENDS_ON", to: "Package" }] },
+  { target: "Component", writes: [{ from: P, edge: "CONCERNS", to: "Component" }] }
+];
+var TRIAGE_TO_RC = [
+  { from: P, edge: "TRIAGED_BY", to: "Triage" },
+  { from: "Triage", edge: "INDICATES", to: RC },
+  { from: P, edge: "CAUSED_BY", to: RC }
+];
+var TAG_VERBS = [
+  {
+    verb: "cite",
+    form: "citation",
+    opener: "(",
+    kinds: ["prior"],
+    args: "handles",
+    thread: false,
+    handleRequired: true,
+    lowering: CITE_LOWERING,
+    examples: ["prior"],
+    hint: "cite a shown prior you leaned on: ([its-handle]) \u2014 handles only, no prose inside the parens",
+    taught: "taught"
+  },
+  {
+    verb: "!",
+    form: "flag",
+    opener: "[!",
+    kinds: ["problem", "triage", "vulnerability", "fix", "prior"],
+    args: "flag-body",
+    thread: true,
+    minText: 8,
+    qualifiers: [
+      { name: "vuln", taught: true, note: "[!vuln: \u2026] \u2192 Vulnerability (asserted)" },
+      { name: "fixed", taught: false, note: "[!fixed: X] \u2192 read as a self-found fix" },
+      { name: "resolved", taught: false, note: "[!resolved: X] \u2192 read as a self-found fix" }
+    ],
+    lowering: [
+      { target: P, writes: [], note: "mints a Problem; `@ path[:line]` anchors it (ANCHORED_AT to code)" },
+      { target: RC, writes: [...TRIAGE_TO_RC, { from: RC, edge: "CAUSED_BY", to: RC }], note: "`<-` segments: first \u2192 triage route, later \u2192 RootCause chain" },
+      { target: "Vulnerability", writes: [], note: "[!vuln: \u2026]; `<-` causes stay on the finding (vulnerabilityCauses)" }
+    ],
+    examples: ["problem", "problemThread", "vulnerability", "vulnerabilityThread"],
+    hint: "flag a problem on one line: [!what's wrong @ path:42]; fold causes with <- ; a fix goes in (fix: \u2026), not [!fixed: \u2026]",
+    taught: "taught"
+  },
+  {
+    verb: "?",
+    form: "flag",
+    opener: "[?",
+    kinds: ["todo", "vulnerability"],
+    args: "flag-body",
+    thread: true,
+    minText: 8,
+    qualifiers: [{ name: "vuln", taught: true, note: "[?vuln: \u2026] \u2192 Vulnerability (suspected)" }],
+    lowering: [{ target: P, writes: [], note: "mints a todo Problem; a fix can close it today", decision: "g" }],
+    examples: ["suspectedVulnerability"],
+    hint: "[?\u2026] marks an open question / todo; [?vuln: consequence; missing check] a suspected vulnerability",
+    taught: "untaught",
+    taughtBy: "only the [?vuln:] form is taught; the bare [?todo] form is not",
+    decisions: ["g"]
+  },
+  {
+    verb: "fix",
+    form: "verb",
+    opener: "(fix:",
+    kinds: ["fix"],
+    args: "handles-text",
+    thread: true,
+    minText: 12,
+    lowering: [
+      { target: P, writes: [{ from: P, edge: "SOLVED_BY", to: S }], note: "closes the Problem; a note \u226512 chars mints the Solution" },
+      { target: "Vulnerability", writes: [{ from: "Vulnerability", edge: "SOLVED_BY", to: S }] },
+      { target: RC, writes: [], note: "dropped: 'fix tag went nowhere' (not a Problem); no tag writes FIXED_BY", decision: "f" }
+    ],
+    examples: ["fix", "fixThread"],
+    hint: "one fix per tag: (fix:[its-handle]) or (fix:#thread what you changed) \u2014 put the cause in its own (cause: \u2026)",
+    taught: "taught",
+    decisions: ["f"]
+  },
+  {
+    verb: "cause",
+    form: "verb",
+    opener: "(cause:",
+    kinds: ["triage"],
+    args: "handles-text",
+    thread: true,
+    minText: 8,
+    lowering: [
+      { target: RC, writes: TRIAGE_TO_RC },
+      { target: P, writes: [{ from: P, edge: "TRIAGED_BY", to: "Triage" }, { from: "Triage", edge: "INDICATES", to: RC }, { from: P, edge: "CAUSED_BY", to: RC }], note: "(cause:[problem] mechanism) \u2014 the cited Problem is the symptom; the mechanism mints the RootCause" },
+      { target: S, writes: [{ from: P, edge: "TRIAGED_BY", to: "Triage" }, { from: "Triage", edge: "INDICATES", to: S }], decision: "b", knownViolation: { edge: "INDICATES", finding: "(cause:[solution]) writes a refused INDICATES \u2192 Solution" } }
+    ],
+    examples: ["triage", "triageExplain", "triageMint", "causeThread"],
+    hint: "(cause: the mechanism you'd change) or (cause:[root-cause-handle]); bind a distant symptom with (cause:#thread \u2026)",
+    taught: "taught",
+    decisions: ["b"]
+  },
+  {
+    verb: "constraint",
+    form: "verb",
+    opener: "(constraint:",
+    kinds: ["constraint"],
+    args: "text",
+    thread: false,
+    minText: 8,
+    textRequired: true,
+    lowering: [{ target: P, writes: [], note: "mints a constraint-kind Problem" }],
+    examples: ["constraint"],
+    hint: "(constraint: the limitation that forced the decision)",
+    taught: "taught"
+  },
+  {
+    verb: "tried",
+    form: "verb",
+    opener: "(tried:",
+    kinds: ["attempt"],
+    args: "text",
+    thread: true,
+    minText: 8,
+    textRequired: true,
+    lowering: [{ target: P, writes: [], note: "journals an attempt on the bound problem" }],
+    examples: ["tried"],
+    hint: "(tried: the approach) \u2014 bind with (tried:#thread \u2026)",
+    taught: "taught"
+  },
+  {
+    verb: "failed",
+    form: "verb",
+    opener: "(failed:",
+    kinds: ["failure"],
+    args: "handles-text",
+    thread: true,
+    minText: 8,
+    textRequired: true,
+    lowering: [
+      { target: P, writes: [], note: "journals a failed attempt on the bound problem" },
+      { target: S, writes: [], note: "(failed:[h]) refutes the cited prior (contradictionPressure); skips the label gate today", decision: "j" }
+    ],
+    examples: ["failed", "failedCite"],
+    hint: "(failed: what didn't work); (failed:[solution] what came back) refutes a shown fix",
+    taught: "taught",
+    decisions: ["j"]
+  },
+  {
+    verb: "instance",
+    form: "verb",
+    opener: "(instance:",
+    kinds: ["instance"],
+    args: "handles",
+    thread: false,
+    handleRequired: true,
+    lowering: INSTANCE_LOWERING,
+    examples: ["instance"],
+    hint: "(instance:[h1],[h2],[h3]) \u2014 ~3 DIFFERENT shown priors this problem instantiates; handles only",
+    taught: "taught",
+    decisions: ["a", "e"]
+  },
+  {
+    verb: "pattern",
+    form: "verb",
+    opener: "(pattern:",
+    kinds: ["pattern"],
+    args: "handle-or-text",
+    thread: false,
+    minText: 3,
+    lowering: [{ target: "Pattern", writes: [{ from: P, edge: "INSTANCE_OF", to: "Pattern" }], note: "a handle must be a Pattern; free text resolves-or-mints one" }],
+    examples: ["pattern"],
+    hint: "(pattern: name the general shape) or (pattern:[shown-pattern])",
+    taught: "taught"
+  },
+  {
+    verb: "domain",
+    form: "verb",
+    opener: "(domain:",
+    kinds: ["domain"],
+    args: "text",
+    thread: false,
+    minText: 2,
+    textRequired: true,
+    lowering: [{ target: "Domain", writes: [{ from: P, edge: "PERTAIN_TO", to: "Domain" }], note: '(domain:#t X) mints a Domain named "#t X" today', decision: "k" }],
+    examples: ["domain"],
+    hint: "(domain: The Area) \u2014 Title Case, no thread",
+    taught: "taught",
+    decisions: ["k"]
+  },
+  {
+    verb: "package",
+    form: "verb",
+    opener: "(package:",
+    kinds: ["package"],
+    args: "text",
+    thread: false,
+    minText: 2,
+    textRequired: true,
+    lowering: [{ target: "Package", writes: [{ from: P, edge: "DEPENDS_ON", to: "Package" }], note: "means 'concerns', written as DEPENDS_ON", decision: "c" }],
+    examples: ["package"],
+    hint: "(package: the-package-name) \u2014 the public package it's about",
+    taught: "taught",
+    decisions: ["c"]
+  },
+  {
+    verb: "component",
+    form: "verb",
+    opener: "(component:",
+    kinds: ["component"],
+    args: "text",
+    thread: false,
+    minText: 2,
+    textRequired: true,
+    lowering: [{ target: "Component", writes: [{ from: P, edge: "CONCERNS", to: "Component" }] }],
+    examples: ["component"],
+    hint: "(component: The Component) \u2014 the framework/product unit",
+    taught: "taught"
+  },
+  {
+    verb: "aids",
+    form: "verb",
+    opener: "(aids:",
+    kinds: ["transfer"],
+    args: "handles",
+    thread: true,
+    handleRequired: true,
+    lowering: [{ target: P, writes: [{ from: S, edge: "MAY_RESOLVE", to: P }], note: "source = the Solution in scope; non-Problem targets are skipped" }],
+    examples: ["aids"],
+    hint: "(aids:[problem-handle],\u2026) \u2014 other shown problems your fix might also resolve",
+    taught: "taught"
+  },
+  {
+    verb: "builds-on",
+    form: "verb",
+    opener: "(builds-on:",
+    kinds: ["builds-on"],
+    args: "handles",
+    thread: true,
+    handleRequired: true,
+    lowering: [{ target: S, writes: [{ from: S, edge: "BUILDS_ON", to: S }] }],
+    examples: ["buildsOn"],
+    hint: "(builds-on:[shown-solution]) \u2014 your fix layers on it",
+    taught: "taught",
+    taughtBy: "linkBullet instruction text"
+  },
+  {
+    verb: "supersedes",
+    form: "verb",
+    opener: "(supersedes:",
+    kinds: ["supersedes"],
+    args: "handles",
+    thread: true,
+    handleRequired: true,
+    lowering: [{ target: S, writes: [{ from: S, edge: "SUPERSEDES", to: S }] }],
+    examples: ["supersedes"],
+    hint: "(supersedes:[shown-solution]) \u2014 your fix replaces it",
+    taught: "taught",
+    taughtBy: "linkBullet instruction text"
+  },
+  {
+    verb: "alternative",
+    form: "verb",
+    opener: "(alternative:",
+    kinds: ["alternative"],
+    args: "handles",
+    thread: true,
+    handleRequired: true,
+    lowering: [{ target: S, writes: [{ from: S, edge: "ALTERNATIVE_TO", to: S }] }],
+    examples: ["alternative"],
+    hint: "(alternative:[shown-solution]) \u2014 a different valid approach",
+    taught: "taught",
+    taughtBy: "linkBullet instruction text"
+  },
+  {
+    verb: "confirm",
+    form: "verb",
+    opener: "(confirm:",
+    kinds: ["confirm"],
+    args: "handles",
+    thread: false,
+    handleRequired: true,
+    lowering: [{ target: S, writes: [], note: "corroboration witness (corroborationCount), no edge" }],
+    examples: ["confirm"],
+    hint: "(confirm:[shown-prior]) \u2014 it held",
+    taught: "taught",
+    taughtBy: "verdictBullet + context render",
+    decisions: ["j"]
+  },
+  {
+    verb: "refute",
+    form: "verb",
+    opener: "(refute:",
+    kinds: ["refute"],
+    args: "handles-text",
+    thread: false,
+    minText: 4,
+    handleRequired: true,
+    textRequired: true,
+    lowering: [{ target: S, writes: [], note: "contradiction witness (contradictionPressure), no edge; reason stays local" }],
+    examples: ["refute"],
+    hint: "(refute:[shown-prior] one line why) \u2014 the reason is required",
+    taught: "taught",
+    taughtBy: "verdictBullet + context render",
+    decisions: ["j"]
+  }
+];
+var TAG_FENCES = [
+  {
+    fence: "errata-problem",
+    fields: ["problem", "cause", "fix", "anchor", "kind"],
+    required: [["problem"]],
+    taught: "untaught",
+    parser: "apps/daemon/src/turn.ts parseDesignFlags",
+    decisions: ["h"],
+    hint: "use an inline [!\u2026] flag instead (errata-problem cause ids never meet inline ids)"
+  },
+  {
+    fence: "errata-resolved",
+    fields: ["id", "problem", "fix", "disposition", "reason"],
+    required: [["id", "problem"]],
+    taught: "taught",
+    taughtBy: "retract form only (TAG_EXAMPLE.retract); the fix form is untaught",
+    parser: "apps/daemon/src/turn.ts parseDesignResolutions",
+    hint: "```errata-resolved with id: and disposition: false_positive | invalid, reason: \u2026"
+  },
+  {
+    fence: "errata-triage",
+    fields: ["presenting", "cause", "test", "fix", "drift", "route"],
+    required: [["presenting", "route"], ["cause", "test"]],
+    taught: "taught",
+    taughtBy: "MCP errata_triage tool copy",
+    parser: "packages/local-graph/src/triage.ts parseTriageFences",
+    hint: "```errata-triage with presenting: and cause: (or route: + test: to answer one)"
+  },
+  {
+    fence: "errata-abstraction",
+    fields: ["candidate", "principle", "covers"],
+    required: [["candidate"], ["principle"], ["covers"]],
+    taught: "taught",
+    taughtBy: "MCP errata_pending_abstractions tool copy",
+    parser: "packages/local-graph/src/abstraction.ts parseAbstractionFences",
+    hint: "```errata-abstraction with candidate:, principle:, covers: (all required)"
+  },
+  {
+    fence: "errata-intent",
+    fields: ["intent"],
+    required: [["intent"]],
+    taught: "taught",
+    parser: "packages/local-graph/src/intent.ts parseIntentFences",
+    hint: "```errata-intent with intent: what you're about to do"
+  },
+  {
+    fence: "errata-share",
+    fields: ["priors"],
+    required: [["priors"]],
+    taught: "taught",
+    taughtBy: "subagent hand-off copy",
+    parser: "packages/local-graph/src/intent.ts parseShareFence",
+    hint: "```errata-share with priors: all | [h1], [h2]"
+  }
+];
+var TAG_VERB_BY_NAME = new Map(
+  TAG_VERBS.filter((v) => v.form === "verb").map((v) => [v.verb, v])
+);
+var TAG_PAREN_VERBS = [...TAG_VERB_BY_NAME.keys()].sort((a, b) => b.length - a.length);
+var TAG_GRAMMAR_OPENERS = [
+  ...new Set(TAG_VERBS.filter((v) => v.form !== "citation").map((v) => v.opener))
+];
+var TAG_QUOTED_PAREN_SOURCE = String.raw`\(\s*(?:${TAG_PAREN_VERBS.map((v) => v.replace(/-/g, "\\-")).join("|")})\s*:|\(\[`;
+var TAG_QUOTED_RE = new RegExp(String.raw`\[[!?]|` + TAG_QUOTED_PAREN_SOURCE, "i");
+var TAG_QUOTED_PAREN_RE = new RegExp(TAG_QUOTED_PAREN_SOURCE, "i");
+function tagGrammarCopy() {
+  const copy = [];
+  for (const ref of ["its-handle", "its-id", "h", "id"]) {
+    for (const build of Object.values(TAG_EXAMPLES)) copy.push(build(ref));
+  }
+  for (const v of TAG_VERBS) {
+    copy.push(v.hint);
+    if (v.taughtBy) copy.push(v.taughtBy);
+    for (const q of v.qualifiers ?? []) copy.push(q.note);
+    for (const l of v.lowering) {
+      if (l.note) copy.push(l.note);
+      if (l.knownViolation) copy.push(l.knownViolation.finding);
+    }
+  }
+  for (const f of TAG_FENCES) copy.push(f.hint);
+  return copy;
+}
+var TEMPLATE_VERB_GROUP = new RegExp(
+  String.raw`\(\s*(${TAG_PAREN_VERBS.map((v) => v.replace(/-/g, "\\-")).join("|")})\s*:((?:[^()\n]|\([^()\n]*\))*)\)`,
+  "gi"
+);
+var BRACKET_TOKEN = /\[([^\]\n]{1,80})\]/g;
+var REAL_HANDLE_SHAPE = new RegExp(
+  String.raw`^(?:[a-z0-9]+(?:-[a-z0-9]+)*-(?=[0-9a-f]{0,3}\d)[0-9a-f]{4}|(?:${TAG_CANONICAL_ID_PREFIXES.join("|")})_[0-9a-f]{6,})$`,
+  "i"
+);
+function normalizeTemplateBody(body) {
+  return body.replace(/…|\.{3}/g, " ").replace(/\s+/g, " ").trim().replace(/^[\s,;:—–-]+|[\s,;:.—–-]+$/g, "").toLowerCase();
+}
+function deriveTagTemplates(copy) {
+  const bodies = /* @__PURE__ */ new Set();
+  const handles = new Set([...TAG_PLACEHOLDER_HANDLES].map((h) => h.toLowerCase()));
+  for (const text of copy) {
+    for (const m of text.matchAll(BRACKET_TOKEN)) {
+      const token = m[1].trim().toLowerCase();
+      if (!/^[!?]/.test(token) && !REAL_HANDLE_SHAPE.test(token)) handles.add(token);
+    }
+  }
+  for (const text of copy) {
+    for (const m of text.matchAll(TEMPLATE_VERB_GROUP)) {
+      const body = normalizeTemplateBody(m[2]);
+      bodies.add(body);
+      const unthreaded = normalizeTemplateBody(body.replace(/^#[a-z][\w-]*/i, ""));
+      bodies.add(unthreaded);
+      const rest = normalizeTemplateBody(unthreaded.replace(BRACKET_TOKEN, (t, h) => handles.has(h.trim().toLowerCase()) ? " " : t).replace(/,/g, " "));
+      bodies.add(rest);
+    }
+  }
+  bodies.delete("");
+  return { bodies, handles };
+}
+var TAG_TEMPLATES = deriveTagTemplates(tagGrammarCopy());
+var VERB_WORDS_SOURCE = TAG_PAREN_VERBS.map((v) => v.replace(/-/g, "\\-")).join("|");
+var JOINED_VERB = new RegExp(String.raw`[,;]\s*(?=(?:${VERB_WORDS_SOURCE})\s*:)`, "i");
+var LEADING_VERB = new RegExp(String.raw`^\s*(${VERB_WORDS_SOURCE})\s*:`, "i");
+var ANY_VERB_WORD = new RegExp(String.raw`\b(?:${VERB_WORDS_SOURCE})\s*:`, "gi");
+var QUOTED_TAG_OPENER = new RegExp(String.raw`\(\s*(?:(${VERB_WORDS_SOURCE})\s*:|(?=\[))`, "gi");
+
+// ../../packages/local-graph/src/wm-calibration.ts
+var WM_CALIBRATION_KEYS = [
+  "shownCount",
+  "evictedCount",
+  "reinforceShownCount",
+  "reinforceRecentCount",
+  "reinforceEvictedCount",
+  "reinforceUnshownCount",
+  "reinforceUnshownQueryOnlyCount"
+];
+var WM_COUNTED_PREDICATE = WM_CALIBRATION_KEYS.map((k) => `json_type(attrs_json, '$.${k}') IS NOT NULL`).join(" OR ");
+var wmCounterSql = (k) => `CASE WHEN json_type(attrs_json, '$.${k}') IN ('integer', 'real') THEN json_extract(attrs_json, '$.${k}') END`;
+
+// ../../packages/local-graph/src/exposure-attrs.ts
+var EXPOSURE_ATTRS = [
+  "shownCount",
+  "evictedCount",
+  "firstShownAt",
+  "firstEvictedAt",
+  "firstShownAtSeq",
+  "lastShownAtSeq",
+  "lastEvictedAtSeq",
+  "shownSinceTouch",
+  "shownSinceTouchAt",
+  "exposureLog",
+  "exposureLogStart",
+  "exposureLogSince",
+  "exposureFirst",
+  "exposureTrimmed"
+];
+var EXPOSURE_SCOPE = "exposure";
+var EXPOSURE_KEYS = new Set(EXPOSURE_ATTRS);
+var isExposureAttr = (key) => EXPOSURE_KEYS.has(key);
+function pickExposure(attrs) {
+  const out = {};
+  for (const k of EXPOSURE_ATTRS) if (attrs[k] !== void 0) out[k] = attrs[k];
+  return out;
+}
+function exposureDocSql(key) {
+  return `coalesce((SELECT x.attrs_json FROM node_exposure x WHERE x.id = nodes.id AND json_type(x.attrs_json, '$.${key}') IS NOT NULL), attrs_json)`;
+}
+
 // ../../packages/local-graph/src/history-cache-floor.ts
 var HISTORY_CACHE_FLOOR_KEY = "history-cache-withdrawal-floor-3";
 function installHistoryCacheFloor(db) {
@@ -14895,7 +15484,7 @@ function installHistoryCacheFloor(db) {
         OR EXISTS(SELECT 1 FROM history_cache_withdrawals w WHERE w.id = nodes.id))
       AND (embedding_blob IS NOT NULL OR embedding_json <> '[]' OR is_landmark <> 0
         OR description <> ${description} OR attrs_json <> ${attrs});`;
-    const internal = `key IN ('orgId','teamId','groupId','projectId','aliasTexts','aliasCanonicalIds')
+    const internal = `key IN ('orgId','teamId','groupId','projectId','aliasTexts','aliasCanonicalIds','residueAudienceVerified')
       OR key GLOB 'mergedFrom*' OR key GLOB '*WitnessKeys' OR key GLOB '*Sessions'
       OR key GLOB 'authoringSession*' OR key GLOB 'contributor*' OR key GLOB 'witnessKeys*'`;
     const stripMetadata = (scope) => `UPDATE nodes SET attrs_json=(
@@ -15029,7 +15618,9 @@ function installEditPlaceholderRetirement(db) {
 }
 
 // ../../packages/local-graph/src/cloud-attr-compaction.ts
-var CLOUD_ATTR_COMPACTION_KEY = "cloud-attr-compaction-1";
+var CLOUD_ATTR_COMPACTION_KEY = "cloud-attr-compaction-2";
+var V1_KEY = "cloud-attr-compaction-1";
+var STRUCT_LABELS = "('Problem', 'Solution', 'RootCause')";
 var DUPES = CLOUD_ATTR_DUPLICATE_KEYS.map((k) => `'${k}'`).join(",");
 function compacted(row) {
   const packed = `json_extract(${row}.attrs_json, '$.attrsJson')`;
@@ -15048,14 +15639,17 @@ function dirty(row) {
   return `json_extract(${row}.attrs_json, '$.source') = 'cloud' AND (${has})`;
 }
 function installCloudAttrCompaction(db) {
-  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(CLOUD_ATTR_COMPACTION_KEY)) return;
+  const marked = (key) => Boolean(db.prepare("SELECT value FROM store_meta WHERE key = ?").get(key));
+  if (marked(CLOUD_ATTR_COMPACTION_KEY)) return;
+  const scope = marked(V1_KEY) ? ` AND label IN ${STRUCT_LABELS}` : "";
   db.transaction(() => {
     for (const operation of ["INSERT", "UPDATE"]) {
-      db.exec(`CREATE TRIGGER IF NOT EXISTS cloud_attr_compact_${operation.toLowerCase()}
+      db.exec(`DROP TRIGGER IF EXISTS cloud_attr_compact_${operation.toLowerCase()}`);
+      db.exec(`CREATE TRIGGER cloud_attr_compact_${operation.toLowerCase()}
         AFTER ${operation} ON nodes WHEN ${dirty("NEW")}
         BEGIN UPDATE nodes SET attrs_json = ${compacted("nodes")} WHERE id = NEW.id; END;`);
     }
-    db.exec(`UPDATE nodes SET attrs_json = ${compacted("nodes")} WHERE ${dirty("nodes")}`);
+    db.exec(`UPDATE nodes SET attrs_json = ${compacted("nodes")} WHERE ${dirty("nodes")}${scope}`);
     db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(CLOUD_ATTR_COMPACTION_KEY, "installed");
   });
 }
@@ -15093,6 +15687,313 @@ function installHistoryAttrSlim(db) {
   db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(HISTORY_ATTR_SLIM_KEY, "done");
 }
 
+// ../../packages/local-graph/src/text-index.ts
+var TEXT_INDEX_KEY = "text-index-trigram-2";
+var TEXT_INDEX_MIN_TERM = 3;
+function installTextIndex(db) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)) return;
+  try {
+    db.exec(`CREATE VIRTUAL TABLE temp.fts5_probe USING fts5(x, tokenize='trigram'); DROP TABLE temp.fts5_probe`);
+  } catch {
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "unavailable");
+    return;
+  }
+  db.transaction(() => {
+    db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS nodes_text
+      USING fts5(description, content='nodes', content_rowid='rowid', tokenize='trigram')`);
+    db.exec(`DROP TRIGGER IF EXISTS nodes_text_update_out; DROP TRIGGER IF EXISTS nodes_text_update_in;
+      DROP TRIGGER IF EXISTS nodes_text_update`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_insert AFTER INSERT ON nodes WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER nodes_text_update AFTER UPDATE OF description, valid_to ON nodes
+      WHEN OLD.description IS NOT NEW.description OR OLD.valid_to IS NOT NEW.valid_to
+      BEGIN
+        INSERT INTO nodes_text(nodes_text, rowid, description)
+          SELECT 'delete', OLD.rowid, OLD.description WHERE OLD.valid_to IS NULL;
+        INSERT INTO nodes_text(rowid, description)
+          SELECT NEW.rowid, NEW.description WHERE NEW.valid_to IS NULL;
+      END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_delete AFTER DELETE ON nodes WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`INSERT INTO nodes_text(nodes_text) VALUES ('delete-all')`);
+    db.exec(`INSERT INTO nodes_text(rowid, description) SELECT rowid, description FROM nodes WHERE valid_to IS NULL`);
+    db.prepare("INSERT OR REPLACE INTO store_meta(key,value) VALUES (?,?)").run("text-index-trigram-1", "installed");
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "installed");
+  });
+}
+function textIndexReady(db) {
+  return db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)?.["value"] === "installed";
+}
+
+// ../../packages/local-graph/src/change-feed.ts
+var CHANGE_FEED_KEY = "change-feed";
+var ANY_CHANGE = "*";
+var nodeScope = (label) => `node:${label}`;
+var CHANGE_LOG_KEEP = 25e4;
+var PRUNED_TO_KEY = "change-log-pruned-to";
+function installChangeFeed(db) {
+  if (changeFeedInstalled(db)) return;
+  db.transaction(() => {
+    db.exec("CREATE TABLE IF NOT EXISTS change_seq (scope TEXT PRIMARY KEY, seq INTEGER NOT NULL) WITHOUT ROWID");
+    db.exec(`CREATE TABLE IF NOT EXISTS change_log (change_seq INTEGER PRIMARY KEY, kind TEXT NOT NULL, id TEXT NOT NULL,
+      label TEXT, from_id TEXT, to_id TEXT)`);
+    for (const name of ["nodes", "edges"].flatMap((t) => ["insert", "update", "delete"].map((op) => `change_feed_${t}_${op}`))) {
+      db.exec(`DROP TRIGGER IF EXISTS ${name}`);
+    }
+    const changed = (table) => columns(db, table).map((c) => `OLD."${c}" IS NOT NEW."${c}"`).join(" OR ");
+    const strip = (row) => `json_remove(${row}.attrs_json, ${EXPOSURE_ATTRS.map((a) => `'$.${a}'`).join(", ")})`;
+    const exposureOnly = `(${columns(db, "nodes").filter((c) => c !== "attrs_json").map((c) => `OLD."${c}" IS NEW."${c}"`).join(" AND ")}
+      AND CASE WHEN json_valid(OLD.attrs_json) AND json_valid(NEW.attrs_json) THEN ${strip("OLD")} IS ${strip("NEW")} ELSE 0 END)`;
+    const bump = (...scopes) => `INSERT INTO change_seq(scope, seq) VALUES ${scopes.map((s) => `(${s}, 1)`).join(", ")}
+      ON CONFLICT(scope) DO UPDATE SET seq = seq + 1;`;
+    const seq = `(SELECT seq FROM change_seq WHERE scope = '*')`;
+    const logNode = (row) => `INSERT INTO change_log(change_seq, kind, id, label) VALUES (${seq}, 'node', ${row}.id, ${row}.label);`;
+    const logEdge = (row) => `INSERT INTO change_log(change_seq, kind, id, label, from_id, to_id) VALUES (${seq}, 'edge', ${row}.id, ${row}.type, ${row}.from_id, ${row}.to_id);`;
+    const node = (row) => `'node:' || ${row}.label`;
+    const edge = (row) => `'edge:' || ${row}.type`;
+    db.exec(`CREATE TRIGGER change_feed_nodes_insert AFTER INSERT ON nodes BEGIN ${bump(`'*'`, node("NEW"))} ${logNode("NEW")} END;`);
+    db.exec(`CREATE TRIGGER change_feed_nodes_update AFTER UPDATE ON nodes WHEN ${changed("nodes")} BEGIN
+      ${bump(`'*'`)}
+      INSERT INTO change_seq(scope, seq) SELECT CASE WHEN ${exposureOnly} THEN '${EXPOSURE_SCOPE}' ELSE ${node("NEW")} END, 1 WHERE 1
+        ON CONFLICT(scope) DO UPDATE SET seq = seq + 1;
+      INSERT INTO change_seq(scope, seq) SELECT ${node("OLD")}, 1 WHERE OLD.label IS NOT NEW.label
+        ON CONFLICT(scope) DO UPDATE SET seq = seq + 1;
+      ${logNode("NEW")}
+    END;`);
+    db.exec(`CREATE TRIGGER change_feed_nodes_delete AFTER DELETE ON nodes BEGIN ${bump(`'*'`, node("OLD"))} ${logNode("OLD")} END;`);
+    db.exec(`CREATE TRIGGER change_feed_edges_insert AFTER INSERT ON edges BEGIN ${bump(`'*'`, edge("NEW"))} ${logEdge("NEW")} END;`);
+    db.exec(`CREATE TRIGGER change_feed_edges_update AFTER UPDATE ON edges WHEN ${changed("edges")} BEGIN
+      ${bump(`'*'`, edge("NEW"))}
+      INSERT INTO change_seq(scope, seq) SELECT ${edge("OLD")}, 1 WHERE OLD.type IS NOT NEW.type
+        ON CONFLICT(scope) DO UPDATE SET seq = seq + 1;
+      ${logEdge("NEW")}
+    END;`);
+    db.exec(`CREATE TRIGGER change_feed_edges_delete AFTER DELETE ON edges BEGIN ${bump(`'*'`, edge("OLD"))} ${logEdge("OLD")} END;`);
+    db.prepare("INSERT OR REPLACE INTO store_meta(key, value) VALUES (?, ?)").run(PRUNED_TO_KEY, String(readChangeSeq(db)));
+    db.prepare("INSERT OR REPLACE INTO store_meta(key, value) VALUES (?, ?)").run(CHANGE_FEED_KEY, columnSignature(db));
+  });
+}
+function readChangeSeq(db, scopes = [ANY_CHANGE]) {
+  if (!scopes.length) return 0;
+  const row = db.prepare(`SELECT coalesce(sum(seq), 0) AS n FROM change_seq WHERE scope IN (${scopes.map(() => "?").join(",")})`).get(...scopes);
+  return Number(row?.n ?? 0);
+}
+function changeLogCovers(db, sinceSeq) {
+  const prunedTo = Number(db.prepare("SELECT value FROM store_meta WHERE key = ?").get(PRUNED_TO_KEY)?.["value"] ?? NaN);
+  return Number.isFinite(prunedTo) && sinceSeq >= prunedTo;
+}
+function readChangedNodeIds(db, sinceSeq, labels) {
+  if (!changeLogCovers(db, sinceSeq)) return null;
+  if (!labels.length) return [];
+  const rows = db.prepare(`SELECT DISTINCT id FROM change_log WHERE change_seq > ? AND kind = 'node' AND label IN (${labels.map(() => "?").join(",")})`).all(sinceSeq, ...labels);
+  return rows.map((r) => r.id);
+}
+function readChangedAmong(db, sinceSeq, ids) {
+  if (!changeLogCovers(db, sinceSeq)) return null;
+  const out = [];
+  for (let i = 0; i < ids.length; i += 500) {
+    const chunk = ids.slice(i, i + 500);
+    const rows = db.prepare(`SELECT DISTINCT id FROM change_log WHERE change_seq > ? AND kind = 'node' AND id IN (${chunk.map(() => "?").join(",")})`).all(sinceSeq, ...chunk);
+    for (const r of rows) out.push(r.id);
+  }
+  return out;
+}
+function readLineageChangedFiles(db, sinceSeq) {
+  if (!changeLogCovers(db, sinceSeq)) return null;
+  const rows = db.prepare(LINEAGE_CHANGED_FILES_SQL).all({ s: sinceSeq });
+  return rows.map((r) => r.id);
+}
+var LINEAGE_CHANGED_FILES_SQL = `
+  SELECT id FROM change_log WHERE change_seq > :s AND kind = 'node' AND label = 'File'
+  UNION SELECT from_id FROM change_log WHERE change_seq > :s AND kind = 'edge' AND label IN ('DEFINES','CONTAINS')
+  UNION SELECT e.from_id FROM (SELECT DISTINCT id FROM change_log WHERE change_seq > :s AND kind = 'node') c
+    CROSS JOIN edges e ON e.to_id = c.id AND e.type IN ('DEFINES','CONTAINS')
+`;
+function pruneChangeLog(db) {
+  const max = Number(db.prepare("SELECT coalesce(max(change_seq), 0) AS n FROM change_log").get()?.["n"] ?? 0);
+  const cut = max - CHANGE_LOG_KEEP;
+  if (cut <= 0) return 0;
+  let removed = 0;
+  db.transaction(() => {
+    removed = Number(db.prepare("DELETE FROM change_log WHERE change_seq <= ?").run(cut).changes);
+    const prev = Number(db.prepare("SELECT value FROM store_meta WHERE key = ?").get(PRUNED_TO_KEY)?.["value"] ?? 0);
+    db.prepare("INSERT OR REPLACE INTO store_meta(key, value) VALUES (?, ?)").run(PRUNED_TO_KEY, String(Math.max(prev, cut)));
+  });
+  return removed;
+}
+function changeFeedInstalled(db) {
+  return db.prepare("SELECT value FROM store_meta WHERE key = ?").get(CHANGE_FEED_KEY)?.["value"] === columnSignature(db);
+}
+function columns(db, table) {
+  return db.prepare(`SELECT name FROM pragma_table_info('${table}') ORDER BY cid`).all().map((r) => r.name);
+}
+function columnSignature(db) {
+  return `5|${columns(db, "nodes").join(",")}|${columns(db, "edges").join(",")}|${EXPOSURE_ATTRS.join(",")}`;
+}
+
+// ../../packages/local-graph/src/lineage-integrity.ts
+var statements = /* @__PURE__ */ new WeakMap();
+function stmt(db, sql) {
+  let byDb = statements.get(db);
+  if (!byDb) statements.set(db, byDb = /* @__PURE__ */ new Map());
+  let s = byDb.get(sql);
+  if (!s) byDb.set(sql, s = db.prepare(sql));
+  return s;
+}
+var HISTORY_EDGE_TYPES = [
+  "SUPERSEDED_BY",
+  "CONTINUES",
+  "FORKED_FROM",
+  "REGRESSION_OF",
+  "SPLIT_INTO",
+  "REVEALED_BY"
+];
+var LINEAGE_INTEGRITY_KEY = "lineage-integrity-v1";
+var HISTORY_SQL = HISTORY_EDGE_TYPES.map((t) => `'${t}'`).join(",");
+var NOT_HISTORY = `type NOT IN (${HISTORY_SQL})`;
+var NOT_HISTORICAL_ROW = `json_type(attrs_json, '$.historical') IS NOT 'true'`;
+var RETAINS_EDGES = (n) => `(${n}.label = 'Problem'
+  AND json_type(${n}.attrs_json, '$.resolvedAt') IS NOT NULL
+  AND COALESCE(json_extract(${n}.attrs_json, '$.resolvedAs'), '') NOT IN ('duplicate', 'false_positive'))`;
+var PRESENT = (n) => `(${n}.valid_to IS NULL OR ${RETAINS_EDGES(n)})`;
+var STRANDED_EDGE_PREDICATE = `e.valid_to IS NULL AND e.${NOT_HISTORY}
+  AND (NOT EXISTS (SELECT 1 FROM nodes f WHERE f.id = e.from_id AND ${PRESENT("f")})
+    OR NOT EXISTS (SELECT 1 FROM nodes t WHERE t.id = e.to_id AND ${PRESENT("t")}))`;
+function countStrandedEdges(db) {
+  const rows = db.prepare(`SELECT e.type AS type, count(*) AS n FROM edges e WHERE ${STRANDED_EDGE_PREDICATE} GROUP BY e.type ORDER BY n DESC`).all();
+  const byType = {};
+  let total = 0;
+  for (const r of rows) {
+    byType[r.type] = Number(r.n);
+    total += Number(r.n);
+  }
+  return { total, byType };
+}
+function countLiveHeadConflicts(db) {
+  const row = db.prepare(
+    `SELECT count(*) AS n FROM (
+         SELECT COALESCE(logical_id, id) AS lid FROM nodes
+         WHERE valid_to IS NULL AND ${NOT_HISTORICAL_ROW}
+         GROUP BY lid HAVING count(*) > 1)`
+  ).get();
+  return Number(row?.n ?? 0);
+}
+function closeIncidentEdges(db, id, t) {
+  let closed = 0;
+  for (const side of ["from_id", "to_id"]) {
+    const r = stmt(db, `UPDATE edges SET valid_to = MAX(valid_from, ?) WHERE ${side} = ? AND valid_to IS NULL AND ${NOT_HISTORY}`).run(t, id);
+    closed += Number(r.changes);
+  }
+  return closed;
+}
+function reopenCascadeClosedEdges(db, id, closedAt) {
+  let reopened = 0;
+  for (const [side, other] of [["from_id", "to_id"], ["to_id", "from_id"]]) {
+    const r = stmt(
+      db,
+      `UPDATE edges SET valid_to = NULL
+       WHERE ${side} = ? AND valid_to = ? AND ${NOT_HISTORY}
+         AND EXISTS (SELECT 1 FROM nodes o WHERE o.id = edges.${other} AND o.valid_to IS NULL)`
+    ).run(id, closedAt);
+    reopened += Number(r.changes);
+  }
+  return reopened;
+}
+function collapseLiveHeads(db, logicalIds, t) {
+  const headsOf = db.prepare(
+    `SELECT id, version, valid_from FROM (
+       SELECT id, version, valid_from, attrs_json FROM nodes WHERE logical_id = ?1 AND valid_to IS NULL
+       UNION
+       SELECT id, version, valid_from, attrs_json FROM nodes WHERE id = ?1 AND logical_id IS NULL AND valid_to IS NULL
+     ) WHERE ${NOT_HISTORICAL_ROW}`
+  );
+  const continuesInto = db.prepare(
+    `SELECT to_id FROM edges WHERE from_id = ? AND type = 'CONTINUES' AND valid_to IS NULL`
+  );
+  const rekeyHead = db.prepare(`UPDATE nodes SET logical_id = ?1 WHERE id = ?1`);
+  const rekeyCopies = db.prepare(
+    `UPDATE nodes SET logical_id = ?1 WHERE logical_id = ?2 AND substr(id, 1, length(?1) + 2) = ?1 || '@v'`
+  );
+  const lineageMembers = db.prepare(
+    `SELECT id FROM nodes WHERE logical_id = ?1 UNION SELECT id FROM nodes WHERE id = ?1`
+  );
+  const closeContinues = db.prepare(
+    `UPDATE edges SET valid_to = MAX(valid_from, ?) WHERE from_id = ? AND to_id = ? AND type = 'CONTINUES' AND valid_to IS NULL`
+  );
+  let split = 0;
+  const queue = [...new Set(logicalIds)];
+  for (let i = 0; i < queue.length; i++) {
+    const lid = queue[i];
+    const heads = headsOf.all(lid);
+    if (heads.length < 2) continue;
+    const members = new Set(lineageMembers.all(lid).map((r) => r.id));
+    const splitOff = (h) => {
+      for (const { to_id } of continuesInto.all(h.id)) {
+        if (members.has(to_id)) closeContinues.run(t, h.id, to_id);
+      }
+      rekeyHead.run(h.id);
+      rekeyCopies.run(h.id, lid);
+      queue.push(h.id);
+      split++;
+    };
+    const kept = new Set(heads.map((h) => h.id));
+    for (const h of heads) {
+      if (h.id === lid) continue;
+      const refuted = continuesInto.all(h.id).some(
+        (e) => e.to_id !== h.id && kept.has(e.to_id)
+      );
+      if (refuted && kept.size > 1) {
+        splitOff(h);
+        kept.delete(h.id);
+      }
+    }
+    let remaining = heads.filter((h) => kept.has(h.id));
+    if (remaining.length < 2) continue;
+    remaining = [...remaining].sort(
+      (a, b) => Number(b.id === lid) - Number(a.id === lid) || Number(b.version) - Number(a.version) || Number(b.valid_from) - Number(a.valid_from) || (a.id < b.id ? -1 : 1)
+    );
+    for (const h of remaining.slice(1)) splitOff(h);
+  }
+  return split;
+}
+function repairLineageIntegrity(db, now) {
+  const historicalRowsClosed = Number(
+    db.prepare(
+      `UPDATE nodes SET valid_to = MAX(valid_from, COALESCE(
+           (SELECT s.valid_from FROM edges s WHERE s.id = 'edge_superseded_' || nodes.id), ?))
+         WHERE valid_to IS NULL AND json_type(attrs_json, '$.historical') = 'true'`
+    ).run(now).changes
+  );
+  const conflicted = db.prepare(
+    `SELECT COALESCE(logical_id, id) AS lid FROM nodes
+         WHERE valid_to IS NULL AND ${NOT_HISTORICAL_ROW}
+         GROUP BY lid HAVING count(*) > 1`
+  ).all().map((r) => r.lid);
+  const headsSplit = collapseLiveHeads(db, conflicted, now);
+  const strandedEdgesClosed = Number(
+    db.prepare(
+      `UPDATE edges SET valid_to = MAX(valid_from, COALESCE(
+           (SELECT min(v) FROM (
+              SELECT f.valid_to AS v FROM nodes f WHERE f.id = edges.from_id AND NOT ${PRESENT("f")}
+              UNION ALL
+              SELECT t.valid_to FROM nodes t WHERE t.id = edges.to_id AND NOT ${PRESENT("t")})), ?))
+         WHERE id IN (SELECT e.id FROM edges e WHERE ${STRANDED_EDGE_PREDICATE})`
+    ).run(now).changes
+  );
+  return { historicalRowsClosed, headsSplit, strandedEdgesClosed };
+}
+function installLineageIntegrityRepair(db, now = Date.now()) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(LINEAGE_INTEGRITY_KEY)) return null;
+  return db.transaction(() => {
+    const report = repairLineageIntegrity(db, now);
+    db.prepare("INSERT OR REPLACE INTO store_meta (key, value) VALUES (?, ?)").run(
+      LINEAGE_INTEGRITY_KEY,
+      JSON.stringify({ at: now, ...report })
+    );
+    return report;
+  });
+}
+
 // ../../packages/math/src/relevance.ts
 function pageRankScale(ranks) {
   const positive = [...ranks].filter((r) => Number.isFinite(r) && r > 0).sort((a, b) => a - b);
@@ -15103,6 +16004,177 @@ function pageRankScale(ranks) {
 var DEMAND_HOT = Math.log1p(10);
 var DEMAND_WARM = Math.log1p(5);
 
+// ../../packages/local-graph/src/node-select.ts
+var SELECT_INDEXES = [
+  "nodes_live_local_community",
+  "nodes_live_fold_candidate",
+  "nodes_live_resolved",
+  "nodes_live_fix_candidate",
+  "nodes_live_anchor_hint"
+];
+var EMBEDDING_DIM_SQL = "(CASE WHEN length(embedding_blob) >= 4 THEN length(embedding_blob) / 4 ELSE COALESCE(json_array_length(embedding_json), 0) END)";
+var KEY = /^[A-Za-z_][A-Za-z0-9_]*(\.[A-Za-z_][A-Za-z0-9_]*)*$/;
+var COLUMNS = /* @__PURE__ */ new Set([
+  "created_at",
+  "last_updated_at",
+  "page_rank",
+  "created_at_seq",
+  "last_reinforced_at_seq",
+  "cumulative_hits",
+  "extraction_confidence"
+]);
+function path(key) {
+  if (!KEY.test(key)) throw new Error(`selectNodes: bad attr key ${key}`);
+  return `'$.${key}'`;
+}
+function selectIndex(i) {
+  if (!SELECT_INDEXES.includes(i)) throw new Error(`selectNodes: bad index ${i}`);
+  return i;
+}
+function column(c) {
+  if (!COLUMNS.has(c)) throw new Error(`selectNodes: bad column ${c}`);
+  return c;
+}
+function compileNodeWhere(q) {
+  if (q.labels.length === 0) throw new Error("selectNodes: no labels");
+  const params = [...q.labels];
+  const byId = (q.where ?? []).some((w) => "idIn" in w || "idPrefix" in w && w.idPrefix.length > 0);
+  const unindexed = byId ? "+" : "";
+  const conds = [`${unindexed}label IN (${q.labels.map(() => "?").join(", ")})`];
+  if (!q.includeClosed) conds.push(`${unindexed}valid_to IS NULL`);
+  for (const w of q.where ?? []) {
+    if ("embedding" in w) {
+      conds.push(`${EMBEDDING_DIM_SQL} ${w.embedding === "present" ? ">" : "="} 0`);
+    } else if ("idPrefix" in w) {
+      conds.push("substr(id, 1, ?) = ?");
+      params.push(w.idPrefix.length, w.idPrefix);
+      if (w.idPrefix.length > 0) {
+        const last = w.idPrefix.charCodeAt(w.idPrefix.length - 1);
+        conds.push("id >= ? AND id < ?");
+        params.push(w.idPrefix, w.idPrefix.slice(0, -1) + String.fromCharCode(last + 1));
+      }
+    } else if ("idIn" in w) {
+      if (w.idIn.length === 0) conds.push("0");
+      else {
+        conds.push(`id IN (${w.idIn.map(() => "?").join(", ")})`);
+        params.push(...w.idIn);
+      }
+    } else if ("descriptionIn" in w) {
+      if (w.descriptionIn.length === 0) conds.push("0");
+      else {
+        conds.push(`description IN (${w.descriptionIn.map(() => "?").join(", ")})`);
+        params.push(...w.descriptionIn);
+      }
+    } else if ("column" in w) {
+      const c = column(w.column);
+      for (const [op, sym] of [["gte", ">="], ["gt", ">"], ["lte", "<="], ["lt", "<"]]) {
+        const v = w[op];
+        if (v !== void 0) {
+          conds.push(`${c} ${sym} ?`);
+          params.push(v);
+        }
+      }
+    } else {
+      const p = path(w.attr);
+      if ("absent" in w) conds.push(`json_type(attrs_json, ${p}) IS NULL`);
+      else if ("present" in w) conds.push(`json_type(attrs_json, ${p}) IS NOT NULL`);
+      else if ("nullish" in w) conds.push(`json_extract(attrs_json, ${p}) IS NULL`);
+      else if ("notNullish" in w) conds.push(`json_extract(attrs_json, ${p}) IS NOT NULL`);
+      else if ("eq" in w || "ne" in w) {
+        const v = "eq" in w ? w.eq : w.ne;
+        const neg = "ne" in w;
+        if (typeof v === "boolean") {
+          conds.push(`json_type(attrs_json, ${p}) ${neg ? "IS NOT" : "="} ?`);
+          params.push(v ? "true" : "false");
+        } else {
+          conds.push(neg ? `json_extract(attrs_json, ${p}) IS NOT ?` : `json_extract(attrs_json, ${p}) = ?`);
+          params.push(v);
+        }
+      }
+    }
+  }
+  return { where: conds.join(" AND "), params };
+}
+function attrValueSql(p, doc = "attrs_json") {
+  return `CASE json_type(${doc}, ${p}) WHEN 'integer' THEN CAST(json_extract(${doc}, ${p}) AS REAL) ELSE json_extract(${doc}, ${p}) END`;
+}
+function attrDocSql(key) {
+  return isExposureAttr(key) ? exposureDocSql(key) : "attrs_json";
+}
+function nodeSelectFrom(q) {
+  if (q.indexedBy) return `nodes INDEXED BY ${selectIndex(q.indexedBy)}`;
+  const where = q.where ?? [];
+  if (!q.includeClosed && where.some((w) => "descriptionIn" in w && w.descriptionIn.length > 0) && !where.some((w) => "idIn" in w)) {
+    return "nodes INDEXED BY nodes_live_description";
+  }
+  return "nodes";
+}
+function compileNodeSelect(q) {
+  const { where, params } = compileNodeWhere(q);
+  const attrs = q.attrs ?? [];
+  const attrCols = attrs.map((k, i) => `, ${attrValueSql(path(k), attrDocSql(k))} AS a${i}, json_type(${attrDocSql(k)}, ${path(k)}) AS t${i}`).join("");
+  let order;
+  if (q.orderBy && "column" in q.orderBy) {
+    order = `${column(q.orderBy.column)} ${q.orderBy.desc ? "DESC" : "ASC"}, rowid`;
+  } else if (q.orderBy) {
+    const p = path(q.orderBy.attr);
+    order = `json_extract(attrs_json, ${p}) IS NULL, json_extract(attrs_json, ${p}) ${q.orderBy.desc ? "DESC" : "ASC"}, rowid`;
+  } else if (q.labels.length > 1) {
+    order = `CASE label ${q.labels.map((_, i) => `WHEN ? THEN ${i}`).join(" ")} END, rowid`;
+  } else {
+    order = "rowid";
+  }
+  const orderParams = !q.orderBy && q.labels.length > 1 ? [...q.labels] : [];
+  const limit = q.limit !== void 0 ? ` LIMIT ${Math.max(0, Math.floor(q.limit))}` : "";
+  const sql = `SELECT id, label, description, created_at, last_updated_at, page_rank, cumulative_hits, extraction_confidence, extraction_source, community, created_at_seq, last_reinforced_at_seq, valid_to, logical_id, version, ${EMBEDDING_DIM_SQL} AS embedding_dim${q.withEmbedding ? ", embedding_blob, embedding_json" : ""}${attrCols} FROM ${nodeSelectFrom(q)} WHERE ${where} ORDER BY ${order}${limit}`;
+  return { sql, params: [...params, ...orderParams] };
+}
+function decodeAttr(value, type) {
+  switch (type) {
+    case null:
+    case void 0:
+      return void 0;
+    case "true":
+      return true;
+    case "false":
+      return false;
+    case "null":
+      return null;
+    case "object":
+    case "array":
+      return typeof value === "string" ? JSON.parse(value) : value;
+    default:
+      return value;
+  }
+}
+function decodeSelectedRow(r, attrs, decodeVector) {
+  const out = {};
+  attrs.forEach((k, i) => {
+    const v = decodeAttr(r[`a${i}`], r[`t${i}`]);
+    if (v !== void 0) out[k] = v;
+  });
+  return {
+    id: r["id"],
+    label: r["label"],
+    description: r["description"] ?? "",
+    createdAt: r["created_at"],
+    lastUpdatedAt: r["last_updated_at"],
+    pageRank: r["page_rank"],
+    cumulativeHits: r["cumulative_hits"],
+    extractionConfidence: r["extraction_confidence"],
+    extractionSource: r["extraction_source"],
+    community: r["community"] ?? null,
+    ...r["created_at_seq"] != null ? { createdAtSeq: r["created_at_seq"] } : {},
+    ...r["last_reinforced_at_seq"] != null ? { lastReinforcedAtSeq: r["last_reinforced_at_seq"] } : {},
+    validTo: r["valid_to"] ?? null,
+    logicalId: r["logical_id"] ?? r["id"],
+    version: Number(r["version"] ?? 1),
+    embeddingDim: Number(r["embedding_dim"] ?? 0),
+    ...decodeVector ? { embedding: decodeVector(r["embedding_blob"], r["embedding_json"] ?? "[]") } : {},
+    attrs: out
+  };
+}
+
 // ../../packages/local-graph/src/store.ts
 var PAGE_RANK_SCALE_KEY = "pageRankScale.p95.v1";
 var TEXT_SEARCH_COLUMNS = `id, label, description, page_rank,
@@ -15157,6 +16229,7 @@ function localEdgeViolation(fromLabel, type, toLabel) {
 }
 var SCHEMA_VERSION = 6;
 var SESSION_REPAIR_KEY = "session-evidence-v1";
+var EXPOSURE_SIDE_KEY = "exposure-side-rows-1";
 var SESSION_EVIDENCE_PREDICATE = SESSION_EVIDENCE_FIELDS.map((field) => `instr(attrs_json, '${JSON.stringify(field)}') > 0`).join(" OR ");
 var SCHEMA_SQL = `
 CREATE TABLE IF NOT EXISTS schema_version (
@@ -15220,8 +16293,13 @@ CREATE TABLE IF NOT EXISTS nodes (
 );
 
 CREATE INDEX IF NOT EXISTS nodes_label ON nodes(label);
-CREATE INDEX IF NOT EXISTS nodes_memory_tier ON nodes(memory_tier);
-CREATE INDEX IF NOT EXISTS nodes_page_rank ON nodes(page_rank DESC);
+-- Dropped: no query plans through them (every prepared statement across the
+-- local-graph, indexer, context-writer, generalizer and daemon suites was
+-- planned with and without them, 2026-10-21), and each write that touches
+-- memory_tier / page_rank (every node upsert, every rescore) paid to maintain
+-- them. nodes_live_page_rank serves the live page-rank orderings.
+DROP INDEX IF EXISTS nodes_memory_tier;
+DROP INDEX IF EXISTS nodes_page_rank;
 
 CREATE TABLE IF NOT EXISTS edges (
   id TEXT PRIMARY KEY,
@@ -15243,7 +16321,10 @@ CREATE TABLE IF NOT EXISTS edges (
   FOREIGN KEY (to_id) REFERENCES nodes(id) ON DELETE CASCADE
 );
 
-CREATE INDEX IF NOT EXISTS edges_from ON edges(from_id, type);
+-- Dropped: a prefix of edges_triple (from_id, type, to_id), which every
+-- from-side lookup and foreign-key check already plans through; it cost 47 MB
+-- and an index write on every edge write.
+DROP INDEX IF EXISTS edges_from;
 CREATE INDEX IF NOT EXISTS edges_to ON edges(to_id, type);
 CREATE INDEX IF NOT EXISTS edges_type ON edges(type);
 CREATE UNIQUE INDEX IF NOT EXISTS edges_triple ON edges(from_id, type, to_id);
@@ -15251,8 +16332,41 @@ CREATE UNIQUE INDEX IF NOT EXISTS edges_triple ON edges(from_id, type, to_id);
 var TEMPORAL_INDEX_SQL = `
 CREATE INDEX IF NOT EXISTS nodes_live ON nodes(label, valid_to);
 CREATE INDEX IF NOT EXISTS nodes_live_count ON nodes(valid_to);
-CREATE INDEX IF NOT EXISTS nodes_live_recent ON nodes(label, last_updated_at DESC) WHERE valid_to IS NULL;
+-- Problems by recency (the only label read newest-first). Over every live row,
+-- each write that stamps last_updated_at moved a code symbol's entry from a
+-- scattered leaf: ~19 KB per position-only symbol rewrite on a 1.1 GB store.
+-- label stays the leading column so label = 'Problem' plans without a sort.
+DROP INDEX IF EXISTS nodes_live_recent;
+CREATE INDEX IF NOT EXISTS nodes_live_problem_recent ON nodes(label, last_updated_at DESC) WHERE valid_to IS NULL AND label = 'Problem';
+-- "Anything created since the watermark?" guards (the fold, regression and
+-- canonical-bind sweeps run one per session boundary). Without it the planner
+-- walks nodes_live and reads every live row of the label to test created_at:
+-- 56 MB per guard on a 1.1 GB store, to learn there was nothing to do. valid_to
+-- is a key column so the planner prefers this over nodes_live (one more term).
+CREATE INDEX IF NOT EXISTS nodes_live_created ON nodes(label, valid_to, created_at) WHERE valid_to IS NULL;
+-- Community members (the skills pull reads them twice per session boundary):
+-- ~15% of semantic nodes carry a localCommunity, and without this every live
+-- semantic row was read to find them (168 MB \u2192 18 MB per read).
+CREATE INDEX IF NOT EXISTS nodes_live_local_community ON nodes(label, valid_to, json_extract(attrs_json, '$.localCommunity')) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.localCommunity') IS NOT NULL;
+-- Problems parked for the fold judge (read every settle boundary): ~1 in 5 open
+-- Problems; without it every live Problem was read to find them (56 MB).
+CREATE INDEX IF NOT EXISTS nodes_live_fold_candidate ON nodes(label, valid_to) WHERE valid_to IS NULL AND json_type(attrs_json, '$.foldCandidate') IS NOT NULL;
+-- Render impressions, one row per node id (exposure-attrs.ts): a render bumps
+-- ~40 of these, which in the node row rewrote each whole row and its indexes.
+CREATE TABLE IF NOT EXISTS node_exposure (
+  id TEXT PRIMARY KEY,
+  attrs_json TEXT NOT NULL DEFAULT '{}'
+) WITHOUT ROWID;
+-- The semantic-maintenance sweeps' own filters (closed, asked, hinted): each read
+-- every Problem row (~30 MB on a 1.1 GB store) for the few hundred that match,
+-- several times a run, and a run follows most writes (2026-10-20).
+CREATE INDEX IF NOT EXISTS nodes_live_resolved ON nodes(label, valid_to) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.resolvedAt') IS NOT NULL;
+CREATE INDEX IF NOT EXISTS nodes_live_fix_candidate ON nodes(label, valid_to) WHERE valid_to IS NULL AND json_type(attrs_json, '$.fixCandidateAt') IS NOT NULL;
+CREATE INDEX IF NOT EXISTS nodes_live_anchor_hint ON nodes(label, valid_to) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.anchorHint') IS NOT NULL;
 CREATE INDEX IF NOT EXISTS nodes_session_evidence ON nodes(id) WHERE ${SESSION_EVIDENCE_PREDICATE};
+-- Rows carrying a calibration counter, any version: the logical nodes wm
+-- calibration can count (~3k), found without reading every citable row.
+CREATE INDEX IF NOT EXISTS nodes_wm_counted ON nodes(logical_id, version, valid_to, label, ${WM_CALIBRATION_KEYS.map(wmCounterSql).join(", ")}) WHERE ${WM_COUNTED_PREDICATE};
 CREATE INDEX IF NOT EXISTS edges_session_evidence ON edges(id) WHERE ${SESSION_EVIDENCE_PREDICATE};
 -- Covering + partial index for labelFingerprint over the instance labels: the
 -- live-push probe runs it per workspace on a timer, and each hit used to read
@@ -15266,31 +16380,70 @@ CREATE INDEX IF NOT EXISTS nodes_instance_fingerprint_v2 ON nodes(label, last_up
 CREATE INDEX IF NOT EXISTS nodes_live_page_rank ON nodes(valid_to, page_rank);
 CREATE INDEX IF NOT EXISTS nodes_logical ON nodes(logical_id, version);
 CREATE INDEX IF NOT EXISTS edges_live ON edges(valid_to);
+-- Newest live edges first, so a "recent N matching edges" read stops early instead
+-- of matching and sorting every live edge (the hourly liveness check: 163 MB \u2192
+-- 69 MB). Named by recentEdgeAttrCoverage; the planner keeps edges_live otherwise.
+CREATE INDEX IF NOT EXISTS edges_live_created ON edges(created_at) WHERE valid_to IS NULL;
+-- Live prior-tag edges by recency: the liveness corroboration check reads the
+-- newest 100 of ~300, and walking all live edges newest-first to find them read
+-- 69 MB. Its predicate is the one recentEdgeAttrCoverage uses for that marker.
+CREATE INDEX IF NOT EXISTS edges_live_prior_tag ON edges(created_at) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.priorTag') = 1;
 -- Expression index on the per-node relPath (stored in attrs_json) so the
 -- incremental reindex can fetch just the changed files' symbols instead of
 -- scanning every versioned node. Partial: only live rows are ever queried.
 CREATE INDEX IF NOT EXISTS nodes_relpath ON nodes(json_extract(attrs_json, '$.relPath')) WHERE valid_to IS NULL;
+-- Symbols by qname and doc comments by the symbol they attach to: the drain's
+-- symbol lexicon resolves the names in the text it ships one at a time, instead
+-- of reading every Function/Method/Class/Interface/Const and Comment row on each
+-- live push (~300 MB of a 1.1 GB store per push, 2026-10-20).
+CREATE INDEX IF NOT EXISTS nodes_live_qname ON nodes(json_extract(attrs_json, '$.qname')) WHERE valid_to IS NULL;
+CREATE INDEX IF NOT EXISTS nodes_live_attached_to ON nodes(json_extract(attrs_json, '$.attachedTo')) WHERE valid_to IS NULL AND label = 'Comment';
+-- The attrs the cloud drain gates every instance row on, so it reads them from
+-- the index alone: pulled cloud rows are most of these labels (7,105 of 7,708
+-- Solutions on the live store) at ~10 KB of attrs each, and five full scans for
+-- two attrs read ~220 MB per push to find the few local rows that can ship.
+-- created_at leads so the index order is findNodeFieldsByLabel's.
+CREATE INDEX IF NOT EXISTS nodes_live_instance_gate ON nodes(label, created_at, json_extract(attrs_json, '$.source'), json_extract(attrs_json, '$.privateFinding'), json_extract(attrs_json, '$.resolvedAs'), id) WHERE valid_to IS NULL AND label IN ('Problem', 'Vulnerability', 'Solution', 'RootCause');
+-- Closed rows by relPath, for reviveReobserved (every incremental reindex): the
+-- live-only index above cannot serve it, so it scanned the whole table (~275 MB
+-- of a 1.1 GB store per reindex, 2026-10-20).
+CREATE INDEX IF NOT EXISTS nodes_closed_relpath ON nodes(json_extract(attrs_json, '$.relPath'), last_updated_at) WHERE valid_to IS NOT NULL;
 -- Live rows by name, for looking up the few symbols a statement mentions
 -- instead of hydrating every code symbol per minted problem.
 CREATE INDEX IF NOT EXISTS nodes_live_description ON nodes(description, label) WHERE valid_to IS NULL;
+-- The six single-attr lookups below are partial on the attr being present: each
+-- is read only by equality (or IN), which implies it. Keyed on NULL for the ~95%
+-- of rows that lack the attr, every write to such a row's attrs rewrote its NULL
+-- entry: ~25 KB per position-only symbol rewrite on a 1.1 GB store (2026-10-21).
+DROP INDEX IF EXISTS nodes_anchor_hint_path;
+DROP INDEX IF EXISTS nodes_command_signature;
+DROP INDEX IF EXISTS nodes_diag_command;
+DROP INDEX IF EXISTS nodes_lsp_rel_path;
+DROP INDEX IF EXISTS nodes_cloud_node_id;
+DROP INDEX IF EXISTS nodes_enrichment_pending;
 -- Problems by the file their anchor hint names: the harvest upgrades hints for
 -- every edited file of every turn, and a scan parses every Problem's attrs.
-CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path ON nodes(json_extract(attrs_json, '$.anchorHint.path')) WHERE valid_to IS NULL;
+CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path_v2 ON nodes(json_extract(attrs_json, '$.anchorHint.path')) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.anchorHint.path') IS NOT NULL;
 -- Problems by the command / checker / file that opened them. The generalizer
 -- looked these up per shell or tool EVENT by hydrating every Problem: ~12s of
 -- every minute of daemon main-thread time on a 3.4k-Problem store (2026-10-05).
-CREATE INDEX IF NOT EXISTS nodes_command_signature ON nodes(json_extract(attrs_json, '$.commandSignature')) WHERE valid_to IS NULL;
-CREATE INDEX IF NOT EXISTS nodes_diag_command ON nodes(json_extract(attrs_json, '$.diagCommand')) WHERE valid_to IS NULL;
-CREATE INDEX IF NOT EXISTS nodes_lsp_rel_path ON nodes(json_extract(attrs_json, '$.lspRelPath')) WHERE valid_to IS NULL;
+CREATE INDEX IF NOT EXISTS nodes_command_signature_v2 ON nodes(json_extract(attrs_json, '$.commandSignature')) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.commandSignature') IS NOT NULL;
+CREATE INDEX IF NOT EXISTS nodes_diag_command_v2 ON nodes(json_extract(attrs_json, '$.diagCommand')) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.diagCommand') IS NOT NULL;
+CREATE INDEX IF NOT EXISTS nodes_lsp_rel_path_v2 ON nodes(json_extract(attrs_json, '$.lspRelPath')) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.lspRelPath') IS NOT NULL;
 -- Local nodes by the cloud twin their upload receipt recorded. Every burst /
 -- search fusion folds the Network copy of the caller's own knowledge back onto
 -- the local node; unindexed, the reverse lookup was a ~300ms attrs scan per call.
-CREATE INDEX IF NOT EXISTS nodes_cloud_node_id ON nodes(json_extract(attrs_json, '$.cloudNodeId')) WHERE valid_to IS NULL;
+CREATE INDEX IF NOT EXISTS nodes_cloud_node_id_v2 ON nodes(json_extract(attrs_json, '$.cloudNodeId')) WHERE valid_to IS NULL AND json_extract(attrs_json, '$.cloudNodeId') IS NOT NULL;
 -- Nodes still waiting on a root-cause ask. The MCP server checks this on EVERY
 -- tool response (the enrichment piggyback), so it must not parse every
--- Solution's and Problem's attrs per call. Not partial: the Problem pull reads
+-- Solution's and Problem's attrs per call. Any version: the Problem pull reads
 -- closed versions too.
-CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_json, '$.enrichmentPending'));
+CREATE INDEX IF NOT EXISTS nodes_enrichment_pending_v2 ON nodes(json_extract(attrs_json, '$.enrichmentPending')) WHERE json_extract(attrs_json, '$.enrichmentPending') IS NOT NULL;
+-- Revisit flags, any label, any version: listNeedsRevisit's as-of read runs on
+-- every context render and otherwise json-checks every row (10.3 s on a 324k-row
+-- store, to return zero flags). The predicate must stay textually identical to
+-- nodesAsOfWhereTrue's or the planner will not use it.
+CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_type(attrs_json, '$.revisit') = 'true';
 `;
 function encodeEmbedding(emb) {
   if (!emb || emb.length === 0) return null;
@@ -15351,12 +16504,39 @@ function rowToEdge(r) {
 }
 var FINGERPRINT_INDEXED_LABELS = ["Problem", "Vulnerability", "Solution", "RootCause"];
 var NODE_LABELS_CHUNK = 256;
+var NODE_UPSERT_COLUMNS = [
+  "label",
+  "description",
+  "extraction_confidence",
+  "embedding_json",
+  "embedding_blob",
+  "cumulative_surprise",
+  "peak_surprise",
+  "cumulative_hits",
+  "last_updated_at",
+  "memory_tier",
+  "page_rank",
+  "is_landmark",
+  "community",
+  "stability",
+  "last_reinforced_at_seq",
+  "attrs_json"
+];
+var EDGE_UPSERT_COLUMNS = ["confidence", "last_seen_at", "nav_successes", "nav_failures", "valid_to", "attrs_json"];
+function sameSqlValue(a, b) {
+  if (a === b || a == null && b == null) return true;
+  if (a instanceof Uint8Array && b instanceof Uint8Array) return Buffer.compare(a, b) === 0;
+  return false;
+}
+var PRIOR_TAG_MARKER = '"priorTag":true';
 var SqliteGraphStore = class {
   db;
   // Typed edge lookups build their SQL from the number of types asked for, and
   // used to prepare it on every call: ~600ms of a 2.5s drain build on a live
   // 225k-node store was statement compilation alone. Keyed by the SQL text.
   typedEdgeStmts = /* @__PURE__ */ new Map();
+  /** Narrow merge updates, keyed by table and the columns they set. */
+  changedColumnStmts = /* @__PURE__ */ new Map();
   stmts;
   /** Unified graph-mutation counter (see GraphStore.mutationCount). Bumped on
    *  every node/edge upsert — code-index and capture alike — so the consolidation
@@ -15375,6 +16555,8 @@ var SqliteGraphStore = class {
   initialPageRankScale;
   constructor(opts) {
     this.db = openDatabase(opts.path);
+    this.db.exec("PRAGMA cache_size = -32768");
+    this.db.exec("PRAGMA mmap_size = 2147483648");
     this.db.exec(SCHEMA_SQL);
     const versionRow = this.db.prepare("SELECT version FROM schema_version LIMIT 1").get();
     if (!versionRow) {
@@ -15391,12 +16573,15 @@ var SqliteGraphStore = class {
     installEditPlaceholderRetirement(this.db);
     installCloudAttrCompaction(this.db);
     installHistoryAttrSlim(this.db);
+    installTextIndex(this.db);
     if (!this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(SESSION_REPAIR_KEY)) {
       this.db.transaction(() => {
         this.repairSessionAliases();
         this.db.prepare("INSERT OR REPLACE INTO store_meta (key, value) VALUES (?, 'done')").run(SESSION_REPAIR_KEY);
       });
     }
+    installLineageIntegrityRepair(this.db);
+    installChangeFeed(this.db);
     this.stmts = {
       insertNode: this.db.prepare(`
         INSERT INTO nodes (
@@ -15435,7 +16620,19 @@ var SqliteGraphStore = class {
           last_reinforced_at_seq = excluded.last_reinforced_at_seq,
           attrs_json = excluded.attrs_json
       `),
-      getNode: this.db.prepare("SELECT * FROM nodes WHERE id = ?"),
+      nodeUpsertTarget: this.db.prepare(`SELECT rowid AS rid, ${NODE_UPSERT_COLUMNS.join(", ")} FROM nodes WHERE id = ?`),
+      edgeUpsertTarget: this.db.prepare(`SELECT rowid AS rid, ${EDGE_UPSERT_COLUMNS.join(", ")} FROM edges WHERE from_id = ? AND type = ? AND to_id = ?`),
+      getNode: this.db.prepare("SELECT nodes.*, (SELECT x.attrs_json FROM node_exposure x WHERE x.id = nodes.id) AS exposure_json FROM nodes WHERE id = ?"),
+      exposureOf: this.db.prepare("SELECT attrs_json FROM node_exposure WHERE id = ?"),
+      writeExposure: this.db.prepare("INSERT INTO node_exposure(id, attrs_json) VALUES (?, ?) ON CONFLICT(id) DO UPDATE SET attrs_json = excluded.attrs_json"),
+      lastUpdatedOf: this.db.prepare("SELECT last_updated_at AS t, attrs_json FROM nodes WHERE id = ?"),
+      labelOf: this.db.prepare("SELECT label FROM nodes WHERE id = ?"),
+      nodeContent: this.db.prepare(
+        "SELECT label, description, extraction_confidence, extraction_source, stability, valid_to, attrs_json FROM nodes WHERE id = ?"
+      ),
+      edgeContent: this.db.prepare(
+        "SELECT confidence, valid_to, attrs_json FROM edges WHERE from_id = ? AND type = ? AND to_id = ?"
+      ),
       // Single-column fast paths for the nightly pass — writing 100k pageRank
       // values through the 18-column COALESCE updateNode took ~30s; these are ~10x
       // cheaper (one bound column, no COALESCE evaluation per row).
@@ -15592,6 +16789,7 @@ var SqliteGraphStore = class {
         "INSERT INTO store_meta (key, value) VALUES ('ingest_seq', :v) ON CONFLICT(key) DO UPDATE SET value = excluded.value"
       )
     };
+    this.moveExposureToSideRows();
     const seqRow = this.db.prepare("SELECT value FROM store_meta WHERE key = 'ingest_seq'").get();
     this.ingestSeq = seqRow ? Number(seqRow.value) : 0;
   }
@@ -15607,6 +16805,93 @@ var SqliteGraphStore = class {
         AND (t.id IS NULL OR t.valid_to IS NOT NULL)
     `).all();
   }
+  strandedSymbolsForFiles(fileIds) {
+    const out = [];
+    for (let i = 0; i < fileIds.length; i += 500) {
+      const slice = fileIds.slice(i, i + 500);
+      if (slice.length === 0) continue;
+      out.push(...this.db.prepare(`
+        SELECT f.id AS fileId, e.to_id AS symbolId
+        FROM nodes f CROSS JOIN edges e ON e.from_id = f.id
+        LEFT JOIN nodes t ON t.id = e.to_id
+        WHERE f.id IN (${slice.map(() => "?").join(",")}) AND f.label = 'File' AND f.valid_to IS NULL AND e.valid_to IS NULL
+          AND e.type IN ('DEFINES', 'CONTAINS')
+          AND (t.id IS NULL OR t.valid_to IS NOT NULL)
+      `).all(...slice));
+    }
+    return out;
+  }
+  firstLiveByNameOrQname(labels, name) {
+    if (labels.length === 0) return null;
+    const inLabels = labels.map(() => "?").join(",");
+    const probe = (index, match) => this.db.prepare(
+      `SELECT rowid AS rid, created_at AS at, label, description, json_extract(attrs_json, '$.qname') AS qname FROM nodes INDEXED BY ${index}
+          WHERE ${match} = ? AND label IN (${inLabels}) AND valid_to IS NULL`
+    ).all(name, ...labels);
+    const rank = (r) => [labels.indexOf(r.label), r.at, r.rid];
+    const before = (a, b) => a[0] < b[0] || a[0] === b[0] && (a[1] < b[1] || a[1] === b[1] && a[2] < b[2]);
+    let best;
+    for (const r of [...probe("nodes_live_description", "description"), ...probe("nodes_live_qname", "json_extract(attrs_json, '$.qname')")]) {
+      if (!best || before(rank(r), rank(best))) best = r;
+    }
+    return best ? { label: best.label, description: best.description, qname: typeof best.qname === "string" ? best.qname : null } : null;
+  }
+  instanceGateRows(label) {
+    return this.db.prepare(
+      `SELECT id, json_extract(attrs_json, '$.source') AS source, json_extract(attrs_json, '$.privateFinding') AS privateFinding,
+              json_extract(attrs_json, '$.resolvedAs') AS resolvedAs
+         FROM nodes INDEXED BY nodes_live_instance_gate
+        WHERE label IN ('Problem', 'Vulnerability', 'Solution', 'RootCause') AND label = ? AND valid_to IS NULL
+        ORDER BY label, created_at, rowid`
+    ).all(label);
+  }
+  wmCalibrationRows(labels) {
+    const counted = this.db.prepare(
+      `SELECT rowid AS rid, logical_id, version, valid_to, label, ${WM_CALIBRATION_KEYS.map((k, i) => `${wmCounterSql(k)} AS c${i}`).join(", ")}
+         FROM nodes INDEXED BY nodes_wm_counted WHERE ${WM_COUNTED_PREDICATE}`
+    ).all();
+    const exposed = this.db.prepare(
+      `SELECT n.rowid AS rid, n.logical_id, n.version, n.valid_to, n.label, x.attrs_json AS exposure
+         FROM node_exposure x JOIN nodes n ON n.id = x.id`
+    ).all();
+    const others = this.db.prepare(
+      `SELECT rowid AS rid, logical_id, version, valid_to, label FROM nodes WHERE rowid IN (
+         SELECT n.rowid FROM nodes AS n INDEXED BY nodes_logical
+          WHERE n.logical_id IN (SELECT logical_id FROM nodes INDEXED BY nodes_wm_counted WHERE ${WM_COUNTED_PREDICATE}
+                                 UNION SELECT n2.logical_id FROM node_exposure x2 JOIN nodes n2 ON n2.id = x2.id)
+         EXCEPT SELECT rowid FROM nodes INDEXED BY nodes_wm_counted WHERE ${WM_COUNTED_PREDICATE}
+         EXCEPT SELECT n3.rowid FROM node_exposure x3 JOIN nodes n3 ON n3.id = x3.id)`
+    ).all();
+    const byRid = /* @__PURE__ */ new Map();
+    for (const r of [...counted, ...others]) {
+      const attrs = {};
+      WM_CALIBRATION_KEYS.forEach((k, i) => {
+        const v = r[`c${i}`];
+        if (typeof v === "number") attrs[k] = v;
+      });
+      byRid.set(r.rid, { row: r, attrs });
+    }
+    for (const r of exposed) {
+      const side = JSON.parse(r.exposure);
+      const entry = byRid.get(r.rid) ?? { row: r, attrs: {} };
+      for (const k of WM_CALIBRATION_KEYS) if (typeof side[k] === "number" && Number.isFinite(side[k])) entry.attrs[k] = side[k];
+      byRid.set(r.rid, entry);
+    }
+    const order = new Map(labels.map((l, i) => [l, i]));
+    return [...byRid.values()].filter(({ row }) => order.has(row.label)).sort((a, b) => order.get(a.row.label) - order.get(b.row.label) || a.row.rid - b.row.rid).map(({ row, attrs }) => ({ logicalId: row.logical_id, version: Number(row.version), validTo: row.valid_to ?? null, attrs }));
+  }
+  liveCommentsAttachedTo(name) {
+    return this.db.prepare(
+      `SELECT json_extract(attrs_json, '$.kind') AS kind, json_extract(attrs_json, '$.text') AS text, description FROM nodes INDEXED BY nodes_live_attached_to
+        WHERE label = 'Comment' AND valid_to IS NULL AND json_extract(attrs_json, '$.attachedTo') = ? ORDER BY created_at, rowid`
+    ).all(name);
+  }
+  strandedEdges() {
+    return countStrandedEdges(this.db);
+  }
+  liveHeadConflicts() {
+    return countLiveHeadConflicts(this.db);
+  }
   fileIndexStates(ids) {
     if (ids.length === 0) return [];
     if (ids.length > 500) throw new RangeError("fileIndexStates accepts at most 500 ids per read");
@@ -15705,7 +16990,7 @@ var SqliteGraphStore = class {
   }
   mergeNode(node) {
     this.mutations++;
-    this.stmts.insertNode.run({
+    const values = {
       id: node.id,
       label: node.label,
       description: node.description,
@@ -15731,8 +17016,37 @@ var SqliteGraphStore = class {
       logical_id: node.logicalId ?? node.id,
       created_at_seq: node.createdAtSeq ?? null,
       last_reinforced_at_seq: node.lastReinforcedAtSeq ?? null,
-      attrs_json: JSON.stringify(node.attrs ?? {})
-    });
+      attrs_json: this.nodeAttrsJson(node.id, node.attrs ?? {})
+    };
+    const current = this.stmts.nodeUpsertTarget.get(node.id);
+    if (current) this.writeChangedColumns("nodes", NODE_UPSERT_COLUMNS, current, values);
+    else this.stmts.insertNode.run(values);
+  }
+  /** What the upsert's ON CONFLICT would write over `current`, setting only the
+   *  columns whose value moves (NODE_UPSERT_COLUMNS says why). */
+  writeChangedColumns(table, columns2, current, next) {
+    const changed = columns2.filter((c) => !sameSqlValue(current[c], next[c]));
+    if (changed.length === 0) return;
+    const key = `${table}:${changed.join(",")}`;
+    let stmt2 = this.changedColumnStmts.get(key);
+    if (!stmt2) {
+      stmt2 = this.db.prepare(`UPDATE ${table} SET ${changed.map((c) => `${c} = :${c}`).join(", ")} WHERE rowid = :rid`);
+      this.changedColumnStmts.set(key, stmt2);
+    }
+    stmt2.run({ rid: current["rid"], ...Object.fromEntries(changed.map((c) => [c, next[c]])) });
+  }
+  /** mergeNode, unless the live row already holds this content. Content is what
+   *  the columns a merge rewrites from the producer (label, description, attrs,
+   *  confidence, stability);
+   *  rank, community, landmark, surprise, hits, tier and the vector belong to
+   *  the passes that compute them, and a skipped write leaves them as they are
+   *  where a merge would have reset them to the producer's defaults. Returns
+   *  whether it wrote. */
+  mergeNodeIfChanged(node) {
+    const row = this.stmts.nodeContent.get(node.id);
+    if (row && row.valid_to === null && row.label === node.label && row.description === node.description && row.extraction_confidence === node.extractionConfidence && row.stability === node.stability && !EXPOSURE_ATTRS.some((k) => node.attrs?.[k] !== void 0) && row.attrs_json === JSON.stringify(node.attrs ?? {})) return false;
+    this.mergeNode(node);
+    return true;
   }
   updateNode(id, patch) {
     const hasEmbedding = patch.embedding !== void 0 && patch.embedding.length > 0;
@@ -15757,7 +17071,37 @@ var SqliteGraphStore = class {
       logical_id: patch.logicalId ?? null,
       created_at_seq: patch.createdAtSeq ?? null,
       last_reinforced_at_seq: patch.lastReinforcedAtSeq ?? null,
-      attrs_json: patch.attrs ? JSON.stringify(patch.attrs) : null
+      attrs_json: patch.attrs ? this.nodeAttrsJson(id, patch.attrs) : null
+    });
+  }
+  /**
+   * The node-row attrs of a write, after handing any exposure keys to the side
+   * row (exposure-attrs.ts). `getNode` returns exposure merged into attrs, so a
+   * read-modify-write carries it; kept in the row it would re-bloat the row and
+   * drift from the side row. Unchanged exposure costs no write.
+   */
+  nodeAttrsJson(id, attrs) {
+    if (!EXPOSURE_ATTRS.some((k) => attrs[k] !== void 0)) return JSON.stringify(attrs);
+    const current = this.stmts.exposureOf.get(id);
+    const next = JSON.stringify({ ...current ? JSON.parse(current.attrs_json) : {}, ...pickExposure(attrs) });
+    if (current?.attrs_json !== next) this.stmts.writeExposure.run(id, next);
+    const rest = { ...attrs };
+    for (const k of EXPOSURE_ATTRS) delete rest[k];
+    return JSON.stringify(rest);
+  }
+  /** One-time: exposure keys written to node rows before the side table existed
+   *  move to it. Only rows carrying a counter can carry exposure, and those are
+   *  what nodes_wm_counted holds, so this reads the index, not the table. */
+  moveExposureToSideRows() {
+    if (this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(EXPOSURE_SIDE_KEY)) return;
+    const rows = this.db.prepare(`SELECT id, attrs_json FROM nodes INDEXED BY nodes_wm_counted WHERE ${WM_COUNTED_PREDICATE}`).all();
+    const move = this.db.prepare("UPDATE nodes SET attrs_json = ? WHERE id = ?");
+    this.db.transaction(() => {
+      for (const r of rows) {
+        const stripped = this.nodeAttrsJson(r.id, JSON.parse(r.attrs_json));
+        if (stripped !== r.attrs_json) move.run(stripped, r.id);
+      }
+      this.db.prepare("INSERT OR REPLACE INTO store_meta(key, value) VALUES (?, 'done')").run(EXPOSURE_SIDE_KEY);
     });
   }
   /** Fast single-column writes for the nightly pass (avoid the 18-column COALESCE
@@ -15768,26 +17112,30 @@ var SqliteGraphStore = class {
   setLandmark(id, isLandmark) {
     this.stmts.setLandmark.run({ id, v: isLandmark ? 1 : 0 });
   }
-  setLocalCommunity(id, community, column) {
-    this.stmts.setLocalCommunity.run({ id, v: community, col: column ? 1 : 0 });
+  setLocalCommunity(id, community, column2) {
+    this.stmts.setLocalCommunity.run({ id, v: community, col: column2 ? 1 : 0 });
   }
   fieldStmts = /* @__PURE__ */ new Map();
   findNodeFieldsByLabel(label, attrKeys) {
     for (const k of attrKeys) if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(k)) throw new Error(`findNodeFieldsByLabel: bad attr key ${k}`);
     const cacheKey = attrKeys.join(",");
-    let stmt = this.fieldStmts.get(cacheKey);
-    if (!stmt) {
-      const cols = attrKeys.map((k, i) => `, json_extract(attrs_json, '$.${k}') AS a${i}`).join("");
-      stmt = this.db.prepare(
-        `SELECT id, description, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL`
+    let stmt2 = this.fieldStmts.get(cacheKey);
+    if (!stmt2) {
+      const cols = attrKeys.map((k, i) => `, ${attrValueSql(`'$.${k}'`)} AS a${i}, json_type(attrs_json, '$.${k}') AS t${i}`).join("");
+      stmt2 = this.db.prepare(
+        // Ordered, not left to the planner: readers take "first row wins" (the
+        // symbol lexicon's name winner and doc pick), and the order otherwise
+        // followed whichever partial index the planner chose. nodes_live_created
+        // serves this order without a sort.
+        `SELECT id, description, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL ORDER BY created_at, rowid`
       );
-      this.fieldStmts.set(cacheKey, stmt);
+      this.fieldStmts.set(cacheKey, stmt2);
     }
-    return stmt.all(label).map((r) => {
+    return stmt2.all(label).map((r) => {
       const attrs = {};
       attrKeys.forEach((k, i) => {
-        const v = r[`a${i}`];
-        if (v !== null && v !== void 0) attrs[k] = v;
+        const v = decodeAttr(r[`a${i}`], r[`t${i}`]);
+        if (v !== void 0) attrs[k] = v;
       });
       return {
         id: r["id"],
@@ -15798,6 +17146,15 @@ var SqliteGraphStore = class {
       };
     });
   }
+  selectNodes(q) {
+    const { sql, params } = compileNodeSelect(q);
+    const rows = this.db.prepare(sql).all(...params);
+    return rows.map((r) => decodeSelectedRow(r, q.attrs ?? [], q.withEmbedding ? decodeEmbedding : void 0));
+  }
+  countNodes(q) {
+    const { where, params } = compileNodeWhere(q);
+    return Number(this.db.prepare(`SELECT COUNT(*) AS n FROM ${nodeSelectFrom(q)} WHERE ${where}`).get(...params).n);
+  }
   setCommunity(id, community) {
     this.stmts.setCommunity.run({ id, v: community });
   }
@@ -15810,7 +17167,7 @@ var SqliteGraphStore = class {
       return;
     }
     this.mutations++;
-    this.stmts.insertEdge.run({
+    const values = {
       id: edge.id,
       from_id: edge.from,
       to_id: edge.to,
@@ -15824,8 +17181,33 @@ var SqliteGraphStore = class {
       valid_from: edge.validFrom ?? edge.createdAt,
       valid_to: edge.validTo ?? null,
       attrs_json: JSON.stringify(edge.attrs ?? {})
+    };
+    const current = this.stmts.edgeUpsertTarget.get(edge.from, edge.type, edge.to);
+    if (!current) {
+      this.stmts.insertEdge.run(values);
+      return;
+    }
+    this.writeChangedColumns("edges", EDGE_UPSERT_COLUMNS, current, {
+      ...values,
+      confidence: Math.max(current["confidence"], edge.confidence),
+      valid_to: null
     });
   }
+  /** mergeEdge, unless the live edge already holds this content: same attrs, and
+   *  a confidence the upsert's MAX would keep. Its navigation posteriors and
+   *  last-seen stamp stay as they are where a merge would have reset them. The
+   *  ontology gate runs first either way, so refusals are recorded as before.
+   *  Returns whether it wrote (or refused). */
+  mergeEdgeIfChanged(edge) {
+    if (!this.edgeRuleViolation(edge)) {
+      const row = this.stmts.edgeContent.get(edge.from, edge.type, edge.to);
+      if (row && row.valid_to === null && row.confidence >= edge.confidence && row.attrs_json === JSON.stringify(edge.attrs ?? {})) {
+        return false;
+      }
+    }
+    this.mergeEdge(edge);
+    return true;
+  }
   /** EDGE_RULES check against the stored endpoints' labels, with the LOCAL
    *  overlay consulted first. Returns the reason string on a documented-
    *  forbidden combination, else null. Point lookups on the id PK — negligible
@@ -15870,11 +17252,13 @@ var SqliteGraphStore = class {
     }
   }
   edgeRuleViolation(edge) {
-    return localEdgeViolation(
-      this.getNode(edge.from)?.label,
-      edge.type,
-      this.getNode(edge.to)?.label
-    );
+    return localEdgeViolation(this.labelOf(edge.from), edge.type, this.labelOf(edge.to));
+  }
+  /** An endpoint's label, any version, as `getNode(id)?.label` reads it. Every
+   *  edge write checks both endpoints, and hydrating them (attrs + vector) to
+   *  read one leading column was most of an incremental reindex's reads. */
+  labelOf(id) {
+    return this.stmts.labelOf.get(id)?.label;
   }
   updateEdge(id, patch) {
     this.stmts.updateEdge.run({
@@ -15890,18 +17274,38 @@ var SqliteGraphStore = class {
   }
   getNode(id) {
     const row = this.stmts.getNode.get(id);
-    return row ? rowToNode(row) : null;
+    if (!row) return null;
+    const node = rowToNode(row);
+    if (row.exposure_json) Object.assign(node.attrs, JSON.parse(row.exposure_json));
+    return node;
+  }
+  /** A node's render exposure: the side row's keys over the node row's own
+   *  (exposure-attrs.ts), plus the node's `lastUpdatedAt` (the "shown since
+   *  touch" counter is relative to it) — without reading the node's attrs. */
+  exposureOf(id) {
+    const row = this.stmts.lastUpdatedOf.get(id);
+    if (!row) return null;
+    const side = this.stmts.exposureOf.get(id);
+    return {
+      attrs: { ...pickExposure(JSON.parse(row.attrs_json)), ...side ? JSON.parse(side.attrs_json) : {} },
+      lastUpdatedAt: row.t
+    };
+  }
+  /** Replace a node's exposure (only EXPOSURE_ATTRS keys belong here). Touches
+   *  neither the node row nor its indexes, nor the change feed. */
+  writeExposure(id, attrs) {
+    this.stmts.writeExposure.run(id, JSON.stringify(attrs));
   }
   nodeLabels(ids) {
     const width = NODE_LABELS_CHUNK;
-    const stmt = this.typedEdgeStmt(
+    const stmt2 = this.typedEdgeStmt(
       `SELECT id, label FROM nodes WHERE id IN (${Array.from({ length: width }, () => "?").join(",")})`
     );
     const labels = /* @__PURE__ */ new Map();
     for (let i = 0; i < ids.length; i += width) {
       const chunk = ids.slice(i, i + width);
       while (chunk.length < width) chunk.push(null);
-      for (const row of stmt.all(...chunk)) labels.set(row.id, row.label);
+      for (const row of stmt2.all(...chunk)) labels.set(row.id, row.label);
     }
     return labels;
   }
@@ -15918,7 +17322,21 @@ var SqliteGraphStore = class {
    *  per project per request; the materializing form held the daemon's event
    *  loop for seconds at scale. */
   countNodesByLabel(label) {
-    return Number(this.stmts.countByLabel.get(label).n);
+    return this.countAt(`label:${label}`, [nodeScope(label)], () => Number(this.stmts.countByLabel.get(label).n));
+  }
+  /** Counts asked for on every status poll (/health, `errata status`, the
+   *  dashboards): a live-node COUNT(*) reads the whole liveness index, ~3 MB per
+   *  call on a 1.1 GB store, to recount a set that moves only on a write. Each is
+   *  kept with the change-feed reading of the rows it counts — triggers bump it on
+   *  every write from any connection, so a hit is exact, not a TTL guess. */
+  counts = /* @__PURE__ */ new Map();
+  countAt(key, scopes, count) {
+    const seq = readChangeSeq(this.db, scopes);
+    const hit = this.counts.get(key);
+    if (hit && hit.seq === seq) return hit.n;
+    const n = count();
+    this.counts.set(key, { seq, n });
+    return n;
   }
   /** Live rows for a label with attrs and creation stamps only — for scans that
    *  read attrs and never the vector. `findNodesByLabel` decodes every embedding
@@ -15927,16 +17345,39 @@ var SqliteGraphStore = class {
   findNodeStampsByLabel(label, attrKey) {
     if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(attrKey)) throw new Error(`findNodeStampsByLabel: bad attr key ${attrKey}`);
     const rows = this.db.prepare(
-      `SELECT id, created_at, created_at_seq, json_type(attrs_json, '$.${attrKey}') IS NOT NULL AS has
+      `SELECT id, created_at, created_at_seq, json_type(${attrDocSql(attrKey)}, '$.${attrKey}') IS NOT NULL AS has,
+                COALESCE(json_extract(attrs_json, '$.source') = 'cloud', 0) AS cloud
            FROM nodes WHERE label = ? AND valid_to IS NULL`
     ).all(label);
     return rows.map((r) => ({
       id: r.id,
       createdAt: r.created_at,
       ...r.created_at_seq != null ? { createdAtSeq: r.created_at_seq } : {},
-      has: r.has === 1
+      has: r.has === 1,
+      cloud: r.cloud === 1
     }));
   }
+  findNodeStampsByLabelAttrs(label, attrKeys) {
+    for (const k of attrKeys) if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(k)) throw new Error(`findNodeStampsByLabelAttrs: bad attr key ${k}`);
+    const keys = [...new Set(attrKeys)];
+    const rows = this.db.prepare(
+      `SELECT id, created_at, created_at_seq,
+                ${keys.map((k, i) => `json_type(${attrDocSql(k)}, '$.${k}') IS NOT NULL AS h${i}`).join(", ")}${keys.length ? "," : ""}
+                COALESCE(json_extract(attrs_json, '$.source') = 'cloud', 0) AS cloud
+           FROM nodes WHERE label = ? AND valid_to IS NULL`
+    ).all(label);
+    const out = new Map(keys.map((k) => [k, []]));
+    for (const r of rows) {
+      keys.forEach((k, i) => out.get(k).push({
+        id: r.id,
+        createdAt: r.created_at,
+        ...r.created_at_seq != null ? { createdAtSeq: r.created_at_seq } : {},
+        has: r[`h${i}`] === 1,
+        cloud: r.cloud === 1
+      }));
+    }
+    return out;
+  }
   findNodeAttrsByLabel(label) {
     const rows = this.stmts.attrsByLabel.all(label);
     return rows.map((r) => ({
@@ -15964,8 +17405,8 @@ var SqliteGraphStore = class {
       after = rows[rows.length - 1].rid;
     }
   }
-  recentNodeIds(label, limit) {
-    const rows = this.db.prepare("SELECT id FROM nodes WHERE label = ? AND valid_to IS NULL ORDER BY last_updated_at DESC LIMIT ?").all(label, Math.max(0, limit));
+  recentProblemIds(limit) {
+    const rows = this.db.prepare("SELECT id FROM nodes WHERE label = 'Problem' AND valid_to IS NULL ORDER BY last_updated_at DESC LIMIT ?").all(Math.max(0, limit));
     return rows.map((r) => r.id);
   }
   recentOpenProblemCandidates(opts) {
@@ -16045,6 +17486,20 @@ var SqliteGraphStore = class {
   }
   searchTextCandidates(terms) {
     if (terms.length === 0) return [];
+    const indexed = terms.filter((t) => t.length >= TEXT_INDEX_MIN_TERM);
+    if (indexed.length > 0 && textIndexReady(this.db)) {
+      const short = terms.filter((t) => t.length < TEXT_INDEX_MIN_TERM).map((t) => t.toLowerCase());
+      const rows2 = this.db.prepare(`WITH hits AS MATERIALIZED (
+        SELECT t.rowid AS rid, COUNT(*) AS matched FROM json_each(:terms) q, nodes_text t
+        WHERE t.description LIKE '%' || q.value || '%' GROUP BY t.rowid
+      ) SELECT ${TEXT_SEARCH_COLUMNS}, hits.matched FROM hits JOIN nodes ON nodes.rowid = hits.rid
+        WHERE nodes.valid_to IS NULL ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(indexed) });
+      return rows2.map((row) => {
+        const text = row.description.toLowerCase();
+        const extra = short.filter((t) => text.includes(t)).length;
+        return { node: textSearchNode(row), matched: row.matched + extra };
+      });
+    }
     const rows = this.db.prepare(`WITH matches AS MATERIALIZED (
       SELECT n.id, COUNT(*) AS matched FROM nodes n INDEXED BY nodes_live_description, json_each(:terms) t
       WHERE n.valid_to IS NULL AND n.description LIKE '%' || t.value || '%'
@@ -16053,6 +17508,18 @@ var SqliteGraphStore = class {
       JOIN matches USING (id) ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(terms) });
     return rows.map((row) => ({ node: textSearchNode(row), matched: row.matched }));
   }
+  commentAnchors(commentIds) {
+    const out = /* @__PURE__ */ new Map();
+    if (commentIds.length === 0) return out;
+    const rows = this.db.prepare(`WITH a AS MATERIALIZED (
+      SELECT q.value AS cid, COALESCE(
+        (SELECT to_id FROM edges WHERE from_id = q.value AND type IN ('EXPLAINS', 'ANNOTATES') AND valid_to IS NULL LIMIT 1),
+        (SELECT from_id FROM edges WHERE to_id = q.value AND type = 'DOCUMENTED_BY' AND valid_to IS NULL LIMIT 1)
+      ) AS aid FROM json_each(:ids) q
+    ) SELECT a.cid AS cid, ${TEXT_SEARCH_COLUMNS} FROM a JOIN nodes ON nodes.id = a.aid AND nodes.valid_to IS NULL`).all({ ids: JSON.stringify(commentIds) });
+    for (const row of rows) out.set(row.cid, textSearchNode(row));
+    return out;
+  }
   getTextSearchNode(id) {
     const row = this.db.prepare(`SELECT ${TEXT_SEARCH_COLUMNS} FROM nodes WHERE id = ? AND valid_to IS NULL`).get(id);
     return row ? textSearchNode(row) : null;
@@ -16072,12 +17539,12 @@ var SqliteGraphStore = class {
     return scale;
   }
   typedEdgeStmt(sql) {
-    let stmt = this.typedEdgeStmts.get(sql);
-    if (!stmt) {
-      stmt = this.db.prepare(sql);
-      this.typedEdgeStmts.set(sql, stmt);
+    let stmt2 = this.typedEdgeStmts.get(sql);
+    if (!stmt2) {
+      stmt2 = this.db.prepare(sql);
+      this.typedEdgeStmts.set(sql, stmt2);
     }
-    return stmt;
+    return stmt2;
   }
   outEdges(nodeId, types) {
     if (!types || types.length === 0) {
@@ -16136,21 +17603,54 @@ var SqliteGraphStore = class {
     return out;
   }
   nodeCount() {
-    return Number(this.stmts.nodeCount.get().n);
+    return this.countAt("nodes", [ANY_CHANGE], () => Number(this.stmts.nodeCount.get().n));
   }
   mutationCount() {
     return this.mutations;
   }
+  changeStamp() {
+    const { data_version } = this.db.pragma("data_version");
+    const { n } = this.db.prepare("SELECT total_changes() AS n").get();
+    return `${data_version}:${n}`;
+  }
+  changeSeq(scopes) {
+    return readChangeSeq(this.db, scopes);
+  }
+  lineageChangedFiles(sinceSeq) {
+    return readLineageChangedFiles(this.db, sinceSeq);
+  }
+  changedNodeIds(sinceSeq, labels) {
+    return readChangedNodeIds(this.db, sinceSeq, labels);
+  }
+  changedAmong(sinceSeq, ids) {
+    return readChangedAmong(this.db, sinceSeq, ids);
+  }
+  pruneChangeLog() {
+    return pruneChangeLog(this.db);
+  }
+  fileRowStates(ids) {
+    if (ids.length === 0) return [];
+    if (ids.length > 500) throw new RangeError("fileRowStates accepts at most 500 ids per read");
+    return this.db.prepare(`SELECT id, last_updated_at AS lastUpdatedAt, valid_to AS validTo FROM nodes WHERE id IN (${ids.map(() => "?").join(",")})`).all(...ids);
+  }
+  // Read and advanced in SQL, never from a per-connection copy: pass workers and
+  // MCP processes open their own connections and advance the same row, so a
+  // copy loaded at open went stale, and `copy + 1` wrote a duplicate or a
+  // backwards seq from whichever connection had fallen behind.
   currentIngestSeq() {
+    const row = this.db.prepare("SELECT value FROM store_meta WHERE key = 'ingest_seq'").get();
+    this.ingestSeq = row ? Number(row.value) : 0;
     return this.ingestSeq;
   }
   nextIngestSeq() {
-    this.ingestSeq += 1;
-    this.stmts.setIngestSeq.run({ v: String(this.ingestSeq) });
+    const row = this.db.prepare(
+      "INSERT INTO store_meta (key, value) VALUES ('ingest_seq', '1') ON CONFLICT(key) DO UPDATE SET value = CAST(value AS INTEGER) + 1 RETURNING value"
+    ).get();
+    this.ingestSeq = Number(row.value);
     return this.ingestSeq;
   }
   edgeCount() {
-    return Number(this.stmts.edgeCount.get().n);
+    return this.countAt("edges", [ANY_CHANGE], () => Number(this.stmts.edgeCount.get().n));
   }
   // Lightweight whole-graph scans — select only the columns the caller needs so a
   // 100k-node pass skips the per-row attrs JSON.parse + embedding decode rowToNode
@@ -16278,28 +17778,63 @@ var SqliteGraphStore = class {
     }
   }
   reviveReobserved(relPaths, workspaceId, since) {
-    let revived = 0;
+    const revived = [];
     const CHUNK = 400;
     for (let i = 0; i < relPaths.length; i += CHUNK) {
       const slice = relPaths.slice(i, i + CHUNK);
       if (slice.length === 0) continue;
-      const r = this.db.prepare(
-        `UPDATE nodes SET valid_to = NULL
+      const rows = this.db.prepare(
+        `SELECT id, valid_to AS closedAt, COALESCE(logical_id, id) AS lid FROM nodes
              WHERE valid_to IS NOT NULL
                AND last_updated_at >= ?
                AND json_extract(attrs_json, '$.workspaceId') = ?
-               AND json_extract(attrs_json, '$.relPath') IN (${slice.map(() => "?").join(",")})`
-      ).run(since, workspaceId, ...slice);
-      revived += Number(r.changes);
-    }
-    if (revived > 0) this.mutations++;
-    return revived;
+               AND json_extract(attrs_json, '$.relPath') IN (${slice.map(() => "?").join(",")})
+               AND json_type(attrs_json, '$.historical') IS NOT 'true'`
+      ).all(since, workspaceId, ...slice);
+      revived.push(...rows);
+    }
+    if (revived.length === 0) return 0;
+    const reopen = this.db.prepare("UPDATE nodes SET valid_to = NULL WHERE id = ? AND valid_to IS NOT NULL");
+    for (const r of revived) reopen.run(r.id);
+    for (const r of revived) reopenCascadeClosedEdges(this.db, r.id, Number(r.closedAt));
+    collapseLiveHeads(this.db, revived.map((r) => r.lid), since);
+    this.mutations++;
+    return revived.length;
+  }
+  incomingEdgeCoverage(label, edgeTypes, cloudOnly) {
+    if (edgeTypes.length === 0) return { count: 0, total: 0 };
+    const r = this.db.prepare(
+      `SELECT COUNT(*) AS total,
+                COALESCE(SUM(CASE WHEN EXISTS (
+                  SELECT 1 FROM edges e WHERE e.to_id = n.id AND e.valid_to IS NULL
+                    AND e.type IN (${edgeTypes.map(() => "?").join(",")})
+                ) THEN 1 ELSE 0 END), 0) AS count
+           FROM nodes n
+          WHERE n.label = ? AND n.valid_to IS NULL
+            AND (? = 0 OR json_extract(n.attrs_json, '$.source') = 'cloud')`
+    ).get(...edgeTypes, label, cloudOnly ? 1 : 0);
+    return { count: Number(r.count), total: Number(r.total) };
+  }
+  liveEdgeTargets(edgeTypes) {
+    if (edgeTypes.length === 0) return [];
+    const rows = this.db.prepare(`SELECT DISTINCT to_id FROM edges INDEXED BY edges_type WHERE type IN (${edgeTypes.map(() => "?").join(",")}) AND valid_to IS NULL`).all(...edgeTypes);
+    return rows.map((r) => r.to_id);
   }
   recentEdgeAttrCoverage(marker, attr, limit) {
+    if (marker === PRIOR_TAG_MARKER) {
+      const r2 = this.db.prepare(
+        `SELECT COUNT(*) AS total,
+                  COALESCE(SUM(CASE WHEN json_extract(attrs_json, '$.' || ?) = 1 THEN 1 ELSE 0 END), 0) AS count
+             FROM (SELECT attrs_json FROM edges INDEXED BY edges_live_prior_tag
+                    WHERE valid_to IS NULL AND json_extract(attrs_json, '$.priorTag') = 1
+                    ORDER BY created_at DESC LIMIT ?)`
+      ).get(attr, limit);
+      return { count: Number(r2.count), total: Number(r2.total) };
+    }
     const r = this.db.prepare(
       `SELECT COUNT(*) AS total,
                 COALESCE(SUM(CASE WHEN json_extract(attrs_json, '$.' || ?) = 1 THEN 1 ELSE 0 END), 0) AS count
-           FROM (SELECT attrs_json FROM edges
+           FROM (SELECT attrs_json FROM edges INDEXED BY edges_live_created
                   WHERE valid_to IS NULL AND attrs_json LIKE ?
                   ORDER BY created_at DESC LIMIT ?)`
     ).get(attr, `%${marker}%`, limit);
@@ -16312,7 +17847,7 @@ var SqliteGraphStore = class {
       const slice = cloudIds.slice(i, i + CHUNK);
       if (slice.length === 0) continue;
       const rows = this.db.prepare(
-        `SELECT id, json_extract(attrs_json, '$.cloudNodeId') AS cloud FROM nodes INDEXED BY nodes_cloud_node_id WHERE json_extract(attrs_json, '$.cloudNodeId') IN (${slice.map(() => "?").join(",")}) AND valid_to IS NULL ORDER BY id`
+        `SELECT id, json_extract(attrs_json, '$.cloudNodeId') AS cloud FROM nodes INDEXED BY nodes_cloud_node_id_v2 WHERE json_extract(attrs_json, '$.cloudNodeId') IN (${slice.map(() => "?").join(",")}) AND valid_to IS NULL ORDER BY id`
       ).all(...slice);
       for (const r of rows) out.set(r.cloud, [...out.get(r.cloud) ?? [], r.id]);
     }
@@ -16425,8 +17960,9 @@ var SqliteGraphStore = class {
     this.stmts.advanceLive.run({ live_id: liveId, t });
     return frozenId;
   }
-  closeNode(id, t) {
-    this.stmts.closeNode.run({ id, t });
+  closeNode(id, t, opts = {}) {
+    const r = this.stmts.closeNode.run({ id, t });
+    if (Number(r.changes) > 0 && !opts.retainEdges) closeIncidentEdges(this.db, id, t);
   }
   closeEdge(id, t) {
     this.stmts.closeEdge.run({ id, t });
@@ -16446,9 +17982,11 @@ var SqliteGraphStore = class {
    *  so it must be a plain identifier. */
   nodesAsOfWhereTrue(t, attr) {
     if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(attr)) throw new Error(`nodesAsOfWhereTrue: bad attr ${JSON.stringify(attr)}`);
+    const indexed = attr === "revisit" ? " INDEXED BY nodes_revisit_true" : "";
     const rows = this.db.prepare(
-      `SELECT * FROM nodes WHERE valid_from <= :t AND (valid_to IS NULL OR valid_to > :t)
-           AND json_type(attrs_json, '$.${attr}') = 'true'`
+      `SELECT * FROM nodes${indexed} WHERE valid_from <= :t AND (valid_to IS NULL OR valid_to > :t)
+           AND json_type(attrs_json, '$.${attr}') = 'true'
+         ORDER BY rowid`
     ).all({ t });
     return rows.map(rowToNode);
   }
@@ -17035,7 +18573,14 @@ function summaryFromDoc(doc, kind) {
   }
   if (verb !== null) return null;
   const noun = clipped.replace(/^(?:the|a|an)\s+/i, "");
-  return tidy(`${lead(kind)} for ${noun.charAt(0).toLowerCase()}${noun.slice(1)}`);
+  const head = noun.split(/[\s-]/, 1)[0].replace(/[.,;:!?]+$/, "");
+  return tidy(`${lead(kind)} for ${isOrdinaryCapital(head) ? noun.charAt(0).toLowerCase() + noun.slice(1) : noun}`);
+}
+var CONTRACTION_BASES = /* @__PURE__ */ new Set(["it", "that", "this", "there", "here", "what", "who", "where", "when", "why", "how", "let", "he", "she"]);
+function isOrdinaryCapital(word) {
+  const contraction = /^([A-Za-z]+)['’]s$/.exec(word);
+  if (contraction) return CONTRACTION_BASES.has(contraction[1].toLowerCase()) && /^[A-Z][a-z]*$/.test(contraction[1]);
+  return /^[A-Z][a-z]+$/.test(word);
 }
 var VERB_PHRASE_KINDS = /* @__PURE__ */ new Set(["function", "method"]);
 function summaryFromName(name, kind) {
@@ -17152,6 +18697,62 @@ function buildSymbolLexicon(store) {
   }
   return lex;
 }
+function lazySymbolLexicon(store) {
+  if (!store.firstLiveByNameOrQname || !store.liveCommentsAttachedTo) return null;
+  const labels = SYMBOL_LABELS.map(([label]) => label);
+  const kindOf = new Map(SYMBOL_LABELS.map(([label, kind]) => [label, kind]));
+  const members = /* @__PURE__ */ new Map();
+  const docs = /* @__PURE__ */ new Map();
+  const entries = /* @__PURE__ */ new Map();
+  const member = (name) => {
+    if (!members.has(name)) {
+      const hit = isDistinctiveIdentifier(name) ? store.firstLiveByNameOrQname(labels, name) : null;
+      members.set(name, hit ? { kind: kindOf.get(hit.label), description: hit.description, qname: hit.qname } : null);
+    }
+    return members.get(name);
+  };
+  const docFor = (name) => {
+    if (!docs.has(name)) {
+      let found;
+      for (const c of store.liveCommentsAttachedTo(name)) {
+        if (typeof c.kind !== "string" || !DOC_COMMENT_KINDS.has(c.kind)) continue;
+        const text = typeof c.text === "string" ? c.text : c.description;
+        if (!text?.trim()) continue;
+        found = text.trim().slice(0, MAX_DOC_CHARS);
+        break;
+      }
+      docs.set(name, found);
+    }
+    return docs.get(name);
+  };
+  const isKnown = (tok) => member(tok) !== null;
+  let anySymbol;
+  return {
+    has: isKnown,
+    get(name) {
+      if (!entries.has(name)) {
+        const m = member(name);
+        let entry = null;
+        if (m) {
+          entry = { kind: m.kind };
+          const doc = (m.description ? docFor(m.description) : void 0) ?? (m.qname ? docFor(m.qname) : void 0);
+          for (const phrase of summaryCandidates(name, m.kind, doc)) {
+            if (summaryRejectionReason(phrase, isKnown) === null) {
+              entry.summary = phrase;
+              break;
+            }
+          }
+        }
+        entries.set(name, entry);
+      }
+      return entries.get(name) ?? void 0;
+    },
+    get size() {
+      anySymbol ??= labels.some((label) => store.countNodesByLabel(label) > 0);
+      return anySymbol ? 1 : 0;
+    }
+  };
+}
 var LEXICON_SYMBOL_LABELS = ["Function", "Method", "Class", "Interface", "Const", "Comment"];
 function codeGraphKey(store) {
   const files = store.labelFingerprint?.(["File"]);
@@ -17163,7 +18764,7 @@ function lexiconsFor(store) {
   const key = codeGraphKey(store);
   const hit = key !== null ? lexiconCache.get(store) : void 0;
   if (hit && hit.key === key) return hit;
-  const built = { symbols: buildSymbolLexicon(store), files: buildFileLexicon(store) };
+  const built = { symbols: lazySymbolLexicon(store) ?? buildSymbolLexicon(store), files: buildFileLexicon(store) };
   if (key !== null) lexiconCache.set(store, { key, ...built });
   return built;
 }
@@ -17409,11 +19010,11 @@ function generalizeSymbols(text, lexicon, level = 1, fileLexicon) {
 
 // src/generalize-worker.ts
 var stores = /* @__PURE__ */ new Map();
-function storeAt(path) {
-  let s = stores.get(path);
+function storeAt(path2) {
+  let s = stores.get(path2);
   if (!s) {
-    s = openGraphStore({ path });
-    stores.set(path, s);
+    s = openGraphStore({ path: path2 });
+    stores.set(path2, s);
   }
   return s;
 }