@graphorin/memory 0.5.0 → 0.6.0

package/CHANGELOG.md

@@ -1,10 +1,99 @@
 # @graphorin/memory
 
+## 0.6.0
+
+### Minor Changes
+
+- [#136](https://github.com/o-stepper/graphorin/pull/136) [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84) Thanks [@o-stepper](https://github.com/o-stepper)! - Context-engineering adoptions (audit 2026-07-04 Wave C, cluster C4).
+
+  - Compaction failure hardening: one retry with backoff on summarizer failure; an auto-trigger pass that does not shrink the buffer FAILS (compression-loop class); after 3 consecutive failures the auto trigger disables itself until a later successful pass re-arms it.
+  - Recent user messages survive compaction verbatim (`preserveUserMessages`, default 2) - only assistant/tool content is summarized away.
+  - Summary prompt upgrades: handoff-to-another-LLM framing, quote-identifiers-VERBATIM rule, new "Constraints and non-negotiables" section (12 sections, v1.3); template id renamed to `summary-sections` (context-engine-14).
+  - Clearing-tier parity with `clear_tool_uses_20250919`: `clearToolInputs` blanks paired assistant tool-call args; `readResultToolName: null` keeps the externalized-handle placeholder honest when `read_result` is not registered (context-engine-11).
+  - New `reanchorRecentResults` post-compaction hook (+ `ctx.droppedMessages` on the hook context): re-injects the result handles a compaction just dropped, with bounded previews via an optional `readPreview` resolver.
+
+- [#136](https://github.com/o-stepper/graphorin/pull/136) [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84) Thanks [@o-stepper](https://github.com/o-stepper)! - Retrieval trust and quality (audit 2026-07-04 Wave C, cluster C5).
+
+  - Trust-aware retrieval ranking (MINJA defense): search multiplies each fused score by a rank-time trust factor reusing the eviction path's `SalienceWeights` - quarantined-but-included rows x0.3, foreign provenance (tool/imported/reflection/induction) x0.8, first-party UNTOUCHED. Surfaced as the `trust` signal on hits / `explainRecall`; per-call `trustWeighting: 'off'` escape hatch; weights follow `consolidator.salienceWeights`.
+  - Offline fusion-weight fitting: new pure `fitFusionWeights(cases, { grid, k })` + `ndcgAtK` in `@graphorin/memory/search` grid-search `FusionWeights` against labelled queries and report the plain-RRF baseline alongside.
+  - Extraction decontextualization (memory-consolidation-08): each extracted fact must now be a self-contained proposition (pronouns/ellipses resolved, entities inlined).
+  - rerankers.md rewritten: warns against installing a positional `WeightedRRFReranker` as process default (mis-assigns weights under fan-out - memory-retrieval-04), promotes the local cross-encoder as the first learned reranker to reach for, documents the fitting routine and the trust discount.
+
+- [#136](https://github.com/o-stepper/graphorin/pull/136) [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84) Thanks [@o-stepper](https://github.com/o-stepper)! - Deterministic security adoptions (audit 2026-07-04 Wave C, cluster C6).
+
+  - Derived-taint propagation: opt-in `dataFlowPolicy.derivedTaint: 'strict'` fires the paraphrase-robust `derived-untrusted-to-sink` flow for every model-driven sink call once untrusted content entered the run (CaMeL-style control-flow integrity); the agent also records each tainted step's assistant text as `llm-derived` spans so model-echoed phrasing trips the verbatim probe.
+  - Taint into memory (cross-session MINJA leg): `ToolReturn` gains a widen-only `taint` override honoured through the executor record path; `fact_search` / `deep_recall` / `recall_episodes` attach it when any returned item is quarantined or foreign-provenance, re-arming the ledger at recall. `RunState.taintSummary` additionally carries one-way FNV-1a span-tile hashes (no plaintext), so a resumed run re-detects pre-suspend verbatim copies.
+  - MCP pinning completed: `toTools({ pinStore })` records fingerprints on first use and REJECTS drift by default when a store is present (rug-pull defense; `onPinMismatch: 'warn'` downgrades); tool-description injection hits at registration are counted (`mcp.tool-description.injection-flagged.total`).
+  - Signal-only heuristics + Unicode pre-pass: shared `normalizeForMatching` (NFKC + zero-width strip) applied in the guardrails injection catalogue and the memory quarantine heuristics; security.md repositions all pattern catalogues as best-effort signal, never a sole gate. `TaintLabel.sourceKind` widened to `string` for the new descriptive kinds.
+
+- [#137](https://github.com/o-stepper/graphorin/pull/137) [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627) Thanks [@o-stepper](https://github.com/o-stepper)! - Memory architecture evolution (audit 2026-07-04 Wave D, cluster D3) - opt-in; defaults byte-identical.
+
+  - Learned-context digest block (Letta sleep-time): a deep-phase pass rewrites the reserved `learned_context` working block from recent evidence via one budgeted LLM call (`consolidator.learnedContext`, off at every tier).
+  - Principal/owner dimension (`MemoryOwner` on facts/episodes/rules/insights, migration 026) stamped `'agent'` on synthesized writes, with a retrieval-time `owner` filter (`FactSearchOptions.owner`); default reads apply no filter.
+  - Retrieval-frequency reinforcement: `facts.access_count` (migration 027) + opt-in `SalienceWeights.accessReinforcement` (default 0 = inert).
+  - Runbook memory: `rules_fts` (migration 028) + `ProceduralMemory.search` returns whole validated procedures, with a gated `runbook_search` tool (`createMemory({ runbookSearch: true })`).
+
+- [#137](https://github.com/o-stepper/graphorin/pull/137) [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627) Thanks [@o-stepper](https://github.com/o-stepper)! - Retrieval SOTA graph wins (audit 2026-07-04 Wave D, cluster D5) - offline, opt-in; the billed/migration-heavy legs stay eval-gated.
+
+  - PPR-lite graded expansion (HippoRAG-style damped spreading activation): `SqliteGraphStore.expandActivation` + `FactSearchOptions.expandHops: 0|1|2` + `graphScoring: 'ppr'` score neighbours by `damping^hopDepth` instead of a flat 1.
+  - Graph + entity as first-class tunable fusion weights (`FusionWeights.graph` / `.entity`, were hardcoded neutral).
+  - Exact entity-match retriever: `SqliteGraphStore.factsForEntityName` + `FactSearchOptions.entityMatch` add a precise "facts about <entity>" candidate leg.
+  - `longmemeval` harness gains `--retrieval ppr` / `--retrieval entity`. Bitemporal event time, Matryoshka truncation, and cascade LLM reranking remain eval-gated.
+
+### Patch Changes
+
+- [#134](https://github.com/o-stepper/graphorin/pull/134) [`32f20c1`](https://github.com/o-stepper/graphorin/commit/32f20c110f184f8cef7eec85bf39f5f07c886cb6) Thanks [@o-stepper](https://github.com/o-stepper)! - Fix three context-assembly defects (context-engine-02/03/04). The default post-compaction hooks (persona block, project rules, pinned facts) now apply the same D2 privacy decision as `assemble()`, so `sensitivity:'secret'` content the assembly withholds can no longer leak to the provider via the post-compaction splice. `renderMessageText` renders assistant tool-call arguments and `adaptTokenCounter` preserves the native `count(messages)` path, so tool-call args (file writes, code_execute scripts) finally contribute to trigger/before/after token arithmetic. And the trigger, SOTA-4 reclaim floor, and anti-thrash guard now share one full-buffer basis: `shouldCompact` takes `compactableFromIndex` (the pinned prefix is no longer counted as reclaimable) and `compactNow` takes `prefixMessages` so the guard arms against prefix + body + essentials instead of the sliced body - previously any real system prompt defeated the guard and a summarizer LLM call re-fired every step at the context edge.
+
+- [#134](https://github.com/o-stepper/graphorin/pull/134) [`32f20c1`](https://github.com/o-stepper/graphorin/commit/32f20c110f184f8cef7eec85bf39f5f07c886cb6) Thanks [@o-stepper](https://github.com/o-stepper)! - Enforce transcript well-formedness so no path emits provider-rejected message sequences (agent-01, tools-07, context-engine-01). The durable-HITL pre-screen now collects EVERY approval-gated call in a step (not just the first) and executes the non-gated remainder before suspending, so the persisted transcript never carries dangling `tool_use` ids; `executeBatch` synthesizes an `execution_failed` outcome instead of silently dropping a slot whose `executeOne` rejected (e.g. a throwing tracer); summarize-compaction snaps its boundary backward so the preserved window never starts with an orphan `tool` message. The agent mock-provider harness now asserts transcript well-formedness on every request by default.
+
+- [#135](https://github.com/o-stepper/graphorin/pull/135) [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3) Thanks [@o-stepper](https://github.com/o-stepper)! - Retrieval and consolidation now honour the trust contracts they document (audit 2026-07-04 Wave B, cluster B3).
+
+  - memory-retrieval-01: default fact reads (FTS / vector / graph) behave as `asOf = now`, so superseded and validity-expired facts no longer surface as current - exactly what the `fact_supersede` tool promises. New `includeSuperseded: true` escape hatch (core `MemorySearchOptions`, memory `FactSearchOptions`, graph expand options) restores the full history for inspector / audit paths; `fact_search` and `deep_recall` outputs expose `validTo` / `supersededBy`.
+  - memory-retrieval-02: `deep_recall` passes `forceHard: true` (choosing the tool IS the hardness signal; the local heuristic gate rejected the tool's own documented examples and is English-only). Iterative results carry a new `graded` flag so ungraded single-shot passes stop claiming sufficiency as a verdict.
+  - memory-retrieval-03: a tagged search widens the fusion pool the same way decay does - the record-level tags filter runs after the topK cut, so tagged searches no longer silently return fewer than topK hits.
+  - memory-consolidation-01: the deep-phase dedup verdict now soft-forgets (replayable tombstone) instead of preferring the GDPR hard-delete `purge`, and a vanished conflicting fact skips the judge entirely (admit, no provider call) - a model verdict can no longer hard-delete the only surviving copy.
+  - memory-consolidation-07: the standard phase gains an embedder-independent exact-text duplicate guard (FTS + string equality, quarantine-aware), so replaying a partially-committed slice (DLQ / cursor retry) without an embedder no longer duplicates already-committed facts.
+
+- [#135](https://github.com/o-stepper/graphorin/pull/135) [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3) Thanks [@o-stepper](https://github.com/o-stepper)! - Compaction-seam hardening (audit 2026-07-04 Wave B, cluster B4).
+
+  - context-engine-05: the agent's pinned-prefix scan stops at the `<graphorin_compaction_summary>` marker, so a compaction summary resumed from a suspended run stays compactable instead of being absorbed into the uncompactable prefix (one extra pinned summary per compact-then-resume cycle).
+  - context-engine-06: hard context overflow gets a last-resort tier - on a `context-length` provider error the agent forces ONE aggressive compaction (`preserveRecentTurns: 2`) and retries the same provider before walking the fallback chain or failing. Thrown `ProviderHttpError`s now classify by their canonical `errorKind`, so a thrown 429 / overflow is treated like the structured-event equivalent.
+  - context-engine-07: the summarizer prompt's older-messages dump is capped (default 96k chars, `summarizerInputCharBudget` strategy option; oldest lines elided with a marker) so pointing `summarizerModel` at a smaller model no longer overflows its window and silently disables compaction.
+  - context-engine-09: `<<<older_messages>>>` / `<<</older_messages>>>` sequences inside message text are neutralized before entering the summarizer prompt's data-only envelope - a tool result carrying the closing marker can no longer inject instructions into the summarizer.
+  - context-engine-10: new integration test drives the REAL context engine through the agent loop with tool loops crossing the threshold; the mock provider's transcript invariant validates every post-compaction request.
+
+- [#135](https://github.com/o-stepper/graphorin/pull/135) [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3) Thanks [@o-stepper](https://github.com/o-stepper)! - Consolidator operational promises now hold (audit 2026-07-04 Wave B, cluster B5).
+
+  - memory-consolidation-02: `onExceed: 'log'` (the shipped standard/full presets) finally WARNs - once per resource per budget window, via a pluggable `BudgetTrackerOptions.logger`. New `priceUsage` hook on `CreateConsolidatorOptions` / `createMemory({ consolidator })` threads a USD pricer into every phase, so `maxCostPerDay` can actually accumulate spend (previously every call priced at $0 and the USD ceiling was inert at every tier).
+  - memory-consolidation-03: `drainDlq` has a production caller - every `trigger(...)` dispatch first replays ready (backoff-gated) dead-letter batches, so failed slices no longer accumulate forever. A separate-process `graphorin consolidator drain` CLI was deliberately NOT added: replays require the provider, which lives in the server process (same IP-4 boundary the CLI already documents for set-tier/stop).
+  - memory-consolidation-04: at tiers without a deep phase (free/cheap defaults) pending CONFLICT-CHECK rows older than 7 days are expired as `admit` (the safe direction - the candidate stays live), so the queue cannot grow monotonically.
+  - memory-consolidation-05/06: the guide's phase table now describes what the phases actually do (light = zero-LLM forgetting; standard = extraction + reconcile + episodes; deep = conflict judge + reflection; no procedural extraction, no shared-tier promotion) plus a new "Making it run" subsection documenting that the library-mode consolidator is dormant until `start()` + trigger wiring.
+  - memory-consolidation-08: extraction is temporally anchored - each transcript line carries its ISO timestamp and the prompt states today's date with an instruction to resolve relative dates into absolute ones.
+
+- [#138](https://github.com/o-stepper/graphorin/pull/138) [`6293a25`](https://github.com/o-stepper/graphorin/commit/6293a2531c5c9265294da22fb365a08f2bdf445a) Thanks [@o-stepper](https://github.com/o-stepper)! - Documentation-truth sweep (audit 2026-07-04 Wave E, cluster E10): stale npm package descriptions rewritten (cli "Phase 14a three commands", mcp "upcoming auth CLI", store-sqlite's nonexistent WorkerPool), the store-sqlite WorkerPool TSDoc and the cipher-pragma ordering comment corrected, the executor timeout-precedence JSDoc fixed to the real `inlineToolTimeoutMs > tier timeoutMs > default` order, the `rrf.<label>` explain signals documented, and the skills spec-snapshot wording no longer claims a CI cron refreshes it (the diff is a manual `--upstream` pass; the release gate only parses the bundled snapshot).
+
+- [#138](https://github.com/o-stepper/graphorin/pull/138) [`6293a25`](https://github.com/o-stepper/graphorin/commit/6293a2531c5c9265294da22fb365a08f2bdf445a) Thanks [@o-stepper](https://github.com/o-stepper)! - Release-pipeline and tarball-surface fixes (audit 2026-07-04 Wave E, cluster E2). `@graphorin/memory`'s `./conflict` subpath was runtime-EMPTY on npm 0.5.0 (`export { };` - preserveModules emitted the module without an explicit tsdown entry); it now ships all 8 runtime exports. `@graphorin/server`'s internal `workspace:*` peer dependencies are ranged (`workspace:>=0.5.0 <1.0.0`) so changesets stops escalating every sibling bump into a bogus MAJOR for the whole fixed group (the 1.0.0 landmine on the release bot's branch). `@graphorin/eslint-plugin` gains the `./package.json` self-export. All 27 per-package CHANGELOGs gain the 0.5.0 section (they were frozen at 0.1.0 inside every published tarball), and the `mvp-readiness` release gate now rejects a stale-CHANGELOG or unresolvable-exports release.
+
+- Updated dependencies [[`32f20c1`](https://github.com/o-stepper/graphorin/commit/32f20c110f184f8cef7eec85bf39f5f07c886cb6), [`32f20c1`](https://github.com/o-stepper/graphorin/commit/32f20c110f184f8cef7eec85bf39f5f07c886cb6), [`32f20c1`](https://github.com/o-stepper/graphorin/commit/32f20c110f184f8cef7eec85bf39f5f07c886cb6), [`32f20c1`](https://github.com/o-stepper/graphorin/commit/32f20c110f184f8cef7eec85bf39f5f07c886cb6), [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3), [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3), [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3), [`4f850d9`](https://github.com/o-stepper/graphorin/commit/4f850d9bc0a05d6256c59c5117b010336fcb41d3), [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84), [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84), [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84), [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84), [`17a2d30`](https://github.com/o-stepper/graphorin/commit/17a2d30564154ca2ab87473335cdef43a5089c84), [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627), [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627), [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627), [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627), [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627), [`ce06b47`](https://github.com/o-stepper/graphorin/commit/ce06b472af9e30ac5d0792f7a8b6f42170a94627), [`6293a25`](https://github.com/o-stepper/graphorin/commit/6293a2531c5c9265294da22fb365a08f2bdf445a), [`6293a25`](https://github.com/o-stepper/graphorin/commit/6293a2531c5c9265294da22fb365a08f2bdf445a)]:
+  - @graphorin/tools@0.6.0
+  - @graphorin/core@0.6.0
+  - @graphorin/security@0.6.0
+  - @graphorin/observability@0.6.0
+
+## 0.5.0
+
+First version published to the npm registry (with Sigstore build
+provenance). The 0.2.0, 0.3.0, and 0.4.0 versions were internal lockstep
+milestones and were never published. All `@graphorin/*` packages release
+lockstep at the same version; the full release notes for 0.2.0-0.5.0 live
+in the repository-level
+[CHANGELOG](https://github.com/o-stepper/graphorin/blob/main/CHANGELOG.md).
+
 ## 0.1.0
 
 ### Minor Changes
 
-- Phase 10a — initial release of `@graphorin/memory`. Ships the
+- Phase 10a - initial release of `@graphorin/memory`. Ships the
   `createMemory()` facade with six tier sub-modules (working,
   session, episodic, semantic, procedural, shared), nine memory
   tools registered through `@graphorin/tools`, the built-in

package/README.md

@@ -1,6 +1,6 @@
 # @graphorin/memory
 
-> Six-tier memory system for the Graphorin framework — the heart of any
+> Six-tier memory system for the Graphorin framework - the heart of any
 > long-living personal AI assistant built on top of Graphorin.
 
 `@graphorin/memory` ships the `createMemory()` facade, the six tier
@@ -13,15 +13,15 @@ engine.
 
 The package depends on:
 
-- `@graphorin/core` — typed contracts (`MemoryStore`, `EmbedderProvider`,
+- `@graphorin/core` - typed contracts (`MemoryStore`, `EmbedderProvider`,
   `Tool`, `Tracer`, `Sensitivity`, …).
-- `@graphorin/observability` — the `Tracer` used to emit one `AISpan`
+- `@graphorin/observability` - the `Tracer` used to emit one `AISpan`
   per memory operation.
-- `@graphorin/security` — the memory-modification guard (`MemoryGuardTier`)
+- `@graphorin/security` - the memory-modification guard (`MemoryGuardTier`)
   every memory tool is wired against.
-- `@graphorin/tools` — the `tool({...})` builder used to declare the
+- `@graphorin/tools` - the `tool({...})` builder used to declare the
   ten memory tools.
-- `zod` (peer) — schema typing for the memory tools.
+- `zod` (peer) - schema typing for the memory tools.
 
 Storage is provided by any `MemoryStore` implementation; the default
 production adapter is `@graphorin/store-sqlite` (built on
@@ -44,7 +44,7 @@ any `EmbedderProvider`; the default is
 - **Eleven memory tools.** `block_append`, `block_replace`,
   `block_rethink`, `fact_remember`, `fact_search`, `fact_supersede`,
   `fact_forget`, `recall_episodes`, `conversation_search`,
-  `fact_history`, `fact_validate` — every tool is a typed `Tool` with
+  `fact_history`, `fact_validate` - every tool is a typed `Tool` with
   `inputSchema` + `outputSchema`, the appropriate `memoryGuardTier`, and
   the right `sideEffectClass`. `fact_search` accepts an `asOf` instant
   for point-in-time reads; `fact_history` returns a fact's bi-temporal
@@ -57,7 +57,7 @@ any `EmbedderProvider`; the default is
   role-markup smuggling, secrecy / exfiltration directives) land
   `status: 'quarantined'` and are **excluded from default recall** until
   a human promotes them via `fact_validate`. Quarantine is a retrieval
-  gate, never a delete — quarantined rows stay fully auditable, and the
+  gate, never a delete - quarantined rows stay fully auditable, and the
   `includeQuarantined` search option surfaces them for the validation
   UI. This is the precondition for safely shipping synthesized memory
   (reflection / reconciliation / induction) against memory-poisoning
@@ -83,10 +83,10 @@ any `EmbedderProvider`; the default is
   `extraction` provenance gate.
 - **Auto-importance + episode formation** (consolidator standard phase).
   Each processed slice is summarized into one episode via a single budgeted
-  LLM call that also rates its importance `1–10` (normalized to `[0, 1]`),
+  LLM call that also rates its importance `1-10` (normalized to `[0, 1]`),
   so episodic triple-signal retrieval (recency × relevance × importance) finally
   runs on all three signals. Auto-formed episodes carry `provenance: 'extraction'`
-  + `status: 'quarantined'` (P1-4) — surfaced for review via
+  + `status: 'quarantined'` (P1-4) - surfaced for review via
   `episodic.search(..., { includeQuarantined: true })`. Importance is a *soft*
   signal (never a retention gate). Controlled by the per-tier `formEpisodes` /
   `importanceScoring` flags (on at `standard` / `full`); budget-aware
@@ -107,7 +107,7 @@ any `EmbedderProvider`; the default is
   topics, Anthropic's Contextual Retrieval) so a terse fact stays findable; the
   canonical `text` is preserved. The offline default `'late-chunk'`
   (`createMemory({ contextualRetrieval })`) derives the context deterministically
-  from the fact's own structured signals with **no extra LLM call** — a no-op for
+  from the fact's own structured signals with **no extra LLM call** - a no-op for
   plain-text writes. An opt-in, **consolidator-only** `'llm'` mode
   (`consolidator: { contextualRetrieval: 'llm' }`) spends one budgeted cheap-model
   call per write to author the prefix, degrading to late-chunk on any failure.
@@ -121,48 +121,48 @@ any `EmbedderProvider`; the default is
   (supersede chain / quarantine / conflicts / citing insights) and
   `graphorin memory activity` (consolidator / reflection activity).
 - **Multi-signal forgetting** (cost / staleness control, *not* an accuracy
-  lever). The light phase scores each fact with `salience(...)` — the Ebbinghaus
+  lever). The light phase scores each fact with `salience(...)` - the Ebbinghaus
   `retention` curve (recency + access frequency) combined with the `importance`
   hint and a security-risk negative term (a quarantined fact is evicted first, a
   foreign-provenance one slightly sooner). With neutral importance + an active,
   first-party fact, `salience === retention`. Setting `decayCapacity`
   (`createMemory({ consolidator: { decayCapacity } })`, default unbounded)
-  bounds storage: the lowest-salience facts are **soft-archived** (recoverable —
+  bounds storage: the lowest-salience facts are **soft-archived** (recoverable -
   `archived = 1`, never deleted) until the window fits.
 - **Query transformation** (read path; multi-query / RAG-Fusion + opt-in HyDE).
   `search(scope, query, { multiQuery: N })` fans the query into up to `N - 1`
   reworded variants via one cheap LLM call, retrieves each, and fuses every list
-  through the same RRF reranker — recovering memories whose stored wording
+  through the same RRF reranker - recovering memories whose stored wording
   differs from the question. `{ hyde: true }` additionally embeds a hypothetical
   answer (arXiv:2212.10496) and fuses its neighbours. Both are **opt-in**, wired
   by `createMemory({ queryTransform: { provider } })`; with no transformer (the
   default) search stays **offline + single-shot** and these options are silent
-  no-ops. Reserve it for retrieval-heavy recall — it adds provider latency.
+  no-ops. Reserve it for retrieval-heavy recall - it adds provider latency.
 - **Weighted fusion + reranker guidance** (search quality, opt-in). RRF is a
   good zero-tuning default, but once you have labels (the `@graphorin/evals`
   harness) a calibrated weight can do better. `search(scope, query, { fusion: {
   strategy: 'weighted', weights: { vector: 3, fts: 1 } } })` fuses through
   `WeightedRRFReranker`, scaling each candidate list's reciprocal-rank
   contribution by its retriever *kind* (FTS vs vector; the HyDE list counts as
-  vector). **RRF stays the default** — omit `fusion` (or pass `{ strategy:
+  vector). **RRF stays the default** - omit `fusion` (or pass `{ strategy:
   'rrf' }`) and behaviour is unchanged; equal weights reproduce RRF exactly. The
   pure `fuseWeighted(lists, weights, k)` is exported for offline weight tuning
   against the eval harness. For a further precision lift, install a cross-encoder
   reranker (`@graphorin/reranker-transformersjs` / `-llm`) via
-  `createMemory({ reranker })` or `setReranker(...)` and raise `candidateTopK` —
+  `createMemory({ reranker })` or `setReranker(...)` and raise `candidateTopK` -
   reranking pays off **only on an already-high-recall candidate set**, so fix
   recall first (contextual retrieval / multi-query) before reaching for it.
 - **Relation graph + one-hop expansion** (new capability, opt-in). Activates the
   dormant `(subject, predicate, object)` substrate: facts now carry s/p/o, and an
   **entity resolver** folds the subject/object strings into canonical entities
-  ("Anna", "Anna S.", "my sister" → one entity) via lexical + embedding dedup —
+  ("Anna", "Anna S.", "my sister" → one entity) via lexical + embedding dedup -
   with **auditable, reversible merges** (an append-only ledger; `merged_into` is
   single-level). At read time `search(scope, query, { expandHops: 1 })` seeds on
   the candidates and fuses in facts sharing an entity through a recursive CTE,
   answering "what did the person I met in Tbilisi recommend?" without leaving
   SQLite. Enable linking with `createMemory({ graph: { entityResolution: true } })`
   (offline; lexical + embedding). The ambiguous-similarity band mints a *new*
-  entity by default — it never auto-merges on weak evidence; opt into LLM
+  entity by default - it never auto-merges on weak evidence; opt into LLM
   adjudication (`graph: { llmAdjudication: true, provider }`) to resolve that band.
   Omit it all and the default path is unchanged + fully offline (`expandHops`
   defaults to `0`).
@@ -172,7 +172,7 @@ any `EmbedderProvider`; the default is
   (`assessQueryDifficulty`) keeps simple lookups single-shot; only a query judged
   hard *and* with a grader configured (`createMemory({ iterativeRetrieval: {
   provider } })`) is graded for sufficiency and, when weak, reformulated +
-  retrieved again — **widening to one-hop graph expansion** on each reformulation —
+  retrieved again - **widening to one-hop graph expansion** on each reformulation -
   up to a hard-capped `maxIterations` (≤ 5), then **abstaining**
   (`result.abstained === true`) rather than confabulating. Exposed as
   `SemanticMemory.searchIterative(...)` and the gated **`deep_recall`** tool (a
@@ -181,17 +181,17 @@ any `EmbedderProvider`; the default is
   call**; the tool surface stays at the canonical eleven.
 - **Procedural memory extraction** (new capability, gated + opt-in). AWM-style
   workflow induction: from a **successful** agent trajectory,
-  `ProceduralMemory.induce(scope, trajectory)` distils a reusable procedure —
+  `ProceduralMemory.induce(scope, trajectory)` distils a reusable procedure -
   goal + value-abstracted steps (`"search for {product}"`) + the variable names
   + Voyager-style success criteria for self-verification on reuse
   (`checkSuccessCriteria`). Induction fires on **success only** (a failed run
   never calls the inducer), and the result lands **quarantined** +
-  `provenance: 'induction'` (P1-4) — procedures drive *actions*, so this is the
+  `provenance: 'induction'` (P1-4) - procedures drive *actions*, so this is the
   highest-poisoning-risk write and is excluded from `activate()` until validated.
   `trajectoryFromRunState(runState)` distils the agent's already-emitted run
   state, so capture needs **no agent change**. Wire it with
   `createMemory({ procedureInduction: { provider } })`; omit it and `induce(...)`
-  throws `ProcedureInductionNotConfiguredError` — the procedural tier stays pure
+  throws `ProcedureInductionNotConfiguredError` - the procedural tier stays pure
   offline CRUD with no provider call.
 - **Per-record `embedder_id` enforced.** Every embedded write registers
   the embedder via the storage layer's `EmbeddingMetaRepository` and
@@ -215,7 +215,7 @@ any `EmbedderProvider`; the default is
   (post-MVP).
 - **`memory.compile(scope)` + `memory.metadata(scope)`.** The
   interface used by the context engine (Phase 10d) to assemble the
-  six-layer memory-aware system prompt; `@graphorin/memory@0.5.0`
+  six-layer memory-aware system prompt; `@graphorin/memory@0.6.0`
   ships the deterministic minimum-viable rendering so the agent
   runtime in Phase 12 can already exercise the surface.
 - **Memory-modification guard wiring.** Every tool's
@@ -354,22 +354,22 @@ console.log(outcome.decision.kind); // 'supersede' | 'dedup' | 'pending' | 'admi
 
 The pipeline visits five stages in order:
 
-1. **Exact dedup** — MD5 hash on the canonical (lowercase + collapsed-
+1. **Exact dedup** - MD5 hash on the canonical (lowercase + collapsed-
    whitespace + trimmed) candidate body short-circuits on a hit.
-2. **Embedding three-zone** — top-K neighbours from `searchVector`
+2. **Embedding three-zone** - top-K neighbours from `searchVector`
    classify the candidate into HOT (`>= 0.95`), NEAR-DUP
    (`>= 0.85`), CONFLICT-CHECK (`> 0.4`), or COLD. HOT zone always
    dedups (semantic identity outranks every other signal).
-3. **Heuristic regex** — the active locale pack's supersede +
+3. **Heuristic regex** - the active locale pack's supersede +
    negation markers fire when the candidate has an explicit
    change signal (`moved to`, `no longer`, `got promoted`, …) and
    there is at least one existing candidate.
-4. **Subject / predicate** — naive `(subject, predicate, object)`
+4. **Subject / predicate** - naive `(subject, predicate, object)`
    split using the locale pack's predicate normalisers; matching
    subject + predicate with a different object is a strong supersede
    signal.
-5. **Defer to deep LLM judge** — Stages 1–4 yielded no decision but
-   the candidate sits in CONFLICT-CHECK zone — the row is admitted
+5. **Defer to deep LLM judge** - Stages 1-4 yielded no decision but
+   the candidate sits in CONFLICT-CHECK zone - the row is admitted
    `pending` and queued in `conflict_check_pending` for the
    consolidator's deep phase (Phase 10c).
 
@@ -398,4 +398,4 @@ MIT © 2026 Oleksiy Stepurenko.
 
 ---
 
-**Project Graphorin** · v0.5.0 · MIT License · © 2026 Oleksiy Stepurenko · <https://github.com/o-stepper/graphorin>
+**Project Graphorin** · v0.6.0 · MIT License · © 2026 Oleksiy Stepurenko · <https://github.com/o-stepper/graphorin>

package/dist/conflict/index.d.ts

@@ -1,3 +1,5 @@
 import { LocaleMatch, LocalePack, LocalePatternEntry, LocaleSupersedeKind, defineLocalePack, evaluateMarkers } from "./locale-packs/types.js";
+import { enLocalePack } from "./locale-packs/en.js";
 import { ConflictDecision, ConflictPipeline, ConflictPipelineDeps, ConflictPipelineOptions, ConflictStage, ConflictThresholds, DEFAULT_CONFLICT_THRESHOLDS, PipelineStage, ReconcileAction, ReconcileDecision, StageContext, StageOutcome, reconcileToConflictDecision } from "./types.js";
-import { _resetBypassWarningForTesting, createConflictPipeline, runConflictPipeline } from "./pipeline.js";
+import { _resetBypassWarningForTesting, createConflictPipeline, runConflictPipeline } from "./pipeline.js";
+export { type ConflictDecision, type ConflictPipeline, type ConflictPipelineDeps, type ConflictPipelineOptions, type ConflictStage, type ConflictThresholds, DEFAULT_CONFLICT_THRESHOLDS, LocaleMatch, LocalePack, LocalePatternEntry, LocaleSupersedeKind, type PipelineStage, type ReconcileAction, type ReconcileDecision, type StageContext, type StageOutcome, _resetBypassWarningForTesting, createConflictPipeline, defineLocalePack, enLocalePack, evaluateMarkers, reconcileToConflictDecision, runConflictPipeline };

package/dist/conflict/index.js

@@ -4,4 +4,4 @@ import "./locale-packs/index.js";
 import { DEFAULT_CONFLICT_THRESHOLDS, reconcileToConflictDecision } from "./types.js";
 import { _resetBypassWarningForTesting, createConflictPipeline, runConflictPipeline } from "./pipeline.js";
 
-export {  };
+export { DEFAULT_CONFLICT_THRESHOLDS, _resetBypassWarningForTesting, createConflictPipeline, defineLocalePack, enLocalePack, evaluateMarkers, reconcileToConflictDecision, runConflictPipeline };

package/dist/conflict/locale-packs/en.d.ts

@@ -0,0 +1,13 @@
+import { LocalePack } from "./types.js";
+
+//#region src/conflict/locale-packs/en.d.ts
+
+/**
+ * The default English `LocalePack`. Frozen - share the singleton.
+ *
+ * @stable
+ */
+declare const enLocalePack: LocalePack;
+//#endregion
+export { enLocalePack };
+//# sourceMappingURL=en.d.ts.map

package/dist/conflict/locale-packs/en.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"en.d.ts","names":[],"sources":["../../../src/conflict/locale-packs/en.ts"],"sourcesContent":[],"mappings":";;;;;;;;;cAqBa,cAAc"}

package/dist/conflict/locale-packs/en.js

@@ -15,7 +15,7 @@ import { defineLocalePack } from "./types.js";
 * @packageDocumentation
 */
 /**
-* The default English `LocalePack`. Frozen — share the singleton.
+* The default English `LocalePack`. Frozen - share the singleton.
 *
 * @stable
 */

package/dist/conflict/locale-packs/en.js.map

@@ -1 +1 @@
-{"version":3,"file":"en.js","names":["enLocalePack: LocalePack"],"sources":["../../../src/conflict/locale-packs/en.ts"],"sourcesContent":["/**\n * Bundled English locale pack used by the multi-stage conflict\n * resolution pipeline (DEC-117 / ADR-018 ext / RB-02). The patterns\n * cover the common change signals personal-assistant scenarios surface\n * on a daily basis: relocation, job change, preference flips,\n * relationship transitions, and health updates.\n *\n * Operators supplying a different locale register their own pack via\n * {@link defineLocalePack}. The framework ships English by default so\n * the pipeline always has a working baseline.\n *\n * @packageDocumentation\n */\n\nimport { defineLocalePack, type LocalePack } from './types.js';\n\n/**\n * The default English `LocalePack`. Frozen — share the singleton.\n *\n * @stable\n */\nexport const enLocalePack: LocalePack = defineLocalePack({\n  id: 'en',\n  supersedeMarkers: [\n    // Location.\n    { regex: /\\bmoved (?:to|from)\\b/i, kind: 'location', confidence: 0.9 },\n    {\n      regex: /\\bnow (?:live|living|based|residing) (?:in|at)\\b/i,\n      kind: 'location',\n      confidence: 0.9,\n    },\n    { regex: /\\brelocated\\b/i, kind: 'location', confidence: 0.85 },\n    { regex: /\\bjust moved\\b/i, kind: 'location', confidence: 0.85 },\n    { regex: /\\bI live in\\b/i, kind: 'location', confidence: 0.7 },\n\n    // Job.\n    { regex: /\\b(?:got|started|landed)(?: a)?(?: new)? job\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bgot promoted\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bgot fired\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\b(?:I )?quit (?:my )?job\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bnew employer\\b/i, kind: 'job', confidence: 0.85 },\n    { regex: /\\bnew job\\b/i, kind: 'job', confidence: 0.8 },\n    { regex: /\\bswitched (?:companies|jobs|employers)\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bnow work(?:s|ing)? (?:at|for)\\b/i, kind: 'job', confidence: 0.85 },\n\n    // Preference.\n    { regex: /\\bswitched (?:from|to)\\b/i, kind: 'preference', confidence: 0.85 },\n    { regex: /\\bchanged my (?:mind|preference|opinion)\\b/i, kind: 'preference', confidence: 0.85 },\n    {\n      regex: /\\bused to (?:like|love|prefer|drink|eat|use)\\b/i,\n      kind: 'preference',\n      confidence: 0.85,\n    },\n    { regex: /\\bused to (?:live|work|study|play|travel)\\b/i, kind: 'generic', confidence: 0.85 },\n    { regex: /\\bI prefer\\b/i, kind: 'preference', confidence: 0.6 },\n\n    // Relationship.\n    { regex: /\\bgot (?:married|divorced|engaged)\\b/i, kind: 'relationship', confidence: 0.9 },\n    { regex: /\\bbroke up\\b/i, kind: 'relationship', confidence: 0.85 },\n\n    // Health.\n    { regex: /\\bdiagnosed (?:with|as)\\b/i, kind: 'health', confidence: 0.85 },\n    { regex: /\\brecovered from\\b/i, kind: 'health', confidence: 0.85 },\n\n    // Generic.\n    { regex: /\\bformerly\\b/i, kind: 'generic', confidence: 0.7 },\n    { regex: /\\bpreviously\\b/i, kind: 'generic', confidence: 0.7 },\n    { regex: /\\bused to be\\b/i, kind: 'generic', confidence: 0.7 },\n    { regex: /\\bis now\\b/i, kind: 'generic', confidence: 0.7 },\n  ],\n  negationMarkers: [\n    { regex: /\\bno longer\\b/i, kind: 'preference', confidence: 0.85 },\n    { regex: /\\bdoesn(?:'|\\u2019)?t\\b/i, confidence: 0.6 },\n    {\n      regex:\n        /\\b(?:don(?:'|\\u2019)?t|do not) (?:like|prefer|use|drink|eat|live|work|play|go|want)\\b/i,\n      kind: 'preference',\n      confidence: 0.85,\n    },\n    { regex: /\\bnever\\b/i, confidence: 0.6 },\n    { regex: /\\bnot anymore\\b/i, kind: 'preference', confidence: 0.85 },\n    { regex: /\\bisn(?:'|\\u2019)?t\\b/i, confidence: 0.6 },\n    {\n      regex: /\\bnot (?:a fan|interested|willing|going|planning|in|into|looking) /i,\n      kind: 'preference',\n      confidence: 0.7,\n    },\n    { regex: /\\b(?:is|are|am|was|were) not\\b/i, confidence: 0.5 },\n  ],\n  predicateNormalisers: [\n    'is',\n    'are',\n    'am',\n    'was',\n    'were',\n    'be',\n    'been',\n    'being',\n    'has',\n    'have',\n    'had',\n    'do',\n    'does',\n    'did',\n    'lives',\n    'live',\n    'lived',\n    'living',\n    'works',\n    'work',\n    'worked',\n    'working',\n    'plays',\n    'play',\n    'played',\n    'playing',\n    'likes',\n    'like',\n    'liked',\n    'loves',\n    'love',\n    'loved',\n    'prefers',\n    'prefer',\n    'preferred',\n    'drinks',\n    'drink',\n    'drank',\n    'drunk',\n    'eats',\n    'eat',\n    'ate',\n    'eaten',\n    'in',\n    'at',\n    'on',\n    'with',\n    'for',\n    'to',\n  ],\n  subjectStopWords: ['a', 'an', 'the', 'my', 'your', 'his', 'her', 'their', 'our', 'this', 'that'],\n});\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAqBA,MAAaA,eAA2B,iBAAiB;CACvD,IAAI;CACJ,kBAAkB;EAEhB;GAAE,OAAO;GAA0B,MAAM;GAAY,YAAY;GAAK;EACtE;GACE,OAAO;GACP,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAkB,MAAM;GAAY,YAAY;GAAM;EAC/D;GAAE,OAAO;GAAmB,MAAM;GAAY,YAAY;GAAM;EAChE;GAAE,OAAO;GAAkB,MAAM;GAAY,YAAY;GAAK;EAG9D;GAAE,OAAO;GAAmD,MAAM;GAAO,YAAY;GAAK;EAC1F;GAAE,OAAO;GAAqB,MAAM;GAAO,YAAY;GAAK;EAC5D;GAAE,OAAO;GAAkB,MAAM;GAAO,YAAY;GAAK;EACzD;GAAE,OAAO;GAAgC,MAAM;GAAO,YAAY;GAAK;EACvE;GAAE,OAAO;GAAqB,MAAM;GAAO,YAAY;GAAM;EAC7D;GAAE,OAAO;GAAgB,MAAM;GAAO,YAAY;GAAK;EACvD;GAAE,OAAO;GAA8C,MAAM;GAAO,YAAY;GAAK;EACrF;GAAE,OAAO;GAAsC,MAAM;GAAO,YAAY;GAAM;EAG9E;GAAE,OAAO;GAA6B,MAAM;GAAc,YAAY;GAAM;EAC5E;GAAE,OAAO;GAA+C,MAAM;GAAc,YAAY;GAAM;EAC9F;GACE,OAAO;GACP,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAgD,MAAM;GAAW,YAAY;GAAM;EAC5F;GAAE,OAAO;GAAiB,MAAM;GAAc,YAAY;GAAK;EAG/D;GAAE,OAAO;GAAyC,MAAM;GAAgB,YAAY;GAAK;EACzF;GAAE,OAAO;GAAiB,MAAM;GAAgB,YAAY;GAAM;EAGlE;GAAE,OAAO;GAA8B,MAAM;GAAU,YAAY;GAAM;EACzE;GAAE,OAAO;GAAuB,MAAM;GAAU,YAAY;GAAM;EAGlE;GAAE,OAAO;GAAiB,MAAM;GAAW,YAAY;GAAK;EAC5D;GAAE,OAAO;GAAmB,MAAM;GAAW,YAAY;GAAK;EAC9D;GAAE,OAAO;GAAmB,MAAM;GAAW,YAAY;GAAK;EAC9D;GAAE,OAAO;GAAe,MAAM;GAAW,YAAY;GAAK;EAC3D;CACD,iBAAiB;EACf;GAAE,OAAO;GAAkB,MAAM;GAAc,YAAY;GAAM;EACjE;GAAE,OAAO;GAA4B,YAAY;GAAK;EACtD;GACE,OACE;GACF,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAc,YAAY;GAAK;EACxC;GAAE,OAAO;GAAoB,MAAM;GAAc,YAAY;GAAM;EACnE;GAAE,OAAO;GAA0B,YAAY;GAAK;EACpD;GACE,OAAO;GACP,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAmC,YAAY;GAAK;EAC9D;CACD,sBAAsB;EACpB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD;CACD,kBAAkB;EAAC;EAAK;EAAM;EAAO;EAAM;EAAQ;EAAO;EAAO;EAAS;EAAO;EAAQ;EAAO;CACjG,CAAC"}
+{"version":3,"file":"en.js","names":["enLocalePack: LocalePack"],"sources":["../../../src/conflict/locale-packs/en.ts"],"sourcesContent":["/**\n * Bundled English locale pack used by the multi-stage conflict\n * resolution pipeline (DEC-117 / ADR-018 ext / RB-02). The patterns\n * cover the common change signals personal-assistant scenarios surface\n * on a daily basis: relocation, job change, preference flips,\n * relationship transitions, and health updates.\n *\n * Operators supplying a different locale register their own pack via\n * {@link defineLocalePack}. The framework ships English by default so\n * the pipeline always has a working baseline.\n *\n * @packageDocumentation\n */\n\nimport { defineLocalePack, type LocalePack } from './types.js';\n\n/**\n * The default English `LocalePack`. Frozen - share the singleton.\n *\n * @stable\n */\nexport const enLocalePack: LocalePack = defineLocalePack({\n  id: 'en',\n  supersedeMarkers: [\n    // Location.\n    { regex: /\\bmoved (?:to|from)\\b/i, kind: 'location', confidence: 0.9 },\n    {\n      regex: /\\bnow (?:live|living|based|residing) (?:in|at)\\b/i,\n      kind: 'location',\n      confidence: 0.9,\n    },\n    { regex: /\\brelocated\\b/i, kind: 'location', confidence: 0.85 },\n    { regex: /\\bjust moved\\b/i, kind: 'location', confidence: 0.85 },\n    { regex: /\\bI live in\\b/i, kind: 'location', confidence: 0.7 },\n\n    // Job.\n    { regex: /\\b(?:got|started|landed)(?: a)?(?: new)? job\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bgot promoted\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bgot fired\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\b(?:I )?quit (?:my )?job\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bnew employer\\b/i, kind: 'job', confidence: 0.85 },\n    { regex: /\\bnew job\\b/i, kind: 'job', confidence: 0.8 },\n    { regex: /\\bswitched (?:companies|jobs|employers)\\b/i, kind: 'job', confidence: 0.9 },\n    { regex: /\\bnow work(?:s|ing)? (?:at|for)\\b/i, kind: 'job', confidence: 0.85 },\n\n    // Preference.\n    { regex: /\\bswitched (?:from|to)\\b/i, kind: 'preference', confidence: 0.85 },\n    { regex: /\\bchanged my (?:mind|preference|opinion)\\b/i, kind: 'preference', confidence: 0.85 },\n    {\n      regex: /\\bused to (?:like|love|prefer|drink|eat|use)\\b/i,\n      kind: 'preference',\n      confidence: 0.85,\n    },\n    { regex: /\\bused to (?:live|work|study|play|travel)\\b/i, kind: 'generic', confidence: 0.85 },\n    { regex: /\\bI prefer\\b/i, kind: 'preference', confidence: 0.6 },\n\n    // Relationship.\n    { regex: /\\bgot (?:married|divorced|engaged)\\b/i, kind: 'relationship', confidence: 0.9 },\n    { regex: /\\bbroke up\\b/i, kind: 'relationship', confidence: 0.85 },\n\n    // Health.\n    { regex: /\\bdiagnosed (?:with|as)\\b/i, kind: 'health', confidence: 0.85 },\n    { regex: /\\brecovered from\\b/i, kind: 'health', confidence: 0.85 },\n\n    // Generic.\n    { regex: /\\bformerly\\b/i, kind: 'generic', confidence: 0.7 },\n    { regex: /\\bpreviously\\b/i, kind: 'generic', confidence: 0.7 },\n    { regex: /\\bused to be\\b/i, kind: 'generic', confidence: 0.7 },\n    { regex: /\\bis now\\b/i, kind: 'generic', confidence: 0.7 },\n  ],\n  negationMarkers: [\n    { regex: /\\bno longer\\b/i, kind: 'preference', confidence: 0.85 },\n    { regex: /\\bdoesn(?:'|\\u2019)?t\\b/i, confidence: 0.6 },\n    {\n      regex:\n        /\\b(?:don(?:'|\\u2019)?t|do not) (?:like|prefer|use|drink|eat|live|work|play|go|want)\\b/i,\n      kind: 'preference',\n      confidence: 0.85,\n    },\n    { regex: /\\bnever\\b/i, confidence: 0.6 },\n    { regex: /\\bnot anymore\\b/i, kind: 'preference', confidence: 0.85 },\n    { regex: /\\bisn(?:'|\\u2019)?t\\b/i, confidence: 0.6 },\n    {\n      regex: /\\bnot (?:a fan|interested|willing|going|planning|in|into|looking) /i,\n      kind: 'preference',\n      confidence: 0.7,\n    },\n    { regex: /\\b(?:is|are|am|was|were) not\\b/i, confidence: 0.5 },\n  ],\n  predicateNormalisers: [\n    'is',\n    'are',\n    'am',\n    'was',\n    'were',\n    'be',\n    'been',\n    'being',\n    'has',\n    'have',\n    'had',\n    'do',\n    'does',\n    'did',\n    'lives',\n    'live',\n    'lived',\n    'living',\n    'works',\n    'work',\n    'worked',\n    'working',\n    'plays',\n    'play',\n    'played',\n    'playing',\n    'likes',\n    'like',\n    'liked',\n    'loves',\n    'love',\n    'loved',\n    'prefers',\n    'prefer',\n    'preferred',\n    'drinks',\n    'drink',\n    'drank',\n    'drunk',\n    'eats',\n    'eat',\n    'ate',\n    'eaten',\n    'in',\n    'at',\n    'on',\n    'with',\n    'for',\n    'to',\n  ],\n  subjectStopWords: ['a', 'an', 'the', 'my', 'your', 'his', 'her', 'their', 'our', 'this', 'that'],\n});\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAqBA,MAAaA,eAA2B,iBAAiB;CACvD,IAAI;CACJ,kBAAkB;EAEhB;GAAE,OAAO;GAA0B,MAAM;GAAY,YAAY;GAAK;EACtE;GACE,OAAO;GACP,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAkB,MAAM;GAAY,YAAY;GAAM;EAC/D;GAAE,OAAO;GAAmB,MAAM;GAAY,YAAY;GAAM;EAChE;GAAE,OAAO;GAAkB,MAAM;GAAY,YAAY;GAAK;EAG9D;GAAE,OAAO;GAAmD,MAAM;GAAO,YAAY;GAAK;EAC1F;GAAE,OAAO;GAAqB,MAAM;GAAO,YAAY;GAAK;EAC5D;GAAE,OAAO;GAAkB,MAAM;GAAO,YAAY;GAAK;EACzD;GAAE,OAAO;GAAgC,MAAM;GAAO,YAAY;GAAK;EACvE;GAAE,OAAO;GAAqB,MAAM;GAAO,YAAY;GAAM;EAC7D;GAAE,OAAO;GAAgB,MAAM;GAAO,YAAY;GAAK;EACvD;GAAE,OAAO;GAA8C,MAAM;GAAO,YAAY;GAAK;EACrF;GAAE,OAAO;GAAsC,MAAM;GAAO,YAAY;GAAM;EAG9E;GAAE,OAAO;GAA6B,MAAM;GAAc,YAAY;GAAM;EAC5E;GAAE,OAAO;GAA+C,MAAM;GAAc,YAAY;GAAM;EAC9F;GACE,OAAO;GACP,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAgD,MAAM;GAAW,YAAY;GAAM;EAC5F;GAAE,OAAO;GAAiB,MAAM;GAAc,YAAY;GAAK;EAG/D;GAAE,OAAO;GAAyC,MAAM;GAAgB,YAAY;GAAK;EACzF;GAAE,OAAO;GAAiB,MAAM;GAAgB,YAAY;GAAM;EAGlE;GAAE,OAAO;GAA8B,MAAM;GAAU,YAAY;GAAM;EACzE;GAAE,OAAO;GAAuB,MAAM;GAAU,YAAY;GAAM;EAGlE;GAAE,OAAO;GAAiB,MAAM;GAAW,YAAY;GAAK;EAC5D;GAAE,OAAO;GAAmB,MAAM;GAAW,YAAY;GAAK;EAC9D;GAAE,OAAO;GAAmB,MAAM;GAAW,YAAY;GAAK;EAC9D;GAAE,OAAO;GAAe,MAAM;GAAW,YAAY;GAAK;EAC3D;CACD,iBAAiB;EACf;GAAE,OAAO;GAAkB,MAAM;GAAc,YAAY;GAAM;EACjE;GAAE,OAAO;GAA4B,YAAY;GAAK;EACtD;GACE,OACE;GACF,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAc,YAAY;GAAK;EACxC;GAAE,OAAO;GAAoB,MAAM;GAAc,YAAY;GAAM;EACnE;GAAE,OAAO;GAA0B,YAAY;GAAK;EACpD;GACE,OAAO;GACP,MAAM;GACN,YAAY;GACb;EACD;GAAE,OAAO;GAAmC,YAAY;GAAK;EAC9D;CACD,sBAAsB;EACpB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD;CACD,kBAAkB;EAAC;EAAK;EAAM;EAAO;EAAM;EAAQ;EAAO;EAAO;EAAS;EAAO;EAAQ;EAAO;CACjG,CAAC"}

package/dist/conflict/pipeline.d.ts

@@ -4,7 +4,7 @@ import { Fact } from "@graphorin/core";
 //#region src/conflict/pipeline.d.ts
 
 /**
- * Reset the one-shot bypass-warning flag. Test-only helper — production
+ * Reset the one-shot bypass-warning flag. Test-only helper - production
  * callers never invoke this.
  *
  * @internal
@@ -12,7 +12,7 @@ import { Fact } from "@graphorin/core";
 declare function _resetBypassWarningForTesting(): void;
 /**
  * One-shot helper that mirrors RB-02 §8.1's `runConflictPipeline({...})`
- * spec — convenient for callers that do not need to pre-build + cache
+ * spec - convenient for callers that do not need to pre-build + cache
  * the pipeline. Production wiring should still go through
  * {@link createConflictPipeline} (`SemanticMemory` re-uses the cached
  * instance per `Memory`).

package/dist/conflict/pipeline.js

@@ -11,7 +11,7 @@ import { DEFAULT_CONFLICT_THRESHOLDS } from "./types.js";
 //#region src/conflict/pipeline.ts
 let bypassWarnedOnce = false;
 /**
-* Reset the one-shot bypass-warning flag. Test-only helper — production
+* Reset the one-shot bypass-warning flag. Test-only helper - production
 * callers never invoke this.
 *
 * @internal
@@ -21,7 +21,7 @@ function _resetBypassWarningForTesting() {
 }
 /**
 * One-shot helper that mirrors RB-02 §8.1's `runConflictPipeline({...})`
-* spec — convenient for callers that do not need to pre-build + cache
+* spec - convenient for callers that do not need to pre-build + cache
 * the pipeline. Production wiring should still go through
 * {@link createConflictPipeline} (`SemanticMemory` re-uses the cached
 * instance per `Memory`).
@@ -249,7 +249,7 @@ function checkAbort(signal) {
 	}
 }
 function warnBypass() {
-	console.warn("[graphorin/memory] conflict pipeline disabled (mode: \"off\"). Semantic writes fall back to a straight-through path — bi-temporal supersede / dedup will not fire until you re-enable the pipeline.");
+	console.warn("[graphorin/memory] conflict pipeline disabled (mode: \"off\"). Semantic writes fall back to a straight-through path - bi-temporal supersede / dedup will not fire until you re-enable the pipeline.");
 }
 
 //#endregion

package/dist/conflict/pipeline.js.map

@@ -1 +1 @@
-{"version":3,"file":"pipeline.js","names":["mode: 'on' | 'off'","localePack: LocalePack","thresholds: ConflictThresholds","auditInput: Parameters<NonNullable<typeof conflictStore>['recordDecision']>[0]","hits: ReadonlyArray<MemoryHit<Fact>>"],"sources":["../../src/conflict/pipeline.ts"],"sourcesContent":["/**\n * `runConflictPipeline` — orchestrator for the multi-stage conflict\n * resolution pipeline shipped in `@graphorin/memory` Phase 10b\n * (DEC-117 / ADR-018 ext / RB-02).\n *\n * @packageDocumentation\n */\n\nimport type { Fact, MemoryHit } from '@graphorin/core';\nimport { withMemorySpan } from '../internal/spans.js';\nimport { enLocalePack, type LocalePack } from './locale-packs/index.js';\nimport { stage1ExactDedup } from './stages/stage1-exact-dedup.js';\nimport { stage2EmbeddingThreeZone } from './stages/stage2-embedding-three-zone.js';\nimport { stage3HeuristicRegex } from './stages/stage3-heuristic-regex.js';\nimport { stage4SubjectPredicate } from './stages/stage4-subject-predicate.js';\nimport { stage5DeferToDeep } from './stages/stage5-defer-to-deep.js';\nimport {\n  type ConflictDecision,\n  type ConflictPipeline,\n  type ConflictPipelineDeps,\n  type ConflictPipelineOptions,\n  type ConflictStage,\n  type ConflictThresholds,\n  DEFAULT_CONFLICT_THRESHOLDS,\n  type StageContext,\n  type StageOutcome,\n} from './types.js';\n\nlet bypassWarnedOnce = false;\n\n/**\n * Reset the one-shot bypass-warning flag. Test-only helper — production\n * callers never invoke this.\n *\n * @internal\n */\nexport function _resetBypassWarningForTesting(): void {\n  bypassWarnedOnce = false;\n}\n\n/**\n * One-shot helper that mirrors RB-02 §8.1's `runConflictPipeline({...})`\n * spec — convenient for callers that do not need to pre-build + cache\n * the pipeline. Production wiring should still go through\n * {@link createConflictPipeline} (`SemanticMemory` re-uses the cached\n * instance per `Memory`).\n *\n * @stable\n */\nexport async function runConflictPipeline(args: {\n  readonly candidate: Fact;\n  readonly deps: ConflictPipelineDeps;\n  readonly options?: ConflictPipelineOptions;\n}): Promise<ConflictDecision> {\n  const pipeline = createConflictPipeline(args.options ?? {});\n  return pipeline.run(args.deps, args.candidate);\n}\n\n/**\n * Returns a frozen pipeline handle wired with the supplied options.\n *\n * @stable\n */\nexport function createConflictPipeline(options: ConflictPipelineOptions = {}): ConflictPipeline {\n  const mode: 'on' | 'off' = options.mode ?? 'on';\n  const localePack: LocalePack = options.localePack ?? enLocalePack;\n  const thresholds: ConflictThresholds = Object.freeze({\n    hot: options.thresholds?.hot ?? DEFAULT_CONFLICT_THRESHOLDS.hot,\n    nearDup: options.thresholds?.nearDup ?? DEFAULT_CONFLICT_THRESHOLDS.nearDup,\n    cold: options.thresholds?.cold ?? DEFAULT_CONFLICT_THRESHOLDS.cold,\n  });\n  validateThresholds(thresholds);\n  const stage2TopK = options.stage2TopK ?? 5;\n  const now = options.now ?? ((): string => new Date().toISOString());\n\n  async function run(deps: ConflictPipelineDeps, candidate: Fact): Promise<ConflictDecision> {\n    if (mode === 'off') {\n      if (!bypassWarnedOnce) {\n        bypassWarnedOnce = true;\n        warnBypass();\n      }\n      return { kind: 'admit', stage: 'exact-dedup', reason: 'pipeline-mode-off' };\n    }\n\n    checkAbort(deps.signal);\n    const conflictStore = options.conflictStore ?? deps.store.conflicts;\n\n    return withMemorySpan(\n      deps.tracer,\n      'memory.conflict',\n      {\n        userId: candidate.userId,\n        ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n        ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n      },\n      {\n        'memory.conflict.candidate_id': candidate.id,\n        'memory.conflict.locale_pack': localePack.id,\n      },\n      async (span) => {\n        const existing = await collectVectorCandidates(deps, candidate, stage2TopK);\n        const ctx: StageContext = {\n          candidate,\n          existing,\n          localePack,\n          thresholds,\n        };\n        const decision = await orchestrate(ctx);\n        await persistDecision(decision, candidate, conflictStore, now);\n        span.setAttributes({\n          'memory.conflict.stage': decision.stage,\n          'memory.conflict.decision': decision.kind,\n          'memory.conflict.candidate_count': existing.length,\n          ...(decision.kind === 'dedup' && decision.similarity !== undefined\n            ? { 'memory.conflict.similarity': decision.similarity }\n            : {}),\n          ...(decision.kind === 'pending' && decision.similarity !== undefined\n            ? { 'memory.conflict.similarity': decision.similarity }\n            : {}),\n          ...(decision.kind !== 'admit'\n            ? { 'memory.conflict.reason': decision.reason ?? 'unspecified' }\n            : decision.reason !== undefined\n              ? { 'memory.conflict.reason': decision.reason }\n              : {}),\n        });\n        return decision;\n      },\n    );\n  }\n\n  /**\n   * Visit the five stages in the order documented by RB-02 §8.1 and\n   * the conflict-resolution policy (DEC-117). Stage 1 short-circuits\n   * exact duplicates. Stage 2 always computes the zone but the\n   * orchestrator splits its decision in two halves: the HOT zone is\n   * the only zone that overrides Stage 3 / Stage 4 (semantic identity\n   * outranks any explicit user marker); every other zone runs Stages\n   * 3 and 4 first to give the heuristic markers a chance to supersede\n   * before falling back to Stage 2's default decision.\n   *\n   * Stage 3 is declared \"orthogonal to Stage 2\", which is why the\n   * heuristic stages run regardless of Stage 2's COLD / NEAR-DUP /\n   * CONFLICT-CHECK assignment as long as Stage 2 surfaced at least\n   * one candidate. The HOT-zone short-circuit preserves the dedup\n   * invariant for semantic identity.\n   */\n  async function orchestrate(ctx: StageContext): Promise<ConflictDecision> {\n    const stage1 = await stage1ExactDedup.evaluate(ctx);\n    if (stage1.kind !== 'continue') {\n      return mapOutcomeToDecision('exact-dedup', stage1, ctx.candidate);\n    }\n\n    const stage2 = await stage2EmbeddingThreeZone.evaluate(ctx);\n    if (stage2.kind === 'dedup' && stage2.reason === 'embedding-hot-zone') {\n      return mapOutcomeToDecision('embedding-three-zone', stage2, ctx.candidate);\n    }\n\n    if (ctx.existing.length > 0) {\n      const stage3 = await stage3HeuristicRegex.evaluate(ctx);\n      if (stage3.kind !== 'continue') {\n        return mapOutcomeToDecision('heuristic-regex', stage3, ctx.candidate);\n      }\n      const stage4 = await stage4SubjectPredicate.evaluate(ctx);\n      if (stage4.kind !== 'continue') {\n        return mapOutcomeToDecision('subject-predicate', stage4, ctx.candidate);\n      }\n    }\n\n    if (stage2.kind === 'dedup' || stage2.kind === 'admit') {\n      return mapOutcomeToDecision('embedding-three-zone', stage2, ctx.candidate);\n    }\n\n    const stage5 = await stage5DeferToDeep.evaluate(ctx);\n    return mapOutcomeToDecision('defer-to-deep', stage5, ctx.candidate);\n  }\n\n  return Object.freeze({\n    mode,\n    localePack,\n    thresholds,\n    run,\n  }) satisfies ConflictPipeline;\n}\n\nfunction mapOutcomeToDecision(\n  stage: ConflictStage,\n  outcome: StageOutcome,\n  candidate: Fact,\n): ConflictDecision {\n  switch (outcome.kind) {\n    case 'continue':\n      return { kind: 'admit', stage, reason: 'continue-fallthrough' };\n    case 'admit':\n      return {\n        kind: 'admit',\n        stage,\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n    case 'dedup':\n      return {\n        kind: 'dedup',\n        stage,\n        existingId: outcome.existingId,\n        ...(outcome.similarity !== undefined ? { similarity: outcome.similarity } : {}),\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n    case 'supersede':\n      return {\n        kind: 'supersede',\n        stage,\n        existingId: outcome.existingId,\n        reason: outcome.reason,\n      };\n    case 'pending':\n      return {\n        kind: 'pending',\n        stage,\n        candidateId: candidate.id,\n        conflictingIds: outcome.conflictingIds,\n        ...(outcome.similarity !== undefined ? { similarity: outcome.similarity } : {}),\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n  }\n}\n\nasync function persistDecision(\n  decision: ConflictDecision,\n  candidate: Fact,\n  conflictStore: ConflictPipelineDeps['store']['conflicts'],\n  now: () => string,\n): Promise<void> {\n  if (conflictStore === undefined) return;\n  const scope = {\n    userId: candidate.userId,\n    ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n    ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n  };\n  const detectionZone = decisionToZone(decision);\n  const auditInput: Parameters<NonNullable<typeof conflictStore>['recordDecision']>[0] = {\n    scope,\n    candidateId: candidate.id,\n    decision: decision.kind,\n    stage: decision.stage,\n    ...(detectionZone !== undefined ? { detectionZone } : {}),\n    ...(decision.kind === 'dedup' && decision.existingId !== undefined\n      ? { existingId: decision.existingId }\n      : {}),\n    ...(decision.kind === 'supersede' ? { existingId: decision.existingId } : {}),\n    ...(decision.kind === 'dedup' && decision.similarity !== undefined\n      ? { similarity: decision.similarity }\n      : {}),\n    ...(decision.kind === 'pending' && decision.similarity !== undefined\n      ? { similarity: decision.similarity }\n      : {}),\n    ...(decision.kind !== 'admit' && decision.reason !== undefined\n      ? { reason: decision.reason }\n      : {}),\n    ...(decision.kind === 'admit' && decision.reason !== undefined\n      ? { reason: decision.reason }\n      : {}),\n  };\n  await conflictStore.recordDecision(auditInput);\n  if (decision.kind === 'pending') {\n    await conflictStore.enqueuePending({\n      scope,\n      factId: candidate.id,\n      candidateText: candidate.text,\n      stage: decision.stage,\n      conflictingIds: decision.conflictingIds,\n      ...(decision.reason !== undefined ? { reason: decision.reason } : {}),\n    });\n  }\n  void now;\n}\n\nfunction decisionToZone(decision: ConflictDecision): string | undefined {\n  switch (decision.kind) {\n    case 'admit':\n      if (decision.reason === 'embedding-cold-zone') return 'cold';\n      return undefined;\n    case 'dedup':\n      if (decision.reason === 'embedding-hot-zone') return 'hot';\n      if (decision.reason === 'embedding-near-dup-zone') return 'near-dup';\n      if (decision.reason === 'exact-hash-match') return 'exact';\n      if (decision.reason === 'subject-predicate-match-same-object') return 'subject-predicate';\n      return undefined;\n    case 'supersede':\n      if (decision.reason.startsWith('regex-supersede-marker')) return 'heuristic';\n      if (decision.reason.startsWith('regex-negation')) return 'heuristic';\n      if (decision.reason.startsWith('subject-predicate-match')) return 'subject-predicate';\n      return undefined;\n    case 'pending':\n      return 'conflict-check';\n  }\n}\n\nasync function collectVectorCandidates(\n  deps: ConflictPipelineDeps,\n  candidate: Fact,\n  topK: number,\n): Promise<ReadonlyArray<MemoryHit<Fact>>> {\n  if (deps.embedder === null || deps.embedderId === null) return [];\n  const adapter = deps.store.semantic;\n  if (typeof adapter.searchVector !== 'function') return [];\n  checkAbort(deps.signal);\n  // PS-10: the candidate is compared against stored facts, which are embedded\n  // as `passage` — keep it in the same space for the asymmetric (E5) embedder.\n  const [vector] = await deps.embedder.embed([candidate.text], { taskType: 'passage' });\n  if (vector === undefined) return [];\n  checkAbort(deps.signal);\n  const scope = {\n    userId: candidate.userId,\n    ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n    ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n  };\n  // Vector search may throw when the storage layer's vector extension\n  // is missing or mis-configured (e.g. `sqlite-vec` not loaded). Fall\n  // back to \"no candidates\" so the conflict pipeline degrades to the\n  // 10a straight-through write rather than blocking the agent loop.\n  // AbortError is re-raised so cancellation propagates up.\n  let hits: ReadonlyArray<MemoryHit<Fact>>;\n  try {\n    hits = await adapter.searchVector(scope, vector, deps.embedderId, topK);\n  } catch (err) {\n    if (err instanceof Error && err.name === 'AbortError') throw err;\n    return [];\n  }\n  return [...hits].filter((hit) => hit.record.id !== candidate.id);\n}\n\nfunction validateThresholds(thresholds: ConflictThresholds): void {\n  if (\n    !(\n      thresholds.hot >= thresholds.nearDup &&\n      thresholds.nearDup >= thresholds.cold &&\n      thresholds.hot <= 1 &&\n      thresholds.cold >= 0\n    )\n  ) {\n    throw new TypeError(\n      `[graphorin/memory] invalid conflict thresholds: expected 0 <= cold <= nearDup <= hot <= 1, got ${JSON.stringify(thresholds)}.`,\n    );\n  }\n}\n\n/**\n * Throw the canonical `AbortError` when the supplied signal is\n * already aborted. Safe to call with `undefined`.\n *\n * @internal\n */\nfunction checkAbort(signal: AbortSignal | undefined): void {\n  if (signal === undefined) return;\n  if (signal.aborted) {\n    if (typeof signal.throwIfAborted === 'function') {\n      signal.throwIfAborted();\n    }\n    throw new DOMException('The operation was aborted.', 'AbortError');\n  }\n}\n\nfunction warnBypass(): void {\n  // Use the structured logger once it lands (Phase 04 follow-up). For\n  // now, surface a one-shot console.warn so operators notice the\n  // regression risk per the Phase 10b spec (\"WARN-once per process\").\n  console.warn(\n    '[graphorin/memory] conflict pipeline disabled (mode: \"off\"). ' +\n      'Semantic writes fall back to a straight-through path — bi-temporal supersede / dedup ' +\n      'will not fire until you re-enable the pipeline.',\n  );\n}\n"],"mappings":";;;;;;;;;;;AA4BA,IAAI,mBAAmB;;;;;;;AAQvB,SAAgB,gCAAsC;AACpD,oBAAmB;;;;;;;;;;;AAYrB,eAAsB,oBAAoB,MAIZ;AAE5B,QADiB,uBAAuB,KAAK,WAAW,EAAE,CAAC,CAC3C,IAAI,KAAK,MAAM,KAAK,UAAU;;;;;;;AAQhD,SAAgB,uBAAuB,UAAmC,EAAE,EAAoB;CAC9F,MAAMA,OAAqB,QAAQ,QAAQ;CAC3C,MAAMC,aAAyB,QAAQ,cAAc;CACrD,MAAMC,aAAiC,OAAO,OAAO;EACnD,KAAK,QAAQ,YAAY,OAAO,4BAA4B;EAC5D,SAAS,QAAQ,YAAY,WAAW,4BAA4B;EACpE,MAAM,QAAQ,YAAY,QAAQ,4BAA4B;EAC/D,CAAC;AACF,oBAAmB,WAAW;CAC9B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,MAAM,QAAQ,+BAAsB,IAAI,MAAM,EAAC,aAAa;CAElE,eAAe,IAAI,MAA4B,WAA4C;AACzF,MAAI,SAAS,OAAO;AAClB,OAAI,CAAC,kBAAkB;AACrB,uBAAmB;AACnB,gBAAY;;AAEd,UAAO;IAAE,MAAM;IAAS,OAAO;IAAe,QAAQ;IAAqB;;AAG7E,aAAW,KAAK,OAAO;EACvB,MAAM,gBAAgB,QAAQ,iBAAiB,KAAK,MAAM;AAE1D,SAAO,eACL,KAAK,QACL,mBACA;GACE,QAAQ,UAAU;GAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;GAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;GAC1E,EACD;GACE,gCAAgC,UAAU;GAC1C,+BAA+B,WAAW;GAC3C,EACD,OAAO,SAAS;GACd,MAAM,WAAW,MAAM,wBAAwB,MAAM,WAAW,WAAW;GAO3E,MAAM,WAAW,MAAM,YANG;IACxB;IACA;IACA;IACA;IACD,CACsC;AACvC,SAAM,gBAAgB,UAAU,WAAW,eAAe,IAAI;AAC9D,QAAK,cAAc;IACjB,yBAAyB,SAAS;IAClC,4BAA4B,SAAS;IACrC,mCAAmC,SAAS;IAC5C,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,8BAA8B,SAAS,YAAY,GACrD,EAAE;IACN,GAAI,SAAS,SAAS,aAAa,SAAS,eAAe,SACvD,EAAE,8BAA8B,SAAS,YAAY,GACrD,EAAE;IACN,GAAI,SAAS,SAAS,UAClB,EAAE,0BAA0B,SAAS,UAAU,eAAe,GAC9D,SAAS,WAAW,SAClB,EAAE,0BAA0B,SAAS,QAAQ,GAC7C,EAAE;IACT,CAAC;AACF,UAAO;IAEV;;;;;;;;;;;;;;;;;;CAmBH,eAAe,YAAY,KAA8C;EACvE,MAAM,SAAS,MAAM,iBAAiB,SAAS,IAAI;AACnD,MAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,eAAe,QAAQ,IAAI,UAAU;EAGnE,MAAM,SAAS,MAAM,yBAAyB,SAAS,IAAI;AAC3D,MAAI,OAAO,SAAS,WAAW,OAAO,WAAW,qBAC/C,QAAO,qBAAqB,wBAAwB,QAAQ,IAAI,UAAU;AAG5E,MAAI,IAAI,SAAS,SAAS,GAAG;GAC3B,MAAM,SAAS,MAAM,qBAAqB,SAAS,IAAI;AACvD,OAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,mBAAmB,QAAQ,IAAI,UAAU;GAEvE,MAAM,SAAS,MAAM,uBAAuB,SAAS,IAAI;AACzD,OAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,qBAAqB,QAAQ,IAAI,UAAU;;AAI3E,MAAI,OAAO,SAAS,WAAW,OAAO,SAAS,QAC7C,QAAO,qBAAqB,wBAAwB,QAAQ,IAAI,UAAU;AAI5E,SAAO,qBAAqB,iBADb,MAAM,kBAAkB,SAAS,IAAI,EACC,IAAI,UAAU;;AAGrE,QAAO,OAAO,OAAO;EACnB;EACA;EACA;EACA;EACD,CAAC;;AAGJ,SAAS,qBACP,OACA,SACA,WACkB;AAClB,SAAQ,QAAQ,MAAhB;EACE,KAAK,WACH,QAAO;GAAE,MAAM;GAAS;GAAO,QAAQ;GAAwB;EACjE,KAAK,QACH,QAAO;GACL,MAAM;GACN;GACA,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;EACH,KAAK,QACH,QAAO;GACL,MAAM;GACN;GACA,YAAY,QAAQ;GACpB,GAAI,QAAQ,eAAe,SAAY,EAAE,YAAY,QAAQ,YAAY,GAAG,EAAE;GAC9E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;EACH,KAAK,YACH,QAAO;GACL,MAAM;GACN;GACA,YAAY,QAAQ;GACpB,QAAQ,QAAQ;GACjB;EACH,KAAK,UACH,QAAO;GACL,MAAM;GACN;GACA,aAAa,UAAU;GACvB,gBAAgB,QAAQ;GACxB,GAAI,QAAQ,eAAe,SAAY,EAAE,YAAY,QAAQ,YAAY,GAAG,EAAE;GAC9E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;;;AAIP,eAAe,gBACb,UACA,WACA,eACA,KACe;AACf,KAAI,kBAAkB,OAAW;CACjC,MAAM,QAAQ;EACZ,QAAQ,UAAU;EAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;EAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;EAC1E;CACD,MAAM,gBAAgB,eAAe,SAAS;CAC9C,MAAMC,aAAiF;EACrF;EACA,aAAa,UAAU;EACvB,UAAU,SAAS;EACnB,OAAO,SAAS;EAChB,GAAI,kBAAkB,SAAY,EAAE,eAAe,GAAG,EAAE;EACxD,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,cAAc,EAAE,YAAY,SAAS,YAAY,GAAG,EAAE;EAC5E,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,aAAa,SAAS,eAAe,SACvD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,WAAW,SAAS,WAAW,SACjD,EAAE,QAAQ,SAAS,QAAQ,GAC3B,EAAE;EACN,GAAI,SAAS,SAAS,WAAW,SAAS,WAAW,SACjD,EAAE,QAAQ,SAAS,QAAQ,GAC3B,EAAE;EACP;AACD,OAAM,cAAc,eAAe,WAAW;AAC9C,KAAI,SAAS,SAAS,UACpB,OAAM,cAAc,eAAe;EACjC;EACA,QAAQ,UAAU;EAClB,eAAe,UAAU;EACzB,OAAO,SAAS;EAChB,gBAAgB,SAAS;EACzB,GAAI,SAAS,WAAW,SAAY,EAAE,QAAQ,SAAS,QAAQ,GAAG,EAAE;EACrE,CAAC;;AAKN,SAAS,eAAe,UAAgD;AACtE,SAAQ,SAAS,MAAjB;EACE,KAAK;AACH,OAAI,SAAS,WAAW,sBAAuB,QAAO;AACtD;EACF,KAAK;AACH,OAAI,SAAS,WAAW,qBAAsB,QAAO;AACrD,OAAI,SAAS,WAAW,0BAA2B,QAAO;AAC1D,OAAI,SAAS,WAAW,mBAAoB,QAAO;AACnD,OAAI,SAAS,WAAW,sCAAuC,QAAO;AACtE;EACF,KAAK;AACH,OAAI,SAAS,OAAO,WAAW,yBAAyB,CAAE,QAAO;AACjE,OAAI,SAAS,OAAO,WAAW,iBAAiB,CAAE,QAAO;AACzD,OAAI,SAAS,OAAO,WAAW,0BAA0B,CAAE,QAAO;AAClE;EACF,KAAK,UACH,QAAO;;;AAIb,eAAe,wBACb,MACA,WACA,MACyC;AACzC,KAAI,KAAK,aAAa,QAAQ,KAAK,eAAe,KAAM,QAAO,EAAE;CACjE,MAAM,UAAU,KAAK,MAAM;AAC3B,KAAI,OAAO,QAAQ,iBAAiB,WAAY,QAAO,EAAE;AACzD,YAAW,KAAK,OAAO;CAGvB,MAAM,CAAC,UAAU,MAAM,KAAK,SAAS,MAAM,CAAC,UAAU,KAAK,EAAE,EAAE,UAAU,WAAW,CAAC;AACrF,KAAI,WAAW,OAAW,QAAO,EAAE;AACnC,YAAW,KAAK,OAAO;CACvB,MAAM,QAAQ;EACZ,QAAQ,UAAU;EAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;EAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;EAC1E;CAMD,IAAIC;AACJ,KAAI;AACF,SAAO,MAAM,QAAQ,aAAa,OAAO,QAAQ,KAAK,YAAY,KAAK;UAChE,KAAK;AACZ,MAAI,eAAe,SAAS,IAAI,SAAS,aAAc,OAAM;AAC7D,SAAO,EAAE;;AAEX,QAAO,CAAC,GAAG,KAAK,CAAC,QAAQ,QAAQ,IAAI,OAAO,OAAO,UAAU,GAAG;;AAGlE,SAAS,mBAAmB,YAAsC;AAChE,KACE,EACE,WAAW,OAAO,WAAW,WAC7B,WAAW,WAAW,WAAW,QACjC,WAAW,OAAO,KAClB,WAAW,QAAQ,GAGrB,OAAM,IAAI,UACR,kGAAkG,KAAK,UAAU,WAAW,CAAC,GAC9H;;;;;;;;AAUL,SAAS,WAAW,QAAuC;AACzD,KAAI,WAAW,OAAW;AAC1B,KAAI,OAAO,SAAS;AAClB,MAAI,OAAO,OAAO,mBAAmB,WACnC,QAAO,gBAAgB;AAEzB,QAAM,IAAI,aAAa,8BAA8B,aAAa;;;AAItE,SAAS,aAAmB;AAI1B,SAAQ,KACN,sMAGD"}
+{"version":3,"file":"pipeline.js","names":["mode: 'on' | 'off'","localePack: LocalePack","thresholds: ConflictThresholds","auditInput: Parameters<NonNullable<typeof conflictStore>['recordDecision']>[0]","hits: ReadonlyArray<MemoryHit<Fact>>"],"sources":["../../src/conflict/pipeline.ts"],"sourcesContent":["/**\n * `runConflictPipeline` - orchestrator for the multi-stage conflict\n * resolution pipeline shipped in `@graphorin/memory` Phase 10b\n * (DEC-117 / ADR-018 ext / RB-02).\n *\n * @packageDocumentation\n */\n\nimport type { Fact, MemoryHit } from '@graphorin/core';\nimport { withMemorySpan } from '../internal/spans.js';\nimport { enLocalePack, type LocalePack } from './locale-packs/index.js';\nimport { stage1ExactDedup } from './stages/stage1-exact-dedup.js';\nimport { stage2EmbeddingThreeZone } from './stages/stage2-embedding-three-zone.js';\nimport { stage3HeuristicRegex } from './stages/stage3-heuristic-regex.js';\nimport { stage4SubjectPredicate } from './stages/stage4-subject-predicate.js';\nimport { stage5DeferToDeep } from './stages/stage5-defer-to-deep.js';\nimport {\n  type ConflictDecision,\n  type ConflictPipeline,\n  type ConflictPipelineDeps,\n  type ConflictPipelineOptions,\n  type ConflictStage,\n  type ConflictThresholds,\n  DEFAULT_CONFLICT_THRESHOLDS,\n  type StageContext,\n  type StageOutcome,\n} from './types.js';\n\nlet bypassWarnedOnce = false;\n\n/**\n * Reset the one-shot bypass-warning flag. Test-only helper - production\n * callers never invoke this.\n *\n * @internal\n */\nexport function _resetBypassWarningForTesting(): void {\n  bypassWarnedOnce = false;\n}\n\n/**\n * One-shot helper that mirrors RB-02 §8.1's `runConflictPipeline({...})`\n * spec - convenient for callers that do not need to pre-build + cache\n * the pipeline. Production wiring should still go through\n * {@link createConflictPipeline} (`SemanticMemory` re-uses the cached\n * instance per `Memory`).\n *\n * @stable\n */\nexport async function runConflictPipeline(args: {\n  readonly candidate: Fact;\n  readonly deps: ConflictPipelineDeps;\n  readonly options?: ConflictPipelineOptions;\n}): Promise<ConflictDecision> {\n  const pipeline = createConflictPipeline(args.options ?? {});\n  return pipeline.run(args.deps, args.candidate);\n}\n\n/**\n * Returns a frozen pipeline handle wired with the supplied options.\n *\n * @stable\n */\nexport function createConflictPipeline(options: ConflictPipelineOptions = {}): ConflictPipeline {\n  const mode: 'on' | 'off' = options.mode ?? 'on';\n  const localePack: LocalePack = options.localePack ?? enLocalePack;\n  const thresholds: ConflictThresholds = Object.freeze({\n    hot: options.thresholds?.hot ?? DEFAULT_CONFLICT_THRESHOLDS.hot,\n    nearDup: options.thresholds?.nearDup ?? DEFAULT_CONFLICT_THRESHOLDS.nearDup,\n    cold: options.thresholds?.cold ?? DEFAULT_CONFLICT_THRESHOLDS.cold,\n  });\n  validateThresholds(thresholds);\n  const stage2TopK = options.stage2TopK ?? 5;\n  const now = options.now ?? ((): string => new Date().toISOString());\n\n  async function run(deps: ConflictPipelineDeps, candidate: Fact): Promise<ConflictDecision> {\n    if (mode === 'off') {\n      if (!bypassWarnedOnce) {\n        bypassWarnedOnce = true;\n        warnBypass();\n      }\n      return { kind: 'admit', stage: 'exact-dedup', reason: 'pipeline-mode-off' };\n    }\n\n    checkAbort(deps.signal);\n    const conflictStore = options.conflictStore ?? deps.store.conflicts;\n\n    return withMemorySpan(\n      deps.tracer,\n      'memory.conflict',\n      {\n        userId: candidate.userId,\n        ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n        ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n      },\n      {\n        'memory.conflict.candidate_id': candidate.id,\n        'memory.conflict.locale_pack': localePack.id,\n      },\n      async (span) => {\n        const existing = await collectVectorCandidates(deps, candidate, stage2TopK);\n        const ctx: StageContext = {\n          candidate,\n          existing,\n          localePack,\n          thresholds,\n        };\n        const decision = await orchestrate(ctx);\n        await persistDecision(decision, candidate, conflictStore, now);\n        span.setAttributes({\n          'memory.conflict.stage': decision.stage,\n          'memory.conflict.decision': decision.kind,\n          'memory.conflict.candidate_count': existing.length,\n          ...(decision.kind === 'dedup' && decision.similarity !== undefined\n            ? { 'memory.conflict.similarity': decision.similarity }\n            : {}),\n          ...(decision.kind === 'pending' && decision.similarity !== undefined\n            ? { 'memory.conflict.similarity': decision.similarity }\n            : {}),\n          ...(decision.kind !== 'admit'\n            ? { 'memory.conflict.reason': decision.reason ?? 'unspecified' }\n            : decision.reason !== undefined\n              ? { 'memory.conflict.reason': decision.reason }\n              : {}),\n        });\n        return decision;\n      },\n    );\n  }\n\n  /**\n   * Visit the five stages in the order documented by RB-02 §8.1 and\n   * the conflict-resolution policy (DEC-117). Stage 1 short-circuits\n   * exact duplicates. Stage 2 always computes the zone but the\n   * orchestrator splits its decision in two halves: the HOT zone is\n   * the only zone that overrides Stage 3 / Stage 4 (semantic identity\n   * outranks any explicit user marker); every other zone runs Stages\n   * 3 and 4 first to give the heuristic markers a chance to supersede\n   * before falling back to Stage 2's default decision.\n   *\n   * Stage 3 is declared \"orthogonal to Stage 2\", which is why the\n   * heuristic stages run regardless of Stage 2's COLD / NEAR-DUP /\n   * CONFLICT-CHECK assignment as long as Stage 2 surfaced at least\n   * one candidate. The HOT-zone short-circuit preserves the dedup\n   * invariant for semantic identity.\n   */\n  async function orchestrate(ctx: StageContext): Promise<ConflictDecision> {\n    const stage1 = await stage1ExactDedup.evaluate(ctx);\n    if (stage1.kind !== 'continue') {\n      return mapOutcomeToDecision('exact-dedup', stage1, ctx.candidate);\n    }\n\n    const stage2 = await stage2EmbeddingThreeZone.evaluate(ctx);\n    if (stage2.kind === 'dedup' && stage2.reason === 'embedding-hot-zone') {\n      return mapOutcomeToDecision('embedding-three-zone', stage2, ctx.candidate);\n    }\n\n    if (ctx.existing.length > 0) {\n      const stage3 = await stage3HeuristicRegex.evaluate(ctx);\n      if (stage3.kind !== 'continue') {\n        return mapOutcomeToDecision('heuristic-regex', stage3, ctx.candidate);\n      }\n      const stage4 = await stage4SubjectPredicate.evaluate(ctx);\n      if (stage4.kind !== 'continue') {\n        return mapOutcomeToDecision('subject-predicate', stage4, ctx.candidate);\n      }\n    }\n\n    if (stage2.kind === 'dedup' || stage2.kind === 'admit') {\n      return mapOutcomeToDecision('embedding-three-zone', stage2, ctx.candidate);\n    }\n\n    const stage5 = await stage5DeferToDeep.evaluate(ctx);\n    return mapOutcomeToDecision('defer-to-deep', stage5, ctx.candidate);\n  }\n\n  return Object.freeze({\n    mode,\n    localePack,\n    thresholds,\n    run,\n  }) satisfies ConflictPipeline;\n}\n\nfunction mapOutcomeToDecision(\n  stage: ConflictStage,\n  outcome: StageOutcome,\n  candidate: Fact,\n): ConflictDecision {\n  switch (outcome.kind) {\n    case 'continue':\n      return { kind: 'admit', stage, reason: 'continue-fallthrough' };\n    case 'admit':\n      return {\n        kind: 'admit',\n        stage,\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n    case 'dedup':\n      return {\n        kind: 'dedup',\n        stage,\n        existingId: outcome.existingId,\n        ...(outcome.similarity !== undefined ? { similarity: outcome.similarity } : {}),\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n    case 'supersede':\n      return {\n        kind: 'supersede',\n        stage,\n        existingId: outcome.existingId,\n        reason: outcome.reason,\n      };\n    case 'pending':\n      return {\n        kind: 'pending',\n        stage,\n        candidateId: candidate.id,\n        conflictingIds: outcome.conflictingIds,\n        ...(outcome.similarity !== undefined ? { similarity: outcome.similarity } : {}),\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n  }\n}\n\nasync function persistDecision(\n  decision: ConflictDecision,\n  candidate: Fact,\n  conflictStore: ConflictPipelineDeps['store']['conflicts'],\n  now: () => string,\n): Promise<void> {\n  if (conflictStore === undefined) return;\n  const scope = {\n    userId: candidate.userId,\n    ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n    ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n  };\n  const detectionZone = decisionToZone(decision);\n  const auditInput: Parameters<NonNullable<typeof conflictStore>['recordDecision']>[0] = {\n    scope,\n    candidateId: candidate.id,\n    decision: decision.kind,\n    stage: decision.stage,\n    ...(detectionZone !== undefined ? { detectionZone } : {}),\n    ...(decision.kind === 'dedup' && decision.existingId !== undefined\n      ? { existingId: decision.existingId }\n      : {}),\n    ...(decision.kind === 'supersede' ? { existingId: decision.existingId } : {}),\n    ...(decision.kind === 'dedup' && decision.similarity !== undefined\n      ? { similarity: decision.similarity }\n      : {}),\n    ...(decision.kind === 'pending' && decision.similarity !== undefined\n      ? { similarity: decision.similarity }\n      : {}),\n    ...(decision.kind !== 'admit' && decision.reason !== undefined\n      ? { reason: decision.reason }\n      : {}),\n    ...(decision.kind === 'admit' && decision.reason !== undefined\n      ? { reason: decision.reason }\n      : {}),\n  };\n  await conflictStore.recordDecision(auditInput);\n  if (decision.kind === 'pending') {\n    await conflictStore.enqueuePending({\n      scope,\n      factId: candidate.id,\n      candidateText: candidate.text,\n      stage: decision.stage,\n      conflictingIds: decision.conflictingIds,\n      ...(decision.reason !== undefined ? { reason: decision.reason } : {}),\n    });\n  }\n  void now;\n}\n\nfunction decisionToZone(decision: ConflictDecision): string | undefined {\n  switch (decision.kind) {\n    case 'admit':\n      if (decision.reason === 'embedding-cold-zone') return 'cold';\n      return undefined;\n    case 'dedup':\n      if (decision.reason === 'embedding-hot-zone') return 'hot';\n      if (decision.reason === 'embedding-near-dup-zone') return 'near-dup';\n      if (decision.reason === 'exact-hash-match') return 'exact';\n      if (decision.reason === 'subject-predicate-match-same-object') return 'subject-predicate';\n      return undefined;\n    case 'supersede':\n      if (decision.reason.startsWith('regex-supersede-marker')) return 'heuristic';\n      if (decision.reason.startsWith('regex-negation')) return 'heuristic';\n      if (decision.reason.startsWith('subject-predicate-match')) return 'subject-predicate';\n      return undefined;\n    case 'pending':\n      return 'conflict-check';\n  }\n}\n\nasync function collectVectorCandidates(\n  deps: ConflictPipelineDeps,\n  candidate: Fact,\n  topK: number,\n): Promise<ReadonlyArray<MemoryHit<Fact>>> {\n  if (deps.embedder === null || deps.embedderId === null) return [];\n  const adapter = deps.store.semantic;\n  if (typeof adapter.searchVector !== 'function') return [];\n  checkAbort(deps.signal);\n  // PS-10: the candidate is compared against stored facts, which are embedded\n  // as `passage` - keep it in the same space for the asymmetric (E5) embedder.\n  const [vector] = await deps.embedder.embed([candidate.text], { taskType: 'passage' });\n  if (vector === undefined) return [];\n  checkAbort(deps.signal);\n  const scope = {\n    userId: candidate.userId,\n    ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n    ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n  };\n  // Vector search may throw when the storage layer's vector extension\n  // is missing or mis-configured (e.g. `sqlite-vec` not loaded). Fall\n  // back to \"no candidates\" so the conflict pipeline degrades to the\n  // 10a straight-through write rather than blocking the agent loop.\n  // AbortError is re-raised so cancellation propagates up.\n  let hits: ReadonlyArray<MemoryHit<Fact>>;\n  try {\n    hits = await adapter.searchVector(scope, vector, deps.embedderId, topK);\n  } catch (err) {\n    if (err instanceof Error && err.name === 'AbortError') throw err;\n    return [];\n  }\n  return [...hits].filter((hit) => hit.record.id !== candidate.id);\n}\n\nfunction validateThresholds(thresholds: ConflictThresholds): void {\n  if (\n    !(\n      thresholds.hot >= thresholds.nearDup &&\n      thresholds.nearDup >= thresholds.cold &&\n      thresholds.hot <= 1 &&\n      thresholds.cold >= 0\n    )\n  ) {\n    throw new TypeError(\n      `[graphorin/memory] invalid conflict thresholds: expected 0 <= cold <= nearDup <= hot <= 1, got ${JSON.stringify(thresholds)}.`,\n    );\n  }\n}\n\n/**\n * Throw the canonical `AbortError` when the supplied signal is\n * already aborted. Safe to call with `undefined`.\n *\n * @internal\n */\nfunction checkAbort(signal: AbortSignal | undefined): void {\n  if (signal === undefined) return;\n  if (signal.aborted) {\n    if (typeof signal.throwIfAborted === 'function') {\n      signal.throwIfAborted();\n    }\n    throw new DOMException('The operation was aborted.', 'AbortError');\n  }\n}\n\nfunction warnBypass(): void {\n  // Use the structured logger once it lands (Phase 04 follow-up). For\n  // now, surface a one-shot console.warn so operators notice the\n  // regression risk per the Phase 10b spec (\"WARN-once per process\").\n  console.warn(\n    '[graphorin/memory] conflict pipeline disabled (mode: \"off\"). ' +\n      'Semantic writes fall back to a straight-through path - bi-temporal supersede / dedup ' +\n      'will not fire until you re-enable the pipeline.',\n  );\n}\n"],"mappings":";;;;;;;;;;;AA4BA,IAAI,mBAAmB;;;;;;;AAQvB,SAAgB,gCAAsC;AACpD,oBAAmB;;;;;;;;;;;AAYrB,eAAsB,oBAAoB,MAIZ;AAE5B,QADiB,uBAAuB,KAAK,WAAW,EAAE,CAAC,CAC3C,IAAI,KAAK,MAAM,KAAK,UAAU;;;;;;;AAQhD,SAAgB,uBAAuB,UAAmC,EAAE,EAAoB;CAC9F,MAAMA,OAAqB,QAAQ,QAAQ;CAC3C,MAAMC,aAAyB,QAAQ,cAAc;CACrD,MAAMC,aAAiC,OAAO,OAAO;EACnD,KAAK,QAAQ,YAAY,OAAO,4BAA4B;EAC5D,SAAS,QAAQ,YAAY,WAAW,4BAA4B;EACpE,MAAM,QAAQ,YAAY,QAAQ,4BAA4B;EAC/D,CAAC;AACF,oBAAmB,WAAW;CAC9B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,MAAM,QAAQ,+BAAsB,IAAI,MAAM,EAAC,aAAa;CAElE,eAAe,IAAI,MAA4B,WAA4C;AACzF,MAAI,SAAS,OAAO;AAClB,OAAI,CAAC,kBAAkB;AACrB,uBAAmB;AACnB,gBAAY;;AAEd,UAAO;IAAE,MAAM;IAAS,OAAO;IAAe,QAAQ;IAAqB;;AAG7E,aAAW,KAAK,OAAO;EACvB,MAAM,gBAAgB,QAAQ,iBAAiB,KAAK,MAAM;AAE1D,SAAO,eACL,KAAK,QACL,mBACA;GACE,QAAQ,UAAU;GAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;GAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;GAC1E,EACD;GACE,gCAAgC,UAAU;GAC1C,+BAA+B,WAAW;GAC3C,EACD,OAAO,SAAS;GACd,MAAM,WAAW,MAAM,wBAAwB,MAAM,WAAW,WAAW;GAO3E,MAAM,WAAW,MAAM,YANG;IACxB;IACA;IACA;IACA;IACD,CACsC;AACvC,SAAM,gBAAgB,UAAU,WAAW,eAAe,IAAI;AAC9D,QAAK,cAAc;IACjB,yBAAyB,SAAS;IAClC,4BAA4B,SAAS;IACrC,mCAAmC,SAAS;IAC5C,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,8BAA8B,SAAS,YAAY,GACrD,EAAE;IACN,GAAI,SAAS,SAAS,aAAa,SAAS,eAAe,SACvD,EAAE,8BAA8B,SAAS,YAAY,GACrD,EAAE;IACN,GAAI,SAAS,SAAS,UAClB,EAAE,0BAA0B,SAAS,UAAU,eAAe,GAC9D,SAAS,WAAW,SAClB,EAAE,0BAA0B,SAAS,QAAQ,GAC7C,EAAE;IACT,CAAC;AACF,UAAO;IAEV;;;;;;;;;;;;;;;;;;CAmBH,eAAe,YAAY,KAA8C;EACvE,MAAM,SAAS,MAAM,iBAAiB,SAAS,IAAI;AACnD,MAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,eAAe,QAAQ,IAAI,UAAU;EAGnE,MAAM,SAAS,MAAM,yBAAyB,SAAS,IAAI;AAC3D,MAAI,OAAO,SAAS,WAAW,OAAO,WAAW,qBAC/C,QAAO,qBAAqB,wBAAwB,QAAQ,IAAI,UAAU;AAG5E,MAAI,IAAI,SAAS,SAAS,GAAG;GAC3B,MAAM,SAAS,MAAM,qBAAqB,SAAS,IAAI;AACvD,OAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,mBAAmB,QAAQ,IAAI,UAAU;GAEvE,MAAM,SAAS,MAAM,uBAAuB,SAAS,IAAI;AACzD,OAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,qBAAqB,QAAQ,IAAI,UAAU;;AAI3E,MAAI,OAAO,SAAS,WAAW,OAAO,SAAS,QAC7C,QAAO,qBAAqB,wBAAwB,QAAQ,IAAI,UAAU;AAI5E,SAAO,qBAAqB,iBADb,MAAM,kBAAkB,SAAS,IAAI,EACC,IAAI,UAAU;;AAGrE,QAAO,OAAO,OAAO;EACnB;EACA;EACA;EACA;EACD,CAAC;;AAGJ,SAAS,qBACP,OACA,SACA,WACkB;AAClB,SAAQ,QAAQ,MAAhB;EACE,KAAK,WACH,QAAO;GAAE,MAAM;GAAS;GAAO,QAAQ;GAAwB;EACjE,KAAK,QACH,QAAO;GACL,MAAM;GACN;GACA,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;EACH,KAAK,QACH,QAAO;GACL,MAAM;GACN;GACA,YAAY,QAAQ;GACpB,GAAI,QAAQ,eAAe,SAAY,EAAE,YAAY,QAAQ,YAAY,GAAG,EAAE;GAC9E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;EACH,KAAK,YACH,QAAO;GACL,MAAM;GACN;GACA,YAAY,QAAQ;GACpB,QAAQ,QAAQ;GACjB;EACH,KAAK,UACH,QAAO;GACL,MAAM;GACN;GACA,aAAa,UAAU;GACvB,gBAAgB,QAAQ;GACxB,GAAI,QAAQ,eAAe,SAAY,EAAE,YAAY,QAAQ,YAAY,GAAG,EAAE;GAC9E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;;;AAIP,eAAe,gBACb,UACA,WACA,eACA,KACe;AACf,KAAI,kBAAkB,OAAW;CACjC,MAAM,QAAQ;EACZ,QAAQ,UAAU;EAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;EAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;EAC1E;CACD,MAAM,gBAAgB,eAAe,SAAS;CAC9C,MAAMC,aAAiF;EACrF;EACA,aAAa,UAAU;EACvB,UAAU,SAAS;EACnB,OAAO,SAAS;EAChB,GAAI,kBAAkB,SAAY,EAAE,eAAe,GAAG,EAAE;EACxD,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,cAAc,EAAE,YAAY,SAAS,YAAY,GAAG,EAAE;EAC5E,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,aAAa,SAAS,eAAe,SACvD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,WAAW,SAAS,WAAW,SACjD,EAAE,QAAQ,SAAS,QAAQ,GAC3B,EAAE;EACN,GAAI,SAAS,SAAS,WAAW,SAAS,WAAW,SACjD,EAAE,QAAQ,SAAS,QAAQ,GAC3B,EAAE;EACP;AACD,OAAM,cAAc,eAAe,WAAW;AAC9C,KAAI,SAAS,SAAS,UACpB,OAAM,cAAc,eAAe;EACjC;EACA,QAAQ,UAAU;EAClB,eAAe,UAAU;EACzB,OAAO,SAAS;EAChB,gBAAgB,SAAS;EACzB,GAAI,SAAS,WAAW,SAAY,EAAE,QAAQ,SAAS,QAAQ,GAAG,EAAE;EACrE,CAAC;;AAKN,SAAS,eAAe,UAAgD;AACtE,SAAQ,SAAS,MAAjB;EACE,KAAK;AACH,OAAI,SAAS,WAAW,sBAAuB,QAAO;AACtD;EACF,KAAK;AACH,OAAI,SAAS,WAAW,qBAAsB,QAAO;AACrD,OAAI,SAAS,WAAW,0BAA2B,QAAO;AAC1D,OAAI,SAAS,WAAW,mBAAoB,QAAO;AACnD,OAAI,SAAS,WAAW,sCAAuC,QAAO;AACtE;EACF,KAAK;AACH,OAAI,SAAS,OAAO,WAAW,yBAAyB,CAAE,QAAO;AACjE,OAAI,SAAS,OAAO,WAAW,iBAAiB,CAAE,QAAO;AACzD,OAAI,SAAS,OAAO,WAAW,0BAA0B,CAAE,QAAO;AAClE;EACF,KAAK,UACH,QAAO;;;AAIb,eAAe,wBACb,MACA,WACA,MACyC;AACzC,KAAI,KAAK,aAAa,QAAQ,KAAK,eAAe,KAAM,QAAO,EAAE;CACjE,MAAM,UAAU,KAAK,MAAM;AAC3B,KAAI,OAAO,QAAQ,iBAAiB,WAAY,QAAO,EAAE;AACzD,YAAW,KAAK,OAAO;CAGvB,MAAM,CAAC,UAAU,MAAM,KAAK,SAAS,MAAM,CAAC,UAAU,KAAK,EAAE,EAAE,UAAU,WAAW,CAAC;AACrF,KAAI,WAAW,OAAW,QAAO,EAAE;AACnC,YAAW,KAAK,OAAO;CACvB,MAAM,QAAQ;EACZ,QAAQ,UAAU;EAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;EAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;EAC1E;CAMD,IAAIC;AACJ,KAAI;AACF,SAAO,MAAM,QAAQ,aAAa,OAAO,QAAQ,KAAK,YAAY,KAAK;UAChE,KAAK;AACZ,MAAI,eAAe,SAAS,IAAI,SAAS,aAAc,OAAM;AAC7D,SAAO,EAAE;;AAEX,QAAO,CAAC,GAAG,KAAK,CAAC,QAAQ,QAAQ,IAAI,OAAO,OAAO,UAAU,GAAG;;AAGlE,SAAS,mBAAmB,YAAsC;AAChE,KACE,EACE,WAAW,OAAO,WAAW,WAC7B,WAAW,WAAW,WAAW,QACjC,WAAW,OAAO,KAClB,WAAW,QAAQ,GAGrB,OAAM,IAAI,UACR,kGAAkG,KAAK,UAAU,WAAW,CAAC,GAC9H;;;;;;;;AAUL,SAAS,WAAW,QAAuC;AACzD,KAAI,WAAW,OAAW;AAC1B,KAAI,OAAO,SAAS;AAClB,MAAI,OAAO,OAAO,mBAAmB,WACnC,QAAO,gBAAgB;AAEzB,QAAM,IAAI,aAAa,8BAA8B,aAAa;;;AAItE,SAAS,aAAmB;AAI1B,SAAQ,KACN,sMAGD"}

package/dist/conflict/stages/helpers.js

@@ -31,7 +31,7 @@ function normaliseSubject(input, pack) {
 }
 /**
 * Naive subject / predicate / object split. The locale pack supplies
-* the verb tokens used as predicate normalisers — the first matching
+* the verb tokens used as predicate normalisers - the first matching
 * verb in the sentence becomes the predicate and splits the rest
 * into subject (left side) and object (right side). The split is
 * intentionally simple: anything more clever lives behind the entity-

package/dist/conflict/stages/helpers.js.map

@@ -1 +1 @@
-{"version":3,"file":"helpers.js","names":[],"sources":["../../../src/conflict/stages/helpers.ts"],"sourcesContent":["/**\n * Internal helpers shared across the five pipeline stages.\n *\n * @packageDocumentation\n * @internal\n */\n\nimport { md5 } from '@graphorin/core';\nimport type { LocalePack } from '../locale-packs/index.js';\n\n/**\n * Lowercase + collapse whitespace + trim. Used by Stage 1 (exact\n * dedup) to compute the canonical fact body that feeds the MD5\n * comparison.\n */\nexport function canonicaliseFactBody(text: string): string {\n  return text.replace(/\\s+/g, ' ').trim().toLowerCase();\n}\n\n/**\n * Stable hash for a canonical fact body. We re-use the framework's\n * MD5 helper to stay consistent with the storage layer's existing\n * dedup hash column (see `facts.hash`).\n */\nexport function fastFactHash(text: string): string {\n  return md5(text);\n}\n\n/** Strip leading articles + trim a candidate subject token. */\nexport function normaliseSubject(input: string, pack: LocalePack): string {\n  const tokens = canonicaliseFactBody(input).split(' ');\n  const stop = new Set(pack.subjectStopWords.map((s) => s.toLowerCase()));\n  return tokens.filter((token) => token.length > 0 && !stop.has(token)).join(' ');\n}\n\n/**\n * Naive subject / predicate / object split. The locale pack supplies\n * the verb tokens used as predicate normalisers — the first matching\n * verb in the sentence becomes the predicate and splits the rest\n * into subject (left side) and object (right side). The split is\n * intentionally simple: anything more clever lives behind the entity-\n * linking layer (post-MVP).\n */\nexport function splitSubjectPredicateObject(\n  text: string,\n  pack: LocalePack,\n): { readonly subject: string; readonly predicate: string; readonly object: string } | null {\n  const canonical = canonicaliseFactBody(text);\n  if (canonical.length === 0) return null;\n  const tokens = canonical.split(' ');\n  const verbs = new Set(pack.predicateNormalisers.map((v) => v.toLowerCase()));\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n    if (token === undefined) continue;\n    const stripped = token.replace(/[.,!?;:]/g, '');\n    if (verbs.has(stripped)) {\n      const subject = normaliseSubject(tokens.slice(0, i).join(' '), pack);\n      const predicate = stripped;\n      const object = canonicaliseFactBody(tokens.slice(i + 1).join(' '));\n      if (subject.length === 0 || object.length === 0) continue;\n      return { subject, predicate, object };\n    }\n  }\n  return null;\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAgB,qBAAqB,MAAsB;AACzD,QAAO,KAAK,QAAQ,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa;;;;;;;AAQvD,SAAgB,aAAa,MAAsB;AACjD,QAAO,IAAI,KAAK;;;AAIlB,SAAgB,iBAAiB,OAAe,MAA0B;CACxE,MAAM,SAAS,qBAAqB,MAAM,CAAC,MAAM,IAAI;CACrD,MAAM,OAAO,IAAI,IAAI,KAAK,iBAAiB,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AACvE,QAAO,OAAO,QAAQ,UAAU,MAAM,SAAS,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,KAAK,IAAI;;;;;;;;;;AAWjF,SAAgB,4BACd,MACA,MAC0F;CAC1F,MAAM,YAAY,qBAAqB,KAAK;AAC5C,KAAI,UAAU,WAAW,EAAG,QAAO;CACnC,MAAM,SAAS,UAAU,MAAM,IAAI;CACnC,MAAM,QAAQ,IAAI,IAAI,KAAK,qBAAqB,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AAC5E,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AACrB,MAAI,UAAU,OAAW;EACzB,MAAM,WAAW,MAAM,QAAQ,aAAa,GAAG;AAC/C,MAAI,MAAM,IAAI,SAAS,EAAE;GACvB,MAAM,UAAU,iBAAiB,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,EAAE,KAAK;GACpE,MAAM,YAAY;GAClB,MAAM,SAAS,qBAAqB,OAAO,MAAM,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC;AAClE,OAAI,QAAQ,WAAW,KAAK,OAAO,WAAW,EAAG;AACjD,UAAO;IAAE;IAAS;IAAW;IAAQ;;;AAGzC,QAAO"}
+{"version":3,"file":"helpers.js","names":[],"sources":["../../../src/conflict/stages/helpers.ts"],"sourcesContent":["/**\n * Internal helpers shared across the five pipeline stages.\n *\n * @packageDocumentation\n * @internal\n */\n\nimport { md5 } from '@graphorin/core';\nimport type { LocalePack } from '../locale-packs/index.js';\n\n/**\n * Lowercase + collapse whitespace + trim. Used by Stage 1 (exact\n * dedup) to compute the canonical fact body that feeds the MD5\n * comparison.\n */\nexport function canonicaliseFactBody(text: string): string {\n  return text.replace(/\\s+/g, ' ').trim().toLowerCase();\n}\n\n/**\n * Stable hash for a canonical fact body. We re-use the framework's\n * MD5 helper to stay consistent with the storage layer's existing\n * dedup hash column (see `facts.hash`).\n */\nexport function fastFactHash(text: string): string {\n  return md5(text);\n}\n\n/** Strip leading articles + trim a candidate subject token. */\nexport function normaliseSubject(input: string, pack: LocalePack): string {\n  const tokens = canonicaliseFactBody(input).split(' ');\n  const stop = new Set(pack.subjectStopWords.map((s) => s.toLowerCase()));\n  return tokens.filter((token) => token.length > 0 && !stop.has(token)).join(' ');\n}\n\n/**\n * Naive subject / predicate / object split. The locale pack supplies\n * the verb tokens used as predicate normalisers - the first matching\n * verb in the sentence becomes the predicate and splits the rest\n * into subject (left side) and object (right side). The split is\n * intentionally simple: anything more clever lives behind the entity-\n * linking layer (post-MVP).\n */\nexport function splitSubjectPredicateObject(\n  text: string,\n  pack: LocalePack,\n): { readonly subject: string; readonly predicate: string; readonly object: string } | null {\n  const canonical = canonicaliseFactBody(text);\n  if (canonical.length === 0) return null;\n  const tokens = canonical.split(' ');\n  const verbs = new Set(pack.predicateNormalisers.map((v) => v.toLowerCase()));\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n    if (token === undefined) continue;\n    const stripped = token.replace(/[.,!?;:]/g, '');\n    if (verbs.has(stripped)) {\n      const subject = normaliseSubject(tokens.slice(0, i).join(' '), pack);\n      const predicate = stripped;\n      const object = canonicaliseFactBody(tokens.slice(i + 1).join(' '));\n      if (subject.length === 0 || object.length === 0) continue;\n      return { subject, predicate, object };\n    }\n  }\n  return null;\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAgB,qBAAqB,MAAsB;AACzD,QAAO,KAAK,QAAQ,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa;;;;;;;AAQvD,SAAgB,aAAa,MAAsB;AACjD,QAAO,IAAI,KAAK;;;AAIlB,SAAgB,iBAAiB,OAAe,MAA0B;CACxE,MAAM,SAAS,qBAAqB,MAAM,CAAC,MAAM,IAAI;CACrD,MAAM,OAAO,IAAI,IAAI,KAAK,iBAAiB,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AACvE,QAAO,OAAO,QAAQ,UAAU,MAAM,SAAS,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,KAAK,IAAI;;;;;;;;;;AAWjF,SAAgB,4BACd,MACA,MAC0F;CAC1F,MAAM,YAAY,qBAAqB,KAAK;AAC5C,KAAI,UAAU,WAAW,EAAG,QAAO;CACnC,MAAM,SAAS,UAAU,MAAM,IAAI;CACnC,MAAM,QAAQ,IAAI,IAAI,KAAK,qBAAqB,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AAC5E,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AACrB,MAAI,UAAU,OAAW;EACzB,MAAM,WAAW,MAAM,QAAQ,aAAa,GAAG;AAC/C,MAAI,MAAM,IAAI,SAAS,EAAE;GACvB,MAAM,UAAU,iBAAiB,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,EAAE,KAAK;GACpE,MAAM,YAAY;GAClB,MAAM,SAAS,qBAAqB,OAAO,MAAM,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC;AAClE,OAAI,QAAQ,WAAW,KAAK,OAAO,WAAW,EAAG;AACjD,UAAO;IAAE;IAAS;IAAW;IAAQ;;;AAGzC,QAAO"}

package/dist/conflict/stages/stage1-exact-dedup.js.map

@@ -1 +1 @@
-{"version":3,"file":"stage1-exact-dedup.js","names":["stage1ExactDedup: PipelineStage"],"sources":["../../../src/conflict/stages/stage1-exact-dedup.ts"],"sourcesContent":["/**\n * Stage 1 — Exact dedup. Computes an MD5 hash on the canonical fact\n * body (lowercase + trimmed + collapsed whitespace) and short-circuits\n * to `dedup` when an existing fact in the supplied vector hit list\n * shares the same canonical form.\n *\n * Stage 1 only inspects `existing` when Stage 2 already populated it\n * for the orchestrator (re-using the embedding round-trip). When the\n * orchestrator calls Stage 1 with an empty list the stage falls\n * through to `'continue'` — Stage 2 will gather candidates and Stage 1\n * is folded into Stage 2's HOT zone via the same canonical-form\n * comparison.\n *\n * @packageDocumentation\n */\n\nimport type { PipelineStage } from '../types.js';\nimport { canonicaliseFactBody, fastFactHash } from './helpers.js';\n\nexport const stage1ExactDedup: PipelineStage = {\n  id: 'exact-dedup',\n  async evaluate(ctx) {\n    const candidateHash = fastFactHash(canonicaliseFactBody(ctx.candidate.text));\n    if (ctx.existing.length === 0) {\n      return { kind: 'continue' };\n    }\n    for (const hit of ctx.existing) {\n      const existingHash = fastFactHash(canonicaliseFactBody(hit.record.text));\n      if (existingHash === candidateHash) {\n        return {\n          kind: 'dedup',\n          existingId: hit.record.id,\n          similarity: 1,\n          reason: 'exact-hash-match',\n        };\n      }\n    }\n    return { kind: 'continue' };\n  },\n};\n"],"mappings":";;;AAmBA,MAAaA,mBAAkC;CAC7C,IAAI;CACJ,MAAM,SAAS,KAAK;EAClB,MAAM,gBAAgB,aAAa,qBAAqB,IAAI,UAAU,KAAK,CAAC;AAC5E,MAAI,IAAI,SAAS,WAAW,EAC1B,QAAO,EAAE,MAAM,YAAY;AAE7B,OAAK,MAAM,OAAO,IAAI,SAEpB,KADqB,aAAa,qBAAqB,IAAI,OAAO,KAAK,CAAC,KACnD,cACnB,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB,YAAY;GACZ,QAAQ;GACT;AAGL,SAAO,EAAE,MAAM,YAAY;;CAE9B"}
+{"version":3,"file":"stage1-exact-dedup.js","names":["stage1ExactDedup: PipelineStage"],"sources":["../../../src/conflict/stages/stage1-exact-dedup.ts"],"sourcesContent":["/**\n * Stage 1 - Exact dedup. Computes an MD5 hash on the canonical fact\n * body (lowercase + trimmed + collapsed whitespace) and short-circuits\n * to `dedup` when an existing fact in the supplied vector hit list\n * shares the same canonical form.\n *\n * Stage 1 only inspects `existing` when Stage 2 already populated it\n * for the orchestrator (re-using the embedding round-trip). When the\n * orchestrator calls Stage 1 with an empty list the stage falls\n * through to `'continue'` - Stage 2 will gather candidates and Stage 1\n * is folded into Stage 2's HOT zone via the same canonical-form\n * comparison.\n *\n * @packageDocumentation\n */\n\nimport type { PipelineStage } from '../types.js';\nimport { canonicaliseFactBody, fastFactHash } from './helpers.js';\n\nexport const stage1ExactDedup: PipelineStage = {\n  id: 'exact-dedup',\n  async evaluate(ctx) {\n    const candidateHash = fastFactHash(canonicaliseFactBody(ctx.candidate.text));\n    if (ctx.existing.length === 0) {\n      return { kind: 'continue' };\n    }\n    for (const hit of ctx.existing) {\n      const existingHash = fastFactHash(canonicaliseFactBody(hit.record.text));\n      if (existingHash === candidateHash) {\n        return {\n          kind: 'dedup',\n          existingId: hit.record.id,\n          similarity: 1,\n          reason: 'exact-hash-match',\n        };\n      }\n    }\n    return { kind: 'continue' };\n  },\n};\n"],"mappings":";;;AAmBA,MAAaA,mBAAkC;CAC7C,IAAI;CACJ,MAAM,SAAS,KAAK;EAClB,MAAM,gBAAgB,aAAa,qBAAqB,IAAI,UAAU,KAAK,CAAC;AAC5E,MAAI,IAAI,SAAS,WAAW,EAC1B,QAAO,EAAE,MAAM,YAAY;AAE7B,OAAK,MAAM,OAAO,IAAI,SAEpB,KADqB,aAAa,qBAAqB,IAAI,OAAO,KAAK,CAAC,KACnD,cACnB,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB,YAAY;GACZ,QAAQ;GACT;AAGL,SAAO,EAAE,MAAM,YAAY;;CAE9B"}