@hviana/sema 0.1.6 → 0.1.8

package/dist/src/mind/mechanisms/cast.js

@@ -262,7 +262,21 @@ export async function counterfactualTransfer(ctx, query, pre) {
     // corrupted-store read now falls back here instead of voicing a hollow
     // seat into the comparison — the same "empty bytes are no grounding"
     // invariant project() has always enforced.
-    const seatOfNode = (id, fallback) => reverseContext(ctx, id, qv) ?? fallback;
+    // A node that only ever CONTINUES — an edge SOURCE with no predecessor —
+    // is a learnt CONTEXT (a stored question-shaped frame), not an entity.
+    // Voicing it verbatim answers a question with a question (the observed
+    // cast echo: two stored questions concatenated as an "answer").  The
+    // context's role is established by what it LEADS TO, so its seat is its
+    // own continuation — the fact — with the reverse projection and the raw
+    // bytes as the ordinary fallbacks for genuine entities.
+    const seatOfNode = async (id, fallback) => {
+        if (ctx.store.prevCount(id) === 0 && ctx.store.hasNext(id)) {
+            const fwd = await follow(ctx, id, qv);
+            if (fwd !== null)
+                return fwd;
+        }
+        return reverseContext(ctx, id, qv) ?? fallback;
+    };
     const seatOf = (p) => seatOfNode(p.anchor, p.ctx);
     const analogs = [];
     for (const p of points) {
@@ -381,10 +395,10 @@ export async function counterfactualTransfer(ctx, query, pre) {
             rNode(ctx, dominant.anchor, "analog", bestSim),
             rNode(ctx, bestAnalog.anchor, "analog", bestSim),
         ], [], "the two structures keep distributional company beyond chance — genuine analogs");
-        const a = seatOf(dominant);
+        const a = await seatOf(dominant);
         const b = bestAnalog.point !== null
-            ? seatOf(bestAnalog.point)
-            : seatOfNode(bestAnalog.anchor, read(ctx, bestAnalog.anchor));
+            ? await seatOf(bestAnalog.point)
+            : await seatOfNode(bestAnalog.anchor, read(ctx, bestAnalog.anchor));
         const answer = await joinWithBridge(ctx, a, b);
         record(answer, "analogical comparison — each analog voiced by the context that establishes its role", new Set([dominant.anchor, bestAnalog.anchor]), 
         // A halo-mediated act (the analogy gate) plus two seat projections.

package/dist/src/mind/mechanisms/confluence.js

@@ -70,6 +70,18 @@ export async function confluenceJoin(ctx, query, pre) {
     // below.
     const queryWin = pre.queryWindows;
     const queryIds = new Set(queryWin.values());
+    // A constraint must bind a CONSTITUENT, not a shard.  A genuinely shared
+    // form weaves a contiguous RUN of shared discriminative windows — its
+    // merged cover span is the form's own length, beyond one perception
+    // quantum (2W: the same "two quanta of structure" bar the conjunctive
+    // precondition `query.length < 2W` and CAST's weave live under).  A long
+    // stored document holds thousands of W-windows and will hold a FEW of any
+    // query's by accident, but accidental sharing is one window (a merged
+    // span of W, at most ~W+overlap bytes: "ow ma", "ys a", "ías " —
+    // observed), never a run ("​ translucent", " featherlight" — the genuine
+    // constraints).  Shard-bound streams are no constraints, and their meets
+    // are connective debris (". Sure,", "ngul" — observed).
+    const bindsAConstituent = (cover) => cover.some(([cs, ce]) => ce - cs >= 2 * W);
     const streams = [];
     const rankedCapped = ranked.length > pre.k ? ranked.slice(0, pre.k) : ranked;
     for (const cand of rankedCapped) {
@@ -96,7 +108,7 @@ export async function confluenceJoin(ctx, query, pre) {
             else
                 cover.push(curC = [off, off + W]);
         }
-        if (cover.length > 0) {
+        if (cover.length > 0 && bindsAConstituent(cover)) {
             streams.push({ anchor: cand.anchor, vote: cand.vote, ids, cover, held });
         }
     }

package/dist/src/mind/mechanisms/recall.js

@@ -6,8 +6,9 @@
 import { cosine } from "../../vec.js";
 import { consensusFloor, identityBar, reachThreshold, significanceBar, } from "../../geometry.js";
 import { gistOf, read, resolve } from "../primitives.js";
+import { bytesEqual, indexOf } from "../../bytes.js";
 import { corpusN, hubBound } from "../traverse.js";
-import { project, reverseContext } from "../match.js";
+import { follow, project, reverseContext } from "../match.js";
 import { CONCEPT, STEP } from "../graph-search.js";
 import { unexplainedLabel } from "../rationale.js";
 import { rItem, rNode } from "../trace.js";
@@ -43,6 +44,44 @@ export async function recallByResonance(ctx, query, pre) {
                 : "exact self-match — reverse recall to the best-resonating predecessor", nothing, STEP);
         }
     }
+    // 0b. ARGUMENT BINDING (RC8): the query is not itself a stored form, but
+    // it CONTAINS a recognised constituent that is an edge SOURCE — a learnt
+    // pair's left side carried inside a wrapper ("How do you say 'thank you'
+    // in French?").  The wrapper is scaffolding; the argument is the span
+    // that LEADS somewhere, so its continuation — guided by the whole query's
+    // gist — is the answer.  Matching the wrapper while ignoring the argument
+    // (the observed "good morning" template failure) is worse than silence,
+    // so anything short of ONE unambiguous binding falls through: the
+    // constituent bar is the same two-quanta (2W) reading confluence binds
+    // under, nested recognitions collapse to their MAXIMAL span, and two
+    // distinct maximal arguments mean the query asks about neither alone.
+    if (qId === null) {
+        const W2 = 2 * ctx.space.maxGroup;
+        const args = pre.rec.sites.filter((s) => s.end - s.start >= W2 &&
+            s.end - s.start < query.length &&
+            ctx.store.hasNext(s.payload));
+        // Maximal spans by one sorted sweep (starts ascending, ties longest
+        // first): every earlier span starts at or before s, so s is contained
+        // exactly when the running max end already covers it.  O(m log m) — a
+        // long input recognises O(|input|) sites, and a pairwise scan here was
+        // quadratic in the input.
+        args.sort((a, b) => a.start - b.start || b.end - a.end);
+        const maximal = [];
+        let maxEnd = -1;
+        for (const s of args) {
+            if (s.end <= maxEnd)
+                continue;
+            maximal.push(s);
+            maxEnd = s.end;
+        }
+        if (maximal.length === 1) {
+            const arg = maximal[0];
+            const g = await follow(ctx, arg.payload, queryGist);
+            if (g !== null && g.length > 0) {
+                return ground(g, "argument binding — the query's sole edge-source constituent, continuation followed", [[arg.start, arg.end]], STEP);
+            }
+        }
+    }
     const whole = await ctx.store.resonate(queryGist, k);
     if (whole.length === 0) {
         return ground(null, "empty store — nothing to resonate with", [], 0);
@@ -55,9 +94,27 @@ export async function recallByResonance(ctx, query, pre) {
     // into bytes — at most one river window (see {@link identityBar}).  A
     // fixed cosine bar let long queries claim "near-identical" while whole
     // windows — an answer word — differed.
-    if (top.score >= identityBar(ctx.store.D, ctx.space.maxGroup, query.length)) {
+    // A hit RESTATES the query when its bytes are the query's own — exactly,
+    // or under the response's equivalence (a case/width twin).  Restating
+    // hits may only conclude through disciplined reverse recall: voicing
+    // their bytes echoes the query back at itself (never an answer — the
+    // same principle that keeps cast from voicing stored questions), and
+    // projecting them forward is reverse recall's containment failure in the
+    // other direction — "whatever followed these bytes in some document".
+    const qKey = ctx.canon ? ctx.canon(query) : query;
+    const restates = (b) => bytesEqual(b, query) ||
+        (ctx.canon !== null && bytesEqual(ctx.canon(b), qKey));
+    const idBar = identityBar(ctx.store.D, ctx.space.maxGroup, query.length);
+    if (top.score >= idBar) {
         for (const h of whole) {
-            if (h.id === qId || h.score >= 1.0) {
+            // The identity claim is PER HIT, not per tier: hits are ranked
+            // nearest-first, and grounding one below the bar under this tier's
+            // "near-identical" label would launder byte-overlap noise (observed:
+            // "merci" projecting through the unrelated near hit "meraih").
+            if (h.score < idBar)
+                break;
+            const own = read(ctx, h.id);
+            if (h.id === qId || restates(own)) {
                 const rev = ctx.store.prevFirst(h.id, hubBound(ctx));
                 const g = reverseContext(ctx, h.id, queryGist, rev);
                 if (g !== null) {
@@ -65,10 +122,7 @@ export async function recallByResonance(ctx, query, pre) {
                         ? "perfect self-match — reverse recall to the sole predecessor"
                         : "perfect self-match — reverse recall to the best-resonating predecessor", nothing, STEP);
                 }
-                const own = read(ctx, h.id);
-                if (own.length > 0) {
-                    return ground(own, "perfect self-match — the query IS this node", nothing, STEP);
-                }
+                continue;
             }
             const g = await project(ctx, h.id, queryGist);
             if (g) {
@@ -76,8 +130,30 @@ export async function recallByResonance(ctx, query, pre) {
             }
         }
     }
+    // The query-relative grounding fraction, shared by tiers 2–4 — gated on
+    // the FRACTION OF THE QUERY the grounding explains, not the raw cosine.
+    // Root gists are unit vectors, but their magnitudes are recoverable from
+    // the byte lengths (‖·‖ = √len under the linear fold):
+    // cos = shared/√(lenQ·lenG), so shared/lenQ = cos·√(lenG/lenQ).
+    // The raw cosine punished honest containment — a query fully inside a
+    // longer grounded answer scored √(lenQ/lenG) and was refused — and let a
+    // long answer sharing only scaffolding pass; the query-relative fraction
+    // measures exactly what the reach bar means: how much of THE QUERY the
+    // store accounts for.
+    // Chance similarity survives the length conversion AMPLIFIED: the same
+    // √(lenG/lenQ) factor that converts an honest shared fraction into a
+    // query-relative one multiplies the estimator/chance floor too, so a long
+    // stored form (√(lenG/lenQ) ≈ 10 at 100×) lifted a noise-level cosine past
+    // the reach bar and grounded pure gibberish (observed).  Only the
+    // ABOVE-CHANCE part of the similarity is evidence of shared content —
+    // subtract the significance bar (3/√D, §8.3) before converting.  Derived
+    // from the existing bars; never tuned.
+    const sig = significanceBar(ctx.store.D);
+    const reach = reachThreshold(ctx.space.maxGroup);
+    const fracOfQuery = (cos, otherLen) => Math.min(1, Math.max(0, cos - sig) *
+        Math.sqrt(otherLen / Math.max(1, query.length)));
     // 2. Scaffolding-dominated.
-    if (top.score >= significanceBar(ctx.store.D)) {
+    if (top.score >= sig) {
         const N = corpusN(ctx);
         const minVote = consensusFloor(N);
         // The committed points of attention ARE the shared climb's roots (same
@@ -86,44 +162,52 @@ export async function recallByResonance(ctx, query, pre) {
         const forest = (await pre.attention()).roots;
         if (forest.length > 0 && forest[0].vote >= minVote) {
             const g = await project(ctx, forest[0].anchor, queryGist);
-            if (g) {
+            // The anchor cleared the consensus floor, but the floor prices the
+            // ANCHOR's evidence, not the projection's: a junk attractor can clear
+            // it and project a PIECE OF THE QUERY back at it (the observed
+            // "buenos días in English" → "English" fragment).  A projection that
+            // is a proper byte-subspan of the query restates part of the question
+            // — never an answer (the same principle as `restates` above, extended
+            // to fragments).  Genuine anchor groundings — longer than the query,
+            // or disjoint from it — pass untouched.
+            if (g && !(g.length < query.length && indexOf(query, g, 0) >= 0)) {
                 return ground(g, "scaffolding-dominated query — ground the consensus-climb anchor", [[forest[0].start, forest[0].end]], CONCEPT);
             }
         }
     }
-    // 3. Last resort — gated on the FRACTION OF THE QUERY the grounding
-    // explains, not the raw cosine.  Root gists are unit vectors, but their
-    // magnitudes are recoverable from the byte lengths (‖·‖ = √len under the
-    // linear fold): cos = shared/√(lenQ·lenG), so shared/lenQ = cos·√(lenG/lenQ).
-    // The raw cosine punished honest containment — a query fully inside a
-    // longer grounded answer scored √(lenQ/lenG) and was refused — and let a
-    // long answer sharing only scaffolding pass; the query-relative fraction
-    // measures exactly what the reach bar means: how much of THE QUERY the
-    // store accounts for.
-    const fracOfQuery = (cos, otherLen) => Math.min(1, cos * Math.sqrt(otherLen / Math.max(1, query.length)));
+    // 3. Last resort — the nearest grounded whole-query hit, same gate.
     for (const h of whole) {
         const g = await project(ctx, h.id, queryGist);
         if (g) {
             if (fracOfQuery(cosine(queryGist, gistOf(ctx, g)), g.length) >=
-                reachThreshold(ctx.space.maxGroup)) {
+                reach) {
                 return ground(g, "last resort: the nearest grounded whole-query hit", [], STEP);
             }
         }
     }
-    // The refusal/echo decision, in the same query-relative units — the top
-    // hit's magnitude read from the store (contentLen: √bytes IS the linear
-    // fold's gist norm), never from re-reading its bytes.
-    // The magnitude read SATURATES at the decision point: frac reaches the
-    // reach bar exactly when lenH = lenQ·(reach/score)², so the walk never
-    // needs to see past that — a huge conversation root costs a capped read,
-    // and a clamped return decides "pass" identically (frac ≥ reach).
-    const reach = reachThreshold(ctx.space.maxGroup);
-    const lenCap = Math.ceil(query.length * (reach / Math.max(top.score, 1e-6)) ** 2) + 1;
-    if (fracOfQuery(top.score, ctx.store.contentLen(top.id, lenCap)) < reach) {
+    // The refusal/echo decision.  The echo returns a stored form's bytes AS
+    // the answer — a near-identity claim about the query — and identity-grade
+    // decisions are never made on an estimated score ("approximate scores may
+    // rank and propose; they may never decide", §6.2): the RaBitQ estimate
+    // overshooting the reach bar echoed a WRONG-entity neighbour ("capital of
+    // Zamunda?" echoed the Armenia fact, observed).  The bytes are read
+    // anyway to be echoed, so the decision uses their EXACT fold: one river
+    // fold of the top hit, measured in the same query-relative,
+    // chance-corrected units as the tier above.
+    const topBytes = read(ctx, top.id);
+    const exact = topBytes.length > 0
+        ? cosine(queryGist, gistOf(ctx, topBytes))
+        : 0;
+    if (fracOfQuery(exact, topBytes.length) < reach) {
         return ground(null, "below reach threshold — nothing in the store relates to this query", [], 0);
     }
+    // Echoing the query's own bytes back at it is not an echo of a RELATED
+    // form — it is the query restated, which answers nothing.
+    if (restates(topBytes)) {
+        return ground(null, "the nearest form IS the query itself — restating it answers nothing", [], 0);
+    }
     // Honest echo.
-    return ground(read(ctx, top.id), "last resort: the nearest resonant form's own bytes (echo, not grounded)", [], 0, true);
+    return ground(topBytes, "last resort: the nearest resonant form's own bytes (echo, not grounded)", [], 0, true);
 }
 // ── Pipeline mechanism ──────────────────────────────────────────────────────
 export const recallMechanism = {

package/dist/src/mind/mind.d.ts

@@ -1,9 +1,10 @@
 import { Vec } from "../vec.js";
 import { Sema, Space } from "../sema.js";
 import { Alphabet } from "../alphabet.js";
-import { Grid } from "../geometry.js";
+import { type FoldPyramid, Grid } from "../geometry.js";
 import { BoundedMap, type Store } from "../store.js";
 import { type MindConfig } from "../config.js";
+import { type Canon } from "../canon.js";
 import { GraphSearch, type Leaf, type Site } from "./graph-search.js";
 import type { ComputedSpan, ExtensionHost } from "../extension.js";
 export type { ComputedSpan, ExtensionHost };
@@ -19,6 +20,27 @@ export interface Response {
      *  no answer. */
     provenance?: import("./pipeline.js").Provenance;
 }
+/** Serializable state of a conversation — can be saved and restored across
+ *  sessions.  The Mind never interprets the bytes; it only tracks their
+ *  cumulative lengths so the caller can reconstruct turn boundaries later
+ *  without inspecting content. */
+export interface ConversationState {
+    /** The accumulated context bytes — raw concatenation of every turn's
+     *  bytes in order.  No separator is inserted; the boundary offsets
+     *  ({@link boundaries}) tell the caller where each turn ends. */
+    context: Uint8Array;
+    /** Cumulative byte length after each completed turn.  Sorted, strictly
+     *  increasing, each {@code < context.length}.  The first turn's length
+     *  is `boundaries[0]`; the second turn starts at that offset, and so
+     *  on.  Empty for a single-turn or new conversation. */
+    boundaries: number[];
+}
+/** An active conversation handle.  Opaque — interact through the Mind's
+ *  conversation methods ({@link Mind.beginConversation},
+ *  {@link Mind.respondTurn}, {@link Mind.endConversation}). */
+export interface Conversation {
+    readonly id: number;
+}
 import type { AttentionRead, MindContext, Recognition } from "./types.js";
 export interface MindOptions {
     seed?: number;
@@ -34,6 +56,12 @@ export interface MindOptions {
     mechanisms?: import("./pipeline-mechanism.js").PipelineMechanism[];
     /** Factories that receive the {@link ExtensionHost} and return mechanisms. */
     mechanismFactories?: ((host: import("../extension.js").ExtensionHost) => import("./pipeline-mechanism.js").PipelineMechanism)[];
+    /** Content canonicalizer applied to EVERY response (any modality) for
+     *  equivalence-class resolution — see src/canon.ts.  Text entry points
+     *  ({@link Mind.respondText}, {@link Mind.respondTurnText}) inject the
+     *  Unicode text canonicalizer automatically when this is unset; pass
+     *  `false` to disable canonical resolution everywhere. */
+    canon?: Canon | false;
 }
 export declare class Mind implements MindContext {
     readonly space: Space;
@@ -46,16 +74,27 @@ export declare class Mind implements MindContext {
     readonly mechanisms: import("./pipeline-mechanism.js").PipelineMechanism[];
     /** The live rationale tracer for the inference currently in flight, or null. */
     trace: Rationale | 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: WeakMap<Uint8Array, Map<string, AttentionRead>> | null;
-    /** Per-response memo of recognise() — see {@link MindContext.recogniseMemo}. */
-    recogniseMemo: WeakMap<Uint8Array, Recognition> | null;
-    /** Per-response memo of perceive() — see {@link MindContext.perceiveMemo}. */
+    /** The content canonicalizer for the response in flight — see
+     *  {@link MindContext.canon}.  Injected per response by the modality entry
+     *  point; null when the response carries no equivalence. */
+    canon: Canon | null;
+    /** Per-response canonical-resolution memo — see {@link MindContext.canonMemo}. */
+    canonMemo: Map<string, number | null> | null;
+    /** The Mind-level canon option: a canonicalizer to use for EVERY response,
+     *  `false` to disable canonical resolution, or null to let each entry
+     *  point decide (text entry points inject {@link textCanon}). */
+    private _canonOpt;
+    /** Memo of the consensus climb — content-keyed.  See {@link MindContext.climbMemo}. */
+    climbMemo: Map<string, Map<string, AttentionRead>> | null;
+    /** Memo of recognise() — content-keyed.  See {@link MindContext.recogniseMemo}. */
+    recogniseMemo: Map<string, Recognition> | null;
+    /** Memo of perceive() — content-keyed.  See {@link MindContext.perceiveMemo}. */
     perceiveMemo: Map<string, import("../sema.js").Sema> | null;
+    /** Subtree-resolution cache.  See {@link MindContext._resolvedSubtrees}. */
+    _resolvedSubtrees: WeakMap<import("../sema.js").Sema, {
+        id: number;
+        len: number;
+    }> | 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
@@ -72,9 +111,11 @@ export declare class Mind implements MindContext {
      *  {@link MindContext._gistCache}.  32 MB ≈ 8K gists at D=1024; hub
      *  candidate sets (√N at most) fit comfortably and recur across queries. */
     _gistCache: BoundedMap<number, Vec>;
-    _depositTrees: BoundedMap<string, import("../geometry.js").FoldPyramid>;
+    _depositTrees: BoundedMap<string, FoldPyramid>;
     _depositLens: Set<number>;
     _internIds: WeakMap<Sema, number>;
+    private _nextConvId;
+    private _conversations;
     /** Canonical node id of a byte span.  Required by GraphSearchHost & MindContext. */
     resolve(bytes: Uint8Array): number | null;
     recogniseSpan(bytes: Uint8Array): {
@@ -106,15 +147,85 @@ export declare class Mind implements MindContext {
      *  memos.  Paired with {@link endResponse}; the ONE place this state is
      *  created, so adding a memo cannot forget its reset. */
     private beginResponse;
+    /** The canonicalizer a response should carry: the Mind-level option when
+     *  set (or none when explicitly disabled), else the entry point's own
+     *  default — text entry points pass {@link textCanon}, binary ones null. */
+    private _canonFor;
     /** Close one response's transient state — every per-response field, incl.
      *  the edge guide/choices `think` sets mid-flight. */
     private endResponse;
+    /** Shared response core — the one path from bytes to voiced answer.
+     *  `respond` calls this directly; `respondTurn` has its own path
+     *  with conversation-persistent memos and incremental perception. */
+    private _respondImpl;
     respond(input: Input, inspectRationale?: InspectRationale): Promise<Response>;
     /** 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. */
+     *  read `bytes` directly for binary/grid modalities.
+     *
+     *  Injects the TEXT canonicalizer (src/canon.ts) so resolution treats
+     *  every character variation of the same text — case, width, whitespace —
+     *  as one form, provided the store's canon index is built
+     *  ({@link buildCanonIndex}). */
     respondText(input: string, inspectRationale?: InspectRationale): Promise<string>;
+    /** Begin a new conversation, optionally restoring from a previously-saved
+     *  {@link ConversationState}.  The returned handle is required for
+     *  {@link respondTurn} and {@link endConversation}.
+     *
+     *  Conversations are independent — a Mind can manage several concurrently.
+     *  Each tracks the fold pyramid (accumulated internal processing) and
+     *  turn-boundary offsets; the geometry never inspects content to guess
+     *  where one turn ends and the next begins. */
+    beginConversation(state?: ConversationState): Conversation;
+    /** End a conversation, releasing its internal resources (accumulated
+     *  context, boundary offsets, and the fold-pyramid cache).  Idempotent. */
+    endConversation(conv: Conversation): void;
+    /** The current serialisable state of an active conversation.  Save this
+     *  to resume the conversation later via {@link beginConversation}. */
+    conversationState(conv: Conversation): ConversationState | null;
+    /** Append a turn to a conversation's accumulated context WITHOUT
+     *  responding — raw byte append plus a boundary offset, never a
+     *  separator; the fold pyramid advances by O(turn).
+     *
+     *  This is the primitive for turns the Mind should hear but not answer:
+     *  replaying a transcript, feeding the OTHER speaker's line in a
+     *  prediction harness, or restoring context piecewise.  {@link
+     *  respondTurn} = addTurn + think + its own reply appended the same way. */
+    addTurn(conv: Conversation, turn: Input): ConversationState;
+    /** Grow a conversation's accumulated context by one turn's bytes — raw
+     *  append plus a boundary offset, pyramid advanced by O(turn), the grown
+     *  context's tree seeded into the conversation's perceive memo.  The ONE
+     *  place a context grows ({@link addTurn} and {@link respondTurn} both
+     *  come through here), so the append semantics cannot drift. */
+    private _growContext;
+    /** Process one turn of a conversation.
+     *
+     *  `turn` is the raw input for the latest turn — its bytes are appended
+     *  to the accumulated context directly (raw concatenation).  The Mind
+     *  tracks the byte offset where each turn ends; no separator is ever
+     *  inserted or inspected.
+     *
+     *  Returns the response AND the updated {@link ConversationState} so the
+     *  caller can persist it.  The conversation handle's internal state is
+     *  updated in place — the returned state is a snapshot for storage.
+     *
+     *  SINGLE FLIGHT: at most one respondTurn may be in flight per Mind.  The
+     *  conversation's memo caches are swapped into the Mind-level per-response
+     *  pointers for the duration of the turn, so a concurrently-running
+     *  respond()/respondTurn() on the SAME Mind would interleave state.
+     *  Different Minds (or sequential awaits, as in every test) are safe. */
+    respondTurn(conv: Conversation, turn: Input, inspectRationale?: InspectRationale): Promise<{
+        response: Response;
+        state: ConversationState;
+    }>;
+    /** Text view of {@link respondTurn}.  See {@link respondText} for the
+     *  NUL-stripping caveat.  For binary or grid turns use {@link respondTurn}
+     *  directly — this is a text-only convenience, like {@link respondText}. */
+    respondTurnText(conv: Conversation, turn: string, inspectRationale?: InspectRationale): Promise<{
+        response: string;
+        state: ConversationState;
+    }>;
     embedding(input: Input): Promise<Vec | null>;
     /** 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
@@ -141,6 +252,21 @@ export declare class Mind implements MindContext {
      *                     (default 2 — structural bridges)
      *  @returns number of nodes added to the content index */
     repairContentIndex(minParents?: number): Promise<number>;
+    /** Build (or incrementally refresh) the store's canonical-form index: for
+     *  every content-bearing node, record the hash of its CANONICAL key so
+     *  resolution can find stored forms across surface variation (case, width,
+     *  whitespace — whatever `canon` equates; see src/canon.ts).
+     *
+     *  Incremental and idempotent: the last indexed node id is remembered in
+     *  store meta (`canon.upto`), so a refresh after further training scans
+     *  only the new rows.  Run once after training, and again after ingests —
+     *  the same operational shape as {@link repairContentIndex}.
+     *
+     *  @param canon  the canonicalizer to index under — MUST be the same one
+     *                queries will carry (text queries carry {@link textCanon}
+     *                unless the Mind was constructed with its own)
+     *  @returns number of index rows added */
+    buildCanonIndex(canon?: Canon): Promise<number>;
     save(): Promise<Uint8Array>;
     static load(snapshot: Uint8Array, store: Store): Promise<Mind>;
     static loadFromStore(store: Store): Promise<Mind>;