@inerrata-corporation/errata 2.0.21-dev.3996 → 2.0.21-dev.4004

package/consolidate-worker.mjs

@@ -16969,6 +16969,12 @@ var SqliteGraphStore = class {
       setPageRank: this.db.prepare("UPDATE nodes SET page_rank = :v WHERE id = :id"),
       setLandmark: this.db.prepare("UPDATE nodes SET is_landmark = :v WHERE id = :id"),
       setCommunity: this.db.prepare("UPDATE nodes SET community = :v WHERE id = :id"),
+      setLocalCommunity: this.db.prepare(`
+        UPDATE nodes SET
+          attrs_json = CASE WHEN :v IS NULL THEN json_remove(attrs_json, '$.localCommunity')
+                            ELSE json_set(attrs_json, '$.localCommunity', :v) END,
+          community = CASE WHEN :col = 1 THEN :v ELSE community END
+        WHERE id = :id`),
       updateNode: this.db.prepare(`
         UPDATE nodes SET
           description = COALESCE(:description, description),
@@ -17289,6 +17295,35 @@ 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 });
+  }
+  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, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL`
+      );
+      this.fieldStmts.set(cacheKey, stmt);
+    }
+    return stmt.all(label).map((r) => {
+      const attrs = {};
+      attrKeys.forEach((k, i) => {
+        const v = r[`a${i}`];
+        if (v !== null && v !== void 0) attrs[k] = v;
+      });
+      return {
+        id: r["id"],
+        community: r["community"] ?? null,
+        extractionConfidence: r["extraction_confidence"],
+        attrs
+      };
+    });
+  }
   setCommunity(id, community) {
     this.stmts.setCommunity.run({ id, v: community });
   }

package/errata.mjs

@@ -19699,6 +19699,12 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
           setPageRank: this.db.prepare("UPDATE nodes SET page_rank = :v WHERE id = :id"),
           setLandmark: this.db.prepare("UPDATE nodes SET is_landmark = :v WHERE id = :id"),
           setCommunity: this.db.prepare("UPDATE nodes SET community = :v WHERE id = :id"),
