@hviana/sema 0.2.9 → 0.4.0

package/dist/src/mind/attention.js

@@ -12,7 +12,7 @@ import { composeStructuralGist, consensusFloor, dominates, estimatorNoise, } fro
 import { foldTree, gistOf, latin1Key, perceive, read } from "./primitives.js";
 import { recognise } from "./recognition.js";
 import { leafIdRun } from "./canonical.js";
-import { corpusN, edgeAncestors, hubBound } from "./traverse.js";
+import { corpusN, edgeAncestors, hubBound, sharedReachMemo, } from "./traverse.js";
 import { cachedRead, junctionContainersFrom, junctionSeeds, junctionSynonyms, loadJunctionSynonymSides, walkCache, } from "./junction.js";
 import { indexOf } from "../bytes.js";
 import { rItem, rNode, traceDerivation } from "./trace.js";
@@ -38,6 +38,9 @@ function serialiseReaches(reachMemo) {
             contextsReached: r.contextsReached,
             saturated: r.saturated,
             ...(r.saturation ? { saturation: r.saturation } : {}),
+            ...(r.visited !== undefined
+                ? { visited: r.visited, maxDepth: r.maxDepth }
+                : {}),
         });
     }
     return out;
@@ -73,6 +76,8 @@ export async function climbAttentionAll(ctx, query, k, mode = "inverse") {
         }
         const hit = byRead.get(modeKey);
         if (hit !== undefined) {
+            if (ctx.meter)
+                ctx.meter.climbHits++;
             // Cache-hit exit (spec §9): the abbreviated payload shape — only what
             // is actually stored in the cached AttentionRead is reported.  No
             // candidate, reach, saturation, pooling or anchor detail is fabricated
@@ -98,6 +103,8 @@ export async function climbAttentionAll(ctx, query, k, mode = "inverse") {
 }
 // ── Pipeline ──────────────────────────────────────────────────────────────
 export async function computeAttention(ctx, query, k, mode) {
+    if (ctx.meter)
+        ctx.meter.climbs++;
     const regions = collectRegions(ctx, query);
     const perceivedCount = regions.length;
     // Recognised sites carry structural evidence that perceived sub-regions
@@ -114,6 +121,22 @@ export async function computeAttention(ctx, query, k, mode) {
             v: gistOf(ctx, query.subarray(s.start, s.end)),
             start: s.start,
             end: s.end,
+            // NOT a chunk — a precondition, not a judgement about the evidence.
+            // `chunk` admits a region into the saturated-INTERVAL builder (see
+            // crossRegionVotes), which walks regions as a SEQUENCE and merges
+            // neighbouring saturated ones into runs.  Its own contract requires the
+            // regions it reads to be DISJOINT and in byte order — true of
+            // leaf-parents, false of sites, which overlap each other and the chunks
+            // ("red", "circle" and "red circle" are all present at once).
+            //
+            // Admitting them was measured both ways and is unprincipled in each
+            // direction: a saturated site EXTENDS a run and masks votes that should
+            // have won (test/37 lost all three — roots became "red " and "hat"
+            // instead of "red circle" and "2"), while a non-saturated one BREAKS a
+            // run and unmasks votes that should have been dropped, which is the only
+            // reason it appeared to fix test/34.  Either way the outcome turns on
+            // where an overlapping span happens to fall in the array — the same
+            // positional accident this work exists to remove.
             chunk: false,
             known: true, // a recognised site IS a stored form
         });
@@ -137,15 +160,25 @@ export async function computeAttention(ctx, query, k, mode) {
     const N = corpusN(ctx);
     // One climb per distinct anchor for the WHOLE query: regions sharing a
     // chunk, and canonicalChunkId's prefix probes, all hit this memo instead of
-    // re-reading the anchor's full edge fan-out from the store.
-    const reachMemo = new Map();
-    const rvs = await voteRegions(ctx, query, regions, k, mode, N, reachMemo, td);
+    // re-reading the anchor's full edge fan-out from the store.  The memo is
+    // the SHARED one (traverse.ts) — response-scoped for respond(),
+    // conversation-scoped across turns, and the same map confluence prices
+    // commonality against; it used to be a private per-climb Map, so a
+    // conversation re-climbed its own repeated regions from cold on every
+    // turn.  A traced response still gets a fresh one — see sharedReachMemo.
+    const reachMemo = sharedReachMemo(ctx);
+    const rvs = ctx.meter
+        ? await ctx.meter.time("climb.voteRegions", () => voteRegions(ctx, query, regions, k, mode, N, reachMemo, td))
+        : await voteRegions(ctx, query, regions, k, mode, N, reachMemo, td);
     // ── Cross-region: DIRECT region-to-region interaction ─────────────────
     // Two regions whose individual climbs land on DIFFERENT contexts leave
     // their JOINT context — the learnt whole that contains BOTH — with no
     // vote.  crossRegionVotes recovers it by the bridge's content-addressed
     // junction ascent (see the note above the function).
-    const cross = await crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td);
+    const crossArgs = () => crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td);
+    const cross = ctx.meter
+        ? await ctx.meter.time("climb.crossRegion", crossArgs)
+        : await crossArgs();
     // A vote SUPERSEDED by exact joint evidence (its bytes literally live
     // inside the joint container, yet it climbed elsewhere — grid aliasing)
     // is dropped, not down-weighted: the joint container explains it away.
