@hviana/sema 0.1.5 → 0.1.6

package/dist/src/mind/mind.js

@@ -10,28 +10,20 @@
 // Implementation split across src/mind/*.ts — this file assembles the Mind class.
 import { makeKeyring, rng, setVecConfig } from "../vec.js";
 import { Alphabet } from "../alphabet.js";
-import { reachThreshold } from "../geometry.js";
+import { reachThreshold, } from "../geometry.js";
 import { BoundedMap } from "../store.js";
 import { SQliteStore } from "../store-sqlite.js";
 import { resolveConfig } from "../config.js";
 import { bytesEqual } from "../bytes.js";
-import { GraphSearch } from "./graph-search.js";
+import { GraphSearch, } from "./graph-search.js";
 import { Alu } from "../alu/src/index.js";
-import { decodeText, Rationale } from "./rationale.js";
-import {
-  gistOf,
-  inputBytes,
-  perceive as perceiveImpl,
-  resolve as resolveImpl,
-} from "./primitives.js";
+import { decodeText, Rationale, } from "./rationale.js";
+import { gistOf, inputBytes, perceive as perceiveImpl, resolve as resolveImpl, } from "./primitives.js";
 import { chooseNext, edgeAncestors as edgeAncestorsFn } from "./traverse.js";
 import { follow } from "./match.js";
 import { recognise, segment } from "./recognition.js";
 import { meaningOf } from "./resonance.js";
-import {
-  climbAttention as climbAttentionFn,
-  naturalBreak as naturalBreakFn,
-} from "./attention.js";
+import { climbAttention as climbAttentionFn, naturalBreak as naturalBreakFn, } from "./attention.js";
 import { aluToMechanism, defaultMechanisms, think } from "./pipeline.js";
 import { articulate } from "./articulation.js";
 import { ingest } from "./learning.js";
