memhtml 0.2.2 → 0.2.3

package/README.md

@@ -410,7 +410,7 @@ envelope. `docs/code-mode.md` is the cookbook, with a measured helper and five r
 | MemoryAgentBench FactConsolidation single-hop (26KB to 1.1MB stores) | 92% to 97% | ~60% at 26KB only |
 | MemoryAgentBench FactConsolidation multi-hop | 37% to 49% | ≤7% all methods |
 | BEAM Contradiction Resolution (100K split, 40 probes) | 43.8% mean | 0% to 5% all systems |
-| LongMemEval-S (25-instance smoke) | 68% | ~55% to 65% typical agent baselines |
+| LongMemEval-S (full 500, judged 2026-08-07) | 67.0% | ~55% to 65% typical agent baselines |
 
 Read the cross-judge numbers as reference points rather than as a ranking: the judges here are verbatim
 prompt ports running haiku-4.5, where the papers used gpt-4o and gpt-4.1-mini. `ROADMAP.md` carries these
@@ -422,7 +422,7 @@ numbers and the horizons they rank.
 $MEMHTML_ROOT/                        # its own git repo, one global memory store
   projects/<workspace-slug>/      # a workspace IS a directory. There is no workspaces table.
   areas/<area-slug>/              # ongoing responsibilities
-  areas/arcs/                     # behavioural arcs (system-written by sleep only)
+  areas/arcs/                     # behavioral arcs (system-written by sleep only)
   areas/inbox/                    # where an unplaceable memory lands
   resources/<topic>/
   resources/people/<person>.html  # the person plane