@@ -201,7 +234,17 @@ export function collectRegions(ctx, query) {
     foldTree(ctx, perceive(ctx, query), 0, (n, start, end, node) => {
         if (n.kids === null)
             return;
-        if (!dominates(end - start, query.length) || regions.length === 0) {
+        // The dominance filter is about WRAPPERS, not about size.  A chunk is the
+        // smallest grouped unit — it wraps no other region — so it can never be the
+        // "broad, non-discriminative wrapper" this rule exists to exclude, however
+        // much of a short query it happens to cover.  Testing it by span alone was
+        // safe only while chunks were exactly W bytes: content-defined segments run
+        // up to the keyring's seat count, so on a 15-byte query the 8-byte segment
+        // "is frigi" counted as dominant and was discarded, leaving CAST one point
+        // of attention where it needs two (test/29 D1/D2).  Composites are still
+        // filtered exactly as before.
+        if (isChunk(n) || !dominates(end - start, query.length) ||
+            regions.length === 0) {
             regions.push({
                 v: n.v,
                 start,
@@ -210,15 +253,40 @@ export function collectRegions(ctx, query) {
                 known: node !== null,
             });
         }
+        // MEASURED AND REFUTED — subdividing a long segment into W-scale tiles.
+        // A content segment runs from W−1 up to the keyring's seat count (2W) and
+        // folds FLAT, so its only sub-units are single bytes; the grid's regions
+        // were always exactly W.  Offering each segment's W-byte tiles as extra
+        // regions (gists only, no stored nodes, anchored on the segment's own
+        // content-defined start so invariance is kept) does restore that finer
+        // grain: on `How is ice like steel?` the climb went from ONE ranked anchor
+        // to three, and test/33's own CAST-candidate spread was recovered.
+        //
+        // It is still wrong, and net worse (measured: test/29 went 9/2 to 7/4).
+        // canonicalWindows governs EXACT identity lookup, which recognition
+        // already probes at every offset — it says nothing about the grain of an
+        // approximate gist, so "the write side's unit scale" was two machineries
+        // conflated.  What the tiles actually do is reintroduce a fixed stride
+        // inside the segment, and the extra votes reorder the climb: on
+        // `How is Shakespeare like Leonardo da Vinci?` the short name deposits
+        // outranked the exemplar sentences, claimed their aligned runs first, and
+        // left the sentences CAST needs with no free run at all (C2, C3).  A
+        // region must come from the fold, not from a stride over it.
     });
     return regions;
 }
 export async function voteRegions(ctx, query, regions, k, mode, N, reachMemo, td) {
+    if (ctx.meter)
+        ctx.meter.climbRegions += regions.length;
     const regionSaturated = new Array(regions.length).fill(false);
     const regionVotes = [];
     const regionVoter = ctx.trace ? regions.map(() => null) : [];
+    const W = ctx.space.maxGroup;
     for (let ri = 0; ri < regions.length; ri++) {
-        const { v, start, end, chunk, known } = regions[ri];
+        // `v`/`start`/`end` are rebindable: a long approximate segment may vote
+        // with the sub-span that actually carries its evidence — see below.
+        let { v, start, end } = regions[ri];
+        const { chunk, known } = regions[ri];
         // Trace-only bookkeeping for this region — allocated only under `td`
         // (i.e. only when ctx.trace is set); see ConsensusRegionTrace/
         // RegionOutcome (spec §4).  `examinedIds` tracks distinct ANN hits
@@ -259,10 +327,10 @@ export async function voteRegions(ctx, query, regions, k, mode, N, reachMemo, td
         // the resonate() call for most exact regions — the single largest
         // remaining inference sink — with the anchor choice unchanged (the
         // canonical branch already ignored hits[0]).
-        const canonicalId = chunk
+        let canonicalId = chunk
             ? canonicalChunkId(ctx, query.subarray(start, end), N, reachMemo)
             : null;
-        const canonicalUsable = canonicalId !== null &&
+        let canonicalUsable = canonicalId !== null &&
             (ctx.store.hasParents(canonicalId) ||
                 ctx.store.hasContainers(canonicalId));
         let hits = null;
@@ -273,6 +341,74 @@ export async function voteRegions(ctx, query, regions, k, mode, N, reachMemo, td
             }
             return hits;
         };
+        // A DILUTED SEGMENT VOTES WITH THE SPAN THAT CARRIES ITS EVIDENCE.
+        //
+        // A content segment runs up to the keyring's seat count and folds FLAT, so
+        // its gist superposes every one of its bytes: an entity inside a longer
+        // segment is averaged together with whatever scaffolding shares the
+        // segment, and the resonance reads the average.  Measured on
+        // `How is ice like steel?` against a store holding `Steel is hard`: the
+        // segment `ike stee` resonates to `Ice is c` at 0.297 — the WRONG deposit —
+        // with `Steel ` fourth at 0.123, while the sub-span `stee` resonates to
+        // `Steel ` at 0.627.  The evidence is there; the whole-segment read cannot
+        // see it, and `Steel is hard` received no vote at all (test/29 C1).
+        //
+        // Entered only after the EXACT path has already failed — a chunk with a
+        // usable canonical identity has a content-addressed handle on its own bytes
+        // and needs no estimator at all — so this is honest degradation, not extra
+        // work on regions that already resolved.  The candidates are the segment's
+        // two EDGE sub-spans at the write side's own unit scale (W) — the scale
+        // `canonicalWindows` interns, and the only one at which a sub-span could
+        // carry a stored identity; a segment of W or less has no interior at all.
+        // Edges because a content cut lands INSIDE a unit, so the remnant it split
+        // sits against the cut: `steel` is cut after `stee`.  Offering every
+        // interior offset instead was measured and is worse — it re-anchors
+        // segments on spans no boundary ever separated, and broke three of
+        // test/17's vote-distribution and root-count assertions (428/1 → 424/5).
+        //
+        // Selection is by the SAME quantity the region's vote is weighted by —
+        // score² · idf — never by score alone: the scaffolding window `is i`
+        // resonates at 0.832, far above `stee`, and is worth nothing because its
+        // reach is the whole corpus.  Nothing new is being measured here; the
+        // choice the code did not previously make is made with the criterion it
+        // already uses.  The region's SPAN narrows with its gist, so breadth,
+        // clusters and cross-region pairing all see where the evidence really sits.
+        if (!canonicalUsable && chunk && !known && end - start > W) {
+            const weigh = (h) => {
+                const r = edgeAncestors(ctx, h.id, N, reachMemo);
+                if (r.saturated || r.roots.length === 0)
+                    return null;
+                const idf = Math.log(N / Math.max(1, r.contextsReached));
+                if (idf <= 0)
+                    return null;
+                return { w: h.score * h.score * idf, id: h.id };
+            };
+            // The whole-segment candidate reuses the ranking the region needs
+            // anyway, so only the two edge probes are new work.
+            const scoreOf = async (gist) => {
+                const h = await ctx.store.resonate(gist, 1);
+                return h.length === 0 ? null : weigh(h[0]);
+            };
+            const h0 = await ensureHits();
+            let best = h0.length > 0 ? weigh(h0[0]) : null;
+            let bestSpan = null;
+            for (const s0 of [start, end - W]) {
+                const sub = gistOf(ctx, query.subarray(s0, s0 + W));
+                const cand = await scoreOf(sub);
+                if (cand !== null && (best === null || cand.w > best.w)) {
+                    best = cand;
+                    bestSpan = [s0, s0 + W, sub];
+                }
+            }
+            if (bestSpan !== null) {
+                [start, end, v] = bestSpan;
+                hits = null; // the whole-segment ranking no longer describes this span
+                canonicalId = canonicalChunkId(ctx, query.subarray(start, end), N, reachMemo);
+                canonicalUsable = canonicalId !== null &&
+                    (ctx.store.hasParents(canonicalId) ||
+                        ctx.store.hasContainers(canonicalId));
+            }
+        }
         const canonicalFailed = chunk && canonicalId === null;
         let voterId;
         let score;
@@ -539,6 +675,9 @@ export function poolVotes(ctx, regionVotes, sat, N, td) {
             saturationMaskedVotes: regionVotes.length - eligible.length,
         };
     }
+    // The one hub bound (traverse.ts) — N here IS corpusN, threaded down from
+    // computeAttention.  Read once, not per rule application.
+    const bound = hubBound(ctx);
     const key = (it) => it.kind === "region"
         ? `r${it.ri}`
         : it.kind === "anchor"
@@ -569,13 +708,14 @@ export function poolVotes(ctx, regionVotes, sat, N, td) {
             // region's vote across its FULL corpus-sized fan-in yields O(corpus)
             // rule applications per region and near-zero per-target weight anyway.
             // Cap the redistribution at the first √N contexts (insertion order,
-            // the same convention chooseNext caps by).
-            const hubBound = Math.ceil(Math.sqrt(N));
+            // the same convention chooseNext caps by).  Hoisted out of the
+            // generator: `rules` is invoked once per popped item, and this used to
+            // re-derive the bound on every one of them.
             for (const r of rv.roots) {
                 // CAPPED read: only the first hubBound targets are ever credited, so
                 // only they are read — a common continuation's full reverse fan-in
                 // is corpus-sized and is never materialised.
-                const pv = ctx.store.prevFirst(r, hubBound);
+                const pv = ctx.store.prevFirst(r, bound);
                 const isAnswer = pv.length > 0 && !ctx.store.hasNext(r);
                 const targets = isAnswer ? pv : [r];
                 for (const t of targets) {
@@ -619,7 +759,15 @@ export function poolVotes(ctx, regionVotes, sat, N, td) {
                 const rv = regionVotes[p0.ri];
                 breadthSum += rv.absorbed ?? 1;
                 premises.push({ kind: "form", span: [rv.start, rv.end] });
-                spans.push([rv.start, rv.end]);
+                // A vote knows where its own evidence sits: `parts` when it stands on
+                // several separate places (a joint binding), the merged span
+                // otherwise.  See RegionVote.parts.
+                if (rv.parts !== undefined) {
+                    for (const [s, e] of rv.parts)
+                        spans.push([s, e]);
+                }
+                else
+                    spans.push([rv.start, rv.end]);
             }
             regionSupport.set(pc.item.id, breadthSum);
             regionSpans.set(pc.item.id, spans);
@@ -867,15 +1015,40 @@ function sameRoots(a, b) {
 }
 export function canonicalChunkId(ctx, regionBytes, N, reachMemo) {
     const len = Math.min(regionBytes.length, ctx.space.maxGroup);
+    // WHICH window anchors a region is decided by reach, not by position.  This
+    // used to return at the FIRST offset that matched, which was indistinguishable
+    // from correct while every region was exactly W bytes — there was only one
+    // offset.  A content-defined segment is longer, and its first window is
+    // whatever happens to start it: for "is frigi" that is " is ", pure
+    // scaffolding, which reaches every context, saturates, and makes the whole
+    // region ABSTAIN.  The region's own content ("frigi") never got a say, and
+    // CAST lost a point of attention it needed (test/29 D1/D2).
+    //
+    // So scan every offset and prefer an anchor that still discriminates: not
+    // saturated, and among those the one reaching the FEWEST contexts (§2.7,
+    // corpus-global).  Only when every window in the region saturates does the
+    // old generalising choice stand — there is then no discriminative anchor to
+    // find, and abstaining is the honest outcome.
+    let discId = null;
+    let discReached = Infinity;
+    let fallback = null;
     for (let off = 0; off + len <= regionBytes.length; off++) {
         const ids = leafIdRun(ctx, regionBytes, off, off + len);
+        // An unknown byte disqualifies THIS window, not the region.  This used to
+        // abandon the whole region on the first unseen byte, which was
+        // indistinguishable from correct while regions were exactly W bytes — there
+        // was one window, so failing it was failing the region.  A content-defined
+        // segment holds several windows, and a single unknown byte near its start
+        // was silently costing the region its anchor entirely.
         if (ids === null)
-            return null;
+            continue;
         const flatId = ctx.store.findBranch(ids);
         if (flatId === null)
             continue;
         if (len < 2)
             return flatId;
+        // Within one window, the widest reach is still the right CANONICAL
+        // identity — a chunk's anchor should be its most general stable form.
         let bestId = flatId;
         let bestReach = edgeAncestors(ctx, flatId, N, reachMemo);
         for (let k2 = 1; k2 < len; k2++) {
@@ -890,9 +1063,18 @@ export function canonicalChunkId(ctx, regionBytes, N, reachMemo) {
                 bestReach = shortReach;
             }
         }
-        return bestId;
+        if (fallback === null)
+            fallback = bestId;
+        if (!bestReach.saturated && bestReach.contextsReached < discReached) {
+            discId = bestId;
+            discReached = bestReach.contextsReached;
+            // Nothing can discriminate better than reaching ONE context, so the scan
+            // stops there rather than pricing the rest of the segment's windows.
+            if (discReached <= 1)
+                break;
+        }
     }
-    return null;
+    return discId ?? fallback;
 }
 export function naturalBreak(votes) {
     if (votes.length <= 1)
@@ -1079,6 +1261,15 @@ function betterProposal(a, b) {
  *  ANN-query each, merge proposals by candidate id, and validate the winner
  *  through the SAME structural gates every other tier answers to (saturation,
  *  roots, IDF, contrastive margin).  Returns null when nothing survives. */
+/** {@link structuralResonance}, charged to its own profiling phase — it is
+ *  the halo-mediated arm of the cross-region ladder and the one part of it
+ *  that resonates. */
+async function meteredStructuralResonance(...args) {
+    const ctx = args[0];
+    return ctx.meter
+        ? await ctx.meter.time("climb.structuralResonance", () => structuralResonance(...args))
+        : await structuralResonance(...args);
+}
 export async function structuralResonance(ctx, query, ra, rb, sides, siblingGistMemo, k, N, reachMemo, 
 /** Each side's OWN individual climb roots (from voteRegions), when it cast
  *  one — the self-evidence backstop structural-resonance needs and the
@@ -1243,7 +1434,19 @@ async function crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td) {
     // one side is always individually discriminative.
     //
     // Only MAXIMAL spans compose: a span contained in another candidate is a
-    // fragment of that candidate's evidence, never independent of it.
+    // fragment of that candidate's evidence, never independent of it — but
+    // containment alone does not establish that relation.  An APPROXIMATE
+    // container (a fold segment whose gist merely resonated) does not hold the
+    // evidence of an EXACT one (a recognised site, content-addressed): its
+    // bytes straddle the site rather than explain it, so calling the site a
+    // fragment of it discards the only exact reading of those bytes.  Measured:
+    // on `blue then square` the segment `blue t` swallowed the site `blue`,
+    // leaving one candidate and no pair, while on `red then circle` the
+    // segment happened to end at `red `'s edge and the same query shape
+    // composed — the outcome turned on where a cut fell.  This is the same
+    // discipline the between-region gate below already states: an approximate
+    // region climbing "somewhere" is ordinary noise, not evidence.
+    //
     // Shared across every cross-region probe in this climb: a sibling
     // successfully reconstructed while probing one pair must not be read and
     // perceived again while probing another pair in the same climb.
@@ -1268,7 +1471,8 @@ async function crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td) {
     const cand = eligible.filter((x) => !eligible.some((y) => y !== x &&
         regions[y].start <= regions[x].start &&
         regions[x].end <= regions[y].end &&
-        regions[y].end - regions[y].start > regions[x].end - regions[x].start));
+        regions[y].end - regions[y].start > regions[x].end - regions[x].start &&
+        (regions[y].known || !regions[x].known)));
     const none = { votes: [], superseded: new Set() };
     if (td) {
         td.crossRegionSummary = {
@@ -1496,7 +1700,7 @@ async function crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td) {
                     }
                     const ownRootsA = rvs.votes.find((v) => v.start === ra.start && v.end === ra.end)?.roots;
                     const ownRootsB = rvs.votes.find((v) => v.start === rb.start && v.end === rb.end)?.roots;
-                    structuralPick = await structuralResonance(ctx, query, ra, rb, sides, siblingGistMemo, k, N, reachMemo, ownRootsA, ownRootsB, resonanceTrace);
+                    structuralPick = await meteredStructuralResonance(ctx, query, ra, rb, sides, siblingGistMemo, k, N, reachMemo, ownRootsA, ownRootsB, resonanceTrace);
                 }
                 if (structuralPick === null) {
                     pushProbe(reasons.length > 0 ? "resonance-ineligible" : "resonance-rejected");
@@ -1646,10 +1850,27 @@ async function crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td) {
                 spanStart = Math.min(spanStart, regions[ei].start);
                 spanEnd = Math.max(spanEnd, regions[ei].end);
             }
-            consumed.add(cand[a]);
-            consumed.add(cand[b]);
-            for (const ei of bestExtras)
-                consumed.add(ei);
+            // CONSUMPTION IS FOR CONTAINER-BACKED EVIDENCE ONLY.  Consuming a
+            // candidate says "its evidence is already composed at full joint
+            // strength, re-pairing it would vote the same container twice" — a
+            // claim only a real container can make.  A structural-resonance pick
+            // has none (see above: it is NOT a Junction), so consuming its
+            // endpoints locks up candidates on the strength of an ANN guess and
+            // stops genuine evidence from ever composing them.  Measured: on
+            // `greet reply-greet then red then circle` the pair
+            // `reply-greet` ▸ `red` resonated to `red square` and consumed `red`,
+            // after which `red` ▸ `circle` was never probed and the exact junction
+            // `red circle` — a stored whole, sitting right there — went unfound.
+            // This is spec §15's asymmetry (only exact DAG evidence may explain
+            // ordinary votes away) applied to the other way a tier can silence
+            // evidence.  Both votes now stand and pooling decides between them,
+            // which is what the mechanism market is for.
+            if (structuralPick === null) {
+                consumed.add(cand[a]);
+                consumed.add(cand[b]);
+                for (const ei of bestExtras)
+                    consumed.add(ei);
+            }
             // EXPLAINING AWAY — see the block comment above the function.  Byte
             // containment in the joint container is the relatedness test (the
             // vote's bytes are literally part of the learnt whole), and FULL root
@@ -1697,6 +1918,16 @@ async function crossRegionVotes(ctx, query, regions, rvs, k, N, reachMemo, td) {
                 w,
                 wFocus: w,
                 absorbed: 1 + explainedAway,
+                // The places this junction actually stands on — its two endpoints and
+                // any N-ary extras, NOT the merged span [spanStart, spanEnd], which
+                // swallows the gap and reads as one neighbourhood.  See
+                // RegionVote.parts.
+                parts: [cand[a], cand[b], ...bestExtras]
+                    .map((ri) => [
+                    regions[ri].start,
+                    regions[ri].end,
+                ])
+                    .sort((x, y) => x[0] - y[0]),
             });
             pushProbe("accepted");
             if (td) {

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

@@ -26,5 +26,14 @@ export interface BridgeHit {
 export declare function dismissedKnownContent(ctx: MindContext, query: Uint8Array, spans: ReadonlyArray<readonly [number, number]>): boolean;
 /** Recall's corroborated-substitution bridge — see the module comment.
  *  Returns the best bridged grounding proposal, or null. */
-export declare function substitutionBridge(ctx: MindContext, query: Uint8Array, proposed?: ReadonlyArray<number>): Promise<BridgeHit | null>;
+/** `proposed` is a THUNK, not a list: the bridge's own cheap gates (the
+ *  two-quantum query floor and the O(|query|) stored-window anchor scan)
+ *  decide whether ANY candidate can be aligned, and they need no proposals
+ *  to do it.  Resolving the caller's proposals eagerly meant recall paid its
+ *  exhaustive whole-index resonance — the most expensive single act on the
+ *  refusal path — for every query, including the ones whose windows the
+ *  store has never seen and which the anchor scan rejects outright.  Same
+ *  investment discipline the mechanism floors follow (AGENTS §2.6): never
+ *  compute a shared analysis just to discard it. */
+export declare function substitutionBridge(ctx: MindContext, query: Uint8Array, proposed?: () => Promise<ReadonlyArray<number>>): Promise<BridgeHit | null>;
 export {};