@graphorin/memory 0.6.0 → 0.7.0

package/dist/tiers/episodic-memory.js.map

@@ -1 +1 @@
-{"version":3,"file":"episodic-memory.js","names":["DEFAULT_WEIGHTS: EpisodeRetrievalWeights","#store","#tracer","#embedder","#embedderIdProvider","episode: Episode","#tryVectorSearch"],"sources":["../../src/tiers/episodic-memory.ts"],"sourcesContent":["import type {\n  EmbedderProvider,\n  Episode,\n  MemoryHit,\n  MemoryOwner,\n  MemoryProvenance,\n  MemoryStatus,\n  Sensitivity,\n  SessionScope,\n  Tracer,\n} from '@graphorin/core';\nimport { QuarantinePromotionRefusedError } from '../errors/index.js';\nimport { newMemoryId } from '../internal/id.js';\nimport { detectMemoryInjection } from '../internal/injection-heuristics.js';\nimport { withMemorySpan } from '../internal/spans.js';\nimport type { MemoryStoreAdapter } from '../internal/storage-adapter.js';\n\n/**\n * Author-time episode payload. The framework derives `id`,\n * `kind: 'episodic'`, `userId`, `createdAt`, `updatedAt`, and the\n * `embedder_id` from the surrounding `EpisodicMemory.record(...)`\n * call.\n *\n * @stable\n */\nexport interface EpisodeInput {\n  readonly summary: string;\n  readonly startedAt: string;\n  readonly endedAt: string;\n  /** Optional importance score in `[0, 1]`. */\n  readonly importance?: number;\n  readonly sensitivity?: Sensitivity;\n  readonly tags?: ReadonlyArray<string>;\n  /**\n   * Trust-provenance tag (P1-4). Episodes auto-formed by the\n   * consolidator pass `'extraction'` so they land quarantined; omit\n   * (defaults to first-party `active`) for user-authored episodes.\n   */\n  readonly provenance?: MemoryProvenance;\n  /**\n   * Retrieval-trust state (P1-4). Defaults to `active`; the\n   * consolidator records auto-formed episodes as `'quarantined'` so\n   * they are excluded from action-driving recall until validated.\n   */\n  readonly status?: MemoryStatus;\n  /** Principal dimension (D3). `'agent'` on auto-formed episodes. */\n  readonly owner?: MemoryOwner;\n}\n\n/**\n * Triple-signal episode retrieval weights. Defaults match DEC-105:\n * `recency 0.3`, `relevance 0.5`, `importance 0.2`. Implementations\n * normalize the weighted sum back to `[0, 1]`.\n *\n * @stable\n */\nexport interface EpisodeRetrievalWeights {\n  readonly recency: number;\n  readonly relevance: number;\n  readonly importance: number;\n}\n\nconst DEFAULT_WEIGHTS: EpisodeRetrievalWeights = Object.freeze({\n  recency: 0.3,\n  relevance: 0.5,\n  importance: 0.2,\n});\n\n/**\n * Per-call options accepted by {@link EpisodicMemory.search}.\n *\n * @stable\n */\nexport interface EpisodeSearchOptions {\n  readonly topK?: number;\n  readonly signal?: AbortSignal;\n  readonly weights?: EpisodeRetrievalWeights;\n  readonly dateRange?: { readonly from?: string; readonly to?: string };\n  /**\n   * Point-in-time (\"as of\") read. When set, only episodes that had\n   * started by this instant (`started_at <= asOf`) are returned.\n   * ISO-8601. Absent ⇒ current behaviour is unchanged. P0-2.\n   *\n   * @stable\n   */\n  readonly asOf?: string;\n  /**\n   * Include quarantined episodes in the result set (P1-4). Defaults to\n   * `false`: action-driving recall never returns quarantined rows. Set\n   * `true` only for the validation / inspector path - never for\n   * auto-recall fed back into the model. Auto-formed episodes (P1-2)\n   * land quarantined, so this is how an operator surfaces them for\n   * review.\n   *\n   * @stable\n   */\n  readonly includeQuarantined?: boolean;\n}\n\n/**\n * `EpisodicMemory` - record + retrieve summarized stretches of past\n * activity. Stored embeddings power triple-signal retrieval (recency\n * × relevance × importance).\n *\n * @stable\n */\nexport class EpisodicMemory {\n  readonly #store: MemoryStoreAdapter;\n  readonly #tracer: Tracer;\n  readonly #embedder: EmbedderProvider | null;\n  readonly #embedderIdProvider: () => string | null;\n\n  constructor(args: {\n    store: MemoryStoreAdapter;\n    tracer: Tracer;\n    embedder: EmbedderProvider | null;\n    embedderIdProvider: () => string | null;\n  }) {\n    this.#store = args.store;\n    this.#tracer = args.tracer;\n    this.#embedder = args.embedder;\n    this.#embedderIdProvider = args.embedderIdProvider;\n  }\n\n  /** Persist an episode + its embedding (when an embedder is configured). */\n  async record(scope: SessionScope, input: EpisodeInput): Promise<Episode> {\n    return withMemorySpan(this.#tracer, 'memory.write.episodic', scope, {}, async (span) => {\n      const now = new Date().toISOString();\n      const episode: Episode = {\n        id: newMemoryId('ep'),\n        kind: 'episodic',\n        userId: scope.userId,\n        ...(scope.sessionId !== undefined ? { sessionId: scope.sessionId } : {}),\n        ...(scope.agentId !== undefined ? { agentId: scope.agentId } : {}),\n        sensitivity: input.sensitivity ?? 'internal',\n        summary: input.summary,\n        startedAt: input.startedAt,\n        endedAt: input.endedAt,\n        ...(input.importance !== undefined ? { importance: input.importance } : {}),\n        ...(input.tags !== undefined ? { tags: Object.freeze([...input.tags]) } : {}),\n        ...(input.provenance !== undefined ? { provenance: input.provenance } : {}),\n        ...(input.status !== undefined ? { status: input.status } : {}),\n        ...(input.owner !== undefined ? { owner: input.owner } : {}),\n        createdAt: now,\n        updatedAt: now,\n      };\n      const embedderId = this.#embedderIdProvider();\n      if (\n        this.#embedder !== null &&\n        embedderId !== null &&\n        typeof this.#store.episodic.putWithEmbedding === 'function'\n      ) {\n        // PS-10: a stored episode summary is the `passage` role for E5.\n        const [vector] = await this.#embedder.embed([input.summary], { taskType: 'passage' });\n        if (vector !== undefined) {\n          await this.#store.episodic.putWithEmbedding(episode, {\n            embedding: { embedderId, vector },\n          });\n        } else {\n          await this.#store.episodic.put(episode);\n        }\n      } else {\n        await this.#store.episodic.put(episode);\n      }\n      span.setAttributes({\n        'memory.episodic.summary_length': input.summary.length,\n        ...(input.importance !== undefined\n          ? { 'memory.episodic.importance': input.importance }\n          : {}),\n      });\n      return episode;\n    });\n  }\n\n  /** Lookup a single episode by id. */\n  async get(id: string): Promise<Episode | null> {\n    return this.#store.episodic.get(id);\n  }\n\n  /**\n   * Triple-signal episode retrieval (`recency × relevance ×\n   * importance`). The vector signal is computed on demand when an\n   * embedder is configured AND the storage adapter exposes\n   * `searchVector`; otherwise the FTS5 BM25 score is fed into the\n   * relevance term as a normalized fallback.\n   */\n  async search(\n    scope: SessionScope,\n    query: string,\n    opts: EpisodeSearchOptions = {},\n  ): Promise<ReadonlyArray<MemoryHit<Episode>>> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.search.episodic',\n      scope,\n      { 'memory.search.query_length': query.length },\n      async (span) => {\n        const topK = opts.topK ?? 10;\n        const weights = opts.weights ?? DEFAULT_WEIGHTS;\n        const ftsHits = await this.#store.episodic.search(scope, {\n          query,\n          topK: topK * 2,\n          ...(opts.asOf !== undefined ? { asOf: opts.asOf } : {}),\n          // MRET-4: forward the date filter - it was accepted by the\n          // recall_episodes tool and silently dropped right here.\n          ...(opts.dateRange !== undefined ? { dateRange: opts.dateRange } : {}),\n          ...(opts.signal !== undefined ? { signal: opts.signal } : {}),\n          ...(opts.includeQuarantined !== undefined\n            ? { includeQuarantined: opts.includeQuarantined }\n            : {}),\n        });\n        const vectorHits = await this.#tryVectorSearch(\n          scope,\n          query,\n          topK * 2,\n          opts.asOf,\n          opts.includeQuarantined,\n        );\n        // MRET-4: the vector leg's store signature is positional (no\n        // dateRange parameter) - apply the same overlap semantics to its\n        // hits so both legs agree before the merge.\n        const from = opts.dateRange?.from !== undefined ? Date.parse(opts.dateRange.from) : null;\n        const to = opts.dateRange?.to !== undefined ? Date.parse(opts.dateRange.to) : null;\n        const rangedVectorHits =\n          from !== null || to !== null\n            ? vectorHits.filter((h) => {\n                if (from !== null && Date.parse(h.record.endedAt) < from) return false;\n                if (to !== null && Date.parse(h.record.startedAt) > to) return false;\n                return true;\n              })\n            : vectorHits;\n        const merged = mergeRecency(ftsHits, rangedVectorHits, weights);\n        const finalHits = merged.slice(0, topK);\n        span.setAttributes({\n          'memory.search.episodic.fts_count': ftsHits.length,\n          'memory.search.episodic.vector_count': vectorHits.length,\n          'memory.search.episodic.final_count': finalHits.length,\n          ...(opts.asOf !== undefined ? { 'memory.search.episodic.as_of': opts.asOf } : {}),\n        });\n        return finalHits;\n      },\n    );\n  }\n\n  /**\n   * Soft-archive an episode. Storage adapters that implement\n   * `EpisodicMemoryStoreExt.archive(...)` mark the row archived in\n   * place. Adapters that do not expose the extension surface a\n   * friendly `TypeError` so the operator can opt the storage layer\n   * in (or call `episodic.put(...)` with the archived state set\n   * manually).\n   */\n  async archive(scope: SessionScope, episodeId: string, reason?: string): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.episodic',\n      scope,\n      { 'memory.episodic.action': 'archive', 'memory.episodic.episode_id': episodeId },\n      async () => {\n        if (typeof this.#store.episodic.archive !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] EpisodicMemory.archive(...) requires a storage adapter that implements `episodic.archive(id)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via EpisodicMemoryStoreExt.',\n          );\n        }\n        await this.#store.episodic.archive(episodeId, reason);\n      },\n    );\n  }\n\n  /**\n   * Most-recent episodes by end time (newest first), with no embedding / FTS\n   * query (MCON-1). Requires `EpisodicMemoryStoreExt.listRecent` - the default\n   * `@graphorin/store-sqlite` adapter implements it. Optionally includes\n   * quarantined episodes (the importance source for the reflection gate).\n   */\n  async listRecent(\n    scope: SessionScope,\n    limit: number,\n    opts: { includeQuarantined?: boolean } = {},\n  ): Promise<ReadonlyArray<Episode>> {\n    return withMemorySpan(this.#tracer, 'memory.read.episodic', scope, {}, async (span) => {\n      const store = this.#store.episodic;\n      if (typeof store.listRecent !== 'function') {\n        throw new Error(\n          '[graphorin/memory] EpisodicMemory.listRecent requires EpisodicMemoryStoreExt.listRecent. ' +\n            'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in.',\n        );\n      }\n      const out = await store.listRecent(scope, limit, opts);\n      span.setAttributes({ 'memory.read.episodic.count': out.length });\n      return out;\n    });\n  }\n\n  /** List the most recent episodes (no embedding required). */\n  async recent(scope: SessionScope, opts: { topK?: number } = {}): Promise<ReadonlyArray<Episode>> {\n    return this.listRecent(scope, opts.topK ?? 10, {});\n  }\n\n  /**\n   * Promote a quarantined episode into default recall (MCON-2). Mirrors\n   * {@link SemanticMemory.validate}: re-derives the injection verdict from the\n   * stored summary and **refuses** promotion of an injection-flagged episode\n   * (`QuarantinePromotionRefusedError`) unless an operator passes\n   * `{ force: true }` from a trusted, non-agent context.\n   */\n  async validate(\n    scope: SessionScope,\n    episodeId: string,\n    reason?: string,\n    options?: { readonly force?: boolean },\n  ): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.episodic',\n      scope,\n      { 'memory.episodic.action': 'validate', 'memory.episodic.episode_id': episodeId },\n      async (span) => {\n        const store = this.#store.episodic;\n        if (typeof store.setStatus !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] EpisodicMemory.validate(...) requires a storage adapter that implements `episodic.setStatus(id, status)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via EpisodicMemoryStoreExt.',\n          );\n        }\n        const force = options?.force === true;\n        const existing = await store.get(episodeId);\n        if (existing !== null && !force) {\n          const injection = detectMemoryInjection(existing.summary);\n          if (injection.flagged) {\n            span.setAttributes({ 'memory.episodic.validate.refused': true });\n            throw new QuarantinePromotionRefusedError(episodeId, injection.markers);\n          }\n        }\n        span.setAttributes({ 'memory.episodic.validate.forced': force });\n        await store.setStatus(episodeId, 'active', reason);\n      },\n    );\n  }\n\n  async #tryVectorSearch(\n    scope: SessionScope,\n    query: string,\n    topK: number,\n    asOf?: string,\n    includeQuarantined?: boolean,\n  ): Promise<ReadonlyArray<MemoryHit<Episode>>> {\n    const embedderId = this.#embedderIdProvider();\n    if (\n      this.#embedder === null ||\n      embedderId === null ||\n      typeof this.#store.episodic.searchVector !== 'function'\n    ) {\n      return [];\n    }\n    // PS-10: a search query is the `query` role for E5.\n    const [vector] = await this.#embedder.embed([query], { taskType: 'query' });\n    if (vector === undefined) return [];\n    return this.#store.episodic.searchVector(\n      scope,\n      vector,\n      embedderId,\n      topK,\n      asOf,\n      includeQuarantined,\n    );\n  }\n}\n\nfunction mergeRecency(\n  ftsHits: ReadonlyArray<MemoryHit<Episode>>,\n  vectorHits: ReadonlyArray<MemoryHit<Episode>>,\n  weights: EpisodeRetrievalWeights,\n): ReadonlyArray<MemoryHit<Episode>> {\n  const now = Date.now();\n  const aggregates = new Map<\n    string,\n    {\n      record: Episode;\n      relevance: number;\n      recency: number;\n      importance: number;\n      score: number;\n      signals: Record<string, number>;\n    }\n  >();\n  for (const hit of ftsHits) {\n    const id = hit.record.id;\n    const recency = computeRecency(now, hit.record);\n    const importance = hit.record.importance ?? 0;\n    const relevance = normalizeRelevance(hit.score);\n    const score =\n      weights.recency * recency + weights.relevance * relevance + weights.importance * importance;\n    aggregates.set(id, {\n      record: hit.record,\n      relevance,\n      recency,\n      importance,\n      score,\n      signals: { fts: relevance, recency, importance },\n    });\n  }\n  for (const hit of vectorHits) {\n    const id = hit.record.id;\n    const cosine = clamp01(hit.score);\n    const existing = aggregates.get(id);\n    if (existing === undefined) {\n      const recency = computeRecency(now, hit.record);\n      const importance = hit.record.importance ?? 0;\n      const score =\n        weights.recency * recency + weights.relevance * cosine + weights.importance * importance;\n      aggregates.set(id, {\n        record: hit.record,\n        relevance: cosine,\n        recency,\n        importance,\n        score,\n        signals: { vector: cosine, recency, importance },\n      });\n    } else {\n      const blended = Math.max(existing.relevance, cosine);\n      existing.relevance = blended;\n      existing.score =\n        weights.recency * existing.recency +\n        weights.relevance * blended +\n        weights.importance * existing.importance;\n      existing.signals.vector = cosine;\n      existing.signals['rrf-blend'] = blended;\n    }\n  }\n  const out = Array.from(aggregates.values()).map((a) => ({\n    record: a.record,\n    score: a.score,\n    signals: Object.freeze({ ...a.signals }),\n  }));\n  out.sort((a, b) => b.score - a.score);\n  return out;\n}\n\nfunction computeRecency(now: number, episode: Episode): number {\n  const ended = Date.parse(episode.endedAt);\n  if (!Number.isFinite(ended)) return 0;\n  const elapsedDays = Math.max(0, (now - ended) / (24 * 60 * 60 * 1000));\n  return Math.exp(-elapsedDays / 30);\n}\n\nfunction normalizeRelevance(score: number): number {\n  // MRET-5/MST-7: the store returns `score = -bm25(...)` - POSITIVE for\n  // every FTS match (SQLite bm25 is always negative), so the old\n  // `1 / (1 + max(0, -score))` collapsed every lexical hit to exactly\n  // 1.0 and the DEC-105 triple-signal ranking degraded to\n  // recency + importance. Saturating ratio: 0 at no signal, → 1 as the\n  // match strengthens, graduated in between (k = 1 half-point).\n  return clamp01(Math.max(0, score) / (Math.max(0, score) + 1));\n}\n\nfunction clamp01(value: number): number {\n  if (Number.isNaN(value)) return 0;\n  if (value < 0) return 0;\n  if (value > 1) return 1;\n  return value;\n}\n"],"mappings":";;;;;;AA8DA,MAAMA,kBAA2C,OAAO,OAAO;CAC7D,SAAS;CACT,WAAW;CACX,YAAY;CACb,CAAC;;;;;;;;AAwCF,IAAa,iBAAb,MAA4B;CAC1B,CAASC;CACT,CAASC;CACT,CAASC;CACT,CAASC;CAET,YAAY,MAKT;AACD,QAAKH,QAAS,KAAK;AACnB,QAAKC,SAAU,KAAK;AACpB,QAAKC,WAAY,KAAK;AACtB,QAAKC,qBAAsB,KAAK;;;CAIlC,MAAM,OAAO,OAAqB,OAAuC;AACvE,SAAO,eAAe,MAAKF,QAAS,yBAAyB,OAAO,EAAE,EAAE,OAAO,SAAS;GACtF,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;GACpC,MAAMG,UAAmB;IACvB,IAAI,YAAY,KAAK;IACrB,MAAM;IACN,QAAQ,MAAM;IACd,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,GAAI,MAAM,YAAY,SAAY,EAAE,SAAS,MAAM,SAAS,GAAG,EAAE;IACjE,aAAa,MAAM,eAAe;IAClC,SAAS,MAAM;IACf,WAAW,MAAM;IACjB,SAAS,MAAM;IACf,GAAI,MAAM,eAAe,SAAY,EAAE,YAAY,MAAM,YAAY,GAAG,EAAE;IAC1E,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,GAAG,EAAE;IAC5E,GAAI,MAAM,eAAe,SAAY,EAAE,YAAY,MAAM,YAAY,GAAG,EAAE;IAC1E,GAAI,MAAM,WAAW,SAAY,EAAE,QAAQ,MAAM,QAAQ,GAAG,EAAE;IAC9D,GAAI,MAAM,UAAU,SAAY,EAAE,OAAO,MAAM,OAAO,GAAG,EAAE;IAC3D,WAAW;IACX,WAAW;IACZ;GACD,MAAM,aAAa,MAAKD,oBAAqB;AAC7C,OACE,MAAKD,aAAc,QACnB,eAAe,QACf,OAAO,MAAKF,MAAO,SAAS,qBAAqB,YACjD;IAEA,MAAM,CAAC,UAAU,MAAM,MAAKE,SAAU,MAAM,CAAC,MAAM,QAAQ,EAAE,EAAE,UAAU,WAAW,CAAC;AACrF,QAAI,WAAW,OACb,OAAM,MAAKF,MAAO,SAAS,iBAAiB,SAAS,EACnD,WAAW;KAAE;KAAY;KAAQ,EAClC,CAAC;QAEF,OAAM,MAAKA,MAAO,SAAS,IAAI,QAAQ;SAGzC,OAAM,MAAKA,MAAO,SAAS,IAAI,QAAQ;AAEzC,QAAK,cAAc;IACjB,kCAAkC,MAAM,QAAQ;IAChD,GAAI,MAAM,eAAe,SACrB,EAAE,8BAA8B,MAAM,YAAY,GAClD,EAAE;IACP,CAAC;AACF,UAAO;IACP;;;CAIJ,MAAM,IAAI,IAAqC;AAC7C,SAAO,MAAKA,MAAO,SAAS,IAAI,GAAG;;;;;;;;;CAUrC,MAAM,OACJ,OACA,OACA,OAA6B,EAAE,EACa;AAC5C,SAAO,eACL,MAAKC,QACL,0BACA,OACA,EAAE,8BAA8B,MAAM,QAAQ,EAC9C,OAAO,SAAS;GACd,MAAM,OAAO,KAAK,QAAQ;GAC1B,MAAM,UAAU,KAAK,WAAW;GAChC,MAAM,UAAU,MAAM,MAAKD,MAAO,SAAS,OAAO,OAAO;IACvD;IACA,MAAM,OAAO;IACb,GAAI,KAAK,SAAS,SAAY,EAAE,MAAM,KAAK,MAAM,GAAG,EAAE;IAGtD,GAAI,KAAK,cAAc,SAAY,EAAE,WAAW,KAAK,WAAW,GAAG,EAAE;IACrE,GAAI,KAAK,WAAW,SAAY,EAAE,QAAQ,KAAK,QAAQ,GAAG,EAAE;IAC5D,GAAI,KAAK,uBAAuB,SAC5B,EAAE,oBAAoB,KAAK,oBAAoB,GAC/C,EAAE;IACP,CAAC;GACF,MAAM,aAAa,MAAM,MAAKK,gBAC5B,OACA,OACA,OAAO,GACP,KAAK,MACL,KAAK,mBACN;GAID,MAAM,OAAO,KAAK,WAAW,SAAS,SAAY,KAAK,MAAM,KAAK,UAAU,KAAK,GAAG;GACpF,MAAM,KAAK,KAAK,WAAW,OAAO,SAAY,KAAK,MAAM,KAAK,UAAU,GAAG,GAAG;GAU9E,MAAM,YADS,aAAa,SAP1B,SAAS,QAAQ,OAAO,OACpB,WAAW,QAAQ,MAAM;AACvB,QAAI,SAAS,QAAQ,KAAK,MAAM,EAAE,OAAO,QAAQ,GAAG,KAAM,QAAO;AACjE,QAAI,OAAO,QAAQ,KAAK,MAAM,EAAE,OAAO,UAAU,GAAG,GAAI,QAAO;AAC/D,WAAO;KACP,GACF,YACiD,QAAQ,CACtC,MAAM,GAAG,KAAK;AACvC,QAAK,cAAc;IACjB,oCAAoC,QAAQ;IAC5C,uCAAuC,WAAW;IAClD,sCAAsC,UAAU;IAChD,GAAI,KAAK,SAAS,SAAY,EAAE,gCAAgC,KAAK,MAAM,GAAG,EAAE;IACjF,CAAC;AACF,UAAO;IAEV;;;;;;;;;;CAWH,MAAM,QAAQ,OAAqB,WAAmB,QAAgC;AACpF,QAAM,eACJ,MAAKJ,QACL,yBACA,OACA;GAAE,0BAA0B;GAAW,8BAA8B;GAAW,EAChF,YAAY;AACV,OAAI,OAAO,MAAKD,MAAO,SAAS,YAAY,WAC1C,OAAM,IAAI,UACR,wOAED;AAEH,SAAM,MAAKA,MAAO,SAAS,QAAQ,WAAW,OAAO;IAExD;;;;;;;;CASH,MAAM,WACJ,OACA,OACA,OAAyC,EAAE,EACV;AACjC,SAAO,eAAe,MAAKC,QAAS,wBAAwB,OAAO,EAAE,EAAE,OAAO,SAAS;GACrF,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,eAAe,WAC9B,OAAM,IAAI,MACR,oLAED;GAEH,MAAM,MAAM,MAAM,MAAM,WAAW,OAAO,OAAO,KAAK;AACtD,QAAK,cAAc,EAAE,8BAA8B,IAAI,QAAQ,CAAC;AAChE,UAAO;IACP;;;CAIJ,MAAM,OAAO,OAAqB,OAA0B,EAAE,EAAmC;AAC/F,SAAO,KAAK,WAAW,OAAO,KAAK,QAAQ,IAAI,EAAE,CAAC;;;;;;;;;CAUpD,MAAM,SACJ,OACA,WACA,QACA,SACe;AACf,QAAM,eACJ,MAAKC,QACL,yBACA,OACA;GAAE,0BAA0B;GAAY,8BAA8B;GAAW,EACjF,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,cAAc,WAC7B,OAAM,IAAI,UACR,mPAED;GAEH,MAAM,QAAQ,SAAS,UAAU;GACjC,MAAM,WAAW,MAAM,MAAM,IAAI,UAAU;AAC3C,OAAI,aAAa,QAAQ,CAAC,OAAO;IAC/B,MAAM,YAAY,sBAAsB,SAAS,QAAQ;AACzD,QAAI,UAAU,SAAS;AACrB,UAAK,cAAc,EAAE,oCAAoC,MAAM,CAAC;AAChE,WAAM,IAAI,gCAAgC,WAAW,UAAU,QAAQ;;;AAG3E,QAAK,cAAc,EAAE,mCAAmC,OAAO,CAAC;AAChE,SAAM,MAAM,UAAU,WAAW,UAAU,OAAO;IAErD;;CAGH,OAAMK,gBACJ,OACA,OACA,MACA,MACA,oBAC4C;EAC5C,MAAM,aAAa,MAAKF,oBAAqB;AAC7C,MACE,MAAKD,aAAc,QACnB,eAAe,QACf,OAAO,MAAKF,MAAO,SAAS,iBAAiB,WAE7C,QAAO,EAAE;EAGX,MAAM,CAAC,UAAU,MAAM,MAAKE,SAAU,MAAM,CAAC,MAAM,EAAE,EAAE,UAAU,SAAS,CAAC;AAC3E,MAAI,WAAW,OAAW,QAAO,EAAE;AACnC,SAAO,MAAKF,MAAO,SAAS,aAC1B,OACA,QACA,YACA,MACA,MACA,mBACD;;;AAIL,SAAS,aACP,SACA,YACA,SACmC;CACnC,MAAM,MAAM,KAAK,KAAK;CACtB,MAAM,6BAAa,IAAI,KAUpB;AACH,MAAK,MAAM,OAAO,SAAS;EACzB,MAAM,KAAK,IAAI,OAAO;EACtB,MAAM,UAAU,eAAe,KAAK,IAAI,OAAO;EAC/C,MAAM,aAAa,IAAI,OAAO,cAAc;EAC5C,MAAM,YAAY,mBAAmB,IAAI,MAAM;EAC/C,MAAM,QACJ,QAAQ,UAAU,UAAU,QAAQ,YAAY,YAAY,QAAQ,aAAa;AACnF,aAAW,IAAI,IAAI;GACjB,QAAQ,IAAI;GACZ;GACA;GACA;GACA;GACA,SAAS;IAAE,KAAK;IAAW;IAAS;IAAY;GACjD,CAAC;;AAEJ,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,KAAK,IAAI,OAAO;EACtB,MAAM,SAAS,QAAQ,IAAI,MAAM;EACjC,MAAM,WAAW,WAAW,IAAI,GAAG;AACnC,MAAI,aAAa,QAAW;GAC1B,MAAM,UAAU,eAAe,KAAK,IAAI,OAAO;GAC/C,MAAM,aAAa,IAAI,OAAO,cAAc;GAC5C,MAAM,QACJ,QAAQ,UAAU,UAAU,QAAQ,YAAY,SAAS,QAAQ,aAAa;AAChF,cAAW,IAAI,IAAI;IACjB,QAAQ,IAAI;IACZ,WAAW;IACX;IACA;IACA;IACA,SAAS;KAAE,QAAQ;KAAQ;KAAS;KAAY;IACjD,CAAC;SACG;GACL,MAAM,UAAU,KAAK,IAAI,SAAS,WAAW,OAAO;AACpD,YAAS,YAAY;AACrB,YAAS,QACP,QAAQ,UAAU,SAAS,UAC3B,QAAQ,YAAY,UACpB,QAAQ,aAAa,SAAS;AAChC,YAAS,QAAQ,SAAS;AAC1B,YAAS,QAAQ,eAAe;;;CAGpC,MAAM,MAAM,MAAM,KAAK,WAAW,QAAQ,CAAC,CAAC,KAAK,OAAO;EACtD,QAAQ,EAAE;EACV,OAAO,EAAE;EACT,SAAS,OAAO,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC;EACzC,EAAE;AACH,KAAI,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AACrC,QAAO;;AAGT,SAAS,eAAe,KAAa,SAA0B;CAC7D,MAAM,QAAQ,KAAK,MAAM,QAAQ,QAAQ;AACzC,KAAI,CAAC,OAAO,SAAS,MAAM,CAAE,QAAO;CACpC,MAAM,cAAc,KAAK,IAAI,IAAI,MAAM,UAAU,OAAU,KAAK,KAAM;AACtE,QAAO,KAAK,IAAI,CAAC,cAAc,GAAG;;AAGpC,SAAS,mBAAmB,OAAuB;AAOjD,QAAO,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG;;AAG/D,SAAS,QAAQ,OAAuB;AACtC,KAAI,OAAO,MAAM,MAAM,CAAE,QAAO;AAChC,KAAI,QAAQ,EAAG,QAAO;AACtB,KAAI,QAAQ,EAAG,QAAO;AACtB,QAAO"}
+{"version":3,"file":"episodic-memory.js","names":["DEFAULT_WEIGHTS: EpisodeRetrievalWeights","#store","#tracer","#embedder","#embedderIdProvider","episode: Episode","#tryVectorSearch"],"sources":["../../src/tiers/episodic-memory.ts"],"sourcesContent":["import type {\n  EmbedderProvider,\n  Episode,\n  MemoryHit,\n  MemoryOwner,\n  MemoryProvenance,\n  MemoryStatus,\n  Sensitivity,\n  SessionScope,\n  Tracer,\n} from '@graphorin/core';\nimport { QuarantinePromotionRefusedError } from '../errors/index.js';\nimport { newMemoryId } from '../internal/id.js';\nimport { detectMemoryInjection } from '../internal/injection-heuristics.js';\nimport { withMemorySpan } from '../internal/spans.js';\nimport type { MemoryStoreAdapter } from '../internal/storage-adapter.js';\n\n/**\n * Author-time episode payload. The framework derives `id`,\n * `kind: 'episodic'`, `userId`, `createdAt`, `updatedAt`, and the\n * `embedder_id` from the surrounding `EpisodicMemory.record(...)`\n * call.\n *\n * @stable\n */\nexport interface EpisodeInput {\n  readonly summary: string;\n  readonly startedAt: string;\n  readonly endedAt: string;\n  /** Optional importance score in `[0, 1]`. */\n  readonly importance?: number;\n  readonly sensitivity?: Sensitivity;\n  readonly tags?: ReadonlyArray<string>;\n  /**\n   * Trust-provenance tag (P1-4). Episodes auto-formed by the\n   * consolidator pass `'extraction'` so they land quarantined; omit\n   * (defaults to first-party `active`) for user-authored episodes.\n   */\n  readonly provenance?: MemoryProvenance;\n  /**\n   * Retrieval-trust state (P1-4). Defaults to `active`; the\n   * consolidator records auto-formed episodes as `'quarantined'` so\n   * they are excluded from action-driving recall until validated.\n   */\n  readonly status?: MemoryStatus;\n  /** Principal dimension (D3). `'agent'` on auto-formed episodes. */\n  readonly owner?: MemoryOwner;\n}\n\n/**\n * Triple-signal episode retrieval weights. Defaults match DEC-105:\n * `recency 0.3`, `relevance 0.5`, `importance 0.2`. Implementations\n * normalize the weighted sum back to `[0, 1]`.\n *\n * @stable\n */\nexport interface EpisodeRetrievalWeights {\n  readonly recency: number;\n  readonly relevance: number;\n  readonly importance: number;\n}\n\nconst DEFAULT_WEIGHTS: EpisodeRetrievalWeights = Object.freeze({\n  recency: 0.3,\n  relevance: 0.5,\n  importance: 0.2,\n});\n\n/**\n * Per-call options accepted by {@link EpisodicMemory.search}.\n *\n * @stable\n */\nexport interface EpisodeSearchOptions {\n  readonly topK?: number;\n  readonly signal?: AbortSignal;\n  readonly weights?: EpisodeRetrievalWeights;\n  readonly dateRange?: { readonly from?: string; readonly to?: string };\n  /**\n   * Point-in-time (\"as of\") read. When set, only episodes that had\n   * started by this instant (`started_at <= asOf`) are returned.\n   * ISO-8601. Absent ⇒ current behaviour is unchanged. P0-2.\n   *\n   * @stable\n   */\n  readonly asOf?: string;\n  /**\n   * Include quarantined episodes in the result set (P1-4). Defaults to\n   * `false`: action-driving recall never returns quarantined rows. Set\n   * `true` only for the validation / inspector path - never for\n   * auto-recall fed back into the model. Auto-formed episodes (P1-2)\n   * land quarantined, so this is how an operator surfaces them for\n   * review.\n   *\n   * @stable\n   */\n  readonly includeQuarantined?: boolean;\n}\n\n/**\n * `EpisodicMemory` - record + retrieve summarized stretches of past\n * activity. Stored embeddings power triple-signal retrieval (recency\n * × relevance × importance).\n *\n * @stable\n */\nexport class EpisodicMemory {\n  readonly #store: MemoryStoreAdapter;\n  readonly #tracer: Tracer;\n  readonly #embedder: EmbedderProvider | null;\n  readonly #embedderIdProvider: () => string | null;\n\n  constructor(args: {\n    store: MemoryStoreAdapter;\n    tracer: Tracer;\n    embedder: EmbedderProvider | null;\n    embedderIdProvider: () => string | null;\n  }) {\n    this.#store = args.store;\n    this.#tracer = args.tracer;\n    this.#embedder = args.embedder;\n    this.#embedderIdProvider = args.embedderIdProvider;\n  }\n\n  /** Persist an episode + its embedding (when an embedder is configured). */\n  async record(scope: SessionScope, input: EpisodeInput): Promise<Episode> {\n    return withMemorySpan(this.#tracer, 'memory.write.episodic', scope, {}, async (span) => {\n      const now = new Date().toISOString();\n      const episode: Episode = {\n        id: newMemoryId('ep'),\n        kind: 'episodic',\n        userId: scope.userId,\n        ...(scope.sessionId !== undefined ? { sessionId: scope.sessionId } : {}),\n        ...(scope.agentId !== undefined ? { agentId: scope.agentId } : {}),\n        sensitivity: input.sensitivity ?? 'internal',\n        summary: input.summary,\n        startedAt: input.startedAt,\n        endedAt: input.endedAt,\n        ...(input.importance !== undefined ? { importance: input.importance } : {}),\n        ...(input.tags !== undefined ? { tags: Object.freeze([...input.tags]) } : {}),\n        ...(input.provenance !== undefined ? { provenance: input.provenance } : {}),\n        ...(input.status !== undefined ? { status: input.status } : {}),\n        ...(input.owner !== undefined ? { owner: input.owner } : {}),\n        createdAt: now,\n        updatedAt: now,\n      };\n      const embedderId = this.#embedderIdProvider();\n      if (\n        this.#embedder !== null &&\n        embedderId !== null &&\n        typeof this.#store.episodic.putWithEmbedding === 'function'\n      ) {\n        // PS-10: a stored episode summary is the `passage` role for E5.\n        const [vector] = await this.#embedder.embed([input.summary], { taskType: 'passage' });\n        if (vector !== undefined) {\n          await this.#store.episodic.putWithEmbedding(episode, {\n            embedding: { embedderId, vector },\n          });\n        } else {\n          await this.#store.episodic.put(episode);\n        }\n      } else {\n        await this.#store.episodic.put(episode);\n      }\n      span.setAttributes({\n        'memory.episodic.summary_length': input.summary.length,\n        ...(input.importance !== undefined\n          ? { 'memory.episodic.importance': input.importance }\n          : {}),\n      });\n      return episode;\n    });\n  }\n\n  /** Lookup a single episode by id. */\n  async get(id: string): Promise<Episode | null> {\n    return this.#store.episodic.get(id);\n  }\n\n  /**\n   * Triple-signal episode retrieval (`recency × relevance ×\n   * importance`). The vector signal is computed on demand when an\n   * embedder is configured AND the storage adapter exposes\n   * `searchVector`; otherwise the FTS5 BM25 score is fed into the\n   * relevance term as a normalized fallback.\n   */\n  async search(\n    scope: SessionScope,\n    query: string,\n    opts: EpisodeSearchOptions = {},\n  ): Promise<ReadonlyArray<MemoryHit<Episode>>> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.search.episodic',\n      scope,\n      { 'memory.search.query_length': query.length },\n      async (span) => {\n        const topK = opts.topK ?? 10;\n        const weights = opts.weights ?? DEFAULT_WEIGHTS;\n        const ftsHits = await this.#store.episodic.search(scope, {\n          query,\n          topK: topK * 2,\n          ...(opts.asOf !== undefined ? { asOf: opts.asOf } : {}),\n          // MRET-4: forward the date filter - it was accepted by the\n          // recall_episodes tool and silently dropped right here.\n          ...(opts.dateRange !== undefined ? { dateRange: opts.dateRange } : {}),\n          ...(opts.signal !== undefined ? { signal: opts.signal } : {}),\n          ...(opts.includeQuarantined !== undefined\n            ? { includeQuarantined: opts.includeQuarantined }\n            : {}),\n        });\n        const vectorHits = await this.#tryVectorSearch(\n          scope,\n          query,\n          topK * 2,\n          opts.asOf,\n          opts.includeQuarantined,\n        );\n        // MRET-4: the vector leg's store signature is positional (no\n        // dateRange parameter) - apply the same overlap semantics to its\n        // hits so both legs agree before the merge.\n        const from = opts.dateRange?.from !== undefined ? Date.parse(opts.dateRange.from) : null;\n        const to = opts.dateRange?.to !== undefined ? Date.parse(opts.dateRange.to) : null;\n        const rangedVectorHits =\n          from !== null || to !== null\n            ? vectorHits.filter((h) => {\n                if (from !== null && Date.parse(h.record.endedAt) < from) return false;\n                if (to !== null && Date.parse(h.record.startedAt) > to) return false;\n                return true;\n              })\n            : vectorHits;\n        const merged = mergeRecency(ftsHits, rangedVectorHits, weights);\n        const finalHits = merged.slice(0, topK);\n        span.setAttributes({\n          'memory.search.episodic.fts_count': ftsHits.length,\n          'memory.search.episodic.vector_count': vectorHits.length,\n          'memory.search.episodic.final_count': finalHits.length,\n          ...(opts.asOf !== undefined ? { 'memory.search.episodic.as_of': opts.asOf } : {}),\n        });\n        return finalHits;\n      },\n    );\n  }\n\n  /**\n   * Soft-archive an episode. Storage adapters that implement\n   * `EpisodicMemoryStoreExt.archive(...)` mark the row archived in\n   * place. Adapters that do not expose the extension surface a\n   * friendly `TypeError` so the operator can opt the storage layer\n   * in (or call `episodic.put(...)` with the archived state set\n   * manually).\n   */\n  async archive(scope: SessionScope, episodeId: string, reason?: string): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.episodic',\n      scope,\n      { 'memory.episodic.action': 'archive', 'memory.episodic.episode_id': episodeId },\n      async () => {\n        if (typeof this.#store.episodic.archive !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] EpisodicMemory.archive(...) requires a storage adapter that implements `episodic.archive(id)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via EpisodicMemoryStoreExt.',\n          );\n        }\n        await this.#store.episodic.archive(episodeId, reason, scope);\n      },\n    );\n  }\n\n  /**\n   * Most-recent episodes by end time (newest first), with no embedding / FTS\n   * query (MCON-1). Requires `EpisodicMemoryStoreExt.listRecent` - the default\n   * `@graphorin/store-sqlite` adapter implements it. Optionally includes\n   * quarantined episodes (the importance source for the reflection gate).\n   */\n  async listRecent(\n    scope: SessionScope,\n    limit: number,\n    opts: { includeQuarantined?: boolean } = {},\n  ): Promise<ReadonlyArray<Episode>> {\n    return withMemorySpan(this.#tracer, 'memory.read.episodic', scope, {}, async (span) => {\n      const store = this.#store.episodic;\n      if (typeof store.listRecent !== 'function') {\n        throw new Error(\n          '[graphorin/memory] EpisodicMemory.listRecent requires EpisodicMemoryStoreExt.listRecent. ' +\n            'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in.',\n        );\n      }\n      const out = await store.listRecent(scope, limit, opts);\n      span.setAttributes({ 'memory.read.episodic.count': out.length });\n      return out;\n    });\n  }\n\n  /** List the most recent episodes (no embedding required). */\n  async recent(scope: SessionScope, opts: { topK?: number } = {}): Promise<ReadonlyArray<Episode>> {\n    return this.listRecent(scope, opts.topK ?? 10, {});\n  }\n\n  /**\n   * Promote a quarantined episode into default recall (MCON-2). Mirrors\n   * {@link SemanticMemory.validate}: re-derives the injection verdict from the\n   * stored summary and **refuses** promotion of an injection-flagged episode\n   * (`QuarantinePromotionRefusedError`) unless an operator passes\n   * `{ force: true }` from a trusted, non-agent context.\n   */\n  async validate(\n    scope: SessionScope,\n    episodeId: string,\n    reason?: string,\n    options?: { readonly force?: boolean },\n  ): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.episodic',\n      scope,\n      { 'memory.episodic.action': 'validate', 'memory.episodic.episode_id': episodeId },\n      async (span) => {\n        const store = this.#store.episodic;\n        if (typeof store.setStatus !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] EpisodicMemory.validate(...) requires a storage adapter that implements `episodic.setStatus(id, status)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via EpisodicMemoryStoreExt.',\n          );\n        }\n        const force = options?.force === true;\n        const existing = await store.get(episodeId);\n        if (existing !== null && !force) {\n          const injection = detectMemoryInjection(existing.summary);\n          if (injection.flagged) {\n            span.setAttributes({ 'memory.episodic.validate.refused': true });\n            throw new QuarantinePromotionRefusedError(episodeId, injection.markers);\n          }\n        }\n        span.setAttributes({ 'memory.episodic.validate.forced': force });\n        await store.setStatus(episodeId, 'active', reason, scope);\n      },\n    );\n  }\n\n  async #tryVectorSearch(\n    scope: SessionScope,\n    query: string,\n    topK: number,\n    asOf?: string,\n    includeQuarantined?: boolean,\n  ): Promise<ReadonlyArray<MemoryHit<Episode>>> {\n    const embedderId = this.#embedderIdProvider();\n    if (\n      this.#embedder === null ||\n      embedderId === null ||\n      typeof this.#store.episodic.searchVector !== 'function'\n    ) {\n      return [];\n    }\n    // PS-10: a search query is the `query` role for E5.\n    const [vector] = await this.#embedder.embed([query], { taskType: 'query' });\n    if (vector === undefined) return [];\n    return this.#store.episodic.searchVector(\n      scope,\n      vector,\n      embedderId,\n      topK,\n      asOf,\n      includeQuarantined,\n    );\n  }\n}\n\nfunction mergeRecency(\n  ftsHits: ReadonlyArray<MemoryHit<Episode>>,\n  vectorHits: ReadonlyArray<MemoryHit<Episode>>,\n  weights: EpisodeRetrievalWeights,\n): ReadonlyArray<MemoryHit<Episode>> {\n  const now = Date.now();\n  const aggregates = new Map<\n    string,\n    {\n      record: Episode;\n      relevance: number;\n      recency: number;\n      importance: number;\n      score: number;\n      signals: Record<string, number>;\n    }\n  >();\n  for (const hit of ftsHits) {\n    const id = hit.record.id;\n    const recency = computeRecency(now, hit.record);\n    const importance = hit.record.importance ?? 0;\n    const relevance = normalizeRelevance(hit.score);\n    const score =\n      weights.recency * recency + weights.relevance * relevance + weights.importance * importance;\n    aggregates.set(id, {\n      record: hit.record,\n      relevance,\n      recency,\n      importance,\n      score,\n      signals: { fts: relevance, recency, importance },\n    });\n  }\n  for (const hit of vectorHits) {\n    const id = hit.record.id;\n    const cosine = clamp01(hit.score);\n    const existing = aggregates.get(id);\n    if (existing === undefined) {\n      const recency = computeRecency(now, hit.record);\n      const importance = hit.record.importance ?? 0;\n      const score =\n        weights.recency * recency + weights.relevance * cosine + weights.importance * importance;\n      aggregates.set(id, {\n        record: hit.record,\n        relevance: cosine,\n        recency,\n        importance,\n        score,\n        signals: { vector: cosine, recency, importance },\n      });\n    } else {\n      const blended = Math.max(existing.relevance, cosine);\n      existing.relevance = blended;\n      existing.score =\n        weights.recency * existing.recency +\n        weights.relevance * blended +\n        weights.importance * existing.importance;\n      existing.signals.vector = cosine;\n      existing.signals['rrf-blend'] = blended;\n    }\n  }\n  const out = Array.from(aggregates.values()).map((a) => ({\n    record: a.record,\n    score: a.score,\n    signals: Object.freeze({ ...a.signals }),\n  }));\n  out.sort((a, b) => b.score - a.score);\n  return out;\n}\n\nfunction computeRecency(now: number, episode: Episode): number {\n  const ended = Date.parse(episode.endedAt);\n  if (!Number.isFinite(ended)) return 0;\n  const elapsedDays = Math.max(0, (now - ended) / (24 * 60 * 60 * 1000));\n  return Math.exp(-elapsedDays / 30);\n}\n\nfunction normalizeRelevance(score: number): number {\n  // MRET-5/MST-7: the store returns `score = -bm25(...)` - POSITIVE for\n  // every FTS match (SQLite bm25 is always negative), so the old\n  // `1 / (1 + max(0, -score))` collapsed every lexical hit to exactly\n  // 1.0 and the DEC-105 triple-signal ranking degraded to\n  // recency + importance. Saturating ratio: 0 at no signal, → 1 as the\n  // match strengthens, graduated in between (k = 1 half-point).\n  return clamp01(Math.max(0, score) / (Math.max(0, score) + 1));\n}\n\nfunction clamp01(value: number): number {\n  if (Number.isNaN(value)) return 0;\n  if (value < 0) return 0;\n  if (value > 1) return 1;\n  return value;\n}\n"],"mappings":";;;;;;AA8DA,MAAMA,kBAA2C,OAAO,OAAO;CAC7D,SAAS;CACT,WAAW;CACX,YAAY;CACb,CAAC;;;;;;;;AAwCF,IAAa,iBAAb,MAA4B;CAC1B,CAASC;CACT,CAASC;CACT,CAASC;CACT,CAASC;CAET,YAAY,MAKT;AACD,QAAKH,QAAS,KAAK;AACnB,QAAKC,SAAU,KAAK;AACpB,QAAKC,WAAY,KAAK;AACtB,QAAKC,qBAAsB,KAAK;;;CAIlC,MAAM,OAAO,OAAqB,OAAuC;AACvE,SAAO,eAAe,MAAKF,QAAS,yBAAyB,OAAO,EAAE,EAAE,OAAO,SAAS;GACtF,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;GACpC,MAAMG,UAAmB;IACvB,IAAI,YAAY,KAAK;IACrB,MAAM;IACN,QAAQ,MAAM;IACd,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,GAAI,MAAM,YAAY,SAAY,EAAE,SAAS,MAAM,SAAS,GAAG,EAAE;IACjE,aAAa,MAAM,eAAe;IAClC,SAAS,MAAM;IACf,WAAW,MAAM;IACjB,SAAS,MAAM;IACf,GAAI,MAAM,eAAe,SAAY,EAAE,YAAY,MAAM,YAAY,GAAG,EAAE;IAC1E,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,GAAG,EAAE;IAC5E,GAAI,MAAM,eAAe,SAAY,EAAE,YAAY,MAAM,YAAY,GAAG,EAAE;IAC1E,GAAI,MAAM,WAAW,SAAY,EAAE,QAAQ,MAAM,QAAQ,GAAG,EAAE;IAC9D,GAAI,MAAM,UAAU,SAAY,EAAE,OAAO,MAAM,OAAO,GAAG,EAAE;IAC3D,WAAW;IACX,WAAW;IACZ;GACD,MAAM,aAAa,MAAKD,oBAAqB;AAC7C,OACE,MAAKD,aAAc,QACnB,eAAe,QACf,OAAO,MAAKF,MAAO,SAAS,qBAAqB,YACjD;IAEA,MAAM,CAAC,UAAU,MAAM,MAAKE,SAAU,MAAM,CAAC,MAAM,QAAQ,EAAE,EAAE,UAAU,WAAW,CAAC;AACrF,QAAI,WAAW,OACb,OAAM,MAAKF,MAAO,SAAS,iBAAiB,SAAS,EACnD,WAAW;KAAE;KAAY;KAAQ,EAClC,CAAC;QAEF,OAAM,MAAKA,MAAO,SAAS,IAAI,QAAQ;SAGzC,OAAM,MAAKA,MAAO,SAAS,IAAI,QAAQ;AAEzC,QAAK,cAAc;IACjB,kCAAkC,MAAM,QAAQ;IAChD,GAAI,MAAM,eAAe,SACrB,EAAE,8BAA8B,MAAM,YAAY,GAClD,EAAE;IACP,CAAC;AACF,UAAO;IACP;;;CAIJ,MAAM,IAAI,IAAqC;AAC7C,SAAO,MAAKA,MAAO,SAAS,IAAI,GAAG;;;;;;;;;CAUrC,MAAM,OACJ,OACA,OACA,OAA6B,EAAE,EACa;AAC5C,SAAO,eACL,MAAKC,QACL,0BACA,OACA,EAAE,8BAA8B,MAAM,QAAQ,EAC9C,OAAO,SAAS;GACd,MAAM,OAAO,KAAK,QAAQ;GAC1B,MAAM,UAAU,KAAK,WAAW;GAChC,MAAM,UAAU,MAAM,MAAKD,MAAO,SAAS,OAAO,OAAO;IACvD;IACA,MAAM,OAAO;IACb,GAAI,KAAK,SAAS,SAAY,EAAE,MAAM,KAAK,MAAM,GAAG,EAAE;IAGtD,GAAI,KAAK,cAAc,SAAY,EAAE,WAAW,KAAK,WAAW,GAAG,EAAE;IACrE,GAAI,KAAK,WAAW,SAAY,EAAE,QAAQ,KAAK,QAAQ,GAAG,EAAE;IAC5D,GAAI,KAAK,uBAAuB,SAC5B,EAAE,oBAAoB,KAAK,oBAAoB,GAC/C,EAAE;IACP,CAAC;GACF,MAAM,aAAa,MAAM,MAAKK,gBAC5B,OACA,OACA,OAAO,GACP,KAAK,MACL,KAAK,mBACN;GAID,MAAM,OAAO,KAAK,WAAW,SAAS,SAAY,KAAK,MAAM,KAAK,UAAU,KAAK,GAAG;GACpF,MAAM,KAAK,KAAK,WAAW,OAAO,SAAY,KAAK,MAAM,KAAK,UAAU,GAAG,GAAG;GAU9E,MAAM,YADS,aAAa,SAP1B,SAAS,QAAQ,OAAO,OACpB,WAAW,QAAQ,MAAM;AACvB,QAAI,SAAS,QAAQ,KAAK,MAAM,EAAE,OAAO,QAAQ,GAAG,KAAM,QAAO;AACjE,QAAI,OAAO,QAAQ,KAAK,MAAM,EAAE,OAAO,UAAU,GAAG,GAAI,QAAO;AAC/D,WAAO;KACP,GACF,YACiD,QAAQ,CACtC,MAAM,GAAG,KAAK;AACvC,QAAK,cAAc;IACjB,oCAAoC,QAAQ;IAC5C,uCAAuC,WAAW;IAClD,sCAAsC,UAAU;IAChD,GAAI,KAAK,SAAS,SAAY,EAAE,gCAAgC,KAAK,MAAM,GAAG,EAAE;IACjF,CAAC;AACF,UAAO;IAEV;;;;;;;;;;CAWH,MAAM,QAAQ,OAAqB,WAAmB,QAAgC;AACpF,QAAM,eACJ,MAAKJ,QACL,yBACA,OACA;GAAE,0BAA0B;GAAW,8BAA8B;GAAW,EAChF,YAAY;AACV,OAAI,OAAO,MAAKD,MAAO,SAAS,YAAY,WAC1C,OAAM,IAAI,UACR,wOAED;AAEH,SAAM,MAAKA,MAAO,SAAS,QAAQ,WAAW,QAAQ,MAAM;IAE/D;;;;;;;;CASH,MAAM,WACJ,OACA,OACA,OAAyC,EAAE,EACV;AACjC,SAAO,eAAe,MAAKC,QAAS,wBAAwB,OAAO,EAAE,EAAE,OAAO,SAAS;GACrF,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,eAAe,WAC9B,OAAM,IAAI,MACR,oLAED;GAEH,MAAM,MAAM,MAAM,MAAM,WAAW,OAAO,OAAO,KAAK;AACtD,QAAK,cAAc,EAAE,8BAA8B,IAAI,QAAQ,CAAC;AAChE,UAAO;IACP;;;CAIJ,MAAM,OAAO,OAAqB,OAA0B,EAAE,EAAmC;AAC/F,SAAO,KAAK,WAAW,OAAO,KAAK,QAAQ,IAAI,EAAE,CAAC;;;;;;;;;CAUpD,MAAM,SACJ,OACA,WACA,QACA,SACe;AACf,QAAM,eACJ,MAAKC,QACL,yBACA,OACA;GAAE,0BAA0B;GAAY,8BAA8B;GAAW,EACjF,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,cAAc,WAC7B,OAAM,IAAI,UACR,mPAED;GAEH,MAAM,QAAQ,SAAS,UAAU;GACjC,MAAM,WAAW,MAAM,MAAM,IAAI,UAAU;AAC3C,OAAI,aAAa,QAAQ,CAAC,OAAO;IAC/B,MAAM,YAAY,sBAAsB,SAAS,QAAQ;AACzD,QAAI,UAAU,SAAS;AACrB,UAAK,cAAc,EAAE,oCAAoC,MAAM,CAAC;AAChE,WAAM,IAAI,gCAAgC,WAAW,UAAU,QAAQ;;;AAG3E,QAAK,cAAc,EAAE,mCAAmC,OAAO,CAAC;AAChE,SAAM,MAAM,UAAU,WAAW,UAAU,QAAQ,MAAM;IAE5D;;CAGH,OAAMK,gBACJ,OACA,OACA,MACA,MACA,oBAC4C;EAC5C,MAAM,aAAa,MAAKF,oBAAqB;AAC7C,MACE,MAAKD,aAAc,QACnB,eAAe,QACf,OAAO,MAAKF,MAAO,SAAS,iBAAiB,WAE7C,QAAO,EAAE;EAGX,MAAM,CAAC,UAAU,MAAM,MAAKE,SAAU,MAAM,CAAC,MAAM,EAAE,EAAE,UAAU,SAAS,CAAC;AAC3E,MAAI,WAAW,OAAW,QAAO,EAAE;AACnC,SAAO,MAAKF,MAAO,SAAS,aAC1B,OACA,QACA,YACA,MACA,MACA,mBACD;;;AAIL,SAAS,aACP,SACA,YACA,SACmC;CACnC,MAAM,MAAM,KAAK,KAAK;CACtB,MAAM,6BAAa,IAAI,KAUpB;AACH,MAAK,MAAM,OAAO,SAAS;EACzB,MAAM,KAAK,IAAI,OAAO;EACtB,MAAM,UAAU,eAAe,KAAK,IAAI,OAAO;EAC/C,MAAM,aAAa,IAAI,OAAO,cAAc;EAC5C,MAAM,YAAY,mBAAmB,IAAI,MAAM;EAC/C,MAAM,QACJ,QAAQ,UAAU,UAAU,QAAQ,YAAY,YAAY,QAAQ,aAAa;AACnF,aAAW,IAAI,IAAI;GACjB,QAAQ,IAAI;GACZ;GACA;GACA;GACA;GACA,SAAS;IAAE,KAAK;IAAW;IAAS;IAAY;GACjD,CAAC;;AAEJ,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,KAAK,IAAI,OAAO;EACtB,MAAM,SAAS,QAAQ,IAAI,MAAM;EACjC,MAAM,WAAW,WAAW,IAAI,GAAG;AACnC,MAAI,aAAa,QAAW;GAC1B,MAAM,UAAU,eAAe,KAAK,IAAI,OAAO;GAC/C,MAAM,aAAa,IAAI,OAAO,cAAc;GAC5C,MAAM,QACJ,QAAQ,UAAU,UAAU,QAAQ,YAAY,SAAS,QAAQ,aAAa;AAChF,cAAW,IAAI,IAAI;IACjB,QAAQ,IAAI;IACZ,WAAW;IACX;IACA;IACA;IACA,SAAS;KAAE,QAAQ;KAAQ;KAAS;KAAY;IACjD,CAAC;SACG;GACL,MAAM,UAAU,KAAK,IAAI,SAAS,WAAW,OAAO;AACpD,YAAS,YAAY;AACrB,YAAS,QACP,QAAQ,UAAU,SAAS,UAC3B,QAAQ,YAAY,UACpB,QAAQ,aAAa,SAAS;AAChC,YAAS,QAAQ,SAAS;AAC1B,YAAS,QAAQ,eAAe;;;CAGpC,MAAM,MAAM,MAAM,KAAK,WAAW,QAAQ,CAAC,CAAC,KAAK,OAAO;EACtD,QAAQ,EAAE;EACV,OAAO,EAAE;EACT,SAAS,OAAO,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC;EACzC,EAAE;AACH,KAAI,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AACrC,QAAO;;AAGT,SAAS,eAAe,KAAa,SAA0B;CAC7D,MAAM,QAAQ,KAAK,MAAM,QAAQ,QAAQ;AACzC,KAAI,CAAC,OAAO,SAAS,MAAM,CAAE,QAAO;CACpC,MAAM,cAAc,KAAK,IAAI,IAAI,MAAM,UAAU,OAAU,KAAK,KAAM;AACtE,QAAO,KAAK,IAAI,CAAC,cAAc,GAAG;;AAGpC,SAAS,mBAAmB,OAAuB;AAOjD,QAAO,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM,GAAG,GAAG;;AAG/D,SAAS,QAAQ,OAAuB;AACtC,KAAI,OAAO,MAAM,MAAM,CAAE,QAAO;AAChC,KAAI,QAAQ,EAAG,QAAO;AACtB,KAAI,QAAQ,EAAG,QAAO;AACtB,QAAO"}

