@remnic/core 1.1.1 → 1.1.3

package/dist/intent.js

@@ -5,6 +5,7 @@ import {
   isTaskInitiationIntent,
   planRecallMode
 } from "./chunk-GGD5W7TB.js";
+import "./chunk-PZ5AY32C.js";
 export {
   hasBroadGraphIntent,
   inferIntentFromText,

package/dist/json-extract.js

@@ -2,6 +2,7 @@ import {
   extractJsonCandidates,
   stripCodeFences
 } from "./chunk-UZB5KHKX.js";
+import "./chunk-PZ5AY32C.js";
 export {
   extractJsonCandidates,
   stripCodeFences

package/dist/json-store.js

@@ -3,6 +3,7 @@ import {
   listNamedFiles,
   readJsonFile
 } from "./chunk-LPSF4OQH.js";
+import "./chunk-PZ5AY32C.js";
 export {
   listJsonFiles,
   listNamedFiles,

package/dist/kdf-7S6RWKLZ.js

@@ -0,0 +1,26 @@
+import {
+  DEFAULT_ARGON2ID_PARAMS,
+  DEFAULT_SCRYPT_PARAMS,
+  KDF_KEY_LENGTH,
+  KDF_SALT_LENGTH,
+  constantTimeEqual,
+  deriveKey,
+  deriveKeyArgon2id,
+  deriveKeyScrypt,
+  validateArgon2idParams,
+  validateScryptParams
+} from "./chunk-FP2373TW.js";
+import "./chunk-PZ5AY32C.js";
+export {
+  DEFAULT_ARGON2ID_PARAMS,
+  DEFAULT_SCRYPT_PARAMS,
+  KDF_KEY_LENGTH,
+  KDF_SALT_LENGTH,
+  constantTimeEqual,
+  deriveKey,
+  deriveKeyArgon2id,
+  deriveKeyScrypt,
+  validateArgon2idParams,
+  validateScryptParams
+};
+//# sourceMappingURL=kdf-7S6RWKLZ.js.map

package/dist/kdf-7S6RWKLZ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/legacy-hook-compat.js

@@ -1,6 +1,7 @@
 import {
   compareVersions
 } from "./chunk-HL4DB7TO.js";
+import "./chunk-PZ5AY32C.js";
 
 // src/legacy-hook-compat.ts
 var FIRST_PUBLISHED_RUNTIME_WITHOUT_AGENT_HEARTBEAT = [2026, 1, 29];

package/dist/legacy-hook-compat.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/legacy-hook-compat.ts"],"sourcesContent":["import { compareVersions, type VersionTriple } from \"./version-utils.js\";\n\nconst FIRST_PUBLISHED_RUNTIME_WITHOUT_AGENT_HEARTBEAT = [2026, 1, 29] as const;\nconst OPENCLAW_VERSION_PREFIX = /^(\\d+)\\.(\\d+)\\.(\\d+)(?:-([0-9A-Za-z.-]+))?/;\n\ntype ParsedOpenClawVersion = {\n  triple: VersionTriple;\n  prerelease: boolean;\n};\n\nfunction parseOpenClawVersion(\n  value: string | undefined,\n): ParsedOpenClawVersion | null {\n  if (typeof value !== \"string\") return null;\n  const match = value.trim().match(OPENCLAW_VERSION_PREFIX);\n  if (!match) return null;\n  return {\n    triple: [\n      Number.parseInt(match[1], 10),\n      Number.parseInt(match[2], 10),\n      Number.parseInt(match[3], 10),\n    ],\n    prerelease: typeof match[4] === \"string\" && match[4].length > 0,\n  };\n}\n\nfunction parseOpenClawVersionTriple(\n  value: string | undefined,\n): VersionTriple | null {\n  return parseOpenClawVersion(value)?.triple ?? null;\n}\n\nexport function shouldRegisterTypedAgentHeartbeat(\n  runtimeVersion: string | undefined,\n): boolean {\n  const parsed = parseOpenClawVersion(runtimeVersion);\n  if (!parsed) return false;\n  const comparison = compareVersions(\n    parsed.triple,\n    FIRST_PUBLISHED_RUNTIME_WITHOUT_AGENT_HEARTBEAT,\n  );\n  if (comparison < 0) return true;\n  if (comparison > 0) return false;\n  return parsed.prerelease;\n}\n"],"mappings":";;;;;AAEA,IAAM,kDAAkD,CAAC,MAAM,GAAG,EAAE;AACpE,IAAM,0BAA0B;AAOhC,SAAS,qBACP,OAC8B;AAC9B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,QAAQ,MAAM,KAAK,EAAE,MAAM,uBAAuB;AACxD,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,MAC5B,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,MAC5B,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,IAC9B;AAAA,IACA,YAAY,OAAO,MAAM,CAAC,MAAM,YAAY,MAAM,CAAC,EAAE,SAAS;AAAA,EAChE;AACF;AAQO,SAAS,kCACd,gBACS;AACT,QAAM,SAAS,qBAAqB,cAAc;AAClD,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,aAAa;AAAA,IACjB,OAAO;AAAA,IACP;AAAA,EACF;AACA,MAAI,aAAa,EAAG,QAAO;AAC3B,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO,OAAO;AAChB;","names":[]}
+{"version":3,"sources":["../src/legacy-hook-compat.ts"],"sourcesContent":["import { compareVersions, type VersionTriple } from \"./version-utils.js\";\n\nconst FIRST_PUBLISHED_RUNTIME_WITHOUT_AGENT_HEARTBEAT = [2026, 1, 29] as const;\nconst OPENCLAW_VERSION_PREFIX = /^(\\d+)\\.(\\d+)\\.(\\d+)(?:-([0-9A-Za-z.-]+))?/;\n\ntype ParsedOpenClawVersion = {\n  triple: VersionTriple;\n  prerelease: boolean;\n};\n\nfunction parseOpenClawVersion(\n  value: string | undefined,\n): ParsedOpenClawVersion | null {\n  if (typeof value !== \"string\") return null;\n  const match = value.trim().match(OPENCLAW_VERSION_PREFIX);\n  if (!match) return null;\n  return {\n    triple: [\n      Number.parseInt(match[1], 10),\n      Number.parseInt(match[2], 10),\n      Number.parseInt(match[3], 10),\n    ],\n    prerelease: typeof match[4] === \"string\" && match[4].length > 0,\n  };\n}\n\nfunction parseOpenClawVersionTriple(\n  value: string | undefined,\n): VersionTriple | null {\n  return parseOpenClawVersion(value)?.triple ?? null;\n}\n\nexport function shouldRegisterTypedAgentHeartbeat(\n  runtimeVersion: string | undefined,\n): boolean {\n  const parsed = parseOpenClawVersion(runtimeVersion);\n  if (!parsed) return false;\n  const comparison = compareVersions(\n    parsed.triple,\n    FIRST_PUBLISHED_RUNTIME_WITHOUT_AGENT_HEARTBEAT,\n  );\n  if (comparison < 0) return true;\n  if (comparison > 0) return false;\n  return parsed.prerelease;\n}\n"],"mappings":";;;;;;AAEA,IAAM,kDAAkD,CAAC,MAAM,GAAG,EAAE;AACpE,IAAM,0BAA0B;AAOhC,SAAS,qBACP,OAC8B;AAC9B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,QAAQ,MAAM,KAAK,EAAE,MAAM,uBAAuB;AACxD,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO;AAAA,IACL,QAAQ;AAAA,MACN,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,MAC5B,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,MAC5B,OAAO,SAAS,MAAM,CAAC,GAAG,EAAE;AAAA,IAC9B;AAAA,IACA,YAAY,OAAO,MAAM,CAAC,MAAM,YAAY,MAAM,CAAC,EAAE,SAAS;AAAA,EAChE;AACF;AAQO,SAAS,kCACd,gBACS;AACT,QAAM,SAAS,qBAAqB,cAAc;AAClD,MAAI,CAAC,OAAQ,QAAO;AACpB,QAAM,aAAa;AAAA,IACjB,OAAO;AAAA,IACP;AAAA,EACF;AACA,MAAI,aAAa,EAAG,QAAO;AAC3B,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO,OAAO;AAChB;","names":[]}

package/dist/lifecycle.js

@@ -8,6 +8,7 @@ import {
   decideLifecycleTransition,
   resolveLifecycleState
 } from "./chunk-TBBDFYXW.js";
+import "./chunk-PZ5AY32C.js";
 export {
   clamp01,
   clampLifecycleThreshold,

package/dist/live-connectors-runner.d.ts

@@ -0,0 +1,48 @@
+import { L as LiveConnector, C as ConnectorConfig, a as ConnectorDocument } from './framework-CyHYDcri.js';
+import { LiveConnectorsConfig } from './types.js';
+
+type LiveConnectorSkipReason = "disabled" | "not_due" | "invalid_config" | "state_read_error" | "connector_error";
+interface LiveConnectorRunItem {
+    id: string;
+    displayName: string;
+    enabled: boolean;
+    ran: boolean;
+    skippedReason?: LiveConnectorSkipReason;
+    docsImported: number;
+    error?: string;
+    stateWriteError?: string;
+    lastSyncAt: string | null;
+    nextDueAt: string | null;
+}
+interface LiveConnectorsRunSummary {
+    ranAt: string;
+    force: boolean;
+    totalDocsImported: number;
+    ranCount: number;
+    skippedCount: number;
+    errorCount: number;
+    results: LiveConnectorRunItem[];
+}
+interface LiveConnectorDefinition {
+    id: string;
+    displayName: string;
+    enabled: boolean;
+    pollIntervalMs: number;
+    rawConfig: unknown;
+    createConnector: () => LiveConnector;
+    validateConfig: (raw: unknown) => ConnectorConfig;
+}
+type LiveConnectorsNow = Date | (() => Date);
+declare function builtInLiveConnectorDefinitions(config: LiveConnectorsConfig): LiveConnectorDefinition[];
+declare function hasEnabledLiveConnector(config: LiveConnectorsConfig): boolean;
+declare function runLiveConnectorsOnce(options: {
+    memoryDir: string;
+    connectors: LiveConnectorsConfig;
+    ingestDocuments: (docs: ConnectorDocument[]) => Promise<void>;
+    force?: boolean;
+    now?: LiveConnectorsNow;
+    abortSignal?: AbortSignal;
+    definitions?: LiveConnectorDefinition[];
+}): Promise<LiveConnectorsRunSummary>;
+
+export { type LiveConnectorDefinition, type LiveConnectorRunItem, type LiveConnectorSkipReason, type LiveConnectorsRunSummary, builtInLiveConnectorDefinitions, hasEnabledLiveConnector, runLiveConnectorsOnce };

package/dist/live-connectors-runner.js

@@ -0,0 +1,17 @@
+import {
+  builtInLiveConnectorDefinitions,
+  hasEnabledLiveConnector,
+  runLiveConnectorsOnce
+} from "./chunk-ASIQZXYO.js";
+import "./chunk-L2IO2QPY.js";
+import "./chunk-6TBWYBJ3.js";
+import "./chunk-OZHRDTDX.js";
+import "./chunk-IXEJRKCZ.js";
+import "./chunk-MARWOCVP.js";
+import "./chunk-PZ5AY32C.js";
+export {
+  builtInLiveConnectorDefinitions,
+  hasEnabledLiveConnector,
+  runLiveConnectorsOnce
+};
+//# sourceMappingURL=live-connectors-runner.js.map

package/dist/live-connectors-runner.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/local-llm.js

@@ -1,9 +1,10 @@
 import {
   LocalLlmClient
-} from "./chunk-JL2PU6AI.js";
-import "./chunk-LK6SGL53.js";
+} from "./chunk-R2XRID2N.js";
+import "./chunk-OR64ZGRZ.js";
 import "./chunk-MARWOCVP.js";
 import "./chunk-2ODBA7MQ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   LocalLlmClient
 };

