@namzu/sdk 62.1.0 → 62.2.0

package/dist/turn/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/turn/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AAClD,YAAY,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAEjD,OAAO,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AACtE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAC7F,OAAO,EACN,wBAAwB,EACxB,yBAAyB,EACzB,uBAAuB,EACvB,UAAU,EACV,iBAAiB,GACjB,MAAM,mBAAmB,CAAA;AAC1B,YAAY,EAAE,kBAAkB,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AACrE,OAAO,EACN,qBAAqB,EACrB,sBAAsB,EACtB,oBAAoB,GACpB,MAAM,4BAA4B,CAAA;AACnC,YAAY,EAAE,eAAe,EAAE,2BAA2B,EAAE,MAAM,4BAA4B,CAAA;AAE9F,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AACzE,YAAY,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAE5E,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAA;AAC/E,YAAY,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAA;AACjE,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAA;AAC3D,YAAY,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAA;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAA;AAClE,YAAY,EACX,cAAc,EACd,oBAAoB,EACpB,oBAAoB,EACpB,oBAAoB,EACpB,gBAAgB,EAChB,gBAAgB,EAChB,wBAAwB,EACxB,iBAAiB,GACjB,MAAM,0BAA0B,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/turn/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AAClD,YAAY,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAEjD,OAAO,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AACtE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAA;AAC7F,OAAO,EACN,wBAAwB,EACxB,yBAAyB,EACzB,uBAAuB,EACvB,UAAU,EACV,iBAAiB,GACjB,MAAM,mBAAmB,CAAA;AAC1B,YAAY,EAAE,kBAAkB,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAA;AACrE,OAAO,EACN,qBAAqB,EACrB,sBAAsB,EACtB,oBAAoB,GACpB,MAAM,4BAA4B,CAAA;AACnC,YAAY,EAAE,eAAe,EAAE,2BAA2B,EAAE,MAAM,4BAA4B,CAAA;AAE9F,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AACzE,YAAY,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAA;AAE5E,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAA;AAC/E,YAAY,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAA;AACxF,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAA;AAC3D,YAAY,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAA;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAA;AAClE,YAAY,EACX,cAAc,EACd,oBAAoB,EACpB,oBAAoB,EACpB,oBAAoB,EACpB,gBAAgB,EAChB,gBAAgB,EAChB,wBAAwB,EACxB,iBAAiB,GACjB,MAAM,0BAA0B,CAAA"}

package/dist/turn/memory-promoter.d.ts

@@ -5,6 +5,15 @@
  */
 import type { MemoryStore } from '../types/memory/index.js';
 import type { PromoteMemory } from '../types/session/memory-promotion.js';
+/**
+ * The categories that make a turn worth remembering.
+ *
+ * Ordered as they are rendered. `userRequirements` first because it is the
+ * most durable of the five — a constraint the user stated outlives the turn
+ * that heard it, whereas a discovery about a codebase expires when the
+ * codebase moves.
+ */
+declare const KNOWLEDGE: readonly [readonly ["userRequirements", "What the user requires"], readonly ["decisions", "Decisions"], readonly ["discoveries", "Discoveries"], readonly ["failures", "What did not work"], readonly ["environment", "Environment"]];
 /**
  * Tag every record this promoter writes, so a host can find or prune them.
  * Also its `metadata.source`, which keeps the record out of a Markdown
@@ -30,7 +39,17 @@ export interface MemoryPromoterOptions {
      * that costs context every time it is retrieved.
      */
     readonly maxPerCategory?: number;
+    /**
+     * Decide whether one extracted claim may become part of a record. Called
+     * with the candidate's category (`userRequirements`, `decisions`,
+     * `discoveries`, `failures` or `environment`) and the claim text. A claim
+     * it rejects is left out; a record with no claim left is not written.
+     * Defaults to keeping every claim.
+     */
+    readonly acceptClaim?: (category: SessionMemoryCategory, text: string) => boolean;
 }
+/** The claim categories of a {@link SessionMemoryCandidate}. */
+export type SessionMemoryCategory = (typeof KNOWLEDGE)[number][0];
 /**
  * Build a promoter that writes one record per turn that learned something.
  *
@@ -40,4 +59,5 @@ export interface MemoryPromoterOptions {
  * reports it.
  */
 export declare function createMemoryPromoter(options: MemoryPromoterOptions): PromoteMemory;