package/dist/tiers/index.d.ts

@@ -1,8 +1,8 @@
 import { EpisodeInput, EpisodeRetrievalWeights, EpisodeSearchOptions, EpisodicMemory } from "./episodic-memory.js";
-import { FactInput, FactRememberOptions, FactSearchOptions, FusionStrategy, FusionWeights, IterativeRecallResult, IterativeSearchOptions, RememberOutcome, SemanticMemory } from "./semantic-memory.js";
+import { FactInput, FactRememberOptions, FactSearchOptions, FusionStrategy, FusionWeights, IterativeRecallResult, IterativeSearchOptions, RememberOutcome, SemanticMemory, SemanticSearchDefaults } from "./semantic-memory.js";
 import { BlockDefinition, BlockSpec, WorkingMemory, defineBlock } from "./working-memory.js";
 import { InsightListOptions, InsightMemory, InsightSearchOptions, capInsightsBelowFacts } from "./insight-memory.js";
 import { InduceOptions, ProceduralMemory, RuleActivationContext, RuleInput } from "./procedural-memory.js";
 import { SessionCompactionPolicy, SessionCompactionResult, SessionMemory } from "./session-memory.js";
 import { SharedMemory } from "./shared-memory.js";
-export { type BlockDefinition, type BlockSpec, type EpisodeInput, type EpisodeRetrievalWeights, type EpisodeSearchOptions, EpisodicMemory, type FactInput, type FactRememberOptions, type FactSearchOptions, type FusionStrategy, type FusionWeights, type InduceOptions, type InsightListOptions, InsightMemory, type InsightSearchOptions, type IterativeRecallResult, type IterativeSearchOptions, ProceduralMemory, type RememberOutcome, type RuleActivationContext, type RuleInput, SemanticMemory, type SessionCompactionPolicy, type SessionCompactionResult, SessionMemory, SharedMemory, WorkingMemory, capInsightsBelowFacts, defineBlock };
+export { type BlockDefinition, type BlockSpec, type EpisodeInput, type EpisodeRetrievalWeights, type EpisodeSearchOptions, EpisodicMemory, type FactInput, type FactRememberOptions, type FactSearchOptions, type FusionStrategy, type FusionWeights, type InduceOptions, type InsightListOptions, InsightMemory, type InsightSearchOptions, type IterativeRecallResult, type IterativeSearchOptions, ProceduralMemory, type RememberOutcome, type RuleActivationContext, type RuleInput, SemanticMemory, type SemanticSearchDefaults, type SessionCompactionPolicy, type SessionCompactionResult, SessionMemory, SharedMemory, WorkingMemory, capInsightsBelowFacts, defineBlock };