package/dist/logger.js

@@ -2,6 +2,7 @@ import {
   initLogger,
   log
 } from "./chunk-2ODBA7MQ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   initLogger,
   log

package/dist/memory-action-policy.js

@@ -1,6 +1,7 @@
 import {
   evaluateMemoryActionPolicy
 } from "./chunk-H63EDPFJ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   evaluateMemoryActionPolicy
 };

package/dist/memory-cache.d.ts

@@ -8,6 +8,7 @@ declare function getCachedArchivedMemories(baseDir: string, currentVersion: numb
 declare function setCachedArchivedMemories(baseDir: string, memories: MemoryFile[], version: number): void;
 declare function getCachedEntities(baseDir: string, currentVersion: number, schemaKey?: string): EntityFile[] | null;
 declare function setCachedEntities(baseDir: string, entities: EntityFile[], version: number, schemaKey?: string): void;
+declare function invalidateCachedEntities(baseDir: string): void;
 /** Get a pre-filtered Map of episode memories (keyed by ID). Derived from hot cache. */
 declare function getCachedEpisodeMap(baseDir: string, currentVersion: number): Map<string, MemoryFile> | null;
 /** Build and cache the episode memory map from the full memory list. */
@@ -32,4 +33,4 @@ declare function getMemoryCacheStats(baseDir: string): {
     archiveVersion: number | null;
 };
 
-export { clearMemoryCache, getCachedArchivedMemories, getCachedEntities, getCachedEpisodeMap, getCachedMemories, getCachedQmdSearch, getCachedRuleMemories, getMemoryCacheStats, setCachedArchivedMemories, setCachedEntities, setCachedEpisodeMap, setCachedMemories, setCachedQmdSearch, setCachedRuleMemories, updateCacheOnDelete, updateCacheOnWrite };
+export { clearMemoryCache, getCachedArchivedMemories, getCachedEntities, getCachedEpisodeMap, getCachedMemories, getCachedQmdSearch, getCachedRuleMemories, getMemoryCacheStats, invalidateCachedEntities, setCachedArchivedMemories, setCachedEntities, setCachedEpisodeMap, setCachedMemories, setCachedQmdSearch, setCachedRuleMemories, updateCacheOnDelete, updateCacheOnWrite };

package/dist/memory-cache.js

@@ -7,6 +7,7 @@ import {
   getCachedQmdSearch,
   getCachedRuleMemories,
   getMemoryCacheStats,
+  invalidateCachedEntities,
   setCachedArchivedMemories,
   setCachedEntities,
   setCachedEpisodeMap,
@@ -15,7 +16,8 @@ import {
   setCachedRuleMemories,
   updateCacheOnDelete,
   updateCacheOnWrite
-} from "./chunk-6PFRXT4K.js";
+} from "./chunk-PFV5C235.js";
+import "./chunk-PZ5AY32C.js";
 export {
   clearMemoryCache,
   getCachedArchivedMemories,
@@ -25,6 +27,7 @@ export {
   getCachedQmdSearch,
   getCachedRuleMemories,
   getMemoryCacheStats,
+  invalidateCachedEntities,
   setCachedArchivedMemories,
   setCachedEntities,
   setCachedEpisodeMap,

package/dist/memory-governance-KG52RITE.js

@@ -0,0 +1,37 @@
+import {
+  buildProposedActions,
+  buildQualityScore,
+  groupActionsByStatus,
+  listMemoryGovernanceRuns,
+  readMemoryGovernanceRunArtifact,
+  restoreMemoryGovernanceRun,
+  runMemoryGovernance
+} from "./chunk-LZRYQK6L.js";
+import "./chunk-TBBDFYXW.js";
+import "./chunk-DCE6SQLA.js";
+import "./chunk-YNJHCGDT.js";
+import "./chunk-4KAN3GZ3.js";
+import "./chunk-43EKP2UK.js";
+import "./chunk-PFV5C235.js";
+import "./chunk-RULE4VG5.js";
+import "./chunk-SCU65EZI.js";
+import "./chunk-BOUYNNYD.js";
+import "./chunk-DM2T26WE.js";
+import "./chunk-QSVPYQPG.js";
+import "./chunk-M62O4P4T.js";
+import "./chunk-4DJQYKMN.js";
+import "./chunk-G7D6GZ5J.js";
+import "./chunk-FAAFWE4G.js";
+import "./chunk-2ODBA7MQ.js";
+import "./chunk-A6XUJE5D.js";
+import "./chunk-PZ5AY32C.js";
+export {
+  buildProposedActions,
+  buildQualityScore,
+  groupActionsByStatus,
+  listMemoryGovernanceRuns,
+  readMemoryGovernanceRunArtifact,
+  restoreMemoryGovernanceRun,
+  runMemoryGovernance
+};
+//# sourceMappingURL=memory-governance-KG52RITE.js.map

package/dist/memory-governance-KG52RITE.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/memory-lifecycle-ledger-utils.d.ts

@@ -5,9 +5,10 @@ declare const MEMORY_LIFECYCLE_EVENT_SORT_ORDER: Record<MemoryLifecycleEventType
 declare function toMemoryPathRel(baseDir: string, filePath: string): string;
 declare function isArchivedMemoryPath(pathRel: string): boolean;
 declare function inferMemoryStatus(frontmatter: MemoryFrontmatter, pathRel: string, fallbackStatus?: MemoryStatus): MemoryStatus;
+declare function isActiveMemoryStatus(status: MemoryStatus | string | undefined): boolean;
 declare function summarizeMemoryLifecycleState(memory: MemoryFile): MemoryLifecycleStateSummary;
 declare function makeRebuiltMemoryLifecycleEvent(memory: MemoryFile, eventType: MemoryLifecycleEventType, timestamp: string): MemoryLifecycleEvent;
 declare function buildLifecycleEventsForMemory(memory: MemoryFile): MemoryLifecycleEvent[];
 declare function sortMemoryLifecycleEvents(events: MemoryLifecycleEvent[]): MemoryLifecycleEvent[];
 
-export { MEMORY_LIFECYCLE_EVENT_SORT_ORDER, MEMORY_LIFECYCLE_RULE_VERSION, buildLifecycleEventsForMemory, inferMemoryStatus, isArchivedMemoryPath, makeRebuiltMemoryLifecycleEvent, sortMemoryLifecycleEvents, summarizeMemoryLifecycleState, toMemoryPathRel };
+export { MEMORY_LIFECYCLE_EVENT_SORT_ORDER, MEMORY_LIFECYCLE_RULE_VERSION, buildLifecycleEventsForMemory, inferMemoryStatus, isActiveMemoryStatus, isArchivedMemoryPath, makeRebuiltMemoryLifecycleEvent, sortMemoryLifecycleEvents, summarizeMemoryLifecycleState, toMemoryPathRel };

package/dist/memory-lifecycle-ledger-utils.js

@@ -3,17 +3,20 @@ import {
   MEMORY_LIFECYCLE_RULE_VERSION,
   buildLifecycleEventsForMemory,
   inferMemoryStatus,
+  isActiveMemoryStatus,
   isArchivedMemoryPath,
   makeRebuiltMemoryLifecycleEvent,
   sortMemoryLifecycleEvents,
   summarizeMemoryLifecycleState,
   toMemoryPathRel
-} from "./chunk-TP4FZJIZ.js";
+} from "./chunk-RULE4VG5.js";
+import "./chunk-PZ5AY32C.js";
 export {
   MEMORY_LIFECYCLE_EVENT_SORT_ORDER,
   MEMORY_LIFECYCLE_RULE_VERSION,
   buildLifecycleEventsForMemory,
   inferMemoryStatus,
+  isActiveMemoryStatus,
   isArchivedMemoryPath,
   makeRebuiltMemoryLifecycleEvent,
   sortMemoryLifecycleEvents,

package/dist/memory-projection-format.js

@@ -2,6 +2,7 @@ import {
   normalizeProjectionPreview,
   normalizeProjectionTags
 } from "./chunk-SCU65EZI.js";
+import "./chunk-PZ5AY32C.js";
 export {
   normalizeProjectionPreview,
   normalizeProjectionTags

package/dist/{memory-projection-store-DeSXPh1j.d.ts → memory-projection-store-D3vBHS4J.d.ts}

@@ -82,6 +82,7 @@ interface MemoryGovernanceRunResult {
     runId: string;
     traceId: string;
     mode: MemoryGovernanceMode;
+    summary: MemoryGovernanceSummary;
     summaryPath: string;
     reviewQueuePath: string;
     qualityScorePath: string;

package/dist/memory-projection-store.d.ts

@@ -1,3 +1,3 @@
-export { k as MEMORY_PROJECTION_SCHEMA_VERSION, l as MemoryProjectionGovernanceAppliedActionRow, m as MemoryProjectionGovernanceReviewQueueRow, n as ProjectedEntityMentionRow, P as ProjectedMemoryBrowseOptions, a as ProjectedMemoryBrowsePage, o as ProjectedMemoryBrowseRow, p as ProjectedNativeKnowledgeChunkRow, q as ProjectedReviewQueueSnapshot, s as getMemoryProjectionPath, t as initializeMemoryProjectionDb, u as memoryCurrentSelectExpressions, v as parseCurrentRow, w as parseTimelineRows, x as readProjectedEntityMentions, b as readProjectedGovernanceRecord, y as readProjectedLatestReviewQueue, z as readProjectedMemoryBrowse, A as readProjectedMemoryState, B as readProjectedMemoryTimeline, C as readProjectedNativeKnowledgeChunks } from './memory-projection-store-DeSXPh1j.js';
+export { k as MEMORY_PROJECTION_SCHEMA_VERSION, l as MemoryProjectionGovernanceAppliedActionRow, m as MemoryProjectionGovernanceReviewQueueRow, n as ProjectedEntityMentionRow, P as ProjectedMemoryBrowseOptions, a as ProjectedMemoryBrowsePage, o as ProjectedMemoryBrowseRow, p as ProjectedNativeKnowledgeChunkRow, q as ProjectedReviewQueueSnapshot, s as getMemoryProjectionPath, t as initializeMemoryProjectionDb, u as memoryCurrentSelectExpressions, v as parseCurrentRow, w as parseTimelineRows, x as readProjectedEntityMentions, b as readProjectedGovernanceRecord, y as readProjectedLatestReviewQueue, z as readProjectedMemoryBrowse, A as readProjectedMemoryState, B as readProjectedMemoryTimeline, C as readProjectedNativeKnowledgeChunks } from './memory-projection-store-D3vBHS4J.js';
 import './types.js';
 import 'better-sqlite3';

package/dist/memory-projection-store.js

@@ -13,6 +13,7 @@ import {
   readProjectedMemoryTimeline,
   readProjectedNativeKnowledgeChunks
 } from "./chunk-BOUYNNYD.js";
+import "./chunk-PZ5AY32C.js";
 export {
   MEMORY_PROJECTION_SCHEMA_VERSION,
   getMemoryProjectionPath,

package/dist/memory-worth-bench.js

@@ -2,6 +2,7 @@ import {
   applyMemoryWorthFilter
 } from "./chunk-3GPTTA4J.js";
 import "./chunk-IISBCCWR.js";
+import "./chunk-PZ5AY32C.js";
 
 // src/memory-worth-bench.ts
 function mulberry32(seed) {

package/dist/memory-worth-bench.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/memory-worth-bench.ts"],"sourcesContent":["/**\n * Issue #560 PR 5 — Memory Worth recall filter benchmark.\n *\n * Self-contained precision benchmark for `applyMemoryWorthFilter`. Seeds a\n * synthetic corpus where a small subset of memories have known-bad outcome\n * history, then compares top-K precision with the filter off vs. on.\n *\n * Why a dedicated in-package file (rather than the full `@remnic/bench`\n * harness): the filter is a pure function over candidate scores and counter\n * data; it doesn't need QMD, the orchestrator, or the schema-tier fixtures.\n * Running it as a plain `tsx` script keeps the signal tight — any drift in\n * the scorer's math shows up as a precision delta here, no integration\n * wiring required.\n *\n * The `runMemoryWorthBench()` export is the programmatic entry point;\n * `runMemoryWorthBenchCli()` is what `tsx` calls when this file is executed\n * directly. Both return (or print) a structured result so CI can gate on\n * it if we later want to.\n *\n * Verdict for PR 5: run the bench once, confirm filter-on ≥ filter-off on\n * precision@K across every seed, and only then flip the default to `true`.\n */\n\nimport {\n  applyMemoryWorthFilter,\n  type MemoryWorthCounters,\n} from \"./memory-worth-filter.js\";\n\n/**\n * One synthetic query + candidate pool + relevance labels.\n *\n * Candidates are scored by the pretend retrieval tier (`baseScore`); the\n * ground-truth relevance is `isRelevant`; `counters` seeds each candidate's\n * outcome history. Some \"bad\" candidates have baseline scores just above\n * the \"good\" candidates — the filter should be able to demote them.\n */\ninterface BenchCase {\n  id: string;\n  candidates: {\n    path: string;\n    baseScore: number;\n    isRelevant: boolean;\n    counters?: MemoryWorthCounters;\n  }[];\n  /** Top-K used for precision@K. */\n  k: number;\n}\n\n/**\n * Deterministic pseudo-random number generator (mulberry32) so the bench\n * produces identical results across runs, making precision changes easy to\n * attribute to code rather than seed drift.\n */\nfunction mulberry32(seed: number): () => number {\n  let t = seed >>> 0;\n  return () => {\n    t = (t + 0x6d2b79f5) >>> 0;\n    let r = t;\n    r = Math.imul(r ^ (r >>> 15), r | 1);\n    r ^= r + Math.imul(r ^ (r >>> 7), r | 61);\n    return ((r ^ (r >>> 14)) >>> 0) / 4294967296;\n  };\n}\n\n/**\n * Generate a synthetic test case.\n *\n * Corpus design:\n *   - 20 candidates per case.\n *   - Top 5 by base score include 2 \"traps\" — memories that the retriever\n *     ranks highly but whose outcome history is 10/0 failures. These should\n *     be sunk by the filter.\n *   - 3 lower-ranked memories are genuinely relevant with 10/0 success\n *     history. The filter should promote them into the top 5.\n *   - Remaining 15 are noise at the neutral prior (no counter data).\n *\n * `k = 5`, so the ideal precision@K is 3/5 = 0.6 (three genuinely relevant\n * items, after filter promotion). Without the filter, precision@5 is 0/5\n * because the top 5 by base score are the 2 traps + 3 irrelevant neutral\n * items.\n */\nfunction buildCase(caseIndex: number, rng: () => number): BenchCase {\n  const candidates: BenchCase[\"candidates\"] = [];\n  // 2 high-ranked traps: high base score, bad outcome history, NOT relevant.\n  for (let i = 0; i < 2; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-trap-${i}.md`,\n      baseScore: 0.95 - i * 0.02,\n      isRelevant: false,\n      counters: { mw_success: 0, mw_fail: 10 },\n    });\n  }\n  // 3 high-ranked irrelevant neutral items.\n  for (let i = 0; i < 3; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-noise-high-${i}.md`,\n      baseScore: 0.9 - i * 0.02,\n      isRelevant: false,\n    });\n  }\n  // 3 lower-ranked TRUE POSITIVES with strong success history — the filter\n  // must float these into the top 5.\n  for (let i = 0; i < 3; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-gold-${i}.md`,\n      baseScore: 0.7 - i * 0.05,\n      isRelevant: true,\n      counters: { mw_success: 10, mw_fail: 0 },\n    });\n  }\n  // 12 irrelevant noise candidates at random lower scores.\n  for (let i = 0; i < 12; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-noise-low-${i}.md`,\n      baseScore: rng() * 0.5,\n      isRelevant: false,\n    });\n  }\n  // Shuffle to remove any input-order bias.\n  for (let i = candidates.length - 1; i > 0; i -= 1) {\n    const j = Math.floor(rng() * (i + 1));\n    [candidates[i], candidates[j]] = [candidates[j]!, candidates[i]!];\n  }\n  return { id: `case-${caseIndex}`, candidates, k: 5 };\n}\n\nfunction computePrecisionAtK(\n  orderedPaths: string[],\n  relevant: Set<string>,\n  k: number,\n): number {\n  const topK = orderedPaths.slice(0, k);\n  if (topK.length === 0) return 0;\n  let hits = 0;\n  for (const p of topK) if (relevant.has(p)) hits += 1;\n  return hits / Math.min(k, topK.length);\n}\n\nexport interface MemoryWorthBenchResult {\n  cases: number;\n  k: number;\n  /** Mean precision@K with the filter disabled. */\n  precisionAtK_off: number;\n  /** Mean precision@K with the filter enabled. */\n  precisionAtK_on: number;\n  /** `on - off`; positive means filter helps, zero means tied. */\n  delta: number;\n  /** Filter-on wins at least as often as it loses, case-by-case. */\n  filterWinsOrTies: boolean;\n}\n\n/**\n * Run the benchmark over N synthetic cases using a fixed PRNG seed. Returns\n * aggregate precision numbers + a boolean verdict.\n */\nexport function runMemoryWorthBench(options?: {\n  cases?: number;\n  seed?: number;\n  now?: Date;\n}): MemoryWorthBenchResult {\n  const requestedCases = options?.cases ?? 50;\n  // Reject non-positive-integer case counts. Passing 0 would divide by zero\n  // and produce a NaN precision that the `filterWinsOrTies` boolean would\n  // still mark as `true` — dangerously misleading since this result is used\n  // to justify the default flip. Fractional values would inflate precision\n  // because the loop rounds up (Array.from ceil) but the average divides\n  // by the fractional input.\n  if (\n    !Number.isFinite(requestedCases) ||\n    !Number.isInteger(requestedCases) ||\n    requestedCases < 1\n  ) {\n    throw new Error(\n      `runMemoryWorthBench: cases must be a positive integer; got ${requestedCases}`,\n    );\n  }\n  const numCases = requestedCases;\n  const rng = mulberry32(options?.seed ?? 0xdeadbeef);\n  const now = options?.now ?? new Date(\"2026-01-01T00:00:00.000Z\");\n\n  let sumOff = 0;\n  let sumOn = 0;\n  let onWinsOrTies = 0;\n\n  for (let i = 0; i < numCases; i += 1) {\n    const c = buildCase(i, rng);\n    const relevant = new Set(\n      c.candidates.filter((x) => x.isRelevant).map((x) => x.path),\n    );\n\n    // Filter OFF: sort by baseScore descending.\n    const off = [...c.candidates]\n      .sort((a, b) => b.baseScore - a.baseScore)\n      .map((x) => x.path);\n    const pOff = computePrecisionAtK(off, relevant, c.k);\n\n    // Filter ON: build counter map and apply the filter.\n    const counters = new Map<string, MemoryWorthCounters>();\n    for (const cand of c.candidates) {\n      if (cand.counters) counters.set(cand.path, cand.counters);\n    }\n    const filtered = applyMemoryWorthFilter(\n      c.candidates.map((x) => ({ path: x.path, score: x.baseScore })),\n      { counters, now },\n    );\n    const on = filtered.map((x) => x.path);\n    const pOn = computePrecisionAtK(on, relevant, c.k);\n\n    sumOff += pOff;\n    sumOn += pOn;\n    if (pOn >= pOff) onWinsOrTies += 1;\n  }\n\n  const avgOff = sumOff / numCases;\n  const avgOn = sumOn / numCases;\n  return {\n    cases: numCases,\n    k: 5,\n    precisionAtK_off: avgOff,\n    precisionAtK_on: avgOn,\n    delta: avgOn - avgOff,\n    filterWinsOrTies: onWinsOrTies === numCases,\n  };\n}\n\n/**\n * CLI entry point — run the bench and print a structured result. Exits\n * non-zero if the filter ever loses to the no-filter baseline (so CI can\n * gate on this in the future).\n */\nexport function runMemoryWorthBenchCli(): void {\n  const result = runMemoryWorthBench();\n  // eslint-disable-next-line no-console\n  console.log(JSON.stringify(result, null, 2));\n  if (!result.filterWinsOrTies) {\n    // eslint-disable-next-line no-console\n    console.error(\"memory-worth bench: filter lost to no-filter baseline on at least one case\");\n    process.exit(1);\n  }\n}\n\n// When this file is invoked directly (e.g. `tsx memory-worth-bench.ts`),\n// run the CLI. Use url.pathToFileURL to produce a normalized file:// URL\n// from `process.argv[1]` — that handles Windows drive letters,\n// URL-encoded characters (spaces, etc.), and symlinked entrypoints. A\n// naïve `file://${process.argv[1]}` comparison fails on all three and\n// would silently skip runMemoryWorthBenchCli() on those platforms.\nif (process.argv[1]) {\n  try {\n    // Lazy import so this file can still be loaded in environments that\n    // don't have node:url (browsers, Deno test runners in some modes).\n    const { pathToFileURL } = await import(\"node:url\");\n    if (import.meta.url === pathToFileURL(process.argv[1]).href) {\n      runMemoryWorthBenchCli();\n    }\n  } catch {\n    // If the normalization fails for any reason, fall back to the naive\n    // comparison. Worse case: the bench doesn't auto-run; callers can\n    // always invoke `runMemoryWorthBenchCli()` or `runMemoryWorthBench()`\n    // explicitly.\n    if (import.meta.url === `file://${process.argv[1]}`) {\n      runMemoryWorthBenchCli();\n    }\n  }\n}\n"],"mappings":";;;;;;AAqDA,SAAS,WAAW,MAA4B;AAC9C,MAAI,IAAI,SAAS;AACjB,SAAO,MAAM;AACX,QAAK,IAAI,eAAgB;AACzB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;AAmBA,SAAS,UAAU,WAAmB,KAA8B;AAClE,QAAM,aAAsC,CAAC;AAE7C,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,SAAS,CAAC;AAAA,MACjC,WAAW,OAAO,IAAI;AAAA,MACtB,YAAY;AAAA,MACZ,UAAU,EAAE,YAAY,GAAG,SAAS,GAAG;AAAA,IACzC,CAAC;AAAA,EACH;AAEA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,eAAe,CAAC;AAAA,MACvC,WAAW,MAAM,IAAI;AAAA,MACrB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AAGA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,SAAS,CAAC;AAAA,MACjC,WAAW,MAAM,IAAI;AAAA,MACrB,YAAY;AAAA,MACZ,UAAU,EAAE,YAAY,IAAI,SAAS,EAAE;AAAA,IACzC,CAAC;AAAA,EACH;AAEA,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC9B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,cAAc,CAAC;AAAA,MACtC,WAAW,IAAI,IAAI;AAAA,MACnB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AAEA,WAAS,IAAI,WAAW,SAAS,GAAG,IAAI,GAAG,KAAK,GAAG;AACjD,UAAM,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE;AACpC,KAAC,WAAW,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAI,WAAW,CAAC,CAAE;AAAA,EAClE;AACA,SAAO,EAAE,IAAI,QAAQ,SAAS,IAAI,YAAY,GAAG,EAAE;AACrD;AAEA,SAAS,oBACP,cACA,UACA,GACQ;AACR,QAAM,OAAO,aAAa,MAAM,GAAG,CAAC;AACpC,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI,OAAO;AACX,aAAW,KAAK,KAAM,KAAI,SAAS,IAAI,CAAC,EAAG,SAAQ;AACnD,SAAO,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM;AACvC;AAmBO,SAAS,oBAAoB,SAIT;AACzB,QAAM,iBAAiB,SAAS,SAAS;AAOzC,MACE,CAAC,OAAO,SAAS,cAAc,KAC/B,CAAC,OAAO,UAAU,cAAc,KAChC,iBAAiB,GACjB;AACA,UAAM,IAAI;AAAA,MACR,8DAA8D,cAAc;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,WAAW;AACjB,QAAM,MAAM,WAAW,SAAS,QAAQ,UAAU;AAClD,QAAM,MAAM,SAAS,OAAO,oBAAI,KAAK,0BAA0B;AAE/D,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,MAAI,eAAe;AAEnB,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK,GAAG;AACpC,UAAM,IAAI,UAAU,GAAG,GAAG;AAC1B,UAAM,WAAW,IAAI;AAAA,MACnB,EAAE,WAAW,OAAO,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IAC5D;AAGA,UAAM,MAAM,CAAC,GAAG,EAAE,UAAU,EACzB,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EACxC,IAAI,CAAC,MAAM,EAAE,IAAI;AACpB,UAAM,OAAO,oBAAoB,KAAK,UAAU,EAAE,CAAC;AAGnD,UAAM,WAAW,oBAAI,IAAiC;AACtD,eAAW,QAAQ,EAAE,YAAY;AAC/B,UAAI,KAAK,SAAU,UAAS,IAAI,KAAK,MAAM,KAAK,QAAQ;AAAA,IAC1D;AACA,UAAM,WAAW;AAAA,MACf,EAAE,WAAW,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,OAAO,EAAE,UAAU,EAAE;AAAA,MAC9D,EAAE,UAAU,IAAI;AAAA,IAClB;AACA,UAAM,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AACrC,UAAM,MAAM,oBAAoB,IAAI,UAAU,EAAE,CAAC;AAEjD,cAAU;AACV,aAAS;AACT,QAAI,OAAO,KAAM,iBAAgB;AAAA,EACnC;AAEA,QAAM,SAAS,SAAS;AACxB,QAAM,QAAQ,QAAQ;AACtB,SAAO;AAAA,IACL,OAAO;AAAA,IACP,GAAG;AAAA,IACH,kBAAkB;AAAA,IAClB,iBAAiB;AAAA,IACjB,OAAO,QAAQ;AAAA,IACf,kBAAkB,iBAAiB;AAAA,EACrC;AACF;AAOO,SAAS,yBAA+B;AAC7C,QAAM,SAAS,oBAAoB;AAEnC,UAAQ,IAAI,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAC3C,MAAI,CAAC,OAAO,kBAAkB;AAE5B,YAAQ,MAAM,4EAA4E;AAC1F,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAQA,IAAI,QAAQ,KAAK,CAAC,GAAG;AACnB,MAAI;AAGF,UAAM,EAAE,cAAc,IAAI,MAAM,OAAO,KAAU;AACjD,QAAI,YAAY,QAAQ,cAAc,QAAQ,KAAK,CAAC,CAAC,EAAE,MAAM;AAC3D,6BAAuB;AAAA,IACzB;AAAA,EACF,QAAQ;AAKN,QAAI,YAAY,QAAQ,UAAU,QAAQ,KAAK,CAAC,CAAC,IAAI;AACnD,6BAAuB;AAAA,IACzB;AAAA,EACF;AACF;","names":[]}
+{"version":3,"sources":["../src/memory-worth-bench.ts"],"sourcesContent":["/**\n * Issue #560 PR 5 — Memory Worth recall filter benchmark.\n *\n * Self-contained precision benchmark for `applyMemoryWorthFilter`. Seeds a\n * synthetic corpus where a small subset of memories have known-bad outcome\n * history, then compares top-K precision with the filter off vs. on.\n *\n * Why a dedicated in-package file (rather than the full `@remnic/bench`\n * harness): the filter is a pure function over candidate scores and counter\n * data; it doesn't need QMD, the orchestrator, or the schema-tier fixtures.\n * Running it as a plain `tsx` script keeps the signal tight — any drift in\n * the scorer's math shows up as a precision delta here, no integration\n * wiring required.\n *\n * The `runMemoryWorthBench()` export is the programmatic entry point;\n * `runMemoryWorthBenchCli()` is what `tsx` calls when this file is executed\n * directly. Both return (or print) a structured result so CI can gate on\n * it if we later want to.\n *\n * Verdict for PR 5: run the bench once, confirm filter-on ≥ filter-off on\n * precision@K across every seed, and only then flip the default to `true`.\n */\n\nimport {\n  applyMemoryWorthFilter,\n  type MemoryWorthCounters,\n} from \"./memory-worth-filter.js\";\n\n/**\n * One synthetic query + candidate pool + relevance labels.\n *\n * Candidates are scored by the pretend retrieval tier (`baseScore`); the\n * ground-truth relevance is `isRelevant`; `counters` seeds each candidate's\n * outcome history. Some \"bad\" candidates have baseline scores just above\n * the \"good\" candidates — the filter should be able to demote them.\n */\ninterface BenchCase {\n  id: string;\n  candidates: {\n    path: string;\n    baseScore: number;\n    isRelevant: boolean;\n    counters?: MemoryWorthCounters;\n  }[];\n  /** Top-K used for precision@K. */\n  k: number;\n}\n\n/**\n * Deterministic pseudo-random number generator (mulberry32) so the bench\n * produces identical results across runs, making precision changes easy to\n * attribute to code rather than seed drift.\n */\nfunction mulberry32(seed: number): () => number {\n  let t = seed >>> 0;\n  return () => {\n    t = (t + 0x6d2b79f5) >>> 0;\n    let r = t;\n    r = Math.imul(r ^ (r >>> 15), r | 1);\n    r ^= r + Math.imul(r ^ (r >>> 7), r | 61);\n    return ((r ^ (r >>> 14)) >>> 0) / 4294967296;\n  };\n}\n\n/**\n * Generate a synthetic test case.\n *\n * Corpus design:\n *   - 20 candidates per case.\n *   - Top 5 by base score include 2 \"traps\" — memories that the retriever\n *     ranks highly but whose outcome history is 10/0 failures. These should\n *     be sunk by the filter.\n *   - 3 lower-ranked memories are genuinely relevant with 10/0 success\n *     history. The filter should promote them into the top 5.\n *   - Remaining 15 are noise at the neutral prior (no counter data).\n *\n * `k = 5`, so the ideal precision@K is 3/5 = 0.6 (three genuinely relevant\n * items, after filter promotion). Without the filter, precision@5 is 0/5\n * because the top 5 by base score are the 2 traps + 3 irrelevant neutral\n * items.\n */\nfunction buildCase(caseIndex: number, rng: () => number): BenchCase {\n  const candidates: BenchCase[\"candidates\"] = [];\n  // 2 high-ranked traps: high base score, bad outcome history, NOT relevant.\n  for (let i = 0; i < 2; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-trap-${i}.md`,\n      baseScore: 0.95 - i * 0.02,\n      isRelevant: false,\n      counters: { mw_success: 0, mw_fail: 10 },\n    });\n  }\n  // 3 high-ranked irrelevant neutral items.\n  for (let i = 0; i < 3; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-noise-high-${i}.md`,\n      baseScore: 0.9 - i * 0.02,\n      isRelevant: false,\n    });\n  }\n  // 3 lower-ranked TRUE POSITIVES with strong success history — the filter\n  // must float these into the top 5.\n  for (let i = 0; i < 3; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-gold-${i}.md`,\n      baseScore: 0.7 - i * 0.05,\n      isRelevant: true,\n      counters: { mw_success: 10, mw_fail: 0 },\n    });\n  }\n  // 12 irrelevant noise candidates at random lower scores.\n  for (let i = 0; i < 12; i += 1) {\n    candidates.push({\n      path: `case-${caseIndex}-noise-low-${i}.md`,\n      baseScore: rng() * 0.5,\n      isRelevant: false,\n    });\n  }\n  // Shuffle to remove any input-order bias.\n  for (let i = candidates.length - 1; i > 0; i -= 1) {\n    const j = Math.floor(rng() * (i + 1));\n    [candidates[i], candidates[j]] = [candidates[j]!, candidates[i]!];\n  }\n  return { id: `case-${caseIndex}`, candidates, k: 5 };\n}\n\nfunction computePrecisionAtK(\n  orderedPaths: string[],\n  relevant: Set<string>,\n  k: number,\n): number {\n  const topK = orderedPaths.slice(0, k);\n  if (topK.length === 0) return 0;\n  let hits = 0;\n  for (const p of topK) if (relevant.has(p)) hits += 1;\n  return hits / Math.min(k, topK.length);\n}\n\nexport interface MemoryWorthBenchResult {\n  cases: number;\n  k: number;\n  /** Mean precision@K with the filter disabled. */\n  precisionAtK_off: number;\n  /** Mean precision@K with the filter enabled. */\n  precisionAtK_on: number;\n  /** `on - off`; positive means filter helps, zero means tied. */\n  delta: number;\n  /** Filter-on wins at least as often as it loses, case-by-case. */\n  filterWinsOrTies: boolean;\n}\n\n/**\n * Run the benchmark over N synthetic cases using a fixed PRNG seed. Returns\n * aggregate precision numbers + a boolean verdict.\n */\nexport function runMemoryWorthBench(options?: {\n  cases?: number;\n  seed?: number;\n  now?: Date;\n}): MemoryWorthBenchResult {\n  const requestedCases = options?.cases ?? 50;\n  // Reject non-positive-integer case counts. Passing 0 would divide by zero\n  // and produce a NaN precision that the `filterWinsOrTies` boolean would\n  // still mark as `true` — dangerously misleading since this result is used\n  // to justify the default flip. Fractional values would inflate precision\n  // because the loop rounds up (Array.from ceil) but the average divides\n  // by the fractional input.\n  if (\n    !Number.isFinite(requestedCases) ||\n    !Number.isInteger(requestedCases) ||\n    requestedCases < 1\n  ) {\n    throw new Error(\n      `runMemoryWorthBench: cases must be a positive integer; got ${requestedCases}`,\n    );\n  }\n  const numCases = requestedCases;\n  const rng = mulberry32(options?.seed ?? 0xdeadbeef);\n  const now = options?.now ?? new Date(\"2026-01-01T00:00:00.000Z\");\n\n  let sumOff = 0;\n  let sumOn = 0;\n  let onWinsOrTies = 0;\n\n  for (let i = 0; i < numCases; i += 1) {\n    const c = buildCase(i, rng);\n    const relevant = new Set(\n      c.candidates.filter((x) => x.isRelevant).map((x) => x.path),\n    );\n\n    // Filter OFF: sort by baseScore descending.\n    const off = [...c.candidates]\n      .sort((a, b) => b.baseScore - a.baseScore)\n      .map((x) => x.path);\n    const pOff = computePrecisionAtK(off, relevant, c.k);\n\n    // Filter ON: build counter map and apply the filter.\n    const counters = new Map<string, MemoryWorthCounters>();\n    for (const cand of c.candidates) {\n      if (cand.counters) counters.set(cand.path, cand.counters);\n    }\n    const filtered = applyMemoryWorthFilter(\n      c.candidates.map((x) => ({ path: x.path, score: x.baseScore })),\n      { counters, now },\n    );\n    const on = filtered.map((x) => x.path);\n    const pOn = computePrecisionAtK(on, relevant, c.k);\n\n    sumOff += pOff;\n    sumOn += pOn;\n    if (pOn >= pOff) onWinsOrTies += 1;\n  }\n\n  const avgOff = sumOff / numCases;\n  const avgOn = sumOn / numCases;\n  return {\n    cases: numCases,\n    k: 5,\n    precisionAtK_off: avgOff,\n    precisionAtK_on: avgOn,\n    delta: avgOn - avgOff,\n    filterWinsOrTies: onWinsOrTies === numCases,\n  };\n}\n\n/**\n * CLI entry point — run the bench and print a structured result. Exits\n * non-zero if the filter ever loses to the no-filter baseline (so CI can\n * gate on this in the future).\n */\nexport function runMemoryWorthBenchCli(): void {\n  const result = runMemoryWorthBench();\n  // eslint-disable-next-line no-console\n  console.log(JSON.stringify(result, null, 2));\n  if (!result.filterWinsOrTies) {\n    // eslint-disable-next-line no-console\n    console.error(\"memory-worth bench: filter lost to no-filter baseline on at least one case\");\n    process.exit(1);\n  }\n}\n\n// When this file is invoked directly (e.g. `tsx memory-worth-bench.ts`),\n// run the CLI. Use url.pathToFileURL to produce a normalized file:// URL\n// from `process.argv[1]` — that handles Windows drive letters,\n// URL-encoded characters (spaces, etc.), and symlinked entrypoints. A\n// naïve `file://${process.argv[1]}` comparison fails on all three and\n// would silently skip runMemoryWorthBenchCli() on those platforms.\nif (process.argv[1]) {\n  try {\n    // Lazy import so this file can still be loaded in environments that\n    // don't have node:url (browsers, Deno test runners in some modes).\n    const { pathToFileURL } = await import(\"node:url\");\n    if (import.meta.url === pathToFileURL(process.argv[1]).href) {\n      runMemoryWorthBenchCli();\n    }\n  } catch {\n    // If the normalization fails for any reason, fall back to the naive\n    // comparison. Worse case: the bench doesn't auto-run; callers can\n    // always invoke `runMemoryWorthBenchCli()` or `runMemoryWorthBench()`\n    // explicitly.\n    if (import.meta.url === `file://${process.argv[1]}`) {\n      runMemoryWorthBenchCli();\n    }\n  }\n}\n"],"mappings":";;;;;;;AAqDA,SAAS,WAAW,MAA4B;AAC9C,MAAI,IAAI,SAAS;AACjB,SAAO,MAAM;AACX,QAAK,IAAI,eAAgB;AACzB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;AAmBA,SAAS,UAAU,WAAmB,KAA8B;AAClE,QAAM,aAAsC,CAAC;AAE7C,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,SAAS,CAAC;AAAA,MACjC,WAAW,OAAO,IAAI;AAAA,MACtB,YAAY;AAAA,MACZ,UAAU,EAAE,YAAY,GAAG,SAAS,GAAG;AAAA,IACzC,CAAC;AAAA,EACH;AAEA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,eAAe,CAAC;AAAA,MACvC,WAAW,MAAM,IAAI;AAAA,MACrB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AAGA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,SAAS,CAAC;AAAA,MACjC,WAAW,MAAM,IAAI;AAAA,MACrB,YAAY;AAAA,MACZ,UAAU,EAAE,YAAY,IAAI,SAAS,EAAE;AAAA,IACzC,CAAC;AAAA,EACH;AAEA,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK,GAAG;AAC9B,eAAW,KAAK;AAAA,MACd,MAAM,QAAQ,SAAS,cAAc,CAAC;AAAA,MACtC,WAAW,IAAI,IAAI;AAAA,MACnB,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AAEA,WAAS,IAAI,WAAW,SAAS,GAAG,IAAI,GAAG,KAAK,GAAG;AACjD,UAAM,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE;AACpC,KAAC,WAAW,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAI,WAAW,CAAC,CAAE;AAAA,EAClE;AACA,SAAO,EAAE,IAAI,QAAQ,SAAS,IAAI,YAAY,GAAG,EAAE;AACrD;AAEA,SAAS,oBACP,cACA,UACA,GACQ;AACR,QAAM,OAAO,aAAa,MAAM,GAAG,CAAC;AACpC,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI,OAAO;AACX,aAAW,KAAK,KAAM,KAAI,SAAS,IAAI,CAAC,EAAG,SAAQ;AACnD,SAAO,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM;AACvC;AAmBO,SAAS,oBAAoB,SAIT;AACzB,QAAM,iBAAiB,SAAS,SAAS;AAOzC,MACE,CAAC,OAAO,SAAS,cAAc,KAC/B,CAAC,OAAO,UAAU,cAAc,KAChC,iBAAiB,GACjB;AACA,UAAM,IAAI;AAAA,MACR,8DAA8D,cAAc;AAAA,IAC9E;AAAA,EACF;AACA,QAAM,WAAW;AACjB,QAAM,MAAM,WAAW,SAAS,QAAQ,UAAU;AAClD,QAAM,MAAM,SAAS,OAAO,oBAAI,KAAK,0BAA0B;AAE/D,MAAI,SAAS;AACb,MAAI,QAAQ;AACZ,MAAI,eAAe;AAEnB,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK,GAAG;AACpC,UAAM,IAAI,UAAU,GAAG,GAAG;AAC1B,UAAM,WAAW,IAAI;AAAA,MACnB,EAAE,WAAW,OAAO,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IAC5D;AAGA,UAAM,MAAM,CAAC,GAAG,EAAE,UAAU,EACzB,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EACxC,IAAI,CAAC,MAAM,EAAE,IAAI;AACpB,UAAM,OAAO,oBAAoB,KAAK,UAAU,EAAE,CAAC;AAGnD,UAAM,WAAW,oBAAI,IAAiC;AACtD,eAAW,QAAQ,EAAE,YAAY;AAC/B,UAAI,KAAK,SAAU,UAAS,IAAI,KAAK,MAAM,KAAK,QAAQ;AAAA,IAC1D;AACA,UAAM,WAAW;AAAA,MACf,EAAE,WAAW,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,OAAO,EAAE,UAAU,EAAE;AAAA,MAC9D,EAAE,UAAU,IAAI;AAAA,IAClB;AACA,UAAM,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,IAAI;AACrC,UAAM,MAAM,oBAAoB,IAAI,UAAU,EAAE,CAAC;AAEjD,cAAU;AACV,aAAS;AACT,QAAI,OAAO,KAAM,iBAAgB;AAAA,EACnC;AAEA,QAAM,SAAS,SAAS;AACxB,QAAM,QAAQ,QAAQ;AACtB,SAAO;AAAA,IACL,OAAO;AAAA,IACP,GAAG;AAAA,IACH,kBAAkB;AAAA,IAClB,iBAAiB;AAAA,IACjB,OAAO,QAAQ;AAAA,IACf,kBAAkB,iBAAiB;AAAA,EACrC;AACF;AAOO,SAAS,yBAA+B;AAC7C,QAAM,SAAS,oBAAoB;AAEnC,UAAQ,IAAI,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAC3C,MAAI,CAAC,OAAO,kBAAkB;AAE5B,YAAQ,MAAM,4EAA4E;AAC1F,YAAQ,KAAK,CAAC;AAAA,EAChB;AACF;AAQA,IAAI,QAAQ,KAAK,CAAC,GAAG;AACnB,MAAI;AAGF,UAAM,EAAE,cAAc,IAAI,MAAM,OAAO,KAAU;AACjD,QAAI,YAAY,QAAQ,cAAc,QAAQ,KAAK,CAAC,CAAC,EAAE,MAAM;AAC3D,6BAAuB;AAAA,IACzB;AAAA,EACF,QAAQ;AAKN,QAAI,YAAY,QAAQ,UAAU,QAAQ,KAAK,CAAC,CAAC,IAAI;AACnD,6BAAuB;AAAA,IACzB;AAAA,EACF;AACF;","names":[]}

package/dist/memory-worth-filter.js

@@ -3,6 +3,7 @@ import {
   buildMemoryWorthCounterMap
 } from "./chunk-3GPTTA4J.js";
 import "./chunk-IISBCCWR.js";
+import "./chunk-PZ5AY32C.js";
 export {
   applyMemoryWorthFilter,
   buildMemoryWorthCounterMap

package/dist/memory-worth-outcomes.d.ts

@@ -2,7 +2,7 @@ import { StorageManager } from './storage.js';
 import { MemoryFrontmatter } from './types.js';
 import './page-versioning.js';
 import './consolidation-operator.js';
-import './memory-projection-store-DeSXPh1j.js';
+import './memory-projection-store-D3vBHS4J.js';
 import 'better-sqlite3';
 
 /**

package/dist/memory-worth-outcomes.js

@@ -2,6 +2,7 @@ import {
   memoryWorthOutcomeEligibleCategories,
   recordMemoryOutcome
 } from "./chunk-EIR5VLIH.js";
+import "./chunk-PZ5AY32C.js";
 export {
   memoryWorthOutcomeEligibleCategories,
   recordMemoryOutcome

package/dist/memory-worth.js

@@ -1,6 +1,7 @@
 import {
   computeMemoryWorth
 } from "./chunk-IISBCCWR.js";
+import "./chunk-PZ5AY32C.js";
 export {
   computeMemoryWorth
 };

package/dist/metadata-FC3XPDRQ.js

@@ -0,0 +1,21 @@
+import {
+  METADATA_FORMAT,
+  METADATA_FORMAT_VERSION,
+  buildMetadata,
+  decodeMetadataSalt,
+  parseMetadata,
+  serializeMetadata,
+  validateMetadata
+} from "./chunk-UKJAGEXH.js";
+import "./chunk-FP2373TW.js";
+import "./chunk-PZ5AY32C.js";
+export {
+  METADATA_FORMAT,
+  METADATA_FORMAT_VERSION,
+  buildMetadata,
+  decodeMetadataSalt,
+  parseMetadata,
+  serializeMetadata,
+  validateMetadata
+};
+//# sourceMappingURL=metadata-FC3XPDRQ.js.map

package/dist/metadata-FC3XPDRQ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/migrate-from-identity-anchor-TTEDEJGX.js

@@ -0,0 +1,8 @@
+import {
+  migrateFromIdentityAnchor
+} from "./chunk-TUFG6VXY.js";
+import "./chunk-PZ5AY32C.js";
+export {
+  migrateFromIdentityAnchor
+};
+//# sourceMappingURL=migrate-from-identity-anchor-TTEDEJGX.js.map

package/dist/migrate-from-identity-anchor-TTEDEJGX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/model-registry.js

@@ -2,6 +2,7 @@ import {
   ModelRegistry
 } from "./chunk-FEMOX5AD.js";
 import "./chunk-2ODBA7MQ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   ModelRegistry
 };

package/dist/models-json.js

@@ -4,6 +4,7 @@ import {
   loadModelsJsonProviders
 } from "./chunk-ODWDQNRE.js";
 import "./chunk-2ODBA7MQ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   __setModelsJsonForTest,
   clearModelsJsonCache,

package/dist/native-knowledge.js

@@ -11,6 +11,7 @@ import {
   syncOpenClawWorkspaceArtifacts
 } from "./chunk-7SEAZFFB.js";
 import "./chunk-2ODBA7MQ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   collectNativeKnowledgeChunks,
   formatNativeKnowledgeSection,

package/dist/negative.js

@@ -2,6 +2,7 @@ import {
   NegativeExampleStore
 } from "./chunk-D654IBA6.js";
 import "./chunk-2ODBA7MQ.js";
+import "./chunk-PZ5AY32C.js";
 export {
   NegativeExampleStore
 };

package/dist/objective-state-writers.js

@@ -3,6 +3,7 @@ import {
 } from "./chunk-LOBRX7VD.js";
 import "./chunk-DGXUHMOV.js";
 import "./chunk-LPSF4OQH.js";
+import "./chunk-PZ5AY32C.js";
 
 // src/objective-state-writers.ts
 import crypto from "crypto";