@@ -40,291 +32,269 @@ import { rItem } from "./trace.js";
 // THE MIND
 // ═══════════════════════════════════════════════════════════════════════════
 export class Mind {
-  space;
-  alphabet;
-  store;
-  cfg;
-  /** The lightest-derivation engine over the Sema graph. */
-  search;
-  /** The grounding mechanisms iterated by {@link think}. */
-  mechanisms = [];
-  /** The live rationale tracer for the inference currently in flight, or null. */
-  trace = null;
-  /** Per-response memo of the consensus climb.  NOTE: this memo and
-   *  {@link recogniseMemo} are BYPASSED while a rationale trace is attached
-   *  (every mechanism must emit its own steps), so a traced respond re-pays
-   *  up to four consensus climbs plus repeat recognitions — that is where the
-   *  traced-vs-untraced latency multiple comes from, by design. */
-  climbMemo = null;
-  /** Per-response memo of recognise() — see {@link MindContext.recogniseMemo}. */
-  recogniseMemo = null;
-  /** Per-response memo of perceive() — see {@link MindContext.perceiveMemo}. */
-  perceiveMemo = null;
-  /** The perceived gist of the query currently being answered.  Set by `think`
-   *  before the graph search runs; `chooseNext` consults it as a gate (a null
-   *  guide means no query is in flight, so structural walkers keep plain
-   *  first-edge behaviour) and the reverse projection uses it for
-   *  reverse-recall disambiguation via `chooseAmong`. */
-  _edgeGuide = null;
-  /** Per-response memo of {@link chooseNext} picks — ensures every mechanism
-   *  of a single response follows the SAME continuation for each ambiguous
-   *  context node. */
-  _edgeChoice = new Map();
-  /** Previous deposit's seen node ids for incremental change detection. */
-  _prevSeen = null;
-  /** Session cache of node-id → perceived gist for candidate scoring — see
-   *  {@link MindContext._gistCache}.  32 MB ≈ 8K gists at D=1024; hub
-   *  candidate sets (√N at most) fit comfortably and recur across queries. */
-  _gistCache = new BoundedMap(32_000_000, (v) => v.byteLength);
-  // Deposit-path fold-pyramid cache (see MindContext) — ENTRY-count
-  // bounded: a pyramid costs ~KB per content byte (one D-float gist per
-  // interior node), and only the few live conversation chains need to stay
-  // warm, so 8 entries is the honest budget.
-  _depositTrees = new BoundedMap(8);
-  _depositLens = new Set();
-  _internIds = new WeakMap();
-  // ── GraphSearchHost implementation ─────────────────────────────────────
-  /** Canonical node id of a byte span.  Required by GraphSearchHost & MindContext. */
-  resolve(bytes) {
-    return resolveImpl(this, bytes);
-  }
-  // recogniseSpan wraps recognise
-  recogniseSpan(bytes) {
-    const r = recognise(this, bytes);
-    return { sites: r.sites, leaves: r.leaves, splits: r.splits };
-  }
-  /** Disambiguate among multiple learnt continuations of the same context node.
-   *  Required by {@link GraphSearchHost} — the graph search calls this through the
-   *  host interface when a recognised form has more than one outgoing edge.
-   *  Delegates to the standalone {@link chooseNext} which picks the candidate
-   *  with the most distributional evidence (highest `prevOf` count — the
-   *  structural manifestation of its halo).  When evidence is equal the
-   *  first-inserted edge wins. */
-  chooseNext(node) {
-    return chooseNext(this, node, this._edgeGuide);
-  }
-  constructor(optsOrCfg, storeArg, _fromStore) {
-    let userMechanisms = [];
-    let userFactories = [];
-    if (_fromStore !== undefined) {
-      this.cfg = resolveConfig(optsOrCfg);
-      this.store = storeArg;
-    } else {
-      const {
-        store: optsStore,
-        mechanisms: userMechs,
-        mechanismFactories: userFacts,
-        ...rest
-      } = optsOrCfg ?? {};
-      this.cfg = resolveConfig(rest);
-      this.store = optsStore ?? new SQliteStore({
-        maxGroup: this.cfg.geometry.maxGroup,
-      });
-      userMechanisms = userMechs ?? [];
-      userFactories = userFacts ?? [];
+    space;
+    alphabet;
+    store;
+    cfg;
+    /** The lightest-derivation engine over the Sema graph. */
+    search;
+    /** The grounding mechanisms iterated by {@link think}. */
+    mechanisms = [];
+    /** The live rationale tracer for the inference currently in flight, or null. */
+    trace = null;
+    /** Per-response memo of the consensus climb.  NOTE: this memo and
+     *  {@link recogniseMemo} are BYPASSED while a rationale trace is attached
+     *  (every mechanism must emit its own steps), so a traced respond re-pays
+     *  up to four consensus climbs plus repeat recognitions — that is where the
+     *  traced-vs-untraced latency multiple comes from, by design. */
+    climbMemo = null;
+    /** Per-response memo of recognise() — see {@link MindContext.recogniseMemo}. */
+    recogniseMemo = null;
+    /** Per-response memo of perceive() — see {@link MindContext.perceiveMemo}. */
+    perceiveMemo = null;
+    /** The perceived gist of the query currently being answered.  Set by `think`
+     *  before the graph search runs; `chooseNext` consults it as a gate (a null
+     *  guide means no query is in flight, so structural walkers keep plain
+     *  first-edge behaviour) and the reverse projection uses it for
+     *  reverse-recall disambiguation via `chooseAmong`. */
+    _edgeGuide = null;
+    /** Per-response memo of {@link chooseNext} picks — ensures every mechanism
+     *  of a single response follows the SAME continuation for each ambiguous
+     *  context node. */
+    _edgeChoice = new Map();
+    /** Previous deposit's seen node ids for incremental change detection. */
+    _prevSeen = null;
+    /** Session cache of node-id → perceived gist for candidate scoring — see
+     *  {@link MindContext._gistCache}.  32 MB ≈ 8K gists at D=1024; hub
+     *  candidate sets (√N at most) fit comfortably and recur across queries. */
+    _gistCache = new BoundedMap(32_000_000, (v) => v.byteLength);
+    // Deposit-path fold-pyramid cache (see MindContext) — ENTRY-count
+    // bounded: a pyramid costs ~KB per content byte (one D-float gist per
+    // interior node), and only the few live conversation chains need to stay
+    // warm, so 8 entries is the honest budget.
+    _depositTrees = new BoundedMap(8);
+    _depositLens = new Set();
+    _internIds = new WeakMap();
+    // ── GraphSearchHost implementation ─────────────────────────────────────
+    /** Canonical node id of a byte span.  Required by GraphSearchHost & MindContext. */
+    resolve(bytes) {
+        return resolveImpl(this, bytes);
     }
-    setVecConfig({
-      normalizeEpsilon: this.cfg.normalizeEpsilon,
-      cosineEpsilon: this.cfg.cosineEpsilon,
-    });
-    const seedRand = rng((this.cfg.seed ^ 0x9e3779) >>> 0);
-    const seats = makeKeyring(
-      this.store.D,
-      Math.max(8, this.cfg.geometry.maxGroup),
-      seedRand,
-    );
-    this.space = {
-      D: this.store.D,
-      seats,
-      rand: rng((this.cfg.seed ^ 0x51f15e) >>> 0),
-      maxGroup: this.cfg.geometry.maxGroup,
-    };
-    this.alphabet = new Alphabet(
-      this.cfg.seed,
-      this.store.D,
-      this.cfg.alphabet,
-    );
-    this.search = new GraphSearch(this.store, this.space.maxGroup, this);
-    // Build the mechanism list: default grounding + ALU + user mechanisms.
-    for (const m of defaultMechanisms) {
-      this.mechanisms.push(m);
+    // recogniseSpan wraps recognise
+    recogniseSpan(bytes) {
+        const r = recognise(this, bytes);
+        return { sites: r.sites, leaves: r.leaves, splits: r.splits };
     }
-    const host = this.extensionHost();
-    if (this.cfg.alu.enabled) {
-      const alu = new Alu({
-        tol: this.cfg.alu.tol,
-        maxIter: this.cfg.alu.maxIter,
-        precision: this.cfg.alu.precision,
-      }, host);
-      this.mechanisms.push(aluToMechanism(alu));
+    /** Disambiguate among multiple learnt continuations of the same context node.
+     *  Required by {@link GraphSearchHost} — the graph search calls this through the
+     *  host interface when a recognised form has more than one outgoing edge.
+     *  Delegates to the standalone {@link chooseNext} which picks the candidate
+     *  with the most distributional evidence (highest `prevOf` count — the
+     *  structural manifestation of its halo).  When evidence is equal the
+     *  first-inserted edge wins. */
+    chooseNext(node) {
+        return chooseNext(this, node, this._edgeGuide);
     }
-    for (const m of userMechanisms) {
-      this.mechanisms.push(m);
+    constructor(optsOrCfg, storeArg, _fromStore) {
+        let userMechanisms = [];
+        let userFactories = [];
+        if (_fromStore !== undefined) {
+            this.cfg = resolveConfig(optsOrCfg);
+            this.store = storeArg;
+        }
+        else {
+            const { store: optsStore, mechanisms: userMechs, mechanismFactories: userFacts, ...rest } = (optsOrCfg ?? {});
+            this.cfg = resolveConfig(rest);
+            this.store = optsStore ?? new SQliteStore({
+                maxGroup: this.cfg.geometry.maxGroup,
+            });
+            userMechanisms = userMechs ?? [];
+            userFactories = userFacts ?? [];
+        }
+        setVecConfig({
+            normalizeEpsilon: this.cfg.normalizeEpsilon,
+            cosineEpsilon: this.cfg.cosineEpsilon,
+        });
+        const seedRand = rng((this.cfg.seed ^ 0x9e3779) >>> 0);
+        const seats = makeKeyring(this.store.D, Math.max(8, this.cfg.geometry.maxGroup), seedRand);
+        this.space = {
+            D: this.store.D,
+            seats,
+            rand: rng((this.cfg.seed ^ 0x51f15e) >>> 0),
+            maxGroup: this.cfg.geometry.maxGroup,
+        };
+        this.alphabet = new Alphabet(this.cfg.seed, this.store.D, this.cfg.alphabet);
+        this.search = new GraphSearch(this.store, this.space.maxGroup, this);
+        // Build the mechanism list: default grounding + ALU + user mechanisms.
+        for (const m of defaultMechanisms)
+            this.mechanisms.push(m);
+        const host = this.extensionHost();
+        if (this.cfg.alu.enabled) {
+            const alu = new Alu({
+                tol: this.cfg.alu.tol,
+                maxIter: this.cfg.alu.maxIter,
+                precision: this.cfg.alu.precision,
+            }, host);
+            this.mechanisms.push(aluToMechanism(alu));
+        }
+        for (const m of userMechanisms)
+            this.mechanisms.push(m);
+        for (const f of userFactories)
+            this.mechanisms.push(f(host));
     }
-    for (const f of userFactories) {
-      this.mechanisms.push(f(host));
+    // ── Public API ───────────────────────────────────────────────────────────
+    /** Exposed for tests: the consensus climb over query sub-regions. */
+    climbAttention(query, k, mode = "inverse") {
+        return climbAttentionFn(this, query, k, mode);
     }
-  }
-  // ── Public API ───────────────────────────────────────────────────────────
-  /** Exposed for tests: the consensus climb over query sub-regions. */
-  climbAttention(query, k, mode = "inverse") {
-    return climbAttentionFn(this, query, k, mode);
-  }
-  /** Exposed for tests: climb the structural DAG from a node to its
-   *  edge-bearing ancestor contexts. */
-  edgeAncestors(id, contextCount) {
-    return edgeAncestorsFn(this, id, contextCount);
-  }
-  /** Exposed for tests: find the natural break point in a sorted vote list. */
-  naturalBreak(votes) {
-    return naturalBreakFn(votes);
-  }
-  // ── respond ───────────────────────────────────────────────────────────
-  /** Perceive input into a content-defined tree.  Deterministic — identical
-   *  bytes always produce an identical tree.  Public for ingest-cache. */
-  perceive(input, leafAt, lookup) {
-    return perceiveImpl(this, input, leafAt, lookup);
-  }
-  /** Open one response's transient state — the tracer and the per-response
-   *  memos.  Paired with {@link endResponse}; the ONE place this state is
-   *  created, so adding a memo cannot forget its reset. */
-  beginResponse(inspectRationale) {
-    this.trace = inspectRationale ? new Rationale(inspectRationale) : null;
-    this.climbMemo = new WeakMap();
-    this.recogniseMemo = new WeakMap();
-    this.perceiveMemo = new Map();
-  }
-  /** Close one response's transient state — every per-response field, incl.
-   *  the edge guide/choices `think` sets mid-flight. */
-  endResponse() {
-    this.trace = null;
-    this.climbMemo = null;
-    this.recogniseMemo = null;
-    this.perceiveMemo = null;
-    this._edgeGuide = null;
-    this._edgeChoice.clear();
-  }
-  async respond(input, inspectRationale) {
-    this.beginResponse(inspectRationale);
-    try {
-      const inBytes = inputBytes(this, input);
-      const top = this.trace?.enter("respond", [
-        rItem(inBytes, "query"),
-      ]);
-      const thought = await think(this, inBytes, this.mechanisms);
-      if (thought === null) {
-        top?.done([], "nothing to perceive or an empty store — no answer");
-        return { v: null, bytes: new Uint8Array(0) };
-      }
-      const voiced = await articulate(this, thought.bytes, inBytes);
-      top?.done([
-        rItem(voiced, "answer", resolveImpl(this, voiced) ?? undefined),
-      ], "the answer, re-voiced in the asker's words");
-      return {
-        v: gistOf(this, voiced),
-        bytes: voiced,
-        provenance: thought.provenance,
-      };
-    } finally {
-      this.endResponse();
+    /** Exposed for tests: climb the structural DAG from a node to its
+     *  edge-bearing ancestor contexts. */
+    edgeAncestors(id, contextCount) {
+        return edgeAncestorsFn(this, id, contextCount);
     }
-  }
-  /** Text view of {@link respond}.  NUL bytes (0x00) are stripped before
-   *  decoding — they are structural padding in text answers.  LOSSY for a
-   *  binary answer that legitimately contains NULs: use {@link respond} and
-   *  read `bytes` directly for binary/grid modalities. */
-  async respondText(input, inspectRationale) {
-    const r = await this.respond(input, inspectRationale);
-    return decodeText(r.bytes);
-  }
-  async embedding(input) {
-    return (await this.respond(input)).v;
-  }
-  /** Kinship note: the vector arm below is a miniature of recall's tier 3
-   *  (resonate → reach gate → read out the nearest form's bytes) — the
-   *  read-out direction of the same operation, without recall's grounding
-   *  ladder.  If either side's acceptance rule changes, revisit the other. */
-  async express(idOrV) {
-    if (typeof idOrV === "number") {
-      return this.store.bytes(idOrV);
+    /** Exposed for tests: find the natural break point in a sorted vote list. */
+    naturalBreak(votes) {
+        return naturalBreakFn(votes);
     }
-    const [hit] = await this.store.resonate(idOrV, 1);
-    // The same confidence floor recall uses: a vector whose nearest stored
-    // form sits below the reach threshold relates to NOTHING in the store —
-    // returning that form's bytes anyway would fabricate an answer from an
-    // unrelated neighbour.  Silence is the honest read-out.
-    if (hit && hit.score >= reachThreshold(this.space.maxGroup)) {
-      return this.store.bytes(hit.id);
+    // ── respond ───────────────────────────────────────────────────────────
+    /** Perceive input into a content-defined tree.  Deterministic — identical
+     *  bytes always produce an identical tree.  Public for ingest-cache. */
+    perceive(input, leafAt, lookup) {
+        return perceiveImpl(this, input, leafAt, lookup);
     }
-    return new Uint8Array(0);
-  }
-  // ── Learning ─────────────────────────────────────────────────────────────
-  async ingest(input, second) {
-    return ingest(this, input, second);
-  }
-  // ── Extension Surface ────────────────────────────────────────────────────
-  extensionHost() {
-    const mind = this;
-    return {
-      meaningOf: (bytes, anchors) => meaningOf(this, bytes, anchors),
-      continuation: (bytes) => this.groundedContinuation(bytes),
-      segment: (bytes) =>
-        segment(this, bytes).map((s) => ({ i: s.start, j: s.end })),
-      get reach() {
-        return mind.space.maxGroup;
-      },
-    };
-  }
-  async groundedContinuation(bytes) {
-    const id = resolveImpl(this, bytes);
-    if (id === null) {
-      return null;
+    /** Open one response's transient state — the tracer and the per-response
+     *  memos.  Paired with {@link endResponse}; the ONE place this state is
+     *  created, so adding a memo cannot forget its reset. */
+    beginResponse(inspectRationale) {
+        this.trace = inspectRationale ? new Rationale(inspectRationale) : null;
+        this.climbMemo = new WeakMap();
+        this.recogniseMemo = new WeakMap();
+        this.perceiveMemo = new Map();
     }
-    const grounded = await follow(this, id);
-    if (grounded !== null && !bytesEqual(grounded, bytes)) {
-      return grounded;
+    /** Close one response's transient state — every per-response field, incl.
+     *  the edge guide/choices `think` sets mid-flight. */
+    endResponse() {
+        this.trace = null;
+        this.climbMemo = null;
+        this.recogniseMemo = null;
+        this.perceiveMemo = null;
+        this._edgeGuide = null;
+        this._edgeChoice.clear();
     }
-    return null;
-  }
-  // ── Content-index repair ───────────────────────────────────────────────
-  /** Re-index structurally-important nodes whose gists were evicted from the
-   *  pending cache before they reached the content index.  See {@link
-   *  Store.repairContentIndex} for the contract; this method wires the
-   *  Mind's perception into the store's repair walk.
-   *
-   *  Run this after training or at checkpoints to restore recall reach for
-   *  nodes that bridge experiences but were never indexed.  A pure interior
-   *  node (no edges, no halo) is deliberately skipped — it is scaffolding,
-   *  not an experience root or bridge, and regenerating its gist would waste
-   *  I/O and index space for no recall benefit.
-   *
-   *  @param minParents  only repair nodes with ≥ this many structural parents
-   *                     (default 2 — structural bridges)
-   *  @returns number of nodes added to the content index */
-  async repairContentIndex(minParents = 2) {
-    return this.store.repairContentIndex(async (id) => {
-      const bytes = this.store.bytes(id);
-      if (bytes.length === 0) {
+    async respond(input, inspectRationale) {
+        this.beginResponse(inspectRationale);
+        try {
+            const inBytes = inputBytes(this, input);
+            const top = this.trace?.enter("respond", [
+                rItem(inBytes, "query"),
+            ]);
+            const thought = await think(this, inBytes, this.mechanisms);
+            if (thought === null) {
+                top?.done([], "nothing to perceive or an empty store — no answer");
+                return { v: null, bytes: new Uint8Array(0) };
+            }
+            const voiced = await articulate(this, thought.bytes, inBytes);
+            top?.done([rItem(voiced, "answer", resolveImpl(this, voiced) ?? undefined)], "the answer, re-voiced in the asker's words");
+            return {
+                v: gistOf(this, voiced),
+                bytes: voiced,
+                provenance: thought.provenance,
+            };
+        }
+        finally {
+            this.endResponse();
+        }
+    }
+    /** Text view of {@link respond}.  NUL bytes (0x00) are stripped before
+     *  decoding — they are structural padding in text answers.  LOSSY for a
+     *  binary answer that legitimately contains NULs: use {@link respond} and
+     *  read `bytes` directly for binary/grid modalities. */
+    async respondText(input, inspectRationale) {
+        const r = await this.respond(input, inspectRationale);
+        return decodeText(r.bytes);
+    }
+    async embedding(input) {
+        return (await this.respond(input)).v;
+    }
+    /** Kinship note: the vector arm below is a miniature of recall's tier 3
+     *  (resonate → reach gate → read out the nearest form's bytes) — the
+     *  read-out direction of the same operation, without recall's grounding
+     *  ladder.  If either side's acceptance rule changes, revisit the other. */
+    async express(idOrV) {
+        if (typeof idOrV === "number")
+            return this.store.bytes(idOrV);
+        const [hit] = await this.store.resonate(idOrV, 1);
+        // The same confidence floor recall uses: a vector whose nearest stored
+        // form sits below the reach threshold relates to NOTHING in the store —
+        // returning that form's bytes anyway would fabricate an answer from an
+        // unrelated neighbour.  Silence is the honest read-out.
+        if (hit && hit.score >= reachThreshold(this.space.maxGroup)) {
+            return this.store.bytes(hit.id);
+        }
+        return new Uint8Array(0);
+    }
+    // ── Learning ─────────────────────────────────────────────────────────────
+    async ingest(input, second) {
+        return ingest(this, input, second);
+    }
+    // ── Extension Surface ────────────────────────────────────────────────────
+    extensionHost() {
+        const mind = this;
+        return {
+            meaningOf: (bytes, anchors) => meaningOf(this, bytes, anchors),
+            continuation: (bytes) => this.groundedContinuation(bytes),
+            segment: (bytes) => segment(this, bytes).map((s) => ({ i: s.start, j: s.end })),
+            get reach() {
+                return mind.space.maxGroup;
+            },
+        };
+    }
+    async groundedContinuation(bytes) {
+        const id = resolveImpl(this, bytes);
+        if (id === null)
+            return null;
+        const grounded = await follow(this, id);
+        if (grounded !== null && !bytesEqual(grounded, bytes))
+            return grounded;
         return null;
-      }
-      return gistOf(this, bytes);
-    }, minParents);
-  }
-  // ── Persistence ──────────────────────────────────────────────────────────
-  async save() {
-    const meta = new TextEncoder().encode(JSON.stringify(this.cfg));
-    await this.store.saveSnapshot(meta);
-    return meta;
-  }
-  static async load(snapshot, store) {
-    const cfg = JSON.parse(new TextDecoder().decode(snapshot));
-    return new Mind(cfg, store, true);
-  }
-  static async loadFromStore(store) {
-    const meta = await store.loadSnapshot();
-    if (!meta) {
-      throw new Error("no snapshot in store");
     }
-    return Mind.load(meta, store);
-  }
+    // ── Content-index repair ───────────────────────────────────────────────
+    /** Re-index structurally-important nodes whose gists were evicted from the
+     *  pending cache before they reached the content index.  See {@link
+     *  Store.repairContentIndex} for the contract; this method wires the
+     *  Mind's perception into the store's repair walk.
+     *
+     *  Run this after training or at checkpoints to restore recall reach for
+     *  nodes that bridge experiences but were never indexed.  A pure interior
+     *  node (no edges, no halo) is deliberately skipped — it is scaffolding,
+     *  not an experience root or bridge, and regenerating its gist would waste
+     *  I/O and index space for no recall benefit.
+     *
+     *  @param minParents  only repair nodes with ≥ this many structural parents
+     *                     (default 2 — structural bridges)
+     *  @returns number of nodes added to the content index */
+    async repairContentIndex(minParents = 2) {
+        return this.store.repairContentIndex(async (id) => {
+            const bytes = this.store.bytes(id);
+            if (bytes.length === 0)
+                return null;
+            return gistOf(this, bytes);
+        }, minParents);
+    }
+    // ── Persistence ──────────────────────────────────────────────────────────
+    async save() {
+        const meta = new TextEncoder().encode(JSON.stringify(this.cfg));
+        await this.store.saveSnapshot(meta);
+        return meta;
+    }
+    static async load(snapshot, store) {
+        const cfg = JSON.parse(new TextDecoder().decode(snapshot));
+        return new Mind(cfg, store, true);
+    }
+    static async loadFromStore(store) {
+        const meta = await store.loadSnapshot();
+        if (!meta)
+            throw new Error("no snapshot in store");
+        return Mind.load(meta, store);
+    }
 }