@hviana/sema 0.7.9 → 0.8.1

package/test/90-connector-read-cap.test.mjs

@@ -7,10 +7,10 @@
 // substring search, so it needs the candidate's bytes; it used to reconstruct
 // them in FULL via `read(ctx, answer)`, whose maxLen defaults to ALL.
 //
-// AGENTS §2.8, prefix-capped reads: "a candidate that exceeds the cap is
+// bounded-reads.md, prefix-capped reads: "a candidate that exceeds the cap is
 // rejected without reconstructing it — the weave, the junction walks and the
 // bridge all read this way, and uncapped reads there cost seconds per query on
-// a large store."  This probe was the exception, and it runs hubBound(ctx) = √N
+// a large store." This probe was the exception: it runs hubBound(ctx) = √N
 // times PER SITE.
 //
 // The probe's corpus-scale cost was once claimed from a trained-store
@@ -18,14 +18,15 @@
 // prompt" — but that number was measured on a `respond()` query, where the
 // probe does NOT execute (`answeredSpans` is empty there, so the enclosing
 // guard returns first).  It is therefore not attributable to the probe and is
-// not repeated here (§2.16: a comment asserting a measurement inherits Gate 1).
+// not repeated here (a comment asserting a measurement inherits Gate 1).
 // The probe runs only on a multi-turn `respondTurn` response; its benefit there
 // is still unmeasured.
 //
-// WHAT THIS PINS.  The cap cannot reduce the read COUNT — only a semantic change
-// could (see below).  It bounds each read by the QUERY, which is what §2.8 asks
-// and what rescues a SHORT query: candidates averaged 231 B reconstructed
-// against a 3-byte prompt.  So the invariant here is per-read SIZE.
+// WHAT THIS PINS. The cap cannot reduce the read COUNT — only a semantic change
+// could (see below). It bounds each read by the QUERY, which is what
+// bounded-reads.md asks and what rescues a SHORT query: candidates averaged 231
+// B reconstructed against a 3-byte prompt. So the invariant here is per-read
+// SIZE.
 //
 // It is measured by calling `resolveConnectors` DIRECTLY and diffing the meter
 // across it.  A whole-response counter cannot express this: `bytesRead` sums
