@inerrata-corporation/errata 2.0.23 → 2.0.24-dev.5107

package/THIRD-PARTY-NOTICES.md

@@ -31,8 +31,8 @@ The Codex context plugin under `resources/context-plugin/` carries its own
 | hono | 4.12.34 | MIT |
 | ignore | 7.0.5 | MIT |
 | readdirp | 4.1.2 | MIT |
-| smol-toml | 1.6.1 | BSD-3-Clause |
-| undici | 6.24.1 | MIT |
+| smol-toml | 1.9.1 | BSD-3-Clause |
+| undici | 6.29.1 | MIT |
 | ↳ llhttp (in undici) | v8.1.0 | MIT |
 | web-tree-sitter | 0.26.9 | MIT |
 | zod | 4.3.6 | MIT |
@@ -40,6 +40,33 @@ The Codex context plugin under `resources/context-plugin/` carries its own
 ## Data credits
 
 - tldr-pages command index (snapshot in src/tldr-tools.generated.ts): Command names from the tldr-pages project, (c) the tldr-pages contributors, licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). Source: https://github.com/tldr-pages/tldr
+- Static embedding weights (resources/models/potion-base-8M.q8.bin): potion-base-8M by The Minish Lab (model2vec), MIT License; vocabulary from baai/bge-base-en-v1.5. Redistributed quantized to per-row int8 by packages/embedding/scripts/build-static-model.ts. Source: https://huggingface.co/minishlab/potion-base-8M (revision bf8b056651a2c21b8d2565580b8569da283cab23)
+
+### Static embedding weights (resources/models/potion-base-8M.q8.bin) — MIT
+
+```
+MIT License
+
+Copyright (c) 2024 Thomas van Dongen
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+```
 
 ---
 
@@ -891,7 +918,7 @@ SOFTWARE.
 
 ---
 
-## smol-toml@1.6.1
+## smol-toml@1.9.1
 
 License: BSD-3-Clause
 Source: https://github.com/squirrelchat/smol-toml
@@ -927,7 +954,7 @@ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 ---
 
-## undici@6.24.1
+## undici@6.29.1
 
 License: MIT
 Source: https://github.com/nodejs/undici

package/consolidate-worker.mjs

