@forwardimpact/libwiki 0.2.29 → 0.2.30

package/src/commands/refresh.js

@@ -10,8 +10,9 @@ import {
   TrackerQueryError,
   parseRepoSlug,
 } from "../issue-list-renderer.js";
+import { parseClaims, filterExpired, removeClaim } from "../active-claims.js";
 import { currentDayIso } from "../util/clock.js";
-import { resolveProjectRoot } from "../util/wiki-dir.js";
+import { resolveProjectRoot, resolveWikiRoot } from "../util/wiki-dir.js";
 
 function currentStoryboardRelPath(runtime) {
   return `wiki/storyboard-${yearMonth(currentDayIso(runtime))}.md`;
@@ -101,13 +102,42 @@ function readStoryboardOrNull(runtime, storyboardPath) {
   }
 }
 
-/** Re-render XmR chart blocks and issue-list blocks in a storyboard file. */
+// Drop every MEMORY.md `## Active Claims` row past its `expires_at`, writing the
+// trimmed table back in place. Refresh is the deterministic "freshen the wiki"
+// step, so clearing lapsed claims belongs here alongside the storyboard render;
+// it runs whether or not the storyboard has marker blocks to regenerate. The
+// write is local, mirroring the storyboard splice — the caller's push publishes
+// it. A missing wiki or claims table is a clean no-op.
+function clearExpiredClaims(runtime, options, today, logger) {
+  const memPath = path.join(resolveWikiRoot(runtime, options), "MEMORY.md");
+  if (!runtime.fsSync.existsSync(memPath)) return;
+  const text = runtime.fsSync.readFileSync(memPath, "utf-8");
+  const { expired } = filterExpired(parseClaims(text), today);
+  if (expired.length === 0) return;
+  let current = text;
+  for (const c of expired) {
+    const result = removeClaim(current, { agent: c.agent, target: c.target });
+    if (result.removed) current = result.text;
+  }
+  if (current !== text) {
+    runtime.fsSync.writeFileSync(memPath, current);
+    logger.info("refresh", `cleared ${expired.length} expired claim(s)`);
+  }
+}
+
+/**
+ * Re-render storyboard XmR/issue-list blocks and clear expired MEMORY.md claims.
+ */
 export async function runRefreshCommand(ctx) {
   const { runtime, gitClient } = ctx.deps;
   const options = ctx.options;
   const logger = createLogger("wiki", runtime);
   const projectRoot = resolveProjectRoot(runtime);
 
+  // Independent of the storyboard render below (and its early returns), so a
+  // wiki with no storyboard or no marker blocks still gets its claims swept.
+  clearExpiredClaims(runtime, options, currentDayIso(runtime), logger);
+
   const storyboardPath = path.resolve(
     projectRoot,
     ctx.args["storyboard-path"] || currentStoryboardRelPath(runtime),

package/src/commands/sync.js

@@ -19,9 +19,14 @@ export async function runPushCommand(ctx) {
   const { runtime, wikiSync } = ctx.deps;
   await wikiSync.inheritIdentity();
 
+  // A caller that knows its narrower write-set passes `--paths` (repeatable);
+  // the bare session-close invocation passes none and lands the session's own
+  // dirty set under per-session checkout isolation.
+  const paths = ctx.options?.paths?.length ? ctx.options.paths : undefined;
+
   let result;
   try {
-    result = await wikiSync.commitAndPush("wiki: update from session");
+    result = await wikiSync.commitAndPush("wiki: update from session", paths);
   } catch (err) {
     // Honest CLI contract (the honest-CLI contract): non-zero on any non-land push
     // failure, and on the ancestry guard's refusal (the ancestry guard). The Stop-hook

package/src/constants.js

@@ -48,17 +48,19 @@ export const PRIORITY_INDEX_TABLE_HEADER =
   "| Item | Agents | Owner | Status | Added |";
 export const DECISION_HEADING = "### Decision";
 
-// Unified budgets for the three audited surfaces (summary, weekly-log,
-// storyboard). They share the same numeric limits today so the
-// context-tax floor is symmetric across surfaces; each surface keeps
-// its own audit rule pair so the limits can diverge later if the
-// context-tax model says one surface should be looser or tighter.
+// Unified budgets for the audited surfaces (summary, weekly-log, storyboard,
+// memory). They keep per-surface rule pairs so the limits can diverge as the
+// context-tax model says one surface should be looser or tighter. MEMORY.md is
+// the tightest: it is read on every boot and holds settled cross-cutting state,
+// not history, so its budget is sized to keep the on-boot read cheap.
 export const SUMMARY_LINE_BUDGET = 496;
 export const SUMMARY_WORD_BUDGET = 2048;
 export const WEEKLY_LOG_LINE_BUDGET = 496;
 export const WEEKLY_LOG_WORD_BUDGET = 6400;
 export const STORYBOARD_LINE_BUDGET = 496;
 export const STORYBOARD_WORD_BUDGET = 6400;
+export const MEMORY_LINE_BUDGET = 128;
+export const MEMORY_WORD_BUDGET = 2048;
 
 // Weekly-log filename convention: `<agent>-YYYY-Www.md` for the live main log
 // and `<agent>-YYYY-Www-partN.md` for a sealed part. Capture groups are

package/src/ledger/anchor.js

@@ -0,0 +1,96 @@
+/**
+ * Allocation-anchor body format for the parallel-collision ledger. An anchor is
+ * an append-only comment on the obstacle issue, so its identity is durable
+ * independent of the merge-contested ledger page. Each anchor carries one
+ * fenced block:
+ *
+ * ```text
+ * ```yaml alloc
+ * kind: occ
+ * ids: ["#97", "#98"]
+ * event: 7d0f8bca
+ * note: dual-execution episode
+ * ```
+ * ```
+ *
+ * The block is parsed by structure, not by a general YAML engine, so libwiki
+ * adds no parser dependency. `kind` is one of `occ`, `nm`, `fold`, `meta`;
+ * `ids` is a list of display labels; `event` is the durable key (a SHA or a
+ * prior anchor id); `note` is free text. The durable key is `event`; labels are
+ * display only, so relabeling is lossless.
+ */
+
+const FENCE_OPEN = "```yaml alloc";
+const FENCE_CLOSE = "```";
+const KINDS = new Set(["occ", "nm", "fold", "meta"]);
+
+/**
+ * Parse the allocation anchor out of a comment body, or `null` when the body
+ * carries no `yaml alloc` fenced block.
+ *
+ * @param {string} body - The full comment body.
+ * @returns {{kind: string, ids: string[], event: string, note: string} | null}
+ */
+export function parseAnchor(body) {
+  if (typeof body !== "string") return null;
+  const lines = body.split("\n");
+  const open = lines.findIndex((l) => l.trim() === FENCE_OPEN);
+  if (open === -1) return null;
+  const rest = lines.slice(open + 1);
+  const close = rest.findIndex((l) => l.trim() === FENCE_CLOSE);
+  if (close === -1) return null;
+  const block = rest.slice(0, close);
+
+  const fields = {};
+  for (const line of block) {
+    const idx = line.indexOf(":");
+    if (idx === -1) continue;
+    const key = line.slice(0, idx).trim();
+    const value = line.slice(idx + 1).trim();
+    fields[key] = value;
+  }
+
+  const kind = fields.kind;
+  if (!KINDS.has(kind)) return null;
+  const ids = parseIdList(fields.ids);
+  const event = fields.event ?? "";
+  if (event === "") return null;
+  return { kind, ids, event, note: fields.note ?? "" };
+}
+
+/**
+ * Render the canonical anchor body for posting.
+ *
+ * @param {{kind: string, ids: string[], event: string, note?: string}} anchor
+ * @returns {string}
+ */
+export function renderAnchorBody({ kind, ids, event, note = "" }) {
+  if (!KINDS.has(kind)) {
+    throw new Error(`renderAnchorBody: unknown kind "${kind}"`);
+  }
+  const lines = [
+    FENCE_OPEN,
+    `kind: ${kind}`,
+    `ids: ${renderIdList(ids)}`,
+    `event: ${event}`,
+  ];
+  if (note) lines.push(`note: ${note}`);
+  lines.push(FENCE_CLOSE);
+  return lines.join("\n");
+}
+
+/** The set of valid kinds. */
+export const ANCHOR_KINDS = KINDS;
+
+function parseIdList(raw) {
+  if (!raw) return [];
+  const inner = raw.replace(/^\[/, "").replace(/\]$/, "");
+  return inner
+    .split(",")
+    .map((s) => s.trim().replace(/^["']/, "").replace(/["']$/, ""))
+    .filter(Boolean);
+}
+
+function renderIdList(ids) {
+  return `[${(ids ?? []).map((id) => `"${id}"`).join(", ")}]`;
+}

package/src/ledger/projection.js

@@ -0,0 +1,242 @@
+/**
+ * Fold the ordered allocation-anchor sequence into id assignments and render
+ * the two derived projections — the ledger page body and the MEMORY
+ * cross-cutting row. The anchor record is authoritative; these projections hold
+ * no sole-copy state and are rebuildable from it, so erasure of a projection is
+ * a cache miss repaired by rebuild, not a loss event.
+ *
+ * Identity is the `event` key; labels are display output, so a double-allocation
+ * resolves first-published-wins and the loser is re-labeled without losing any
+ * record. The labeling policy is a `labelMode` parameter: `renumber` (the
+ * default, matching the team's established convention) keeps the labels dense
+ * and re-mints the loser at the next free index; `gapped` leaves a gap so a
+ * label never moves. Both are supported; neither is forced.
+ */
+
+/**
+ * @typedef {object} AnchorRecord
+ * @property {number} id - The comment id (the serialization key).
+ * @property {string} createdAt
+ * @property {{kind: string, ids: string[], event: string, note: string}} anchor
+ */
+
+/**
+ * Fold anchors into assignments and conflicts. First-published (lowest comment
+ * `id`) wins each contested label.
+ *
+ * @param {AnchorRecord[]} anchors - Anchors in ascending `id` order.
+ * @returns {{assignments: Map<string, AnchorRecord>, conflicts: Array<{label: string, winner: AnchorRecord, losers: AnchorRecord[]}>}}
+ */
+export function foldAnchors(anchors) {
+  const assignments = new Map();
+  const contested = new Map();
+  for (const record of anchors) {
+    for (const label of record.anchor.ids) {
+      const existing = assignments.get(label);
+      if (!existing) {
+        assignments.set(label, record);
+        continue;
+      }
+      // existing was published earlier (anchors are id-ordered): it wins.
+      if (!contested.has(label)) contested.set(label, []);
+      contested.get(label).push(record);
+    }
+  }
+  const conflicts = [...contested.entries()].map(([label, losers]) => ({
+    label,
+    winner: assignments.get(label),
+    losers,
+  }));
+  return { assignments, conflicts };
+}
+
+/**
+ * Render the ledger page body from a fold. Entries are grouped by kind and
+ * ordered by their winning anchor's id. Authored prose carried by
+ * `<!-- anchor:ID -->`-cited blocks is re-emitted in anchor-id order; a cited
+ * anchor that does not exist is reported in the returned `missingProse` list,
+ * never silently dropped. `labelMode` selects the loser re-mint guidance for a
+ * double-allocation: `renumber` (default) re-mints at the next free index,
+ * `gapped` leaves the loser's index as a gap.
+ *
+ * @param {{assignments: Map, conflicts: Array}} fold
+ * @param {Array<{anchorId: number, text: string}>} [prose] - Anchor-cited prose blocks.
+ * @param {{labelMode?: "renumber" | "gapped"}} [opts]
+ * @returns {{body: string, missingProse: number[]}}
+ */
+export function renderLedgerPage(
+  fold,
+  prose = [],
+  { labelMode = "renumber" } = {},
+) {
+  const lines = [
+    "# Parallel-Collision Ledger",
+    "",
+    "Derived projection of the allocation-anchor record. Rebuilt by `fit-wiki ledger rebuild`; do not hand-edit identifiers here — allocate at an anchor.",
+    "",
+    ...renderKindSections(fold),
+    ...renderConflicts(fold, labelMode),
+  ];
+  const missingProse = appendProse(lines, fold, prose);
+  return { body: `${lines.join("\n").trimEnd()}\n`, missingProse };
+}
+
+function renderKindSections(fold) {
+  const byKind = { occ: [], nm: [], fold: [], meta: [] };
+  for (const [label, record] of fold.assignments) {
+    byKind[record.anchor.kind]?.push({ label, record });
+  }
+  const lines = [];
+  for (const [kind, heading] of KIND_HEADINGS) {
+    byKind[kind].sort((a, b) => a.record.id - b.record.id);
+    lines.push(`## ${heading}`, "");
+    for (const { label, record } of byKind[kind]) {
+      const note = record.anchor.note ? ` — ${record.anchor.note}` : "";
+      lines.push(`- ${label} (event ${record.anchor.event})${note}`);
+    }
+    lines.push("");
+  }
+  return lines;
+}
+
+function renderConflicts(fold, labelMode) {
+  if (fold.conflicts.length === 0) return [];
+  const guidance =
+    labelMode === "gapped"
+      ? "leave the contested index as a gap"
+      : "re-mint the loser at the next free index";
+  const lines = [
+    `## Double-allocations (first-published wins; ${guidance})`,
+    "",
+  ];
+  for (const c of fold.conflicts) {
+    const losers = c.losers
+      .map((l) => `${l.anchor.event} (id ${l.id})`)
+      .join(", ");
+    lines.push(
+      `- ${c.label}: winner ${c.winner.anchor.event} (id ${c.winner.id}); re-mint required for ${losers}`,
+    );
+  }
+  lines.push("");
+  return lines;
+}
+
+/**
+ * Extract `<!-- anchor:ID -->`-cited prose blocks from an existing ledger-page
+ * body so a rebuild re-emits them rather than dropping them. Each block runs
+ * from its citation marker to the next marker or end of input.
+ *
+ * @param {string} pageBody - The current ledger-page text.
+ * @returns {Array<{anchorId: number, text: string}>}
+ */
+export function extractProse(pageBody) {
+  if (!pageBody) return [];
+  const marker = /<!--\s*anchor:(\d+)\s*-->\n?/g;
+  const blocks = [];
+  let match = marker.exec(pageBody);
+  while (match) {
+    const anchorId = Number.parseInt(match[1], 10);
+    const start = match.index + match[0].length;
+    const next = marker.exec(pageBody);
+    const end = next ? next.index : pageBody.length;
+    const text = pageBody.slice(start, end).trim();
+    if (text) blocks.push({ anchorId, text });
+    match = next;
+  }
+  return blocks;
+}
+
+function appendProse(lines, fold, prose) {
+  const missingProse = [];
+  const knownIds = new Set([...fold.assignments.values()].map((r) => r.id));
+  const ordered = [...prose].sort((a, b) => a.anchorId - b.anchorId);
+  if (ordered.length === 0) return missingProse;
+  lines.push("## Conventions and floors (binding)", "");
+  for (const block of ordered) {
+    if (!knownIds.has(block.anchorId)) missingProse.push(block.anchorId);
+    lines.push(`<!-- anchor:${block.anchorId} -->`, block.text, "");
+  }
+  return missingProse;
+}
+
+/**
+ * Render the MEMORY cross-cutting row counters from a fold: next-free index per
+ * kind, plus the total assigned count.
+ *
+ * @param {{assignments: Map}} fold
+ * @returns {string}
+ */
+export function renderMemoryRow(fold) {
+  const next = {
+    occ: nextFree(fold, "occ", "#"),
+    nm: nextFree(fold, "nm", "NM"),
+    fold: nextFree(fold, "fold", "n="),
+    meta: nextFree(fold, "meta", "M"),
+  };
+  return (
+    `Parallel-collision allocation (derived from the anchor record): ` +
+    `${fold.assignments.size} ids assigned; next free #${next.occ}, NM${next.nm}, ` +
+    `n=${next.fold}, M${next.meta}. Allocate at an anchor, never by editing this row.`
+  );
+}
+
+const MEMORY_REGION_OPEN = "<!-- ledger:memory-row -->";
+const MEMORY_REGION_CLOSE = "<!-- /ledger:memory-row -->";
+const MEMORY_REGION_RE = new RegExp(
+  `${MEMORY_REGION_OPEN}\\n[\\s\\S]*?\\n${MEMORY_REGION_CLOSE}`,
+);
+
+/**
+ * Write the derived MEMORY-row counters into a delimited region of a MEMORY.md
+ * body, so the row is a rebuildable projection of the anchor record
+ * without overwriting the surrounding authored narrative. The region is the
+ * only sole-copy-free surface: its interior is fully regenerated, everything
+ * outside it is preserved byte-for-byte. If the region is absent it is appended
+ * under a heading; if present, only its interior is replaced.
+ *
+ * @param {string} memoryBody - Current `MEMORY.md` text.
+ * @param {{assignments: Map}} fold
+ * @returns {string} The updated body.
+ */
+export function writeMemoryRowRegion(memoryBody, fold) {
+  const region = `${MEMORY_REGION_OPEN}\n${renderMemoryRow(fold)}\n${MEMORY_REGION_CLOSE}`;
+  const body = memoryBody ?? "";
+  if (MEMORY_REGION_RE.test(body)) {
+    return body.replace(MEMORY_REGION_RE, region);
+  }
+  const trimmed = body.trimEnd();
+  return `${trimmed}${trimmed ? "\n\n" : ""}${region}\n`;
+}
+
+/**
+ * Extract the derived MEMORY-row region interior from a MEMORY.md body, or
+ * `null` if the region is absent. Used by `verify` to diff the projection
+ * surface alone, never the surrounding narrative.
+ *
+ * @param {string} memoryBody
+ * @returns {string|null}
+ */
+export function readMemoryRowRegion(memoryBody) {
+  const m = (memoryBody ?? "").match(MEMORY_REGION_RE);
+  if (!m) return null;
+  return m[0]
+    .replace(`${MEMORY_REGION_OPEN}\n`, "")
+    .replace(`\n${MEMORY_REGION_CLOSE}`, "");
+}
+
+const KIND_HEADINGS = [
+  ["occ", "Occurrences"],
+  ["nm", "Near-misses"],
+  ["fold", "Folds"],
+  ["meta", "Meta-instances"],
+];
+
+function nextFree(fold, kind, prefix) {
+  let max = 0;
+  for (const [label, record] of fold.assignments) {
+    if (record.anchor.kind !== kind) continue;
+    const n = Number.parseInt(label.replace(prefix, ""), 10);
+    if (Number.isFinite(n) && n > max) max = n;
+  }
+  return max + 1;
+}

package/src/ledger/reader.js

@@ -0,0 +1,45 @@
+import { parseAnchor } from "./anchor.js";
+
+/**
+ * The obstacle issue whose comment thread is the allocation-anchor surface.
+ * GitHub serializes comment creation and assigns a monotonic `id`, so that `id`
+ * order is the allocation serialization no merge can erase.
+ */
+export const DEFAULT_ANCHOR_ISSUE = 1564;
+
+/**
+ * Read every allocation anchor from the obstacle issue's comment thread, in
+ * server `id` order ascending. The lowest comment `id` claiming a given label
+ * is its winner (first published wins). Comments carrying no anchor block are
+ * skipped.
+ *
+ * @param {object} ghClient - A GhClient (or mock) exposing `apiGetPaginated`.
+ * @param {object} opts
+ * @param {string} opts.owner - Repository owner.
+ * @param {string} opts.repo - Repository name.
+ * @param {number} [opts.issue] - Issue number (defaults to the obstacle issue).
+ * @param {string} [opts.cwd] - Working directory for the gh invocation.
+ * @returns {Promise<Array<{id: number, createdAt: string, anchor: object}>>}
+ */
+export async function readAnchors(
+  ghClient,
+  { owner, repo, issue = DEFAULT_ANCHOR_ISSUE, cwd } = {},
+) {
+  if (!owner || !repo) {
+    throw new Error("readAnchors: owner and repo are required");
+  }
+  const path = `repos/${owner}/${repo}/issues/${issue}/comments`;
+  const comments = await ghClient.apiGetPaginated(path, { cwd });
+  const anchors = [];
+  for (const comment of comments ?? []) {
+    const anchor = parseAnchor(comment.body ?? "");
+    if (!anchor) continue;
+    anchors.push({
+      id: comment.id,
+      createdAt: comment.created_at,
+      anchor,
+    });
+  }
+  anchors.sort((a, b) => a.id - b.id);
+  return anchors;
+}