+          setLocalCommunity: this.db.prepare(`
+        UPDATE nodes SET
+          attrs_json = CASE WHEN :v IS NULL THEN json_remove(attrs_json, '$.localCommunity')
+                            ELSE json_set(attrs_json, '$.localCommunity', :v) END,
+          community = CASE WHEN :col = 1 THEN :v ELSE community END
+        WHERE id = :id`),
           updateNode: this.db.prepare(`
         UPDATE nodes SET
           description = COALESCE(:description, description),
@@ -20019,6 +20025,35 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
       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 });
+      }
+      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 cacheKey2 = attrKeys.join(",");
+        let stmt = this.fieldStmts.get(cacheKey2);
+        if (!stmt) {
+          const cols = attrKeys.map((k, i2) => `, json_extract(attrs_json, '$.${k}') AS a${i2}`).join("");
+          stmt = this.db.prepare(
+            `SELECT id, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL`
+          );
+          this.fieldStmts.set(cacheKey2, stmt);
+        }
+        return stmt.all(label).map((r) => {
+          const attrs = {};
+          attrKeys.forEach((k, i2) => {
+            const v = r[`a${i2}`];
+            if (v !== null && v !== void 0) attrs[k] = v;
+          });
+          return {
+            id: r["id"],
+            community: r["community"] ?? null,
+            extractionConfidence: r["extraction_confidence"],
+            attrs
+          };
+        });
+      }
       setCommunity(id, community) {
         this.stmts.setCommunity.run({ id, v: community });
       }
@@ -24640,25 +24675,23 @@ function detectLocalCommunities(store, opts = {}) {
   const nodes = /* @__PURE__ */ new Map();
   const unowned = [];
   for (const label of JOINT_COMMUNITY_LABELS) {
-    for (const n of store.findNodesByLabel(label)) {
+    for (const n of store.findNodeFieldsByLabel(label, PASS_ATTRS)) {
       if (n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) unowned.push(n);
-      else nodes.set(n.id, n);
+      else nodes.set(n.id, { ...n, label });
     }
   }
   const ids = new Set(nodes.keys());
   report.candidates = ids.size;
   for (const label of SEMANTIC_NODE_LABELS) {
-    if (!JOINT_COMMUNITY_LABELS.includes(label)) unowned.push(...store.findNodesByLabel(label));
+    if (!JOINT_COMMUNITY_LABELS.includes(label)) unowned.push(...store.findNodeFieldsByLabel(label, PASS_ATTRS));
   }
   store.transaction(() => {
     for (const n of unowned) {
-      if (n.attrs["localCommunity"] !== void 0) {
-        const { localCommunity: _gone, ...rest2 } = n.attrs;
-        store.updateNode(n.id, { attrs: rest2 });
-      }
-      if (!n.community || n.attrs["source"] === "cloud") continue;
-      store.setCommunity(n.id, null);
-      report.cleared++;
+      const pulled = n.attrs["source"] === "cloud";
+      const clearColumn = !!n.community && !pulled;
+      if (n.attrs["localCommunity"] === void 0 && !clearColumn) continue;
+      store.setLocalCommunity(n.id, null, clearColumn);
+      if (clearColumn) report.cleared++;
     }
   });
   if (ids.size === 0) return report;
@@ -24706,14 +24739,10 @@ function detectLocalCommunities(store, opts = {}) {
         const pulled = n.attrs["source"] === "cloud";
         if (pulled) hasCloud = true;
         else hasLocal = true;
-        const want = qualifies ? cid : void 0;
-        if (n.attrs["localCommunity"] !== want) {
-          const nextAttrs = { ...n.attrs };
-          if (want) nextAttrs["localCommunity"] = want;
-          else delete nextAttrs["localCommunity"];
-          store.updateNode(id, { attrs: nextAttrs });
-        }
-        if (!pulled && (n.community ?? null) !== (want ?? null)) store.setCommunity(id, want ?? null);
+        const want = qualifies ? cid : null;
+        const attrChanged = (n.attrs["localCommunity"] ?? null) !== want;
+        const columnChanged = !pulled && (n.community ?? null) !== want;
+        if (attrChanged || columnChanged) store.setLocalCommunity(id, want, !pulled);
       }
       if (qualifies) {
         report.communities++;
@@ -24797,12 +24826,13 @@ function communityInductionRequests(store, opts = {}) {
     };
   }).filter((r) => r.members.length >= MIN_INDUCTION_MEMBERS).slice(0, maxCommunities);
 }
-var JOINT_COMMUNITY_LABELS, JOINT_COMMUNITY_EDGES, DOMAIN_EDGES, DOMAIN_INHERIT_EDGES, MIN_INDUCTION_MEMBERS;
+var PASS_ATTRS, JOINT_COMMUNITY_LABELS, JOINT_COMMUNITY_EDGES, DOMAIN_EDGES, DOMAIN_INHERIT_EDGES, MIN_INDUCTION_MEMBERS;
 var init_community2 = __esm({
   "../../packages/local-graph/src/community.ts"() {
     "use strict";
     init_src2();
     init_src3();
+    PASS_ATTRS = ["resolvedAs", "source", "localCommunity"];
     JOINT_COMMUNITY_LABELS = [
       "Problem",
       "Vulnerability",
@@ -32153,12 +32183,12 @@ function promoteMotifs(store, t) {
   const report = { communities: 0, candidates: 0, incoherent: 0, promoted: 0, techniques: 0, antipatterns: 0, retracted: 0, retired: 0 };
   const byCommunity = /* @__PURE__ */ new Map();
   for (const label of MEMBER_LABELS) {
-    for (const n of store.findNodesByLabel(label)) {
-      if (n.label === "Problem" && n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
+    for (const n of store.findNodeFieldsByLabel(label, ["localCommunity", "resolvedAs"])) {
+      if (label === "Problem" && n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
       const c = n.attrs["localCommunity"];
       if (typeof c !== "string") continue;
       const g = byCommunity.get(c) ?? [];
-      g.push(n);
+      g.push({ id: n.id, label, extractionConfidence: n.extractionConfidence });
       byCommunity.set(c, g);
     }
   }
@@ -32211,7 +32241,8 @@ function promoteMotifs(store, t) {
       report.candidates++;
       kept.add(motifId);
       const kind = classifyMotif(store, instances, d.promoted);
-      const exemplar = exemplarOf(members);
+      const exemplarRef = exemplarOf(members);
+      const exemplar = exemplarRef ? store.getNode(exemplarRef.id) ?? void 0 : void 0;
       const motif = {
         id: motifId,
         label: kind,
@@ -83942,7 +83973,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.21-dev.3996" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.21-dev.4004" : "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

@@ -15363,6 +15363,12 @@ var SqliteGraphStore = class {
       setPageRank: this.db.prepare("UPDATE nodes SET page_rank = :v WHERE id = :id"),
       setLandmark: this.db.prepare("UPDATE nodes SET is_landmark = :v WHERE id = :id"),
       setCommunity: this.db.prepare("UPDATE nodes SET community = :v WHERE id = :id"),
+      setLocalCommunity: this.db.prepare(`
+        UPDATE nodes SET
+          attrs_json = CASE WHEN :v IS NULL THEN json_remove(attrs_json, '$.localCommunity')
+                            ELSE json_set(attrs_json, '$.localCommunity', :v) END,
+          community = CASE WHEN :col = 1 THEN :v ELSE community END
+        WHERE id = :id`),
       updateNode: this.db.prepare(`
         UPDATE nodes SET
           description = COALESCE(:description, description),
@@ -15683,6 +15689,35 @@ 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 });
+  }
+  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, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL`
+      );
+      this.fieldStmts.set(cacheKey, stmt);
+    }
+    return stmt.all(label).map((r) => {
+      const attrs = {};
+      attrKeys.forEach((k, i) => {
+        const v = r[`a${i}`];
+        if (v !== null && v !== void 0) attrs[k] = v;
+      });
+      return {
+        id: r["id"],
+        community: r["community"] ?? null,
+        extractionConfidence: r["extraction_confidence"],
+        attrs
+      };
+    });
+  }
   setCommunity(id, community) {
     this.stmts.setCommunity.run({ id, v: community });
   }

package/package.json

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

package/pass-worker.mjs

@@ -26244,6 +26244,12 @@ var SqliteGraphStore = class {
       setPageRank: this.db.prepare("UPDATE nodes SET page_rank = :v WHERE id = :id"),
       setLandmark: this.db.prepare("UPDATE nodes SET is_landmark = :v WHERE id = :id"),
       setCommunity: this.db.prepare("UPDATE nodes SET community = :v WHERE id = :id"),
+      setLocalCommunity: this.db.prepare(`
+        UPDATE nodes SET
+          attrs_json = CASE WHEN :v IS NULL THEN json_remove(attrs_json, '$.localCommunity')
+                            ELSE json_set(attrs_json, '$.localCommunity', :v) END,
+          community = CASE WHEN :col = 1 THEN :v ELSE community END
+        WHERE id = :id`),
       updateNode: this.db.prepare(`
         UPDATE nodes SET
           description = COALESCE(:description, description),