@@ -441,10 +441,12 @@ The layering is strict and TypeScript project references enforce it. `@memhtml/c
 `@memhtml/domain` import `effect` and nothing else, and a test reads `domain`'s own `dist` to confirm it
 names no database driver, no SDK, and no `node:fs`.
 
-None of them is published. All twelve are `private`, and `mise run package:assemble` bundles them into
-the single `memhtml` package that carries the two binaries — so the table below is a map of the source,
-not a list of things to install. `RELEASING.md` covers how the artifact is built and what must stay
-outside the bundle.
+None of them is published. Every workspace package is `private`, and `mise run package:assemble`
+bundles the libraries and the binary-bearing apps into the single `memhtml` package that carries the
+two binaries — the docs site and the integration-test harness stay outside the bundle
+(`tsdown.config.ts` names the exact set). The table below is a map of the source, not a list of
+things to install. `RELEASING.md` covers how the artifact is built and what must stay outside the
+bundle.
 
 | Package | What it owns |
 |---|---|
@@ -459,6 +461,8 @@ outside the bundle.
 | `@memhtml/eval` | The fixture corpus generator and the refusable discrimination gate. |
 | `@memhtml/cli` | The `memhtml` binary, the envelope contract, and the one composition root. |
 | `@memhtml/mcp` | The `memhtml-mcp` stdio server: 14 tools, 2 resources. |
+| `@memhtml/consolidator` | The sandboxed eve agent that distills candidate memories from raw transcripts. |
+| `@memhtml/docs` | The documentation site. |
 
 ## Development
 

package/agent/channels/eve.ts

@@ -35,7 +35,7 @@ import { runVerifierConfig } from "../../src/run-auth.js"
  * and eve rejects a token with no `sub` before consulting any matcher. That is what keeps a secret
  * leaked into some other eve app's environment from cross-authenticating here.
  *
- * ## The bind address STAYS, as defence in depth
+ * ## The bind address STAYS, as defense in depth
  *
  * `eve start` binds ALL INTERFACES by default (node_modules/eve/docs/reference/cli.md, `eve start
  * --host`), so `src/client.ts` still spawns with `--host 127.0.0.1` from a constant that takes no

package/dist/{dist-DBdR0zt7.mjs → dist-Dj-MYf9q.mjs}

@@ -1,3 +1,3 @@
-import { A as MAX_QUOTE_CHARS, C as ConsolidationResult, D as ConsolidatorUnavailable, E as ConsolidatorRunFailed, F as toJsonSchema, I as ungroundedEvidenceReason, M as credentialsMissingReason, N as hasConsolidatorCredentials, O as MAX_CLAIM_CHARS, P as isConsolidationKind, S as ConsolidationPayload, T as ConsolidatorCredentialsMissing, _ as readOnlyRootsProblem, a as RUN_SECRET_ENV, b as CandidateEvidence, c as runVerifierConfig, d as SANDBOX_MOUNTS_ENV, f as SandboxMountInvalid, g as pinCorpusSnapshot, h as mountReadOnlyRoots, i as makeConsolidator, j as MAX_TRANSCRIPTS_PER_RUN, k as MAX_GIST_CHARS, l as sameRunSecret, m as encodeSandboxMounts, n as consolidatorLive, o as mintRunSecret, p as decodeSandboxMounts, r as guestPathFor, s as runSecretFrom, t as Consolidator, u as signRunToken, v as CONSOLIDATION_KINDS, w as ConsolidatorContractViolation, x as CandidateMemory, y as CONSOLIDATION_OUTPUT_JSON_SCHEMA } from "./dist-CI2-0MRk.mjs";
+import { A as MAX_QUOTE_CHARS, C as ConsolidationResult, D as ConsolidatorUnavailable, E as ConsolidatorRunFailed, F as toJsonSchema, I as ungroundedEvidenceReason, M as credentialsMissingReason, N as hasConsolidatorCredentials, O as MAX_CLAIM_CHARS, P as isConsolidationKind, S as ConsolidationPayload, T as ConsolidatorCredentialsMissing, _ as readOnlyRootsProblem, a as RUN_SECRET_ENV, b as CandidateEvidence, c as runVerifierConfig, d as SANDBOX_MOUNTS_ENV, f as SandboxMountInvalid, g as pinCorpusSnapshot, h as mountReadOnlyRoots, i as makeConsolidator, j as MAX_TRANSCRIPTS_PER_RUN, k as MAX_GIST_CHARS, l as sameRunSecret, m as encodeSandboxMounts, n as consolidatorLive, o as mintRunSecret, p as decodeSandboxMounts, r as guestPathFor, s as runSecretFrom, t as Consolidator, u as signRunToken, v as CONSOLIDATION_KINDS, w as ConsolidatorContractViolation, x as CandidateMemory, y as CONSOLIDATION_OUTPUT_JSON_SCHEMA } from "./dist-t84Q_98w.mjs";
 
 export { CONSOLIDATION_KINDS, CONSOLIDATION_OUTPUT_JSON_SCHEMA, CandidateEvidence, CandidateMemory, ConsolidationPayload, ConsolidationResult, Consolidator, ConsolidatorContractViolation, ConsolidatorCredentialsMissing, ConsolidatorRunFailed, ConsolidatorUnavailable, MAX_CLAIM_CHARS, MAX_GIST_CHARS, MAX_QUOTE_CHARS, MAX_TRANSCRIPTS_PER_RUN, RUN_SECRET_ENV, SANDBOX_MOUNTS_ENV, SandboxMountInvalid, consolidatorLive, credentialsMissingReason, decodeSandboxMounts, encodeSandboxMounts, guestPathFor, hasConsolidatorCredentials, isConsolidationKind, makeConsolidator, mintRunSecret, mountReadOnlyRoots, pinCorpusSnapshot, readOnlyRootsProblem, runSecretFrom, runVerifierConfig, sameRunSecret, signRunToken, toJsonSchema, ungroundedEvidenceReason };

package/dist/{dist-0IU3R2cD.mjs → dist-dfrcDFad.mjs}

@@ -1,4 +1,4 @@
-import { $ as MEMORY_EXTENSION, B as ModelUnavailable, Ct as slugify, H as StorageFailure, J as relClassFor, L as DirtyTree, Q as INBOX_DIR, R as InvalidMemory, St as filenameFor, U as WriteConflict, V as PathNotFound, W as EdgeRel, X as relTokenFor, Y as relForToken, Z as ARCS_DIR, _t as TaskStatus, at as memoryPathFor, bt as parseEntity, ct as placementFor, dt as MEMORY_TYPES, et as PEOPLE_DIR, ft as MemoryStatus, gt as TASK_STATUSES, ht as PERSON_ENTITY_PREFIX, it as isValidMemoryPath, lt as Confidence, mt as PARA_BUCKETS, nt as archivePathFor, ot as normalizePath, pt as MemoryType, q as isEdgeRel, rt as isArchivePath, st as paraBucketOf, ut as Importance, vt as WRITABLE_MEMORY_TYPES, wt as withCollisionOrdinal, xt as SLUG_FALLBACK, yt as isTaskStatus, z as LlmContractViolation } from "./dist-CI2-0MRk.mjs";
+import { $ as MEMORY_EXTENSION, B as ModelUnavailable, Ct as slugify, H as StorageFailure, J as relClassFor, L as DirtyTree, Q as INBOX_DIR, R as InvalidMemory, St as filenameFor, U as WriteConflict, V as PathNotFound, W as EdgeRel, X as relTokenFor, Y as relForToken, Z as ARCS_DIR, _t as TaskStatus, at as memoryPathFor, bt as parseEntity, ct as placementFor, dt as MEMORY_TYPES, et as PEOPLE_DIR, ft as MemoryStatus, gt as TASK_STATUSES, ht as PERSON_ENTITY_PREFIX, it as isValidMemoryPath, lt as Confidence, mt as PARA_BUCKETS, nt as archivePathFor, ot as normalizePath, pt as MemoryType, q as isEdgeRel, rt as isArchivePath, st as paraBucketOf, ut as Importance, vt as WRITABLE_MEMORY_TYPES, wt as withCollisionOrdinal, xt as SLUG_FALLBACK, yt as isTaskStatus, z as LlmContractViolation } from "./dist-t84Q_98w.mjs";
 import { createRequire } from "node:module";
 import { Config, Context, Effect, Layer, Result, Schedule, Schema } from "effect";
 import { mkdir, mkdtemp, readFile, readdir, rm, stat, writeFile } from "node:fs/promises";
@@ -327,7 +327,7 @@ const pagerank = (nodes, edges, options = {}) => {
 * Communities by label propagation over the edge list read as undirected.
 *
 * Deterministic in place of a seed: nodes start labelled by themselves, sweeps visit them in
-* sorted order, and a node adopts the highest-weighted neighbouring label with the
+* sorted order, and a node adopts the highest-weighted neighboring label with the
 * lexicographically smallest label breaking a tie. The returned labels are canonicalized to
 * the smallest member path of each community, so the partition itself is reproducible and not
 * only the grouping.
@@ -340,15 +340,15 @@ const labelPropagation = (nodes, edges, options = {}) => {
 	const { sorted, folded } = normalize$1(nodes, edges);
 	const minSize = options.minCommunitySize ?? 3;
 	const maxSweeps = options.maxSweeps ?? 100;
-	const neighbours = /* @__PURE__ */ new Map();
+	const neighbors = /* @__PURE__ */ new Map();
 	const link = (from, to, strength) => {
-		const bucket = neighbours.get(from);
+		const bucket = neighbors.get(from);
 		const edge = {
 			src: from,
 			dst: to,
 			strength
 		};
-		if (bucket === void 0) neighbours.set(from, [edge]);
+		if (bucket === void 0) neighbors.set(from, [edge]);
 		else bucket.push(edge);
 	};
 	for (const edge of folded) {
@@ -360,7 +360,7 @@ const labelPropagation = (nodes, edges, options = {}) => {
 		let changed = false;
 		for (const node of sorted) {
 			const weightByLabel = /* @__PURE__ */ new Map();
-			for (const edge of neighbours.get(node) ?? []) {
+			for (const edge of neighbors.get(node) ?? []) {
 				const label = labels.get(edge.dst);
 				if (label === void 0) continue;
 				weightByLabel.set(label, (weightByLabel.get(label) ?? 0) + edge.strength);
@@ -1874,7 +1874,7 @@ const buildProbes = (base, wanted) => {
 				* the cosine. Measured before this was fixed: the kit-free control took FTS rank 1 and vector
 				* rank 3 while its target sat at 4 and 10, on 22 of 36 probes. The gate was failing on
 				* document length instead of on the fact. A control that wins by being terser proves nothing
-				* about discrimination, and a fold that "fixed" it would be tuned against an artefact.
+				* about discrimination, and a fold that "fixed" it would be tuned against an artifact.
 				*
 				* With the kit copied, the pair differs by exactly the flipped token, which is the
 				* high-cosine wrong-fact adversary design §5 asks for.
@@ -1956,7 +1956,7 @@ const ACCESSED_FRACTION = .6;
 *    happens to be some probe's control.
 * 2. **The spread is QUERY-BLIND.** It is a function of the corpus seed and the path order. Nothing
 *    here reads the probe list, so a target's history is whatever its position in the corpus earns it.
-*    A spread that favoured targets would make the gate pass by construction.
+*    A spread that favored targets would make the gate pass by construction.
 *
 * The distribution is a long tail, `1 / (floor + jitter)`, because that is the shape retrieval traffic
 * has: a handful of memories are read constantly and most are read once. A uniform count would make
@@ -4303,7 +4303,7 @@ const text = (result) => result.stdout.toString("utf8");
 /**
 * The service against a repository root. Exported rather than only wrapped in a layer, because every
 * test in this package drives the real git binary against a temp-dir repo. A fake git
-* verifies the shape of these calls and not git's own behaviour, and it is git's behaviour
+* verifies the shape of these calls and not git's own behavior, and it is git's behavior
 * (rename detection, index staging, merge conflict stages) that this package exists to use.
 */
 const makeGit = (root) => ({
@@ -4661,7 +4661,7 @@ const subjectFor = (pending) => pending.length === 1 && pending[0] !== void 0 ?
 const hasProvenance = (entry) => Object.keys(provenanceTrailers(entry.input)).length > 0;
 /**
 * The store over a git service. Exported so tests build it against a temp-dir repo with the
-* real git binary. This package's job IS git's behaviour, so a fake git would verify only that
+* real git binary. This package's job IS git's behavior, so a fake git would verify only that
 * the right strings were assembled and would miss every state transition that matters.
 */
 const makeStore = (git, hooks = {}) => {
@@ -5999,7 +5999,7 @@ const IndexGit = Context.Service("memhtml/IndexGit");
 * `onExcessProperty: "error"` means a column added to the SELECT without being added here is a
 * decode failure, not a silently ignored field. Probed 2026-08-12 on node 24.19.0: `node:sqlite`
 * hands back null-prototype records and `Schema.decodeUnknownEffect` reads them correctly, so the
-* driver's row objects need no normalisation at this seam.
+* driver's row objects need no normalization at this seam.
 */
 /**
 * Every column of `index_state`, in the order `0007_watermark.sql` declares them.
@@ -7264,7 +7264,7 @@ const assembleScope = (scope = {}) => {
 	const types = (scope.memoryTypes ?? []).filter((type) => MEMORY_TYPES.includes(type));
 	if (types.length > 0)
  /**
-	* A caller-named type list is honoured VERBATIM, `task` included. Filtering `task` back out of
+	* A caller-named type list is honored VERBATIM, `task` included. Filtering `task` back out of
 	* an explicit list would make the opt-in unreachable, and there would then be no way to search
 	* tasks at all. The exclusion is a default and not a firewall. (The firewalls in this system are
 	* `edge_class` and the trace tables, and both reject a write rather than defaulting.)
@@ -7860,7 +7860,7 @@ const modelFailure = (modelId, cause) => ModelUnavailable.make({
 * One InvokeModel round trip: send the body, decode the JSON payload. Both the transport
 * rejection and an unparseable payload land on `ModelUnavailable`, because neither one
 * says anything about the model's answer. They say only that no answer arrived. Reading
-* the answer, and judging whether it honours its contract, is the caller's job.
+* the answer, and judging whether it honors its contract, is the caller's job.
 */
 const invokeJson = (client, modelId, body) => Effect.gen(function* () {
 	const response = yield* Effect.tryPromise({
@@ -8928,7 +8928,7 @@ const ArcPlanEntry = Schema.Struct({
 	* slug would be a model-chosen file path.
 	*/
 	slug: Schema.String,
-	/** A concise behavioural-principal name, 3-8 words. */
+	/** A concise behavioral-principal name, 3-8 words. */
 	title: Schema.String,
 	action: ArcAction,
 	/** One or two sentences naming what changed or emerged. */
@@ -8973,34 +8973,34 @@ memory, so when the two claims COULD both be true — different scope, different
 aspect — answer neutral, not contradicts. Rate your confidence honestly and name the specific
 conflicting or compatible claims in the rationale.`;
 /** The arc-triage system prompt: plan only, no content. */