package/dist/tiers/insight-memory.js

@@ -81,7 +81,7 @@ var InsightMemory = class {
 				}
 			}
 			span.setAttributes({ "memory.insight.validate.forced": force });
-			await store.setStatus(insightId, "active", reason);
+			await store.setStatus(insightId, "active", reason, scope);
 		});
 	}
 };

package/dist/tiers/insight-memory.js.map

@@ -1 +1 @@
-{"version":3,"file":"insight-memory.js","names":["#store","#tracer"],"sources":["../../src/tiers/insight-memory.ts"],"sourcesContent":["/**\n * `InsightMemory` - the thin, read-only surface over the reflection\n * insights the consolidator synthesizes (P1-1). Insights are *derived*\n * (quarantined + `provenance: 'reflection'`), carry mandatory citations,\n * and are retrieval-ranked **below the primary facts they cite**. The\n * write + salience-management paths live in the consolidator's\n * reflection pass; this tier only lists / searches for the validation /\n * inspector path.\n *\n * Search is FTS-only - insights are a soft inspector surface, not\n * primary recall, so no embedder is wired here.\n *\n * @packageDocumentation\n */\n\nimport type { Fact, Insight, MemoryHit, SessionScope, Tracer } from '@graphorin/core';\nimport { QuarantinePromotionRefusedError } from '../errors/index.js';\nimport { detectMemoryInjection } from '../internal/injection-heuristics.js';\nimport { withMemorySpan } from '../internal/spans.js';\nimport type { MemoryStoreAdapter } from '../internal/storage-adapter.js';\n\n/** Per-call options accepted by {@link InsightMemory.search}. */\nexport interface InsightSearchOptions {\n  readonly topK?: number;\n  /**\n   * Include quarantined insights (P1-4). Defaults to `false`. Since\n   * reflection-synthesized insights *always* land quarantined, set this\n   * `true` to surface them for the validation / inspector path - never\n   * for auto-recall fed back into the model.\n   */\n  readonly includeQuarantined?: boolean;\n  readonly signal?: AbortSignal;\n}\n\n/** Per-call options accepted by {@link InsightMemory.list}. */\nexport interface InsightListOptions {\n  readonly limit?: number;\n  /** Include quarantined insights (validation / inspector path). */\n  readonly includeQuarantined?: boolean;\n}\n\n/**\n * `InsightMemory` - list / search reflection insights. A no-op (returns\n * empty) when the storage adapter does not expose the optional\n * `insights` surface.\n *\n * @stable\n */\nexport class InsightMemory {\n  readonly #store: MemoryStoreAdapter;\n  readonly #tracer: Tracer;\n\n  constructor(args: { store: MemoryStoreAdapter; tracer: Tracer }) {\n    this.#store = args.store;\n    this.#tracer = args.tracer;\n  }\n\n  /** FTS keyword search over insight text. */\n  async search(\n    scope: SessionScope,\n    query: string,\n    opts: InsightSearchOptions = {},\n  ): Promise<ReadonlyArray<MemoryHit<Insight>>> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.search.insight',\n      scope,\n      { 'memory.search.query_length': query.length },\n      async (span) => {\n        const store = this.#store.insights;\n        if (store === undefined) {\n          span.setAttributes({ 'memory.search.insight.count': 0 });\n          return [];\n        }\n        const hits = await store.search(scope, query, {\n          topK: opts.topK ?? 10,\n          ...(opts.includeQuarantined !== undefined\n            ? { includeQuarantined: opts.includeQuarantined }\n            : {}),\n        });\n        // MCON-16: retrieval reinforces (ExpeL) - a recalled insight gains\n        // +1 salience, offsetting the per-reflection-pass -1 decay, so\n        // used insights persist while unused ones slide to the prune\n        // floor. Best-effort bookkeeping: never break the read path.\n        for (const hit of hits) {\n          try {\n            await store.bumpSalience(hit.record.id, 1, 'retrieval');\n          } catch {\n            // Advisory only.\n          }\n        }\n        span.setAttributes({ 'memory.search.insight.count': hits.length });\n        return hits;\n      },\n    );\n  }\n\n  /** Most-recent insights for the scope (newest first). */\n  async list(scope: SessionScope, opts: InsightListOptions = {}): Promise<ReadonlyArray<Insight>> {\n    return withMemorySpan(this.#tracer, 'memory.read.insight', scope, {}, async (span) => {\n      const store = this.#store.insights;\n      if (store === undefined) {\n        span.setAttributes({ 'memory.read.insight.count': 0 });\n        return [];\n      }\n      const out = await store.list(scope, {\n        ...(opts.limit !== undefined ? { limit: opts.limit } : {}),\n        ...(opts.includeQuarantined !== undefined\n          ? { includeQuarantined: opts.includeQuarantined }\n          : {}),\n      });\n      span.setAttributes({ 'memory.read.insight.count': out.length });\n      return out;\n    });\n  }\n\n  /** Lookup a single insight by id. */\n  async get(id: string): Promise<Insight | null> {\n    const store = this.#store.insights;\n    if (store === undefined || typeof store.get !== 'function') return null;\n    return store.get(id);\n  }\n\n  /**\n   * Promote a quarantined insight out of quarantine (MCON-2). Mirrors\n   * {@link SemanticMemory.validate}: re-derives the injection verdict from the\n   * stored text and **refuses** promotion of an injection-flagged insight\n   * unless an operator passes `{ force: true }` from a trusted context.\n   */\n  async validate(\n    scope: SessionScope,\n    insightId: string,\n    reason?: string,\n    options?: { readonly force?: boolean },\n  ): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.insight',\n      scope,\n      { 'memory.insight.action': 'validate', 'memory.insight.insight_id': insightId },\n      async (span) => {\n        const store = this.#store.insights;\n        if (store === undefined || typeof store.setStatus !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] InsightMemory.validate(...) requires a storage adapter that implements `insights.setStatus(id, status)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via InsightMemoryStoreExt.',\n          );\n        }\n        const force = options?.force === true;\n        const existing = typeof store.get === 'function' ? await store.get(insightId) : null;\n        if (existing !== null && !force) {\n          const injection = detectMemoryInjection(existing.text);\n          if (injection.flagged) {\n            span.setAttributes({ 'memory.insight.validate.refused': true });\n            throw new QuarantinePromotionRefusedError(insightId, injection.markers);\n          }\n        }\n        span.setAttributes({ 'memory.insight.validate.forced': force });\n        await store.setStatus(insightId, 'active', reason);\n      },\n    );\n  }\n}\n\n/** Tie-break margin keeping a capped insight strictly below its cited fact. */\nconst RANK_CAP_EPSILON = 1e-6;\n\n/**\n * Enforce the P1-1 rank ceiling: an insight may never outrank a primary\n * fact **it cites**. For each insight hit, if any fact it cites is\n * present in `factHits`, its score is lowered to strictly below that\n * cited fact's score - so concatenating the two lists and sorting by\n * score descending can never place the insight above the evidence it\n * was synthesized from. Insights whose cited facts are absent from\n * `factHits` are returned unchanged; this is a relative, not a global,\n * cap (per the execution plan: \"never outrank the primary facts they\n * cite\").\n *\n * Pure + deterministic - does not mutate its inputs.\n *\n * @stable\n */\nexport function capInsightsBelowFacts(\n  factHits: ReadonlyArray<MemoryHit<Fact>>,\n  insightHits: ReadonlyArray<MemoryHit<Insight>>,\n): ReadonlyArray<MemoryHit<Insight>> {\n  if (factHits.length === 0 || insightHits.length === 0) return insightHits;\n  const factScoreById = new Map<string, number>();\n  for (const hit of factHits) {\n    const prev = factScoreById.get(hit.record.id);\n    if (prev === undefined || hit.score > prev) factScoreById.set(hit.record.id, hit.score);\n  }\n  return insightHits.map((hit) => {\n    let citedMax = Number.NEGATIVE_INFINITY;\n    for (const id of hit.record.cites) {\n      const score = factScoreById.get(id);\n      if (score !== undefined && score > citedMax) citedMax = score;\n    }\n    // No cited fact present in the fused set, or already below it ⇒ keep.\n    if (citedMax === Number.NEGATIVE_INFINITY || hit.score < citedMax) return hit;\n    const capped = citedMax - RANK_CAP_EPSILON;\n    return {\n      ...hit,\n      score: capped,\n      signals: Object.freeze({ ...(hit.signals ?? {}), 'rank-cap': capped }),\n    };\n  });\n}\n"],"mappings":";;;;;;;;;;;;AAgDA,IAAa,gBAAb,MAA2B;CACzB,CAASA;CACT,CAASC;CAET,YAAY,MAAqD;AAC/D,QAAKD,QAAS,KAAK;AACnB,QAAKC,SAAU,KAAK;;;CAItB,MAAM,OACJ,OACA,OACA,OAA6B,EAAE,EACa;AAC5C,SAAO,eACL,MAAKA,QACL,yBACA,OACA,EAAE,8BAA8B,MAAM,QAAQ,EAC9C,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,UAAU,QAAW;AACvB,SAAK,cAAc,EAAE,+BAA+B,GAAG,CAAC;AACxD,WAAO,EAAE;;GAEX,MAAM,OAAO,MAAM,MAAM,OAAO,OAAO,OAAO;IAC5C,MAAM,KAAK,QAAQ;IACnB,GAAI,KAAK,uBAAuB,SAC5B,EAAE,oBAAoB,KAAK,oBAAoB,GAC/C,EAAE;IACP,CAAC;AAKF,QAAK,MAAM,OAAO,KAChB,KAAI;AACF,UAAM,MAAM,aAAa,IAAI,OAAO,IAAI,GAAG,YAAY;WACjD;AAIV,QAAK,cAAc,EAAE,+BAA+B,KAAK,QAAQ,CAAC;AAClE,UAAO;IAEV;;;CAIH,MAAM,KAAK,OAAqB,OAA2B,EAAE,EAAmC;AAC9F,SAAO,eAAe,MAAKC,QAAS,uBAAuB,OAAO,EAAE,EAAE,OAAO,SAAS;GACpF,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,UAAU,QAAW;AACvB,SAAK,cAAc,EAAE,6BAA6B,GAAG,CAAC;AACtD,WAAO,EAAE;;GAEX,MAAM,MAAM,MAAM,MAAM,KAAK,OAAO;IAClC,GAAI,KAAK,UAAU,SAAY,EAAE,OAAO,KAAK,OAAO,GAAG,EAAE;IACzD,GAAI,KAAK,uBAAuB,SAC5B,EAAE,oBAAoB,KAAK,oBAAoB,GAC/C,EAAE;IACP,CAAC;AACF,QAAK,cAAc,EAAE,6BAA6B,IAAI,QAAQ,CAAC;AAC/D,UAAO;IACP;;;CAIJ,MAAM,IAAI,IAAqC;EAC7C,MAAM,QAAQ,MAAKA,MAAO;AAC1B,MAAI,UAAU,UAAa,OAAO,MAAM,QAAQ,WAAY,QAAO;AACnE,SAAO,MAAM,IAAI,GAAG;;;;;;;;CAStB,MAAM,SACJ,OACA,WACA,QACA,SACe;AACf,QAAM,eACJ,MAAKC,QACL,wBACA,OACA;GAAE,yBAAyB;GAAY,6BAA6B;GAAW,EAC/E,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,UAAU,UAAa,OAAO,MAAM,cAAc,WACpD,OAAM,IAAI,UACR,iPAED;GAEH,MAAM,QAAQ,SAAS,UAAU;GACjC,MAAM,WAAW,OAAO,MAAM,QAAQ,aAAa,MAAM,MAAM,IAAI,UAAU,GAAG;AAChF,OAAI,aAAa,QAAQ,CAAC,OAAO;IAC/B,MAAM,YAAY,sBAAsB,SAAS,KAAK;AACtD,QAAI,UAAU,SAAS;AACrB,UAAK,cAAc,EAAE,mCAAmC,MAAM,CAAC;AAC/D,WAAM,IAAI,gCAAgC,WAAW,UAAU,QAAQ;;;AAG3E,QAAK,cAAc,EAAE,kCAAkC,OAAO,CAAC;AAC/D,SAAM,MAAM,UAAU,WAAW,UAAU,OAAO;IAErD;;;;AAKL,MAAM,mBAAmB;;;;;;;;;;;;;;;;AAiBzB,SAAgB,sBACd,UACA,aACmC;AACnC,KAAI,SAAS,WAAW,KAAK,YAAY,WAAW,EAAG,QAAO;CAC9D,MAAM,gCAAgB,IAAI,KAAqB;AAC/C,MAAK,MAAM,OAAO,UAAU;EAC1B,MAAM,OAAO,cAAc,IAAI,IAAI,OAAO,GAAG;AAC7C,MAAI,SAAS,UAAa,IAAI,QAAQ,KAAM,eAAc,IAAI,IAAI,OAAO,IAAI,IAAI,MAAM;;AAEzF,QAAO,YAAY,KAAK,QAAQ;EAC9B,IAAI,WAAW,OAAO;AACtB,OAAK,MAAM,MAAM,IAAI,OAAO,OAAO;GACjC,MAAM,QAAQ,cAAc,IAAI,GAAG;AACnC,OAAI,UAAU,UAAa,QAAQ,SAAU,YAAW;;AAG1D,MAAI,aAAa,OAAO,qBAAqB,IAAI,QAAQ,SAAU,QAAO;EAC1E,MAAM,SAAS,WAAW;AAC1B,SAAO;GACL,GAAG;GACH,OAAO;GACP,SAAS,OAAO,OAAO;IAAE,GAAI,IAAI,WAAW,EAAE;IAAG,YAAY;IAAQ,CAAC;GACvE;GACD"}
+{"version":3,"file":"insight-memory.js","names":["#store","#tracer"],"sources":["../../src/tiers/insight-memory.ts"],"sourcesContent":["/**\n * `InsightMemory` - the thin, read-only surface over the reflection\n * insights the consolidator synthesizes (P1-1). Insights are *derived*\n * (quarantined + `provenance: 'reflection'`), carry mandatory citations,\n * and are retrieval-ranked **below the primary facts they cite**. The\n * write + salience-management paths live in the consolidator's\n * reflection pass; this tier only lists / searches for the validation /\n * inspector path.\n *\n * Search is FTS-only - insights are a soft inspector surface, not\n * primary recall, so no embedder is wired here.\n *\n * @packageDocumentation\n */\n\nimport type { Fact, Insight, MemoryHit, SessionScope, Tracer } from '@graphorin/core';\nimport { QuarantinePromotionRefusedError } from '../errors/index.js';\nimport { detectMemoryInjection } from '../internal/injection-heuristics.js';\nimport { withMemorySpan } from '../internal/spans.js';\nimport type { MemoryStoreAdapter } from '../internal/storage-adapter.js';\n\n/** Per-call options accepted by {@link InsightMemory.search}. */\nexport interface InsightSearchOptions {\n  readonly topK?: number;\n  /**\n   * Include quarantined insights (P1-4). Defaults to `false`. Since\n   * reflection-synthesized insights *always* land quarantined, set this\n   * `true` to surface them for the validation / inspector path - never\n   * for auto-recall fed back into the model.\n   */\n  readonly includeQuarantined?: boolean;\n  readonly signal?: AbortSignal;\n}\n\n/** Per-call options accepted by {@link InsightMemory.list}. */\nexport interface InsightListOptions {\n  readonly limit?: number;\n  /** Include quarantined insights (validation / inspector path). */\n  readonly includeQuarantined?: boolean;\n}\n\n/**\n * `InsightMemory` - list / search reflection insights. A no-op (returns\n * empty) when the storage adapter does not expose the optional\n * `insights` surface.\n *\n * @stable\n */\nexport class InsightMemory {\n  readonly #store: MemoryStoreAdapter;\n  readonly #tracer: Tracer;\n\n  constructor(args: { store: MemoryStoreAdapter; tracer: Tracer }) {\n    this.#store = args.store;\n    this.#tracer = args.tracer;\n  }\n\n  /** FTS keyword search over insight text. */\n  async search(\n    scope: SessionScope,\n    query: string,\n    opts: InsightSearchOptions = {},\n  ): Promise<ReadonlyArray<MemoryHit<Insight>>> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.search.insight',\n      scope,\n      { 'memory.search.query_length': query.length },\n      async (span) => {\n        const store = this.#store.insights;\n        if (store === undefined) {\n          span.setAttributes({ 'memory.search.insight.count': 0 });\n          return [];\n        }\n        const hits = await store.search(scope, query, {\n          topK: opts.topK ?? 10,\n          ...(opts.includeQuarantined !== undefined\n            ? { includeQuarantined: opts.includeQuarantined }\n            : {}),\n        });\n        // MCON-16: retrieval reinforces (ExpeL) - a recalled insight gains\n        // +1 salience, offsetting the per-reflection-pass -1 decay, so\n        // used insights persist while unused ones slide to the prune\n        // floor. Best-effort bookkeeping: never break the read path.\n        for (const hit of hits) {\n          try {\n            await store.bumpSalience(hit.record.id, 1, 'retrieval');\n          } catch {\n            // Advisory only.\n          }\n        }\n        span.setAttributes({ 'memory.search.insight.count': hits.length });\n        return hits;\n      },\n    );\n  }\n\n  /** Most-recent insights for the scope (newest first). */\n  async list(scope: SessionScope, opts: InsightListOptions = {}): Promise<ReadonlyArray<Insight>> {\n    return withMemorySpan(this.#tracer, 'memory.read.insight', scope, {}, async (span) => {\n      const store = this.#store.insights;\n      if (store === undefined) {\n        span.setAttributes({ 'memory.read.insight.count': 0 });\n        return [];\n      }\n      const out = await store.list(scope, {\n        ...(opts.limit !== undefined ? { limit: opts.limit } : {}),\n        ...(opts.includeQuarantined !== undefined\n          ? { includeQuarantined: opts.includeQuarantined }\n          : {}),\n      });\n      span.setAttributes({ 'memory.read.insight.count': out.length });\n      return out;\n    });\n  }\n\n  /** Lookup a single insight by id. */\n  async get(id: string): Promise<Insight | null> {\n    const store = this.#store.insights;\n    if (store === undefined || typeof store.get !== 'function') return null;\n    return store.get(id);\n  }\n\n  /**\n   * Promote a quarantined insight out of quarantine (MCON-2). Mirrors\n   * {@link SemanticMemory.validate}: re-derives the injection verdict from the\n   * stored text and **refuses** promotion of an injection-flagged insight\n   * unless an operator passes `{ force: true }` from a trusted context.\n   */\n  async validate(\n    scope: SessionScope,\n    insightId: string,\n    reason?: string,\n    options?: { readonly force?: boolean },\n  ): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.insight',\n      scope,\n      { 'memory.insight.action': 'validate', 'memory.insight.insight_id': insightId },\n      async (span) => {\n        const store = this.#store.insights;\n        if (store === undefined || typeof store.setStatus !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] InsightMemory.validate(...) requires a storage adapter that implements `insights.setStatus(id, status)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via InsightMemoryStoreExt.',\n          );\n        }\n        const force = options?.force === true;\n        const existing = typeof store.get === 'function' ? await store.get(insightId) : null;\n        if (existing !== null && !force) {\n          const injection = detectMemoryInjection(existing.text);\n          if (injection.flagged) {\n            span.setAttributes({ 'memory.insight.validate.refused': true });\n            throw new QuarantinePromotionRefusedError(insightId, injection.markers);\n          }\n        }\n        span.setAttributes({ 'memory.insight.validate.forced': force });\n        await store.setStatus(insightId, 'active', reason, scope);\n      },\n    );\n  }\n}\n\n/** Tie-break margin keeping a capped insight strictly below its cited fact. */\nconst RANK_CAP_EPSILON = 1e-6;\n\n/**\n * Enforce the P1-1 rank ceiling: an insight may never outrank a primary\n * fact **it cites**. For each insight hit, if any fact it cites is\n * present in `factHits`, its score is lowered to strictly below that\n * cited fact's score - so concatenating the two lists and sorting by\n * score descending can never place the insight above the evidence it\n * was synthesized from. Insights whose cited facts are absent from\n * `factHits` are returned unchanged; this is a relative, not a global,\n * cap (per the execution plan: \"never outrank the primary facts they\n * cite\").\n *\n * Pure + deterministic - does not mutate its inputs.\n *\n * @stable\n */\nexport function capInsightsBelowFacts(\n  factHits: ReadonlyArray<MemoryHit<Fact>>,\n  insightHits: ReadonlyArray<MemoryHit<Insight>>,\n): ReadonlyArray<MemoryHit<Insight>> {\n  if (factHits.length === 0 || insightHits.length === 0) return insightHits;\n  const factScoreById = new Map<string, number>();\n  for (const hit of factHits) {\n    const prev = factScoreById.get(hit.record.id);\n    if (prev === undefined || hit.score > prev) factScoreById.set(hit.record.id, hit.score);\n  }\n  return insightHits.map((hit) => {\n    let citedMax = Number.NEGATIVE_INFINITY;\n    for (const id of hit.record.cites) {\n      const score = factScoreById.get(id);\n      if (score !== undefined && score > citedMax) citedMax = score;\n    }\n    // No cited fact present in the fused set, or already below it ⇒ keep.\n    if (citedMax === Number.NEGATIVE_INFINITY || hit.score < citedMax) return hit;\n    const capped = citedMax - RANK_CAP_EPSILON;\n    return {\n      ...hit,\n      score: capped,\n      signals: Object.freeze({ ...(hit.signals ?? {}), 'rank-cap': capped }),\n    };\n  });\n}\n"],"mappings":";;;;;;;;;;;;AAgDA,IAAa,gBAAb,MAA2B;CACzB,CAASA;CACT,CAASC;CAET,YAAY,MAAqD;AAC/D,QAAKD,QAAS,KAAK;AACnB,QAAKC,SAAU,KAAK;;;CAItB,MAAM,OACJ,OACA,OACA,OAA6B,EAAE,EACa;AAC5C,SAAO,eACL,MAAKA,QACL,yBACA,OACA,EAAE,8BAA8B,MAAM,QAAQ,EAC9C,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,UAAU,QAAW;AACvB,SAAK,cAAc,EAAE,+BAA+B,GAAG,CAAC;AACxD,WAAO,EAAE;;GAEX,MAAM,OAAO,MAAM,MAAM,OAAO,OAAO,OAAO;IAC5C,MAAM,KAAK,QAAQ;IACnB,GAAI,KAAK,uBAAuB,SAC5B,EAAE,oBAAoB,KAAK,oBAAoB,GAC/C,EAAE;IACP,CAAC;AAKF,QAAK,MAAM,OAAO,KAChB,KAAI;AACF,UAAM,MAAM,aAAa,IAAI,OAAO,IAAI,GAAG,YAAY;WACjD;AAIV,QAAK,cAAc,EAAE,+BAA+B,KAAK,QAAQ,CAAC;AAClE,UAAO;IAEV;;;CAIH,MAAM,KAAK,OAAqB,OAA2B,EAAE,EAAmC;AAC9F,SAAO,eAAe,MAAKC,QAAS,uBAAuB,OAAO,EAAE,EAAE,OAAO,SAAS;GACpF,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,UAAU,QAAW;AACvB,SAAK,cAAc,EAAE,6BAA6B,GAAG,CAAC;AACtD,WAAO,EAAE;;GAEX,MAAM,MAAM,MAAM,MAAM,KAAK,OAAO;IAClC,GAAI,KAAK,UAAU,SAAY,EAAE,OAAO,KAAK,OAAO,GAAG,EAAE;IACzD,GAAI,KAAK,uBAAuB,SAC5B,EAAE,oBAAoB,KAAK,oBAAoB,GAC/C,EAAE;IACP,CAAC;AACF,QAAK,cAAc,EAAE,6BAA6B,IAAI,QAAQ,CAAC;AAC/D,UAAO;IACP;;;CAIJ,MAAM,IAAI,IAAqC;EAC7C,MAAM,QAAQ,MAAKA,MAAO;AAC1B,MAAI,UAAU,UAAa,OAAO,MAAM,QAAQ,WAAY,QAAO;AACnE,SAAO,MAAM,IAAI,GAAG;;;;;;;;CAStB,MAAM,SACJ,OACA,WACA,QACA,SACe;AACf,QAAM,eACJ,MAAKC,QACL,wBACA,OACA;GAAE,yBAAyB;GAAY,6BAA6B;GAAW,EAC/E,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,UAAU,UAAa,OAAO,MAAM,cAAc,WACpD,OAAM,IAAI,UACR,iPAED;GAEH,MAAM,QAAQ,SAAS,UAAU;GACjC,MAAM,WAAW,OAAO,MAAM,QAAQ,aAAa,MAAM,MAAM,IAAI,UAAU,GAAG;AAChF,OAAI,aAAa,QAAQ,CAAC,OAAO;IAC/B,MAAM,YAAY,sBAAsB,SAAS,KAAK;AACtD,QAAI,UAAU,SAAS;AACrB,UAAK,cAAc,EAAE,mCAAmC,MAAM,CAAC;AAC/D,WAAM,IAAI,gCAAgC,WAAW,UAAU,QAAQ;;;AAG3E,QAAK,cAAc,EAAE,kCAAkC,OAAO,CAAC;AAC/D,SAAM,MAAM,UAAU,WAAW,UAAU,QAAQ,MAAM;IAE5D;;;;AAKL,MAAM,mBAAmB;;;;;;;;;;;;;;;;AAiBzB,SAAgB,sBACd,UACA,aACmC;AACnC,KAAI,SAAS,WAAW,KAAK,YAAY,WAAW,EAAG,QAAO;CAC9D,MAAM,gCAAgB,IAAI,KAAqB;AAC/C,MAAK,MAAM,OAAO,UAAU;EAC1B,MAAM,OAAO,cAAc,IAAI,IAAI,OAAO,GAAG;AAC7C,MAAI,SAAS,UAAa,IAAI,QAAQ,KAAM,eAAc,IAAI,IAAI,OAAO,IAAI,IAAI,MAAM;;AAEzF,QAAO,YAAY,KAAK,QAAQ;EAC9B,IAAI,WAAW,OAAO;AACtB,OAAK,MAAM,MAAM,IAAI,OAAO,OAAO;GACjC,MAAM,QAAQ,cAAc,IAAI,GAAG;AACnC,OAAI,UAAU,UAAa,QAAQ,SAAU,YAAW;;AAG1D,MAAI,aAAa,OAAO,qBAAqB,IAAI,QAAQ,SAAU,QAAO;EAC1E,MAAM,SAAS,WAAW;AAC1B,SAAO;GACL,GAAG;GACH,OAAO;GACP,SAAS,OAAO,OAAO;IAAE,GAAI,IAAI,WAAW,EAAE;IAAG,YAAY;IAAQ,CAAC;GACvE;GACD"}

