crbro-memory 2.6.0 → 2.7.1

package/dist/engine/cortex.d.ts

@@ -1,10 +1,17 @@
 import { AsyncLocalStorage } from 'node:async_hooks';
 import type { Brain } from './brain.js';
 import type { Neuron, NeuronType, FactStatus } from '../types/index.js';
+/**
+ * `witnessed`: "<neuron>|<fact id>" of every fact this session stored or
+ * confirmed. A session is one witness: storing the same line again in the
+ * same session (a retry, the post-compaction re-save) does not count twice.
+ * Not cleared by consolidate, which ends a chapter, not the conversation.
+ */
 export interface SessionTally {
     facts: number;
     decisions: number;
     topics: Set<string>;
+    witnessed?: Set<string>;
 }
 export declare const newTally: () => SessionTally;
 /**
@@ -17,6 +24,58 @@ export declare const sessionScope: AsyncLocalStorage<{
     tally: SessionTally;
     resumed?: boolean;
 }>;
+/**
+ * Near-duplicates of `content` among `candidates`, best first: Dice ≥ 0.8 on
+ * lower-cased text, both sides at least NEAR_DUP_MIN_LENGTH characters. The
+ * one rule behind learn's near_duplicates warning (inside one neuron) and
+ * consolidate's promotion_candidates (across project neurons), so the two
+ * cannot disagree on what "almost the same line" means.
+ */
+export declare function nearDuplicatesAmong(content: string, candidates: Array<{
+    id: string;
+    text: string;
+}>): Array<{
+    id: string;
+    similarity: number;
+    text: string;
+}>;
+/** Lesson kinds that can be promoted: what was learned, not what was decided or preferred. */
+export type LessonKind = 'fact' | 'pattern' | 'error';
+export interface PromotionCandidate {
+    kind: LessonKind;
+    /** The telling to promote: the most confirmed copy, then the longest. */
+    text: string;
+    /** Project neurons that hold it, the one written this session first. */
+    neurons: string[];
+    /** The entry id of the copy in each of `neurons`, same order. */
+    entry_ids: string[];
+    /** Lowest similarity in the group: 1 when every copy is the same text. */
+    similarity: number;
+    /** Sum of the copies' confirmations (each copy counts at least 1). */
+    confirmations: number;
+}
+/** Most promotion candidates consolidate reports. More is a backlog, not a nudge. */
+export declare const MAX_PROMOTION_CANDIDATES = 5;
+/**
+ * The same lesson living in two or more project neurons: the mark of
+ * something that is not about one project at all and belongs in a tech_ or
+ * process_ neuron where every project finds it.
+ *
+ * Generalises findNearDuplicates (one neuron) to many without making it
+ * quadratic: only the lessons of `seedIds` — the project neurons this session
+ * touched — are compared, and each only against the lessons that hold the
+ * same numbers and most of its distinctive words (inverted indexes built
+ * once). The bigram test then decides, as in learn. Exact copies (same
+ * normalised text) count at any length.
+ *
+ * Only the user's own lessons take part. A line that arrived from a shared
+ * space, the miner or anything that is not this machine's session is left
+ * out: promoting it would rewrite a third party's text as the user's own
+ * lesson, valid for every project, and drop the origin recall shows for it.
+ *
+ * Read-only and pure: it suggests, it never moves anything.
+ */
+export declare function findPromotionCandidates(neurons: Neuron[], seedIds: Iterable<string>, max?: number): PromotionCandidate[];
 export type Indexer = (neuron: Neuron) => Promise<void> | void;
 /**
  * Called after a write so shared neurons can append a note to the team log.
@@ -256,6 +315,8 @@ export declare class Cortex {
             revised?: string;
             note?: string;
         } | null;
+        /** Exact-duplicate fact only: how many times the line has now been learned (2.7). */
+        confirmations?: number;
     }>;
     /**
      * Mark facts as no longer current.

package/dist/engine/cortex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cortex.d.ts","sourceRoot":"","sources":["../../src/engine/cortex.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAMrD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAkB,UAAU,EAAgC,MAAM,mBAAmB,CAAC;AAgBtH,MAAM,WAAW,YAAY;IAAG,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;CAAE;AACvF,eAAO,MAAM,QAAQ,QAAO,YAAuE,CAAC;AACpG;;;;;GAKG;AACH,eAAO,MAAM,YAAY;WAAkC,YAAY;cAAY,OAAO;EAAK,CAAC;AA6ChG,MAAM,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAE/D;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CACpB,QAAQ,EAAE,MAAM,EAChB,MAAM,EACF;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,GACpG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,YAAY,GAAG,WAAW,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,GACzF;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC5D;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC3C;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC1C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,gBAAgB,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,KACnD,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAE1B;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CAAC,QAAQ,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AA6BjE;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;KAAE,CAAC;CAC7I,CA6GA;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAQvD;AAED,qBAAa,MAAM;IAuBL,OAAO,CAAC,KAAK;IAtBzB;;;;;OAKG;IACH,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IAEvC;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,KAAK,KAAK,GAEhB;gBAEmB,KAAK,EAAE,KAAK;IAEhC,yEAAyE;IACzE,YAAY,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAQtE,iBAAiB,IAAI,IAAI;IAOzB,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;IAIzC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;IAIzC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;YAI3B,OAAO;IASrB;;;;OAIG;YACW,UAAU;IAOxB,6EAA6E;YAC/D,gBAAgB;YAOhB,IAAI;IAUlB;;;;OAIG;IACG,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;YAoBxC,OAAO;IASrB;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAW7C;;OAEG;IACG,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAI9C;;;;;;;;;;;OAWG;IACG,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IA6CtD;;;;OAIG;IACG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAwC/F;;;OAGG;IACG,KAAK,CACT,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,YAAY,GAAG,OAAO,GAAG,MAAM,EACvE,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QACR,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,UAAU,CAAC;QACxB,4GAA4G;QAC5G,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB;;;;WAIG;QACH,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,oEAAoE;QACpE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,8DAA8D;QAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,wDAAwD;QACxD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;QACtB;;;;;;WAMG;QACH,eAAe,CAAC,EAAE,OAAO,CAAC;KAC3B,GACA,OAAO,CAAC;QACT,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB;;;;;;WAMG;QACH,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,iBAAiB,CAAC;QAC9D,UAAU,EAAE,MAAM,CAAC;QACnB,8EAA8E;QAC9E,oBAAoB,EAAE,MAAM,EAAE,CAAC;QAC/B;;;;;WAKG;QACH,eAAe,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QAC5E,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,kFAAkF;QAClF,SAAS,EAAE,OAAO,CAAC;QACnB,+EAA+E;QAC/E,gBAAgB,EAAE,OAAO,CAAC;QAC1B,2EAA2E;QAC3E,eAAe,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CAAC;YAAC,OAAO,CAAC,EAAE,MAAM,CAAC;YAAC,IAAI,CAAC,EAAE,MAAM,CAAA;SAAE,GAAG,IAAI,CAAC;KAC7G,CAAC;IAyOF;;;;;;;;OAQG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GACpE,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA6C3E;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IA2B1B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM;IAgCd;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IA8BlB;;;;;;;;;OASG;IACG,aAAa,CACjB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAC/C,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA2D3E;;;;;;;;;;;OAWG;IACG,OAAO,CACX,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1E,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,KAAK,CAAC,SAAS,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAsDjH;;;;;;;OAOG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,UAAU,CAAA;KAAE,GACrD,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,MAAM,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAwCxF;;;;;;;OAOG;IACG,aAAa,CAAC,OAAO,CAAC,EAAE;QAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;KAAE,CAAC;IAOzE;;OAEG;IACG,IAAI,CAAC,OAAO,CAAC,EAAE;QACnB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,+DAA+D;QAC/D,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC,KAAK,CAAC;QAChB,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,UAAU,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,aAAa,EAAE,MAAM,CAAC;QACtB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC,CAAC;IAyCH;;OAEG;IACG,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAYxE;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAajE;;;;;;;OAOG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC;QAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IA4HhF;;;;;;;;;OASG;IACG,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;QAC7C,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QACzB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,MAAM,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAA;SAAE,CAAC;KACzI,CAAC;IA2BF;;;OAGG;YACW,gBAAgB;IAM9B;;;;;;;;OAQG;IACG,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC1E,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;QAC7B,oBAAoB,EAAE,OAAO,CAAC;QAC9B,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;KACvD,CAAC;IAuCF;;;;;;;;;;OAUG;IACG,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;QAC5D,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;KACvD,CAAC;IA0BF;;;;OAIG;YACW,SAAS;IAkCvB;;;;;;;;;;;;OAYG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC7G,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,OAAO,EAAE,OAAO,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;KACvB,CAAC;IAuDF;;;;;;;;;;;OAWG;IACG,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC7G,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,MAAM,EAAE,CAAC;QACjB,OAAO,EAAE,MAAM,EAAE,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IA8CF;;;OAGG;IACG,YAAY,IAAI,OAAO,CAAC,KAAK,CAAC;QAClC,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,EAAE,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,EAAE,MAAM,CAAC;QACd,GAAG,EAAE,MAAM,CAAC;KACb,CAAC,CAAC;IA8CH;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAIjC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;CAI/B"}
+{"version":3,"file":"cortex.d.ts","sourceRoot":"","sources":["../../src/engine/cortex.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AAMrD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAkB,UAAU,EAAgC,MAAM,mBAAmB,CAAC;AAgBtH;;;;;GAKG;AACH,MAAM,WAAW,YAAY;IAAG,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;CAAE;AAChH,eAAO,MAAM,QAAQ,QAAO,YAAqG,CAAC;AAClI;;;;;GAKG;AACH,eAAO,MAAM,YAAY;WAAkC,YAAY;cAAY,OAAO;EAAK,CAAC;AA6ChG;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAC9C,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,CAgBzD;AAED,8FAA8F;AAC9F,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;AAEtD,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,UAAU,CAAC;IACjB,yEAAyE;IACzE,IAAI,EAAE,MAAM,CAAC;IACb,wEAAwE;IACxE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,iEAAiE;IACjE,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,0EAA0E;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,qFAAqF;AACrF,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAyB1C;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,EACzB,GAAG,GAAE,MAAiC,GACrC,kBAAkB,EAAE,CAqHtB;AAED,MAAM,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAE/D;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CACpB,QAAQ,EAAE,MAAM,EAChB,MAAM,EACF;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,GACpG;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,YAAY,GAAG,WAAW,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,GACzF;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC5D;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC7C;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC3C;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC1C;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAChD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC/C;IAAE,IAAI,EAAE,gBAAgB,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACnD;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,KACnD,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AAE1B;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CAAC,QAAQ,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AA6BjE;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;KAAE,CAAC;CAC7I,CAuHA;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAQvD;AAED,qBAAa,MAAM;IAuBL,OAAO,CAAC,KAAK;IAtBzB;;;;;OAKG;IACH,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IACvC,OAAO,CAAC,OAAO,CAAwB;IAEvC;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,KAAK,KAAK,GAEhB;gBAEmB,KAAK,EAAE,KAAK;IAEhC,yEAAyE;IACzE,YAAY,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE;IAQtE,iBAAiB,IAAI,IAAI;IAOzB,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;IAIzC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;IAIzC,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,IAAI;YAI3B,OAAO;IASrB;;;;OAIG;YACW,UAAU;IAOxB,6EAA6E;YAC/D,gBAAgB;YAOhB,IAAI;IAUlB;;;;OAIG;IACG,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;YAoBxC,OAAO;IASrB;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAW7C;;OAEG;IACG,IAAI,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAI9C;;;;;;;;;;;OAWG;IACG,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IA6CtD;;;;OAIG;IACG,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAwC/F;;;OAGG;IACG,KAAK,CACT,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS,GAAG,YAAY,GAAG,OAAO,GAAG,MAAM,EACvE,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QACR,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,UAAU,CAAC;QACxB,4GAA4G;QAC5G,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB;;;;WAIG;QACH,WAAW,CAAC,EAAE,OAAO,CAAC;QACtB,oEAAoE;QACpE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,8DAA8D;QAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,wDAAwD;QACxD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;QACtB;;;;;;WAMG;QACH,eAAe,CAAC,EAAE,OAAO,CAAC;KAC3B,GACA,OAAO,CAAC;QACT,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB;;;;;;WAMG;QACH,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG,iBAAiB,CAAC;QAC9D,UAAU,EAAE,MAAM,CAAC;QACnB,8EAA8E;QAC9E,oBAAoB,EAAE,MAAM,EAAE,CAAC;QAC/B;;;;;WAKG;QACH,eAAe,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,UAAU,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;QAC5E,QAAQ,EAAE,MAAM,EAAE,CAAC;QACnB,kFAAkF;QAClF,SAAS,EAAE,OAAO,CAAC;QACnB,+EAA+E;QAC/E,gBAAgB,EAAE,OAAO,CAAC;QAC1B,2EAA2E;QAC3E,eAAe,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CAAC;YAAC,OAAO,CAAC,EAAE,MAAM,CAAC;YAAC,IAAI,CAAC,EAAE,MAAM,CAAA;SAAE,GAAG,IAAI,CAAC;QAC5G,qFAAqF;QACrF,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB,CAAC;IAuQF;;;;;;;;OAQG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GACpE,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA6C3E;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IAY1B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM;IAgCd;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IA8BlB;;;;;;;;;OASG;IACG,aAAa,CACjB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,UAAU,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAC/C,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IA2D3E;;;;;;;;;;;OAWG;IACG,OAAO,CACX,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAC1E,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,KAAK,CAAC,SAAS,GAAG,QAAQ,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAsDjH;;;;;;;OAOG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,UAAU,CAAA;KAAE,GACrD,OAAO,CAAC;QAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,MAAM,EAAE,SAAS,GAAG,SAAS,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAwCxF;;;;;;;OAOG;IACG,aAAa,CAAC,OAAO,CAAC,EAAE;QAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;KAAE,CAAC;IAOzE;;OAEG;IACG,IAAI,CAAC,OAAO,CAAC,EAAE;QACnB,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,IAAI,CAAC,EAAE,UAAU,CAAC;QAClB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,+DAA+D;QAC/D,MAAM,CAAC,EAAE,MAAM,CAAC;KACjB,GAAG,OAAO,CAAC,KAAK,CAAC;QAChB,EAAE,EAAE,MAAM,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,UAAU,CAAC;QACjB,IAAI,EAAE,MAAM,CAAC;QACb,aAAa,EAAE,MAAM,CAAC;QACtB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC,CAAC;IAyCH;;OAEG;IACG,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAYxE;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IAajE;;;;;;;OAOG;IACG,MAAM,CACV,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,EAAE,GAChB,OAAO,CAAC;QAAE,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAC;IAqIhF;;;;;;;;;OASG;IACG,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;QAC7C,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;QACzB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,MAAM,EAAE;YAAE,KAAK,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAC;YAAC,QAAQ,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,KAAK,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAA;SAAE,CAAC;KACzI,CAAC;IA2BF;;;OAGG;YACW,gBAAgB;IAM9B;;;;;;;;OAQG;IACG,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC1E,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;QAC7B,oBAAoB,EAAE,OAAO,CAAC;QAC9B,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;KACvD,CAAC;IAuCF;;;;;;;;;;OAUG;IACG,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;QAC5D,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,KAAK,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;KACvD,CAAC;IA0BF;;;;OAIG;YACW,SAAS;IAkCvB;;;;;;;;;;;;OAYG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC7G,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,OAAO,EAAE,OAAO,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,EAAE,CAAC;QACpB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;KACvB,CAAC;IAuDF;;;;;;;;;;;OAWG;IACG,OAAO,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE;QAAE,IAAI,EAAE,UAAU,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC;QAC7G,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QACpB,MAAM,EAAE,MAAM,EAAE,CAAC;QACjB,OAAO,EAAE,MAAM,EAAE,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IA8CF;;;OAGG;IACG,YAAY,IAAI,OAAO,CAAC,KAAK,CAAC;QAClC,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,EAAE,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,EAAE,MAAM,CAAC;QACd,GAAG,EAAE,MAAM,CAAC;KACb,CAAC,CAAC;IA8CH;;OAEG;IACG,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;IAIjC;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;CAI/B"}

package/dist/engine/cortex.js

@@ -2,7 +2,9 @@
 // ─── CRBRO Cortex Engine ─────────────────────────────────────────
 // Neuron CRUD — create, read, update, list neurons
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Cortex = exports.sessionScope = exports.newTally = void 0;
+exports.Cortex = exports.MAX_PROMOTION_CANDIDATES = exports.sessionScope = exports.newTally = void 0;
+exports.nearDuplicatesAmong = nearDuplicatesAmong;
+exports.findPromotionCandidates = findPromotionCandidates;
 exports.unionNeuron = unionNeuron;
 exports.normalizeKeys = normalizeKeys;
 const node_async_hooks_1 = require("node:async_hooks");
@@ -22,7 +24,7 @@ const NEAR_DUP_THRESHOLD = 0.8;
 const NEAR_DUP_MIN_LENGTH = 60;
 /** Minimum similarity before we accept a near-miss as "the same topic". */
 const NAME_MATCH_THRESHOLD = 0.85;
