@areev/areev 1.0.0

package/LICENSE-APACHE

@@ -0,0 +1,202 @@
+
+                                 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
+      (an example is provided in the Appendix below).
+
+      "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. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   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. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   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,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; 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, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   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.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   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. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/LICENSE-MIT

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 MindGryd Software Private Limited
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,55 @@
+# areev-js
+
+Node.js (napi-rs) bindings for Areev, the embedded memory engine for AI agents.
+
+`areev-js` is the napi-rs native addon that exposes Areev to Node.js as the
+`areev` package. It mirrors the Python binding with the same thin,
+version-stable FFI convention: scalar arguments in, JSON strings out for
+anything structured, and errors thrown as JavaScript `Error`s. Because the
+underlying engine is native, this is a compiled Node addon rather than WASM. One
+memory is one file, opened with a namespace, giving JavaScript agents durable
+add / recall / supersede / forget over content-addressed memory.
+
+```js
+const { Areev } = require('areev')
+
+const mem = new Areev('caller.db', 'caller') // 3rd arg: passphrase for AES-256 at rest
+const h = await mem.addFact('john', 'prefers', 'tea', 0.95)
+console.log(await mem.recall('john')) // JSON string, newest-first
+
+await mem.setEmbedderCommand('python3 embed.py')   // vector recall via a host command
+await mem.migrate('mem0', exportJson, historyJson) // import from mem0/Zep/Letta/… (docs/migrate.md)
+await mem.memoryTool('{"command": "view", "path": "/memories"}') // Anthropic memory-tool backend
+```
+
+## Every method returns a promise
+
+Store calls run on libuv's thread pool, not on the thread running your
+application. They used to run inline: a single `migrate` or `importBundle` held
+the event loop for its whole duration, so timers, sockets and any HTTP server in
+the same process stopped until it finished. Measured on a 400-record `migrate`,
+a 5 ms timer now fires **263 times** during the call; before, it could not fire
+at all.
+
+Two things follow, and the second is the one that bites:
+
+- **The constructor stays synchronous.** Opening a file should fail loudly, at
+  the line that opened it.
+- **Await your writes.** Promises settle in completion order, not call order,
+  and concurrent calls contend for one lock inside the store. This is a race:
+
+  ```js
+  mem.addFact('john', 'prefers', 'tea')  // not awaited
+  const rows = await mem.recall('john')  // may or may not see it
+  ```
+
+  Awaiting the write fixes it. If you want several independent writes to
+  overlap, `Promise.all` them and await the group.
+
+Errors arrive as rejections, so `try`/`catch` around `await`, or `.catch()`.
+An un-awaited call that fails becomes an unhandled rejection, which recent Node
+versions treat as fatal.
+
+Part of [Areev](https://github.com/AreevAI/areev) — an embedded memory engine for AI agents. See the [architecture overview](https://github.com/AreevAI/areev/blob/main/ARCHITECTURE.md).
+
+Licensed under MIT OR Apache-2.0.

package/index.d.ts

@@ -0,0 +1,372 @@
+/* auto-generated by NAPI-RS */
+/* eslint-disable */
+export declare class Areev {
+  constructor(path: string, ns?: string | undefined | null, passphrase?: string | undefined | null, actor?: string | undefined | null, telemetry?: string | undefined | null, principal?: string | undefined | null, indexText?: boolean | undefined | null)
+  /**
+   * Release this handle's claim on the memory file.
+   *
+   * One memory is one writer: a second handle on the same file is refused at
+   * open. Rust and Python release on drop, but Node's is whenever GC runs —
+   * so without this there is no way to say "I am done with this file" and
+   * reopen it in the same process. Calling a method afterwards is an error,
+   * not a silent reopen. Idempotent; in-flight async calls finish first.
+   */
+  close(): void
+  /**
+   * Reconciliation warnings from open (file-vs-host declaration changes,
+   * embedding-model mismatches). JSON list string.
+   */
+  openWarnings(): Promise<string>
+  /**
+   * Set the host-scoped run identifier copied into subsequent recall
+   * telemetry. Pass null to clear it; it is never a file truth.
+   */
+  setRunId(runId?: string | undefined | null): void
+  /**
+   * Install a command embedder (same contract as the CLI's --embed-cmd):
+   * the command gets the text on stdin and must print a JSON array of
+   * numbers. Probed once here to learn the dimension. Enables the vector
+   * recall leg; grains added afterwards are embedded. (For an
+   * in-process callback embedder, see `setEmbedder`; the command
+   * embedder remains the zero-dependency path.)
+   */
+  setEmbedderCommand(cmd: string, model?: string | undefined | null): Promise<void>
+  /**
+   * Install an embedding callback: `embed(text: string): number[]` —
+   * the JS mirror of Python's `set_embedder`. Probed once here (on the
+   * JS thread) to learn the dimension, recorded as the file's embedding
+   * provenance; store-side embeds run on worker threads and call back
+   * through a threadsafe function.
+   */
+  setEmbedder(embed: (arg: string) => Array<number>, model?: string | undefined | null): void
+  /**
+   * Batch-add grains in ONE write transaction — the JS mirror of
+   * Python's `add_batch`. `grainsJson` is a JSON array of
+   * `{grain_type|type, fields}` objects; returns a JSON array of
+   * hashes. Worth ~1.6x over one-at-a-time `add()`, and only with the
+   * BM25 text index off (with it on, per-row index cost swamps
+   * batching).
+   */
+  addBatch(grainsJson: string, ns?: string | undefined | null): Promise<string>
+  /**
+   * Free-text recall over the BM25 (and vector, when an embedder is
+   * installed) legs — the JS mirror of Python's `search`, the same path
+   * as `areev search` and CAL's `RECALL … ABOUT`. Returns a JSON list
+   * string shaped like `recall()`. Errors loudly when the file has
+   * neither leg, instead of a silent empty list.
+   */
+  search(query: string, subject?: string | undefined | null, relation?: string | undefined | null, k?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * Backfill + rebuild the BM25 text index (e.g. after bulk loads, or on
+   * a file that flipped text indexing on later). Returns rows backfilled.
+   */
+  reindexText(): Promise<number>
+  /**
+   * Rebuild the link indexes: reverse provenance, run correlation, and
+   * `related_to` cross-links. Returns index rows written.
+   *
+   * `open()` heals a file that predates these indexes, so this is for
+   * rebuilding on demand — the counterpart of `reindexText()`, and what
+   * `areev reindex` runs.
+   */
+  reindexLinks(): Promise<number>
+  /**
+   * Anthropic memory-tool command (view/create/str_replace/insert/delete/
+   * rename over /memories): pass the tool-call object as JSON; returns the
+   * tool result text. Wire this as your memory-tool backend.
+   */
+  memoryTool(commandJson: string, ns?: string | undefined | null): Promise<string>
+  /**
+   * Import another memory system's export. `source`: mem0 | mem0-history |
+   * langgraph | letta | letta-archival | zep | jsonl. `payload` is the
+   * export file's contents; `history` the optional mem0 history payload.
+   * (basic-memory vault directories import via the CLI: `areev migrate`.)
+   * Returns {added, superseded, forgotten, skipped, notes} as JSON.
+   * Re-runs skip what is already imported.
+   */
+  migrate(source: string, payload: string, history?: string | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * Add a Fact. Returns the content address (64-hex).
+   * Add a Fact. With `idempotent = true`, a re-add of the value already at
+   * the `(subject, relation)` head writes nothing and returns the existing
+   * hash (value-level dedup, not just byte-identical replay).
+   */
+  addFact(subject: string, relation: string, object: string, confidence?: number | undefined | null, ns?: string | undefined | null, idempotent?: boolean | undefined | null): Promise<string>
+  /** Add any grain type from a JSON fields object. Returns the hash. */
+  add(grainType: string, fieldsJson: string, ns?: string | undefined | null): Promise<string>
+  /** Structural recall, newest-first. Returns a JSON list string. */
+  recall(subject: string, relation?: string | undefined | null, k?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /** Current head for (subject, relation) — JSON string or null. */
+  latest(subject: string, relation: string, ns?: string | undefined | null): Promise<string | null>
+  /** Supersede old_hash with a new version (append-only evolution). */
+  supersede(oldHash: string, grainType: string, fieldsJson: string, ns?: string | undefined | null): Promise<string>
+  /**
+   * Erase a grain from the hot store (tombstoned). Host-level op.
+   * Routed through the facade so it carries the same `delete` check and
+   * Tier-2 audit record as CAL's `FORGET <hash>`.
+   */
+  forget(hash: string): Promise<void>
+  /**
+   * Right-to-erasure for one identity: erase every grain holding a
+   * STRUCTURED reference to `subject` in the session namespace (or `ns`) —
+   * the full supersession history, grains referencing it in object
+   * position, its thread events, its dictionary entry, and erased-only
+   * vocabulary — with replicating tombstones. Resolves to the erasure
+   * report as JSON (counts only, no identity material). Host-level
+   * destructive op: gate it like your other compliance endpoints. See
+   * docs/erasure.md for the scope contract.
+   * Identity matching always covers partition-style keys (`pat`,
+   * `pat#visit1` — never `patricia`); pass `textMentions=true` to ALSO
+   * erase grains whose indexed text mentions the identity's tokens
+   * (search symmetry — opt-in because token matching over-reaches for
+   * common-word identifiers).
+   */
+  forgetSubject(subject: string, ns?: string | undefined | null, textMentions?: boolean | undefined | null): Promise<string>
+  /**
+   * DSAR read (GDPR Art. 15/20): everything `forgetSubject` WOULD erase
+   * for one identity — exact + partition keys, full history — as
+   * `{"identity_names": [...], "grains": [{hash, type, fields}, ...]}`.
+   * The same selector as erasure, in show-me mode.
+   */
+  subjectReport(subject: string, ns?: string | undefined | null, textMentions?: boolean | undefined | null): Promise<string>
+  /**
+   * Export the subject selection as a portable MGB1 bundle (GDPR Art. 20
+   * portability) — importable into any OMS store. Resolves to the bundle
+   * stats JSON.
+   */
+  subjectBundle(path: string, subject: string, ns?: string | undefined | null, textMentions?: boolean | undefined | null): Promise<string>
+  /**
+   * Retention sweep: erase every grain with `created_at` older than
+   * `cutoffMs` (epoch milliseconds), optionally limited to one grain type
+   * (e.g. "event") and scoped to the session namespace (or `ns`; pass
+   * ns="" to sweep every namespace). Resolves to the report JSON.
+   */
+  forgetOlderThan(cutoffMs: number, ns?: string | undefined | null, grainType?: string | undefined | null): Promise<string>
+  /**
+   * remember(): store content as an Event, then attach the facts
+   * distilled from it. Three routes to those facts, in precedence order:
+   * `factsJson` (pre-extracted by the host — a JSON list of
+   * {subject, relation, object, confidence}), `llmCmd` (a subprocess
+   * backend), or `model` ("openai:gpt-4o-mini", key from the env).
+   *
+   * The raw text is written before the model is called, so a failed
+   * extraction never costs the raw text — the error names the hash it was
+   * stored under. Model-extracted facts are stamped
+   * `verification_status="unverified"` unless `groundModel`/`groundCmd`
+   * runs a separate entailment pass (proposer ≠ scorer); facts it does not
+   * support are dropped and survivors are stamped `"verified"`.
+   *
+   * The raw text is stored as an **Event** grain (a transcript turn) —
+   * pass `sessionId`/`role` to place it in a conversation thread.
+   *
+   * Returns {"event", "facts"} JSON, plus {"model", "proposed",
+   * "dropped", "verification_status"} when a model ran.
+   */
+  remember(content: string, factsJson?: string | undefined | null, observer?: string | undefined | null, ns?: string | undefined | null, model?: string | undefined | null, llmCmd?: string | undefined | null, groundModel?: string | undefined | null, groundCmd?: string | undefined | null, extractHint?: string | undefined | null, minConfidence?: number | undefined | null, sessionId?: string | undefined | null, role?: string | undefined | null, runId?: string | undefined | null): Promise<string>
+  /**
+   * Execute CAL. Returns the wire-format payload as a JSON string.
+   * Non-fatal `CAL-Wnnn` warnings ride along under a `warnings` key
+   * (absent when the query raised none).
+   */
+  cal(query: string): Promise<string>
+  /** Supersession-chain history for (subject, relation), newest first. */
+  history(subject: string, relation: string, ns?: string | undefined | null): Promise<string>
+  /**
+   * Reverse provenance: grains distilled from `sourceHash` (their
+   * `derived_from`), newest first, as a JSON list string.
+   */
+  provenance(sourceHash: string): Promise<string>
+  /**
+   * Advise-mode novelty check: nearest existing grains to `text`, optionally
+   * scoped to (subject, relation), as a JSON list of {hash, similarity},
+   * most similar first. Requires an installed embedder; never writes.
+   */
+  nearest(text: string, subject?: string | undefined | null, relation?: string | undefined | null, k?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /** Store statistics as JSON. */
+  stats(): Promise<string>
+  /** Incremental backup to a bundle file. Returns last_op_seq cursor. */
+  bundle(path: string, since?: number | undefined | null): Promise<number>
+  /** Apply a bundle (fast-forward, idempotent). Returns ops applied. */
+  importBundle(path: string): Promise<number>
+  /** Integrity + content-address verification. Throws on failure. */
+  verify(): Promise<string>
+  /**
+   * Bounded k-hop walk over the entity graph.
+   *
+   * `relations` is comma-separated. `direction` is out|in|both — in/both use
+   * the reverse index, which only covers relations the file declares
+   * entity-valued, so they find nothing for relations outside that set.
+   *
+   * Argument validation happens inside the task so a bad `direction` or an
+   * empty relation list *rejects* the promise, matching every other method
+   * here — throwing synchronously would contradict the `Promise<string>`
+   * signature napi generates.
+   */
+  related(start: string, relations: string, direction?: string | undefined | null, depth?: number | undefined | null, limit?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * As-of read on two axes: `world` = what was true at `at`,
+   * `knowledge` = what the agent knew at `at`. `at` is epoch milliseconds.
+   */
+  entityAt(subject: string, relation: string, at: number, axis?: string | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * What a run recorded, and what it produced downstream.
+   *
+   * Returns `{run_id, trace, produced}` — `trace` is the run's own grains,
+   * `produced` is what was derived from them and is not itself part of the
+   * run. This is the query that crosses from execution history into
+   * semantic memory.
+   */
+  runTrace(runId: string, limit?: number | undefined | null, includeYield?: boolean | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * One page of a run's grains, **oldest first**, from an exclusive
+   * `afterSeq` cursor — the complete journal read (`runTrace` clamps at
+   * 1024 with no cursor). Returns `{run_id, entries: [{seq, grain}...],
+   * next_after_seq}`; `next_after_seq` is null when exhausted.
+   */
+  runGrains(runId: string, afterSeq?: number | undefined | null, limit?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * Vector-in nearest-neighbour search: cosine top-k against a
+   * caller-supplied query vector — no embedder needed. Same
+   * `[{hash, similarity}]` shape as `nearest()`; dimension is checked
+   * against the file's declared embedding provenance.
+   */
+  nearestVector(vector: Array<number>, subject?: string | undefined | null, relation?: string | undefined | null, k?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * Install or replace the indexed embedding for a stored grain — the
+   * write half of the external-embedding seam. The vector never enters the
+   * grain blob, so the hash is unchanged. Bundles carry blobs, not index
+   * rows: replicas must have vectors re-supplied.
+   */
+  addEmbedding(hash: string, vector: Array<number>): Promise<string>
+  /**
+   * The file's declared embedding provenance as `{model, dim}` JSON, or
+   * `null` when the file has never seen a vector.
+   */
+  declaredEmbedding(): Promise<string>
+  /**
+   * Which runs produced or refined this grain — the reverse join.
+   *
+   * Runs that merely *read* the grain are not recorded: a read leaves no
+   * grain behind, so nothing in an append-only store can attest to it.
+   */
+  runsTouching(hash: string, depth?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * Execution records for a workflow: which grains ran which of its nodes.
+   *
+   * A Workflow grain is immutable, so runs point at the plan rather than
+   * mutating it — retries show up as several records for one node.
+   */
+  stepActions(workflow: string, node?: string | undefined | null, limit?: number | undefined | null, ns?: string | undefined | null): Promise<string>
+  /**
+   * Record a tool call as a Tool grain — the flagship analyzer's food.
+   *
+   * `callId` is the invocation's own id (the provider's `tool_call_id`),
+   * stored on the grain and queryable — the correlation key back to the LLM
+   * transcript. Omitted, one is synthesized. Either way each call is its own
+   * occurrence, which is what makes a tool that failed five times read as
+   * five failures; recording is append-only, never de-duplicating.
+   * Wave-0 extension mirrored from Python: `runId` correlates to a run,
+   * `workflowHash` + `nodeId` (both or neither) write the `mg:step_action`
+   * link, and `status`/`failureCause`/`executorKind`/`correlationId` carry
+   * the async lifecycle with strict enum validation.
+   */
+  recordToolCall(name: string, result: string, isError?: boolean | undefined | null, thread?: string | undefined | null, callId?: string | undefined | null, input?: string | undefined | null, runId?: string | undefined | null, workflowHash?: string | undefined | null, nodeId?: string | undefined | null, status?: string | undefined | null, failureCause?: string | undefined | null, executorKind?: string | undefined | null, correlationId?: string | undefined | null): Promise<string>
+  /** Persist a content-addressed harness config and the run -> config link. */
+  recordRunManifest(runId: string, config: string): Promise<string>
+  /**
+   * Run one analysis pass. Bare it never gates. `fullSweep` re-analyzes
+   * the whole memory (`areev loop reflect` semantics); `policy` is a path
+   * to a host `loop-policy.json` — the only way auto-apply is granted
+   * from the bindings. Returns run-outcome JSON.
+   */
+  loopRun(minNew?: number | undefined | null, minNewErrors?: number | undefined | null, ifStale?: string | undefined | null, model?: string | undefined | null, llmCmd?: string | undefined | null, groundModel?: string | undefined | null, groundCmd?: string | undefined | null, analyzerCmd?: string | undefined | null, fullSweep?: boolean | undefined | null, policy?: string | undefined | null): Promise<string>
+  /**
+   * List recommendations. `filter` is optional JSON, e.g. `{"status":
+   * "pending"}`; `{"status":"all"}` clears the filter. JSON list.
+   */
+  recommendations(filter?: string | undefined | null): Promise<string>
+  /**
+   * Approve and apply a recommendation in one audited step (§6.6). The
+   * `because` reason is mandatory. A refused apply leaves the recommendation
+   * **pending**, so it can still be dismissed.
+   *
+   * `scopes` is a comma-separated subset of `read,write,review,apply,admin`;
+   * omit it for all scopes.
+   */
+  applyRecommendation(hash: string, because: string, allowDestructive?: boolean | undefined | null, scopes?: string | undefined | null): Promise<string>
+  /**
+   * Approve a recommendation **without** applying it — the two-person flow
+   * the CLI's separate `approve` verb enables, so a supervising agent can
+   * approve for a human to apply later.
+   */
+  approveRecommendation(hash: string, because: string, scopes?: string | undefined | null): Promise<string>
+  /**
+   * Health snapshot of the loop: when it last ran, how much is un-analyzed
+   * since, the queue counts, and whether it looks stalled. Parity with bare
+   * `areev loop` and `GET /api/loop/health`.
+   */
+  loopHealth(): Promise<string>
+  /** The analyzer roster: id, whether it is enabled, and its settings. */
+  loopAnalyzers(): Promise<string>
+  /**
+   * Enable/disable one analyzer, or set its parameters — reachable from the
+   * console's Setup tab (`POST /api/loop/config`) but not, until now, from
+   * the bindings. `paramsJson` is an optional JSON object of overrides.
+   */
+  setAnalyzerConfig(analyzerId: string, enabled?: boolean | undefined | null, paramsJson?: string | undefined | null): Promise<string>
+  /** Reject a recommendation with a reason (library-friendly `reject`). */
+  dismissRecommendation(hash: string, why: string, scopes?: string | undefined | null): Promise<string>
+  /**
+   * Roll back an applied recommendation (retracts the grains it created).
+   * Mandatory reason; fails for non-rollbackable applies (FORGET has no
+   * inverse). Parity with `areev loop rollback`.
+   */
+  rollbackRecommendation(hash: string, because: string): Promise<string>
+  /**
+   * Measured outcomes of applied recommendations — the Verify gate's
+   * record (`held` / `regressed` per checkpoint). JSON list, parity with
+   * `areev loop outcomes`.
+   */
+  loopOutcomes(): Promise<string>
+  /**
+   * Start a governed run. Returns the session JSON:
+   * `{"finished": …}` or `{"parked": envelope}`.
+   */
+  runStart(workflow: string, runId: string, inputJson?: string | undefined | null, toolCmd?: string | undefined | null, maxTokens?: number | undefined | null, maxUsdMicros?: number | undefined | null, maxWallMs?: number | undefined | null, askTtlSec?: number | undefined | null): Promise<string>
+  /** Resume a parked/interrupted run from its latest checkpoint. */
+  runResume(runId: string, toolCmd?: string | undefined | null): Promise<string>
+  /**
+   * Answer a pending Client ask. `responder` is REQUIRED — approval
+   * separation of duties (responder ≠ triggering principal) is structural.
+   */
+  runRespond(runId: string, toolCallId: string, resultJson: string, responder: string, isError?: boolean | undefined | null): Promise<string>
+  /** Write the kill-switch marker (the lowest-privilege run verb). */
+  runCancel(runId: string, because?: string | undefined | null): Promise<string>
+  /** Journal-consistent replay; writes nothing. JSON report. */
+  runVerify(runId: string): Promise<string>
+  /** Shadow evaluation over journaled runs — zero effect dispatches. */
+  runShadow(runIds: Array<string>): Promise<string>
+  /**
+   * §5.4 time-travel fork / migration: seed a new run from a base run's
+   * checkpoint (optionally at a specific superstep, optionally onto a new
+   * plan hash). Returns the seed checkpoint hash (hex).
+   */
+  runFork(baseRunId: string, newRunId: string, atSuperstep?: number | undefined | null, plan?: string | undefined | null): Promise<string>
+  /**
+   * Op-log cursor read — the change feed the audit/evidence story rides.
+   * Returns `[{op_seq, hlc, op, hash}...]`, ascending; pass the last
+   * `op_seq` back as the next cursor. `hlc` is a STRING: HLC values
+   * exceed 2^53 and would silently lose bits in `JSON.parse`.
+   */
+  changesSince(afterOpSeq?: number | undefined | null, limit?: number | undefined | null): Promise<string>
+  /** Recent run ids, newest first. JSON list string. */
+  runList(limit?: number | undefined | null): Promise<string>
+}
+
+/**
+ * Drop a memory schema entirely — the postgres backend's memory-level
+ * erasure primitive (`DROP SCHEMA … CASCADE`), the analogue of deleting a
+ * memory file. Destroys the memory AND its telemetry/blobs. Admin surface:
+ * gate it like any destructive operation in your host.
+ */
+export declare function dropPostgresSchema(url: string, schema: string): void