infinitydb 1.0.0 → 1.4.0

package/LICENSE

@@ -1,119 +1,119 @@
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work.
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      shall any Contributor be liable to You for damages, including any
-      direct, indirect, special, incidental, or exemplary damages of any
-      character arising as a result of this License or out of the use or
-      inability to use the Work.
-
-   END OF TERMS AND CONDITIONS
-
-   Copyright (c) 2026 InfinityDB AI Contributors
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work.
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      shall any Contributor be liable to You for damages, including any
+      direct, indirect, special, incidental, or exemplary damages of any
+      character arising as a result of this License or out of the use or
+      inability to use the Work.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright (c) 2026 InfinityDB AI Contributors
 

package/README.md

@@ -1,137 +1,186 @@
-# InfinityDB
-
-> High-Performance Neurosymbolic Agent Memory Engine for JavaScript and TypeScript.
-
-[![NPM Version](https://img.shields.io/npm/v/infinitydb?color=blue)](https://www.npmjs.com/package/infinitydb)
-[![License: Apache 2.0](https://img.shields.io/badge/License-Apache_2.0-blue.svg)](https://opensource.org/licenses/Apache-2.0)
-[![TypeScript](https://img.shields.io/badge/TypeScript-Ready-3178C6?logo=typescript&logoColor=white)](https://www.typescriptlang.org/)
-
-InfinityDB gives AI agents long-term neurosymbolic memory with deterministic recall, sub-millisecond latency, dynamic persona conflict resolution, and cryptographic SHA-256 audit proofs.
-
----
-
-## Installation
-
-```bash
-npm install infinitydb
-```
-
-```bash
-yarn add infinitydb
-# or
-pnpm add infinitydb
-```
-
----
-
-## Quick Start
-
-### 1. Ingestion and Causal Recall
-
-```javascript
-const { InfinityDB } = require("infinitydb");
-// Or in TypeScript:
-// import { InfinityDB } from "infinitydb";
-
-const db = new InfinityDB();
-
-// Ingest agent dialogue / user interactions (L0 Log -> L1 Atomic Facts -> L2 Episode Graph)
-const logId = db.add(
-  "Sarah prefers TypeScript over JavaScript because of strict static typing. Her project budget is $15,000.",
-  "usr_sarah"
-);
-
-// Recall relevant memory with causal facts, policy checks, and proof chains
-const memory = db.recall("what language does Sarah prefer?", { userId: "usr_sarah" });
-
-console.log("Latency:", memory.latencyMs, "ms");
-console.log("Recalled Facts:", memory.results);
-console.log("Causal Graph:", memory.causalGraph);
-```
-
-### 2. Dynamic Persona & Automatic Conflict Resolution
-
-```javascript
-// Initial preference
-db.add("I prefer TypeScript for backend APIs", "usr_sarah");
-console.log(db.getPersona("usr_sarah")); 
-// => { preference: ["TypeScript for backend APIs"] }
-
-// User changes their mind later:
-db.add("I now prefer Rust for mission-critical core engines", "usr_sarah");
-
-// Conflicting older preference is automatically reconciled
-console.log(db.getPersona("usr_sarah"));
-// => { preference: ["Rust for mission-critical core engines"] }
-```
-
-### 3. Cryptographic Audit Proofs (SHA-256 Chain)
-
-Every atomic fact is hashed and anchored into an immutable tamper-evident proof chain:
-
-```javascript
-const atomId = memory.results[0].id;
-const proof = db.getProof(atomId);
-
-console.log(proof);
-// {
-//   atomId: "ATOM_...",
-//   hash: "a4f8c2...",
-//   verified: true,
-//   timestamp: 1729100000000
-// }
-```
-
-### 4. Enterprise Policies & Guardrails
-
-```javascript
-// Register policies that automatically govern recalls
-db.addPolicy("Never log plaintext passwords or API keys", "security", 2.0);
-
-const recall = db.recall("database credentials", { userId: "usr_sarah" });
-console.log(recall.policies); // Injected active governance policies
-```
-
-### 5. GDPR Right-to-be-Forgotten Compliance
-
-```javascript
-// Instantly and irreversibly wipe all user logs, facts, and persona state
-const result = db.deleteUser("usr_sarah");
-console.log(result.gdprCompliant); // true
-```
-
-### 6. Backwards-Compatible Key-Value Store
-
-```javascript
-db.put("session:123", "active");
-const val = db.get("session:123");
-db.delete("session:123");
-```
-
----
-
-## Architecture (L0 – L6 Brain)
-
-| Layer | Component | Function |
-| :--- | :--- | :--- |
-| **L0** | Raw Interaction Store | Append-only raw logs with sub-millisecond writes |
-| **L1** | Atomic Fact Extractor | Deterministic, zero-hallucination semantic extraction |
-| **L2** | Episodic Graph | Causal edge tracking between related memory episodes |
-| **L3** | Dynamic Persona | Identity state with automatic chronological conflict resolution |
-| **L4** | Enterprise Policy Engine | Real-time policy and compliance injection |
-| **L5** | Ebbinghaus Decay | Recency and frequency weighted memory decay |
-| **L6** | SHA-256 Proof Chain | Cryptographically verifiable audit trail |
-
----
-
-## TypeScript Support
-
-InfinityDB includes full type definitions out of the box (`index.d.ts`). No `@types/infinitydb` required.
-
----
-
-## Links
-
-- **Documentation & Benchmarks**: [https://github.com/infinitydb-ai/infinitydb](https://github.com/infinitydb-ai/infinitydb)
-- **Python Package (PyPI)**: [`pip install infinitydb-ai`](https://pypi.org/project/infinitydb-ai/)
-- **License**: Apache 2.0
+# InfinityDB
+
+> High-Performance Neurosymbolic Agent Memory Engine for JavaScript and TypeScript.
+
+[![NPM Version](https://img.shields.io/npm/v/infinitydb?color=blue)](https://www.npmjs.com/package/infinitydb)
+[![License: Apache 2.0](https://img.shields.io/badge/License-Apache_2.0-blue.svg)](https://opensource.org/licenses/Apache-2.0)
+[![TypeScript](https://img.shields.io/badge/TypeScript-Ready-3178C6?logo=typescript&logoColor=white)](https://www.typescriptlang.org/)
+
+InfinityDB gives AI agents long-term neurosymbolic memory with deterministic recall, dynamic persona conflict resolution, and cryptographic SHA-256 audit proofs. Recall and write latency depend on dataset size, hardware, storage configuration, and workload.
+
+---
+
+## Installation
+
+```bash
+npm install infinitydb
+```
+
+```bash
+yarn add infinitydb
+# or
+pnpm add infinitydb
+```
+
+---
+
+## Quick Start
+
+### 1. Ingestion and Causal Recall
+
+```javascript
+const { InfinityDB } = require("infinitydb");
+// Or in TypeScript:
+// import { InfinityDB } from "infinitydb";
+
+const db = new InfinityDB();
+
+// Ingest agent dialogue / user interactions (L0 Log -> L1 Atomic Facts -> L2 Episode Graph)
+const logId = db.add(
+  "Sarah prefers TypeScript over JavaScript because of strict static typing. Her project budget is $15,000.",
+  "usr_sarah"
+);
+
+// Recall relevant memory with causal facts, policy checks, and proof chains
+const memory = db.recall("what language does Sarah prefer?", { userId: "usr_sarah" });
+
+console.log("Latency:", memory.latencyMs, "ms");
+console.log("Recalled Facts:", memory.results);
+console.log("Causal Graph:", memory.causalGraph);
+```
+
+### 2. Dynamic Persona & Automatic Conflict Resolution
+
+```javascript
+// Initial preference
+db.add("I prefer TypeScript for backend APIs", "usr_sarah");
+console.log(db.getPersona("usr_sarah")); 
+// => { preference: ["TypeScript for backend APIs"] }
+
+// User changes their mind later:
+db.add("I now prefer Rust for mission-critical core engines", "usr_sarah");
+
+// Conflicting older preference is automatically reconciled
+console.log(db.getPersona("usr_sarah"));
+// => { preference: ["Rust for mission-critical core engines"] }
+```
+
+### 3. Explicit temporal supersession and historical recall
+
+When a user explicitly replaces a fact, preserve the original fact and its provenance while marking the newer fact as its successor:
+
+```javascript
+const oldLog = db.add("I prefer Python for data work.", "usr_sarah");
+const oldFact = Array.from(db.atoms.values()).find(a => a.sourceId === oldLog);
+const cutoff = oldFact.ts + 0.001;
+
+const newLog = db.add("I prefer Rust for systems work.", "usr_sarah");
+const newFact = Array.from(db.atoms.values()).find(a => a.sourceId === newLog);
+
+db.supersedeFact(oldFact.id, newFact.id, "usr_sarah");
+
+// Current recall returns the active fact; historical recall can still see the old one.
+db.recall("Python", { userId: "usr_sarah" }).results; // []
+db.recall("Python", { userId: "usr_sarah", asOf: cutoff }).results;
+```
+
+Supersession is explicit; the SDK does not infer semantic contradictions. Both facts and their proof records remain stored. Relations are tenant-scoped and cycle-checked. SQLite mode persists relations across reopen.
+
+### 4. Cryptographic Audit Proofs (SHA-256 Chain)
+
+Every atomic fact is hashed and anchored into an immutable tamper-evident proof chain:
+
+```javascript
+const atomId = memory.results[0].id;
+const proof = db.getProof(atomId);
+
+console.log(proof);
+// {
+//   atomId: "ATOM_...",
+//   hash: "a4f8c2...",
+//   verified: true,
+//   timestamp: 1729100000000
+// }
+```
+
+### 5. Enterprise Policies & Guardrails
+
+```javascript
+// Register a global policy or a tenant-scoped policy
+db.addPolicy("Never log plaintext passwords or API keys", "security", 2.0);
+db.addPolicy("Tenant-specific retention rule", "retention", 1.5, "usr_sarah");
+
+const recall = db.recall("database credentials", { userId: "usr_sarah" });
+console.log(recall.policies); // Global + usr_sarah policies only
+```
+
+### 6. Tenant data deletion
+
+```javascript
+// Remove this tenant’s stored logs, facts, episodes, and persona state
+const result = db.deleteUser("usr_sarah");
+console.log(result); // Per-layer deletion counts
+```
+
+This API reports database deletion results only; it does not certify legal or regulatory compliance.
+
+### 7. Backwards-Compatible Key-Value Store
+
+```javascript
+db.put("session:123", "active");
+const val = db.get("session:123");
+db.delete("session:123");
+```
+
+
+### 8. Durable SQLite storage (Node.js)
+
+Install the package dependencies, then provide a database path to enable durable storage:
+
+```javascript
+const { InfinityDB } = require("infinitydb");
+const db = new InfinityDB({ dbPath: "./data/infinitydb.sqlite" });
+
+db.add("I prefer SQLite for durable memory.", "user_123");
+console.log(db.recall("SQLite", { userId: "user_123" }).results);
+
+// Close cleanly before process shutdown. Reopen with the same dbPath to recover state.
+db.close();
+```
+
+When `dbPath` is omitted, the SDK remains in-memory for backwards compatibility.
+The SQLite-backed mode uses WAL, FULL synchronous commits, a busy timeout, and normalized
+L0/L1/L2/L3/L4/L6 tables with transactional row upserts. Existing v1 JSON-snapshot databases
+are migrated transactionally to schema v2 on first open. SDK instances refresh their view
+from SQLite before public reads and mutations, and sequence allocation is serialized by a
+SQLite write transaction. This is not yet a guarantee of serializable concurrent read-modify-write
+operations across processes; use a single writer until that coordination layer is added.
+Back up the database using SQLite's backup facilities.
+
+---
+
+## Architecture (L0 – L6 Brain)
+
+| Layer | Component | Function |
+| :--- | :--- | :--- |
+| **L0** | Raw Interaction Store | Append-only raw interaction logs |
+| **L1** | Atomic Fact Extractor | Deterministic, zero-hallucination semantic extraction |
+| **L2** | Episodic Graph | Causal edge tracking between related memory episodes |
+| **L3** | Dynamic Persona | Identity state with automatic chronological conflict resolution |
+| **L4** | Enterprise Policy Engine | Real-time policy and compliance injection |
+| **L5** | Ebbinghaus Decay | Recency and frequency weighted memory decay |
+| **L6** | SHA-256 Proof Chain | Cryptographically verifiable audit trail |
+
+---
+
+## TypeScript Support
+
+InfinityDB includes full type definitions out of the box (`index.d.ts`). No `@types/infinitydb` required.
+
+---
+
+## Links
+
+- **Documentation & Benchmarks**: [https://github.com/infinitydb-ai/infinitydb](https://github.com/infinitydb-ai/infinitydb)
+- **Python Package (PyPI)**: [`pip install infinitydb-ai`](https://pypi.org/project/infinitydb-ai/)
+- **License**: Apache 2.0

package/index.d.ts

@@ -1,43 +1,45 @@
-export interface MemoryResult {
-  id: string;
-  fact: string;
-  category: string;
-  sourceId: string;
-  score: number;
-  retention: number;
-  ts: number;
-}
-
-export interface RecallResponse {
-  results: MemoryResult[];
-  causalGraph: Array<{ cause: string; effect: string; relation: string }>;
-  policies: Array<{ id: string; rule: string; domain: string; priority: number }>;
-  latencyMs: number;
-  tokensSaved: string;
-  proofAvailable: boolean;
-}
-
-export interface ProofResponse {
-  atomId: string;
-  hash: string;
-  sourceLogId: string;
-  rawSnippet: string;
-  charRange: [number, number];
-  verified: boolean;
-  timestamp: number;
-}
-
-export class InfinityDB {
-  constructor(options?: Record<string, any>);
-  add(conversation: string, userId?: string, sessionId?: string | null, importance?: number): string;
-  recall(query: string, options?: { n?: number; userId?: string | null }): RecallResponse;
-  getProof(atomId: string): ProofResponse | null;
-  getPersona(userId?: string): Record<string, string>;
-  addPolicy(rule: string, domain?: string, priority?: number): string;
-  exportGraph(userId?: string): string;
-  deleteUser(userId: string): Record<string, any>;
-  stats(): Record<string, any>;
-  put(key: string, content: string): { key: string; content: string; createdAt: string };
-  get(key: string): { key: string; content: string; createdAt: string } | null;
-  delete(key: string): boolean;
-}
+export interface MemoryResult {
+  id: string;
+  fact: string;
+  category: string;
+  sourceId: string;
+  score: number;
+  retention: number;
+  ts: number;
+}
+
+export interface RecallResponse {
+  results: MemoryResult[];
+  causalGraph: Array<{ cause: string; effect: string; relation: string }>;
+  policies: Array<{ id: string; rule: string; domain: string; priority: number }>;
+  latencyMs: number;
+  tokensSaved: string | null;
+  proofAvailable: boolean;
+}
+
+export interface ProofResponse {
+  atomId: string;
+  hash: string;
+  sourceLogId: string;
+  rawSnippet: string;
+  charRange: [number, number];
+  verified: boolean;
+  timestamp: number;
+}
+
+export class InfinityDB {
+  constructor(options?: { dbPath?: string } & Record<string, any>);
+  add(conversation: string, userId?: string, sessionId?: string | null, importance?: number): string;
+  recall(query: string, options?: { n?: number; userId?: string | null; asOf?: number }): RecallResponse;
+  supersedeFact(oldAtomId: string, newAtomId: string, userId: string): string;
+  getProof(atomId: string): ProofResponse | null;
+  getPersona(userId?: string): Record<string, string>;
+  addPolicy(rule: string, domain?: string, priority?: number, tenantId?: string | null): string;
+  exportGraph(userId?: string): string;
+  deleteUser(userId: string): Record<string, any>;
+  stats(): Record<string, any>;
+  close(): void;
+  put(key: string, content: string): { key: string; content: string; createdAt: string };
+  get(key: string): { key: string; content: string; createdAt: string } | null;
+  delete(key: string): boolean;
+}