-const ARC_TRIAGE_SYSTEM = `You triage behavioural arcs for an AI agent's long-term memory system. This is the planning pass:
+const ARC_TRIAGE_SYSTEM = `You triage behavioral arcs for an AI agent's long-term memory system. This is the planning pass:
 a second pass writes each arc's content, so your output is only the plan.
 
 - Assign every existing arc an action of update or skip. An arc omitted from the plan stays stale.
-- Propose create only when a genuinely new behavioural pattern emerges that no existing arc covers.
+- Propose create only when a genuinely new behavioral pattern emerges that no existing arc covers.
 - Propose update only when the evidence materially changes or reinforces the arc. Each update costs
   a model call, so skip trivial or redundant evidence.
 - Keep evidenceKeys to the strongest 1-5 supporting memories per arc.
-- Titles are concise behavioural-principal names of 3-8 words.
+- Titles are concise behavioral-principal names of 3-8 words.
 - Rationale is one or two sentences naming what changed or emerged.
 - Leave slug empty on a create.`;
 /** The arc-execute system prompt: one arc's content. */
-const ARC_EXECUTE_SYSTEM = `You write one behavioural arc for an AI agent's long-term memory system. An arc is a self-contained
-behavioural principal — a statement of a pattern, preference, or principle the agent developed
+const ARC_EXECUTE_SYSTEM = `You write one behavioral arc for an AI agent's long-term memory system. An arc is a self-contained
+behavioral principal — a statement of a pattern, preference, or principle the agent developed
 through experience. Arcs are read back in future sessions with no transcript context, so the
 content must stand alone.
 
-- claim is the ONE load-bearing sentence: the principle itself, stated as behaviour to adopt.
-- paragraphs holds 2-12 sentences across one to four paragraphs. Behavioural principles fit at the
+- claim is the ONE load-bearing sentence: the principle itself, stated as behavior to adopt.
+- paragraphs holds 2-12 sentences across one to four paragraphs. Behavioral principles fit at the
   tight end; an operational playbook may span the wider range.
-- Use IF/THEN conditional phrasing for rules, framed positively around the behaviour to adopt.
+- Use IF/THEN conditional phrasing for rules, framed positively around the behavior to adopt.
 - When updating, incorporate both the existing content and the new evidence, preserving knowledge
   that still holds.
-- Keep references like "the evidence" or "recent sessions" out of the text — name the behaviour.
+- Keep references like "the evidence" or "recent sessions" out of the text — name the behavior.
 - The content reads as a stable identity statement, not a changelog.`;
 /** The compress-synthesis system prompt. */
 const COMPRESS_SYSTEM = `You fold a group of related memories into ONE canonical memory for an AI agent's long-term memory
-system. The members are near-neighbours in one community of the memory graph; the canonical replaces
+system. The members are near-neighbors in one community of the memory graph; the canonical replaces
 them, and each member you list in absorbedKeys is archived once the canonical is written.
 
 - claim is the ONE load-bearing sentence the group shares.
@@ -9016,13 +9016,13 @@ const dataBlock = (label, text) => wrapAsData(label, text);
 * The stance judge's user turn for one pair. Both texts are wrapped; neither carries a path.
 *
 * The prompt names no path, no cosine, and no prior verdict, so the model cannot infer which answer
-* the caller is hoping for and cannot recognise a pair it judged last night.
+* the caller is hoping for and cannot recognize a pair it judged last night.
 */
 const stancePrompt = (textA, textB) => `${dataBlock("memory_a", textA)}\n\n${dataBlock("memory_b", textB)}\n\nDo these two memories contradict each other? Give your verdict, your confidence, and a rationale naming the specific claims that conflict or why they are compatible.`;
 /** The arc-triage user turn: the live arcs and the recent evidence, both wrapped. */
-const arcTriagePrompt = (arcsText, evidenceText) => `${dataBlock("current_arcs", arcsText)}\n\n${dataBlock("evidence", evidenceText)}\n\nProduce a triage plan. Assign update or skip to every existing arc, and add a create entry for any genuinely new behavioural pattern the existing arcs do not cover.`;
+const arcTriagePrompt = (arcsText, evidenceText) => `${dataBlock("current_arcs", arcsText)}\n\n${dataBlock("evidence", evidenceText)}\n\nProduce a triage plan. Assign update or skip to every existing arc, and add a create entry for any genuinely new behavioral pattern the existing arcs do not cover.`;
 /** The arc-execute user turn for one arc. `current` is absent on a create. */
-const arcExecutePrompt = (input) => (input.current === void 0 ? `${dataBlock("new_arc_title", input.title)}\n\n` : `${dataBlock("existing_arc", input.current)}\n\n`) + `${dataBlock("evidence", input.evidenceText)}\n\n${dataBlock("triage_rationale", input.rationale)}\n\n` + (input.current === void 0 ? "Synthesize a new behavioural principal from this evidence." : "Update the arc to incorporate the new evidence, preserving existing knowledge that holds.");
+const arcExecutePrompt = (input) => (input.current === void 0 ? `${dataBlock("new_arc_title", input.title)}\n\n` : `${dataBlock("existing_arc", input.current)}\n\n`) + `${dataBlock("evidence", input.evidenceText)}\n\n${dataBlock("triage_rationale", input.rationale)}\n\n` + (input.current === void 0 ? "Synthesize a new behavioral principal from this evidence." : "Update the arc to incorporate the new evidence, preserving existing knowledge that holds.");
 /** The compress user turn for one batch: every member's text, wrapped, under its offered key. */
 const compressPrompt = (members) => `${members.map((member) => dataBlock(`member_${member.key}`, member.text)).join("\n\n")}\n\nFold these memories into one canonical memory. List in absorbedKeys exactly the members whose content the canonical carries forward.`;
 /**
@@ -9081,11 +9081,11 @@ const activeCorpus = (db) => db.all(`SELECT path, memory_type, title, gist, body
             word_count, created_at, updated_at, valid_until, reprieves
      FROM files WHERE archived = 0 ORDER BY created_at ASC, path ASC`);
 /**
-* Per-source top-`k` nearest neighbours above a similarity floor, over first-chunk vectors.
+* Per-source top-`k` nearest neighbors above a similarity floor, over first-chunk vectors.
 *
 * `ordinal = 0` collapses a file to its first chunk, not its best chunk. The format is one
 * fact per file, so almost every file is a single chunk. Taking the first keeps the pair set
-* symmetric, which `min(distance)` over all chunks would not. An asymmetric neighbourhood
+* symmetric, which `min(distance)` over all chunks would not. An asymmetric neighborhood
 * would make `(a, b)` a candidate while `(b, a)` is not, so which of two files was read first
 * would decide whether they merge.
 *
@@ -9094,7 +9094,7 @@ const activeCorpus = (db) => db.all(`SELECT path, memory_type, title, gist, body
 * SQL function over two `Uint8Array` arguments (`packages/index/src/database.ts`) and not a driver
 * builtin with a fixed calling shape.
 */