@@ -26564,6 +26570,35 @@ 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 });
+  }
+  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, i2) => `, json_extract(attrs_json, '$.${k}') AS a${i2}`).join("");
+      stmt = this.db.prepare(
+        `SELECT id, community, extraction_confidence${cols} FROM nodes WHERE label = ? AND valid_to IS NULL`
+      );
+      this.fieldStmts.set(cacheKey, stmt);
+    }
+    return stmt.all(label).map((r) => {
+      const attrs = {};
+      attrKeys.forEach((k, i2) => {
+        const v = r[`a${i2}`];
+        if (v !== null && v !== void 0) attrs[k] = v;
+      });
+      return {
+        id: r["id"],
+        community: r["community"] ?? null,
+        extractionConfidence: r["extraction_confidence"],
+        attrs
+      };
+    });
+  }
   setCommunity(id, community) {
     this.stmts.setCommunity.run({ id, v: community });
   }
@@ -28322,6 +28357,7 @@ var DRIFT_VALUES = new Set(Object.values(DRIFT_KIND));
 
 // ../../packages/local-graph/src/community.ts
 init_src2();
+var PASS_ATTRS = ["resolvedAs", "source", "localCommunity"];
 var JOINT_COMMUNITY_LABELS = [
   "Problem",
   "Vulnerability",
@@ -28369,25 +28405,23 @@ function detectLocalCommunities(store2, opts = {}) {
   const nodes = /* @__PURE__ */ new Map();
   const unowned = [];
   for (const label of JOINT_COMMUNITY_LABELS) {
-    for (const n of store2.findNodesByLabel(label)) {
+    for (const n of store2.findNodeFieldsByLabel(label, PASS_ATTRS)) {
       if (n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) unowned.push(n);
-      else nodes.set(n.id, n);
+      else nodes.set(n.id, { ...n, label });
     }
   }
   const ids = new Set(nodes.keys());
   report.candidates = ids.size;
   for (const label of SEMANTIC_NODE_LABELS) {
-    if (!JOINT_COMMUNITY_LABELS.includes(label)) unowned.push(...store2.findNodesByLabel(label));
+    if (!JOINT_COMMUNITY_LABELS.includes(label)) unowned.push(...store2.findNodeFieldsByLabel(label, PASS_ATTRS));
   }
   store2.transaction(() => {
     for (const n of unowned) {
-      if (n.attrs["localCommunity"] !== void 0) {
-        const { localCommunity: _gone, ...rest } = n.attrs;
-        store2.updateNode(n.id, { attrs: rest });
-      }
-      if (!n.community || n.attrs["source"] === "cloud") continue;
-      store2.setCommunity(n.id, null);
-      report.cleared++;
+      const pulled = n.attrs["source"] === "cloud";
+      const clearColumn = !!n.community && !pulled;
+      if (n.attrs["localCommunity"] === void 0 && !clearColumn) continue;
+      store2.setLocalCommunity(n.id, null, clearColumn);
+      if (clearColumn) report.cleared++;
     }
   });
   if (ids.size === 0) return report;
@@ -28435,14 +28469,10 @@ function detectLocalCommunities(store2, opts = {}) {
         const pulled = n.attrs["source"] === "cloud";
         if (pulled) hasCloud = true;
         else hasLocal = true;
-        const want = qualifies ? cid : void 0;
-        if (n.attrs["localCommunity"] !== want) {
-          const nextAttrs = { ...n.attrs };
-          if (want) nextAttrs["localCommunity"] = want;
-          else delete nextAttrs["localCommunity"];
-          store2.updateNode(id, { attrs: nextAttrs });
-        }
-        if (!pulled && (n.community ?? null) !== (want ?? null)) store2.setCommunity(id, want ?? null);
+        const want = qualifies ? cid : null;
+        const attrChanged = (n.attrs["localCommunity"] ?? null) !== want;
+        const columnChanged = !pulled && (n.community ?? null) !== want;
+        if (attrChanged || columnChanged) store2.setLocalCommunity(id, want, !pulled);
       }
       if (qualifies) {
         report.communities++;
@@ -28916,12 +28946,12 @@ function promoteMotifs(store2, t) {
   const report = { communities: 0, candidates: 0, incoherent: 0, promoted: 0, techniques: 0, antipatterns: 0, retracted: 0, retired: 0 };
   const byCommunity = /* @__PURE__ */ new Map();
   for (const label of MEMBER_LABELS) {
-    for (const n of store2.findNodesByLabel(label)) {
-      if (n.label === "Problem" && n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
+    for (const n of store2.findNodeFieldsByLabel(label, ["localCommunity", "resolvedAs"])) {
+      if (label === "Problem" && n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
       const c = n.attrs["localCommunity"];
       if (typeof c !== "string") continue;
       const g = byCommunity.get(c) ?? [];
-      g.push(n);
+      g.push({ id: n.id, label, extractionConfidence: n.extractionConfidence });
       byCommunity.set(c, g);
     }
   }
@@ -28974,7 +29004,8 @@ function promoteMotifs(store2, t) {
       report.candidates++;
       kept.add(motifId);
       const kind = classifyMotif(store2, instances, d.promoted);
-      const exemplar = exemplarOf(members);
+      const exemplarRef = exemplarOf(members);
+      const exemplar = exemplarRef ? store2.getNode(exemplarRef.id) ?? void 0 : void 0;
       const motif = {
         id: motifId,
         label: kind,

package/resources/claude-mods/errata-minimap/.claude-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "errata-minimap",
-  "version": "0.3.1",
+  "version": "0.4.0",
   "author": { "name": "inErrata", "url": "https://inerrata.ai" },
   "description": "The errata library: the causal chains of the latest burst that entered the agent's context, in bookcases by technology with a catalog card — and errata's inline tags, tidied in the chat.",
   "types": "./types/index.d.ts"

package/resources/claude-mods/errata-minimap/hooks/bookcase.ts

@@ -126,7 +126,7 @@ const SPACE = 0x20
 const TALL_SHELF = 4
 const SHORT_SHELF = 3
 /** Cells a shelf keeps after its books for its plate. */
-const PLATE = 15
+const PLATE = 17
 /** Rows the catalog card never gives up: header, two lines of chain, footer. */
 const MIN_CARD = 4
 const MAX_CARD = 8
@@ -157,7 +157,7 @@ function placeCases(catalog: Catalog, columns: number, rows: number, zone: numbe
   let tierHeight = 0
   for (const bookcase of catalog.cases) {
     const fullest = Math.max(...bookcase.shelves.map(s => s.books.reduce((w, b) => w + widthOf(b), 0)))
-    // Room after the fullest shelf for its plate (" 1 miscellany "), and on the cornice for the tech.
+    // Room after the fullest shelf for its plate (" 1 loose volumes "), and on the cornice for the tech.
     const width = Math.min(columns, Math.max(bookcase.tech.length + 6, fullest + 4 + PLATE))
     if (x > 0 && x + width > columns) {
       x = 0
@@ -185,6 +185,40 @@ function placeCases(catalog: Catalog, columns: number, rows: number, zone: numbe
   return placed
 }
 
+/** The library's geometry: the card it keeps, the shelf height, where every case stands. */
+function layoutLibrary(catalog: Catalog, columns: number, rows: number, focusId?: string) {
+  const focus = focusBook(catalog, focusId)
+  // The card asks for its chain in full (header, every wrapped line, footer); the cases get the rest, at least a third.
+  const need = focus ? 2 + partsOf(focus).reduce((n, [, part]) => n + wrap(part.name, columns - 5).length, 0) : 0
+  const card = Math.max(MIN_CARD, Math.min(need, Math.max(MAX_CARD, Math.round(rows * 0.6)), rows - Math.ceil(rows / 3)))
+  const zone = rows - card >= 1 + TALL_SHELF + 1 ? TALL_SHELF : SHORT_SHELF
+  return { focus, need, card, zone, placed: placeCases(catalog, columns, rows - card, zone) }
+}
+
+/** Where a drawn book stands, in cells from the library's top-left: its spine's whole zone above the plank. */
+export type BookSpot = { book: Book; x: number; top: number; width: number; height: number }
+
+/**
+ * Every drawn book's spot, from the same layout `rasterizeLibrary` draws: the
+ * hover and click targets laid over the spines, so they can never disagree
+ * with the picture about where a book is.
+ */
+export function librarySpots(catalog: Catalog, columns: number, rows: number, focusId?: string): BookSpot[] {
+  const { zone, placed } = layoutLibrary(catalog, columns, rows, focusId)
+  const spots: BookSpot[] = []
+  for (const c of placed) {
+    c.shelves.forEach(({ books }, si) => {
+      const plank = c.y + 1 + si * (zone + 1) + zone
+      let x = c.x + 2
+      for (const book of books) {
+        spots.push({ book, x, top: plank - zone, width: widthOf(book), height: zone })
+        x += widthOf(book)
+      }
+    })
+  }
+  return spots
+}
+
 /** Every book drawn, in reading order: the order the reveal raises them. */
 function drawnBooks(placed: Placed[]): Book[] {
   return placed.flatMap(p => p.shelves.flatMap(s => s.books))
@@ -220,12 +254,7 @@ export function rasterizeLibrary(catalog: Catalog, columns: number, rows: number
     return x + k
   }
 
-  const focus = focusBook(catalog, options.focus)
-  // The card asks for its chain in full (header, every wrapped line, footer); the cases get the rest, at least a third.
-  const need = focus ? 2 + partsOf(focus).reduce((n, [, part]) => n + wrap(part.name, columns - 5).length, 0) : 0
-  const card = Math.max(MIN_CARD, Math.min(need, Math.max(MAX_CARD, Math.round(rows * 0.6)), rows - Math.ceil(rows / 3)))
-  const zone = rows - card >= 1 + TALL_SHELF + 1 ? TALL_SHELF : SHORT_SHELF
-  const placed = placeCases(catalog, columns, rows - card, zone)
+  const { focus, need, card, zone, placed } = layoutLibrary(catalog, columns, rows, options.focus)
   const order = drawnBooks(placed)
   const pulled = bookHolding(catalog, highlight)
   const scores = catalog.books.map(b => b.score).sort((a, b) => a - b)

package/resources/claude-mods/errata-minimap/hooks/chains.ts

@@ -37,7 +37,6 @@ export type Book = {
   memberIds: string[]
   tech?: string
   community?: string
-  communityLabel?: string | null
   patterns: string[]
   anchor?: string
   /** Its `errata_neighbors` answer has arrived. */
@@ -247,10 +246,7 @@ export function catalogue(graph: MapGraph, facts: Record<string, ChainFacts | nu
     }
     // Only cloud-merged rows carry a community; theirs is the cloud partition's, kept apart from the local one.
     const cloud = book.community ? undefined : graph.nodes.find(n => book.memberIds.includes(n.id) && n.community)?.community
-    if (cloud) {
-      book.community = `cloud_${cloud.id}`
-      book.communityLabel = cloud.label
-    }
+    if (cloud) book.community = `cloud_${cloud.id}`
     book.anchor = anchorOf(f, book.problem?.name)
     candidates.set(book.key, techs.filter((t, i) => techs.findIndex(u => u.name === t.name) === i))
   }
@@ -261,8 +257,10 @@ export function catalogue(graph: MapGraph, facts: Record<string, ChainFacts | nu
 }
 
 const GENERAL = 'general'
-/** A shelf holds a community only when two of its books are in view; the rest share the miscellany. */
+/** A shelf holds a community, or a shared Pattern, only when two of its books are in view. */
 const MIN_SHELF = 2
+/** The shelf for books that share neither with another book in view. */
+export const LOOSE = 'loose volumes'
 
 function bookcases(books: Book[]): Bookcase[] {
   const byTech = new Map<string, Book[]>()
@@ -272,31 +270,44 @@ function bookcases(books: Book[]): Bookcase[] {
     .map(([tech, held]) => ({ tech, code: classMark(tech), shelves: shelves(held), isGeneral: tech === GENERAL }))
 }
 
+/**
+ * Shelves in three tiers: a community with two books in view; then, among the
+ * books left, a Pattern two of them instance (agent-named shapes are often the
+ * truest grouping there is); then the loose volumes. A burst of ten chains
+ * rarely holds two from one community — they are small — so community alone
+ * put nearly every book on one catch-all shelf.
+ */
 function shelves(books: Book[]): Shelf[] {
+  const out: Shelf[] = []
   const byCommunity = new Map<string, Book[]>()
   for (const b of books) if (b.community) byCommunity.set(b.community, [...(byCommunity.get(b.community) ?? []), b])
-  const out: Shelf[] = []
   for (const [key, held] of byCommunity) {
-    if (held.length < MIN_SHELF) continue
-    out.push({ key, name: shelfName(held), number: 0, books: held, isMiscellany: false })
+    if (held.length >= MIN_SHELF) out.push({ key, name: shelfName(held), number: 0, books: held, isMiscellany: false })
+  }
+  let rest = books.filter(b => !out.some(s => s.books.includes(b)))
+  // The most-shared Pattern first, so a book that instances several joins the biggest group.
+  for (;;) {
+    const count = new Map<string, Book[]>()
+    for (const b of rest) for (const p of new Set(b.patterns)) count.set(p, [...(count.get(p) ?? []), b])
+    const best = [...count].sort((a, b) => b[1].length - a[1].length || a[0].localeCompare(b[0]))[0]
+    if (!best || best[1].length < MIN_SHELF) break
+    out.push({ key: `pattern:${best[0]}`, name: patternTitle(best[0]), number: 0, books: best[1], isMiscellany: false })
+    rest = rest.filter(b => !best[1].includes(b))
   }
-  const shelved = new Set(out.flatMap(s => s.books))
-  const rest = books.filter(b => !shelved.has(b))
-  if (rest.length > 0) out.push({ key: 'miscellany', name: 'miscellany', number: 0, books: rest, isMiscellany: true })
+  if (rest.length > 0) out.push({ key: 'loose', name: LOOSE, number: 0, books: rest, isMiscellany: true })
   out.forEach((s, i) => (s.number = i + 1))
   return out
 }
 
 /**
  * A community has no name of its own (the local partition's label is null), so
- * the shelf is named from what its books share: the cloud theme when the
- * community carries one; else the Pattern most of its books are INSTANCE_OF —
- * the graph's own generalisation of what those problems have in common, the
- * truest name the data offers; else its strongest problem, the shelf's exemplar.
+ * the shelf is named from what its books share: the Pattern most of its books
+ * are INSTANCE_OF — the graph's own generalisation of what those problems have
+ * in common — else its strongest problem, the shelf's exemplar. Never the cloud
+ * community's theme label: those can describe other members entirely (#43
+ * "Canvas zoom/scroll…" held SQLite busy_timeout problems).
  */
 export function shelfName(books: Book[]): string {
-  const label = books.find(b => b.communityLabel)?.communityLabel
-  if (label) return label
   const count = new Map<string, number>()
   for (const b of books) for (const p of new Set(b.patterns)) count.set(p, (count.get(p) ?? 0) + 1)
   if (count.size > 0) return patternTitle([...count].reduce((a, b) => (b[1] > a[1] ? b : a))[0])

package/resources/claude-mods/errata-minimap/hooks/register.tsx

@@ -2,7 +2,7 @@ import { atom, read, update } from 'claude-code'
 import type { EngineInterface, Register, Timer } from 'claude-code'
 
 import type { Burst, ChainFacts, MapGraph, Verdict } from '../types'
-import { BINDING_GLYPH, BINDING_NAME, bindingOf, fitTitle, focusBook, PALETTE, rasterizeLibrary } from './bookcase'
+import { BINDING_GLYPH, BINDING_NAME, bindingOf, fitTitle, focusBook, librarySpots, PALETTE, rasterizeLibrary } from './bookcase'
 import type { Binding, LibraryFrame, LibraryOptions, Room } from './bookcase'
 import { bookHolding, callNumber, catalogue, enrichTargets, parseNeighbors } from './chains'
 import type { Catalog } from './chains'
@@ -84,6 +84,10 @@ const PANE_VIEW_KEY = 'paneView'
 
 /** Rows an inline pane asks for: room for a tier of bookcases and the card without burying the transcript. */
 const INLINE_ROWS = 20
+/** Rows on a portrait terminal: the header, one tier of shelves, a short card. */
+const COMPACT_ROWS = 11
+/** The terminal's own colour in a raster cell (bit 24 alone). */
+const DEFAULT_CELL = 0x01000000
 
 const GROW_MS = 900
 const TYPE_MS = 500
@@ -191,6 +195,8 @@ async function animate($: EngineInterface): Promise<void> {
   if (!isRevealing && !motion.highlight && !isMarking) {
     motion.timer?.cancel()
     motion.timer = undefined
+    // At rest again: redraw once so the books' hover and click targets are laid (they stay off while blits run).
+    if (pane.view === 'books') $.ui.invalidate('ui.render')
   }
 }
 
@@ -522,8 +528,15 @@ export const register: Register = on => {
     const { Box, Text } = $.ui.resolve(e)
     const width = Math.max(24, e.props.bodyColumns)
     // Docked, the library takes the screen's height; inline it sits above the prompt and keeps to its row budget.
+    // A portrait terminal (taller than wide, at ~2 rows per column of width) can't dock and has the least
+    // transcript to spare, so inline there the library is compact: one tier of shelves and a short card.
     const screenRows = e.viewport?.rows ?? 30
-    const height = e.props.placement === 'inline' ? Math.max(12, Math.min(INLINE_ROWS, screenRows - 10)) : Math.max(12, screenRows - 4)
+    const isPortrait = e.props.placement === 'inline' && !!e.viewport && e.viewport.rows * 2 > e.viewport.columns
+    const height = isPortrait
+      ? Math.max(10, Math.min(COMPACT_ROWS, screenRows - 6))
+      : e.props.placement === 'inline'
+        ? Math.max(12, Math.min(INLINE_ROWS, screenRows - 10))
+        : Math.max(12, screenRows - 4)
     const map = await read($, graph)
     const hex = (color: number) => `#${color.toString(16).padStart(6, '0')}`
 
@@ -611,7 +624,8 @@ export const register: Register = on => {
     const now = await $.clock.now()
     // A verdict on a prior not on the shelves has no plank to be stamped on: it gets a line.
     const unshelved = (await read($, verdicts)).filter(v => now - v.at < VERDICT_SHOWN_MS && !bookHolding(catalog, v.id)).slice(0, 2)
-    const libraryRows = Math.max(8, height - 1 - (legend.length > 0 ? 1 : 0) - unshelved.length)
+    const showLegend = legend.length > 0 && !isPortrait
+    const libraryRows = Math.max(8, height - 1 - (showLegend ? 1 : 0) - unshelved.length)
     // Blits must match the mounted size: remember what this pass mounts.
     motion.raster = { columns: width, rows: libraryRows }
     const options = await libraryOptions($, map)
@@ -625,8 +639,73 @@ export const register: Register = on => {
         </Box>
       ) : e.surface === 'terminal' ? (
         (() => {
-          const { Raster } = $.ui.resolve(e)
-          return <Raster key="map" columns={width} rows={libraryRows} cells={rasterizeLibrary(catalog, width, libraryRows, options)} />
+          const { Raster, Button } = $.ui.resolve(e)
+          const cells = rasterizeLibrary(catalog, width, libraryRows, options)
+          // Hover and click ride on positioned replicas of each spine (same glyphs, same colours) laid
+          // over the raster, since pointer feedback attaches to elements, not cells. Laid only at rest:
+          // a reveal, a burst highlight or a flashing stamp repaints the raster by blit, which a static
+          // replica would hide.
+          const isAtRest = motion.frame.type >= 1 && !motion.highlight && Object.keys(motion.marks).length === 0
+          const spots = isAtRest ? librarySpots(catalog, width, libraryRows, options.focus) : []
+          const grid = new Uint32Array(Uint8Array.fromBase64(cells).buffer)
+          const cell = (x: number, y: number) => {
+            const i = (y * width + x) * 3
+            return { ch: String.fromCodePoint(grid[i]!), fg: grid[i + 1]!, bg: grid[i + 2]! }
+          }
+          const colourOf = (c: number) => (c === DEFAULT_CELL ? undefined : hex(c))
+          const cardWidth = Math.min(46, width - 2)
+          return (
+            <Box key="library" position="relative" width={width} height={libraryRows}>
+              <Raster key="map" columns={width} rows={libraryRows} cells={cells} />
+              {spots.map(s => {
+                const scope = `book:${s.book.key}`.slice(0, 64)
+                const parts = (['cause', 'problem', 'fix'] as const).flatMap(r => (s.book[r] ? [s.book[r]!] : []))
+                const cardHeight = parts.length + 3
+                const cardLeft = s.x + s.width + 1 + cardWidth <= width ? s.x + s.width + 1 : Math.max(0, s.x - cardWidth - 1)
+                const cardTop = Math.max(0, Math.min(s.top, libraryRows - cardHeight))
+                const pin = () => {
+                  motion.focus = s.book.problem?.id ?? s.book.memberIds[0]
+                  $.ui.invalidate('ui.render')
+                }
+                return [
+                  ...[...Array(s.height).keys()].map(r => (
+                    <Box key={`${scope}:${r}`} position="absolute" top={s.top + r} left={s.x} hover={{ scope }}>
+                      <Button key={`${scope}:press:${r}`} plain onPress={pin}>
+                        {[...Array(s.width).keys()].map(dx => {
+                          const c = cell(s.x + dx, s.top + r)
+                          return <Text color={colourOf(c.fg)} backgroundColor={colourOf(c.bg)}>{c.ch}</Text>
+                        })}
+                      </Button>
+                    </Box>
+                  )),
+                  // The hover card: what the book holds, revealed while the pointer is anywhere on its spine.
+                  <Box
+                    key={`${scope}:card`}
+                    position="absolute"
+                    top={cardTop}
+                    left={cardLeft}
+                    width={cardWidth}
+                    display="none"
+                    hover={{ scope, display: 'flex' }}
+                    flexDirection="column"
+                    borderStyle="round"
+                    borderColor={hex(palette.gilt)}
+                  >
+                    <Text bold wrap="truncate-end" color={hex(palette.binding.problem)}>
+                      {callNumber(catalog, s.book)} <Text dimColor>{s.book.tech ?? 'general'}</Text>
+                    </Text>
+                    {parts.map(part => (
+                      <Text wrap="truncate-end">
+                        <Text color={hex(palette.binding[bindingOf(part.label)])}>{BINDING_GLYPH[bindingOf(part.label)]} </Text>
+                        <Text dimColor={!part.isDelivered}>{fitTitle(part.name, cardWidth - 6)}</Text>
+                      </Text>
+                    ))}
+                    <Text dimColor wrap="truncate-end">click to read it on the card</Text>
+                  </Box>,
+                ]
+              })}
+            </Box>
+          )
         })()
       ) : (
         // No cell grid off the terminal: the catalog as a reading list, the book in focus first.
@@ -656,7 +735,7 @@ export const register: Register = on => {
           </Text>
         </Text>
         {library}
-        {legend.length > 0 && (
+        {showLegend && (
           <Text wrap="truncate-end">
             {legend.map(b => (
               <Text>

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

@@ -1,6 +1,6 @@
 {
   "name": "errata-context",
-  "version": "2.0.21-dev.3996",
+  "version": "2.0.21-dev.4004",
   "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 @@
-5e52c2053e6264cb739f4f92c174af82a478044f66ebd9e80e0fbb1a36cb1446  .codex-plugin/plugin.json
+988e2d2c901e9c5271b40684d0e30351ea8bae6c46ebb98c5067f6fb2944f1ab  .codex-plugin/plugin.json
 a7bebae9fb01c838d6c75fc784129e28be571233fa66ff5ee8039b574f35ccf7  assets/icon.png
 fc38b64e4df1e0b72c35764bef6c4c05430d97c9009ad0ecc8a9e75b4deab232  configure-local.mjs
 73dc6028b3b070257c7c31f252d11e55a9e096f4aed0f187f10cb21716e1e6d7  dist/client.js