@nxuss/lemma 1.19.0 → 1.21.0

package/dist/esm/subconscious/TheBrainV2.d.ts

@@ -176,8 +176,15 @@ export interface ClaimFreshness {
  * gets for a purged entry, a renamed symbol's old claim, or an id from another project.
  */
 export interface VerifyMemoryResult {
+    /**
+     * 'fresh' means every tracked artifact still hashes the same. 'untracked' means the memory
+     * tracks nothing at all, so there was nothing to check — never folded into 'fresh', because
+     * a caller reading 'fresh' is being told the memory was validated against current code.
+     */
+    status: 'fresh' | 'stale' | 'unverified' | 'unknown' | 'untracked';
     id: string;
-    status: 'fresh' | 'stale' | 'unverified' | 'unknown';
+    /** Files/symbols/upstream memories this id is judged against. 0 on 'untracked'. */
+    trackedArtifacts?: number;
     staleFiles?: string[];
     /** Only set when `id` resolved to an entry that itself has per-claim tracking. */
     claimBreakdown?: ClaimFreshness[];
@@ -287,6 +294,12 @@ export interface BrainStats {
     staleEntries?: number;
     /** Only under { deep: true }: staleEntries as a fraction of entries that track anything. */
     staleRatio?: number;
+    /**
+     * Entries tracking no file, symbol, claim evidence or upstream memory at all — the ones
+     * `verify_memory` reports as `untracked` because there is nothing there to check. Cheap
+     * (no hashing), so it is always computed, unlike staleEntries.
+     */
+    untrackedEntries?: number;
 }
 /**
  * Union two views of the corpus. Never subtracts: an id present in either side survives
@@ -419,6 +432,18 @@ export interface FreshnessOutcome {
  * `fresh`.
  */
 export declare function checkEntryFreshness(entry: BrainEntry, resolver: EvidenceResolver, resolveNode?: (id: string) => FreshnessNode | undefined, depth?: number, visited?: Set<string>, semanticDiff?: boolean): FreshnessOutcome;
+/**
+ * How many artifacts an entry's freshness is actually judged against: tracked files, tracked
+ * symbols, upstream memories, and each claim's own evidence.
+ *
+ * Zero means a freshness check has nothing to compare — and reporting that as `fresh` conflates
+ * "validated against the code" with "there was nothing to validate", which are opposite
+ * guarantees for a caller about to act on the memory. `verify_memory` reports those as
+ * `untracked` instead; see VerifyMemoryResult.
+ */
+export declare function trackedArtifactCount(entry: BrainEntry): number;
+/** Claim-level counterpart to trackedArtifactCount. */
+export declare function trackedClaimArtifactCount(claim: Claim): number;
 /**
  * Same hash-compare as checkEntryFreshness, scoped to one claim's own evidence — a claim
  * with no fileHashes/symbolHashes at all is always fresh (nothing tracked to go stale).
@@ -439,9 +464,20 @@ export declare class TheBrainV2 {
     private diskStamp;
     /** id -> ISO deletion time, for ids that must not come back through a merge. */
     private tombstones;
+    /**
+     * id -> terms of that entry's own `query` field. Derived state, never persisted: `terms`
+     * covers query+response together, so scoring the query field on its own (see the
+     * QUERY_FIELD_BOOST block in search()) needs it split back out. Memoized because a search
+     * touches every candidate and re-tokenizing a prompt per candidate per search is pure waste.
+     * Dropped whenever the entry changes or leaves the corpus — a stale entry here would boost
+     * a memory for words its prompt no longer contains.
+     */
+    private queryTermCache;
     constructor();
     private ensureDir;
     private load;
+    /** Terms of an entry's own `query`, memoized. See queryTermCache. */
+    private queryTermsOf;
     /** Recomputes the inverted index from scratch over the current entries. */
     private rebuildIndex;
     /**
@@ -551,6 +587,28 @@ export declare class TheBrainV2 {
      * without deleting the entry — a bad-fit-today memory may still be exactly right for a
      * differently-phrased query tomorrow.
      */
+    /**
+     * One memory, by id, body included.
+     *
+     * The Brain had no deterministic read: `verifyByIds` answers "is it still true" without
+     * returning the text, and `search()` — the only path to the body — is a ranking, so an agent
+     * holding an id could still fail to retrieve the memory it had just written. Editing a
+     * long-lived entry under those conditions means reconstructing its text from whatever a
+     * search happened to surface, which is how the accumulated content in it gets lost.
+     *
+     * Returns a copy: callers must not mutate the corpus by holding a reference. Use update()
+     * to change a memory.
+     */
+    getEntry(id: string): BrainEntry | undefined;
+    /**
+     * The entry a claim id belongs to, plus the claim itself. Claim ids and entry ids are handed
+     * back side by side by search_memory and verify_memory, so an id pasted into a read is as
+     * likely to be one as the other — resolving only entries would report a live claim as missing.
+     */
+    getClaim(id: string): {
+        entry: BrainEntry;
+        claim: Claim;
+    } | undefined;
     downvote(id: string): {
         ok: boolean;
         message: string;
@@ -575,9 +633,11 @@ export declare class TheBrainV2 {
         forgotten?: {
             id: string;
             query: string;
+            response: string;
             timestamp: string;
             hits: number;
         };
+        archivePath?: string;
     };
     /**
      * Re-verify a memory against the code as it stands now, keeping its identity.
@@ -598,6 +658,13 @@ export declare class TheBrainV2 {
      * a memory that is itself stale is exactly what Fase B exists to catch, and silently
      * clearing that would defeat it. Those come back in `stillStale` instead.
      */
+    /**
+     * Re-hash an entry's evidence, either in place or against newly named files/symbols.
+     * Shared by refresh() ("I checked, this is still true") and update() ("here is the corrected
+     * text"), which make the same assertion about the same code and so must anchor identically.
+     * Mutates `entry`; returns the labels of what it now tracks.
+     */
+    private reanchorEvidence;
     refresh(id: string, opts?: {
         filePaths?: string[];
         symbols?: SymbolRef[];
@@ -608,6 +675,40 @@ export declare class TheBrainV2 {
         retracked?: string[];
         stillStale?: string[];
     };
+    /**
+     * Replace an existing memory's content, keeping its identity.
+     *
+     * The Brain could add and it could delete, but it could not correct: store() mints a new id
+     * per call, so re-storing a corrected version under the same query left the outdated one in
+     * place, and a later search returned an arbitrary slice of every historical version —
+     * including the ones that contradict each other. That is the mechanism behind an
+     * append-only pile of near-duplicate "canonical index" entries: not a convention nobody
+     * followed, a convention the API could not express. refresh() keeps identity but only
+     * re-hashes evidence, and has no way to accept new text. This is that missing operation.
+     *
+     * Kept: id, hits, demerits, creation timestamp, projectId, source, and every `derivedFrom`
+     * edge elsewhere in the corpus that points at this id. Replaced: whatever the patch names.
+     * Evidence is re-anchored exactly as refresh() does — rewriting a memory's content asserts
+     * the same thing refresh() records, that the caller checked it against the code as it is now.
+     */
+    update(id: string, patch?: {
+        query?: string;
+        response?: string;
+        filePaths?: string[];
+        symbols?: SymbolRef[];
+        claims?: ClaimInput[];
+        outcome?: 'confirmed' | 'failed';
+        domain?: string;
+        derivedFrom?: string[];
+    }): {
+        ok: boolean;
+        message: string;
+        id?: string;
+        fresh?: boolean;
+        retracked?: string[];
+        stillStale?: string[];
+        charDelta?: number;
+    };
     /**
      * Revalidate ids from a prior search_memory/store_memory result via hash-compare only —
      * no BM25, no `search()`. `ids` may mix entry ids and claim ids freely; each resolves

package/dist/esm/subconscious/TheBrainV2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TheBrainV2.d.ts","sourceRoot":"","sources":["../../../src/subconscious/TheBrainV2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAcxE,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAInB,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC;;;;;OAKG;IACH,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC;;;;;;;;OAQG;IACH,sBAAsB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChD;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC;IACjB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,MAAM,WAAW,GACnB,QAAQ,GACR,WAAW,GACX,iBAAiB,GACjB,UAAU,GACV,gBAAgB,GAChB,QAAQ,CAAC;AAEb;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,mDAAmD;IACnD,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,yFAAyF;IACzF,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAC;CACrB;AAED,MAAM,WAAW,KAAK;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC,sBAAsB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjD;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,iGAAiG;IACjG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,oGAAoG;IACpG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,YAAY,GAAG,SAAS,CAAC;IACrD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,kFAAkF;IAClF,cAAc,CAAC,EAAE,cAAc,EAAE,CAAC;IAClC,iGAAiG;IACjG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,yGAAyG;IACzG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,oEAAoE;IACpE,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,sDAAsD;IACtD,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,sFAAsF;IACtF,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,OAAO,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,iGAAiG;IACjG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B;;;;;OAKG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,4FAA4F;IAC5F,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,MAAM,MAAM,UAAU,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;AAE9D,MAAM,WAAW,kBAAkB;IACjC;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qFAAqF;IACrF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;OAMG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,gBAAgB,CAAC;CAC7B;AAED,MAAM,WAAW,UAAU;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IAMpB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,8DAA8D;IAC9D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qFAAqF;IACrF,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,6DAA6D;IAC7D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,mDAAmD;IACnD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,uEAAuE;IACvE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,4FAA4F;IAC5F,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AA4LD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAC7B,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAC/B,UAAU,GAAE,GAAG,CAAC,MAAM,CAAa,GAClC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAmBzB;AAiBD,wBAAgB,iBAAiB,CAAC,GAAG,GAAE,MAAsB,GAAG;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAwBnG;AAED,sFAAsF;AACtF,wBAAgB,oBAAoB,IAAI,IAAI,CAE3C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,UAAU,EACjB,GAAG,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,GACxC;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,CAKrD;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,WAAW,GAAG,SAAS,CAUtE;AAID;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,GAAG,GAAE,MAAsB,GAAG,MAAM,CAqCnE;AAID;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CA+D/C;AAoDD;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAMvE;AAgBD,qBAAa,WAAW;IACtB,OAAO,CAAC,IAAI,CAAa;gBAEb,UAAU,CAAC,EAAE,MAAM;IAQ/B,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAOvB,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAQ1B,SAAS,IAAI,MAAM;CAGpB;AAID,wBAAgB,SAAS,CACvB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACnC,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,EACpB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC1B,MAAM,CAWR;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAO9E;AA6CD,+EAA+E;AAC/E,MAAM,MAAM,aAAa,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,CAAC;AAEnG;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAChC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAC9B,EAAE,EAAE,MAAM,GACT,aAAa,GAAG,SAAS,CAM3B;AAED,yFAAyF;AACzF,wBAAgB,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAOpF;AAED;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAInC,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC;IACxB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC,qHAAqH;IACrH,GAAG,EAAE,QAAQ,GAAG,SAAS,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,cAAc,EAAE,CAAC;IACvB,8FAA8F;IAC9F,UAAU,EAAE,cAAc,EAAE,CAAC;CAC9B;AA6ED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAChC,QAAQ,EAAE,MAAM,EAChB,UAAU,CAAC,EAAE,MAAM,GAClB,iBAAiB,CAqCnB;AAED,+FAA+F;AAC/F,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,OAAO,CAAC;IACf,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,mHAAmH;IACnH,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,UAAU,EACjB,QAAQ,EAAE,gBAAgB,EAC1B,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,aAAa,GAAG,SAAS,EACvD,KAAK,SAAI,EACT,OAAO,GAAE,GAAG,CAAC,MAAM,CAAa,EAChC,YAAY,UAAQ,GACnB,gBAAgB,CA6ElB;AAeD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,gBAAgB,EAC1B,YAAY,UAAQ,GACnB,cAAc,CAwDhB;AAID,qBAAa,UAAU;IACrB,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,KAAK,CAAkC;IAC/C,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,WAAW,CAAK;IACxB,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,UAAU,CAA8C;IAChE,+EAA+E;IAC/E,OAAO,CAAC,SAAS,CAAmB;IACpC,gFAAgF;IAChF,OAAO,CAAC,UAAU,CAAkC;;IASpD,OAAO,CAAC,SAAS;IAMjB,OAAO,CAAC,IAAI;IA6BZ,2EAA2E;IAC3E,OAAO,CAAC,YAAY;IAcpB;;;;;;;;;OASG;IACH,OAAO,CAAC,aAAa;IAoBrB,OAAO,CAAC,kBAAkB;IAM1B,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,IAAI;IAsDZ;;;;;;;OAOG;IACH,OAAO,CAAC,oBAAoB;IAQ5B;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAIjB,4FAA4F;IAC5F,OAAO,CAAC,eAAe;IAQvB,yFAAyF;IACzF,OAAO,CAAC,SAAS;IAYjB;;;OAGG;IACH,KAAK,CACH,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,QAAQ,SAAY,EACpB,YAAY,SAAO,EACnB,SAAS,CAAC,EAAE,MAAM,EAAE,EACpB,SAAS,GAAE,MAA0B,EACrC,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,EAChC,UAAU,CAAC,EAAE,SAAS,EAAE,EACxB,WAAW,CAAC,EAAE,UAAU,EAAE,EAC1B,MAAM,CAAC,EAAE,MAAM,EACf,WAAW,CAAC,EAAE,MAAM,EAAE,EACtB,OAAO,GAAE,iBAAsB,GAC9B;QACD,MAAM,EAAE,OAAO,CAAC;QAChB,MAAM,EAAE,MAAM,CAAC;QACf,EAAE,CAAC,EAAE,MAAM,CAAC;QACZ,SAAS,CAAC,EAAE,iBAAiB,CAAC;QAC9B,SAAS,CAAC,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,WAAW,GAAG,QAAQ,CAAA;SAAE,CAAC,CAAC;KACnF;IA2GD;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAQ;IAC3C,6FAA6F;IAC7F,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAO;IAE1C;;;;;;OAMG;IACH,OAAO,CAAC,mBAAmB;IA4B3B;;;OAGG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,KAAK,SAAI,EACT,aAAa,SAAI,EACjB,OAAO,GAAE,kBAAuB,GAC/B,iBAAiB,EAAE;IAmLtB;;;OAGG;IACH;;;;;;;;;;;OAWG;IACG,YAAY,CAChB,KAAK,EAAE,MAAM,EACb,KAAK,SAAI,EACT,aAAa,SAAI,EACjB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,EAAE,CAAC;IAoD/B,OAAO,CAAC,OAAO,CAAiC;IAEhD,OAAO,CAAC,gBAAgB;IAKxB,oBAAoB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE;IAQrD;;;OAGG;IACH,cAAc,CACZ,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,SAAS,SAAO,GACf;QAAE,WAAW,EAAE,OAAO,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,iBAAiB,CAAA;KAAE;IA6B7E;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG;QAAE,EAAE,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAWtD;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG;QAClB,EAAE,EAAE,OAAO,CAAC;QACZ,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,CAAC,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAC;KAC5E;IAqBD;;;;;;;;;;;;;;;;;;OAkBG;IACH,OAAO,CACL,EAAE,EAAE,MAAM,EACV,IAAI,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,CAAC,EAAE,SAAS,EAAE,CAAA;KAAO,GACzD;QACD,EAAE,EAAE,OAAO,CAAC;QACZ,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,CAAC,EAAE,OAAO,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;QACrB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;KACvB;IAiFD;;;;;;OAMG;IACH,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE;QAAE,YAAY,CAAC,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAA;KAAO,GAAG,kBAAkB,EAAE;IAgDvH;;;;OAIG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,iBAAiB;IAOzE;;;;;;;OAOG;IACH,YAAY,CAAC,IAAI,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,YAAY,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG;QACxF,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,YAAY,EAAE,MAAM,CAAC;KACtB;IA+BD;;;;;;;;;;;;OAYG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE;QAAE,UAAU,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG;QAC/D,EAAE,EAAE,OAAO,CAAC;QACZ,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;KACjB;IA6FD;;;;;;;OAOG;IACH,QAAQ,CAAC,OAAO,GAAE;QAAE,IAAI,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG,UAAU;IAwDtD,KAAK,IAAI,IAAI;CAkBd;AAMD,wBAAgB,QAAQ,IAAI,UAAU,CAGrC"}
+{"version":3,"file":"TheBrainV2.d.ts","sourceRoot":"","sources":["../../../src/subconscious/TheBrainV2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAOH,OAAO,KAAK,EAAE,QAAQ,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAcxE,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACH,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAInB,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC;;;;;OAKG;IACH,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC;;;;;;;;OAQG;IACH,sBAAsB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChD;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC;IACjB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;IACvB;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;;;;;OAOG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;GAIG;AACH,MAAM,MAAM,WAAW,GACnB,QAAQ,GACR,WAAW,GACX,iBAAiB,GACjB,UAAU,GACV,gBAAgB,GAChB,QAAQ,CAAC;AAEb;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,mDAAmD;IACnD,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,yFAAyF;IACzF,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAC;CACrB;AAED,MAAM,WAAW,KAAK;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACtC,sBAAsB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjD;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,OAAO,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,iGAAiG;IACjG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,oGAAoG;IACpG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC;;;;OAIG;IACH,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,YAAY,GAAG,SAAS,GAAG,WAAW,CAAC;IACnE,EAAE,EAAE,MAAM,CAAC;IACX,mFAAmF;IACnF,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB,kFAAkF;IAClF,cAAc,CAAC,EAAE,cAAc,EAAE,CAAC;IAClC,iGAAiG;IACjG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,yGAAyG;IACzG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,oEAAoE;IACpE,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,sDAAsD;IACtD,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,sFAAsF;IACtF,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,OAAO,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;IACtB;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,iGAAiG;IACjG,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAC3B;;;;;OAKG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,4FAA4F;IAC5F,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;;;GAKG;AACH,MAAM,MAAM,UAAU,GAAG,iBAAiB,GAAG,gBAAgB,CAAC;AAE9D,MAAM,WAAW,kBAAkB;IACjC;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qFAAqF;IACrF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;;;OAMG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,gBAAgB,CAAC;CAC7B;AAED,MAAM,WAAW,UAAU;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IAMpB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,8DAA8D;IAC9D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qFAAqF;IACrF,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,sFAAsF;IACtF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,6DAA6D;IAC7D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,mDAAmD;IACnD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,uEAAuE;IACvE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,4FAA4F;IAC5F,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AA0ND;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAC7B,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAC/B,UAAU,GAAE,GAAG,CAAC,MAAM,CAAa,GAClC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAmBzB;AAiBD,wBAAgB,iBAAiB,CAAC,GAAG,GAAE,MAAsB,GAAG;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAwBnG;AAED,sFAAsF;AACtF,wBAAgB,oBAAoB,IAAI,IAAI,CAE3C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,UAAU,EACjB,GAAG,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,GACxC;IAAE,UAAU,EAAE,UAAU,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,CAKrD;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,WAAW,GAAG,SAAS,CAUtE;AAID;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,GAAG,GAAE,MAAsB,GAAG,MAAM,CAqCnE;AAID;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CA+D/C;AAoDD;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAMvE;AAgBD,qBAAa,WAAW;IACtB,OAAO,CAAC,IAAI,CAAa;gBAEb,UAAU,CAAC,EAAE,MAAM;IAQ/B,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAOvB,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAQ1B,SAAS,IAAI,MAAM;CAGpB;AAID,wBAAgB,SAAS,CACvB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACnC,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,EACpB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC1B,MAAM,CAcR;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAO9E;AA6CD,+EAA+E;AAC/E,MAAM,MAAM,aAAa,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,CAAC;AAEnG;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAChC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAC9B,EAAE,EAAE,MAAM,GACT,aAAa,GAAG,SAAS,CAM3B;AAED,yFAAyF;AACzF,wBAAgB,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAOpF;AAED;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAInC,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC;IACxB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;IACjC,qHAAqH;IACrH,GAAG,EAAE,QAAQ,GAAG,SAAS,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,cAAc,EAAE,CAAC;IACvB,8FAA8F;IAC9F,UAAU,EAAE,cAAc,EAAE,CAAC;CAC9B;AA6ED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,EAChC,QAAQ,EAAE,MAAM,EAChB,UAAU,CAAC,EAAE,MAAM,GAClB,iBAAiB,CAqCnB;AAED,+FAA+F;AAC/F,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,OAAO,CAAC;IACf,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,mHAAmH;IACnH,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,UAAU,EACjB,QAAQ,EAAE,gBAAgB,EAC1B,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,aAAa,GAAG,SAAS,EACvD,KAAK,SAAI,EACT,OAAO,GAAE,GAAG,CAAC,MAAM,CAAa,EAChC,YAAY,UAAQ,GACnB,gBAAgB,CA6ElB;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAQ9D;AAED,uDAAuD;AACvD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAE9D;AAeD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,gBAAgB,EAC1B,YAAY,UAAQ,GACnB,cAAc,CAwDhB;AAID,qBAAa,UAAU;IACrB,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,KAAK,CAAkC;IAC/C,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,WAAW,CAAK;IACxB,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,UAAU,CAA8C;IAChE,+EAA+E;IAC/E,OAAO,CAAC,SAAS,CAAmB;IACpC,gFAAgF;IAChF,OAAO,CAAC,UAAU,CAAkC;IACpD;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc,CAAuC;;IAS7D,OAAO,CAAC,SAAS;IAMjB,OAAO,CAAC,IAAI;IA6BZ,qEAAqE;IACrE,OAAO,CAAC,YAAY;IASpB,2EAA2E;IAC3E,OAAO,CAAC,YAAY;IAiBpB;;;;;;;;;OASG;IACH,OAAO,CAAC,aAAa;IAoBrB,OAAO,CAAC,kBAAkB;IAM1B,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,IAAI;IAsDZ;;;;;;;OAOG;IACH,OAAO,CAAC,oBAAoB;IAQ5B;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAIjB,4FAA4F;IAC5F,OAAO,CAAC,eAAe;IAQvB,yFAAyF;IACzF,OAAO,CAAC,SAAS;IAajB;;;OAGG;IACH,KAAK,CACH,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,QAAQ,SAAY,EACpB,YAAY,SAAO,EACnB,SAAS,CAAC,EAAE,MAAM,EAAE,EACpB,SAAS,GAAE,MAA0B,EACrC,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,EAChC,UAAU,CAAC,EAAE,SAAS,EAAE,EACxB,WAAW,CAAC,EAAE,UAAU,EAAE,EAC1B,MAAM,CAAC,EAAE,MAAM,EACf,WAAW,CAAC,EAAE,MAAM,EAAE,EACtB,OAAO,GAAE,iBAAsB,GAC9B;QACD,MAAM,EAAE,OAAO,CAAC;QAChB,MAAM,EAAE,MAAM,CAAC;QACf,EAAE,CAAC,EAAE,MAAM,CAAC;QACZ,SAAS,CAAC,EAAE,iBAAiB,CAAC;QAC9B,SAAS,CAAC,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,WAAW,GAAG,QAAQ,CAAA;SAAE,CAAC,CAAC;KACnF;IA2GD;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAQ;IAC3C,6FAA6F;IAC7F,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAO;IAE1C;;;;;;OAMG;IACH,OAAO,CAAC,mBAAmB;IA4B3B;;;OAGG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,KAAK,SAAI,EACT,aAAa,SAAI,EACjB,OAAO,GAAE,kBAAuB,GAC/B,iBAAiB,EAAE;IAoMtB;;;OAGG;IACH;;;;;;;;;;;OAWG;IACG,YAAY,CAChB,KAAK,EAAE,MAAM,EACb,KAAK,SAAI,EACT,aAAa,SAAI,EACjB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,EAAE,CAAC;IAoD/B,OAAO,CAAC,OAAO,CAAiC;IAEhD,OAAO,CAAC,gBAAgB;IAKxB,oBAAoB,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,EAAE;IAQrD;;;OAGG;IACH,cAAc,CACZ,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,SAAS,SAAO,GACf;QAAE,WAAW,EAAE,OAAO,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,iBAAiB,CAAA;KAAE;IA6B7E;;;;;;;OAOG;IAGH;;;;;;;;;;;OAWG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAM5C;;;;OAIG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG;QAAE,KAAK,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,GAAG,SAAS;IASrE,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG;QAAE,EAAE,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE;IAWtD;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG;QAClB,EAAE,EAAE,OAAO,CAAC;QACZ,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,CAAC,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAA;SAAE,CAAC;QAC7F,WAAW,CAAC,EAAE,MAAM,CAAC;KACtB;IAqCD;;;;;;;;;;;;;;;;;;OAkBG;IACH;;;;;OAKG;IACH,OAAO,CAAC,gBAAgB;IAmDxB,OAAO,CACL,EAAE,EAAE,MAAM,EACV,IAAI,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,CAAC,EAAE,SAAS,EAAE,CAAA;KAAO,GACzD;QACD,EAAE,EAAE,OAAO,CAAC;QACZ,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,CAAC,EAAE,OAAO,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;QACrB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;KACvB;IAmCD;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CACJ,EAAE,EAAE,MAAM,EACV,KAAK,GAAE;QACL,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;QACrB,OAAO,CAAC,EAAE,SAAS,EAAE,CAAC;QACtB,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;QACtB,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC;QACjC,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;KACnB,GACL;QACD,EAAE,EAAE,OAAO,CAAC;QACZ,OAAO,EAAE,MAAM,CAAC;QAChB,EAAE,CAAC,EAAE,MAAM,CAAC;QACZ,KAAK,CAAC,EAAE,OAAO,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;QACrB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;QACtB,SAAS,CAAC,EAAE,MAAM,CAAC;KACpB;IA0ED;;;;;;OAMG;IACH,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE;QAAE,YAAY,CAAC,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,gBAAgB,CAAA;KAAO,GAAG,kBAAkB,EAAE;IAsDvH;;;;OAIG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,iBAAiB;IAOzE;;;;;;;OAOG;IACH,YAAY,CAAC,IAAI,GAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,YAAY,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG;QACxF,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,YAAY,EAAE,MAAM,CAAC;KACtB;IA+BD;;;;;;;;;;;;OAYG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE;QAAE,UAAU,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG;QAC/D,EAAE,EAAE,OAAO,CAAC;QACZ,QAAQ,EAAE,MAAM,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;KACjB;IA6FD;;;;;;;OAOG;IACH,QAAQ,CAAC,OAAO,GAAE;QAAE,IAAI,CAAC,EAAE,OAAO,CAAA;KAAO,GAAG,UAAU;IA2DtD,KAAK,IAAI,IAAI;CAkBd;AAMD,wBAAgB,QAAQ,IAAI,UAAU,CAGrC"}

package/dist/esm/subconscious/TheBrainV2.js

@@ -26,6 +26,15 @@ const defaultLocalResolver = new LocalFsResolver();
 // ─── BM25 Constants ───────────────────────────────────────────────────────────
 const BM25_K1 = 1.5; // Term saturation (1.2-2.0)
 const BM25_B = 0.75; // Length normalization (0-1)
+/**
+ * Ceiling on the document-length term in BM25's normalization, in multiples of the average
+ * document. Uncapped, the divisor grows with the document forever, so a memory is buried for
+ * being long rather than for being a worse match — which is precisely what happened to the
+ * one entry a "living document" convention keeps rewriting and growing: it ranked below the
+ * 2 KB fragments it was written to supersede, under its own query. Past 3x average, extra
+ * length says nothing more about relevance, so the penalty stops there.
+ */
+const MAX_LENGTH_NORM_RATIO = 3;
 // ─── Recency decay ────────────────────────────────────────────────────────────
 //
 // Deliberately gentle and grace-periodded. Age is a weak proxy for "no longer true" —
@@ -39,6 +48,18 @@ const RECENCY_GRACE_DAYS = 30;
 const RECENCY_FULL_DECAY_DAYS = 365;
 /** Cap, in the same 0-1 similarity space as the popularity/outcome/demerit adjustments. */
 const MAX_RECENCY_PENALTY = 0.10;
+// ─── Retrieval blend ──────────────────────────────────────────────────────────
+//
+// Three signals, weights summing to 1 so the blend stays a 0-1 similarity the caller can hold
+// against a floor. The third is new: an entry's `terms` cover query and response together, so
+// "these words are the memory's own prompt" scored exactly like "these words appear somewhere
+// in a long body", and a document that keeps growing dilutes its own prompt out of contention.
+// That is a retrieval signal, not a tie-break like the small additive adjustments in search(),
+// so it takes its share of the blend rather than being added on top of it.
+const BM25_WEIGHT = 0.55;
+const JACCARD_WEIGHT = 0.20;
+/** Share of the blend decided by how much of the search query the entry's own query covers. */
+const QUERY_FIELD_WEIGHT = 0.25;
 // ─── Storage Paths ────────────────────────────────────────────────────────────
 /**
  * LEMMA_BRAIN_DIR redirects storage — required so tests never write into the user's real
@@ -53,6 +74,14 @@ const META_FILE = path.join(BRAIN_DIR, 'meta.json');
 const LOCK_FILE = path.join(BRAIN_DIR, '.write.lock');
 /** Sidecar vector cache for the optional semantic re-rank. See BrainEmbeddings.ts. */
 const EMBEDDINGS_FILE = path.join(BRAIN_DIR, 'embeddings.ndjson');
+/**
+ * Append-only archive of everything forget() destroyed. Deletion is the one Brain operation
+ * with no undo, and the deleted body is by definition the only copy of that text — telling the
+ * caller "nothing else can recover it" and then handing back metadata only is the worst of both
+ * worlds. The id stays tombstoned (a deliberate deletion must not come back through a merge),
+ * so this file is an archive to read, not a bundle to re-import.
+ */
+const FORGOTTEN_FILE = path.join(BRAIN_DIR, 'forgotten.ndjson');
 // ─── Cross-process durability ─────────────────────────────────────────────────
 //
 // Every MCP client session starts its own server process, and each one holds the whole
@@ -526,13 +555,16 @@ export class BloomFilter {
 // ─── BM25 Scorer ─────────────────────────────────────────────────────────────
 export function bm25Score(queryTerms, docTermFreq, docLength, avgDocLength, idf) {
     let score = 0;
+    // Bounded: see MAX_LENGTH_NORM_RATIO. A document 20x the average was effectively
+    // unretrievable next to a short one sharing the same rare term.
+    const lengthRatio = Math.min(docLength / avgDocLength, MAX_LENGTH_NORM_RATIO);
     for (const term of queryTerms) {
         if (!(term in docTermFreq))
             continue;
         const tf = docTermFreq[term];
         const termIdf = idf[term] || 0;
         const numerator = tf * (BM25_K1 + 1);
-        const denominator = tf + BM25_K1 * (1 - BM25_B + BM25_B * (docLength / avgDocLength));
+        const denominator = tf + BM25_K1 * (1 - BM25_B + BM25_B * lengthRatio);
         score += termIdf * (numerator / denominator);
     }
     return score;
@@ -833,6 +865,28 @@ export function checkEntryFreshness(entry, resolver, resolveNode, depth = 0, vis
         ...(cosmeticChanges.length > 0 ? { cosmeticChanges } : {}),
     };
 }
+/**
+ * How many artifacts an entry's freshness is actually judged against: tracked files, tracked
+ * symbols, upstream memories, and each claim's own evidence.
+ *
+ * Zero means a freshness check has nothing to compare — and reporting that as `fresh` conflates
+ * "validated against the code" with "there was nothing to validate", which are opposite
+ * guarantees for a caller about to act on the memory. `verify_memory` reports those as
+ * `untracked` instead; see VerifyMemoryResult.
+ */
+export function trackedArtifactCount(entry) {
+    let n = Object.keys(entry.fileHashes || {}).length;
+    n += Object.keys(entry.symbolHashes || {}).length;
+    n += (entry.derivedFrom || []).length;
+    for (const claim of entry.claims || []) {
+        n += Object.keys(claim.fileHashes || {}).length + Object.keys(claim.symbolHashes || {}).length;
+    }
+    return n;
+}
+/** Claim-level counterpart to trackedArtifactCount. */
+export function trackedClaimArtifactCount(claim) {
+    return Object.keys(claim.fileHashes || {}).length + Object.keys(claim.symbolHashes || {}).length;
+}
 /** Builds the persisted `Claim[]` for an entry from the caller-supplied claim inputs. */
 function buildClaims(inputs) {
     return inputs
@@ -921,6 +975,15 @@ export class TheBrainV2 {
         this.diskStamp = null;
         /** id -> ISO deletion time, for ids that must not come back through a merge. */
         this.tombstones = new Map();
+        /**
+         * id -> terms of that entry's own `query` field. Derived state, never persisted: `terms`
+         * covers query+response together, so scoring the query field on its own (see the
+         * QUERY_FIELD_BOOST block in search()) needs it split back out. Memoized because a search
+         * touches every candidate and re-tokenizing a prompt per candidate per search is pure waste.
+         * Dropped whenever the entry changes or leaves the corpus — a stale entry here would boost
+         * a memory for words its prompt no longer contains.
+         */
+        this.queryTermCache = new Map();
         this.sidecar = null;
         this.ensureDir();
         this.load();
@@ -959,9 +1022,21 @@ export class TheBrainV2 {
             this.tombstones = new Map();
         }
     }
+    /** Terms of an entry's own `query`, memoized. See queryTermCache. */
+    queryTermsOf(entry) {
+        let set = this.queryTermCache.get(entry.id);
+        if (!set) {
+            set = new Set(tokenize(entry.query));
+            this.queryTermCache.set(entry.id, set);
+        }
+        return set;
+    }
     /** Recomputes the inverted index from scratch over the current entries. */
     rebuildIndex() {
         this.invertedIndex = new Map();
+        // A merge can replace an id's entry with a peer's newer version whose query differs, so
+        // the memo is rebuilt alongside the index rather than trusted across one.
+        this.queryTermCache.clear();
         for (const entry of this.entries.values()) {
             for (const term of entry.terms) {
                 let ids = this.invertedIndex.get(term);
@@ -1110,6 +1185,7 @@ export class TheBrainV2 {
     /** Removes an entry from the in-memory corpus and the inverted index. No persistence. */
     dropEntry(entry) {
         this.entries.delete(entry.id);
+        this.queryTermCache.delete(entry.id);
         for (const term of entry.terms) {
             const ids = this.invertedIndex.get(term);
             if (!ids)
@@ -1331,8 +1407,24 @@ export class TheBrainV2 {
         // see on their own: a memory's own track record. Small and additive by design — none of
         // these can turn an unrelated result into a top hit, they only reorder among already-
         // relevant candidates.
+        const normalizedQuery = query.trim().toLowerCase();
         const combined = scored.map(s => {
-            let similarity = (s.bm25 / maxBm25) * 0.7 + s.jaccard * 0.3;
+            // How much of the search query appears in the entry's own prompt — see the weights above.
+            const entryQueryTerms = this.queryTermsOf(s.entry);
+            let covered = 0;
+            for (const term of queryTermSet)
+                if (entryQueryTerms.has(term))
+                    covered++;
+            const queryFieldMatch = covered / queryTermSet.size;
+            // A prompt that matches character for character is not one signal among three — it is
+            // the entry filed under exactly this question. Blended, it could still lose to a short
+            // fragment that repeated one rare term, which is how a memory became unfindable under
+            // its own query. The adjustments below still apply on top: a downvoted or dead-end
+            // exact match must not outrank a clean one.
+            const exactPrompt = s.entry.query.trim().toLowerCase() === normalizedQuery;
+            let similarity = exactPrompt
+                ? 1
+                : (s.bm25 / maxBm25) * BM25_WEIGHT + s.jaccard * JACCARD_WEIGHT + queryFieldMatch * QUERY_FIELD_WEIGHT;
             // Popularity prior: entries other searches actually reused are more likely to be
             // reused again. Log-scaled and capped at +0.08 so a handful of hits can't outrank a
             // much better textual match.
@@ -1519,6 +1611,38 @@ export class TheBrainV2 {
      * without deleting the entry — a bad-fit-today memory may still be exactly right for a
      * differently-phrased query tomorrow.
      */
+    // ─── Read by id ─────────────────────────────────────────────────────────────
+    /**
+     * One memory, by id, body included.
+     *
+     * The Brain had no deterministic read: `verifyByIds` answers "is it still true" without
+     * returning the text, and `search()` — the only path to the body — is a ranking, so an agent
+     * holding an id could still fail to retrieve the memory it had just written. Editing a
+     * long-lived entry under those conditions means reconstructing its text from whatever a
+     * search happened to surface, which is how the accumulated content in it gets lost.
+     *
+     * Returns a copy: callers must not mutate the corpus by holding a reference. Use update()
+     * to change a memory.
+     */
+    getEntry(id) {
+        this.syncIfChanged();
+        const entry = this.entries.get(id);
+        return entry ? { ...entry } : undefined;
+    }
+    /**
+     * The entry a claim id belongs to, plus the claim itself. Claim ids and entry ids are handed
+     * back side by side by search_memory and verify_memory, so an id pasted into a read is as
+     * likely to be one as the other — resolving only entries would report a live claim as missing.
+     */
+    getClaim(id) {
+        this.syncIfChanged();
+        for (const entry of this.entries.values()) {
+            const claim = entry.claims?.find((c) => c.id === id);
+            if (claim)
+                return { entry: { ...entry }, claim };
+        }
+        return undefined;
+    }
     downvote(id) {
         this.syncIfChanged();
         const entry = this.entries.get(id);
@@ -1548,6 +1672,19 @@ export class TheBrainV2 {
         const entry = this.entries.get(id);
         if (!entry)
             return { ok: false, message: `No entry with id "${id}" in the Brain.` };
+        // Archived before it is dropped: the body is the only copy of that text anywhere, and
+        // "nothing else can recover it" has to be a description of the archive, not of a gap.
+        let archivePath;
+        try {
+            this.ensureDir();
+            const { terms: _terms, ...persisted } = entry;
+            fs.appendFileSync(FORGOTTEN_FILE, JSON.stringify({ ...persisted, forgottenAt: new Date().toISOString() }) + '\n', 'utf8');
+            archivePath = FORGOTTEN_FILE;
+        }
+        catch {
+            // An unwritable archive must not block a deletion the user asked for — the body still
+            // comes back in the result below, which is the copy that matters in the moment.
+        }
         this.dropEntry(entry);
         this.tombstone(id);
         this.recalcAvgDocLength();
@@ -1557,7 +1694,10 @@ export class TheBrainV2 {
             message: `Deleted memory "${id}". It will not come back from another session's copy.`,
             // Echoed back so a deletion is auditable: the caller (and the user reading the
             // transcript) can see exactly what was destroyed, since nothing else can recover it.
-            forgotten: { id, query: entry.query, timestamp: entry.timestamp, hits: entry.hits },
+            // The response is included, not just its metadata — a record of a deletion that omits
+            // the deleted content is not a record of anything.
+            forgotten: { id, query: entry.query, response: entry.response, timestamp: entry.timestamp, hits: entry.hits },
+            ...(archivePath ? { archivePath } : {}),
         };
     }
     // ─── Re-anchoring ───────────────────────────────────────────────────────────
@@ -1580,11 +1720,13 @@ export class TheBrainV2 {
      * a memory that is itself stale is exactly what Fase B exists to catch, and silently
      * clearing that would defeat it. Those come back in `stillStale` instead.
      */
-    refresh(id, opts = {}) {
-        this.syncIfChanged();
-        const entry = this.entries.get(id);
-        if (!entry)
-            return { ok: false, message: `No entry with id "${id}" in the Brain.` };
+    /**
+     * Re-hash an entry's evidence, either in place or against newly named files/symbols.
+     * Shared by refresh() ("I checked, this is still true") and update() ("here is the corrected
+     * text"), which make the same assertion about the same code and so must anchor identically.
+     * Mutates `entry`; returns the labels of what it now tracks.
+     */
+    reanchorEvidence(entry, opts) {
         const retracked = [];
         const rel = (abs) => {
             const r = path.relative(process.cwd(), abs);
@@ -1637,6 +1779,14 @@ export class TheBrainV2 {
                 }
             }
         }
+        return retracked;
+    }
+    refresh(id, opts = {}) {
+        this.syncIfChanged();
+        const entry = this.entries.get(id);
+        if (!entry)
+            return { ok: false, message: `No entry with id "${id}" in the Brain.` };
+        const retracked = this.reanchorEvidence(entry, opts);
         // Re-stamp git context and the age clock: this memory was just re-verified here, now.
         const git = currentGitContext();
         if (git.commit)
@@ -1658,6 +1808,89 @@ export class TheBrainV2 {
                     `A "derived:" entry here means an upstream memory it was built on is stale — refresh that one first.`,
         };
     }
+    // ─── In-place rewrite ───────────────────────────────────────────────────────
+    /**
+     * Replace an existing memory's content, keeping its identity.
+     *
+     * The Brain could add and it could delete, but it could not correct: store() mints a new id
+     * per call, so re-storing a corrected version under the same query left the outdated one in
+     * place, and a later search returned an arbitrary slice of every historical version —
+     * including the ones that contradict each other. That is the mechanism behind an
+     * append-only pile of near-duplicate "canonical index" entries: not a convention nobody
+     * followed, a convention the API could not express. refresh() keeps identity but only
+     * re-hashes evidence, and has no way to accept new text. This is that missing operation.
+     *
+     * Kept: id, hits, demerits, creation timestamp, projectId, source, and every `derivedFrom`
+     * edge elsewhere in the corpus that points at this id. Replaced: whatever the patch names.
+     * Evidence is re-anchored exactly as refresh() does — rewriting a memory's content asserts
+     * the same thing refresh() records, that the caller checked it against the code as it is now.
+     */
+    update(id, patch = {}) {
+        this.syncIfChanged();
+        const entry = this.entries.get(id);
+        if (!entry)
+            return { ok: false, message: `No entry with id "${id}" in the Brain.` };
+        const beforeChars = entry.charCount;
+        // Out of the index before its terms change: a posting list built from the old text would
+        // keep serving this entry under words the new text no longer contains.
+        this.dropEntry(entry);
+        if (typeof patch.query === 'string' && patch.query.trim())
+            entry.query = patch.query.trim();
+        if (typeof patch.response === 'string' && patch.response.trim())
+            entry.response = patch.response.trim();
+        if (patch.outcome)
+            entry.outcome = patch.outcome;
+        if (patch.domain !== undefined)
+            entry.domain = patch.domain.trim() || undefined;
+        if (patch.derivedFrom !== undefined) {
+            entry.derivedFrom = patch.derivedFrom.length > 0 ? patch.derivedFrom : undefined;
+        }
+        if (patch.claims !== undefined) {
+            entry.claims = patch.claims.length > 0 ? buildClaims(patch.claims) : undefined;
+        }
+        const terms = tokenize(entry.query + ' ' + entry.response);
+        entry.terms = [...new Set(terms)];
+        entry.termFreq = termFrequencies(terms);
+        entry.charCount = entry.query.length + entry.response.length;
+        // Claims supplied in this patch were just hashed by buildClaims; the helper re-anchors the
+        // ones carried over, so either way the entry's evidence describes the code as it is now.
+        const retracked = this.reanchorEvidence(entry, { filePaths: patch.filePaths, symbols: patch.symbols });
+        const git = currentGitContext();
+        if (git.commit)
+            entry.gitCommit = git.commit;
+        if (git.branch)
+            entry.gitBranch = git.branch;
+        // Same clock reset as refresh(): re-verified content really is current again. `timestamp`
+        // is left alone so provenance is never rewritten.
+        entry.refreshedAt = new Date().toISOString();
+        this.entries.set(id, entry);
+        for (const term of entry.terms) {
+            let ids = this.invertedIndex.get(term);
+            if (!ids) {
+                ids = new Set();
+                this.invertedIndex.set(term, ids);
+            }
+            ids.add(id);
+        }
+        this.bloom.add(entry.query.trim().toLowerCase().substring(0, 200));
+        this.recalcAvgDocLength();
+        this.scheduleSave();
+        const claimIndex = buildClaimIndex(this.entries);
+        const { fresh, staleFiles } = checkEntryFreshness(entry, defaultLocalResolver, (depId) => resolveFreshnessNode(this.entries, claimIndex, depId));
+        const charDelta = entry.charCount - beforeChars;
+        return {
+            ok: true,
+            id,
+            fresh,
+            retracked,
+            charDelta,
+            ...(staleFiles.length > 0 ? { stillStale: staleFiles } : {}),
+            message: fresh
+                ? `Memory "${id}" updated in place, keeping its id, ${entry.hits} hit(s) and every derivedFrom edge pointing at it.`
+                : `Memory "${id}" updated in place, but still stale: ${staleFiles.join(', ')}. ` +
+                    `A "derived:" entry here means an upstream memory it was built on is stale — refresh that one first.`,
+        };
+    }
     // ─── Batch verification ─────────────────────────────────────────────────────
     /**
      * Revalidate ids from a prior search_memory/store_memory result via hash-compare only —
@@ -1681,9 +1914,13 @@ export class TheBrainV2 {
             if (entry) {
                 const { fresh, staleFiles, unverifiedFiles, cosmeticChanges } = checkEntryFreshness(entry, resolver, resolveNode, 0, new Set(), semanticDiff);
                 const unverified = unverifiedFiles.length > 0;
+                // An entry that tracks nothing cannot be checked, and saying 'fresh' would answer a
+                // question ("does this still match the code?") that was never asked of it.
+                const tracked = trackedArtifactCount(entry);
                 return {
                     id,
-                    status: unverified ? 'unverified' : fresh ? 'fresh' : 'stale',
+                    status: unverified ? 'unverified' : !fresh ? 'stale' : tracked === 0 ? 'untracked' : 'fresh',
+                    trackedArtifacts: tracked,
                     ...(unverified || fresh ? {} : attributeStaleness(entry, git)),
                     ...(staleFiles.length > 0 ? { staleFiles } : {}),
                     ...(unverified ? { unverifiedFiles } : {}),
@@ -1695,9 +1932,11 @@ export class TheBrainV2 {
             if (claim) {
                 const cf = checkClaimFreshness(claim, resolver, semanticDiff);
                 const unverified = (cf.unverifiedFiles?.length ?? 0) > 0;
+                const trackedClaim = trackedClaimArtifactCount(claim);
                 return {
                     id,
-                    status: cf.fresh ? 'fresh' : unverified ? 'unverified' : 'stale',
+                    status: unverified ? 'unverified' : !cf.fresh ? 'stale' : trackedClaim === 0 ? 'untracked' : 'fresh',
+                    trackedArtifacts: trackedClaim,
                     ...(cf.staleFiles ? { staleFiles: cf.staleFiles } : {}),
                     ...(cf.unverifiedFiles ? { unverifiedFiles: cf.unverifiedFiles } : {}),
                     ...(cf.cosmeticChanges ? { cosmeticChanges: cf.cosmeticChanges } : {}),
@@ -1879,6 +2118,7 @@ export class TheBrainV2 {
         let neverHit = 0;
         let downvoted = 0;
         let unscoped = 0;
+        let untracked = 0;
         let oldest = '';
         const bySource = {};
         const projects = new Set();
@@ -1891,6 +2131,8 @@ export class TheBrainV2 {
                 unscoped++;
             else
                 projects.add(entry.projectId);
+            if (trackedArtifactCount(entry) === 0)
+                untracked++;
             const src = entrySource(entry);
             bySource[src] = (bySource[src] || 0) + 1;
             if (entry.timestamp && (!oldest || entry.timestamp < oldest))
@@ -1901,6 +2143,7 @@ export class TheBrainV2 {
         base.bySource = bySource;
         base.projects = projects.size;
         base.unscopedEntries = unscoped;
+        base.untrackedEntries = untracked;
         base.tombstones = this.tombstones.size;
         if (oldest)
             base.oldestEntry = oldest;