+export {};
 //# sourceMappingURL=memory-promoter.d.ts.map

package/dist/turn/memory-promoter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"memory-promoter.d.ts","sourceRoot":"","sources":["../../src/turn/memory-promoter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AAC3D,OAAO,KAAK,EAAE,aAAa,EAA0B,MAAM,sCAAsC,CAAA;AAkBjG;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,mBAAwB,CAAA;AAEvD,MAAM,WAAW,qBAAqB;IACrC,qEAAqE;IACrE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAA;IAC3B;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IACjC;;;;;;OAMG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAChC;AAgDD;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,qBAAqB,GAAG,aAAa,CA8ClF"}
+{"version":3,"file":"memory-promoter.d.ts","sourceRoot":"","sources":["../../src/turn/memory-promoter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AAC3D,OAAO,KAAK,EAAE,aAAa,EAA0B,MAAM,sCAAsC,CAAA;AAEjG;;;;;;;GAOG;AACH,QAAA,MAAM,SAAS,uOAMkE,CAAA;AAEjF;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,mBAAwB,CAAA;AAEvD,MAAM,WAAW,qBAAqB;IACrC,qEAAqE;IACrE,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAA;IAC3B;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IACjC;;;;;;OAMG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAA;IAChC;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,QAAQ,EAAE,qBAAqB,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAA;CACjF;AAED,gEAAgE;AAChE,MAAM,MAAM,qBAAqB,GAAG,CAAC,OAAO,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AAqDjE;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,qBAAqB,GAAG,aAAa,CA+ClF"}

package/dist/turn/memory-promoter.js

@@ -28,11 +28,13 @@ const KNOWLEDGE = [
  */
 export const SESSION_MEMORY_TAG = SESSION_MEMORY_SOURCE;
 /** Everything the candidate knows, as `[heading, items]`, empties dropped. */
-function knowledge(candidate, cap) {
+function knowledge(candidate, cap, accept) {
     const out = [];
     for (const [key, heading] of KNOWLEDGE) {
         const items = [
-            ...new Set(candidate[key].map((item) => item.trim()).filter(Boolean)),
+            ...new Set(candidate[key]
+                .map((item) => item.trim())
+                .filter((item) => item !== '' && accept(key, item))),
         ];
         if (items.length > 0)
             out.push([heading, items.slice(0, cap)]);
@@ -73,9 +75,10 @@ export function createMemoryPromoter(options) {
     const cap = options.maxPerCategory ?? 20;
     if (!Number.isSafeInteger(cap) || cap < 1)
         throw new Error('maxPerCategory must be a positive integer');
+    const accept = options.acceptClaim ?? (() => true);
     const tags = [SESSION_MEMORY_TAG, ...(options.tags ?? [])];
     return async (candidate) => {
-        const sections = knowledge(candidate, cap);
+        const sections = knowledge(candidate, cap, accept);
         // Nothing learned, nothing written. Not an empty record: a store full
         // of rows describing runs that discovered nothing is a store whose
         // search results are mostly noise, and the model reads that store.

package/dist/turn/memory-promoter.js.map

@@ -1 +1 @@
-{"version":3,"file":"memory-promoter.js","sourceRoot":"","sources":["../../src/turn/memory-promoter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACN,oBAAoB,EACpB,oBAAoB,EACpB,eAAe,GACf,MAAM,2BAA2B,CAAA;AAClC,OAAO,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAA;AAIjE;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG;IACjB,CAAC,kBAAkB,EAAE,wBAAwB,CAAC;IAC9C,CAAC,WAAW,EAAE,WAAW,CAAC;IAC1B,CAAC,aAAa,EAAE,aAAa,CAAC;IAC9B,CAAC,UAAU,EAAE,mBAAmB,CAAC;IACjC,CAAC,aAAa,EAAE,aAAa,CAAC;CACkD,CAAA;AAEjF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,qBAAqB,CAAA;AAsBvD,8EAA8E;AAC9E,SAAS,SAAS,CACjB,SAAiC,EACjC,GAAW;IAEX,MAAM,GAAG,GAA6C,EAAE,CAAA;IACxD,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG;YACb,GAAG,IAAI,GAAG,CAAE,SAAS,CAAC,GAAG,CAAuB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;SAC5F,CAAA;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA;IAC/D,CAAC;IACD,OAAO,GAAG,CAAA;AACX,CAAC;AAED,gFAAgF;AAChF,SAAS,SAAS,CAAC,QAA2D;IAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrF,OAAO,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,GAAG,CAAA;AAC5F,CAAC;AAED,SAAS,MAAM,CACd,SAAiC,EACjC,QAA2D;IAE3D,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CACxB,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,MAAM,OAAO,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACjF,CAAA;IACD,0EAA0E;IAC1E,sEAAsE;IACtE,sEAAsE;IACtE,gBAAgB;IAChB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,CAAC,IAAI,CACR,iCAAiC,OAAO;aACtC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,QAAQ,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC;aAClF,IAAI,CAAC,IAAI,CAAC,EAAE,CACd,CAAA;IACF,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,uBAAuB,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACpF,CAAC;IACD,OAAO,KAAK,SAAS,CAAC,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAA;AACvD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAA8B;IAClE,MAAM,GAAG,GAAG,OAAO,CAAC,cAAc,IAAI,EAAE,CAAA;IACxC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAA;IAC7D,MAAM,IAAI,GAAG,CAAC,kBAAkB,EAAE,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAA;IAE1D,OAAO,KAAK,EAAE,SAAiC,EAAiB,EAAE;QACjE,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;QAC1C,sEAAsE;QACtE,mEAAmE;QACnE,mEAAmE;QACnE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QACjC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;QACxC,MAAM,YAAY,GAAG,GAAG,oBAAoB,GAAG,MAAM,EAAE,CAAA;QACvD,wEAAwE;QACxE,qEAAqE;QACrE,uEAAuE;QACvE,IACC,MAAM,oBAAoB,CACzB,OAAO,CAAC,KAAK,EACb,IAAI,EACJ,MAAM,EACN,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,kBAAkB,CACrD;YAED,OAAM;QAEP,MAAM,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC;YAC1B,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,SAAS,CAAC,MAAM,EAAE;YAC1D,OAAO,EAAE,SAAS,CAAC,QAAQ,CAAC;YAC5B,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC;YACpC,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,YAAY,CAAC;YAC7B,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,UAAU;YAClB,sEAAsE;YACtE,+DAA+D;YAC/D,2DAA2D;YAC3D,QAAQ,EAAE;gBACT,SAAS,EAAE,SAAS,CAAC,SAAS;gBAC9B,MAAM,EAAE,SAAS,CAAC,MAAM;gBACxB,MAAM,EAAE,kBAAkB;gBAC1B,eAAe,EAAE,MAAM;gBACvB,YAAY,EAAE,YAAY;aAC1B;SACD,CAAC,CAAA;IACH,CAAC,CAAA;AACF,CAAC"}
+{"version":3,"file":"memory-promoter.js","sourceRoot":"","sources":["../../src/turn/memory-promoter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACN,oBAAoB,EACpB,oBAAoB,EACpB,eAAe,GACf,MAAM,2BAA2B,CAAA;AAClC,OAAO,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAA;AAIjE;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG;IACjB,CAAC,kBAAkB,EAAE,wBAAwB,CAAC;IAC9C,CAAC,WAAW,EAAE,WAAW,CAAC;IAC1B,CAAC,aAAa,EAAE,aAAa,CAAC;IAC9B,CAAC,UAAU,EAAE,mBAAmB,CAAC;IACjC,CAAC,aAAa,EAAE,aAAa,CAAC;CACkD,CAAA;AAEjF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,qBAAqB,CAAA;AAiCvD,8EAA8E;AAC9E,SAAS,SAAS,CACjB,SAAiC,EACjC,GAAW,EACX,MAAkE;IAElE,MAAM,GAAG,GAA6C,EAAE,CAAA;IACxD,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG;YACb,GAAG,IAAI,GAAG,CACR,SAAS,CAAC,GAAG,CAAuB;iBACnC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;iBAC1B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,IAAI,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CACpD;SACD,CAAA;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA;IAC/D,CAAC;IACD,OAAO,GAAG,CAAA;AACX,CAAC;AAED,gFAAgF;AAChF,SAAS,SAAS,CAAC,QAA2D;IAC7E,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACrF,OAAO,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,GAAG,CAAA;AAC5F,CAAC;AAED,SAAS,MAAM,CACd,SAAiC,EACjC,QAA2D;IAE3D,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CACxB,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,MAAM,OAAO,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACjF,CAAA;IACD,0EAA0E;IAC1E,sEAAsE;IACtE,sEAAsE;IACtE,gBAAgB;IAChB,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC1E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,CAAC,IAAI,CACR,iCAAiC,OAAO;aACtC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,QAAQ,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC;aAClF,IAAI,CAAC,IAAI,CAAC,EAAE,CACd,CAAA;IACF,CAAC;IACD,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,uBAAuB,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACpF,CAAC;IACD,OAAO,KAAK,SAAS,CAAC,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAA;AACvD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAA8B;IAClE,MAAM,GAAG,GAAG,OAAO,CAAC,cAAc,IAAI,EAAE,CAAA;IACxC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAA;IAC7D,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;IAClD,MAAM,IAAI,GAAG,CAAC,kBAAkB,EAAE,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAA;IAE1D,OAAO,KAAK,EAAE,SAAiC,EAAiB,EAAE;QACjE,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,EAAE,GAAG,EAAE,MAAM,CAAC,CAAA;QAClD,sEAAsE;QACtE,mEAAmE;QACnE,mEAAmE;QACnE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAM;QACjC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;QACxC,MAAM,YAAY,GAAG,GAAG,oBAAoB,GAAG,MAAM,EAAE,CAAA;QACvD,wEAAwE;QACxE,qEAAqE;QACrE,uEAAuE;QACvE,IACC,MAAM,oBAAoB,CACzB,OAAO,CAAC,KAAK,EACb,IAAI,EACJ,MAAM,EACN,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,kBAAkB,CACrD;YAED,OAAM;QAEP,MAAM,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC;YAC1B,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,SAAS,CAAC,MAAM,EAAE;YAC1D,OAAO,EAAE,SAAS,CAAC,QAAQ,CAAC;YAC5B,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC;YACpC,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,YAAY,CAAC;YAC7B,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,UAAU;YAClB,sEAAsE;YACtE,+DAA+D;YAC/D,2DAA2D;YAC3D,QAAQ,EAAE;gBACT,SAAS,EAAE,SAAS,CAAC,SAAS;gBAC9B,MAAM,EAAE,SAAS,CAAC,MAAM;gBACxB,MAAM,EAAE,kBAAkB;gBAC1B,eAAe,EAAE,MAAM;gBACvB,YAAY,EAAE,YAAY;aAC1B;SACD,CAAC,CAAA;IACH,CAAC,CAAA;AACF,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@namzu/sdk",
-  "version": "62.1.0",
+  "version": "62.2.0",
   "description": "Open-source AI kernel for TypeScript: runs an agent the way an operating system runs a process, with an identity and a budget, scheduled tool calls and checkpointed turns.",
   "license": "FSL-1.1-MIT",
   "engines": {

package/src/compaction/consolidation.ts

@@ -37,6 +37,25 @@ export interface ConsolidationMeta {
 
 const MAX_TASK_IN_TITLE = 72
 
+/**
+ * A host's screen over what a consolidation may quote. Without one a
+ * consolidation carries the task, decisions, discoveries and failures
+ * verbatim, which is right for a store the operator reads and wrong for one
+ * that is recalled into later prompts unreviewed.
+ */
+export interface ConsolidationScreen {
+	/**
+	 * The task as it may appear in the title and body, or `undefined` to say
+	 * it is not stated. Absent keeps the task as written.
+	 */
+	readonly task?: (task: string) => string | undefined
+	/** Whether one item may be written down. Absent keeps every item. */
+	readonly keep?: (
+		category: 'decisions' | 'discoveries' | 'failures' | 'files',
+		text: string,
+	) => boolean
+}
+
 function head(text: string, max: number): string {
 	const line = text.split('\n')[0]?.trim() ?? ''
 	return line.length <= max ? line : `${line.slice(0, max - 1)}…`
@@ -72,16 +91,22 @@ export async function isConsolidated(
 export function consolidationEntry(
 	state: WorkingState,
 	meta: ConsolidationMeta,
+	screen?: ConsolidationScreen,
 ): CreateMemoryParams | null {
-	const decisions = state.decisions.filter((d) => d.trim().length > 0)
-	const discoveries = state.discoveries.filter((d) => d.trim().length > 0)
-	const failures = state.failures.filter((f) => f.trim().length > 0)
+	const kept =
+		(category: 'decisions' | 'discoveries' | 'failures' | 'files') =>
+		(item: string): boolean =>
+			item.trim().length > 0 && (screen?.keep?.(category, item) ?? true)
+	const decisions = state.decisions.filter(kept('decisions'))
+	const discoveries = state.discoveries.filter(kept('discoveries'))
+	const failures = state.failures.filter(kept('failures'))
 	if (decisions.length + discoveries.length + failures.length === 0) return null
 
-	const task = state.task.trim()
+	const task = (screen?.task ? (screen.task(state.task.trim()) ?? '') : state.task).trim()
 	const files = [...state.files.values()]
 		.filter((slot) => slot.actions.some((a) => a.type !== 'read'))
 		.map((slot) => slot.path)
+		.filter(kept('files'))
 	const section = (name: string, items: readonly string[]): string[] =>
 		items.length === 0 ? [] : [`## ${name}`, '', ...items.map((item) => `- ${item}`), '']
 	const content = [

package/src/compaction/index.ts

@@ -109,4 +109,5 @@ export { DEFAULT_SOFT_TARGET, planSalienceWorkingSet } from './plan.js'
 
 // Episodic → semantic: what a turn learned, as the entry a later turn searches.
 export { CONSOLIDATION_TAG, consolidationEntry, isConsolidated } from './consolidation.js'
+export type { ConsolidationScreen } from './consolidation.js'
 export type { ConsolidationMeta } from './consolidation.js'

package/src/public-runtime.ts

@@ -477,7 +477,7 @@ export type {
 // the model reads this store, so noise here is context spent on a turn that
 // did nothing.
 export { SESSION_MEMORY_TAG, createMemoryPromoter } from './turn/index.js'
-export type { MemoryPromoterOptions } from './turn/index.js'
+export type { MemoryPromoterOptions, SessionMemoryCategory } from './turn/index.js'
 export { createMemoryRecallStep } from './turn/memory-recall.js'
 export type { MemoryRecallOptions } from './turn/memory-recall.js'
 export {
@@ -592,6 +592,7 @@ export {
 	memoryIndexLine,
 	memoryLinkNames,
 	memoryOrigin,
+	findSecretShape,
 	renderMemoryIndex,
 	slugifyMemoryName,
 } from './store/index.js'
@@ -1336,6 +1337,7 @@ export {
 	consolidationEntry,
 	isConsolidated,
 } from './compaction/consolidation.js'
+export type { ConsolidationScreen } from './compaction/consolidation.js'
 // The sibling state-bearing system message. A host that carries a turn's
 // conversation into a fresh query must distinguish this ledger from the fresh
 // identity/environment prompt floor without copying its private header string.

package/src/public-types.ts

@@ -216,6 +216,8 @@ export type {
 	Identifiable,
 	MarkdownMemoryStoreConfig,
 	MemoryContentRejection,
+	SecretScanOptions,
+	SecretShape,
 	MemoryImportOutcome,
 	RenderedMemoryIndex,
 	MemoryOrigin,

package/src/runtime/query/finalize-turn.ts

@@ -177,11 +177,15 @@ export async function* finalizeTurn(
 	}
 
 	if (params.consolidateInto && workingStateManager) {
-		const entry = consolidationEntry(workingStateManager.getState(), {
-			sessionId: ctx.sessionId,
-			turnId: ctx.turnId,
-			at: Date.now(),
-		})
+		const entry = consolidationEntry(
+			workingStateManager.getState(),
+			{
+				sessionId: ctx.sessionId,
+				turnId: ctx.turnId,
+				at: Date.now(),
+			},
+			params.consolidationScreen,
+		)
 		if (entry) {
 			try {
 				// Same knowledge, same record: a later turn that learned what an

package/src/runtime/query/index.ts

@@ -7,6 +7,7 @@ import {
 } from '../../advisory/index.js'
 import { AuthorizationGate } from '../../authorization/gate.js'
 import { SkillGrantSet } from '../../authorization/skill-grant.js'
+import type { ConsolidationScreen } from '../../compaction/consolidation.js'
 import { repairToolMessageHistory, toolHistoryRepairChanged } from '../../compaction/dangling.js'
 import { extractFromUserMessage } from '../../compaction/extractor.js'
 import { WorkingStateManager } from '../../compaction/manager.js'
@@ -963,6 +964,13 @@ export interface QueryParams {
 	 */
 	consolidateInto?: MemoryStore
 
+	/**
+	 * What a consolidation may quote. Absent keeps the task, decisions,
+	 * discoveries and failures verbatim; a host whose store is recalled into
+	 * later prompts sets it to drop or neutralise what should not persist.
+	 */
+	consolidationScreen?: ConsolidationScreen
+
 	/**
 	 * Optional neutral working-memory seam. When set, the iteration loop
 	 * re-renders the provider's string into a single pinned leading system

package/src/store/index.ts

@@ -37,6 +37,8 @@ export {
 	isMemoryName,
 	slugifyMemoryName,
 } from './memory/naming.js'
+export { findSecretShape } from './memory/secrets.js'
+export type { SecretScanOptions, SecretShape } from './memory/secrets.js'
 export type { MemoryContentRejection } from './memory/naming.js'
 export { MemoryRevisionConflictError } from './memory/revision.js'
 

package/src/store/memory/secrets.ts

@@ -0,0 +1,105 @@
+/**
+ * Secret shapes: text that looks like a credential and must not be written to
+ * a memory. A memory is recalled into later prompts, sent to providers and
+ * kept on disk in the clear, so a key saved once is a key leaked many times.
+ *
+ * The match is on shape only. It names a reason code and never returns the
+ * matched text, so a caller can log the code without logging the secret.
+ */
+
+export type SecretShape =
+	| 'private_key'
+	| 'provider_token'
+	| 'jwt'
+	| 'credentialed_url'
+	| 'high_entropy'
+
+const PATTERNS: readonly (readonly [SecretShape, RegExp])[] = [
+	['private_key', /-----BEGIN [A-Z ]*PRIVATE KEY(?: BLOCK)?-----/],
+	[
+		'provider_token',
+		new RegExp(
+			[
+				'\\bsk-(?:ant-|proj-|live-|or-v1-)?[A-Za-z0-9_-]{20,}',
+				'\\bgh[pousr]_[A-Za-z0-9]{30,}',
+				'\\bgithub_pat_[A-Za-z0-9_]{30,}',
+				'\\bglpat-[A-Za-z0-9_-]{16,}',
+				'\\bxox[abposr]-[A-Za-z0-9-]{10,}',
+				'\\b(?:AKIA|ASIA)[A-Z0-9]{16}\\b',
+				'\\bAIza[A-Za-z0-9_-]{35}\\b',
+				'\\bnvapi-[A-Za-z0-9_-]{20,}',
+				'\\bnpm_[A-Za-z0-9]{30,}',
+				'\\b[sr]k_(?:live|test)_[A-Za-z0-9]{16,}',
+				'\\bSG\\.[A-Za-z0-9_-]{16,}\\.[A-Za-z0-9_-]{16,}',
+				'\\bhf_[A-Za-z0-9]{30,}',
+				'\\bBearer\\s+[A-Za-z0-9._~+/-]{24,}=*',
+			].join('|'),
+		),
+	],
+	['jwt', /\beyJ[A-Za-z0-9_-]{8,}\.eyJ[A-Za-z0-9_-]{8,}\.[A-Za-z0-9_-]{8,}/],
+	['credentialed_url', /\b[a-z][a-z0-9+.-]*:\/\/[^\s/:@]+:[^\s/@]+@[^\s/]+/i],
+]
+
+/** Shannon entropy of `text`, in bits per character. */
+function entropy(text: string): number {
+	const counts = new Map<string, number>()
+	for (const ch of text) counts.set(ch, (counts.get(ch) ?? 0) + 1)
+	let bits = 0
+	for (const n of counts.values()) {
+		const p = n / text.length
+		bits -= p * Math.log2(p)
+	}
+	return bits
+}
+
+/** How many times the token switches between a letter and a digit. */
+function letterDigitSwitches(token: string): number {
+	let switches = 0
+	let previous: 'letter' | 'digit' | undefined
+	for (const ch of token) {
+		const kind = /\d/.test(ch) ? 'digit' : /[A-Za-z]/.test(ch) ? 'letter' : undefined
+		if (kind === undefined) continue
+		if (previous !== undefined && previous !== kind) switches += 1
+		previous = kind
+	}
+	return switches
+}
+
+/**
+ * Random, not merely long: a long identifier with a trailing number
+ * (`DecisionsAbcDefGhi1234567890`) has mixed case and a digit but few
+ * letter-digit switches and a low spread, a key has both. A path-like token
+ * is a path.
+ */
+function looksRandom(token: string): boolean {
+	return (
+		!token.includes('/') &&
+		/[A-Z]/.test(token) &&
+		/[a-z]/.test(token) &&
+		letterDigitSwitches(token) >= 4 &&
+		entropy(token) >= 4.5
+	)
+}
+
+export interface SecretScanOptions {
+	/**
+	 * Also flag a long unbroken run of mixed-case letters and digits that looks
+	 * random. Off by default: it can flag an identifier a person meant to keep,
+	 * which is right for text nobody chose and wrong for text somebody did.
+	 */
+	readonly entropy?: boolean
+}
+
+/** The first secret shape `text` has, or `undefined`. */
+export function findSecretShape(
+	text: string,
+	options: SecretScanOptions = {},
+): SecretShape | undefined {
+	for (const [shape, pattern] of PATTERNS) if (pattern.test(text)) return shape
+	if (options.entropy === true) {
+		for (const token of text.match(/[A-Za-z0-9+/_=-]{32,}/g) ?? []) {
+			if (looksRandom(token)) return 'high_entropy'
+		}
+	}
+	return undefined
+}

package/src/tools/memory/save.ts

@@ -5,6 +5,7 @@ import type { MemoryStore } from '../../types/memory/index.js'
 import type { ToolDefinition } from '../../types/tool/index.js'
 import { defineTool } from '../defineTool.js'
 import { memoryFieldsSchema } from './fields.js'
+import { refuseSecret } from './secret-guard.js'
 
 export function buildSaveMemoryTool(store: MemoryStore): ToolDefinition {
 	return defineTool({
@@ -13,6 +14,7 @@ export function buildSaveMemoryTool(store: MemoryStore): ToolDefinition {
 			'Save one memory for later sessions in this project: a single fact that the code, the history and the docs do not already hold.',
 			'Choose a type: user (who the person is and how they like to work), feedback (a rule they gave about how to work), project (a fact or decision about the work), reference (where to look for something).',
 			'For feedback and project memories, write the rule or fact first, then a line starting "Why:" and a line starting "How to apply:".',
+			'Never save a secret: an API key, token, password, private key or a URL with credentials in it is refused.',
 			'Link a related memory by writing [[its-name]] in the content.',
 			'The name must be new: a name another memory holds is refused, and the reply points to update_memory.',
 			"Returns the saved memory's id and name.",
@@ -30,6 +32,8 @@ export function buildSaveMemoryTool(store: MemoryStore): ToolDefinition {
 		destructive: false,
 		concurrencySafe: true,
 		async execute({ title, summary, content, tags, name, description, type }, context) {
+			const refused = refuseSecret([title, summary, content, description, ...(tags ?? [])])
+			if (refused) return refused
 			try {
 				const { entry } = await store.create({
 					title,

package/src/tools/memory/secret-guard.ts

@@ -0,0 +1,23 @@
+import { findSecretShape } from '../../store/memory/secrets.js'
+import type { ToolResult } from '../../types/tool/index.js'
+
+/**
+ * A refusal when any field a model is saving holds a secret, else `undefined`.
+ * The reply names the shape, never the text, so the refusal does not repeat
+ * the secret into the transcript.
+ */
+export function refuseSecret(fields: readonly (string | undefined)[]): ToolResult | undefined {
+	for (const field of fields) {
+		if (field === undefined) continue
+		const shape = findSecretShape(field)
+		if (shape === undefined) continue
+		return {
+			success: false,
+			output:
+				'The memory looks like it contains a secret (an API key, token, password, private key or a URL with credentials). Memories are recalled into later prompts and kept on disk in the clear, so it was not saved. Save where the secret lives (the variable or file name) instead of its value.',
+			error: 'Memory content rejected',
+			data: { reason: 'secret', shape },
+		}
+	}
+	return undefined
+}

package/src/tools/memory/update.ts

@@ -7,6 +7,7 @@ import type { ToolDefinition } from '../../types/tool/index.js'
 import { defineTool } from '../defineTool.js'
 import { memoryFieldsSchema } from './fields.js'
 import { resolveMemoryReference } from './resolve.js'
+import { refuseSecret } from './secret-guard.js'
 
 export function buildUpdateMemoryTool(store: MemoryStore): ToolDefinition {
 	return defineTool({
@@ -52,6 +53,14 @@ export function buildUpdateMemoryTool(store: MemoryStore): ToolDefinition {
 					error: 'Conditional memory update unavailable',
 				}
 			}
+			const refused = refuseSecret([
+				updates.title,
+				updates.summary,
+				updates.content,
+				updates.description,
+				...(updates.tags ?? []),
+			])
+			if (refused) return refused
 			const reference = await resolveMemoryReference(store, id)
 			if (!reference.found) {
 				return {

package/src/turn/index.ts

@@ -22,7 +22,7 @@ export { checkLimitsDetailed, buildLimitConfig } from './LimitChecker.js'
 export type { LimitCheckerState, LimitCheckResult } from './LimitChecker.js'
 
 export { SESSION_MEMORY_TAG, createMemoryPromoter } from './memory-promoter.js'
-export type { MemoryPromoterOptions } from './memory-promoter.js'
+export type { MemoryPromoterOptions, SessionMemoryCategory } from './memory-promoter.js'
 export { createMemoryRecallStep } from './memory-recall.js'
 export type { MemoryRecallOptions } from './memory-recall.js'
 export { createJsonClaimVerifier } from './json-claim-verifier.js'

package/src/turn/memory-promoter.ts

@@ -55,17 +55,33 @@ export interface MemoryPromoterOptions {
 	 * that costs context every time it is retrieved.
 	 */
 	readonly maxPerCategory?: number
+	/**
+	 * Decide whether one extracted claim may become part of a record. Called
+	 * with the candidate's category (`userRequirements`, `decisions`,
+	 * `discoveries`, `failures` or `environment`) and the claim text. A claim
+	 * it rejects is left out; a record with no claim left is not written.
+	 * Defaults to keeping every claim.
+	 */
+	readonly acceptClaim?: (category: SessionMemoryCategory, text: string) => boolean
 }
 
+/** The claim categories of a {@link SessionMemoryCandidate}. */
+export type SessionMemoryCategory = (typeof KNOWLEDGE)[number][0]
+
 /** Everything the candidate knows, as `[heading, items]`, empties dropped. */
 function knowledge(
 	candidate: SessionMemoryCandidate,
 	cap: number,
+	accept: (category: SessionMemoryCategory, text: string) => boolean,
 ): readonly (readonly [string, readonly string[]])[] {
 	const out: (readonly [string, readonly string[]])[] = []
 	for (const [key, heading] of KNOWLEDGE) {
 		const items = [
-			...new Set((candidate[key] as readonly string[]).map((item) => item.trim()).filter(Boolean)),
+			...new Set(
+				(candidate[key] as readonly string[])
+					.map((item) => item.trim())
+					.filter((item) => item !== '' && accept(key, item)),
+			),
 		]
 		if (items.length > 0) out.push([heading, items.slice(0, cap)])
 	}
@@ -115,10 +131,11 @@ export function createMemoryPromoter(options: MemoryPromoterOptions): PromoteMem
 	const cap = options.maxPerCategory ?? 20
 	if (!Number.isSafeInteger(cap) || cap < 1)
 		throw new Error('maxPerCategory must be a positive integer')
+	const accept = options.acceptClaim ?? (() => true)
 	const tags = [SESSION_MEMORY_TAG, ...(options.tags ?? [])]
 
 	return async (candidate: SessionMemoryCandidate): Promise<void> => {
-		const sections = knowledge(candidate, cap)
+		const sections = knowledge(candidate, cap, accept)
 		// Nothing learned, nothing written. Not an empty record: a store full
 		// of rows describing runs that discovered nothing is a store whose
 		// search results are mostly noise, and the model reads that store.