hippo-memory 1.36.0 → 1.38.0

package/dist/autolearn.d.ts

@@ -13,6 +13,22 @@ export declare function captureError(exitCode: number, stderr: string, command:
  * Looks for fix:, revert:, bug:, error:, hotfix: commit messages.
  */
 export declare function extractLessons(gitLog: string, customPatterns?: string[]): string[];
+/**
+ * Split parsed lessons into ones worth storing and low-information ones.
+ *
+ * `extractLessons` is a published API surface (exported from src/index.ts)
+ * and does one job: parse a git log into candidate lesson strings. Adding a
+ * quality check inside it would break that contract and silently change
+ * what external callers get back. So parsing and admission are separate
+ * steps: this function is the write-path gate, called by each caller that
+ * actually stores a lesson, not by the parser itself.
+ *
+ * Order is preserved in both output arrays.
+ */
+export declare function partitionLessons(lessons: string[]): {
+    kept: string[];
+    dropped: string[];
+};
 /**
  * Check if a substantially similar memory already exists.
  * Returns true if overlap > threshold (default 0.7).

package/dist/autolearn.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"autolearn.d.ts","sourceRoot":"","sources":["../src/autolearn.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,WAAW,EAAuB,MAAM,aAAa,CAAC;AAI/D;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,GACd,WAAW,CAoBb;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAsClF;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,kBAAkB,EAAE,MAAM,GAAG,WAAW,EAAE,EAC1C,MAAM,EAAE,MAAM,EACd,SAAS,SAAM,EACf,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAWT;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAwBzF;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAY9C;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAS7D"}
+{"version":3,"file":"autolearn.d.ts","sourceRoot":"","sources":["../src/autolearn.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,WAAW,EAAuB,MAAM,aAAa,CAAC;AAK/D;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,GACd,WAAW,CAoBb;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAsClF;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG;IAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,OAAO,EAAE,MAAM,EAAE,CAAA;CAAE,CAWzF;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,kBAAkB,EAAE,MAAM,GAAG,WAAW,EAAE,EAC1C,MAAM,EAAE,MAAM,EACd,SAAS,SAAM,EACf,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAWT;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAwBzF;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAY9C;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAS7D"}

package/dist/autolearn.js

@@ -6,6 +6,7 @@ import { execSync, execFileSync, spawn } from 'child_process';
 import { createMemory, Layer } from './memory.js';
 import { loadAllEntries } from './store.js';
 import { textOverlap } from './search.js';
+import { isContentWorthStoring } from './audit.js';
 /**
  * Create a MemoryEntry capturing a command failure.
  * Content format: "Command '<cmd>' failed: <truncated stderr>"
@@ -68,6 +69,31 @@ export function extractLessons(gitLog, customPatterns) {
     // Deduplicate exact matches at extraction time
     return [...new Set(lessons)];
 }
+/**
+ * Split parsed lessons into ones worth storing and low-information ones.
+ *
+ * `extractLessons` is a published API surface (exported from src/index.ts)
+ * and does one job: parse a git log into candidate lesson strings. Adding a
+ * quality check inside it would break that contract and silently change
+ * what external callers get back. So parsing and admission are separate
+ * steps: this function is the write-path gate, called by each caller that
+ * actually stores a lesson, not by the parser itself.
+ *
+ * Order is preserved in both output arrays.
+ */
+export function partitionLessons(lessons) {
+    const kept = [];
+    const dropped = [];
+    for (const lesson of lessons) {
+        if (isContentWorthStoring(lesson)) {
+            kept.push(lesson);
+        }
+        else {
+            dropped.push(lesson);
+        }
+    }
+    return { kept, dropped };
+}
 /**
  * Check if a substantially similar memory already exists.
  * Returns true if overlap > threshold (default 0.7).

package/dist/autolearn.js.map

@@ -1 +1 @@
-{"version":3,"file":"autolearn.js","sourceRoot":"","sources":["../src/autolearn.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAC9D,OAAO,EAAe,YAAY,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,MAAc,EACd,OAAe;IAEf,uEAAuE;IACvE,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC;IACzC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,wFAAwF;IACxF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,mCAAmC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,YAAY,CAAC;IAChG,MAAM,OAAO,GAAG,YAAY,OAAO,kBAAkB,QAAQ,MAAM,SAAS,GAAG,MAAM,EAAE,CAAC;IAExF,wEAAwE;IACxE,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACpC,IAAI,OAAO;QAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE3D,OAAO,YAAY,CAAC,OAAO,EAAE;QAC3B,KAAK,EAAE,KAAK,CAAC,QAAQ;QACrB,IAAI;QACJ,MAAM,EAAE,WAAW;QACnB,UAAU,EAAE,UAAU;KACvB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,cAAyB;IACtE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEjC,gDAAgD;IAChD,sFAAsF;IACtF,MAAM,QAAQ,GAAG,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,2EAA2E,CAAC;IAC1H,MAAM,QAAQ,GAAG;QACf,IAAI,MAAM,CAAC,kBAAkB,QAAQ,yBAAyB,EAAE,GAAG,CAAC;QACpE,IAAI,MAAM,CAAC,KAAK,QAAQ,yBAAyB,EAAE,GAAG,CAAC;QACvD,sDAAsD;QACtD,kFAAkF;KACnF,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9G,SAAS;QACX,CAAC;QAED,qGAAqG;QACrG,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QAE3D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,EAAE,CAAC;gBACN,uFAAuF;gBACvF,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;oBAC7C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;gBACD,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,kBAA0C,EAC1C,MAAc,EACd,SAAS,GAAG,GAAG,EACf,QAAiB;IAEjB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC/C,CAAC,CAAC,kBAAkB;QACpB,CAAC,CAAC,cAAc,CAAC,kBAAkB,EAAE,QAAQ,CAAC,CAAC;IAEjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,OAAO,GAAG,SAAS;YAAE,OAAO,IAAI,CAAC;IACvC,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe;IACxC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,sEAAsE;QACtE,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAErF,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YACxC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,gCAAgC;YAChC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAmB,EAAE,EAAE;YACxC,OAAO,CAAC;gBACN,QAAQ,EAAE,IAAI,IAAI,CAAC;gBACnB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;aACrD,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAU,EAAE,EAAE;YAC/B,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,GAAW;IACnC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAAC,qCAAqC,EAAE;YAC1D,QAAQ,EAAE,MAAM;YAChB,GAAG;YACH,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC;SACpC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,IAAY;IACnD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,EAAE;YAC9B,KAAK,EAAE,WAAW,IAAI,WAAW,EAAE,oBAAoB;SACxD,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/E,OAAO,GAAG,CAAC;IACb,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC"}
+{"version":3,"file":"autolearn.js","sourceRoot":"","sources":["../src/autolearn.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAC9D,OAAO,EAAe,YAAY,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAC/D,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AAEnD;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,MAAc,EACd,OAAe;IAEf,uEAAuE;IACvE,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC;IACzC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;IAClD,wFAAwF;IACxF,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,mCAAmC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,YAAY,CAAC;IAChG,MAAM,OAAO,GAAG,YAAY,OAAO,kBAAkB,QAAQ,MAAM,SAAS,GAAG,MAAM,EAAE,CAAC;IAExF,wEAAwE;IACxE,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACpC,IAAI,OAAO;QAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE3D,OAAO,YAAY,CAAC,OAAO,EAAE;QAC3B,KAAK,EAAE,KAAK,CAAC,QAAQ;QACrB,IAAI;QACJ,MAAM,EAAE,WAAW;QACnB,UAAU,EAAE,UAAU;KACvB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,cAAyB;IACtE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEjC,gDAAgD;IAChD,sFAAsF;IACtF,MAAM,QAAQ,GAAG,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,2EAA2E,CAAC;IAC1H,MAAM,QAAQ,GAAG;QACf,IAAI,MAAM,CAAC,kBAAkB,QAAQ,yBAAyB,EAAE,GAAG,CAAC;QACpE,IAAI,MAAM,CAAC,KAAK,QAAQ,yBAAyB,EAAE,GAAG,CAAC;QACvD,sDAAsD;QACtD,kFAAkF;KACnF,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9G,SAAS;QACX,CAAC;QAED,qGAAqG;QACrG,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QAE3D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,EAAE,CAAC;gBACN,uFAAuF;gBACvF,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;oBAC7C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC;gBACD,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAiB;IAChD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,kBAA0C,EAC1C,MAAc,EACd,SAAS,GAAG,GAAG,EACf,QAAiB;IAEjB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC;QAC/C,CAAC,CAAC,kBAAkB;QACpB,CAAC,CAAC,cAAc,CAAC,kBAAkB,EAAE,QAAQ,CAAC,CAAC;IAEjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,OAAO,GAAG,SAAS;YAAE,OAAO,IAAI,CAAC;IACvC,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe;IACxC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,sEAAsE;QACtE,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAErF,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,EAAE;YACxC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,gCAAgC;YAChC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAmB,EAAE,EAAE;YACxC,OAAO,CAAC;gBACN,QAAQ,EAAE,IAAI,IAAI,CAAC;gBACnB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;aACrD,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAU,EAAE,EAAE;YAC/B,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,GAAW;IACnC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAAC,qCAAqC,EAAE;YAC1D,QAAQ,EAAE,MAAM;YAChB,GAAG;YACH,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC;SACpC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC;IAC/B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,IAAY;IACnD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,EAAE;YAC9B,KAAK,EAAE,WAAW,IAAI,WAAW,EAAE,oBAAoB;SACxD,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/E,OAAO,GAAG,CAAC;IACb,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC"}

package/dist/cli.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cli.d.ts","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AA2BH,OAAO,EASL,WAAW,EAEZ,MAAM,aAAa,CAAC;AA4GrB,OAAO,KAAK,GAAG,MAAM,UAAU,CAAC;AA4ChC,kFAAkF;AAClF,wBAAgB,8BAA8B,IAAI,IAAI,CAErD;AA4ID,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC,CAAA;CAAE,CAwCjI;AAutED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,MAAqB,GAAG,MAAM,CAyF3F;AAyGD;;;GAGG;AACH,oHAAoH;AACpH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,WAAW,GAAG,IAAI,CAuD/D;AA2jGD,oHAAoH;AACpH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,KAAK,CAAC;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAA;CAAE,CAAC,EACtF,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,MAAkB,GAC1B,IAAI,CA6BN"}
+{"version":3,"file":"cli.d.ts","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AA2BH,OAAO,EASL,WAAW,EAEZ,MAAM,aAAa,CAAC;AA6GrB,OAAO,KAAK,GAAG,MAAM,UAAU,CAAC;AA4ChC,kFAAkF;AAClF,wBAAgB,8BAA8B,IAAI,IAAI,CAErD;AA4ID,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,EAAE,CAAC,CAAA;CAAE,CAwCjI;AA6xED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,GAAE,MAAqB,GAAG,MAAM,CAyF3F;AAyGD;;;GAGG;AACH,oHAAoH;AACpH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,WAAW,GAAG,IAAI,CAuD/D;AA2jGD,oHAAoH;AACpH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,KAAK,CAAC;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAA;CAAE,CAAC,EACtF,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,MAAkB,GAC1B,IAAI,CA6BN"}

package/dist/cli.js

@@ -54,7 +54,7 @@ import { loadConfig } from './config.js';
 import { openHippoDb, closeHippoDb } from './db.js';
 import { pushGoal, getActiveGoals, completeGoal, suspendGoal, resumeGoal, applyGoalStackBoost } from './goals.js';
 import { rowToGoal } from './goals.js';
-import { captureError, extractLessons, deduplicateLesson, runWatched, fetchGitLog, isGitRepo, } from './autolearn.js';
+import { captureError, extractLessons, partitionLessons, deduplicateLesson, runWatched, fetchGitLog, isGitRepo, } from './autolearn.js';
 import { extractInvalidationTarget, invalidateMatching } from './invalidation.js';
 import { extractPathTags } from './path-context.js';
 import { detectScope } from './scope.js';
@@ -316,6 +316,11 @@ function cmdInitScan(scanDir, flags) {
         console.log(`Initialized global store at ${globalRoot}\n`);
     }
     let totalLessons = 0;
+    // Rolled up so the cross-repo summary reports the gate too. Each repo
+    // already prints its own count inside learnFromRepo, but the aggregate
+    // line showed only what was ADDED - and the point of this change is
+    // that a dropped subject is never invisible.
+    let totalLowInfo = 0;
     const seedDays = parseInt(String(flags['days'] ?? '365'), 10);
     for (const repo of repos) {
         const name = path.basename(repo);
@@ -331,12 +336,15 @@ function cmdInitScan(scanDir, flags) {
             const result = learnFromRepo(repoHippo, repo, seedDays, name);
             added = result.added;
             totalLessons += added;
+            totalLowInfo += result.lowInfo;
         }
         const status = alreadyExists ? 'existing' : 'new';
         const entries = loadAllEntries(repoHippo);
         console.log(`  ${name.padEnd(25)} ${status.padEnd(10)} ${entries.length} memories${added > 0 ? ` (+${added} from git)` : ''}`);
     }
-    console.log(`\n${repos.length} repositories, ${totalLessons} new lessons learned.`);
+    console.log(`\n${repos.length} repositories, ${totalLessons} new lessons learned` +
+        (totalLowInfo > 0 ? `, ${totalLowInfo} low-information subject(s) dropped` : '') +
+        '.');
     console.log(`Global store: ${globalRoot}`);
     if (!flags['no-schedule']) {
         setupDailySchedule(globalRoot);
@@ -781,9 +789,21 @@ async function cmdRecall(hippoRoot, query, flags) {
     let globalEntries = isInitialized(globalRoot) ? loadRecallSearchEntries(globalRoot, query, undefined, tenantId, requestedScopeForFilter, 'additive') : [];
     // v1.12.13 / C5 — WYSIATI counters. Track filter activity per the plan v3
     // Task 3 mapping table. dropped_pre_rank is the SUM of all non-budget
-    // filter drops (pre-rank AND post-rank). Search-engine internal drops
-    // (scored-to-zero rows that hybridSearch/physicsSearch returns fewer of)
-    // are NOT counted in v1 — they are part of the rank step, not a filter.
+    // filter drops (pre-rank AND post-rank); its meaning is unchanged by C5.
+    //
+    // C5 (2026-08-24): search-engine internal drops (scored-to-zero rows that
+    // hybridSearch/physicsSearch returns fewer of than they were given) now
+    // count toward droppedByBudget, not "not counted at all" as the old v1
+    // convention had it. That old convention is exactly why the `Cutoff:` line
+    // never printed: cmdRecall measured droppedByBudget from `results.length -
+    // limit` (cli.ts ~1547) AFTER the search call, but `results` had already
+    // been ranked and truncated by the search engine to a handful of rows, so
+    // `limit < results.length` was almost always false and the counter stayed
+    // 0 while hundreds of candidates silently vanished (see the plan's measured
+    // table: 397 of 400 candidates gone, every counter reading 0). droppedByBudget
+    // is now derived as "everything not attributed to a named pre-rank filter",
+    // computed after the final `--limit` slice — see the definition near
+    // line ~1545 for the exact formula and the double-count argument.
     // totalCandidates = post-SQL-predicate count (api.recall parity: measured
     // after loadRecallSearchEntries, before the JS scope filter). NOTE the
     // v1.12.13 accounting convention: SQL-excluded rows (quarantine + the
@@ -792,6 +812,9 @@ async function cmdRecall(hippoRoot, query, flags) {
     // defense-in-depth (LIKE/regex divergence, exact-mode mismatch).
     const totalCandidatesCountCmd = localEntries.length + globalEntries.length;
     let droppedPreRankCountCmd = 0;
+    // Graph expansion adds candidates AFTER totalCandidatesCountCmd is taken,
+    // so they are folded back in before the budget residual is derived.
+    let graphAddedCountCmd = 0;
     // v1.25.0: JS half of the recall scope rule (private-scope regex deny with
     // explicit-request unlock), via the canonical helper — do not inline a
     // fourth copy of this predicate.
@@ -979,6 +1002,19 @@ async function cmdRecall(hippoRoot, query, flags) {
             }
         }
         if (hops > 0) {
+            // graphExpandRecall can SURFACE rows that were never in the lexical
+            // candidate pool (a graph neighbour reached by entity edge, not by
+            // query match), and totalCandidatesCountCmd was snapshotted before the
+            // search. Without this the derived budget count goes negative, clamps
+            // to 0, and the accounting silently breaks: 1 candidate, 2 returned,
+            // 0 drops. Found independently by two reviewers. Count the additions
+            // so the invariant holds on graph-expanded recalls too.
+            // GROSS, not net. graphExpandRecall both adds neighbours AND evicts weak
+            // base rows in one call (graph-recall.ts:285), so a net delta of 0 hides
+            // 3 added + 3 evicted: the additions escape the candidate total and the
+            // evictions escape the drop count, and the Cutoff line goes silent again.
+            // Compare ID sets so both directions are counted.
+            const beforeGraphIds = new Set(results.map((r) => r.entry.id));
             results = graphExpandRecall(results, {
                 hops,
                 maxNeighbors,
@@ -993,6 +1029,11 @@ async function cmdRecall(hippoRoot, query, flags) {
                     ? { requested: recallExplicitScope, additive: true }
                     : {},
             });
+            // Rows the graph surfaced that the lexical pool never held.
+            for (const r of results) {
+                if (!beforeGraphIds.has(r.entry.id))
+                    graphAddedCountCmd++;
+            }
         }
     }
     // ACC EVC-adaptive recall (RESEARCH.md §PFC.ACC). When the initial top-K is
@@ -1339,12 +1380,29 @@ async function cmdRecall(hippoRoot, query, flags) {
         results = results.filter((r) => r.entry.layer === layerFilter);
         droppedPreRankCountCmd += beforeLayerFilter - results.length;
     }
-    // v1.12.13 / C5 — WYSIATI dropped_by_budget counter (final limit cut).
-    let droppedByBudgetCountCmd = 0;
+    // v1.12.13 / C5 — WYSIATI dropped_by_budget counter. Apply the final
+    // `--limit` slice first, then derive the count ARITHMETICALLY as
+    // "everything lost that droppedPreRank did not already claim":
+    //
+    //   droppedByBudget = totalCandidates - droppedPreRank - returned
+    //
+    // This is the invariant the plan requires (totalCandidates == droppedPreRank
+    // + droppedByBudget + returned) restated as an assignment, so it holds by
+    // construction rather than by two counters happening to agree. It also
+    // cannot double-count the post-search droppedPreRank sites (--filter-
+    // conflicts, --outcome, --layer, ~1270/1528/1541): those are subtracted
+    // once here, not re-counted, because this line does not re-walk any filter
+    // — it only compares the two totals already tracked above. Everything left
+    // over — search-engine internal rank-step drops AND the `--limit` slice
+    // itself — lands in droppedByBudget, per the C5 accounting change in the
+    // comment near line ~976. Clamped at 0 as a defensive floor: if a future
+    // pipeline change ever returns MORE rows than totalCandidates minus
+    // droppedPreRank (should not happen), report "nothing dropped" rather than
+    // a negative count.
     if (limit < results.length) {
-        droppedByBudgetCountCmd = results.length - limit;
         results = results.slice(0, limit);
     }
+    const droppedByBudgetCountCmd = Math.max(0, totalCandidatesCountCmd + graphAddedCountCmd - droppedPreRankCountCmd - results.length);
     // v0.33 / J1 — CLI per-pipeline anchoring detector. Each pipeline (api.recall,
     // cmdRecall, MCP) computes its own AnchoringHint via the shared detectAnchoring
     // helper against its own top-1 + its own per-(tenant, session) ring buffer.
@@ -1385,7 +1443,13 @@ async function cmdRecall(hippoRoot, query, flags) {
     // interference; query_repeat is a re-ask, not memory competition).
     const cmdSuppressedByInterference = cmdAnchoringHint?.reason === 'memory_dominance' ? 1 : 0;
     const cmdSuppressionSummary = api.buildSuppressionSummary({
-        totalCandidates: totalCandidatesCountCmd,
+        // PUBLISHED total includes graph-surfaced rows. Folding graphAdded into
+        // the derivation but not into the reported total made the invariant hold
+        // internally and break externally by exactly that count: JSON consumers
+        // saw total != preRank + byBudget + returned, and the text line could
+        // read "showing 8 of 10" having actually considered 12. The number a
+        // caller sees must be the number the arithmetic used.
+        totalCandidates: totalCandidatesCountCmd + graphAddedCountCmd,
         droppedPreRank: droppedPreRankCountCmd,
         droppedByBudget: droppedByBudgetCountCmd,
         summarySubstitutionsAdded: 0,
@@ -1761,8 +1825,12 @@ async function cmdRecall(hippoRoot, query, flags) {
     if (showWhy) {
         const s = cmdSuppressionSummary;
         const clauses = [];
+        // "dropped to fit limit" pointed at the wrong control: the residual covers
+        // search-ranking and token-budget drops too, and fires even when --limit
+        // was never passed. Measured: `recall --budget 20 --why` printed "39
+        // dropped to fit limit" with no --limit flag in the command at all.
         if (s.droppedByBudget > 0)
-            clauses.push(`${s.droppedByBudget} dropped to fit limit`);
+            clauses.push(`${s.droppedByBudget} not shown (rank, budget or limit)`);
         if (s.droppedPreRank > 0)
             clauses.push(`${s.droppedPreRank} filtered pre-rank`);
         if (s.summarySubstitutionsAdded > 0)
@@ -5770,18 +5838,49 @@ function learnFromRepo(hippoRoot, repoPath, days, label) {
     const prefix = label ? `[${label}] ` : '';
     if (!isGitRepo(repoPath)) {
         console.log(`${prefix}No git history found (or not a git repository).`);
-        return { added: 0, skipped: 0 };
+        return { added: 0, skipped: 0, lowInfo: 0 };
     }
     const gitLog = fetchGitLog(repoPath, days);
     if (!gitLog.trim()) {
         console.log(`${prefix}No fix/revert/bug commits found in the specified period.`);
-        return { added: 0, skipped: 0 };
+        return { added: 0, skipped: 0, lowInfo: 0 };
     }
-    const lessons = extractLessons(gitLog);
-    if (lessons.length === 0) {
+    const parsedLessons = extractLessons(gitLog);
+    if (parsedLessons.length === 0) {
         console.log(`${prefix}No fix/revert/bug commits found in the specified period.`);
-        return { added: 0, skipped: 0 };
+        return { added: 0, skipped: 0, lowInfo: 0 };
     }
+    // DF4: admission gate lives at the write path, not in extractLessons
+    // (a published API surface that only parses). Bare subjects like "fixed
+    // signals" are dropped here, before they ever become a memory.
+    // The gate filters the loop INPUT, so a dropped lesson neither stores nor
+    // invalidates. That is deliberate, and it was argued both ways.
+    //
+    // Round 1 of review called the lost invalidation a P1: a migration subject
+    // too thin to store ("replace webpack with vite") would stop weakening
+    // stale webpack memories. True. So the loop was widened to walk every
+    // parsed lesson with the gate on the write alone.
+    //
+    // Round 2 then found the cure was worse. STORAGE is what makes invalidation
+    // idempotent here: a stored lesson is recognised by deduplicateLesson on
+    // the next scan and short-circuits before invalidating again. A lesson that
+    // invalidates but is never stored has no such record, so every rescan
+    // re-invalidates, and invalidateMatching halves half_life_days each time.
+    // Measured: 7 -> 3 -> 1 over two runs. That is compounding data damage.
+    //
+    // Measured frequency decided it. Across 413 real auto-learn rows in 4
+    // stores, 24 are gated and ZERO of those carry an invalidation target; the
+    // 45 lessons that do carry targets all pass the gate and are unaffected
+    // either way. Both failure modes are empty on real data, so the tie breaks
+    // on which one is benign if it ever fires: not invalidating is a missed
+    // improvement, re-invalidating forever is damage.
+    //
+    // Documented limitation, pinned by test: a migration subject too thin to
+    // store also does not invalidate. Making invalidateMatching idempotent
+    // would allow both, and is backlogged - it is a latent issue for the manual
+    // `hippo invalidate` path too, not just this one.
+    const { kept: lessons, dropped } = partitionLessons(parsedLessons);
+    const lowInfo = dropped.length;
     let added = 0;
     let skipped = 0;
     // AT1 (plan §3 containment): per-lesson refusal must not abort the rest
@@ -5841,8 +5940,9 @@ function learnFromRepo(hippoRoot, repoPath, days, label) {
     }
     console.log(`${prefix}${added} new lessons added, ${skipped} duplicates skipped` +
         (rejected > 0 ? `, ${rejected} rejected value(s) skipped` : '') +
+        (lowInfo > 0 ? `, ${lowInfo} low-information subject(s) dropped` : '') +
         '.');
-    return { added, skipped };
+    return { added, skipped, lowInfo };
 }
 function cmdLearn(hippoRoot, flags) {
     requireInit(hippoRoot);