@framers/agentos 0.3.0 → 0.3.2

package/dist/memory/retrieval/store/migrations/types.d.ts

@@ -0,0 +1,28 @@
+/**
+ * @fileoverview Migration interface and shared types for MigrationRunner.
+ *
+ * @module memory/retrieval/store/migrations/types
+ */
+import type { StorageAdapter, StorageFeatures } from '@framers/sql-storage-adapter';
+/**
+ * A single schema migration. The runner handles transaction wrapping, advisory
+ * locking, and the schema_version bump. The migration's `up` function only
+ * needs to apply the schema diff (DDL + data backfill) for its target version.
+ *
+ * Migrations MUST NOT manage their own transactions. The adapter passed into
+ * `up` is the runner's transactional adapter; calling BEGIN/COMMIT inside `up`
+ * breaks the runner's transaction model on both Postgres and SQLite.
+ */
+export interface Migration {
+    /** Target schema version this migration upgrades the database to. */
+    version: number;
+    /**
+     * Apply the schema diff for this migration's target version.
+     *
+     * @param adapter - Transactional storage adapter (do NOT BEGIN/COMMIT inside).
+     * @param features - Platform-aware feature bundle.
+     * @param brainId - The brain identifier to scope writes to.
+     */
+    up(adapter: StorageAdapter, features: StorageFeatures, brainId: string): Promise<void>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/memory/retrieval/store/migrations/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../../src/memory/retrieval/store/migrations/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAEpF;;;;;;;;GAQG;AACH,MAAM,WAAW,SAAS;IACxB,qEAAqE;IACrE,OAAO,EAAE,MAAM,CAAC;IAChB;;;;;;OAMG;IACH,EAAE,CAAC,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACxF"}

package/dist/memory/retrieval/store/migrations/types.js

@@ -0,0 +1,7 @@
+/**
+ * @fileoverview Migration interface and shared types for MigrationRunner.
+ *
+ * @module memory/retrieval/store/migrations/types
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/memory/retrieval/store/migrations/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../../src/memory/retrieval/store/migrations/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/dist/memory/retrieval/store/migrations/v1-to-v2.d.ts

@@ -15,6 +15,7 @@
  * @module memory/retrieval/store/migrations/v1-to-v2
  */
 import type { StorageAdapter, StorageFeatures } from '@framers/sql-storage-adapter';
+import type { Migration } from './types.js';
 /**
  * Run the v1 -> v2 migration on the given storage adapter.
  *
@@ -28,4 +29,12 @@ import type { StorageAdapter, StorageFeatures } from '@framers/sql-storage-adapt
 export declare function migrateV1ToV2(adapter: StorageAdapter, features: StorageFeatures, brainId: string): Promise<{
     migrated: boolean;
 }>;
+/**
+ * The v1 -> v2 schema migration as a Migration object for MigrationRunner.
+ *
+ * The runner handles transaction wrapping, advisory locking, and the
+ * schema_version bump. This Migration's `up` function only runs the schema
+ * diff (the 14-table walk).
+ */
+export declare const v1ToV2: Migration;
 //# sourceMappingURL=v1-to-v2.d.ts.map

package/dist/memory/retrieval/store/migrations/v1-to-v2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"v1-to-v2.d.ts","sourceRoot":"","sources":["../../../../../src/memory/retrieval/store/migrations/v1-to-v2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AA2SpF;;;;;;;;;GASG;AACH,wBAAsB,aAAa,CACjC,OAAO,EAAE,cAAc,EACvB,QAAQ,EAAE,eAAe,EACzB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC;IAAE,QAAQ,EAAE,OAAO,CAAA;CAAE,CAAC,CAqChC"}
+{"version":3,"file":"v1-to-v2.d.ts","sourceRoot":"","sources":["../../../../../src/memory/retrieval/store/migrations/v1-to-v2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAEpF,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAgU5C;;;;;;;;;GASG;AACH,wBAAsB,aAAa,CACjC,OAAO,EAAE,cAAc,EACvB,QAAQ,EAAE,eAAe,EACzB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC;IAAE,QAAQ,EAAE,OAAO,CAAA;CAAE,CAAC,CAqChC;AA+JD;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,EAAE,SA+BpB,CAAC"}

package/dist/memory/retrieval/store/migrations/v1-to-v2.js

@@ -14,6 +14,7 @@
  *
  * @module memory/retrieval/store/migrations/v1-to-v2
  */
+import { PORTABLE_TABLES } from '../portable-tables.js';
 /**
  * The 14 tables that gain `brain_id` in v2. Order matters for FK resolution:
  * documents must exist before document_chunks; conversations before messages.
@@ -266,6 +267,12 @@ const V2_TABLES = [
         primaryKey: ['brain_id', 'trace_id'],
         // Migration: copy existing agent_id column into brain_id (legacy archive
         // already discriminated by agent_id, which is semantically the same).
+        //
+        // CAVEAT: if the caller passes an explicit brainId override that differs
+        // from the original agent_id, archived_traces row brain_ids stay at the
+        // original agent_id values (not the override). Live tables receive the
+        // override; only archived_traces inherits agent_id. To rebrand archives,
+        // run a separate UPDATE statement after migration.
         brainIdSourceColumn: 'agent_id',
         indexes: [
             `CREATE INDEX IF NOT EXISTS idx_archived_traces_brain_time
@@ -289,6 +296,16 @@ const V2_TABLES = [
         ],
     },
 ];
+// Sanity check: V2_TABLES names must exactly equal PORTABLE_TABLES order.
+// Failing this assertion means the migration order would not match the
+// portable-artifact order, breaking import/export.
+const v2TableNames = V2_TABLES.map((t) => t.name);
+const portableTableNames = [...PORTABLE_TABLES];
+if (v2TableNames.length !== portableTableNames.length ||
+    v2TableNames.some((n, i) => n !== portableTableNames[i])) {
+    throw new Error(`v1-to-v2.ts: V2_TABLES order (${v2TableNames.join(',')}) does not match ` +
+        `PORTABLE_TABLES (${portableTableNames.join(',')}). Reconcile portable-tables.ts.`);
+}
 /**
  * Run the v1 -> v2 migration on the given storage adapter.
  *
@@ -402,10 +419,23 @@ async function migrateSqliteTable(adapter, table, brainId) {
 async function migratePostgresTable(adapter, table, brainId) {
     const escapedBrainId = brainId.replace(/'/g, "''");
     if (table.brainIdSourceColumn) {
-        // Add nullable, then UPDATE from source column, then SET NOT NULL.
-        await adapter.exec(`ALTER TABLE ${table.name} ADD COLUMN brain_id TEXT`);
-        await adapter.exec(`UPDATE ${table.name} SET brain_id = ${table.brainIdSourceColumn}`);
-        await adapter.exec(`ALTER TABLE ${table.name} ALTER COLUMN brain_id SET NOT NULL`);
+        // Defensive: an old archived_traces table might exist without the
+        // expected source column (e.g., schema drift from manual SQL or pre-
+        // archive-feature deployments). Mirror the SQLite path's column-existence
+        // check (see migrateSqliteTable) so a missing source column falls back
+        // to the supplied brainId default rather than crashing the migration.
+        const hasSourceColumn = await postgresHasColumn(adapter, table.name, table.brainIdSourceColumn);
+        if (hasSourceColumn) {
+            await adapter.exec(`ALTER TABLE ${table.name} ADD COLUMN brain_id TEXT`);
+            await adapter.exec(`UPDATE ${table.name} SET brain_id = ${table.brainIdSourceColumn}`);
+            await adapter.exec(`ALTER TABLE ${table.name} ALTER COLUMN brain_id SET NOT NULL`);
+        }
+        else {
+            // Source column missing: fall back to the supplied brainId default,
+            // same as the no-source-column path.
+            await adapter.exec(`ALTER TABLE ${table.name} ADD COLUMN brain_id TEXT NOT NULL DEFAULT '${escapedBrainId}'`);
+            await adapter.exec(`ALTER TABLE ${table.name} ALTER COLUMN brain_id DROP DEFAULT`);
+        }
     }
     else {
         await adapter.exec(`ALTER TABLE ${table.name} ADD COLUMN brain_id TEXT NOT NULL DEFAULT '${escapedBrainId}'`);
@@ -420,4 +450,42 @@ async function migratePostgresTable(adapter, table, brainId) {
         await adapter.exec(idx);
     }
 }
+/**
+ * The v1 -> v2 schema migration as a Migration object for MigrationRunner.
+ *
+ * The runner handles transaction wrapping, advisory locking, and the
+ * schema_version bump. This Migration's `up` function only runs the schema
+ * diff (the 14-table walk).
+ */
+export const v1ToV2 = {
+    version: 2,
+    up: async (adapter, _features, brainId) => {
+        // The runner already detected that schema_version < 2 (or null=fresh; in
+        // the fresh case the runner would have skipped this migration entirely).
+        // We still defensively check brain_meta column existence so a partial v1
+        // schema doesn't blow up the migration.
+        const isPostgres = adapter.kind.includes('postgres');
+        const hasBrainId = isPostgres
+            ? await postgresHasColumn(adapter, 'brain_meta', 'brain_id')
+            : await sqliteHasColumn(adapter, 'brain_meta', 'brain_id');
+        if (hasBrainId) {
+            // Schema is already at v2 column shape; runner's version filter caught
+            // this case. Defensive no-op.
+            return;
+        }
+        for (const table of V2_TABLES) {
+            const exists = isPostgres
+                ? await postgresTableExists(adapter, table.name)
+                : await sqliteTableExists(adapter, table.name);
+            if (!exists)
+                continue;
+            if (isPostgres) {
+                await migratePostgresTable(adapter, table, brainId);
+            }
+            else {
+                await migrateSqliteTable(adapter, table, brainId);
+            }
+        }
+    },
+};
 //# sourceMappingURL=v1-to-v2.js.map

package/dist/memory/retrieval/store/migrations/v1-to-v2.js.map

@@ -1 +1 @@
-{"version":3,"file":"v1-to-v2.js","sourceRoot":"","sources":["../../../../../src/memory/retrieval/store/migrations/v1-to-v2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAyBH;;;GAGG;AACH,MAAM,SAAS,GAAgB;IAC7B;QACE,IAAI,EAAE,YAAY;QAClB,UAAU,EAAE,gEAAgE;QAC5E,UAAU,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC;QAC/B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,eAAe;QACrB,UAAU,EAAE;;;;;;;;;;;;;;;KAeX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE;YACP;4DACsD;YACtD;4CACsC;SACvC;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE;YACP;6CACuC;SACxC;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,4EAA4E;YAC5E,4EAA4E;SAC7E;QACD,OAAO,EAAE;YACP;kDAC4C;YAC5C;kDAC4C;SAC7C;KACF;IACD;QACE,IAAI,EAAE,WAAW;QACjB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;KASX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,wEAAwE;YACxE,yEAAyE;SAC1E;QACD,OAAO,EAAE;YACP;iEAC2D;SAC5D;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,wEAAwE;YACxE,2EAA2E;SAC5E;QACD,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,UAAU,EAAE;;;;;;;;;KASX;QACD,UAAU,EAAE,EAAE,EAAE,wDAAwD;QACxE,eAAe,EAAE,IAAI;QACrB,OAAO,EAAE;YACP;sDACgD;SACjD;KACF;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,UAAU,EAAE;;;;;;;KAOX;QACD,UAAU,EAAE,EAAE;QACd,eAAe,EAAE,IAAI;QACrB,WAAW,EAAE;YACX,yEAAyE;SAC1E;QACD,OAAO,EAAE;YACP;qEAC+D;SAChE;KACF;IACD;QACE,IAAI,EAAE,eAAe;QACrB,UAAU,EAAE;;;;;;;KAOX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE;;;;;;;;KAQX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,gFAAgF;SACjF;QACD,OAAO,EAAE;YACP;6DACuD;SACxD;KACF;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,UAAU,EAAE;;;;;;;;;;;;;;;KAeX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;;;;;KAcX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACpC,yEAAyE;QACzE,sEAAsE;QACtE,mBAAmB,EAAE,UAAU;QAC/B,OAAO,EAAE;YACP;oDAC8C;YAC9C;uDACiD;SAClD;KACF;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,UAAU,EAAE;;;;;KAKX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,aAAa,CAAC;QACnD,OAAO,EAAE;YACP;sEACgE;SACjE;KACF;CACF,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAuB,EACvB,QAAyB,EACzB,OAAe;IAEf,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IAErD,oDAAoD;IACpD,mFAAmF;IACnF,MAAM,eAAe,GAAG,UAAU;QAChC,CAAC,CAAC,MAAM,mBAAmB,CAAC,OAAO,EAAE,YAAY,CAAC;QAClD,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAEnD,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,uEAAuE;QACvE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,MAAM,UAAU,GAAG,UAAU;QAC3B,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,CAAC;QAC5D,CAAC,CAAC,MAAM,eAAe,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;IAE7D,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,wEAAwE;IACxE,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,UAAU;YACvB,CAAC,CAAC,MAAM,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC;YAChD,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM;YAAE,SAAS;QAEtB,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,MAAM,kBAAkB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED,KAAK,UAAU,iBAAiB,CAAC,OAAuB,EAAE,KAAa;IACrE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAC3B,8DAA8D,EAC9D,CAAC,KAAK,CAAC,CACR,CAAC;IACF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AACtB,CAAC;AAED,KAAK,UAAU,mBAAmB,CAAC,OAAuB,EAAE,KAAa;IACvE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAC3B;;;iBAGa,EACb,CAAC,KAAK,CAAC,CACR,CAAC;IACF,OAAO,GAAG,EAAE,MAAM,IAAI,KAAK,CAAC;AAC9B,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,OAAuB,EACvB,KAAa,EACb,MAAc;IAEd,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAmB,qBAAqB,KAAK,GAAG,CAAC,CAAC;IAChF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;AAC7C,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC9B,OAAuB,EACvB,KAAa,EACb,MAAc;IAEd,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAC3B;;;iBAGa,EACb,CAAC,KAAK,EAAE,MAAM,CAAC,CAChB,CAAC;IACF,OAAO,GAAG,EAAE,MAAM,IAAI,KAAK,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;GAUG;AACH,KAAK,UAAU,kBAAkB,CAC/B,OAAuB,EACvB,KAAgB,EAChB,OAAe;IAEf,MAAM,UAAU,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,CAAmB,qBAAqB,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAC9F,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CACd,CAAC;IAEF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IAE3E,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IACrG,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;QAChE,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3C,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,OAAO,CAAC,IAAI,CAChB,gBAAgB,KAAK,CAAC,IAAI;SACrB,KAAK,CAAC,UAAU,GAAG,QAAQ,GAAG,QAAQ;OACxC,CACJ,CAAC;IAEF,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,KAAK,CAAC,mBAAmB,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAChF,0DAA0D;QAC1D,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,eAAe,UAAU;kBACtC,KAAK,CAAC,mBAAmB,KAAK,UAAU,SAAS,KAAK,CAAC,IAAI,KAAK,CAC7E,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,MAAM,OAAO,CAAC,GAAG,CACf,eAAe,KAAK,CAAC,IAAI,eAAe,UAAU;qBACnC,UAAU,SAAS,KAAK,CAAC,IAAI,KAAK,EACjD,CAAC,OAAO,CAAC,CACV,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,CAAC,IAAI,CAAC,cAAc,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IAElD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,KAAK,UAAU,oBAAoB,CACjC,OAAuB,EACvB,KAAgB,EAChB,OAAe;IAEf,MAAM,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEnD,IAAI,KAAK,CAAC,mBAAmB,EAAE,CAAC;QAC9B,mEAAmE;QACnE,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,2BAA2B,CAAC,CAAC;QACzE,MAAM,OAAO,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,mBAAmB,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC;QACvF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,qCAAqC,CAAC,CAAC;IACrF,CAAC;SAAM,CAAC;QACN,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,+CAA+C,cAAc,GAAG,CAC1F,CAAC;QACF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,qCAAqC,CAAC,CAAC;IACrF,CAAC;IAED,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,gEAAgE;QAChE,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,8BAA8B,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC;QAC7F,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,qBAAqB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC7E,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC"}
+{"version":3,"file":"v1-to-v2.js","sourceRoot":"","sources":["../../../../../src/memory/retrieval/store/migrations/v1-to-v2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAwBxD;;;GAGG;AACH,MAAM,SAAS,GAAgB;IAC7B;QACE,IAAI,EAAE,YAAY;QAClB,UAAU,EAAE,gEAAgE;QAC5E,UAAU,EAAE,CAAC,UAAU,EAAE,KAAK,CAAC;QAC/B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,eAAe;QACrB,UAAU,EAAE;;;;;;;;;;;;;;;KAeX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE;YACP;4DACsD;YACtD;4CACsC;SACvC;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE;YACP;6CACuC;SACxC;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,4EAA4E;YAC5E,4EAA4E;SAC7E;QACD,OAAO,EAAE;YACP;kDAC4C;YAC5C;kDAC4C;SAC7C;KACF;IACD;QACE,IAAI,EAAE,WAAW;QACjB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;KASX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,wEAAwE;YACxE,yEAAyE;SAC1E;QACD,OAAO,EAAE;YACP;iEAC2D;SAC5D;KACF;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;KAUX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,wEAAwE;YACxE,2EAA2E;SAC5E;QACD,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,UAAU,EAAE;;;;;;;;;KASX;QACD,UAAU,EAAE,EAAE,EAAE,wDAAwD;QACxE,eAAe,EAAE,IAAI;QACrB,OAAO,EAAE;YACP;sDACgD;SACjD;KACF;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,UAAU,EAAE;;;;;;;KAOX;QACD,UAAU,EAAE,EAAE;QACd,eAAe,EAAE,IAAI;QACrB,WAAW,EAAE;YACX,yEAAyE;SAC1E;QACD,OAAO,EAAE;YACP;qEAC+D;SAChE;KACF;IACD;QACE,IAAI,EAAE,eAAe;QACrB,UAAU,EAAE;;;;;;;KAOX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,UAAU;QAChB,UAAU,EAAE;;;;;;;;KAQX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,WAAW,EAAE;YACX,gFAAgF;SACjF;QACD,OAAO,EAAE;YACP;6DACuD;SACxD;KACF;IACD;QACE,IAAI,EAAE,mBAAmB;QACzB,UAAU,EAAE;;;;;;;;;;;;;;;KAeX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC;QAC9B,OAAO,EAAE,EAAE;KACZ;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,UAAU,EAAE;;;;;;;;;;;;;;KAcX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QACpC,yEAAyE;QACzE,sEAAsE;QACtE,EAAE;QACF,yEAAyE;QACzE,wEAAwE;QACxE,uEAAuE;QACvE,yEAAyE;QACzE,mDAAmD;QACnD,mBAAmB,EAAE,UAAU;QAC/B,OAAO,EAAE;YACP;oDAC8C;YAC9C;uDACiD;SAClD;KACF;IACD;QACE,IAAI,EAAE,oBAAoB;QAC1B,UAAU,EAAE;;;;;KAKX;QACD,UAAU,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,aAAa,CAAC;QACnD,OAAO,EAAE;YACP;sEACgE;SACjE;KACF;CACF,CAAC;AAEF,0EAA0E;AAC1E,uEAAuE;AACvE,mDAAmD;AACnD,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAClD,MAAM,kBAAkB,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;AAChD,IACE,YAAY,CAAC,MAAM,KAAK,kBAAkB,CAAC,MAAM;IACjD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,kBAAkB,CAAC,CAAC,CAAC,CAAC,EACxD,CAAC;IACD,MAAM,IAAI,KAAK,CACb,iCAAiC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB;QACxE,oBAAoB,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,kCAAkC,CACrF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAuB,EACvB,QAAyB,EACzB,OAAe;IAEf,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IAErD,oDAAoD;IACpD,mFAAmF;IACnF,MAAM,eAAe,GAAG,UAAU;QAChC,CAAC,CAAC,MAAM,mBAAmB,CAAC,OAAO,EAAE,YAAY,CAAC;QAClD,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;IAEnD,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,uEAAuE;QACvE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,MAAM,UAAU,GAAG,UAAU;QAC3B,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,CAAC;QAC5D,CAAC,CAAC,MAAM,eAAe,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;IAE7D,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC7B,CAAC;IAED,wEAAwE;IACxE,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,UAAU;YACvB,CAAC,CAAC,MAAM,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC;YAChD,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM;YAAE,SAAS;QAEtB,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,MAAM,kBAAkB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED,KAAK,UAAU,iBAAiB,CAAC,OAAuB,EAAE,KAAa;IACrE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAC3B,8DAA8D,EAC9D,CAAC,KAAK,CAAC,CACR,CAAC;IACF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AACtB,CAAC;AAED,KAAK,UAAU,mBAAmB,CAAC,OAAuB,EAAE,KAAa;IACvE,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAC3B;;;iBAGa,EACb,CAAC,KAAK,CAAC,CACR,CAAC;IACF,OAAO,GAAG,EAAE,MAAM,IAAI,KAAK,CAAC;AAC9B,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,OAAuB,EACvB,KAAa,EACb,MAAc;IAEd,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAmB,qBAAqB,KAAK,GAAG,CAAC,CAAC;IAChF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;AAC7C,CAAC;AAED,KAAK,UAAU,iBAAiB,CAC9B,OAAuB,EACvB,KAAa,EACb,MAAc;IAEd,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAC3B;;;iBAGa,EACb,CAAC,KAAK,EAAE,MAAM,CAAC,CAChB,CAAC;IACF,OAAO,GAAG,EAAE,MAAM,IAAI,KAAK,CAAC;AAC9B,CAAC;AAED;;;;;;;;;;GAUG;AACH,KAAK,UAAU,kBAAkB,CAC/B,OAAuB,EACvB,KAAgB,EAChB,OAAe;IAEf,MAAM,UAAU,GAAG,CAAC,MAAM,OAAO,CAAC,GAAG,CAAmB,qBAAqB,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAC9F,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CACd,CAAC;IAEF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,cAAc,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IAE3E,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IACrG,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;QAChE,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC;QAC3C,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,OAAO,CAAC,IAAI,CAChB,gBAAgB,KAAK,CAAC,IAAI;SACrB,KAAK,CAAC,UAAU,GAAG,QAAQ,GAAG,QAAQ;OACxC,CACJ,CAAC;IAEF,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,KAAK,CAAC,mBAAmB,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAChF,0DAA0D;QAC1D,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,eAAe,UAAU;kBACtC,KAAK,CAAC,mBAAmB,KAAK,UAAU,SAAS,KAAK,CAAC,IAAI,KAAK,CAC7E,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,MAAM,OAAO,CAAC,GAAG,CACf,eAAe,KAAK,CAAC,IAAI,eAAe,UAAU;qBACnC,UAAU,SAAS,KAAK,CAAC,IAAI,KAAK,EACjD,CAAC,OAAO,CAAC,CACV,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,CAAC,IAAI,CAAC,cAAc,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IAElD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,KAAK,UAAU,oBAAoB,CACjC,OAAuB,EACvB,KAAgB,EAChB,OAAe;IAEf,MAAM,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEnD,IAAI,KAAK,CAAC,mBAAmB,EAAE,CAAC;QAC9B,kEAAkE;QAClE,qEAAqE;QACrE,0EAA0E;QAC1E,uEAAuE;QACvE,sEAAsE;QACtE,MAAM,eAAe,GAAG,MAAM,iBAAiB,CAC7C,OAAO,EACP,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,mBAAmB,CAC1B,CAAC;QACF,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,2BAA2B,CAAC,CAAC;YACzE,MAAM,OAAO,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,mBAAmB,KAAK,CAAC,mBAAmB,EAAE,CAAC,CAAC;YACvF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,qCAAqC,CAAC,CAAC;QACrF,CAAC;aAAM,CAAC;YACN,oEAAoE;YACpE,qCAAqC;YACrC,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,+CAA+C,cAAc,GAAG,CAC1F,CAAC;YACF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,qCAAqC,CAAC,CAAC;QACrF,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,+CAA+C,cAAc,GAAG,CAC1F,CAAC;QACF,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,qCAAqC,CAAC,CAAC;IACrF,CAAC;IAED,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,gEAAgE;QAChE,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,8BAA8B,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC;QAC7F,MAAM,OAAO,CAAC,IAAI,CAChB,eAAe,KAAK,CAAC,IAAI,qBAAqB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC7E,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,MAAM,GAAc;IAC/B,OAAO,EAAE,CAAC;IACV,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE;QACxC,yEAAyE;QACzE,yEAAyE;QACzE,yEAAyE;QACzE,wCAAwC;QACxC,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACrD,MAAM,UAAU,GAAG,UAAU;YAC3B,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,CAAC;YAC5D,CAAC,CAAC,MAAM,eAAe,CAAC,OAAO,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QAE7D,IAAI,UAAU,EAAE,CAAC;YACf,uEAAuE;YACvE,8BAA8B;YAC9B,OAAO;QACT,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,UAAU;gBACvB,CAAC,CAAC,MAAM,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC;gBAChD,CAAC,CAAC,MAAM,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,oBAAoB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACtD,CAAC;iBAAM,CAAC;gBACN,MAAM,kBAAkB,CAAC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;IACH,CAAC;CACF,CAAC"}

package/dist/memory/retrieval/store/portable-tables.d.ts

@@ -0,0 +1,27 @@
+/**
+ * @fileoverview Single source of truth for the list of brain-owned tables that
+ * are exported, imported, and migrated as a portable artifact.
+ *
+ * Three call sites import from here:
+ * 1. `Brain.exportToSqlite` / `importFromSqlite` (export/import row copies)
+ * 2. `migrations/v1-to-v2.ts` (migration walk order: parents before children for FKs)
+ * 3. `__tests__/Brain.postgres.test.ts` (cleanup between tests)
+ *
+ * Adding a new portable table requires editing only this file.
+ *
+ * @module memory/retrieval/store/portable-tables
+ */
+/**
+ * Order matters: parents before children to satisfy FK constraints during import.
+ */
+export declare const PORTABLE_TABLES: readonly ["brain_meta", "memory_traces", "knowledge_nodes", "knowledge_edges", "documents", "document_chunks", "document_images", "consolidation_log", "retrieval_feedback", "conversations", "messages", "prospective_items", "archived_traces", "archive_access_log"];
+/**
+ * Composite primary key columns for each portable table, used by
+ * `dialect.insertOrReplace` as the conflict target during merge import.
+ *
+ * Tables with `INTEGER PRIMARY KEY AUTOINCREMENT` (consolidation_log,
+ * retrieval_feedback) use `id` alone since their PK is system-generated.
+ */
+export declare const PORTABLE_TABLE_PRIMARY_KEYS: Record<string, string>;
+export type PortableTable = typeof PORTABLE_TABLES[number];
+//# sourceMappingURL=portable-tables.d.ts.map

package/dist/memory/retrieval/store/portable-tables.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"portable-tables.d.ts","sourceRoot":"","sources":["../../../../src/memory/retrieval/store/portable-tables.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH;;GAEG;AACH,eAAO,MAAM,eAAe,yQAelB,CAAC;AAEX;;;;;;GAMG;AACH,eAAO,MAAM,2BAA2B,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAe9D,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC"}

package/dist/memory/retrieval/store/portable-tables.js

@@ -0,0 +1,56 @@
+/**
+ * @fileoverview Single source of truth for the list of brain-owned tables that
+ * are exported, imported, and migrated as a portable artifact.
+ *
+ * Three call sites import from here:
+ * 1. `Brain.exportToSqlite` / `importFromSqlite` (export/import row copies)
+ * 2. `migrations/v1-to-v2.ts` (migration walk order: parents before children for FKs)
+ * 3. `__tests__/Brain.postgres.test.ts` (cleanup between tests)
+ *
+ * Adding a new portable table requires editing only this file.
+ *
+ * @module memory/retrieval/store/portable-tables
+ */
+/**
+ * Order matters: parents before children to satisfy FK constraints during import.
+ */
+export const PORTABLE_TABLES = [
+    'brain_meta',
+    'memory_traces',
+    'knowledge_nodes',
+    'knowledge_edges',
+    'documents',
+    'document_chunks',
+    'document_images',
+    'consolidation_log',
+    'retrieval_feedback',
+    'conversations',
+    'messages',
+    'prospective_items',
+    'archived_traces',
+    'archive_access_log',
+];
+/**
+ * Composite primary key columns for each portable table, used by
+ * `dialect.insertOrReplace` as the conflict target during merge import.
+ *
+ * Tables with `INTEGER PRIMARY KEY AUTOINCREMENT` (consolidation_log,
+ * retrieval_feedback) use `id` alone since their PK is system-generated.
+ */
+export const PORTABLE_TABLE_PRIMARY_KEYS = {
+    brain_meta: 'brain_id, key',
+    memory_traces: 'brain_id, id',
+    knowledge_nodes: 'brain_id, id',
+    knowledge_edges: 'brain_id, id',
+    documents: 'brain_id, id',
+    document_chunks: 'brain_id, id',
+    document_images: 'brain_id, id',
+    consolidation_log: 'id',
+    retrieval_feedback: 'id',
+    conversations: 'brain_id, id',
+    messages: 'brain_id, id',
+    prospective_items: 'brain_id, id',
+    archived_traces: 'brain_id, trace_id',
+    archive_access_log: 'brain_id, trace_id, accessed_at',
+};
+//# sourceMappingURL=portable-tables.js.map

package/dist/memory/retrieval/store/portable-tables.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"portable-tables.js","sourceRoot":"","sources":["../../../../src/memory/retrieval/store/portable-tables.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,YAAY;IACZ,eAAe;IACf,iBAAiB;IACjB,iBAAiB;IACjB,WAAW;IACX,iBAAiB;IACjB,iBAAiB;IACjB,mBAAmB;IACnB,oBAAoB;IACpB,eAAe;IACf,UAAU;IACV,mBAAmB;IACnB,iBAAiB;IACjB,oBAAoB;CACZ,CAAC;AAEX;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAA2B;IACjE,UAAU,EAAE,eAAe;IAC3B,aAAa,EAAE,cAAc;IAC7B,eAAe,EAAE,cAAc;IAC/B,eAAe,EAAE,cAAc;IAC/B,SAAS,EAAE,cAAc;IACzB,eAAe,EAAE,cAAc;IAC/B,eAAe,EAAE,cAAc;IAC/B,iBAAiB,EAAE,IAAI;IACvB,kBAAkB,EAAE,IAAI;IACxB,aAAa,EAAE,cAAc;IAC7B,QAAQ,EAAE,cAAc;IACxB,iBAAiB,EAAE,cAAc;IACjC,eAAe,EAAE,oBAAoB;IACrC,kBAAkB,EAAE,iCAAiC;CACtD,CAAC"}

package/dist/memory/retrieval/typed-network/FourWayRrf.d.ts

@@ -0,0 +1,51 @@
+/**
+ * @file FourWayRrf.ts
+ * @description Four-way Reciprocal Rank Fusion over the typed-network
+ * retrieval signals: semantic similarity, BM25 lexical match, graph
+ * spreading activation, and temporal interval overlap. Per Hindsight
+ * §2.4.3, the fusion uses standard RRF with `k=60`:
+ *
+ *   score(f) = Σ over rankings R of [1 / (k + rank_R(f))]
+ *
+ * Output is a single ranked list combining all four signals. Facts
+ * present in only some rankings are still scored — RRF naturally
+ * tolerates missing rankings because absent IDs contribute zero.
+ *
+ * @module @framers/agentos/memory/retrieval/typed-network/FourWayRrf
+ */
+/**
+ * Inputs to the fusion. Each list is an ordered array of fact IDs
+ * from a separate retrieval signal.
+ */
+export interface FourWayRrfInput {
+    /** Cosine-similarity ranking over fact embeddings. */
+    semantic: string[];
+    /** BM25 ranking over fact text. */
+    bm25: string[];
+    /** Spreading-activation ranking over the typed-network graph. */
+    graphActivation: string[];
+    /** Temporal-interval-overlap ranking against the query timestamp. */
+    temporalOverlap: string[];
+}
+/**
+ * Fusion options.
+ */
+export interface FourWayRrfOptions {
+    /** RRF constant. Default 60 per the standard literature. */
+    k?: number;
+    /**
+     * Optional per-signal weight multiplier. Defaults to {1, 1, 1, 1}
+     * (uniform RRF). Use to emphasize one signal over others — e.g.
+     * downweighting graph activation when the typed network is sparse.
+     */
+    weights?: Partial<Record<keyof FourWayRrfInput, number>>;
+}
+/**
+ * Fuse four retrieval rankings via Reciprocal Rank Fusion. Returns
+ * the merged list ordered by descending fused score.
+ *
+ * @param input - Four ranked lists (semantic, BM25, graph, temporal).
+ * @param options - RRF k constant + optional per-signal weights.
+ */
+export declare function fourWayRrf(input: FourWayRrfInput, options?: FourWayRrfOptions): string[];
+//# sourceMappingURL=FourWayRrf.d.ts.map

package/dist/memory/retrieval/typed-network/FourWayRrf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FourWayRrf.d.ts","sourceRoot":"","sources":["../../../../src/memory/retrieval/typed-network/FourWayRrf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,sDAAsD;IACtD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,mCAAmC;IACnC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,iEAAiE;IACjE,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,qEAAqE;IACrE,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,4DAA4D;IAC5D,CAAC,CAAC,EAAE,MAAM,CAAC;IACX;;;;OAIG;IACH,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC;CAC1D;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,eAAe,EACtB,OAAO,GAAE,iBAAsB,GAC9B,MAAM,EAAE,CA8BV"}

package/dist/memory/retrieval/typed-network/FourWayRrf.js

@@ -0,0 +1,47 @@
+/**
+ * @file FourWayRrf.ts
+ * @description Four-way Reciprocal Rank Fusion over the typed-network
+ * retrieval signals: semantic similarity, BM25 lexical match, graph
+ * spreading activation, and temporal interval overlap. Per Hindsight
+ * §2.4.3, the fusion uses standard RRF with `k=60`:
+ *
+ *   score(f) = Σ over rankings R of [1 / (k + rank_R(f))]
+ *
+ * Output is a single ranked list combining all four signals. Facts
+ * present in only some rankings are still scored — RRF naturally
+ * tolerates missing rankings because absent IDs contribute zero.
+ *
+ * @module @framers/agentos/memory/retrieval/typed-network/FourWayRrf
+ */
+/**
+ * Fuse four retrieval rankings via Reciprocal Rank Fusion. Returns
+ * the merged list ordered by descending fused score.
+ *
+ * @param input - Four ranked lists (semantic, BM25, graph, temporal).
+ * @param options - RRF k constant + optional per-signal weights.
+ */
+export function fourWayRrf(input, options = {}) {
+    const k = options.k ?? 60;
+    const w = {
+        semantic: options.weights?.semantic ?? 1,
+        bm25: options.weights?.bm25 ?? 1,
+        graphActivation: options.weights?.graphActivation ?? 1,
+        temporalOverlap: options.weights?.temporalOverlap ?? 1,
+    };
+    const scores = new Map();
+    const accumulate = (ranking, weight) => {
+        ranking.forEach((id, idx) => {
+            const rank = idx + 1;
+            const contribution = (1.0 / (k + rank)) * weight;
+            scores.set(id, (scores.get(id) ?? 0) + contribution);
+        });
+    };
+    accumulate(input.semantic, w.semantic);
+    accumulate(input.bm25, w.bm25);
+    accumulate(input.graphActivation, w.graphActivation);
+    accumulate(input.temporalOverlap, w.temporalOverlap);
+    return [...scores.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .map(([id]) => id);
+}
+//# sourceMappingURL=FourWayRrf.js.map

package/dist/memory/retrieval/typed-network/FourWayRrf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FourWayRrf.js","sourceRoot":"","sources":["../../../../src/memory/retrieval/typed-network/FourWayRrf.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AA+BH;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACxB,KAAsB,EACtB,UAA6B,EAAE;IAE/B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IAC1B,MAAM,CAAC,GAAG;QACR,QAAQ,EAAE,OAAO,CAAC,OAAO,EAAE,QAAQ,IAAI,CAAC;QACxC,IAAI,EAAE,OAAO,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC;QAChC,eAAe,EAAE,OAAO,CAAC,OAAO,EAAE,eAAe,IAAI,CAAC;QACtD,eAAe,EAAE,OAAO,CAAC,OAAO,EAAE,eAAe,IAAI,CAAC;KACvD,CAAC;IAEF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,MAAM,UAAU,GAAG,CACjB,OAAiB,EACjB,MAAc,EACR,EAAE;QACR,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE;YAC1B,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YACrB,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;IACvC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/B,UAAU,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC;IACrD,UAAU,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC;IAErD,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;SACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AACvB,CAAC"}

package/dist/memory/retrieval/typed-network/TemporalIntervalOverlap.d.ts

@@ -0,0 +1,34 @@
+/**
+ * @file TemporalIntervalOverlap.ts
+ * @description Temporal-overlap ranking signal for the 4-way RRF
+ * fusion. Given a query timestamp and a set of typed facts, ranks the
+ * facts by how tightly their occurrence intervals (`τs, τe`) bracket
+ * the query timestamp, with a graceful fallback to mention-timestamp
+ * distance for facts without a full interval.
+ *
+ * Hindsight Eq. 12 weighs temporal edges by `exp(−Δt / σt)`. This
+ * file's `rankByTemporalOverlap` produces the same monotone signal in
+ * a form suitable for the BM25 / semantic / spreading-activation /
+ * temporal four-way RRF fusion (see {@link FourWayRrf}).
+ *
+ * @module @framers/agentos/memory/retrieval/typed-network/TemporalIntervalOverlap
+ */
+import type { TypedFact } from './types.js';
+/**
+ * Rank an array of typed facts by their temporal proximity to a query
+ * timestamp. Facts whose `(start, end)` interval contains the query
+ * rank highest, with tighter intervals (smaller width) scoring higher
+ * within the contained set. Facts whose interval lies outside the
+ * query rank by the minimum endpoint distance. Facts with only a
+ * mention timestamp fall back to mention-distance.
+ *
+ * Returns a new array; the input is not mutated. Stable ordering
+ * within tied scores follows JavaScript's `Array.prototype.sort`
+ * insertion order.
+ *
+ * @param facts - Typed facts to rank.
+ * @param queryTimestamp - ISO 8601 string. Invalid timestamps fall
+ *   back to original ordering.
+ */
+export declare function rankByTemporalOverlap(facts: TypedFact[], queryTimestamp: string): TypedFact[];
+//# sourceMappingURL=TemporalIntervalOverlap.d.ts.map

package/dist/memory/retrieval/typed-network/TemporalIntervalOverlap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TemporalIntervalOverlap.d.ts","sourceRoot":"","sources":["../../../../src/memory/retrieval/typed-network/TemporalIntervalOverlap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAK5C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,SAAS,EAAE,EAClB,cAAc,EAAE,MAAM,GACrB,SAAS,EAAE,CAUb"}

package/dist/memory/retrieval/typed-network/TemporalIntervalOverlap.js

@@ -0,0 +1,86 @@
+/**
+ * @file TemporalIntervalOverlap.ts
+ * @description Temporal-overlap ranking signal for the 4-way RRF
+ * fusion. Given a query timestamp and a set of typed facts, ranks the
+ * facts by how tightly their occurrence intervals (`τs, τe`) bracket
+ * the query timestamp, with a graceful fallback to mention-timestamp
+ * distance for facts without a full interval.
+ *
+ * Hindsight Eq. 12 weighs temporal edges by `exp(−Δt / σt)`. This
+ * file's `rankByTemporalOverlap` produces the same monotone signal in
+ * a form suitable for the BM25 / semantic / spreading-activation /
+ * temporal four-way RRF fusion (see {@link FourWayRrf}).
+ *
+ * @module @framers/agentos/memory/retrieval/typed-network/TemporalIntervalOverlap
+ */
+/** One day in milliseconds — used as the natural unit for distance penalties. */
+const DAY_MS = 86400000;
+/**
+ * Rank an array of typed facts by their temporal proximity to a query
+ * timestamp. Facts whose `(start, end)` interval contains the query
+ * rank highest, with tighter intervals (smaller width) scoring higher
+ * within the contained set. Facts whose interval lies outside the
+ * query rank by the minimum endpoint distance. Facts with only a
+ * mention timestamp fall back to mention-distance.
+ *
+ * Returns a new array; the input is not mutated. Stable ordering
+ * within tied scores follows JavaScript's `Array.prototype.sort`
+ * insertion order.
+ *
+ * @param facts - Typed facts to rank.
+ * @param queryTimestamp - ISO 8601 string. Invalid timestamps fall
+ *   back to original ordering.
+ */
+export function rankByTemporalOverlap(facts, queryTimestamp) {
+    const queryMs = Date.parse(queryTimestamp);
+    if (Number.isNaN(queryMs))
+        return [...facts];
+    const scored = facts.map((f) => ({
+        fact: f,
+        score: scoreOverlap(f, queryMs),
+    }));
+    scored.sort((a, b) => b.score - a.score);
+    return scored.map((s) => s.fact);
+}
+/**
+ * Score a single fact against the query timestamp. Higher = more
+ * relevant.
+ *
+ * Score scale:
+ * - In-interval facts produce scores in (1.0, 2.0] — every in-interval
+ *   fact outranks every out-of-interval fact regardless of width vs
+ *   endpoint-distance. Tighter intervals score closer to 2.0.
+ * - Out-of-interval facts produce scores in (0, 1.0) — closer
+ *   endpoint distances score nearer to 1.0.
+ * - Mention-only facts produce scores in (0, 1.0) — same scale as
+ *   out-of-interval (the mention timestamp is treated as a degenerate
+ *   point-interval).
+ *
+ * The +1.0 boost on in-interval guarantees the order semantics the
+ * Hindsight paper §2.4.1 implies: temporal containment is a
+ * categorical match; width breaks ties within that category. Without
+ * the boost, a wide containing interval can score below a narrow non-
+ * containing one (which is geometrically wrong).
+ */
+function scoreOverlap(fact, queryMs) {
+    const start = fact.temporal.start ? Date.parse(fact.temporal.start) : NaN;
+    const end = fact.temporal.end ? Date.parse(fact.temporal.end) : NaN;
+    const mention = Date.parse(fact.temporal.mention);
+    if (!Number.isNaN(start) && !Number.isNaN(end)) {
+        if (queryMs >= start && queryMs <= end) {
+            // Query inside interval — score by inverse interval width,
+            // boosted by +1.0 so it outranks all out-of-interval facts.
+            const width = Math.max(1, end - start);
+            return 1.0 + 1.0 / (1 + width / DAY_MS);
+        }
+        // Query outside — penalize by distance to nearest endpoint.
+        const dist = Math.min(Math.abs(queryMs - start), Math.abs(queryMs - end));
+        return 1.0 / (1 + dist / DAY_MS);
+    }
+    // Fall back to mention-timestamp distance.
+    if (Number.isNaN(mention))
+        return 0;
+    const dist = Math.abs(queryMs - mention);
+    return 1.0 / (1 + dist / DAY_MS);
+}
+//# sourceMappingURL=TemporalIntervalOverlap.js.map

package/dist/memory/retrieval/typed-network/TemporalIntervalOverlap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TemporalIntervalOverlap.js","sourceRoot":"","sources":["../../../../src/memory/retrieval/typed-network/TemporalIntervalOverlap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,iFAAiF;AACjF,MAAM,MAAM,GAAG,QAAU,CAAC;AAE1B;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAkB,EAClB,cAAsB;IAEtB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC3C,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;IAE7C,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,IAAI,EAAE,CAAC;QACP,KAAK,EAAE,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC;KAChC,CAAC,CAAC,CAAC;IACJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,YAAY,CAAC,IAAe,EAAE,OAAe;IACpD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC1E,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACpE,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAElD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,IAAI,OAAO,IAAI,KAAK,IAAI,OAAO,IAAI,GAAG,EAAE,CAAC;YACvC,2DAA2D;YAC3D,4DAA4D;YAC5D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC;YACvC,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC;QAC1C,CAAC;QACD,4DAA4D;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;QAC1E,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,2CAA2C;IAC3C,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC;AACnC,CAAC"}

package/dist/memory/retrieval/typed-network/TypedNetworkObserver.d.ts

@@ -0,0 +1,67 @@
+/**
+ * @file TypedNetworkObserver.ts
+ * @description LLM-driven extractor that turns a conversation block
+ * into 0+ {@link TypedFact}s. Wraps the 6-step extraction prompt and
+ * the zod-validated parsing of the LLM's structured-output response.
+ *
+ * Production wiring: a typical caller constructs the observer once per
+ * pipeline (re-using the same `gpt-5-mini` adapter), then invokes
+ * {@link TypedNetworkObserver.extract} per session. The returned facts
+ * are then upserted into a {@link TypedNetworkStore} and embedded by
+ * the host's {@link IEmbeddingManager}.
+ *
+ * @module @framers/agentos/memory/retrieval/typed-network/TypedNetworkObserver
+ */
+import type { TypedFact } from './types.js';
+/**
+ * Provider-agnostic LLM interface for the extractor. Matches the
+ * shape used elsewhere in agentos for classifier / observer LLM
+ * adapters: a single `invoke(args)` async method returning the raw
+ * text response. Implementations wrap OpenAI, Anthropic, local
+ * models, or test mocks.
+ */
+export interface ITypedExtractionLLM {
+    invoke(args: {
+        system: string;
+        user: string;
+        maxTokens: number;
+        temperature: number;
+    }): Promise<string>;
+}
+/**
+ * Construction options for the observer.
+ */
+export interface TypedNetworkObserverOptions {
+    /** LLM adapter implementing the 6-step extraction call. */
+    llm: ITypedExtractionLLM;
+    /** Max output tokens. Default 4096 (Hindsight extractions are typically 50-200 facts × ~30 tokens each). */
+    maxTokens?: number;
+    /** Temperature. Default 0 for deterministic extraction. */
+    temperature?: number;
+}
+/**
+ * The 6-step extractor. Stateless aside from its constructor options;
+ * safe to share across concurrent extractions.
+ */
+export declare class TypedNetworkObserver {
+    private readonly llm;
+    private readonly maxTokens;
+    private readonly temperature;
+    constructor(options: TypedNetworkObserverOptions);
+    /**
+     * Extract typed facts from a conversation block. Uses the 6-step
+     * prompt + zod-validated parsing. The resulting facts have stable
+     * IDs of the form `<sessionId>-fact-<index>` so re-extraction
+     * against the same content reproduces the same IDs.
+     *
+     * @param sessionText - Full conversation text. Will be wrapped in
+     *   the user prompt's delimiters automatically.
+     * @param sessionId - Stable identifier used to namespace the
+     *   resulting fact IDs.
+     * @returns Array of {@link TypedFact}s, possibly empty.
+     * @throws ZodError if the LLM output fails schema validation.
+     * @throws SyntaxError if the LLM output is not valid JSON.
+     */
+    extract(sessionText: string, sessionId: string): Promise<TypedFact[]>;
+}
+//# sourceMappingURL=TypedNetworkObserver.d.ts.map

package/dist/memory/retrieval/typed-network/TypedNetworkObserver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TypedNetworkObserver.d.ts","sourceRoot":"","sources":["../../../../src/memory/retrieval/typed-network/TypedNetworkObserver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAOH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,MAAM,CAAC,IAAI,EAAE;QACX,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,MAAM,CAAC;KACrB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,2BAA2B;IAC1C,2DAA2D;IAC3D,GAAG,EAAE,mBAAmB,CAAC;IACzB,4GAA4G;IAC5G,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2DAA2D;IAC3D,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;GAGG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAsB;IAC1C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;gBAEzB,OAAO,EAAE,2BAA2B;IAMhD;;;;;;;;;;;;;OAaG;IACG,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;CAwB5E"}