@@ -121,7 +122,8 @@ test("connector probe reads by the query, not by the learnt continuation", async
       `the connector probe averaged ${perRead.toFixed(0)} B per read for a ` +
         `${QUERY.length} B query — a candidate longer than the query cannot ` +
         `occur inside it, so it must be rejected on an overflow probe of ` +
-        `${QUERY.length + 1} B, not reconstructed in full (AGENTS §2.8)`,
+        `${QUERY.length + 1} B, not reconstructed in full ` +
+        `(bounded-reads.md)`,
     );
   } finally {
     mind.endResponse();

package/test/93-regime-prediction.test.mjs

@@ -1,17 +1,17 @@
 // 93-regime-prediction.test.mjs — the retrieval/composition regime (R8) is
 // exposed as a structured trace step, without changing inference.
 //
-// After the FIRST mechanism runs (cover, which §2.6 places first and floors at
-// 0), the market's whole outcome is already determined by the one cost ladder:
-// the consensus climb runs exactly when `worthRunning(2 * STEP)` is true —
-// CAST (floor 2·STEP) is the cheapest mechanism that first-touches it.  An
-// incumbent at or below that floor prunes CAST and, with it, the climb
+// After the FIRST mechanism runs (cover, which mechanism-market.md places first
+// and floors at 0), the market's whole outcome is already determined by the one
+// cost ladder: the consensus climb runs exactly when `worthRunning(2 * STEP)`
+// is true — CAST (floor 2·STEP) is the cheapest mechanism that first-touches
+// it. An incumbent at or below that floor prunes CAST and, with it, the climb
 // (retrieval); anything above — or no incumbent — runs the full market and the
-// climb (composition).  The step is purely observational: it is built only
-// under a trace (optional-chaining short-circuits it otherwise), and it never
-// alters which candidate wins.  The assertions here check the payload's
-// STRUCTURE and its consistency with the actual market outcome, never that
-// inference itself changed.
+// climb (composition). The step is purely observational: it is built only under
+// a trace (optional-chaining short-circuits it otherwise), and it never alters
+// which candidate wins. The assertions here check the payload's STRUCTURE and
+// its consistency with the actual market outcome, never that inference itself
+// changed.
 
 import { test } from "node:test";
 import assert from "node:assert/strict";

package/test/94-cross-region-budget.test.mjs

@@ -1,7 +1,7 @@
 // 94-cross-region-budget.test.mjs — the cross-region junction ladder shares ONE
 // k·W allowance per evidence tier once atoms are hubs, instead of letting each
-// candidate pair spend its own √N·W drift budget (attention.ts crossRegionVotes,
-// §2.17's derived gate = traverse.atomIsHub).
+// candidate pair spend its own √N·W drift budget (attention.ts
+// crossRegionVotes, saturation.md's derived gate = traverse.atomIsHub).
 //
 // This is a PERFORMANCE regression test, not a behaviour test: the shared
 // budget is byte-identical at every scale — a pair whose container is not

package/test/95-wide-resonance-removed.test.mjs

@@ -4,13 +4,14 @@
 // pipeline-mechanism.ts's REMOVED note).
 //
 // This is a PERFORMANCE regression test, not a behaviour test: the wide list
-// was a PROPOSAL source whose consumers byte-verify every candidate (§2.3), so
-// removing it is byte-identical wherever the bounded sources supply the same
-// candidate set — and the meter's phase map is the only observable that says
-// whether the exhaustive machinery still exists.  Red-on-revert: re-adding
-// wideResonance re-creates the `wideResonance` phase (and, when the query's
-// top hit clears conceptThreshold, a full-index ANN scan inside it), so the
-// phase-absence assertion below fails.
+// was
+// a PROPOSAL source whose consumers byte-verify every candidate
+// (exact-vs-approximate.md), so removing it is byte-identical wherever the
+// bounded sources supply the same candidate set — and the meter's phase map is
+// the only observable that says whether the exhaustive machinery still exists.
+// Red-on-revert: re-adding wideResonance re-creates the `wideResonance` phase
+// (and, when the query's top hit clears conceptThreshold, a full-index ANN scan
+// inside it), so the phase-absence assertion below fails.
 
 import { test } from "node:test";
 import assert from "node:assert/strict";

package/test/96-bytes-walk-termination.test.mjs

@@ -92,12 +92,12 @@ test("bytes() terminates when its memo cannot hold the working set", async () =>
 });
 
 test("differsByOneWindow's reads are capped — no ALL-sentinel read on deposit", async () => {
-  // §2.8: the near-dedup byte check used to open with
+  // bounded-reads.md: the near-dedup byte check used to open with
   // `bytesPrefix(k, Number.MAX_SAFE_INTEGER)` — the ALL sentinel, which routes
-  // to the full materialising `bytes()` — and only THEN compare lengths.  A
+  // to the full materialising `bytes()` — and only THEN compare lengths. A
   // candidate the length test was about to reject had already been rebuilt byte
   // for byte, and that read is what dragged the deposit path into the walk
-  // above.  Lengths now decide first, from the `contentLen` memo.
+  // above. Lengths now decide first, from the `contentLen` memo.
   const src = await import("node:fs").then((fs) =>
     fs.readFileSync(new URL("../src/store.ts", import.meta.url), "utf8")
   );

package/test/99-fact-join.test.mjs

@@ -97,3 +97,41 @@ test("naming the intermediate does not need derive-through — the cover reads i
   );
   await store.close();
 });
+
+/** The TRAP fixture: the query's OWN subject carries the asked relation too, so
+ *  a join that follows the subject answers about the subject. */
+const TRAP_CHAIN = [
+  ["Eiffel Tower country", "The country of Eiffel Tower is France."],
+  ["France capital", "The capital of France is Paris."],
+  ["France", "The capital of France is Paris."],
+  ["Eiffel Tower capital", "The capital of Eiffel Tower is Berlin."],
+  ["Eiffel Tower", "The country of Eiffel Tower is France."],
+];
+
+async function trappedFlip() {
+  const store = new SQliteStore({ path: ":memory:", D: 1024 });
+  const mind = new Mind({ seed: 7, store });
+  await mind.ingest(TRAP_CHAIN);
+  await mind.ingest(Array.from({ length: 4300 }, (_, i) => filler(i)));
+  return { store, mind };
+}
+
+test("the join answers about the entity the query did NOT name, not the query's own subject", async () => {
+  // MEASURED on the pre-change tree: the answer was "The capital of Eiffel
+  // Tower country is Berlin." — the join followed the query's OWN subject
+  // (Eiffel Tower), which carries a "capital" fact of its own, instead of the
+  // entity the produced fact introduces (France).  Both candidates are contexts
+  // joined by the same relation, so only the preference decides.
+  const { store, mind } = await trappedFlip();
+  const moves = [];
+  const out = await mind.respondText(
+    "Eiffel Tower country capital",
+    (s) => moves.push(s.mechanism[s.mechanism.length - 1]),
+  );
+  assert.equal(out.trim(), "The capital of France is Paris.");
+  assert.ok(
+    !out.includes("Eiffel Tower"),
+    `the answer must be about the inferred entity, got ${JSON.stringify(out)}`,
+  );
+  await store.close();
+});