-const neighbourPairs = (db, options) => {
+const neighborPairs = (db, options) => {
 	const excluded = options.excludeTypes ?? [];
 	const typeFilter = excluded.length === 0 ? "" : ` AND f.memory_type NOT IN (${excluded.map(() => "?").join(", ")})`;
 	return db.all(`WITH vecs AS (
@@ -9555,7 +9555,7 @@ const runRetentionPass = (db, at) => Effect.gen(function* () {
 * `update`/`create` entries cost a second call.
 *
 * **One commit per arc, not one for the phase.** An arc is a standalone assertion about the agent's
-* own behaviour, and a reviewer reads it as one thing; a commit carrying four unrelated arcs is a
+* own behavior, and a reviewer reads it as one thing; a commit carrying four unrelated arcs is a
 * commit nobody reviews. It also means a model failure on the third arc leaves the first two
 * committed, so the per-item isolation reaches the git history and not only the counters.
 *
@@ -10000,7 +10000,7 @@ const confidenceDecay = (env) => Effect.gen(function* () {
 */
 /** The moderate similarity floor a pair must clear to be worth a model call. */
 const CONFLICT_COSINE_FLOOR = .8;
-/** Nearest same-entity neighbours considered per source. */
+/** Nearest same-entity neighbors considered per source. */
 const CONFLICT_PER_SOURCE_K = 5;
 /** Pairs judged per cycle. The model-cost guard. */
 const CONFLICT_CANDIDATE_LIMIT = 200;
@@ -10143,7 +10143,7 @@ const dedupMerge = (env) => Effect.gen(function* () {
 	* The `files_content_hash_active` index carves tasks out for the same reason, so structural and
 	* semantic dedup agree about them.
 	*/
-	const pairs = yield* neighbourPairs(env.deps.db, {
+	const pairs = yield* neighborPairs(env.deps.db, {
 		floor: NEAR_DUPLICATE_THRESHOLD,
 		perSourceK: 5,
 		limit: 100 * 4,
@@ -10714,7 +10714,7 @@ const preflight = (env) => Effect.gen(function* () {
 */
 /** The similarity floor a pair must clear to become a mined `relates_to`. */
 const MINING_COSINE_FLOOR = .85;
-/** Nearest neighbours considered per source file. */
+/** Nearest neighbors considered per source file. */
 const MINING_PER_SOURCE_K = 5;
 /** Pairs mined per cycle. The cost guard on a corpus whose pair space is quadratic. */
 const MINING_SAMPLE_LIMIT = 2e3;
@@ -10726,7 +10726,7 @@ const relationshipMining = (env) => Effect.gen(function* () {
 	* count. The `edges` CHECK cannot refuse it, because `relates_to` under `memory` is a
 	* well-formed edge whatever files sit at its ends.
 	*/
-	const pairs = yield* neighbourPairs(env.deps.db, {
+	const pairs = yield* neighborPairs(env.deps.db, {
 		floor: MINING_COSINE_FLOOR,
 		perSourceK: 5,
 		limit: MINING_SAMPLE_LIMIT,
@@ -10882,7 +10882,7 @@ const headOf = (env) => env.deps.git.revParseHead().pipe(Effect.map((sha) => sha
 * and re-assert the fact deliberately.
 *
 * **Arcs are exempt.** An arc is system-written and carries no meaningful TTL; expiring one on age
-* would delete the agent's own behavioural identity on a schedule.
+* would delete the agent's own behavioral identity on a schedule.
 */
 const reprieve = (env) => Effect.gen(function* () {
 	const expired = (yield* runRetentionPass(env.deps.db, env.at)).scored.filter((entry) => {
@@ -11459,7 +11459,7 @@ const traceConsolidation = (env) => Effect.gen(function* () {
 			skipped,
 			conflicts: conflicted
 		};
-		const commitSha = yield* commitPhase(env, "trace-consolidation", `${conflict === void 0 ? "distil" : "distil (frame conflict)"} ${title}`, counts, commitContextFor(candidate, conflict));
+		const commitSha = yield* commitPhase(env, "trace-consolidation", `${conflict === void 0 ? "distill" : "distill (frame conflict)"} ${title}`, counts, commitContextFor(candidate, conflict));
 		if (commitSha !== null) lastCommit = commitSha;
 		written += 1;
 	}
@@ -12847,4 +12847,4 @@ const latest = (left, right) => left === null ? right : right === null ? left :
 
 //#endregion
 export { STATE_SIDECAR_PATH as $, makeIndexRecorder as A, makeGitPort as B, ModelClientLive as C, EMBED_DIM as D, EmbeddingsLive as E, reinforce as F, STATE_MIGRATIONS_DIR as G, DatabaseService as H, Indexer as I, expandRoot as J, STATE_SCHEMA as K, makeIndexer as L, readWatermark as M, Retrieval as N, EMBED_WATERMARK as O, makeRetrieval as P, STATE_DB_PATH as Q, readIndexState as R, ModelClient as S, Embeddings as T, makeDatabase as U, sanitizeFtsQuery as V, MIGRATIONS_DIR as W, INDEX_DB_PATH as X, makeStore as Y, SLEEP_REPORTS_DIR as Z, unlink as _, parseSidecar as a, commitSubject as at, discriminationGate as b, generateArtifacts as c, isValidDatetime as ct, danglingEdges as d, REINFORCE_SIGNALS as dt, attemptIo as et, publishRows as f, frameKeyOf as ft, meta as g, link as h, makeSleep as i, makeGit as it, persistScanned as j, IndexRecorder as k, accessRows as l, closesFence as lt, hrefFor as m, scanTraceRoot as n, readFileOrNull as nt, renderSidecar as o, checkMemory as ot, applyHeadEdits as p, Store as q, Sleep as r, Git as rt, archivedFormOf as s, setMeta as st, mergeTailExtract as t, initRepo as tt, allPaths as u, fenceOpeningOf as ut, SLEEP_PHASES as v, wrapAsData as w, runDiscrimination as x, isSleepPhase as y, IndexGit as z };
-//# sourceMappingURL=dist-0IU3R2cD.mjs.map
+//# sourceMappingURL=dist-dfrcDFad.mjs.map