@@ -16146,7 +16146,25 @@ var TAG_CANONICAL_ID_PREFIXES, TAG_HANDLE_SOURCE, TAG_THREAD_SOURCE, TAG_PLACEHO
 var init_tag_grammar = __esm({
   "../../packages/local-shared/src/tag-grammar.ts"() {
     "use strict";
-    TAG_CANONICAL_ID_PREFIXES = ["pat", "sol", "drc", "dcause", "dfix", "dprob", "dvuln", "prob", "claim", "err"];
+    TAG_CANONICAL_ID_PREFIXES = [
+      "motif_community_projn",
+      "motif_community_orgn",
+      "motif",
+      "projn",
+      "orgn",
+      "dtri",
+      "dom",
+      "pat",
+      "sol",
+      "drc",
+      "dcause",
+      "dfix",
+      "dprob",
+      "dvuln",
+      "prob",
+      "claim",
+      "err"
+    ];
     TAG_HANDLE_SOURCE = String.raw`\[([a-z0-9][\w-]{0,80})\]|((?:${TAG_CANONICAL_ID_PREFIXES.join("|")})_[0-9a-f]{6,})`;
     TAG_THREAD_SOURCE = String.raw`#([a-z][\w-]{0,63})`;
     TAG_PLACEHOLDER_HANDLES = /* @__PURE__ */ new Set([
@@ -17420,9 +17438,6 @@ function installLineageIntegrityRepair(db, now = Date.now()) {
   });
 }
 
-// ../../packages/math/src/constants.ts
-var NEMORI_DEDUP_COSINE = 0.88;
-
 // ../../packages/math/src/triage.ts
 var TRIAGE_GLOBAL_BUCKET = "*";
 function triageContextBuckets(ctx) {
@@ -17607,13 +17622,23 @@ function detectCommunitiesLeiden(input, opts = {}) {
 var DEMAND_HOT = Math.log1p(10);
 var DEMAND_WARM = Math.log1p(5);
 
+// ../../packages/math/src/reader-evidence.ts
+var FIELD_CODES = {
+  a: "acceptedCount",
+  c: "corroborationCount",
+  f: "failureReportCount",
+  p: "contradictionPressure"
+};
+var FIELDS = Object.values(FIELD_CODES);
+
 // ../../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"
+  "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 +17959,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 +17974,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 +18165,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 +18271,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 +18684,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 +18780,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);
@@ -19639,6 +19691,38 @@ init_src();
 // ../../packages/local-graph/src/problem-package-link.ts
 init_src();
 
+// ../../packages/embedding/src/bands.ts
+var DESIGNED_FOR_MINILM = {
+  dedup: 0.88,
+  softWriteMin: 0.8,
+  bindMin: 0.78,
+  nearMiss: 0.72,
+  judgeMin: 0.5,
+  predictionFloor: 0.5,
+  relevanceFloor: 0.25,
+  relatedWeak: 0.35,
+  relatedStrong: 0.45
+};
+var BANDS = {
+  "hash-v1": DESIGNED_FOR_MINILM,
+  "minilm-l6-v2": DESIGNED_FOR_MINILM,
+  "potion-8m-q8": {
+    dedup: 0.895,
+    softWriteMin: 0.835,
+    bindMin: 0.83,
+    nearMiss: 0.775,
+    judgeMin: 0.335,
+    predictionFloor: 0.335,
+    relevanceFloor: 0.35,
+    relatedWeak: 0.49,
+    relatedStrong: 0.53
+  }
+};
+var UNKNOWN = { ...DESIGNED_FOR_MINILM, relevanceFloor: 0.5 };
+function cosineBandsFor(version3) {
+  return (version3 ? BANDS[version3] : void 0) ?? UNKNOWN;
+}
+
 // ../../packages/local-graph/src/design-problem.ts
 init_src2();
 
@@ -20561,7 +20645,8 @@ function generalize(text, opts = {}) {
 init_src();
 
 // src/instance-receipts.ts
-var INSTANCE_SEMANTIC_EDGE_TYPES = ["CAUSED_BY", "SOLVED_BY"];
+var INSTANCE_SEMANTIC_EDGE_TYPES = ["CAUSED_BY", "SOLVED_BY", "SUPERSEDES", "BUILDS_ON", "ALTERNATIVE_TO"];
+var INSTANCE_STRUCTURE_EDGE_TYPES = /* @__PURE__ */ new Set(["SUPERSEDES", "BUILDS_ON", "ALTERNATIVE_TO"]);
 var INSTANCE_ANCHOR_EDGE_TYPES = ["OCCURS_IN", "DEPENDS_ON", "PERTAIN_TO", "CONCERNS"];
 function instanceCloudWithdrawal(n, destination, getMeta) {
   const id = n.attrs["source"] === "cloud" ? n.attrs["cloudNodeId"] ?? n.id : instanceReceipt(n, destination)["cloudNodeId"];
@@ -20602,7 +20687,9 @@ function cosine2(a, b) {
   return na === 0 || nb === 0 ? 0 : dot / (Math.sqrt(na) * Math.sqrt(nb));
 }
 function noveltyAgainst(node, neighbors, opts = {}) {
-  const floor = opts.dedupCosine ?? NEMORI_DEDUP_COSINE;
+  const versionOf = (n) => String(n.attrs?.["embeddingVersion"] ?? "hash-v1");
+  const version3 = versionOf(node);
+  const floor = opts.dedupCosine ?? cosineBandsFor(version3).dedup;
   const emb = node.embedding ?? [];
   if (emb.length === 0) {
     return { ready: true, surprise: 1, topCosine: 0, reason: "no-embedding (fidelity-first)" };
@@ -20611,7 +20698,7 @@ function noveltyAgainst(node, neighbors, opts = {}) {
   for (const other of neighbors) {
     if (other.id === node.id) continue;
     const oe = other.embedding ?? [];
-    if (oe.length !== emb.length) continue;
+    if (oe.length !== emb.length || versionOf(other) !== version3) continue;
     const c = cosine2(emb, oe);
     if (c > topCosine) topCosine = c;
   }
@@ -21986,6 +22073,11 @@ function buildInstanceIngest(store, profile, daemonVersion, ignorePatterns = [],
   }
   const edges = [];
   const semanticEdgeDigests = {};
+  const pulledStructureTarget = (e) => {
+    if (!INSTANCE_STRUCTURE_EDGE_TYPES.has(e.type)) return void 0;
+    const target = store.getNode(e.to) ?? opts.sharedStore?.getNode(e.to);
+    return target?.label === "Solution" && target.attrs["source"] === "cloud" ? e.to : void 0;
+  };
   for (const [sourceId, wireFrom] of semanticEndpoints) {
     const rawOuts = [
       ...store.outEdges(sourceId, [...INSTANCE_EDGES]),
@@ -21993,7 +22085,7 @@ function buildInstanceIngest(store, profile, daemonVersion, ignorePatterns = [],
     ];
     const dedup = /* @__PURE__ */ new Map();
     for (const e of rawOuts) dedup.set(`${e.type}>${e.to}`, e);
-    const outs = [...dedup.values()].map((e) => ({ e, wireTo: semanticEndpoints.get(e.to) })).filter((x) => {
+    const outs = [...dedup.values()].map((e) => ({ e, wireTo: semanticEndpoints.get(e.to) ?? pulledStructureTarget(e) })).filter((x) => {
       if (x.wireTo === wireFrom) {
         composition.collapsedEdges++;
         return false;