agentfootprint-lens 0.52.2 → 0.53.0

package/dist/{chunk-JHUSTIEW.js → chunk-BJ635YAV.js}

@@ -3022,10 +3022,189 @@ function servedRowForEpoch(recording, epoch) {
   return rowOf(recording, locations, at, false);
 }
 
+// src/core/served/sincePrevious.ts
+import { messageDigestInput } from "agentfootprint";
+
+// src/core/utils/diffPrompts.ts
+function tokenize(s) {
+  if (s.length === 0) return [];
+  const matches = s.match(/\S+|\s+/g);
+  return matches ?? [];
+}
+function lcsDiff(a, b) {
+  const n = a.length;
+  const m = b.length;
+  if (n === 0 && m === 0) return [];
+  if (n === 0) return [{ kind: "added", text: b.join("") }];
+  if (m === 0) return [{ kind: "removed", text: a.join("") }];
+  const dp = [];
+  for (let i2 = 0; i2 <= n; i2++) dp.push(new Uint32Array(m + 1));
+  for (let i2 = n - 1; i2 >= 0; i2--) {
+    for (let j2 = m - 1; j2 >= 0; j2--) {
+      if (a[i2] === b[j2]) {
+        dp[i2][j2] = dp[i2 + 1][j2 + 1] + 1;
+      } else {
+        dp[i2][j2] = Math.max(dp[i2 + 1][j2], dp[i2][j2 + 1]);
+      }
+    }
+  }
+  const segments = [];
+  let curKind;
+  let curText = "";
+  const push = (kind, text) => {
+    if (kind === curKind) {
+      curText += text;
+    } else {
+      if (curKind !== void 0 && curText.length > 0) {
+        segments.push({ kind: curKind, text: curText });
+      }
+      curKind = kind;
+      curText = text;
+    }
+  };
+  let i = 0;
+  let j = 0;
+  while (i < n && j < m) {
+    if (a[i] === b[j]) {
+      push("equal", a[i]);
+      i++;
+      j++;
+    } else if (dp[i + 1][j] >= dp[i][j + 1]) {
+      push("removed", a[i]);
+      i++;
+    } else {
+      push("added", b[j]);
+      j++;
+    }
+  }
+  while (i < n) {
+    push("removed", a[i]);
+    i++;
+  }
+  while (j < m) {
+    push("added", b[j]);
+    j++;
+  }
+  if (curKind !== void 0 && curText.length > 0) {
+    segments.push({ kind: curKind, text: curText });
+  }
+  return segments;
+}
+var DIFF_CELL_CAP = 625e4;
+function commonHead(a, b) {
+  const max = Math.min(a.length, b.length);
+  let n = 0;
+  while (n < max && a[n] === b[n]) n++;
+  return n;
+}
+function commonTail(a, b, head) {
+  const max = Math.min(a.length, b.length) - head;
+  let n = 0;
+  while (n < max && a[a.length - 1 - n] === b[b.length - 1 - n]) n++;
+  return n;
+}
+function joinSegments(parts) {
+  const out = [];
+  for (const part of parts) {
+    for (const s of part) {
+      if (s.text.length === 0) continue;
+      const last = out[out.length - 1];
+      if (last !== void 0 && last.kind === s.kind) {
+        out[out.length - 1] = { kind: last.kind, text: last.text + s.text };
+      } else {
+        out.push(s);
+      }
+    }
+  }
+  return out;
+}
+function diffPromptsBounded(a, b, maxCells = DIFF_CELL_CAP) {
+  if (a === b) {
+    return a.length === 0 ? [] : [{ kind: "equal", text: a }];
+  }
+  const ta = tokenize(a);
+  const tb = tokenize(b);
+  const head = commonHead(ta, tb);
+  const tail2 = commonTail(ta, tb, head);
+  const midA = ta.slice(head, ta.length - tail2);
+  const midB = tb.slice(head, tb.length - tail2);
+  if (midA.length * midB.length > maxCells) return void 0;
+  return joinSegments([
+    head > 0 ? [{ kind: "equal", text: ta.slice(0, head).join("") }] : [],
+    lcsDiff(midA, midB),
+    tail2 > 0 ? [{ kind: "equal", text: ta.slice(ta.length - tail2).join("") }] : []
+  ]);
+}
+
+// src/core/served/sincePrevious.ts
+function unmatchedIndexes(a, b) {
+  const pool = /* @__PURE__ */ new Map();
+  for (const item of b) pool.set(item, (pool.get(item) ?? 0) + 1);
+  const out = [];
+  for (const [i, item] of a.entries()) {
+    const n = pool.get(item) ?? 0;
+    if (n > 0) pool.set(item, n - 1);
+    else out.push(i);
+  }
+  return out;
+}
+function sincePrevious(current, previous) {
+  const now = current.view;
+  const before = previous.view;
+  const nowPieces = now.system.pieces.map((p) => p.text);
+  const beforePieces = before.system.pieces.map((p) => p.text);
+  const nowMessages = now.messages.asSent.map(messageDigestInput);
+  const beforeMessages = before.messages.asSent.map(messageDigestInput);
+  const nowNames = new Set(now.tools.names);
+  const beforeNames = new Set(before.tools.names);
+  const added = now.tools.names.filter((n) => !beforeNames.has(n));
+  const removed = before.tools.names.filter((n) => !nowNames.has(n));
+  const comparable = current.receipt !== void 0 && previous.receipt !== void 0;
+  const schemaChanged = [];
+  if (current.receipt !== void 0 && previous.receipt !== void 0) {
+    for (const name of now.tools.names) {
+      if (!beforeNames.has(name)) continue;
+      const a = current.receipt.tools?.schemaHashes?.[name];
+      const b = previous.receipt.tools?.schemaHashes?.[name];
+      if (a !== void 0 && b !== void 0 && a !== b) schemaChanged.push(name);
+    }
+  }
+  const piecesEntered = unmatchedIndexes(nowPieces, beforePieces);
+  const piecesLeft = unmatchedIndexes(beforePieces, nowPieces);
+  const messagesEntered = unmatchedIndexes(nowMessages, beforeMessages);
+  const messagesLeft = unmatchedIndexes(beforeMessages, nowMessages);
+  const changed = now.system.text !== before.system.text;
+  const diff = changed ? diffPromptsBounded(before.system.text, now.system.text) : Object.freeze([]);
+  return Object.freeze({
+    fromEpoch: previous.epoch,
+    toEpoch: current.epoch,
+    system: Object.freeze({
+      changed,
+      ...diff !== void 0 ? { diff: Object.freeze([...diff]) } : {},
+      piecesEntered: piecesEntered.length,
+      piecesLeft: piecesLeft.length,
+      enteredIndexes: Object.freeze(piecesEntered),
+      leftPieces: Object.freeze(piecesLeft.map((i) => before.system.pieces[i]))
+    }),
+    messages: Object.freeze({
+      entered: messagesEntered.length,
+      left: messagesLeft.length,
+      enteredIndexes: Object.freeze(messagesEntered),
+      leftEntries: Object.freeze(messagesLeft.map((i) => before.messages.asSent[i]))
+    }),
+    tools: Object.freeze({
+      added: Object.freeze(added),
+      removed: Object.freeze(removed),
+      schemaChanged: Object.freeze(schemaChanged),
+      schemasComparable: comparable
+    })
+  });
+}
+
 // src/core/served/verify.ts
 import * as agentfootprint2 from "agentfootprint";
 import {
-  messageDigestInput,
+  messageDigestInput as messageDigestInput2,
   receiptHash
 } from "agentfootprint";
 function toolDigestOf() {
@@ -3138,7 +3317,7 @@ function verify(view, receipt, runId, cause) {
   const messagePairs = entriesExcused ? pairMessages(view.messages.asSent, receipt.messages.entries) : byPosition(view.messages.asSent.length, receipt.messages.entries.length);
   const messages = view.messages.asSent.map(
     (message, i) => against(
-      hash(messageDigestInput(message)),
+      hash(messageDigestInput2(message)),
       receipt.messages.entries[messagePairs[i]]?.hash,
       "damaged",
       "damaged"
@@ -3152,7 +3331,7 @@ function verify(view, receipt, runId, cause) {
   const requestOnlyStatus = requestOnlyExcused ? "reconstructed" : "damaged";
   const requestOnly = view.messages.requestOnly.map(
     (line, i) => against(
-      hash(messageDigestInput({ role: line.role, content: line.text })),
+      hash(messageDigestInput2({ role: line.role, content: line.text })),
       receipt.messages.requestOnly[requestOnlyPairs[i]]?.hash,
       requestOnlyStatus,
       requestOnlyStatus
@@ -3213,185 +3392,6 @@ function verify(view, receipt, runId, cause) {
   });
 }
 
-// src/core/served/sincePrevious.ts
-import { messageDigestInput as messageDigestInput2 } from "agentfootprint";
-
-// src/core/utils/diffPrompts.ts
-function tokenize(s) {
-  if (s.length === 0) return [];
-  const matches = s.match(/\S+|\s+/g);
-  return matches ?? [];
-}
-function lcsDiff(a, b) {
-  const n = a.length;
-  const m = b.length;
-  if (n === 0 && m === 0) return [];
-  if (n === 0) return [{ kind: "added", text: b.join("") }];
-  if (m === 0) return [{ kind: "removed", text: a.join("") }];
-  const dp = [];
-  for (let i2 = 0; i2 <= n; i2++) dp.push(new Uint32Array(m + 1));
-  for (let i2 = n - 1; i2 >= 0; i2--) {
-    for (let j2 = m - 1; j2 >= 0; j2--) {
-      if (a[i2] === b[j2]) {
-        dp[i2][j2] = dp[i2 + 1][j2 + 1] + 1;
-      } else {
-        dp[i2][j2] = Math.max(dp[i2 + 1][j2], dp[i2][j2 + 1]);
-      }
-    }
-  }
-  const segments = [];
-  let curKind;
-  let curText = "";
-  const push = (kind, text) => {
-    if (kind === curKind) {
-      curText += text;
-    } else {
-      if (curKind !== void 0 && curText.length > 0) {
-        segments.push({ kind: curKind, text: curText });
-      }
-      curKind = kind;
-      curText = text;
-    }
-  };
-  let i = 0;
-  let j = 0;
-  while (i < n && j < m) {
-    if (a[i] === b[j]) {
-      push("equal", a[i]);
-      i++;
-      j++;
-    } else if (dp[i + 1][j] >= dp[i][j + 1]) {
-      push("removed", a[i]);
-      i++;
-    } else {
-      push("added", b[j]);
-      j++;
-    }
-  }
-  while (i < n) {
-    push("removed", a[i]);
-    i++;
-  }
-  while (j < m) {
-    push("added", b[j]);
-    j++;
-  }
-  if (curKind !== void 0 && curText.length > 0) {
-    segments.push({ kind: curKind, text: curText });
-  }
-  return segments;
-}
-var DIFF_CELL_CAP = 625e4;
-function commonHead(a, b) {
-  const max = Math.min(a.length, b.length);
-  let n = 0;
-  while (n < max && a[n] === b[n]) n++;
-  return n;
-}
-function commonTail(a, b, head) {
-  const max = Math.min(a.length, b.length) - head;
-  let n = 0;
-  while (n < max && a[a.length - 1 - n] === b[b.length - 1 - n]) n++;
-  return n;
-}
-function joinSegments(parts) {
-  const out = [];
-  for (const part of parts) {
-    for (const s of part) {
-      if (s.text.length === 0) continue;
-      const last = out[out.length - 1];
-      if (last !== void 0 && last.kind === s.kind) {
-        out[out.length - 1] = { kind: last.kind, text: last.text + s.text };
-      } else {
-        out.push(s);
-      }
-    }
-  }
-  return out;
-}
-function diffPromptsBounded(a, b, maxCells = DIFF_CELL_CAP) {
-  if (a === b) {
-    return a.length === 0 ? [] : [{ kind: "equal", text: a }];
-  }
-  const ta = tokenize(a);
-  const tb = tokenize(b);
-  const head = commonHead(ta, tb);
-  const tail2 = commonTail(ta, tb, head);
-  const midA = ta.slice(head, ta.length - tail2);
-  const midB = tb.slice(head, tb.length - tail2);
-  if (midA.length * midB.length > maxCells) return void 0;
-  return joinSegments([
-    head > 0 ? [{ kind: "equal", text: ta.slice(0, head).join("") }] : [],
-    lcsDiff(midA, midB),
-    tail2 > 0 ? [{ kind: "equal", text: ta.slice(ta.length - tail2).join("") }] : []
-  ]);
-}
-
-// src/core/served/sincePrevious.ts
-function unmatchedIndexes(a, b) {
-  const pool = /* @__PURE__ */ new Map();
-  for (const item of b) pool.set(item, (pool.get(item) ?? 0) + 1);
-  const out = [];
-  for (const [i, item] of a.entries()) {
-    const n = pool.get(item) ?? 0;
-    if (n > 0) pool.set(item, n - 1);
-    else out.push(i);
-  }
-  return out;
-}
-function sincePrevious(current, previous) {
-  const now = current.view;
-  const before = previous.view;
-  const nowPieces = now.system.pieces.map((p) => p.text);
-  const beforePieces = before.system.pieces.map((p) => p.text);
-  const nowMessages = now.messages.asSent.map(messageDigestInput2);
-  const beforeMessages = before.messages.asSent.map(messageDigestInput2);
-  const nowNames = new Set(now.tools.names);
-  const beforeNames = new Set(before.tools.names);
-  const added = now.tools.names.filter((n) => !beforeNames.has(n));
-  const removed = before.tools.names.filter((n) => !nowNames.has(n));
-  const comparable = current.receipt !== void 0 && previous.receipt !== void 0;
-  const schemaChanged = [];
-  if (current.receipt !== void 0 && previous.receipt !== void 0) {
-    for (const name of now.tools.names) {
-      if (!beforeNames.has(name)) continue;
-      const a = current.receipt.tools?.schemaHashes?.[name];
-      const b = previous.receipt.tools?.schemaHashes?.[name];
-      if (a !== void 0 && b !== void 0 && a !== b) schemaChanged.push(name);
-    }
-  }
-  const piecesEntered = unmatchedIndexes(nowPieces, beforePieces);
-  const piecesLeft = unmatchedIndexes(beforePieces, nowPieces);
-  const messagesEntered = unmatchedIndexes(nowMessages, beforeMessages);
-  const messagesLeft = unmatchedIndexes(beforeMessages, nowMessages);
-  const changed = now.system.text !== before.system.text;
-  const diff = changed ? diffPromptsBounded(before.system.text, now.system.text) : Object.freeze([]);
-  return Object.freeze({
-    fromEpoch: previous.epoch,
-    toEpoch: current.epoch,
-    system: Object.freeze({
-      changed,
-      ...diff !== void 0 ? { diff: Object.freeze([...diff]) } : {},
-      piecesEntered: piecesEntered.length,
-      piecesLeft: piecesLeft.length,
-      enteredIndexes: Object.freeze(piecesEntered),
-      leftPieces: Object.freeze(piecesLeft.map((i) => before.system.pieces[i]))
-    }),
-    messages: Object.freeze({
-      entered: messagesEntered.length,
-      left: messagesLeft.length,
-      enteredIndexes: Object.freeze(messagesEntered),
-      leftEntries: Object.freeze(messagesLeft.map((i) => before.messages.asSent[i]))
-    }),
-    tools: Object.freeze({
-      added: Object.freeze(added),
-      removed: Object.freeze(removed),
-      schemaChanged: Object.freeze(schemaChanged),
-      schemasComparable: comparable
-    })
-  });
-}
-
 // src/core/served/foldFactsAt.ts
 import { stateAt } from "footprintjs/trace";
 var FOLD_FACT_KEYS = Object.freeze([
@@ -4114,9 +4114,9 @@ export {
   pairEvictedTurns,
   servedRowAt,
   servedRowForEpoch,
+  sincePrevious,
   EXCUSING_GAPS,
   verify,
-  sincePrevious,
   FOLD_FACT_KEYS,
   foldFactsAt,
   SERVED_SLOTS,
@@ -4139,4 +4139,4 @@ export {
   tagStopsFor,
   tagAxisPositions
 };
-//# sourceMappingURL=chunk-JHUSTIEW.js.map
+//# sourceMappingURL=chunk-BJ635YAV.js.map