@inerrata-corporation/errata 2.0.23-dev.4734 → 2.0.23-dev.4779

package/consolidate-worker.mjs

@@ -17613,7 +17613,8 @@ var SELECT_INDEXES = [
   "nodes_live_fold_candidate",
   "nodes_live_resolved",
   "nodes_live_fix_candidate",
-  "nodes_live_anchor_hint"
+  "nodes_live_anchor_hint",
+  "nodes_live_created_v2"
 ];
 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_]*)*$/;
@@ -17934,7 +17935,10 @@ 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);
+-- Dropped: a prefix of nodes_live_page_rank (valid_to, page_rank), which serves
+-- the live count and the "any live node?" check as a covering index too. It was
+-- re-keyed on every close and revive: ~11 KB of a symbol flip's ~80 KB.
+DROP INDEX IF EXISTS nodes_live_count;
 -- 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.
@@ -17946,7 +17950,13 @@ CREATE INDEX IF NOT EXISTS nodes_live_problem_recent ON nodes(label, last_update
 -- 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;
+-- last_updated_at rides along for errata.recent on code labels, which names this
+-- index: the filter runs on index entries, not on every row of the label (79 ms
+-- \u2192 3 ms for Function on a 1.1 GB store). It costs no extra writes: a close or
+-- revive already re-keys this index, and mergeNodeIfChanged leaves a symbol's
+-- last_updated_at alone when only its position moved.
+DROP INDEX IF EXISTS nodes_live_created;
+CREATE INDEX IF NOT EXISTS nodes_live_created_v2 ON nodes(label, valid_to, created_at, last_updated_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).
@@ -18131,6 +18141,12 @@ function sameSqlValue(a, b) {
   if (a instanceof Uint8Array && b instanceof Uint8Array) return Buffer.compare(a, b) === 0;
   return false;
 }
+var POSITION_ATTRS = ["startByte", "endByte", "startRow"];
+function attrsJsonWithoutPositions(attrs) {
+  const rest = { ...attrs };
+  for (const k of POSITION_ATTRS) delete rest[k];
+  return JSON.stringify(rest);
+}
 var PRIOR_TAG_MARKER = '"priorTag":true';
 var SqliteGraphStore = class {
   db;
@@ -18231,7 +18247,7 @@ var SqliteGraphStore = class {
       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 = ?"
+        "SELECT label, description, extraction_confidence, extraction_source, stability, valid_to, last_updated_at, 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 = ?"
@@ -18644,11 +18660,23 @@ var SqliteGraphStore = class {
    *  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. */
+   *  whether it wrote.
+   *
+   *  A live row whose only change is its position keeps its lastUpdatedAt, so
+   *  that stamp means "this symbol's content changed": what errata.recent lists
+   *  and the fix-candidate ask reads, and what lets nodes_live_created_v2 carry
+   *  it without being re-keyed by every edit above a symbol. A closed row is
+   *  always stamped: reviveReobserved reopens what this pass stamped. */
   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);
+    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)) {
+      this.mergeNode(node);
+      return true;
+    }
+    const attrs = node.attrs ?? {};
+    if (row.attrs_json === JSON.stringify(attrs)) return false;
+    const moved = attrsJsonWithoutPositions(JSON.parse(row.attrs_json)) === attrsJsonWithoutPositions(attrs);
+    this.mergeNode(moved ? { ...node, lastUpdatedAt: row.last_updated_at } : node);
     return true;
   }
   updateNode(id, patch) {
@@ -18728,8 +18756,8 @@ var SqliteGraphStore = class {
       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.
+        // followed whichever partial index the planner chose. nodes_live_created_v2
+        // serves it, sorting rowids only within an equal created_at.
         `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, stmt2);

package/errata.mjs

@@ -20645,7 +20645,8 @@ var init_node_select = __esm({
       "nodes_live_fold_candidate",
       "nodes_live_resolved",
       "nodes_live_fix_candidate",
-      "nodes_live_anchor_hint"
+      "nodes_live_anchor_hint",
+      "nodes_live_created_v2"
     ];
     EMBEDDING_DIM_SQL = "(CASE WHEN length(embedding_blob) >= 4 THEN length(embedding_blob) / 4 ELSE COALESCE(json_array_length(embedding_json), 0) END)";
     KEY = /^[A-Za-z_][A-Za-z0-9_]*(\.[A-Za-z_][A-Za-z0-9_]*)*$/;
@@ -20761,10 +20762,15 @@ function sameSqlValue(a, b) {
   if (a instanceof Uint8Array && b instanceof Uint8Array) return Buffer.compare(a, b) === 0;
   return false;
 }
+function attrsJsonWithoutPositions(attrs) {
+  const rest2 = { ...attrs };
+  for (const k of POSITION_ATTRS) delete rest2[k];
+  return JSON.stringify(rest2);
+}
 function openGraphStore(opts) {
   return new SqliteGraphStore(opts);
 }
-var PAGE_RANK_SCALE_KEY, TEXT_SEARCH_COLUMNS, LOCAL_RULE_OVERRIDES, SCHEMA_VERSION, SESSION_REPAIR_KEY, EXPOSURE_SIDE_KEY, SESSION_EVIDENCE_PREDICATE, SCHEMA_SQL, TEMPORAL_INDEX_SQL, FINGERPRINT_INDEXED_LABELS, NODE_LABELS_CHUNK, NODE_UPSERT_COLUMNS, EDGE_UPSERT_COLUMNS, PRIOR_TAG_MARKER, SqliteGraphStore;
+var PAGE_RANK_SCALE_KEY, TEXT_SEARCH_COLUMNS, LOCAL_RULE_OVERRIDES, SCHEMA_VERSION, SESSION_REPAIR_KEY, EXPOSURE_SIDE_KEY, SESSION_EVIDENCE_PREDICATE, SCHEMA_SQL, TEMPORAL_INDEX_SQL, FINGERPRINT_INDEXED_LABELS, NODE_LABELS_CHUNK, NODE_UPSERT_COLUMNS, EDGE_UPSERT_COLUMNS, POSITION_ATTRS, PRIOR_TAG_MARKER, SqliteGraphStore;
 var init_store = __esm({
   "../../packages/local-graph/src/store.ts"() {
     "use strict";
@@ -20918,7 +20924,10 @@ CREATE UNIQUE INDEX IF NOT EXISTS edges_triple ON edges(from_id, type, to_id);
 `;
     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);
+-- Dropped: a prefix of nodes_live_page_rank (valid_to, page_rank), which serves
+-- the live count and the "any live node?" check as a covering index too. It was
+-- re-keyed on every close and revive: ~11 KB of a symbol flip's ~80 KB.
+DROP INDEX IF EXISTS nodes_live_count;
 -- 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.
@@ -20930,7 +20939,13 @@ CREATE INDEX IF NOT EXISTS nodes_live_problem_recent ON nodes(label, last_update
 -- 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;
+-- last_updated_at rides along for errata.recent on code labels, which names this
+-- index: the filter runs on index entries, not on every row of the label (79 ms
+-- \u2192 3 ms for Function on a 1.1 GB store). It costs no extra writes: a close or
+-- revive already re-keys this index, and mergeNodeIfChanged leaves a symbol's
+-- last_updated_at alone when only its position moved.
+DROP INDEX IF EXISTS nodes_live_created;
+CREATE INDEX IF NOT EXISTS nodes_live_created_v2 ON nodes(label, valid_to, created_at, last_updated_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).
@@ -21053,6 +21068,7 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
       "attrs_json"
     ];
     EDGE_UPSERT_COLUMNS = ["confidence", "last_seen_at", "nav_successes", "nav_failures", "valid_to", "attrs_json"];
+    POSITION_ATTRS = ["startByte", "endByte", "startRow"];
     PRIOR_TAG_MARKER = '"priorTag":true';
     SqliteGraphStore = class {
       db;
@@ -21153,7 +21169,7 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
           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 = ?"
+            "SELECT label, description, extraction_confidence, extraction_source, stability, valid_to, last_updated_at, 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 = ?"
@@ -21566,11 +21582,23 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
        *  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. */
+       *  whether it wrote.
+       *
+       *  A live row whose only change is its position keeps its lastUpdatedAt, so
+       *  that stamp means "this symbol's content changed": what errata.recent lists
+       *  and the fix-candidate ask reads, and what lets nodes_live_created_v2 carry
+       *  it without being re-keyed by every edit above a symbol. A closed row is
+       *  always stamped: reviveReobserved reopens what this pass stamped. */
       mergeNodeIfChanged(node2) {
         const row = this.stmts.nodeContent.get(node2.id);
-        if (row && row.valid_to === null && row.label === node2.label && row.description === node2.description && row.extraction_confidence === node2.extractionConfidence && row.stability === node2.stability && !EXPOSURE_ATTRS.some((k) => node2.attrs?.[k] !== void 0) && row.attrs_json === JSON.stringify(node2.attrs ?? {})) return false;
-        this.mergeNode(node2);
+        if (!row || row.valid_to !== null || row.label !== node2.label || row.description !== node2.description || row.extraction_confidence !== node2.extractionConfidence || row.stability !== node2.stability || EXPOSURE_ATTRS.some((k) => node2.attrs?.[k] !== void 0)) {
+          this.mergeNode(node2);
+          return true;
+        }
+        const attrs = node2.attrs ?? {};
+        if (row.attrs_json === JSON.stringify(attrs)) return false;
+        const moved = attrsJsonWithoutPositions(JSON.parse(row.attrs_json)) === attrsJsonWithoutPositions(attrs);
+        this.mergeNode(moved ? { ...node2, lastUpdatedAt: row.last_updated_at } : node2);
         return true;
       }
       updateNode(id, patch) {
@@ -21650,8 +21678,8 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
           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.
+            // followed whichever partial index the planner chose. nodes_live_created_v2
+            // serves it, sorting rowids only within an equal created_at.
             `SELECT id, description, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL ORDER BY created_at, rowid`
           );
           this.fieldStmts.set(cacheKey2, stmt2);
@@ -23199,10 +23227,12 @@ function crystallize(store, opts = { ts: 0 }) {
     const s = support(c) + Math.max(0, sourcesCount(c) - 1);
     const f = contradictions;
     const confidence = (1 + s) / (2 + s + f);
-    store.updateNode(c.id, {
-      attrs: { ...c.attrs, confidence },
-      lastUpdatedAt: opts.ts
-    });
+    if (c.attrs["confidence"] !== confidence) {
+      store.updateNode(c.id, {
+        attrs: { ...c.attrs, confidence },
+        lastUpdatedAt: opts.ts
+      });
+    }
     const sup = support(c);
     let tier = c.memoryTier;
     if (sup >= PERSISTENT_SUPPORT && confidence >= PERSISTENT_CONFIDENCE) tier = "persistent";
@@ -23270,7 +23300,10 @@ function mergeTruthKind(a, b) {
 function markBoth(store, a, b, patch, ts) {
   for (const n of [a, b]) {
     const fresh = store.getNode(n.id);
-    store.updateNode(n.id, { attrs: { ...fresh.attrs, ...patch }, lastUpdatedAt: ts });
+    const next = { ...patch };
+    if (fresh.attrs["revisit"] === true && fresh.attrs["revisitReason"] === next["revisitReason"]) delete next["revisitSinceTs"];
+    if (Object.entries(next).every(([k, v]) => fresh.attrs[k] === v)) continue;
+    store.updateNode(n.id, { attrs: { ...fresh.attrs, ...next }, lastUpdatedAt: ts });
   }
 }
 var LONG_TERM_SUPPORT, PERSISTENT_SUPPORT, PERSISTENT_CONFIDENCE, SCOPE_AXES;
@@ -49322,7 +49355,14 @@ var init_mcp = __esm({
               total += count;
               groups[label] = {
                 count,
-                items: store.selectNodes({ ...q, orderBy: { column: col, desc: true }, limit: sliceEnd(limit) }).map((n) => ({ id: n.id, description: n.description.slice(0, 160), at: col === "last_updated_at" ? n.lastUpdatedAt : n.createdAt }))
+                items: store.selectNodes({
+                  ...q,
+                  orderBy: { column: col, desc: true },
+                  limit: sliceEnd(limit),
+                  // Unnamed, the planner reads every row of a code label through
+                  // nodes_live to test last_updated_at; this index carries it.
+                  ...col === "last_updated_at" ? { indexedBy: "nodes_live_created_v2" } : {}
+                }).map((n) => ({ id: n.id, description: n.description.slice(0, 160), at: col === "last_updated_at" ? n.lastUpdatedAt : n.createdAt }))
               };
             }
           }
@@ -85606,7 +85646,7 @@ var OntologyValidationError = class extends Error {
   }
 };
 function phrase(text, article) {
-  const capitalized = text.length === 0 ? text : text.charAt(0).toUpperCase() + text.slice(1);
+  const capitalized = firstAlphaCharUpper(text);
   return { text, article, textCapitalized: capitalized };
 }
 var DEFAULT_ONTOLOGY2 = {
@@ -85729,7 +85769,7 @@ function expectedArticleKind(text) {
   return "bare";
 }
 function firstAlphaCharUpper(s) {
-  return s.length === 0 ? s : s.charAt(0).toUpperCase() + s.slice(1);
+  return s.charAt(0).toUpperCase() + s.slice(1);
 }
 function phraseTriggersLayer1(text) {
   for (const pat of ALL_PATTERNS) {
@@ -87480,7 +87520,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.23-dev.4734" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.23-dev.4779" : "2.0.0-alpha.0";
 var IGNORED_PATH = /[\\/](?:\.git|node_modules|\.errata|\.claude|\.codex|\.cursor|\.turbo|\.next|dist|coverage|test-results|playwright-report|__pycache__)(?:[\\/]|$)/;
 var IGNORED_NOISE = /castalia\.db|eventlog\.sqlite|turn-cursors/;
 var GIT_OP_MUTE_MS = 4e3;

package/generalize-worker.mjs

@@ -16010,7 +16010,8 @@ var SELECT_INDEXES = [
   "nodes_live_fold_candidate",
   "nodes_live_resolved",
   "nodes_live_fix_candidate",
-  "nodes_live_anchor_hint"
+  "nodes_live_anchor_hint",
+  "nodes_live_created_v2"
 ];
 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_]*)*$/;
@@ -16331,7 +16332,10 @@ 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);
+-- Dropped: a prefix of nodes_live_page_rank (valid_to, page_rank), which serves
+-- the live count and the "any live node?" check as a covering index too. It was
+-- re-keyed on every close and revive: ~11 KB of a symbol flip's ~80 KB.
+DROP INDEX IF EXISTS nodes_live_count;
 -- 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.
@@ -16343,7 +16347,13 @@ CREATE INDEX IF NOT EXISTS nodes_live_problem_recent ON nodes(label, last_update
 -- 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;
+-- last_updated_at rides along for errata.recent on code labels, which names this
+-- index: the filter runs on index entries, not on every row of the label (79 ms
+-- \u2192 3 ms for Function on a 1.1 GB store). It costs no extra writes: a close or
+-- revive already re-keys this index, and mergeNodeIfChanged leaves a symbol's
+-- last_updated_at alone when only its position moved.
+DROP INDEX IF EXISTS nodes_live_created;
+CREATE INDEX IF NOT EXISTS nodes_live_created_v2 ON nodes(label, valid_to, created_at, last_updated_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).
@@ -16528,6 +16538,12 @@ function sameSqlValue(a, b) {
   if (a instanceof Uint8Array && b instanceof Uint8Array) return Buffer.compare(a, b) === 0;
   return false;
 }
+var POSITION_ATTRS = ["startByte", "endByte", "startRow"];
+function attrsJsonWithoutPositions(attrs) {
+  const rest = { ...attrs };
+  for (const k of POSITION_ATTRS) delete rest[k];
+  return JSON.stringify(rest);
+}
 var PRIOR_TAG_MARKER = '"priorTag":true';
 var SqliteGraphStore = class {
   db;
@@ -16628,7 +16644,7 @@ var SqliteGraphStore = class {
       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 = ?"
+        "SELECT label, description, extraction_confidence, extraction_source, stability, valid_to, last_updated_at, 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 = ?"
@@ -17041,11 +17057,23 @@ var SqliteGraphStore = class {
    *  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. */
+   *  whether it wrote.
+   *
+   *  A live row whose only change is its position keeps its lastUpdatedAt, so
+   *  that stamp means "this symbol's content changed": what errata.recent lists
+   *  and the fix-candidate ask reads, and what lets nodes_live_created_v2 carry
+   *  it without being re-keyed by every edit above a symbol. A closed row is
+   *  always stamped: reviveReobserved reopens what this pass stamped. */
   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);
+    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)) {
+      this.mergeNode(node);
+      return true;
+    }
+    const attrs = node.attrs ?? {};
+    if (row.attrs_json === JSON.stringify(attrs)) return false;
+    const moved = attrsJsonWithoutPositions(JSON.parse(row.attrs_json)) === attrsJsonWithoutPositions(attrs);
+    this.mergeNode(moved ? { ...node, lastUpdatedAt: row.last_updated_at } : node);
     return true;
   }
   updateNode(id, patch) {
@@ -17125,8 +17153,8 @@ var SqliteGraphStore = class {
       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.
+        // followed whichever partial index the planner chose. nodes_live_created_v2
+        // serves it, sorting rowids only within an equal created_at.
         `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, stmt2);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@inerrata-corporation/errata",
-  "version": "2.0.23-dev.4734",
+  "version": "2.0.23-dev.4779",
   "description": "errata - local-first observation engine for AI coding agents",
   "type": "module",
   "bin": {

package/pass-worker.mjs

@@ -26982,7 +26982,8 @@ var SELECT_INDEXES = [
   "nodes_live_fold_candidate",
   "nodes_live_resolved",
   "nodes_live_fix_candidate",
-  "nodes_live_anchor_hint"
+  "nodes_live_anchor_hint",
+  "nodes_live_created_v2"
 ];
 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_]*)*$/;
@@ -27303,7 +27304,10 @@ 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);
+-- Dropped: a prefix of nodes_live_page_rank (valid_to, page_rank), which serves
+-- the live count and the "any live node?" check as a covering index too. It was
+-- re-keyed on every close and revive: ~11 KB of a symbol flip's ~80 KB.
+DROP INDEX IF EXISTS nodes_live_count;
 -- 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.
@@ -27315,7 +27319,13 @@ CREATE INDEX IF NOT EXISTS nodes_live_problem_recent ON nodes(label, last_update
 -- 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;
+-- last_updated_at rides along for errata.recent on code labels, which names this
+-- index: the filter runs on index entries, not on every row of the label (79 ms
+-- \u2192 3 ms for Function on a 1.1 GB store). It costs no extra writes: a close or
+-- revive already re-keys this index, and mergeNodeIfChanged leaves a symbol's
+-- last_updated_at alone when only its position moved.
+DROP INDEX IF EXISTS nodes_live_created;
+CREATE INDEX IF NOT EXISTS nodes_live_created_v2 ON nodes(label, valid_to, created_at, last_updated_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).
@@ -27500,6 +27510,12 @@ function sameSqlValue(a, b) {
   if (a instanceof Uint8Array && b instanceof Uint8Array) return Buffer.compare(a, b) === 0;
   return false;
 }
+var POSITION_ATTRS = ["startByte", "endByte", "startRow"];
+function attrsJsonWithoutPositions(attrs) {
+  const rest = { ...attrs };
+  for (const k of POSITION_ATTRS) delete rest[k];
+  return JSON.stringify(rest);
+}
 var PRIOR_TAG_MARKER = '"priorTag":true';
 var SqliteGraphStore = class {
   db;
@@ -27600,7 +27616,7 @@ var SqliteGraphStore = class {
       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 = ?"
+        "SELECT label, description, extraction_confidence, extraction_source, stability, valid_to, last_updated_at, 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 = ?"
@@ -28013,11 +28029,23 @@ var SqliteGraphStore = class {
    *  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. */
+   *  whether it wrote.
+   *
+   *  A live row whose only change is its position keeps its lastUpdatedAt, so
+   *  that stamp means "this symbol's content changed": what errata.recent lists
+   *  and the fix-candidate ask reads, and what lets nodes_live_created_v2 carry
+   *  it without being re-keyed by every edit above a symbol. A closed row is
+   *  always stamped: reviveReobserved reopens what this pass stamped. */
   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);
+    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)) {
+      this.mergeNode(node);
+      return true;
+    }
+    const attrs = node.attrs ?? {};
+    if (row.attrs_json === JSON.stringify(attrs)) return false;
+    const moved = attrsJsonWithoutPositions(JSON.parse(row.attrs_json)) === attrsJsonWithoutPositions(attrs);
+    this.mergeNode(moved ? { ...node, lastUpdatedAt: row.last_updated_at } : node);
     return true;
   }
   updateNode(id, patch) {
@@ -28097,8 +28125,8 @@ var SqliteGraphStore = class {
       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.
+        // followed whichever partial index the planner chose. nodes_live_created_v2
+        // serves it, sorting rowids only within an equal created_at.
         `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, stmt2);
@@ -29130,10 +29158,12 @@ function crystallize(store2, opts = { ts: 0 }) {
     const s = support(c) + Math.max(0, sourcesCount(c) - 1);
     const f = contradictions;
     const confidence = (1 + s) / (2 + s + f);
-    store2.updateNode(c.id, {
-      attrs: { ...c.attrs, confidence },
-      lastUpdatedAt: opts.ts
-    });
+    if (c.attrs["confidence"] !== confidence) {
+      store2.updateNode(c.id, {
+        attrs: { ...c.attrs, confidence },
+        lastUpdatedAt: opts.ts
+      });
+    }
     const sup = support(c);
     let tier = c.memoryTier;
     if (sup >= PERSISTENT_SUPPORT && confidence >= PERSISTENT_CONFIDENCE) tier = "persistent";
@@ -29201,7 +29231,10 @@ function mergeTruthKind(a, b) {
 function markBoth(store2, a, b, patch, ts) {
   for (const n of [a, b]) {
     const fresh = store2.getNode(n.id);
-    store2.updateNode(n.id, { attrs: { ...fresh.attrs, ...patch }, lastUpdatedAt: ts });
+    const next = { ...patch };
+    if (fresh.attrs["revisit"] === true && fresh.attrs["revisitReason"] === next["revisitReason"]) delete next["revisitSinceTs"];
+    if (Object.entries(next).every(([k, v]) => fresh.attrs[k] === v)) continue;
+    store2.updateNode(n.id, { attrs: { ...fresh.attrs, ...next }, lastUpdatedAt: ts });
   }
 }
 

package/resources/context-plugin/.codex-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "errata-context",
-  "version": "2.0.23-dev.4734",
+  "version": "2.0.23-dev.4779",
   "description": "A minimal 3D view of loaded Errata priors and recent graph bursts.",
   "author": {
     "name": "inErrata"

package/resources/context-plugin/SHA256SUMS

@@ -1,4 +1,4 @@
-1cf9b23c192fdd174ce8e6758c456f5406439ff585d252e1765cdd7707583657  .codex-plugin/plugin.json
+8c2ed59e34694f0fbec381b67731aae53d87a289c92222a279d038f65e3bcad0  .codex-plugin/plugin.json
 a7bebae9fb01c838d6c75fc784129e28be571233fa66ff5ee8039b574f35ccf7  assets/icon.png
 fc38b64e4df1e0b72c35764bef6c4c05430d97c9009ad0ecc8a9e75b4deab232  configure-local.mjs
 73dc6028b3b070257c7c31f252d11e55a9e096f4aed0f187f10cb21716e1e6d7  dist/client.js