package/dist/tiers/procedural-memory.d.ts

@@ -44,7 +44,7 @@ interface RuleInput {
 interface InduceOptions {
   /** Sensitivity of the stored procedure. Default `'internal'`. */
   readonly sensitivity?: Sensitivity;
-  /** Priority of the stored procedure. Default {@link INDUCED_PRIORITY} (40). */
+  /** Priority of the stored procedure. Default `INDUCED_PRIORITY` (40). */
   readonly priority?: number;
 }
 /**

package/dist/tiers/procedural-memory.js

@@ -1,8 +1,8 @@
 import { withMemorySpan } from "../internal/spans.js";
 import { ProcedureInductionNotConfiguredError, QuarantinePromotionRefusedError } from "../errors/index.js";
+import { detectMemoryInjection } from "../internal/injection-heuristics.js";
 import { runWorkflowInduction, trajectoryFromRunState } from "../consolidator/phases/induce.js";
 import { newMemoryId } from "../internal/id.js";
-import { detectMemoryInjection } from "../internal/injection-heuristics.js";
 
 //#region src/tiers/procedural-memory.ts
 /** Default priority for an *induced* procedure - below the author default
@@ -297,7 +297,7 @@ var ProceduralMemory = class {
 				}
 			}
 			span.setAttributes({ "memory.procedural.validate.forced": force });
-			await store.setStatus(ruleId, "active", reason);
+			await store.setStatus(ruleId, "active", reason, scope);
 		});
 	}
 };

package/dist/tiers/procedural-memory.js.map

@@ -1 +1 @@
-{"version":3,"file":"procedural-memory.js","names":["#store","#tracer","#inducer","#promoteAfterSuccesses","rule: Rule"],"sources":["../../src/tiers/procedural-memory.ts"],"sourcesContent":["import type {\n  MemoryHit,\n  MemoryOwner,\n  MemoryProvenance,\n  MemoryStatus,\n  Rule,\n  RunState,\n  Sensitivity,\n  SessionScope,\n  Tracer,\n} from '@graphorin/core';\nimport {\n  type InducedProcedure,\n  runWorkflowInduction,\n  type Trajectory,\n  trajectoryFromRunState,\n  type WorkflowInducer,\n} from '../consolidator/phases/induce.js';\nimport {\n  ProcedureInductionNotConfiguredError,\n  QuarantinePromotionRefusedError,\n} from '../errors/index.js';\nimport { newMemoryId } from '../internal/id.js';\nimport { detectMemoryInjection } from '../internal/injection-heuristics.js';\nimport { withMemorySpan } from '../internal/spans.js';\nimport type { MemoryStoreAdapter } from '../internal/storage-adapter.js';\n\n/** Default priority for an *induced* procedure - below the author default\n * (50) because an induced, still-quarantined procedure is provisional. */\nconst INDUCED_PRIORITY = 40;\n\n/**\n * Author-time rule payload accepted by {@link ProceduralMemory.define}.\n *\n * @stable\n */\nexport interface RuleInput {\n  readonly text: string;\n  /**\n   * Free-form predicate evaluated by {@link ProceduralMemory.activate}.\n   * The predicate language is intentionally narrow in v0.1: either\n   * the literal string `'always'`, or a `'topic=...'` / `'tag=...'`\n   * shorthand. Custom predicates should be expressed as a callable\n   * matched in `activate(...)`'s `customMatchers` argument.\n   */\n  readonly condition?: string;\n  /** Default `'public'` per DEC-126 - rules are NOT user data. */\n  readonly sensitivity?: Sensitivity;\n  readonly priority?: number;\n  readonly tags?: ReadonlyArray<string>;\n  /**\n   * Optional structured workflow payload (P2-2). Usually set by\n   * {@link ProceduralMemory.induce}, but accepted here so an author can\n   * round-trip a hand-written procedure. See {@link Rule.steps}.\n   */\n  readonly steps?: ReadonlyArray<string>;\n  /** Variable names abstracted into {@link RuleInput.steps} (P2-2). */\n  readonly variables?: ReadonlyArray<string>;\n  /** Verifiable success criteria stored with the procedure (P2-2). */\n  readonly successCriteria?: ReadonlyArray<string>;\n  /** Principal dimension (D3). Absent ⇒ NULL (treated `'user'`). */\n  readonly owner?: MemoryOwner;\n}\n\n/**\n * Options for {@link ProceduralMemory.induce}.\n *\n * @stable\n */\nexport interface InduceOptions {\n  /** Sensitivity of the stored procedure. Default `'internal'`. */\n  readonly sensitivity?: Sensitivity;\n  /** Priority of the stored procedure. Default {@link INDUCED_PRIORITY} (40). */\n  readonly priority?: number;\n}\n\n/**\n * Predicate context passed to {@link ProceduralMemory.activate}.\n *\n * @stable\n */\nexport interface RuleActivationContext {\n  readonly topic?: string;\n  readonly tags?: ReadonlyArray<string>;\n}\n\n/**\n * `ProceduralMemory` - standing orders activated when the agent's\n * current context matches the rule's predicate. The activation rules\n * are deterministic so the agent runtime + ContextEngine can render\n * the active set into the system prompt every step.\n *\n * P2-2 adds {@link ProceduralMemory.induce}: distil a reusable workflow\n * from a successful agent trajectory and store it **quarantined** (it must\n * not drive actions until validated). Quarantined procedures are excluded\n * from {@link ProceduralMemory.activate} but remain visible to\n * {@link ProceduralMemory.list}.\n *\n * @stable\n */\nexport class ProceduralMemory {\n  readonly #store: MemoryStoreAdapter;\n  readonly #tracer: Tracer;\n  /** Opt-in workflow inducer (P2-2). `null` ⇒ {@link induce} throws. */\n  readonly #inducer: WorkflowInducer | null;\n  /**\n   * Promotion-by-demonstrated-success threshold (MCON-2 part 4).\n   * `null` ⇒ outcomes are counted but never auto-promote.\n   */\n  readonly #promoteAfterSuccesses: number | null;\n\n  constructor(args: {\n    store: MemoryStoreAdapter;\n    tracer: Tracer;\n    inducer?: WorkflowInducer | null;\n    promoteAfterSuccesses?: number | null;\n  }) {\n    this.#store = args.store;\n    this.#tracer = args.tracer;\n    this.#inducer = args.inducer ?? null;\n    const k = args.promoteAfterSuccesses;\n    this.#promoteAfterSuccesses =\n      typeof k === 'number' && Number.isFinite(k) && k >= 1 ? Math.floor(k) : null;\n  }\n\n  /**\n   * Record the outcome of one demonstrated reuse of a procedure\n   * (MCON-2 part 4). A success increments the rule's persistent\n   * `successCount`; when `procedurePromotion.afterSuccesses` is\n   * configured and a QUARANTINED procedure reaches the threshold it is\n   * promoted through {@link validate} - the injection gate still\n   * applies, so a flagged text refuses promotion (surfaced as\n   * `refused: true`) no matter how many successes accumulate.\n   * Failures are observed but not persisted (no negative counter yet).\n   *\n   * Callers decide what \"success\" means - typically\n   * `checkSuccessCriteria(...)` over the procedure's stored\n   * `successCriteria`, or an operator's judgement.\n   *\n   * @stable\n   */\n  async recordOutcome(\n    scope: SessionScope,\n    ruleId: string,\n    succeeded: boolean,\n  ): Promise<{\n    readonly successCount: number;\n    readonly promoted: boolean;\n    readonly refused: boolean;\n  }> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'record-outcome', 'memory.procedural.rule_id': ruleId },\n      async (span) => {\n        const store = this.#store.procedural;\n        if (!succeeded || typeof store.recordSuccess !== 'function') {\n          span.setAttributes({ 'memory.procedural.outcome.counted': false });\n          return { successCount: 0, promoted: false, refused: false };\n        }\n        const successCount = await store.recordSuccess(ruleId);\n        span.setAttributes({ 'memory.procedural.outcome.success_count': successCount });\n        const threshold = this.#promoteAfterSuccesses;\n        if (threshold === null || successCount < threshold) {\n          return { successCount, promoted: false, refused: false };\n        }\n        const existing = (await store.list(scope)).find((rule) => rule.id === ruleId) ?? null;\n        if (existing === null || existing.status !== 'quarantined') {\n          return { successCount, promoted: false, refused: false };\n        }\n        try {\n          await this.validate(\n            scope,\n            ruleId,\n            `demonstrated-success: ${successCount} >= ${threshold}`,\n          );\n          span.setAttributes({ 'memory.procedural.outcome.promoted': true });\n          return { successCount, promoted: true, refused: false };\n        } catch (err) {\n          if (err instanceof QuarantinePromotionRefusedError) {\n            span.setAttributes({ 'memory.procedural.outcome.refused': true });\n            return { successCount, promoted: false, refused: true };\n          }\n          throw err;\n        }\n      },\n    );\n  }\n\n  /** Persist a rule. Returns the stored record. */\n  async define(scope: SessionScope, input: RuleInput): Promise<Rule> {\n    return withMemorySpan(this.#tracer, 'memory.write.procedural', scope, {}, async (span) => {\n      const now = new Date().toISOString();\n      const rule: Rule = {\n        id: newMemoryId('rule'),\n        kind: 'procedural',\n        userId: scope.userId,\n        ...(scope.sessionId !== undefined ? { sessionId: scope.sessionId } : {}),\n        ...(scope.agentId !== undefined ? { agentId: scope.agentId } : {}),\n        sensitivity: input.sensitivity ?? 'public',\n        text: input.text,\n        ...(input.condition !== undefined ? { condition: input.condition } : {}),\n        priority: input.priority ?? 50,\n        ...(input.tags !== undefined ? { tags: Object.freeze([...input.tags]) } : {}),\n        ...(input.steps !== undefined ? { steps: Object.freeze([...input.steps]) } : {}),\n        ...(input.variables !== undefined\n          ? { variables: Object.freeze([...input.variables]) }\n          : {}),\n        ...(input.successCriteria !== undefined\n          ? { successCriteria: Object.freeze([...input.successCriteria]) }\n          : {}),\n        ...(input.owner !== undefined ? { owner: input.owner } : {}),\n        createdAt: now,\n        updatedAt: now,\n      };\n      await this.#store.procedural.add(rule);\n      span.setAttributes({\n        'memory.procedural.priority': rule.priority,\n        'memory.procedural.text_length': input.text.length,\n      });\n      return rule;\n    });\n  }\n\n  /**\n   * Induce a reusable procedure (P2-2) from a successful agent trajectory\n   * and store it **quarantined** + `provenance: 'induction'` (P1-4). Returns\n   * the stored {@link Rule}, or `null` when the trajectory was unsuccessful /\n   * empty or the inducer produced nothing inducible.\n   *\n   * Throws {@link ProcedureInductionNotConfiguredError} when no inducer was\n   * configured (`createMemory({ procedureInduction: { provider } })`).\n   */\n  async induce(\n    scope: SessionScope,\n    trajectory: Trajectory,\n    opts: InduceOptions = {},\n  ): Promise<Rule | null> {\n    const inducer = this.#inducer;\n    if (inducer === null) throw new ProcedureInductionNotConfiguredError();\n    return withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'induce' },\n      async (span) => {\n        const induced = await runWorkflowInduction(trajectory, inducer, {});\n        if (induced === null) {\n          span.setAttributes({ 'memory.procedural.induced': 0 });\n          return null;\n        }\n        const now = new Date().toISOString();\n        const rule: Rule = {\n          id: newMemoryId('rule'),\n          kind: 'procedural',\n          userId: scope.userId,\n          ...(scope.sessionId !== undefined ? { sessionId: scope.sessionId } : {}),\n          ...(scope.agentId !== undefined ? { agentId: scope.agentId } : {}),\n          // Induced from a run ⇒ user-derived, so 'internal' (not the public\n          // default for author-defined rules).\n          sensitivity: opts.sensitivity ?? 'internal',\n          text: renderProcedureText(induced),\n          priority: opts.priority ?? INDUCED_PRIORITY,\n          steps: Object.freeze([...induced.steps]),\n          variables: Object.freeze([...induced.variables]),\n          successCriteria: Object.freeze([...induced.successCriteria]),\n          // Highest-poisoning-risk write in the system - procedures drive\n          // actions, so it lands quarantined + provenance-tagged (P1-4).\n          provenance: 'induction' satisfies MemoryProvenance,\n          status: 'quarantined' satisfies MemoryStatus,\n          // D3: an induced procedure is the agent's own inference.\n          owner: 'agent',\n          createdAt: now,\n          updatedAt: now,\n        };\n        await this.#store.procedural.add(rule);\n        span.setAttributes({\n          'memory.procedural.induced': 1,\n          'memory.procedural.steps': induced.steps.length,\n          'memory.procedural.variables': induced.variables.length,\n        });\n        return rule;\n      },\n    );\n  }\n\n  /**\n   * Convenience over {@link induce}: distil the {@link Trajectory} from a\n   * completed {@link RunState} (the agent's already-emitted run state) and\n   * induce a procedure. The success signal is `status === 'completed'`.\n   */\n  async induceFromRun(\n    scope: SessionScope,\n    run: RunState,\n    opts: InduceOptions = {},\n  ): Promise<Rule | null> {\n    return this.induce(scope, trajectoryFromRunState(run), opts);\n  }\n\n  /** Soft-delete a rule. */\n  async remove(scope: SessionScope, ruleId: string, reason?: string): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'remove', 'memory.procedural.rule_id': ruleId },\n      async () => {\n        await this.#store.procedural.remove(ruleId, reason);\n      },\n    );\n  }\n\n  /** List every active (non-deleted) rule for the supplied scope. */\n  async list(scope: SessionScope): Promise<ReadonlyArray<Rule>> {\n    return withMemorySpan(this.#tracer, 'memory.read.procedural', scope, {}, async (span) => {\n      const out = await this.#store.procedural.list(scope);\n      span.setAttributes({ 'memory.read.procedural.count': out.length });\n      return out;\n    });\n  }\n\n  /**\n   * Return the rules active under `context`. Rules without a\n   * `condition` are always active; the bundled predicate vocabulary\n   * supports the literals `'always'`, `'topic=<topic>'`, and\n   * `'tag=<tag>'`. Anything outside that grammar is treated as\n   * always-active so callers do not silently lose rules.\n   *\n   * **Quarantined procedures are excluded** (P1-4 / P2-2): an induced\n   * procedure must not drive actions until validated, so activation - which\n   * feeds the system prompt - never surfaces it.\n   */\n  async activate(\n    scope: SessionScope,\n    context: RuleActivationContext = {},\n  ): Promise<ReadonlyArray<Rule>> {\n    const rules = await this.list(scope);\n    return rules\n      .filter((rule) => rule.status !== 'quarantined' && predicateMatches(rule, context))\n      .sort((a, b) => b.priority - a.priority);\n  }\n\n  /**\n   * Runbook content search (D3): \"find the procedure for this task\" -\n   * lexical recall over rule text, as opposed to predicate\n   * {@link activate}. Returns **whole validated procedures** (the full\n   * {@link Rule} incl. steps / variables / success criteria) so a match\n   * can be followed file-style rather than re-synthesized from\n   * fragments. Quarantined (unvalidated induced) procedures are\n   * excluded - they must not drive actions - unless the inspector opts\n   * in via `includeQuarantined`.\n   *\n   * Uses the storage adapter's FTS surface when available\n   * (`procedural.search`, the default `@graphorin/store-sqlite` adapter\n   * implements it via migration 028); otherwise degrades to an offline\n   * in-memory token-overlap scan over {@link list}, so custom adapters\n   * keep working without the index.\n   */\n  async search(\n    scope: SessionScope,\n    query: string,\n    opts: { readonly topK?: number; readonly includeQuarantined?: boolean } = {},\n  ): Promise<ReadonlyArray<MemoryHit<Rule>>> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.read.procedural',\n      scope,\n      { 'memory.procedural.action': 'search' },\n      async (span) => {\n        const topK = opts.topK ?? 5;\n        const store = this.#store.procedural;\n        if (typeof store.search === 'function') {\n          const hits = await store.search(scope, query, {\n            topK,\n            ...(opts.includeQuarantined === true ? { includeQuarantined: true } : {}),\n          });\n          span.setAttributes({\n            'memory.read.procedural.count': hits.length,\n            'memory.read.procedural.search_backend': 'store',\n          });\n          return hits;\n        }\n        // Fallback: offline token-overlap scoring over list(). Coarse by\n        // design - it exists so the runbook surface degrades instead of\n        // disappearing on adapters without an FTS index.\n        const tokens = tokenizeForRunbook(query);\n        const rules = await this.list(scope);\n        const scored = rules\n          .filter((rule) => opts.includeQuarantined === true || rule.status !== 'quarantined')\n          .map((rule) => {\n            const haystack = tokenizeForRunbook(\n              [rule.text, ...(rule.steps ?? []), ...(rule.tags ?? [])].join(' '),\n            );\n            const overlap = tokens.filter((t) => haystack.includes(t)).length;\n            return { rule, overlap };\n          })\n          .filter((entry) => entry.overlap > 0)\n          .sort((a, b) => b.overlap - a.overlap || (a.rule.id < b.rule.id ? -1 : 1))\n          .slice(0, topK);\n        span.setAttributes({\n          'memory.read.procedural.count': scored.length,\n          'memory.read.procedural.search_backend': 'fallback',\n        });\n        return scored.map((entry) => ({\n          record: entry.rule,\n          score: tokens.length === 0 ? 0 : entry.overlap / tokens.length,\n          signals: { lexical: entry.overlap },\n        }));\n      },\n    );\n  }\n\n  /**\n   * Promote a quarantined (induced) procedure into `activate()` (MCON-2).\n   * Mirrors {@link SemanticMemory.validate}: re-derives the injection verdict\n   * from the stored rule text and **refuses** promotion of an injection-flagged\n   * procedure unless an operator passes `{ force: true }`. Induced procedures\n   * drive *actions*, so this gate matters most for them.\n   */\n  async validate(\n    scope: SessionScope,\n    ruleId: string,\n    reason?: string,\n    options?: { readonly force?: boolean },\n  ): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'validate', 'memory.procedural.rule_id': ruleId },\n      async (span) => {\n        const store = this.#store.procedural;\n        if (typeof store.setStatus !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] ProceduralMemory.validate(...) requires a storage adapter that implements `procedural.setStatus(id, status)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via ProceduralMemoryStoreExt.',\n          );\n        }\n        const force = options?.force === true;\n        // No store get-by-id for rules - list() already surfaces quarantined.\n        const existing = (await store.list(scope)).find((rule) => rule.id === ruleId) ?? null;\n        if (existing !== null && !force) {\n          const injection = detectMemoryInjection(existing.text);\n          if (injection.flagged) {\n            span.setAttributes({ 'memory.procedural.validate.refused': true });\n            throw new QuarantinePromotionRefusedError(ruleId, injection.markers);\n          }\n        }\n        span.setAttributes({ 'memory.procedural.validate.forced': force });\n        await store.setStatus(ruleId, 'active', reason);\n      },\n    );\n  }\n}\n\n/** Render an induced procedure into the human-readable `Rule.text`. */\nfunction renderProcedureText(procedure: InducedProcedure): string {\n  const lines = [procedure.title, ...procedure.steps.map((step, i) => `${i + 1}. ${step}`)];\n  return lines.join('\\n');\n}\n\n/** Lowercased word tokens for the offline runbook-search fallback (D3). */\nfunction tokenizeForRunbook(text: string): ReadonlyArray<string> {\n  return text\n    .toLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter((token) => token.length > 1);\n}\n\nfunction predicateMatches(rule: Rule, context: RuleActivationContext): boolean {\n  if (rule.condition === undefined || rule.condition === 'always') return true;\n  if (rule.condition.startsWith('topic=')) {\n    const wanted = rule.condition.slice('topic='.length).trim();\n    return context.topic === wanted;\n  }\n  if (rule.condition.startsWith('tag=')) {\n    const wanted = rule.condition.slice('tag='.length).trim();\n    return (context.tags ?? []).includes(wanted);\n  }\n  return true;\n}\n"],"mappings":";;;;;;;;;AA6BA,MAAM,mBAAmB;;;;;;;;;;;;;;;AAuEzB,IAAa,mBAAb,MAA8B;CAC5B,CAASA;CACT,CAASC;;CAET,CAASC;;;;;CAKT,CAASC;CAET,YAAY,MAKT;AACD,QAAKH,QAAS,KAAK;AACnB,QAAKC,SAAU,KAAK;AACpB,QAAKC,UAAW,KAAK,WAAW;EAChC,MAAM,IAAI,KAAK;AACf,QAAKC,wBACH,OAAO,MAAM,YAAY,OAAO,SAAS,EAAE,IAAI,KAAK,IAAI,KAAK,MAAM,EAAE,GAAG;;;;;;;;;;;;;;;;;;CAmB5E,MAAM,cACJ,OACA,QACA,WAKC;AACD,SAAO,eACL,MAAKF,QACL,2BACA,OACA;GAAE,4BAA4B;GAAkB,6BAA6B;GAAQ,EACrF,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,CAAC,aAAa,OAAO,MAAM,kBAAkB,YAAY;AAC3D,SAAK,cAAc,EAAE,qCAAqC,OAAO,CAAC;AAClE,WAAO;KAAE,cAAc;KAAG,UAAU;KAAO,SAAS;KAAO;;GAE7D,MAAM,eAAe,MAAM,MAAM,cAAc,OAAO;AACtD,QAAK,cAAc,EAAE,2CAA2C,cAAc,CAAC;GAC/E,MAAM,YAAY,MAAKG;AACvB,OAAI,cAAc,QAAQ,eAAe,UACvC,QAAO;IAAE;IAAc,UAAU;IAAO,SAAS;IAAO;GAE1D,MAAM,YAAY,MAAM,MAAM,KAAK,MAAM,EAAE,MAAM,SAAS,KAAK,OAAO,OAAO,IAAI;AACjF,OAAI,aAAa,QAAQ,SAAS,WAAW,cAC3C,QAAO;IAAE;IAAc,UAAU;IAAO,SAAS;IAAO;AAE1D,OAAI;AACF,UAAM,KAAK,SACT,OACA,QACA,yBAAyB,aAAa,MAAM,YAC7C;AACD,SAAK,cAAc,EAAE,sCAAsC,MAAM,CAAC;AAClE,WAAO;KAAE;KAAc,UAAU;KAAM,SAAS;KAAO;YAChD,KAAK;AACZ,QAAI,eAAe,iCAAiC;AAClD,UAAK,cAAc,EAAE,qCAAqC,MAAM,CAAC;AACjE,YAAO;MAAE;MAAc,UAAU;MAAO,SAAS;MAAM;;AAEzD,UAAM;;IAGX;;;CAIH,MAAM,OAAO,OAAqB,OAAiC;AACjE,SAAO,eAAe,MAAKF,QAAS,2BAA2B,OAAO,EAAE,EAAE,OAAO,SAAS;GACxF,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;GACpC,MAAMG,OAAa;IACjB,IAAI,YAAY,OAAO;IACvB,MAAM;IACN,QAAQ,MAAM;IACd,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,GAAI,MAAM,YAAY,SAAY,EAAE,SAAS,MAAM,SAAS,GAAG,EAAE;IACjE,aAAa,MAAM,eAAe;IAClC,MAAM,MAAM;IACZ,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,UAAU,MAAM,YAAY;IAC5B,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,GAAG,EAAE;IAC5E,GAAI,MAAM,UAAU,SAAY,EAAE,OAAO,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,CAAC,EAAE,GAAG,EAAE;IAC/E,GAAI,MAAM,cAAc,SACpB,EAAE,WAAW,OAAO,OAAO,CAAC,GAAG,MAAM,UAAU,CAAC,EAAE,GAClD,EAAE;IACN,GAAI,MAAM,oBAAoB,SAC1B,EAAE,iBAAiB,OAAO,OAAO,CAAC,GAAG,MAAM,gBAAgB,CAAC,EAAE,GAC9D,EAAE;IACN,GAAI,MAAM,UAAU,SAAY,EAAE,OAAO,MAAM,OAAO,GAAG,EAAE;IAC3D,WAAW;IACX,WAAW;IACZ;AACD,SAAM,MAAKJ,MAAO,WAAW,IAAI,KAAK;AACtC,QAAK,cAAc;IACjB,8BAA8B,KAAK;IACnC,iCAAiC,MAAM,KAAK;IAC7C,CAAC;AACF,UAAO;IACP;;;;;;;;;;;CAYJ,MAAM,OACJ,OACA,YACA,OAAsB,EAAE,EACF;EACtB,MAAM,UAAU,MAAKE;AACrB,MAAI,YAAY,KAAM,OAAM,IAAI,sCAAsC;AACtE,SAAO,eACL,MAAKD,QACL,2BACA,OACA,EAAE,4BAA4B,UAAU,EACxC,OAAO,SAAS;GACd,MAAM,UAAU,MAAM,qBAAqB,YAAY,SAAS,EAAE,CAAC;AACnE,OAAI,YAAY,MAAM;AACpB,SAAK,cAAc,EAAE,6BAA6B,GAAG,CAAC;AACtD,WAAO;;GAET,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;GACpC,MAAMG,OAAa;IACjB,IAAI,YAAY,OAAO;IACvB,MAAM;IACN,QAAQ,MAAM;IACd,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,GAAI,MAAM,YAAY,SAAY,EAAE,SAAS,MAAM,SAAS,GAAG,EAAE;IAGjE,aAAa,KAAK,eAAe;IACjC,MAAM,oBAAoB,QAAQ;IAClC,UAAU,KAAK,YAAY;IAC3B,OAAO,OAAO,OAAO,CAAC,GAAG,QAAQ,MAAM,CAAC;IACxC,WAAW,OAAO,OAAO,CAAC,GAAG,QAAQ,UAAU,CAAC;IAChD,iBAAiB,OAAO,OAAO,CAAC,GAAG,QAAQ,gBAAgB,CAAC;IAG5D,YAAY;IACZ,QAAQ;IAER,OAAO;IACP,WAAW;IACX,WAAW;IACZ;AACD,SAAM,MAAKJ,MAAO,WAAW,IAAI,KAAK;AACtC,QAAK,cAAc;IACjB,6BAA6B;IAC7B,2BAA2B,QAAQ,MAAM;IACzC,+BAA+B,QAAQ,UAAU;IAClD,CAAC;AACF,UAAO;IAEV;;;;;;;CAQH,MAAM,cACJ,OACA,KACA,OAAsB,EAAE,EACF;AACtB,SAAO,KAAK,OAAO,OAAO,uBAAuB,IAAI,EAAE,KAAK;;;CAI9D,MAAM,OAAO,OAAqB,QAAgB,QAAgC;AAChF,QAAM,eACJ,MAAKC,QACL,2BACA,OACA;GAAE,4BAA4B;GAAU,6BAA6B;GAAQ,EAC7E,YAAY;AACV,SAAM,MAAKD,MAAO,WAAW,OAAO,QAAQ,OAAO;IAEtD;;;CAIH,MAAM,KAAK,OAAmD;AAC5D,SAAO,eAAe,MAAKC,QAAS,0BAA0B,OAAO,EAAE,EAAE,OAAO,SAAS;GACvF,MAAM,MAAM,MAAM,MAAKD,MAAO,WAAW,KAAK,MAAM;AACpD,QAAK,cAAc,EAAE,gCAAgC,IAAI,QAAQ,CAAC;AAClE,UAAO;IACP;;;;;;;;;;;;;CAcJ,MAAM,SACJ,OACA,UAAiC,EAAE,EACL;AAE9B,UADc,MAAM,KAAK,KAAK,MAAM,EAEjC,QAAQ,SAAS,KAAK,WAAW,iBAAiB,iBAAiB,MAAM,QAAQ,CAAC,CAClF,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,SAAS;;;;;;;;;;;;;;;;;;CAmB5C,MAAM,OACJ,OACA,OACA,OAA0E,EAAE,EACnC;AACzC,SAAO,eACL,MAAKC,QACL,0BACA,OACA,EAAE,4BAA4B,UAAU,EACxC,OAAO,SAAS;GACd,MAAM,OAAO,KAAK,QAAQ;GAC1B,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,WAAW,YAAY;IACtC,MAAM,OAAO,MAAM,MAAM,OAAO,OAAO,OAAO;KAC5C;KACA,GAAI,KAAK,uBAAuB,OAAO,EAAE,oBAAoB,MAAM,GAAG,EAAE;KACzE,CAAC;AACF,SAAK,cAAc;KACjB,gCAAgC,KAAK;KACrC,yCAAyC;KAC1C,CAAC;AACF,WAAO;;GAKT,MAAM,SAAS,mBAAmB,MAAM;GAExC,MAAM,UADQ,MAAM,KAAK,KAAK,MAAM,EAEjC,QAAQ,SAAS,KAAK,uBAAuB,QAAQ,KAAK,WAAW,cAAc,CACnF,KAAK,SAAS;IACb,MAAM,WAAW,mBACf;KAAC,KAAK;KAAM,GAAI,KAAK,SAAS,EAAE;KAAG,GAAI,KAAK,QAAQ,EAAE;KAAE,CAAC,KAAK,IAAI,CACnE;AAED,WAAO;KAAE;KAAM,SADC,OAAO,QAAQ,MAAM,SAAS,SAAS,EAAE,CAAC,CAAC;KACnC;KACxB,CACD,QAAQ,UAAU,MAAM,UAAU,EAAE,CACpC,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,KAAK,KAAK,EAAE,KAAK,KAAK,KAAK,GAAG,CACzE,MAAM,GAAG,KAAK;AACjB,QAAK,cAAc;IACjB,gCAAgC,OAAO;IACvC,yCAAyC;IAC1C,CAAC;AACF,UAAO,OAAO,KAAK,WAAW;IAC5B,QAAQ,MAAM;IACd,OAAO,OAAO,WAAW,IAAI,IAAI,MAAM,UAAU,OAAO;IACxD,SAAS,EAAE,SAAS,MAAM,SAAS;IACpC,EAAE;IAEN;;;;;;;;;CAUH,MAAM,SACJ,OACA,QACA,QACA,SACe;AACf,QAAM,eACJ,MAAKC,QACL,2BACA,OACA;GAAE,4BAA4B;GAAY,6BAA6B;GAAQ,EAC/E,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,cAAc,WAC7B,OAAM,IAAI,UACR,yPAED;GAEH,MAAM,QAAQ,SAAS,UAAU;GAEjC,MAAM,YAAY,MAAM,MAAM,KAAK,MAAM,EAAE,MAAM,SAAS,KAAK,OAAO,OAAO,IAAI;AACjF,OAAI,aAAa,QAAQ,CAAC,OAAO;IAC/B,MAAM,YAAY,sBAAsB,SAAS,KAAK;AACtD,QAAI,UAAU,SAAS;AACrB,UAAK,cAAc,EAAE,sCAAsC,MAAM,CAAC;AAClE,WAAM,IAAI,gCAAgC,QAAQ,UAAU,QAAQ;;;AAGxE,QAAK,cAAc,EAAE,qCAAqC,OAAO,CAAC;AAClE,SAAM,MAAM,UAAU,QAAQ,UAAU,OAAO;IAElD;;;;AAKL,SAAS,oBAAoB,WAAqC;AAEhE,QADc,CAAC,UAAU,OAAO,GAAG,UAAU,MAAM,KAAK,MAAM,MAAM,GAAG,IAAI,EAAE,IAAI,OAAO,CAAC,CAC5E,KAAK,KAAK;;;AAIzB,SAAS,mBAAmB,MAAqC;AAC/D,QAAO,KACJ,aAAa,CACb,MAAM,kBAAkB,CACxB,QAAQ,UAAU,MAAM,SAAS,EAAE;;AAGxC,SAAS,iBAAiB,MAAY,SAAyC;AAC7E,KAAI,KAAK,cAAc,UAAa,KAAK,cAAc,SAAU,QAAO;AACxE,KAAI,KAAK,UAAU,WAAW,SAAS,EAAE;EACvC,MAAM,SAAS,KAAK,UAAU,MAAM,EAAgB,CAAC,MAAM;AAC3D,SAAO,QAAQ,UAAU;;AAE3B,KAAI,KAAK,UAAU,WAAW,OAAO,EAAE;EACrC,MAAM,SAAS,KAAK,UAAU,MAAM,EAAc,CAAC,MAAM;AACzD,UAAQ,QAAQ,QAAQ,EAAE,EAAE,SAAS,OAAO;;AAE9C,QAAO"}
+{"version":3,"file":"procedural-memory.js","names":["#store","#tracer","#inducer","#promoteAfterSuccesses","rule: Rule"],"sources":["../../src/tiers/procedural-memory.ts"],"sourcesContent":["import type {\n  MemoryHit,\n  MemoryOwner,\n  MemoryProvenance,\n  MemoryStatus,\n  Rule,\n  RunState,\n  Sensitivity,\n  SessionScope,\n  Tracer,\n} from '@graphorin/core';\nimport {\n  type InducedProcedure,\n  runWorkflowInduction,\n  type Trajectory,\n  trajectoryFromRunState,\n  type WorkflowInducer,\n} from '../consolidator/phases/induce.js';\nimport {\n  ProcedureInductionNotConfiguredError,\n  QuarantinePromotionRefusedError,\n} from '../errors/index.js';\nimport { newMemoryId } from '../internal/id.js';\nimport { detectMemoryInjection } from '../internal/injection-heuristics.js';\nimport { withMemorySpan } from '../internal/spans.js';\nimport type { MemoryStoreAdapter } from '../internal/storage-adapter.js';\n\n/** Default priority for an *induced* procedure - below the author default\n * (50) because an induced, still-quarantined procedure is provisional. */\nconst INDUCED_PRIORITY = 40;\n\n/**\n * Author-time rule payload accepted by {@link ProceduralMemory.define}.\n *\n * @stable\n */\nexport interface RuleInput {\n  readonly text: string;\n  /**\n   * Free-form predicate evaluated by {@link ProceduralMemory.activate}.\n   * The predicate language is intentionally narrow in v0.1: either\n   * the literal string `'always'`, or a `'topic=...'` / `'tag=...'`\n   * shorthand. Custom predicates should be expressed as a callable\n   * matched in `activate(...)`'s `customMatchers` argument.\n   */\n  readonly condition?: string;\n  /** Default `'public'` per DEC-126 - rules are NOT user data. */\n  readonly sensitivity?: Sensitivity;\n  readonly priority?: number;\n  readonly tags?: ReadonlyArray<string>;\n  /**\n   * Optional structured workflow payload (P2-2). Usually set by\n   * {@link ProceduralMemory.induce}, but accepted here so an author can\n   * round-trip a hand-written procedure. See {@link Rule.steps}.\n   */\n  readonly steps?: ReadonlyArray<string>;\n  /** Variable names abstracted into {@link RuleInput.steps} (P2-2). */\n  readonly variables?: ReadonlyArray<string>;\n  /** Verifiable success criteria stored with the procedure (P2-2). */\n  readonly successCriteria?: ReadonlyArray<string>;\n  /** Principal dimension (D3). Absent ⇒ NULL (treated `'user'`). */\n  readonly owner?: MemoryOwner;\n}\n\n/**\n * Options for {@link ProceduralMemory.induce}.\n *\n * @stable\n */\nexport interface InduceOptions {\n  /** Sensitivity of the stored procedure. Default `'internal'`. */\n  readonly sensitivity?: Sensitivity;\n  /** Priority of the stored procedure. Default `INDUCED_PRIORITY` (40). */\n  readonly priority?: number;\n}\n\n/**\n * Predicate context passed to {@link ProceduralMemory.activate}.\n *\n * @stable\n */\nexport interface RuleActivationContext {\n  readonly topic?: string;\n  readonly tags?: ReadonlyArray<string>;\n}\n\n/**\n * `ProceduralMemory` - standing orders activated when the agent's\n * current context matches the rule's predicate. The activation rules\n * are deterministic so the agent runtime + ContextEngine can render\n * the active set into the system prompt every step.\n *\n * P2-2 adds {@link ProceduralMemory.induce}: distil a reusable workflow\n * from a successful agent trajectory and store it **quarantined** (it must\n * not drive actions until validated). Quarantined procedures are excluded\n * from {@link ProceduralMemory.activate} but remain visible to\n * {@link ProceduralMemory.list}.\n *\n * @stable\n */\nexport class ProceduralMemory {\n  readonly #store: MemoryStoreAdapter;\n  readonly #tracer: Tracer;\n  /** Opt-in workflow inducer (P2-2). `null` ⇒ {@link induce} throws. */\n  readonly #inducer: WorkflowInducer | null;\n  /**\n   * Promotion-by-demonstrated-success threshold (MCON-2 part 4).\n   * `null` ⇒ outcomes are counted but never auto-promote.\n   */\n  readonly #promoteAfterSuccesses: number | null;\n\n  constructor(args: {\n    store: MemoryStoreAdapter;\n    tracer: Tracer;\n    inducer?: WorkflowInducer | null;\n    promoteAfterSuccesses?: number | null;\n  }) {\n    this.#store = args.store;\n    this.#tracer = args.tracer;\n    this.#inducer = args.inducer ?? null;\n    const k = args.promoteAfterSuccesses;\n    this.#promoteAfterSuccesses =\n      typeof k === 'number' && Number.isFinite(k) && k >= 1 ? Math.floor(k) : null;\n  }\n\n  /**\n   * Record the outcome of one demonstrated reuse of a procedure\n   * (MCON-2 part 4). A success increments the rule's persistent\n   * `successCount`; when `procedurePromotion.afterSuccesses` is\n   * configured and a QUARANTINED procedure reaches the threshold it is\n   * promoted through {@link validate} - the injection gate still\n   * applies, so a flagged text refuses promotion (surfaced as\n   * `refused: true`) no matter how many successes accumulate.\n   * Failures are observed but not persisted (no negative counter yet).\n   *\n   * Callers decide what \"success\" means - typically\n   * `checkSuccessCriteria(...)` over the procedure's stored\n   * `successCriteria`, or an operator's judgement.\n   *\n   * @stable\n   */\n  async recordOutcome(\n    scope: SessionScope,\n    ruleId: string,\n    succeeded: boolean,\n  ): Promise<{\n    readonly successCount: number;\n    readonly promoted: boolean;\n    readonly refused: boolean;\n  }> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'record-outcome', 'memory.procedural.rule_id': ruleId },\n      async (span) => {\n        const store = this.#store.procedural;\n        if (!succeeded || typeof store.recordSuccess !== 'function') {\n          span.setAttributes({ 'memory.procedural.outcome.counted': false });\n          return { successCount: 0, promoted: false, refused: false };\n        }\n        const successCount = await store.recordSuccess(ruleId);\n        span.setAttributes({ 'memory.procedural.outcome.success_count': successCount });\n        const threshold = this.#promoteAfterSuccesses;\n        if (threshold === null || successCount < threshold) {\n          return { successCount, promoted: false, refused: false };\n        }\n        const existing = (await store.list(scope)).find((rule) => rule.id === ruleId) ?? null;\n        if (existing === null || existing.status !== 'quarantined') {\n          return { successCount, promoted: false, refused: false };\n        }\n        try {\n          await this.validate(\n            scope,\n            ruleId,\n            `demonstrated-success: ${successCount} >= ${threshold}`,\n          );\n          span.setAttributes({ 'memory.procedural.outcome.promoted': true });\n          return { successCount, promoted: true, refused: false };\n        } catch (err) {\n          if (err instanceof QuarantinePromotionRefusedError) {\n            span.setAttributes({ 'memory.procedural.outcome.refused': true });\n            return { successCount, promoted: false, refused: true };\n          }\n          throw err;\n        }\n      },\n    );\n  }\n\n  /** Persist a rule. Returns the stored record. */\n  async define(scope: SessionScope, input: RuleInput): Promise<Rule> {\n    return withMemorySpan(this.#tracer, 'memory.write.procedural', scope, {}, async (span) => {\n      const now = new Date().toISOString();\n      const rule: Rule = {\n        id: newMemoryId('rule'),\n        kind: 'procedural',\n        userId: scope.userId,\n        ...(scope.sessionId !== undefined ? { sessionId: scope.sessionId } : {}),\n        ...(scope.agentId !== undefined ? { agentId: scope.agentId } : {}),\n        sensitivity: input.sensitivity ?? 'public',\n        text: input.text,\n        ...(input.condition !== undefined ? { condition: input.condition } : {}),\n        priority: input.priority ?? 50,\n        ...(input.tags !== undefined ? { tags: Object.freeze([...input.tags]) } : {}),\n        ...(input.steps !== undefined ? { steps: Object.freeze([...input.steps]) } : {}),\n        ...(input.variables !== undefined\n          ? { variables: Object.freeze([...input.variables]) }\n          : {}),\n        ...(input.successCriteria !== undefined\n          ? { successCriteria: Object.freeze([...input.successCriteria]) }\n          : {}),\n        ...(input.owner !== undefined ? { owner: input.owner } : {}),\n        createdAt: now,\n        updatedAt: now,\n      };\n      await this.#store.procedural.add(rule);\n      span.setAttributes({\n        'memory.procedural.priority': rule.priority,\n        'memory.procedural.text_length': input.text.length,\n      });\n      return rule;\n    });\n  }\n\n  /**\n   * Induce a reusable procedure (P2-2) from a successful agent trajectory\n   * and store it **quarantined** + `provenance: 'induction'` (P1-4). Returns\n   * the stored {@link Rule}, or `null` when the trajectory was unsuccessful /\n   * empty or the inducer produced nothing inducible.\n   *\n   * Throws {@link ProcedureInductionNotConfiguredError} when no inducer was\n   * configured (`createMemory({ procedureInduction: { provider } })`).\n   */\n  async induce(\n    scope: SessionScope,\n    trajectory: Trajectory,\n    opts: InduceOptions = {},\n  ): Promise<Rule | null> {\n    const inducer = this.#inducer;\n    if (inducer === null) throw new ProcedureInductionNotConfiguredError();\n    return withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'induce' },\n      async (span) => {\n        const induced = await runWorkflowInduction(trajectory, inducer, {});\n        if (induced === null) {\n          span.setAttributes({ 'memory.procedural.induced': 0 });\n          return null;\n        }\n        const now = new Date().toISOString();\n        const rule: Rule = {\n          id: newMemoryId('rule'),\n          kind: 'procedural',\n          userId: scope.userId,\n          ...(scope.sessionId !== undefined ? { sessionId: scope.sessionId } : {}),\n          ...(scope.agentId !== undefined ? { agentId: scope.agentId } : {}),\n          // Induced from a run ⇒ user-derived, so 'internal' (not the public\n          // default for author-defined rules).\n          sensitivity: opts.sensitivity ?? 'internal',\n          text: renderProcedureText(induced),\n          priority: opts.priority ?? INDUCED_PRIORITY,\n          steps: Object.freeze([...induced.steps]),\n          variables: Object.freeze([...induced.variables]),\n          successCriteria: Object.freeze([...induced.successCriteria]),\n          // Highest-poisoning-risk write in the system - procedures drive\n          // actions, so it lands quarantined + provenance-tagged (P1-4).\n          provenance: 'induction' satisfies MemoryProvenance,\n          status: 'quarantined' satisfies MemoryStatus,\n          // D3: an induced procedure is the agent's own inference.\n          owner: 'agent',\n          createdAt: now,\n          updatedAt: now,\n        };\n        await this.#store.procedural.add(rule);\n        span.setAttributes({\n          'memory.procedural.induced': 1,\n          'memory.procedural.steps': induced.steps.length,\n          'memory.procedural.variables': induced.variables.length,\n        });\n        return rule;\n      },\n    );\n  }\n\n  /**\n   * Convenience over {@link induce}: distil the {@link Trajectory} from a\n   * completed {@link RunState} (the agent's already-emitted run state) and\n   * induce a procedure. The success signal is `status === 'completed'`.\n   */\n  async induceFromRun(\n    scope: SessionScope,\n    run: RunState,\n    opts: InduceOptions = {},\n  ): Promise<Rule | null> {\n    return this.induce(scope, trajectoryFromRunState(run), opts);\n  }\n\n  /** Soft-delete a rule. */\n  async remove(scope: SessionScope, ruleId: string, reason?: string): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'remove', 'memory.procedural.rule_id': ruleId },\n      async () => {\n        await this.#store.procedural.remove(ruleId, reason);\n      },\n    );\n  }\n\n  /** List every active (non-deleted) rule for the supplied scope. */\n  async list(scope: SessionScope): Promise<ReadonlyArray<Rule>> {\n    return withMemorySpan(this.#tracer, 'memory.read.procedural', scope, {}, async (span) => {\n      const out = await this.#store.procedural.list(scope);\n      span.setAttributes({ 'memory.read.procedural.count': out.length });\n      return out;\n    });\n  }\n\n  /**\n   * Return the rules active under `context`. Rules without a\n   * `condition` are always active; the bundled predicate vocabulary\n   * supports the literals `'always'`, `'topic=<topic>'`, and\n   * `'tag=<tag>'`. Anything outside that grammar is treated as\n   * always-active so callers do not silently lose rules.\n   *\n   * **Quarantined procedures are excluded** (P1-4 / P2-2): an induced\n   * procedure must not drive actions until validated, so activation - which\n   * feeds the system prompt - never surfaces it.\n   */\n  async activate(\n    scope: SessionScope,\n    context: RuleActivationContext = {},\n  ): Promise<ReadonlyArray<Rule>> {\n    const rules = await this.list(scope);\n    return rules\n      .filter((rule) => rule.status !== 'quarantined' && predicateMatches(rule, context))\n      .sort((a, b) => b.priority - a.priority);\n  }\n\n  /**\n   * Runbook content search (D3): \"find the procedure for this task\" -\n   * lexical recall over rule text, as opposed to predicate\n   * {@link activate}. Returns **whole validated procedures** (the full\n   * {@link Rule} incl. steps / variables / success criteria) so a match\n   * can be followed file-style rather than re-synthesized from\n   * fragments. Quarantined (unvalidated induced) procedures are\n   * excluded - they must not drive actions - unless the inspector opts\n   * in via `includeQuarantined`.\n   *\n   * Uses the storage adapter's FTS surface when available\n   * (`procedural.search`, the default `@graphorin/store-sqlite` adapter\n   * implements it via migration 028); otherwise degrades to an offline\n   * in-memory token-overlap scan over {@link list}, so custom adapters\n   * keep working without the index.\n   */\n  async search(\n    scope: SessionScope,\n    query: string,\n    opts: { readonly topK?: number; readonly includeQuarantined?: boolean } = {},\n  ): Promise<ReadonlyArray<MemoryHit<Rule>>> {\n    return withMemorySpan(\n      this.#tracer,\n      'memory.read.procedural',\n      scope,\n      { 'memory.procedural.action': 'search' },\n      async (span) => {\n        const topK = opts.topK ?? 5;\n        const store = this.#store.procedural;\n        if (typeof store.search === 'function') {\n          const hits = await store.search(scope, query, {\n            topK,\n            ...(opts.includeQuarantined === true ? { includeQuarantined: true } : {}),\n          });\n          span.setAttributes({\n            'memory.read.procedural.count': hits.length,\n            'memory.read.procedural.search_backend': 'store',\n          });\n          return hits;\n        }\n        // Fallback: offline token-overlap scoring over list(). Coarse by\n        // design - it exists so the runbook surface degrades instead of\n        // disappearing on adapters without an FTS index.\n        const tokens = tokenizeForRunbook(query);\n        const rules = await this.list(scope);\n        const scored = rules\n          .filter((rule) => opts.includeQuarantined === true || rule.status !== 'quarantined')\n          .map((rule) => {\n            const haystack = tokenizeForRunbook(\n              [rule.text, ...(rule.steps ?? []), ...(rule.tags ?? [])].join(' '),\n            );\n            const overlap = tokens.filter((t) => haystack.includes(t)).length;\n            return { rule, overlap };\n          })\n          .filter((entry) => entry.overlap > 0)\n          .sort((a, b) => b.overlap - a.overlap || (a.rule.id < b.rule.id ? -1 : 1))\n          .slice(0, topK);\n        span.setAttributes({\n          'memory.read.procedural.count': scored.length,\n          'memory.read.procedural.search_backend': 'fallback',\n        });\n        return scored.map((entry) => ({\n          record: entry.rule,\n          score: tokens.length === 0 ? 0 : entry.overlap / tokens.length,\n          signals: { lexical: entry.overlap },\n        }));\n      },\n    );\n  }\n\n  /**\n   * Promote a quarantined (induced) procedure into `activate()` (MCON-2).\n   * Mirrors {@link SemanticMemory.validate}: re-derives the injection verdict\n   * from the stored rule text and **refuses** promotion of an injection-flagged\n   * procedure unless an operator passes `{ force: true }`. Induced procedures\n   * drive *actions*, so this gate matters most for them.\n   */\n  async validate(\n    scope: SessionScope,\n    ruleId: string,\n    reason?: string,\n    options?: { readonly force?: boolean },\n  ): Promise<void> {\n    await withMemorySpan(\n      this.#tracer,\n      'memory.write.procedural',\n      scope,\n      { 'memory.procedural.action': 'validate', 'memory.procedural.rule_id': ruleId },\n      async (span) => {\n        const store = this.#store.procedural;\n        if (typeof store.setStatus !== 'function') {\n          throw new TypeError(\n            '[graphorin/memory] ProceduralMemory.validate(...) requires a storage adapter that implements `procedural.setStatus(id, status)`. ' +\n              'The default `@graphorin/store-sqlite` adapter implements it; custom adapters can opt in via ProceduralMemoryStoreExt.',\n          );\n        }\n        const force = options?.force === true;\n        // No store get-by-id for rules - list() already surfaces quarantined.\n        const existing = (await store.list(scope)).find((rule) => rule.id === ruleId) ?? null;\n        if (existing !== null && !force) {\n          const injection = detectMemoryInjection(existing.text);\n          if (injection.flagged) {\n            span.setAttributes({ 'memory.procedural.validate.refused': true });\n            throw new QuarantinePromotionRefusedError(ruleId, injection.markers);\n          }\n        }\n        span.setAttributes({ 'memory.procedural.validate.forced': force });\n        await store.setStatus(ruleId, 'active', reason, scope);\n      },\n    );\n  }\n}\n\n/** Render an induced procedure into the human-readable `Rule.text`. */\nfunction renderProcedureText(procedure: InducedProcedure): string {\n  const lines = [procedure.title, ...procedure.steps.map((step, i) => `${i + 1}. ${step}`)];\n  return lines.join('\\n');\n}\n\n/** Lowercased word tokens for the offline runbook-search fallback (D3). */\nfunction tokenizeForRunbook(text: string): ReadonlyArray<string> {\n  return text\n    .toLowerCase()\n    .split(/[^\\p{L}\\p{N}]+/u)\n    .filter((token) => token.length > 1);\n}\n\nfunction predicateMatches(rule: Rule, context: RuleActivationContext): boolean {\n  if (rule.condition === undefined || rule.condition === 'always') return true;\n  if (rule.condition.startsWith('topic=')) {\n    const wanted = rule.condition.slice('topic='.length).trim();\n    return context.topic === wanted;\n  }\n  if (rule.condition.startsWith('tag=')) {\n    const wanted = rule.condition.slice('tag='.length).trim();\n    return (context.tags ?? []).includes(wanted);\n  }\n  return true;\n}\n"],"mappings":";;;;;;;;;AA6BA,MAAM,mBAAmB;;;;;;;;;;;;;;;AAuEzB,IAAa,mBAAb,MAA8B;CAC5B,CAASA;CACT,CAASC;;CAET,CAASC;;;;;CAKT,CAASC;CAET,YAAY,MAKT;AACD,QAAKH,QAAS,KAAK;AACnB,QAAKC,SAAU,KAAK;AACpB,QAAKC,UAAW,KAAK,WAAW;EAChC,MAAM,IAAI,KAAK;AACf,QAAKC,wBACH,OAAO,MAAM,YAAY,OAAO,SAAS,EAAE,IAAI,KAAK,IAAI,KAAK,MAAM,EAAE,GAAG;;;;;;;;;;;;;;;;;;CAmB5E,MAAM,cACJ,OACA,QACA,WAKC;AACD,SAAO,eACL,MAAKF,QACL,2BACA,OACA;GAAE,4BAA4B;GAAkB,6BAA6B;GAAQ,EACrF,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,CAAC,aAAa,OAAO,MAAM,kBAAkB,YAAY;AAC3D,SAAK,cAAc,EAAE,qCAAqC,OAAO,CAAC;AAClE,WAAO;KAAE,cAAc;KAAG,UAAU;KAAO,SAAS;KAAO;;GAE7D,MAAM,eAAe,MAAM,MAAM,cAAc,OAAO;AACtD,QAAK,cAAc,EAAE,2CAA2C,cAAc,CAAC;GAC/E,MAAM,YAAY,MAAKG;AACvB,OAAI,cAAc,QAAQ,eAAe,UACvC,QAAO;IAAE;IAAc,UAAU;IAAO,SAAS;IAAO;GAE1D,MAAM,YAAY,MAAM,MAAM,KAAK,MAAM,EAAE,MAAM,SAAS,KAAK,OAAO,OAAO,IAAI;AACjF,OAAI,aAAa,QAAQ,SAAS,WAAW,cAC3C,QAAO;IAAE;IAAc,UAAU;IAAO,SAAS;IAAO;AAE1D,OAAI;AACF,UAAM,KAAK,SACT,OACA,QACA,yBAAyB,aAAa,MAAM,YAC7C;AACD,SAAK,cAAc,EAAE,sCAAsC,MAAM,CAAC;AAClE,WAAO;KAAE;KAAc,UAAU;KAAM,SAAS;KAAO;YAChD,KAAK;AACZ,QAAI,eAAe,iCAAiC;AAClD,UAAK,cAAc,EAAE,qCAAqC,MAAM,CAAC;AACjE,YAAO;MAAE;MAAc,UAAU;MAAO,SAAS;MAAM;;AAEzD,UAAM;;IAGX;;;CAIH,MAAM,OAAO,OAAqB,OAAiC;AACjE,SAAO,eAAe,MAAKF,QAAS,2BAA2B,OAAO,EAAE,EAAE,OAAO,SAAS;GACxF,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;GACpC,MAAMG,OAAa;IACjB,IAAI,YAAY,OAAO;IACvB,MAAM;IACN,QAAQ,MAAM;IACd,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,GAAI,MAAM,YAAY,SAAY,EAAE,SAAS,MAAM,SAAS,GAAG,EAAE;IACjE,aAAa,MAAM,eAAe;IAClC,MAAM,MAAM;IACZ,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,UAAU,MAAM,YAAY;IAC5B,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,KAAK,CAAC,EAAE,GAAG,EAAE;IAC5E,GAAI,MAAM,UAAU,SAAY,EAAE,OAAO,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,CAAC,EAAE,GAAG,EAAE;IAC/E,GAAI,MAAM,cAAc,SACpB,EAAE,WAAW,OAAO,OAAO,CAAC,GAAG,MAAM,UAAU,CAAC,EAAE,GAClD,EAAE;IACN,GAAI,MAAM,oBAAoB,SAC1B,EAAE,iBAAiB,OAAO,OAAO,CAAC,GAAG,MAAM,gBAAgB,CAAC,EAAE,GAC9D,EAAE;IACN,GAAI,MAAM,UAAU,SAAY,EAAE,OAAO,MAAM,OAAO,GAAG,EAAE;IAC3D,WAAW;IACX,WAAW;IACZ;AACD,SAAM,MAAKJ,MAAO,WAAW,IAAI,KAAK;AACtC,QAAK,cAAc;IACjB,8BAA8B,KAAK;IACnC,iCAAiC,MAAM,KAAK;IAC7C,CAAC;AACF,UAAO;IACP;;;;;;;;;;;CAYJ,MAAM,OACJ,OACA,YACA,OAAsB,EAAE,EACF;EACtB,MAAM,UAAU,MAAKE;AACrB,MAAI,YAAY,KAAM,OAAM,IAAI,sCAAsC;AACtE,SAAO,eACL,MAAKD,QACL,2BACA,OACA,EAAE,4BAA4B,UAAU,EACxC,OAAO,SAAS;GACd,MAAM,UAAU,MAAM,qBAAqB,YAAY,SAAS,EAAE,CAAC;AACnE,OAAI,YAAY,MAAM;AACpB,SAAK,cAAc,EAAE,6BAA6B,GAAG,CAAC;AACtD,WAAO;;GAET,MAAM,uBAAM,IAAI,MAAM,EAAC,aAAa;GACpC,MAAMG,OAAa;IACjB,IAAI,YAAY,OAAO;IACvB,MAAM;IACN,QAAQ,MAAM;IACd,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,WAAW,GAAG,EAAE;IACvE,GAAI,MAAM,YAAY,SAAY,EAAE,SAAS,MAAM,SAAS,GAAG,EAAE;IAGjE,aAAa,KAAK,eAAe;IACjC,MAAM,oBAAoB,QAAQ;IAClC,UAAU,KAAK,YAAY;IAC3B,OAAO,OAAO,OAAO,CAAC,GAAG,QAAQ,MAAM,CAAC;IACxC,WAAW,OAAO,OAAO,CAAC,GAAG,QAAQ,UAAU,CAAC;IAChD,iBAAiB,OAAO,OAAO,CAAC,GAAG,QAAQ,gBAAgB,CAAC;IAG5D,YAAY;IACZ,QAAQ;IAER,OAAO;IACP,WAAW;IACX,WAAW;IACZ;AACD,SAAM,MAAKJ,MAAO,WAAW,IAAI,KAAK;AACtC,QAAK,cAAc;IACjB,6BAA6B;IAC7B,2BAA2B,QAAQ,MAAM;IACzC,+BAA+B,QAAQ,UAAU;IAClD,CAAC;AACF,UAAO;IAEV;;;;;;;CAQH,MAAM,cACJ,OACA,KACA,OAAsB,EAAE,EACF;AACtB,SAAO,KAAK,OAAO,OAAO,uBAAuB,IAAI,EAAE,KAAK;;;CAI9D,MAAM,OAAO,OAAqB,QAAgB,QAAgC;AAChF,QAAM,eACJ,MAAKC,QACL,2BACA,OACA;GAAE,4BAA4B;GAAU,6BAA6B;GAAQ,EAC7E,YAAY;AACV,SAAM,MAAKD,MAAO,WAAW,OAAO,QAAQ,OAAO;IAEtD;;;CAIH,MAAM,KAAK,OAAmD;AAC5D,SAAO,eAAe,MAAKC,QAAS,0BAA0B,OAAO,EAAE,EAAE,OAAO,SAAS;GACvF,MAAM,MAAM,MAAM,MAAKD,MAAO,WAAW,KAAK,MAAM;AACpD,QAAK,cAAc,EAAE,gCAAgC,IAAI,QAAQ,CAAC;AAClE,UAAO;IACP;;;;;;;;;;;;;CAcJ,MAAM,SACJ,OACA,UAAiC,EAAE,EACL;AAE9B,UADc,MAAM,KAAK,KAAK,MAAM,EAEjC,QAAQ,SAAS,KAAK,WAAW,iBAAiB,iBAAiB,MAAM,QAAQ,CAAC,CAClF,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,SAAS;;;;;;;;;;;;;;;;;;CAmB5C,MAAM,OACJ,OACA,OACA,OAA0E,EAAE,EACnC;AACzC,SAAO,eACL,MAAKC,QACL,0BACA,OACA,EAAE,4BAA4B,UAAU,EACxC,OAAO,SAAS;GACd,MAAM,OAAO,KAAK,QAAQ;GAC1B,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,WAAW,YAAY;IACtC,MAAM,OAAO,MAAM,MAAM,OAAO,OAAO,OAAO;KAC5C;KACA,GAAI,KAAK,uBAAuB,OAAO,EAAE,oBAAoB,MAAM,GAAG,EAAE;KACzE,CAAC;AACF,SAAK,cAAc;KACjB,gCAAgC,KAAK;KACrC,yCAAyC;KAC1C,CAAC;AACF,WAAO;;GAKT,MAAM,SAAS,mBAAmB,MAAM;GAExC,MAAM,UADQ,MAAM,KAAK,KAAK,MAAM,EAEjC,QAAQ,SAAS,KAAK,uBAAuB,QAAQ,KAAK,WAAW,cAAc,CACnF,KAAK,SAAS;IACb,MAAM,WAAW,mBACf;KAAC,KAAK;KAAM,GAAI,KAAK,SAAS,EAAE;KAAG,GAAI,KAAK,QAAQ,EAAE;KAAE,CAAC,KAAK,IAAI,CACnE;AAED,WAAO;KAAE;KAAM,SADC,OAAO,QAAQ,MAAM,SAAS,SAAS,EAAE,CAAC,CAAC;KACnC;KACxB,CACD,QAAQ,UAAU,MAAM,UAAU,EAAE,CACpC,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,KAAK,KAAK,EAAE,KAAK,KAAK,KAAK,GAAG,CACzE,MAAM,GAAG,KAAK;AACjB,QAAK,cAAc;IACjB,gCAAgC,OAAO;IACvC,yCAAyC;IAC1C,CAAC;AACF,UAAO,OAAO,KAAK,WAAW;IAC5B,QAAQ,MAAM;IACd,OAAO,OAAO,WAAW,IAAI,IAAI,MAAM,UAAU,OAAO;IACxD,SAAS,EAAE,SAAS,MAAM,SAAS;IACpC,EAAE;IAEN;;;;;;;;;CAUH,MAAM,SACJ,OACA,QACA,QACA,SACe;AACf,QAAM,eACJ,MAAKC,QACL,2BACA,OACA;GAAE,4BAA4B;GAAY,6BAA6B;GAAQ,EAC/E,OAAO,SAAS;GACd,MAAM,QAAQ,MAAKD,MAAO;AAC1B,OAAI,OAAO,MAAM,cAAc,WAC7B,OAAM,IAAI,UACR,yPAED;GAEH,MAAM,QAAQ,SAAS,UAAU;GAEjC,MAAM,YAAY,MAAM,MAAM,KAAK,MAAM,EAAE,MAAM,SAAS,KAAK,OAAO,OAAO,IAAI;AACjF,OAAI,aAAa,QAAQ,CAAC,OAAO;IAC/B,MAAM,YAAY,sBAAsB,SAAS,KAAK;AACtD,QAAI,UAAU,SAAS;AACrB,UAAK,cAAc,EAAE,sCAAsC,MAAM,CAAC;AAClE,WAAM,IAAI,gCAAgC,QAAQ,UAAU,QAAQ;;;AAGxE,QAAK,cAAc,EAAE,qCAAqC,OAAO,CAAC;AAClE,SAAM,MAAM,UAAU,QAAQ,UAAU,QAAQ,MAAM;IAEzD;;;;AAKL,SAAS,oBAAoB,WAAqC;AAEhE,QADc,CAAC,UAAU,OAAO,GAAG,UAAU,MAAM,KAAK,MAAM,MAAM,GAAG,IAAI,EAAE,IAAI,OAAO,CAAC,CAC5E,KAAK,KAAK;;;AAIzB,SAAS,mBAAmB,MAAqC;AAC/D,QAAO,KACJ,aAAa,CACb,MAAM,kBAAkB,CACxB,QAAQ,UAAU,MAAM,SAAS,EAAE;;AAGxC,SAAS,iBAAiB,MAAY,SAAyC;AAC7E,KAAI,KAAK,cAAc,UAAa,KAAK,cAAc,SAAU,QAAO;AACxE,KAAI,KAAK,UAAU,WAAW,SAAS,EAAE;EACvC,MAAM,SAAS,KAAK,UAAU,MAAM,EAAgB,CAAC,MAAM;AAC3D,SAAO,QAAQ,UAAU;;AAE3B,KAAI,KAAK,UAAU,WAAW,OAAO,EAAE;EACrC,MAAM,SAAS,KAAK,UAAU,MAAM,EAAc,CAAC,MAAM;AACzD,UAAQ,QAAQ,QAAQ,EAAE,EAAE,SAAS,OAAO;;AAE9C,QAAO"}

package/dist/tiers/semantic-memory.d.ts

@@ -105,6 +105,20 @@ type FusionStrategy = {
  *
  * @stable
  */
+/**
+ * Search options an operator may default at construction time via
+ * `createMemory({ searchDefaults })` (W-086) - the advanced-retrieval
+ * switches (fan-out, HyDE, graph expansion, fusion, decay) that the
+ * model-facing surfaces (`fact_search`, auto-recall, `deep_recall`)
+ * cannot reach per-call. Deliberately a `Pick` that EXCLUDES the
+ * trust-sensitive predicates (`includeQuarantined`, `includeSuperseded`,
+ * `trustWeighting`, `owner`): configuration must not be able to silently
+ * weaken trust gates for every caller. Per-call options always win
+ * key-by-key.
+ *
+ * @stable
+ */
+type SemanticSearchDefaults = Pick<FactSearchOptions, 'multiQuery' | 'hyde' | 'expandHops' | 'entityMatch' | 'graphScoring' | 'fusion' | 'decay' | 'candidateTopK'>;
 interface FactSearchOptions {
   readonly topK?: number;
   readonly signal?: AbortSignal;
@@ -287,6 +301,14 @@ interface IterativeSearchOptions extends FactSearchOptions {
    * requests and tests.
    */
   readonly forceHard?: boolean;
+  /**
+   * Difficulty-gate threshold in `[0, 1]` for THIS call (W-088). The
+   * gate's signal lexicon is **English-only** - for non-English
+   * deployments lower the threshold or use {@link forceHard}. Omitted ⇒
+   * the facade default (`iterativeRetrieval.difficultyThreshold`) or the
+   * built-in `0.5`.
+   */
+  readonly difficultyThreshold?: number;
 }
 /**
  * Outcome of {@link SemanticMemory.searchIterative}. Beyond the ranked
@@ -407,12 +429,27 @@ declare class SemanticMemory {
     grader?: RetrievalGrader;
     /** Default total-pass cap for `searchIterative`. Default 3. */
     iterativeMaxIterations?: number;
+    /**
+     * Default difficulty-gate threshold for `searchIterative` (W-088).
+     * Omitted ⇒ the gate's built-in `0.5`. Per-call
+     * `difficultyThreshold` overrides it.
+     */
+    iterativeDifficultyThreshold?: number;
     /**
      * Weights for the rank-time trust discount (C5). Reuses the
      * eviction-path `SalienceWeights` semantics; defaults to
      * `DEFAULT_SALIENCE_WEIGHTS`.
      */
     trustWeights?: SalienceWeights;
+    /**
+     * Construction-time retrieval defaults (W-086) merged under every
+     * `search(...)` call - see {@link SemanticSearchDefaults}. Because
+     * the merge happens inside `search()`, the model-facing surfaces
+     * (`fact_search`, auto-recall, `deep_recall`) inherit them without
+     * any per-surface wiring; per-call options override key-by-key (so
+     * e.g. `deep_recall`'s widen-pass `expandHops` still wins).
+     */
+    searchDefaults?: SemanticSearchDefaults;
   });
   /** Replace the active reranker. Returns the previous instance. */
   setReranker(reranker: ReRanker): ReRanker;
@@ -435,7 +472,7 @@ declare class SemanticMemory {
    */
   rememberWithDecision(scope: SessionScope, input: FactInput, options?: FactRememberOptions): Promise<RememberOutcome>;
   /** Hybrid (vector + FTS5) search merged through the configured reranker. */
-  search(scope: SessionScope, query: string, opts?: FactSearchOptions): Promise<ReadonlyArray<MemoryHit<Fact>>>;
+  search(scope: SessionScope, query: string, callOpts?: FactSearchOptions): Promise<ReadonlyArray<MemoryHit<Fact>>>;
   /**
    * Gated, iterative ("deep") recall for hard queries (P2-4). A cheap
    * local heuristic ({@link assessQueryDifficulty}) decides whether the
@@ -507,8 +544,25 @@ declare class SemanticMemory {
   validate(scope: SessionScope, factId: string, reason?: string, options?: {
     readonly force?: boolean;
   }): Promise<void>;
-  /** Mark `oldId` superseded by a new fact. Returns the new record. */
-  supersede(scope: SessionScope, oldId: string, newInput: FactInput, reason?: string): Promise<{
+  /**
+   * Mark `oldId` superseded by a new fact. Returns the new record.
+   *
+   * W-019 (security-first, knowledge-preserving): when the successor
+   * lands QUARANTINED (the default for `extraction`/synthesized
+   * provenance), the old ACTIVE fact's validity interval is NOT closed
+   * - default recall keeps returning the old knowledge until the
+   * successor passes {@link validate}, which completes the closure.
+   * The link is recorded on the successor's `supersedes` field. With
+   * `autoPromoteSynthesized` (threaded from the consolidator's
+   * `autoPromoteExtraction` escape hatch) an injection-clean successor
+   * is active immediately and the interval closes right away - the
+   * pre-W-019 behaviour. Inverting the default (auto-activating the
+   * successor) would hand a MINJA attacker instant active memory via
+   * any text the reconciler classifies as an 'update'.
+   */
+  supersede(scope: SessionScope, oldId: string, newInput: FactInput, reason?: string, options?: {
+    readonly autoPromoteSynthesized?: boolean;
+  }): Promise<{
     readonly old: string;
     readonly new: Fact;
   }>;
@@ -538,5 +592,5 @@ declare class SemanticMemory {
   static fuseWeighted<TRecord extends Fact>(lists: ReadonlyArray<ReadonlyArray<MemoryHit<TRecord>>>, weights: ReadonlyArray<number> | undefined, k?: number): ReadonlyArray<MemoryHit<TRecord>>;
 }
 //#endregion
-export { FactInput, FactRememberOptions, FactSearchOptions, FusionStrategy, FusionWeights, IterativeRecallResult, IterativeSearchOptions, RememberOutcome, SemanticMemory };
+export { FactInput, FactRememberOptions, FactSearchOptions, FusionStrategy, FusionWeights, IterativeRecallResult, IterativeSearchOptions, RememberOutcome, SemanticMemory, SemanticSearchDefaults };
 //# sourceMappingURL=semantic-memory.d.ts.map

package/dist/tiers/semantic-memory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"semantic-memory.d.ts","names":[],"sources":["../../src/tiers/semantic-memory.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;;;;;;AA0CA;;;;;AAmC8B,UAnCb,SAAA,CAmCa;EAYb,SAAA,IAAA,EAAA,MAAa;EA6BlB,SAAA,OAAA,CAAc,EAAA,MAAA;EAcT,SAAA,SAAA,CAAA,EAAiB,MAAA;EAEd,SAAA,MAAA,CAAA,EAAA,MAAA;EAUF,SAAA,IAAA,CAAA,EAjGA,aAiGA,CAAA,MAAA,CAAA;EAmGE,SAAA,UAAA,CAAA,EAAA,MAAA;EAgDD,SAAA,WAAA,CAAA,EAlPM,WAkPN;EAA4B,SAAA,SAAA,CAAA,EAAA,MAAA;EAAd,SAAA,OAAA,CAAA,EAAA,MAAA;EAAa,SAAA,UAAA,CAAA,EAAA,MAAA;EAW7B;AAuBjB;;;;;AAWA;EAiCiB,SAAA,UAAe,CAAA,EArTR,gBAuTH;EAwBR;;;;;;;;;EA6DM,SAAA,UAAA,CAAA,EAAA,MAAA;EAiBK;;;;;;EAsBX,SAAA,KAAA,CAAA,EAlaM,WAkaN;;;;;;;;;;;AAqOA,UA3nBI,aAAA,CA2nBJ;EAAR;EAgOM,SAAA,GAAA,CAAA,EAAA,MAAA;EAED;EACG,SAAA,MAAA,CAAA,EAAA,MAAA;EAAR;;;;;;EAyEc,SAAA,KAAA,CAAA,EAAA,MAAA;EAAuC;EAAR,SAAA,MAAA,CAAA,EAAA,MAAA;;;;;;;;;;;;;;;AAmLD,KA7jCrC,cAAA,GA6jCqC;EAAV,SAAA,QAAA,EAAA,KAAA;CAAd,GAAA;EAAd,SAAA,QAAA,EAAA,UAAA;EAC4B,SAAA,OAAA,EA1jCf,aA0jCe;EACF;EAAV,SAAA,CAAA,CAAA,EAAA,MAAA;CAAd;;;;;;AAMF,UAvjCM,iBAAA,CAujCN;EAEkB,SAAA,IAAA,CAAA,EAAA,MAAA;EAAV,SAAA,MAAA,CAAA,EAvjCC,WAujCD;EAAd;EAUiC,SAAA,aAAA,CAAA,EAAA,MAAA;EACW;;;;;;;EAG5C,SAAA,IAAA,CAAA,EA3jCa,aA2jCb,CAAA,MAAA,CAAA;EAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;oBAx9BE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mBAgDD,cAAc,cAAc;;;;;;;;;;UAW9B,sBAAA,SAA+B;;;;;;;;;;;;;;;;;;;;;;KAuBpC,qBAAA,GAAwB,yBAAyB,UAAU;;;;;;;;;;UAWtD,mBAAA;;;oBAGG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UA8BH,eAAA;iBACA;qBACI;;;;;;;;;;;;;;;;;;;;;;;cAwBR,cAAA;;;WAeF;YACC;cACE;;cAEA;uBACS;;;;;;;;uBAQA;;;;;;;;;;;;;;;;;qBAiBF;;;;;;;;aAQR;;;;;;;;mBAQM;;;wBAiBK,WAAW;;cAOrB;;;;;;;;kBAYH,qBACA,qBACE,sBACR,QAAQ;;;;;;;;8BAaF,qBACA,qBACE,sBACR,QAAQ;;gBAkNF,oCAED,oBACL,QAAQ,cAAc,UAAU;;;;;;;;;;;;;;;;;;;;yBAgO1B,oCAED,yBACL,QAAQ;;;;;;;;;;;;;mBAiEF;;MAGN,QAAQ,cAAc,UAAU;;aAKlB,+BAA+B,QAAQ;;;;;;;;;;;iBA8BnC,+BAA+B,QAAQ,cAAc;;;;;;;;;;;;;;;;;;;;;kBAyCjE;;MAIN;;mBAoCM,uCAEG,6BAET;;kBAA8C;;;gBAwB7B,gDAAgD;;;;;;;;eAmBjD,gDAAgD;;6BAqB1D,cAAc,cAAc,UAAU;;aACV;MAClC,QAAQ,cAAc,UAAU;;iCAKJ,aACtB,cAAc,cAAc,UAAU,yBAE5C,cAAc,UAAU;;;;;;;sCAUS,aAC3B,cAAc,cAAc,UAAU,qBACpC,gDAER,cAAc,UAAU"}
+{"version":3,"file":"semantic-memory.d.ts","names":[],"sources":["../../src/tiers/semantic-memory.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;;;;;;AA0CA;;;;;AAmC8B,UAnCb,SAAA,CAmCa;EAYb,SAAA,IAAA,EAAA,MAAa;EA6BlB,SAAA,OAAA,CAAc,EAAA,MAAA;EA2Bd,SAAA,SAAA,CAAA,EAAA,MAAsB;EAYjB,SAAA,MAAA,CAAA,EAAA,MAAiB;EAEd,SAAA,IAAA,CAAA,EAhHF,aAgHE,CAAA,MAAA,CAAA;EAUF,SAAA,UAAA,CAAA,EAAA,MAAA;EAmGE,SAAA,WAAA,CAAA,EA3NK,WA2NL;EAgDD,SAAA,SAAA,CAAA,EAAA,MAAA;EAA4B,SAAA,OAAA,CAAA,EAAA,MAAA;EAAd,SAAA,UAAA,CAAA,EAAA,MAAA;EAAa;AAW9C;AA+BA;;;;;EAWiB,SAAA,UAAA,CAAA,EArTO,gBAwTJ;EA8BH;AA0BjB;;;;;;;;EAuDa,SAAA,UAAA,CAAA,EAAA,MAAA;EAcM;;;;;;EAgDR,SAAA,KAAA,CAAA,EApdQ,WAodR;;;;;;;;;;;AAuO0B,UA/qBpB,aAAA,CA+qBoB;EAAV;EAAd,SAAA,GAAA,CAAA,EAAA,MAAA;EAAR;EAyQM,SAAA,MAAA,CAAA,EAAA,MAAA;EAED;;;;;;EA6EG,SAAA,KAAA,CAAA,EAAA,MAAA;EAAR;EAKc,SAAA,MAAA,CAAA,EAAA,MAAA;;;;;;;;;;;;;;;AA2ME,KA1rCT,cAAA,GA0rCS;EAAgD,SAAA,QAAA,EAAA,KAAA;CAqBpB,GAAA;EAAV,SAAA,QAAA,EAAA,UAAA;EAAd,SAAA,OAAA,EA3sCD,aA2sCC;EAAd;EAC4B,SAAA,CAAA,CAAA,EAAA,MAAA;CACF;;;;;;;;;;;;;;;;;;;AAsBlB,KA5sCP,sBAAA,GAAyB,IA4sClB,CA3sCjB,iBA2sCiB,EAAA,YAAA,GAAA,MAAA,GAAA,YAAA,GAAA,aAAA,GAAA,cAAA,GAAA,QAAA,GAAA,OAAA,GAAA,eAAA,CAAA;AAAd,UAhsCY,iBAAA,CAgsCZ;EAAa,SAAA,IAAA,CAAA,EAAA,MAAA;oBA9rCE;;;;;;;;;;kBAUF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;oBAmGE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mBAgDD,cAAc,cAAc;;;;;;;;;;UAW9B,sBAAA,SAA+B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA+BpC,qBAAA,GAAwB,yBAAyB,UAAU;;;;;;;;;;UAWtD,mBAAA;;;oBAGG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UA8BH,eAAA;iBACA;qBACI;;;;;;;;;;;;;;;;;;;;;;;cAwBR,cAAA;;;WAiBF;YACC;cACE;;cAEA;uBACS;;;;;;;;uBAQA;;;;;;;;;;;;;;;;;qBAiBF;;;;;;;;aAQR;;;;;;;;;;;;;;mBAcM;;;;;;;;;qBASE;;;wBAmBG,WAAW;;cAOrB;;;;;;;;kBAYH,qBACA,qBACE,sBACR,QAAQ;;;;;;;;8BAaF,qBACA,qBACE,sBACR,QAAQ;;gBAkNF,wCAEG,oBACT,QAAQ,cAAc,UAAU;;;;;;;;;;;;;;;;;;;;yBAyQ1B,oCAED,yBACL,QAAQ;;;;;;;;;;;;;mBAyEF;;MAGN,QAAQ,cAAc,UAAU;;aAKlB,+BAA+B,QAAQ;;;;;;;;;;;iBA8BnC,+BAA+B,QAAQ,cAAc;;;;;;;;;;;;;;;;;;;;;kBAyCjE;;MAIN;;;;;;;;;;;;;;;;;mBAsEM,uCAEG;;MAGT;;kBAA8C;;;gBAkC7B,gDAAgD;;;;;;;;eAmBjD,gDAAgD;;6BAqB1D,cAAc,cAAc,UAAU;;aACV;MAClC,QAAQ,cAAc,UAAU;;iCAKJ,aACtB,cAAc,cAAc,UAAU,yBAE5C,cAAc,UAAU;;;;;;;sCAUS,aAC3B,cAAc,cAAc,UAAU,qBACpC,gDAER,cAAc,UAAU"}