-const newTally = () => ({ facts: 0, decisions: 0, topics: new Set() });
+const newTally = () => ({ facts: 0, decisions: 0, topics: new Set(), witnessed: new Set() });
 exports.newTally = newTally;
 /**
  * The connection a request belongs to, carried through every await. Empty
@@ -73,6 +75,207 @@ function sameNumbers(a, b) {
     const nb = b.match(/\d+/g) || [];
     return na.length === nb.length && na.every((v, i) => v === nb[i]);
 }
+/**
+ * Near-duplicates of `content` among `candidates`, best first: Dice ≥ 0.8 on
+ * lower-cased text, both sides at least NEAR_DUP_MIN_LENGTH characters. The
+ * one rule behind learn's near_duplicates warning (inside one neuron) and
+ * consolidate's promotion_candidates (across project neurons), so the two
+ * cannot disagree on what "almost the same line" means.
+ */
+function nearDuplicatesAmong(content, candidates) {
+    if (content.length < NEAR_DUP_MIN_LENGTH)
+        return [];
+    const nuevo = content.toLowerCase();
+    const out = [];
+    for (const c of candidates) {
+        if (!c.text || c.text.length < NEAR_DUP_MIN_LENGTH)
+            continue;
+        // Dice over bigrams cannot reach the threshold when one side is much
+        // longer: 2·min/(a+b) bounds it. A free filter before the real count.
+        const otro = c.text.toLowerCase();
+        const a = nuevo.length, b = otro.length;
+        if ((2 * Math.min(a, b)) / (a + b) < NEAR_DUP_THRESHOLD)
+            continue;
+        const score = similarity(nuevo, otro);
+        if (score >= NEAR_DUP_THRESHOLD)
+            out.push({ id: c.id, similarity: Math.round(score * 100) / 100, text: c.text });
+    }
+    out.sort((x, y) => y.similarity - x.similarity);
+    return out;
+}
+/** Most promotion candidates consolidate reports. More is a backlog, not a nudge. */
+exports.MAX_PROMOTION_CANDIDATES = 5;
+/** Lessons of this session's project neurons compared against the rest. Bounds the cost of a sprawling session. */
+const MAX_PROMOTION_SEEDS = 300;
+/** Share of a lesson's distinctive words a copy must also hold before the bigram test runs. */
+const PROMOTION_MIN_OVERLAP = 0.6;
+/**
+ * A word found in more lessons than this says nothing about which lesson is
+ * a copy of which ("para", "proyecto"): it is not counted. The larger of an
+ * absolute floor and a share of the brain, so small brains keep every word.
+ */
+const PROMOTION_COMMON_WORD = { min: 200, share: 0.05 };
+/** Lower-cased, accents folded, whitespace collapsed: the "same text" test. */
+function normLesson(text) {
+    return text.normalize('NFD').replace(/[̀-ͯ]/g, '').toLowerCase().replace(/\s+/g, ' ').trim();
+}
+function lessonWords(norm) {
+    return [...new Set(norm.split(/[^a-z0-9_]+/).filter(w => w.length >= 3 && !/^\d+$/.test(w)))];
+}
+function lessonNumbers(norm) {
+    return [...new Set(norm.match(/\d+/g) || [])];
+}
+/**
+ * The same lesson living in two or more project neurons: the mark of
+ * something that is not about one project at all and belongs in a tech_ or
+ * process_ neuron where every project finds it.
+ *
+ * Generalises findNearDuplicates (one neuron) to many without making it
+ * quadratic: only the lessons of `seedIds` — the project neurons this session
+ * touched — are compared, and each only against the lessons that hold the
+ * same numbers and most of its distinctive words (inverted indexes built
+ * once). The bigram test then decides, as in learn. Exact copies (same
+ * normalised text) count at any length.
+ *
+ * Only the user's own lessons take part. A line that arrived from a shared
+ * space, the miner or anything that is not this machine's session is left
+ * out: promoting it would rewrite a third party's text as the user's own
+ * lesson, valid for every project, and drop the origin recall shows for it.
+ *
+ * Read-only and pure: it suggests, it never moves anything.
+ */
+function findPromotionCandidates(neurons, seedIds, max = exports.MAX_PROMOTION_CANDIDATES) {
+    const semillasIds = new Set(seedIds);
+    if (semillasIds.size === 0)
+        return [];
+    const lecciones = [];
+    for (const n of neurons) {
+        if (!n || n.type !== 'project')
+            continue;
+        const retirada = (t) => !!n.entry_status?.[(0, ops_js_1.entryId)(t)];
+        for (const f of n.facts || []) {
+            if (!f?.text || f.status === 'superseded' || f.status === 'retracted')
+                continue;
+            if (f.source && f.source !== 'session')
+                continue; // not the user's own: never promoted
+            lecciones.push({ neuron: n.id, kind: 'fact', id: f.id || (0, hash_js_1.factId)(f.text), text: f.text, norm: normLesson(f.text), conf: Math.max(1, f.confirmations ?? 1) });
+        }
+        for (const [kind, lista] of [['pattern', n.patterns], ['error', n.errors]]) {
+            for (const t of lista || []) {
+                if (!t || retirada(t))
+                    continue;
+                if (n.entry_source?.[(0, ops_js_1.entryId)(t)])
+                    continue; // a teammate's or the miner's: never promoted
+                lecciones.push({ neuron: n.id, kind, id: (0, ops_js_1.entryId)(t), text: t, norm: normLesson(t), conf: 1 });
+            }
+        }
+    }
+    // Inverted indexes built once: word → lessons, number → lessons, text → lessons.
+    const porPalabra = new Map();
+    const porNumero = new Map();
+    const porTexto = new Map();
+    const palabras = [];
+    lecciones.forEach((l, i) => {
+        const ws = lessonWords(l.norm);
+        palabras.push(new Set(ws));
+        for (const w of ws)
+            (porPalabra.get(w) || porPalabra.set(w, []).get(w)).push(i);
+        for (const n of lessonNumbers(l.norm))
+            (porNumero.get(n) || porNumero.set(n, []).get(n)).push(i);
+        (porTexto.get(l.norm) || porTexto.set(l.norm, []).get(l.norm)).push(i);
+    });
+    const comun = Math.max(PROMOTION_COMMON_WORD.min, Math.ceil(lecciones.length * PROMOTION_COMMON_WORD.share));
+    /**
+     * The lessons worth a bigram test against seed `s`. Two filters, both
+     * cheaper than one Dice count and both implied by what follows it:
+     *  - numbers: a near copy must carry the same numbers (the guard below), so
+     *    it must hold every number the seed holds — an intersection of postings;
+     *  - words: it must share most of the seed's distinctive words.
+     * Templated text ("module 155 uses table 5…" ×24,000) is exactly where a
+     * plain rare-word probe degrades into comparing against everything.
+     */
+    const candidatosDe = (s) => {
+        const semilla = lecciones[s];
+        const nums = lessonNumbers(semilla.norm);
+        const distintivas = [...palabras[s]].filter(w => (porPalabra.get(w)?.length ?? 0) <= comun);
+        // Nothing to tell copies apart by — every word is everywhere — means
+        // exact copies only, even when it holds a number: "2026" alone would
+        // otherwise send it against every lesson written this year.
+        if (distintivas.length === 0)
+            return [];
+        const minimo = Math.ceil(distintivas.length * PROMOTION_MIN_OVERLAP);
+        let base = null;
+        if (nums.length) {
+            const listas = nums.map(n => porNumero.get(n) || []).sort((a, b) => a.length - b.length);
+            let inter = new Set(listas[0]);
+            for (const l of listas.slice(1)) {
+                const otra = new Set(l);
+                inter = new Set([...inter].filter(i => otra.has(i)));
+            }
+            base = [...inter];
+        }
+        const fuera = (i) => lecciones[i].neuron === semilla.neuron || lecciones[i].norm === semilla.norm;
+        if (base) {
+            return base.filter(i => !fuera(i) && distintivas.reduce((n, w) => n + (palabras[i].has(w) ? 1 : 0), 0) >= minimo);
+        }
+        const cuenta = new Map();
+        for (const w of distintivas)
+            for (const i of porPalabra.get(w))
+                cuenta.set(i, (cuenta.get(i) || 0) + 1);
+        return [...cuenta].filter(([i, n]) => n >= minimo && !fuera(i)).map(([i]) => i);
+    };
+    const semillas = lecciones.map((_, i) => i).filter(i => semillasIds.has(lecciones[i].neuron)).slice(0, MAX_PROMOTION_SEEDS);
+    const usadas = new Set();
+    const grupos = [];
+    for (const s of semillas) {
+        if (usadas.has(s))
+            continue;
+        const semilla = lecciones[s];
+        // Best copy per OTHER project neuron.
+        const mejor = new Map();
+        const anotar = (i, sim) => {
+            const l = lecciones[i];
+            if (l.neuron === semilla.neuron)
+                return;
+            const prev = mejor.get(l.neuron);
+            if (!prev || sim > prev.sim)
+                mejor.set(l.neuron, { i, sim });
+        };
+        for (const i of porTexto.get(semilla.norm) || [])
+            anotar(i, 1);
+        if (semilla.text.length >= NEAR_DUP_MIN_LENGTH) {
+            // Across projects, a copy that disagrees on a number is another lesson
+            // ("the 2.5 index" vs "the 2.6 index"): the same guard name matching uses.
+            const pool = candidatosDe(s)
+                .filter(i => sameNumbers(semilla.text, lecciones[i].text))
+                .map(i => ({ id: String(i), text: lecciones[i].text }));
+            for (const hit of nearDuplicatesAmong(semilla.text, pool))
+                anotar(Number(hit.id), hit.similarity);
+        }
+        if (mejor.size === 0)
+            continue;
+        const miembros = [s, ...[...mejor.values()].map(m => m.i)];
+        for (const m of miembros)
+            usadas.add(m);
+        grupos.push({ miembros, similarity: Math.min(...[...mejor.values()].map(m => m.sim)) });
+    }
+    return grupos
+        .map(g => {
+        const ls = g.miembros.map(i => lecciones[i]);
+        const rep = [...ls].sort((a, b) => (b.conf - a.conf) || (b.text.length - a.text.length))[0];
+        return {
+            kind: rep.kind,
+            text: rep.text,
+            neurons: ls.map(l => l.neuron),
+            entry_ids: ls.map(l => l.id),
+            similarity: g.similarity,
+            confirmations: ls.reduce((n, l) => n + l.conf, 0),
+        };
+    })
+        .sort((a, b) => (b.neurons.length - a.neurons.length) || (b.confirmations - a.confirmations)
+        || (b.similarity - a.similarity) || (a.text < b.text ? -1 : 1))
+        .slice(0, max);
+}
 /** Where a fact's lifecycle stands, for "take the furthest-along status". */
 function statusRank(status) {
     return status === 'retracted' ? 2 : status === 'superseded' ? 1 : 0;
@@ -147,6 +350,11 @@ function unionNeuron(target, source) {
                 hit.superseded_by = sf.superseded_by;
         }
         hit.added = earliestOf(hit.added, sf.added);
+        // Two copies of one line: the better-witnessed count stands. Summing
+        // would count twice the sessions both copies may have seen.
+        const conf = Math.max(hit.confirmations ?? 1, sf.confirmations ?? 1);
+        if (conf > 1)
+            hit.confirmations = conf;
         const keys = normalizeKeys([...(hit.keys || []), ...(sf.keys || [])]);
         if (keys.length)
             hit.keys = keys;
@@ -227,6 +435,15 @@ function unionNeuron(target, source) {
         neuron.entry_status = estadosVivos;
     else
         delete neuron.entry_status;
+    const origenes = { ...(source.entry_source || {}), ...(target.entry_source || {}) };
+    const origenesVivos = {};
+    for (const k of Object.keys(origenes).sort())
+        if (vivos.has(k))
+            origenesVivos[k] = origenes[k];
+    if (Object.keys(origenesVivos).length)
+        neuron.entry_source = origenesVivos;
+    else
+        delete neuron.entry_source;
     // ── Map: the target's if it has one, else the source's ──
     if (target.map)
         neuron.map = { ...target.map };
@@ -532,6 +749,7 @@ class Cortex {
         let emitir = null;
         let duplicate = false;
         let updatedInPlace = false;
+        let confirmations;
         let skippedRetired = null;
         // A retired decision, pattern, error or debt must not come back through
         // learn: the sidecar says so, and the index already hides it.
@@ -553,6 +771,21 @@ class Cortex {
                 n.entry_dates = {};
             n.entry_dates[(0, ops_js_1.entryId)(text)] = (0, fs_js_1.now)();
         };
+        // Where a non-fact entry came from, when it is not this session (2.7):
+        // the sidecar twin of Fact.source. A line written here clears a stale
+        // mark, so a teammate's pattern forgotten and re-learned reads as yours.
+        const origen = (n, text) => {
+            const k = (0, ops_js_1.entryId)(text);
+            const src = options?.source;
+            if (src && src !== 'session' && src !== 'manual') {
+                (n.entry_source ||= {})[k] = src;
+            }
+            else if (n.entry_source?.[k]) {
+                delete n.entry_source[k];
+                if (Object.keys(n.entry_source).length === 0)
+                    delete n.entry_source;
+            }
+        };
         const actualizada = await (0, fs_js_1.updateJSON)(this.brain.paths.neuron(neuron.id), current => {
             const n = current || neuron;
             switch (type) {
@@ -577,6 +810,17 @@ class Cortex {
                         // may be edited in place. The indexer re-indexes the neuron
                         // afterwards, keys included.
                         duplicate = true;
+                        // The same line from another session is a second witness (2.7).
+                        // The same session saying it again is not (a retry, the re-save
+                        // after a compaction), and neither is the miner re-reading a file.
+                        const testigo = `${n.id}|${existente.id || (0, hash_js_1.factId)(existente.text)}`;
+                        const vistos = (this.tally.witnessed ??= new Set());
+                        if (options?.source !== 'miner' && !vistos.has(testigo)) {
+                            existente.confirmations = (existente.confirmations ?? 1) + 1;
+                        }
+                        if (options?.source !== 'miner')
+                            vistos.add(testigo);
+                        confirmations = existente.confirmations ?? 1;
                         let cambiado = false;
                         if (options?.confidence !== undefined && options.confidence !== existente.confidence) {
                             existente.confidence = options.confidence;
@@ -633,6 +877,8 @@ class Cortex {
                         if (keys.length)
                             fact.keys = keys;
                         n.facts.push(fact);
+                        if (fact.source !== 'miner')
+                            (this.tally.witnessed ??= new Set()).add(`${n.id}|${id}`);
                         this.tally.facts++;
                         this.tally.topics.add(n.id);
                         emitir = { kind: 'fact', text: content, fid: id,
@@ -649,6 +895,7 @@ class Cortex {
                         rationale: options?.rationale || '',
                     };
                     n.decisions.push(decision);
+                    origen(n, content);
                     this.tally.decisions++;
                     this.tally.topics.add(n.id);
                     emitir = { kind: 'decision', text: content,
@@ -661,6 +908,7 @@ class Cortex {
                     if (!n.patterns.includes(content)) {
                         n.patterns.push(content);
                         fechar(n, content);
+                        origen(n, content);
                         emitir = { kind: 'pattern', text: content, at: (0, fs_js_1.now)() };
                     }
                     break;
@@ -680,6 +928,7 @@ class Cortex {
                     if (!n.errors.includes(content)) {
                         n.errors.push(content);
                         fechar(n, content);
+                        origen(n, content);
                         this.tally.topics.add(n.id);
                         emitir = { kind: 'error', text: content, at: (0, fs_js_1.now)() };
                     }
@@ -693,6 +942,7 @@ class Cortex {
                     if (!n.debts.includes(content)) {
                         n.debts.push(content);
                         fechar(n, content);
+                        origen(n, content);
                         this.tally.topics.add(n.id);
                         emitir = { kind: 'debt', text: content, at: (0, fs_js_1.now)() };
                     }
@@ -724,6 +974,7 @@ class Cortex {
             neuron: final, action, superseded, supersedes_unmatched: supersedesUnmatched,
             near_duplicates: nearDuplicates, redacted: limpio.found,
             duplicate, updated_in_place: updatedInPlace, skipped_retired: null,
+            ...(confirmations !== undefined ? { confirmations } : {}),
         };
     }
     /**
@@ -784,28 +1035,12 @@ class Cortex {
      * telling, never the engine merging on its own.
      */
     findNearDuplicates(neuron, content) {
-        if (content.length < NEAR_DUP_MIN_LENGTH)
-            return [];
-        const nuevo = content.toLowerCase();
-        const out = [];
-        for (const fact of neuron.facts) {
-            if (fact.status === 'superseded' || fact.status === 'retracted')
-                continue;
-            if (!fact.text || fact.text.length < NEAR_DUP_MIN_LENGTH)
-                continue;
-            if (fact.text === content)
-                continue; // the new fact itself, already pushed
-            const score = similarity(nuevo, fact.text.toLowerCase());
-            if (score >= NEAR_DUP_THRESHOLD) {
-                out.push({
-                    id: fact.id || (0, hash_js_1.factId)(fact.text),
-                    similarity: Math.round(score * 100) / 100,
-                    preview: fact.text.slice(0, 120),
-                });
-            }
-        }
-        out.sort((a, b) => b.similarity - a.similarity);
-        return out.slice(0, 5);
+        const activos = neuron.facts
+            .filter(f => f.status !== 'superseded' && f.status !== 'retracted' && f.text && f.text !== content)
+            .map(f => ({ id: f.id || (0, hash_js_1.factId)(f.text), text: f.text }));
+        return nearDuplicatesAmong(content, activos)
+            .slice(0, 5)
+            .map(({ id, similarity: s, text }) => ({ id, similarity: s, preview: text.slice(0, 120) }));
     }
     /**
      * Flip matching facts to a non-active status.
@@ -1203,6 +1438,17 @@ class Cortex {
                 if (Object.keys(current.entry_status).length === 0)
                     delete current.entry_status;
             }
+            // And for provenance: a forgotten teammate line that comes back through
+            // a sync replay must be labelled by that replay, not by a stale key.
+            if (current.entry_source) {
+                const vivos = liveEntryKeys(current);
+                for (const k of Object.keys(current.entry_source)) {
+                    if (!vivos.has(k))
+                        delete current.entry_source[k];
+                }
+                if (Object.keys(current.entry_source).length === 0)
+                    delete current.entry_source;
+            }
             current.last_accessed = (0, fs_js_1.now)();
             return current;
         });