@remnic/core 9.25.6 → 9.26.0

package/dist/chunk-P25IPRXP.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/access-schema.ts"],"sourcesContent":["// Request/response schema validation for the Remnic HTTP API.\n// Uses zod for runtime validation — returns structured 400 errors with\n// field-level detail so consumers get clear feedback on malformed requests.\n\nimport { z } from \"zod\";\nimport {\n  ACTION_CONFIDENCE_CONTEXT_READINESS,\n  ACTION_CONFIDENCE_RISK_CATEGORIES,\n  ACTION_CONFIDENCE_RULE_KINDS,\n} from \"./action-confidence.js\";\nimport { isValidCapsuleSince } from \"./transfer/capsule-export.js\";\nimport { validateArchiveRelativePath } from \"./transfer/fs-utils.js\";\nimport { CAPSULE_ID_PATTERN } from \"./transfer/types.js\";\nimport {\n  OFFLINE_SYNC_FILE_CONTENT_MAX_CHUNK_BYTES,\n  OFFLINE_SYNC_MAX_MTIME_MS,\n} from \"./offline-sync.js\";\n\n// ---------------------------------------------------------------------------\n// Error formatting\n// ---------------------------------------------------------------------------\n\nexport interface SchemaValidationError {\n  error: string;\n  code: \"validation_error\";\n  details: Array<{ field: string; message: string }>;\n}\n\nexport function formatZodError(error: z.ZodError): SchemaValidationError {\n  return {\n    error: \"request validation failed\",\n    code: \"validation_error\",\n    details: error.issues.map((issue) => ({\n      field: issue.path.join(\".\") || \"(root)\",\n      message: issue.message,\n    })),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Shared fields\n// ---------------------------------------------------------------------------\n\nconst namespaceSchema = z.string().trim().max(256).optional();\nconst sessionKeySchema = z.string().trim().min(1).max(512).optional();\nconst idempotencyKeySchema = z.string().trim().min(1).max(256).optional();\nconst dryRunSchema = z.boolean().optional();\nconst schemaVersionSchema = z.number().int().optional();\nconst timeZoneSchema = z\n  .string()\n  .trim()\n  .min(1)\n  .max(128)\n  .refine((value) => {\n    try {\n      Intl.DateTimeFormat(undefined, { timeZone: value });\n      return true;\n    } catch {\n      return false;\n    }\n  }, \"must be a valid IANA timezone\");\n\n// ---------------------------------------------------------------------------\n// Recall\n// ---------------------------------------------------------------------------\n\n/**\n * Coding-agent context (issue #569). Optional payload that connectors may\n * ship with a recall request so the project/branch namespace overlay\n * applies to that recall. All fields are validated per CLAUDE.md #51 —\n * empty-string projectId / rootPath is rejected, not silently accepted.\n */\nexport const codingContextSchema = z\n  .object({\n    projectId: z.string().trim().min(1, \"codingContext.projectId is required\").max(128),\n    branch: z.string().trim().max(256).nullable(),\n    rootPath: z.string().trim().min(1, \"codingContext.rootPath is required\").max(1024),\n    defaultBranch: z.string().trim().max(256).nullable(),\n  })\n  .nullable();\n\n/**\n * Recall disclosure depth (issue #677).  Mirrors the `RecallDisclosure`\n * type in `types.ts` — keep these in sync.  Default-application happens\n * inside `EngramAccessService.recall()`; the schema only accepts/rejects.\n * Invalid values throw a structured 400 instead of silently defaulting,\n * per CLAUDE.md rule 51.\n */\nexport const recallDisclosureSchema = z.enum([\"chunk\", \"section\", \"raw\"]);\n\n/**\n * Tag-match semantics (issue #689). `any` (default when `tags` is provided\n * and `tagMatch` is omitted) admits a result when it carries at least one\n * of the filter tags. `all` requires every filter tag to be present.\n * Schema rejects unknown values up front — never silently defaults\n * (CLAUDE.md rule 51).\n */\nexport const tagMatchSchema = z.enum([\"any\", \"all\"]);\n\nexport const recallRequestSchema = z.object({\n  query: z.string().min(1, \"query is required\"),\n  sessionKey: sessionKeySchema,\n  namespace: namespaceSchema,\n  topK: z.number().int().min(0).max(200).optional(),\n  mode: z.enum([\"auto\", \"no_recall\", \"minimal\", \"full\", \"graph_mode\"]).optional(),\n  includeDebug: z.boolean().optional(),\n  idempotencyKey: idempotencyKeySchema,\n  disclosure: recallDisclosureSchema.optional(),\n  codingContext: codingContextSchema.optional(),\n  /** Working directory for auto git-context resolution (issue #569). */\n  cwd: z.string().trim().min(1, \"cwd must be non-empty when provided\").max(2048).optional(),\n  /**\n   * Arbitrary project tag for non-git-based project scoping (issue #569).\n   * Creates a coding context with `projectId: \"tag:<projectTag>\"`.\n   */\n  projectTag: z.string().trim().min(1, \"projectTag must be non-empty when provided\").max(256).optional(),\n  /**\n   * Historical recall pin (issue #680).  ISO 8601 timestamp.  The\n   * schema only enforces the basic shape; the access service runs\n   * `Date.parse` and emits a structured 400 on malformed input\n   * (CLAUDE.md rule 51).\n   */\n  asOf: z.string().trim().min(1, \"asOf must be a non-empty ISO 8601 timestamp\").max(64).optional(),\n  /**\n   * Free-form recall tag filter (issue #689). When provided, recall results\n   * whose frontmatter `tags` do not match the filter are removed before the\n   * response is returned. Comparison is case-sensitive exact match.\n   */\n  tags: z.array(z.string().trim().min(1).max(256)).max(50).optional(),\n  /**\n   * Match mode for `tags` (issue #689). Defaults to `\"any\"` when `tags` is\n   * provided and `tagMatch` is omitted. Ignored when `tags` is absent.\n   */\n  tagMatch: tagMatchSchema.optional(),\n  /**\n   * Include graph edges below `graphTraversalConfidenceFloor` for diagnostic\n   * recall traversal (issue #681). Defaults to false.\n   */\n  includeLowConfidence: z.boolean().optional(),\n});\n\nexport const recallExplainRequestSchema = z.object({\n  sessionKey: sessionKeySchema,\n  namespace: namespaceSchema,\n});\n\n/**\n * Standalone \"set coding context\" request. Used by the HTTP endpoint\n * `POST /engram/v1/coding-context` and the MCP `remnic.set_coding_context`\n * tool (PR 7). `codingContext: null` clears the attached context.\n */\nexport const setCodingContextRequestSchema = z\n  .object({\n    sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n    codingContext: codingContextSchema.optional(),\n    /**\n     * Project tag shorthand for non-git-based project scoping. When\n     * `codingContext` is omitted, this becomes\n     * `{ projectId: \"tag:<projectTag>\", branch: null, rootPath: \"tag:<projectTag>\", defaultBranch: null }`.\n     */\n    projectTag: z.string().trim().min(1, \"projectTag must be non-empty when provided\").max(256).optional(),\n  })\n  .superRefine((value, ctx) => {\n    if (value.codingContext === undefined && value.projectTag === undefined) {\n      ctx.addIssue({\n        code: z.ZodIssueCode.custom,\n        message: \"codingContext or projectTag is required\",\n        path: [\"codingContext\"],\n      });\n    }\n  });\n\n// ---------------------------------------------------------------------------\n// Observe\n// ---------------------------------------------------------------------------\n\nconst messageSchema = z.object({\n  role: z.enum([\"user\", \"assistant\"]),\n  content: z.string().min(1, \"message content must be non-empty\"),\n  sourceFormat: z\n    .enum([\"openai\", \"anthropic\", \"openclaw\", \"pi\", \"lossless-claw\", \"remnic\"])\n    .nullable()\n    .optional(),\n  rawContent: z.unknown().nullable().optional(),\n  parts: z\n    .array(\n      z.object({\n        ordinal: z.number().int().min(0).nullable().optional(),\n        kind: z.enum([\n          \"text\",\n          \"tool_call\",\n          \"tool_result\",\n          \"patch\",\n          \"file_read\",\n          \"file_write\",\n          \"step_start\",\n          \"step_finish\",\n          \"snapshot\",\n          \"retry\",\n        ]),\n        payload: z.record(z.string(), z.unknown()),\n        toolName: z.string().nullable().optional(),\n        tool_name: z.string().nullable().optional(),\n        filePath: z.string().nullable().optional(),\n        file_path: z.string().nullable().optional(),\n        createdAt: z.string().nullable().optional(),\n        created_at: z.string().nullable().optional(),\n      }),\n    )\n    .nullable()\n    .optional(),\n});\n\nexport const observeRequestSchema = z.object({\n  sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n  messages: z.array(messageSchema).min(1, \"messages must be a non-empty array\"),\n  namespace: namespaceSchema,\n  skipExtraction: z.boolean().optional(),\n  /**\n   * Optional idempotency key for server-side dedup of retried observe POSTs\n   * (issue #1649). A retry that reaches the daemon after the first attempt\n   * already processed is replayed from cache instead of re-ingested. When the\n   * key is reused with a DIFFERENT payload the request is rejected as a\n   * conflict (same contract as memory_store/suggestion_submit).\n   */\n  idempotencyKey: idempotencyKeySchema,\n  /** Working directory for auto git-context resolution (issue #569). */\n  cwd: z.string().trim().min(1, \"cwd must be non-empty when provided\").max(2048).optional(),\n  /**\n   * Arbitrary project tag for non-git-based project scoping (issue #569).\n   * Creates a coding context with `projectId: \"tag:<projectTag>\"`.\n   */\n  projectTag: z.string().trim().min(1, \"projectTag must be non-empty when provided\").max(256).optional(),\n});\n\n// ---------------------------------------------------------------------------\n// Memory store / suggestion submit\n// ---------------------------------------------------------------------------\n\nconst writeContentSchema = z.string().min(1, \"content is required\").max(50000);\nconst categorySchema = z\n  .enum([\n    \"fact\", \"preference\", \"correction\", \"entity\", \"decision\",\n    \"relationship\", \"principle\", \"commitment\", \"moment\", \"skill\", \"rule\", \"procedure\",\n    \"reasoning_trace\",\n  ])\n  .optional();\nconst confidenceSchema = z.number().min(0).max(1).optional();\nconst tagsSchema = z.array(z.string().max(256)).max(50).optional();\nconst entityRefSchema = z.string().trim().max(512).optional();\nconst ttlSchema = z.string().trim().max(128).optional();\nconst sourceReasonSchema = z.string().trim().max(2000).optional();\n\nexport const memoryStoreRequestSchema = z.object({\n  schemaVersion: schemaVersionSchema,\n  idempotencyKey: idempotencyKeySchema,\n  dryRun: dryRunSchema,\n  sessionKey: sessionKeySchema,\n  content: writeContentSchema,\n  category: categorySchema,\n  confidence: confidenceSchema,\n  namespace: namespaceSchema,\n  tags: tagsSchema,\n  entityRef: entityRefSchema,\n  ttl: ttlSchema,\n  sourceReason: sourceReasonSchema,\n  // Git/project context for project-scoped writes (#1434). When no explicit\n  // `namespace` is given, these route the write to the same project namespace\n  // recall/observe resolve from `cwd`/`projectTag` (issue #569, rule 42). Also\n  // lets MCP clients that auto-inject `cwd` (e.g. Pi MCPorter) call write tools.\n  cwd: z.string().trim().min(1, \"cwd must be non-empty when provided\").max(2048).optional(),\n  projectTag: z\n    .string()\n    .trim()\n    .min(1, \"projectTag must be non-empty when provided\")\n    .max(256)\n    .optional(),\n});\n\nexport const suggestionSubmitRequestSchema = memoryStoreRequestSchema;\n\n// ---------------------------------------------------------------------------\n// Review disposition\n// ---------------------------------------------------------------------------\n\nexport const reviewDispositionRequestSchema = z.object({\n  memoryId: z.string().trim().min(1, \"memoryId is required\"),\n  status: z.enum([\n    \"active\", \"pending_review\", \"quarantined\", \"rejected\", \"superseded\", \"archived\",\n  ]),\n  reasonCode: z.string().trim().min(1, \"reasonCode is required\"),\n  namespace: namespaceSchema,\n});\n\n// ---------------------------------------------------------------------------\n// Trust-zone promote\n// ---------------------------------------------------------------------------\n\nexport const trustZonePromoteRequestSchema = z.object({\n  recordId: z.string().trim().min(1, \"recordId is required\"),\n  targetZone: z.enum([\"working\", \"trusted\"], {\n    errorMap: () => ({ message: \"targetZone must be 'working' or 'trusted'\" }),\n  }),\n  promotionReason: z.string().trim().min(1, \"promotionReason is required\"),\n  recordedAt: z.string().trim().optional(),\n  summary: z.string().trim().max(5000).optional(),\n  dryRun: dryRunSchema,\n  namespace: namespaceSchema,\n});\n\n// ---------------------------------------------------------------------------\n// Trust-zone demo-seed\n// ---------------------------------------------------------------------------\n\nexport const trustZoneDemoSeedRequestSchema = z.object({\n  scenario: z.string().trim().max(256).optional(),\n  recordedAt: z.string().trim().optional(),\n  dryRun: dryRunSchema,\n  namespace: namespaceSchema,\n});\n\n// ---------------------------------------------------------------------------\n// LCM search\n// ---------------------------------------------------------------------------\n\nexport const lcmSearchRequestSchema = z.object({\n  query: z.string().min(1, \"query is required\"),\n  sessionKey: sessionKeySchema,\n  sessionPrefix: z.string().trim().min(1).max(512).optional(),\n  namespace: namespaceSchema,\n  limit: z.number().int().min(1).max(100).optional(),\n});\n\nexport const lcmCompactionFlushRequestSchema = z.object({\n  sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n  namespace: namespaceSchema,\n});\n\nexport const lcmCompactionRecordRequestSchema = z.object({\n  sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n  namespace: namespaceSchema,\n  tokensBefore: z.number().int().min(0, \"tokensBefore must be a non-negative integer\"),\n  tokensAfter: z.number().int().min(0, \"tokensAfter must be a non-negative integer\"),\n});\n\n// ---------------------------------------------------------------------------\n// Day summary\n// ---------------------------------------------------------------------------\n\nexport const daySummaryRequestSchema = z.object({\n  memories: z.string().max(100000).optional(),\n  sessionKey: sessionKeySchema,\n  namespace: namespaceSchema,\n  timeZone: timeZoneSchema.optional(),\n});\n\n// ---------------------------------------------------------------------------\n// Capsule export\n// ---------------------------------------------------------------------------\n\nconst capsuleTopLevelSegmentSchema = z\n  .string()\n  .trim()\n  .min(1)\n  .max(128)\n  .refine(\n    (value) => !value.includes(\"/\") && !value.includes(\"\\\\\"),\n    \"must be a top-level directory name without path separators\",\n  );\n\nconst capsulePeerIdSchema = z\n  .string()\n  .trim()\n  .min(1)\n  .max(256)\n  .refine(\n    (value) => value !== \".\" && value !== \"..\" && !value.includes(\"/\") && !value.includes(\"\\\\\"),\n    \"must be a plain peer id without path separators\",\n  );\n\nconst capsuleIsoSinceSchema = z\n  .string()\n  .trim()\n  .min(1, \"since must be a non-empty ISO 8601 timestamp\")\n  .max(128)\n  .refine(\n    isValidCapsuleSince,\n    \"since must be a valid ISO 8601 timestamp with no calendar overflow\",\n  );\n\nexport const capsuleExportRequestSchema = z\n  .object({\n    name: z\n      .string()\n      .trim()\n      .min(1, \"name is required\")\n      .max(64, \"name must be 64 characters or fewer\")\n      .regex(\n        CAPSULE_ID_PATTERN,\n        \"name must be alphanumeric with single dashes (no spaces, no leading/trailing dashes)\",\n      ),\n    namespace: namespaceSchema,\n    since: capsuleIsoSinceSchema.optional(),\n    includeKinds: z.array(capsuleTopLevelSegmentSchema).max(50).optional(),\n    peerIds: z.array(capsulePeerIdSchema).max(100).optional(),\n    includeTranscripts: z.boolean().optional(),\n    encrypt: z.boolean().optional(),\n  });\n\nexport const capsuleImportRequestSchema = z\n  .object({\n    archivePath: z.string().trim().min(1, \"archivePath is required\").max(4096),\n    namespace: namespaceSchema,\n    mode: z.enum([\"skip\", \"overwrite\", \"fork\"]).optional(),\n    passphrase: z.string().min(1, \"passphrase must not be empty\").max(4096).optional(),\n  });\n\nexport const capsuleListRequestSchema = z\n  .object({\n    namespace: namespaceSchema,\n    sessionKey: sessionKeySchema,\n  });\n\n// ---------------------------------------------------------------------------\n// Offline sync\n// ---------------------------------------------------------------------------\n\nfunction isValidOfflineSyncPath(value: string): boolean {\n  try {\n    validateArchiveRelativePath(value, \"path\");\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nconst offlineSyncPathSchema = z\n  .string()\n  .trim()\n  .min(1, \"path must be non-empty\")\n  .max(4096)\n  .refine(\n    isValidOfflineSyncPath,\n    \"path must be a POSIX relative path without unsafe segments\",\n  );\n\nconst offlineSyncFileStateSchema = z.object({\n  path: offlineSyncPathSchema,\n  sha256: z.string().regex(/^[a-f0-9]{64}$/i, \"sha256 must be a 64-character hex digest\"),\n  bytes: z.number().int().min(0),\n  mtimeMs: z.number().finite().min(0).max(OFFLINE_SYNC_MAX_MTIME_MS),\n});\n\nconst offlineSyncBaseCapturedAtSchema = z\n  .string()\n  .trim()\n  .min(1, \"baseCapturedAt must be non-empty when provided\")\n  .max(64)\n  .refine((value) => Number.isFinite(Date.parse(value)), {\n    message: \"baseCapturedAt must be a valid ISO 8601 timestamp\",\n  });\n\nexport const offlineSyncSnapshotRequestSchema = z.object({\n  namespace: namespaceSchema,\n  includeTranscripts: z.boolean().optional(),\n  includeContent: z.boolean().optional(),\n  baseCapturedAt: offlineSyncBaseCapturedAtSchema.optional(),\n  baseFiles: z\n    .array(offlineSyncFileStateSchema)\n    .max(300_000, \"baseFiles must contain 300000 or fewer entries\")\n    .optional(),\n});\n\nexport const offlineSyncApplyRequestSchema = z\n  .object({\n    namespace: namespaceSchema,\n    changeset: z.unknown(),\n    returnCurrentFiles: z.boolean().optional(),\n  })\n  .refine((value) => value.changeset !== undefined && value.changeset !== null, {\n    message: \"changeset is required\",\n    path: [\"changeset\"],\n  });\n\nexport const offlineSyncFilesRequestSchema = z.object({\n  namespace: namespaceSchema,\n  includeTranscripts: z.boolean().optional(),\n  paths: z\n    .array(offlineSyncPathSchema)\n    .max(5000, \"paths must contain 5000 or fewer entries\"),\n});\n\nexport const offlineSyncFileContentRequestSchema = z.object({\n  namespace: namespaceSchema,\n  includeTranscripts: z.boolean().optional(),\n  path: offlineSyncPathSchema,\n  offset: z.number().int().min(0).optional(),\n  length: z.number().int().min(1).max(OFFLINE_SYNC_FILE_CONTENT_MAX_CHUNK_BYTES).optional(),\n});\n\n// ---------------------------------------------------------------------------\n// Action confidence\n// ---------------------------------------------------------------------------\n\nconst nullableOptional = <T extends z.ZodTypeAny>(schema: T) =>\n  schema.optional().nullable().transform((value) => value ?? undefined);\n\nconst actionConfidenceRuleSchema = z\n  .object({\n    kind: z.enum(ACTION_CONFIDENCE_RULE_KINDS),\n    description: nullableOptional(z.string().trim().min(1).max(2000)),\n    matched: nullableOptional(z.boolean()),\n  })\n  .strict();\n\nconst actionConfidenceMemorySchema = z\n  .object({\n    source: nullableOptional(z.string().trim().min(1).max(256)),\n    created: nullableOptional(z.string().trim().min(1).max(128)),\n    updated: nullableOptional(z.string().trim().min(1).max(128)),\n    scope: nullableOptional(z.string().trim().min(1).max(512)),\n    userContextScopes: nullableOptional(z.array(z.string().trim().min(1).max(128)).max(50)),\n    retrievalReason: nullableOptional(z.string().trim().min(1).max(2000)),\n    confidence: nullableOptional(z.number().min(0).max(1)),\n    stale: nullableOptional(z.boolean()),\n    corrected: nullableOptional(z.boolean()),\n    correctionState: nullableOptional(z.enum([\"none\", \"correction\", \"superseded\", \"disputed\", \"forgotten\"])),\n    safeToUse: nullableOptional(z.boolean()),\n    safety: nullableOptional(z.enum([\"safe\", \"requires-review\", \"blocked\"])),\n    safetyReasons: nullableOptional(z.array(z.string().trim().min(1).max(1000)).max(50)),\n  })\n  .strict();\n\nexport const actionConfidenceRequestSchema = z\n  .object({\n    intendedAction: nullableOptional(z.string().trim().min(1).max(1000)),\n    confidence: nullableOptional(z.number().min(0).max(1)),\n    risk: nullableOptional(z.enum(ACTION_CONFIDENCE_RISK_CATEGORIES)),\n    contextReadiness: nullableOptional(z.enum(ACTION_CONFIDENCE_CONTEXT_READINESS)),\n    currentContextScopes: nullableOptional(z.array(z.string().trim().min(1).max(128)).max(50)),\n    userRules: nullableOptional(z.array(actionConfidenceRuleSchema).max(100)),\n    retrievedMemories: nullableOptional(z.array(actionConfidenceMemorySchema).max(200)),\n  })\n  .strict();\n\n// ---------------------------------------------------------------------------\n// Inferred types\n// ---------------------------------------------------------------------------\n\nexport type RecallRequest = z.infer<typeof recallRequestSchema>;\nexport type RecallExplainRequest = z.infer<typeof recallExplainRequestSchema>;\nexport type SetCodingContextRequest = z.infer<typeof setCodingContextRequestSchema>;\nexport type ObserveRequest = z.infer<typeof observeRequestSchema>;\nexport type MemoryStoreRequest = z.infer<typeof memoryStoreRequestSchema>;\nexport type SuggestionSubmitRequest = z.infer<typeof suggestionSubmitRequestSchema>;\nexport type ReviewDispositionRequest = z.infer<typeof reviewDispositionRequestSchema>;\nexport type TrustZonePromoteRequest = z.infer<typeof trustZonePromoteRequestSchema>;\nexport type TrustZoneDemoSeedRequest = z.infer<typeof trustZoneDemoSeedRequestSchema>;\nexport type LcmSearchRequest = z.infer<typeof lcmSearchRequestSchema>;\nexport type LcmCompactionFlushRequest = z.infer<typeof lcmCompactionFlushRequestSchema>;\nexport type LcmCompactionRecordRequest = z.infer<typeof lcmCompactionRecordRequestSchema>;\nexport type DaySummaryRequest = z.infer<typeof daySummaryRequestSchema>;\nexport type CapsuleExportRequest = z.infer<typeof capsuleExportRequestSchema>;\nexport type CapsuleImportRequest = z.infer<typeof capsuleImportRequestSchema>;\nexport type CapsuleListRequest = z.infer<typeof capsuleListRequestSchema>;\nexport type OfflineSyncApplyRequest = z.infer<typeof offlineSyncApplyRequestSchema>;\nexport type OfflineSyncSnapshotRequest = z.infer<typeof offlineSyncSnapshotRequestSchema>;\nexport type OfflineSyncFilesRequest = z.infer<typeof offlineSyncFilesRequestSchema>;\nexport type OfflineSyncFileContentRequest = z.infer<typeof offlineSyncFileContentRequestSchema>;\nexport type ActionConfidenceRequest = z.infer<typeof actionConfidenceRequestSchema>;\n\n// ---------------------------------------------------------------------------\n// Validation helper\n// ---------------------------------------------------------------------------\n\nexport type SchemaName =\n  | \"recall\"\n  | \"recallExplain\"\n  | \"setCodingContext\"\n  | \"observe\"\n  | \"memoryStore\"\n  | \"suggestionSubmit\"\n  | \"reviewDisposition\"\n  | \"trustZonePromote\"\n  | \"trustZoneDemoSeed\"\n  | \"lcmSearch\"\n  | \"lcmCompactionFlush\"\n  | \"lcmCompactionRecord\"\n  | \"daySummary\"\n  | \"capsuleExport\"\n  | \"capsuleImport\"\n  | \"capsuleList\"\n  | \"offlineSyncSnapshot\"\n  | \"offlineSyncFiles\"\n  | \"offlineSyncFileContent\"\n  | \"offlineSyncApply\"\n  | \"actionConfidence\";\n\nexport type SchemaTypeFor<N extends SchemaName> =\n  N extends \"recall\" ? RecallRequest\n  : N extends \"recallExplain\" ? RecallExplainRequest\n  : N extends \"setCodingContext\" ? SetCodingContextRequest\n  : N extends \"observe\" ? ObserveRequest\n  : N extends \"memoryStore\" ? MemoryStoreRequest\n  : N extends \"suggestionSubmit\" ? SuggestionSubmitRequest\n  : N extends \"reviewDisposition\" ? ReviewDispositionRequest\n  : N extends \"trustZonePromote\" ? TrustZonePromoteRequest\n  : N extends \"trustZoneDemoSeed\" ? TrustZoneDemoSeedRequest\n  : N extends \"lcmSearch\" ? LcmSearchRequest\n  : N extends \"lcmCompactionFlush\" ? LcmCompactionFlushRequest\n  : N extends \"lcmCompactionRecord\" ? LcmCompactionRecordRequest\n  : N extends \"daySummary\" ? DaySummaryRequest\n  : N extends \"capsuleExport\" ? CapsuleExportRequest\n  : N extends \"capsuleImport\" ? CapsuleImportRequest\n  : N extends \"capsuleList\" ? CapsuleListRequest\n  : N extends \"offlineSyncSnapshot\" ? OfflineSyncSnapshotRequest\n  : N extends \"offlineSyncFiles\" ? OfflineSyncFilesRequest\n  : N extends \"offlineSyncFileContent\" ? OfflineSyncFileContentRequest\n  : N extends \"offlineSyncApply\" ? OfflineSyncApplyRequest\n  : N extends \"actionConfidence\" ? ActionConfidenceRequest\n  : never;\n\nconst schemas: Record<SchemaName, z.ZodTypeAny> = {\n  recall: recallRequestSchema,\n  recallExplain: recallExplainRequestSchema,\n  setCodingContext: setCodingContextRequestSchema,\n  observe: observeRequestSchema,\n  memoryStore: memoryStoreRequestSchema,\n  suggestionSubmit: suggestionSubmitRequestSchema,\n  reviewDisposition: reviewDispositionRequestSchema,\n  trustZonePromote: trustZonePromoteRequestSchema,\n  trustZoneDemoSeed: trustZoneDemoSeedRequestSchema,\n  lcmSearch: lcmSearchRequestSchema,\n  lcmCompactionFlush: lcmCompactionFlushRequestSchema,\n  lcmCompactionRecord: lcmCompactionRecordRequestSchema,\n  daySummary: daySummaryRequestSchema,\n  capsuleExport: capsuleExportRequestSchema,\n  capsuleImport: capsuleImportRequestSchema,\n  capsuleList: capsuleListRequestSchema,\n  offlineSyncSnapshot: offlineSyncSnapshotRequestSchema,\n  offlineSyncFiles: offlineSyncFilesRequestSchema,\n  offlineSyncFileContent: offlineSyncFileContentRequestSchema,\n  offlineSyncApply: offlineSyncApplyRequestSchema,\n  actionConfidence: actionConfidenceRequestSchema,\n};\n\n/**\n * Validate a request body against the named schema.\n * Returns `{ success: true, data }` on pass or\n * `{ success: false, error }` on failure with field-level detail.\n */\nexport function validateRequest<T = unknown>(\n  schemaName: SchemaName,\n  body: unknown,\n): { success: true; data: T } | { success: false; error: SchemaValidationError } {\n  const schema = schemas[schemaName];\n  if (!schema) {\n    return {\n      success: false,\n      error: {\n        error: `unknown schema: ${schemaName}`,\n        code: \"validation_error\",\n        details: [],\n      },\n    };\n  }\n  const result = schema.safeParse(body);\n  if (result.success) {\n    return { success: true, data: result.data as T };\n  }\n  return { success: false, error: formatZodError(result.error) };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAIA,SAAS,SAAS;AAwBX,SAAS,eAAe,OAA0C;AACvE,SAAO;AAAA,IACL,OAAO;AAAA,IACP,MAAM;AAAA,IACN,SAAS,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACpC,OAAO,MAAM,KAAK,KAAK,GAAG,KAAK;AAAA,MAC/B,SAAS,MAAM;AAAA,IACjB,EAAE;AAAA,EACJ;AACF;AAMA,IAAM,kBAAkB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAC5D,IAAM,mBAAmB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AACpE,IAAM,uBAAuB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AACxE,IAAM,eAAe,EAAE,QAAQ,EAAE,SAAS;AAC1C,IAAM,sBAAsB,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AACtD,IAAM,iBAAiB,EACpB,OAAO,EACP,KAAK,EACL,IAAI,CAAC,EACL,IAAI,GAAG,EACP,OAAO,CAAC,UAAU;AACjB,MAAI;AACF,SAAK,eAAe,QAAW,EAAE,UAAU,MAAM,CAAC;AAClD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF,GAAG,+BAA+B;AAY7B,IAAM,sBAAsB,EAChC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,qCAAqC,EAAE,IAAI,GAAG;AAAA,EAClF,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC5C,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,oCAAoC,EAAE,IAAI,IAAI;AAAA,EACjF,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AACrD,CAAC,EACA,SAAS;AASL,IAAM,yBAAyB,EAAE,KAAK,CAAC,SAAS,WAAW,KAAK,CAAC;AASjE,IAAM,iBAAiB,EAAE,KAAK,CAAC,OAAO,KAAK,CAAC;AAE5C,IAAM,sBAAsB,EAAE,OAAO;AAAA,EAC1C,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,mBAAmB;AAAA,EAC5C,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAChD,MAAM,EAAE,KAAK,CAAC,QAAQ,aAAa,WAAW,QAAQ,YAAY,CAAC,EAAE,SAAS;AAAA,EAC9E,cAAc,EAAE,QAAQ,EAAE,SAAS;AAAA,EACnC,gBAAgB;AAAA,EAChB,YAAY,uBAAuB,SAAS;AAAA,EAC5C,eAAe,oBAAoB,SAAS;AAAA;AAAA,EAE5C,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,qCAAqC,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAKxF,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,4CAA4C,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOrG,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,6CAA6C,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM/F,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAKlE,UAAU,eAAe,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAKlC,sBAAsB,EAAE,QAAQ,EAAE,SAAS;AAC7C,CAAC;AAEM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,YAAY;AAAA,EACZ,WAAW;AACb,CAAC;AAOM,IAAM,gCAAgC,EAC1C,OAAO;AAAA,EACN,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,eAAe,oBAAoB,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM5C,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,4CAA4C,EAAE,IAAI,GAAG,EAAE,SAAS;AACvG,CAAC,EACA,YAAY,CAAC,OAAO,QAAQ;AAC3B,MAAI,MAAM,kBAAkB,UAAa,MAAM,eAAe,QAAW;AACvE,QAAI,SAAS;AAAA,MACX,MAAM,EAAE,aAAa;AAAA,MACrB,SAAS;AAAA,MACT,MAAM,CAAC,eAAe;AAAA,IACxB,CAAC;AAAA,EACH;AACF,CAAC;AAMH,IAAM,gBAAgB,EAAE,OAAO;AAAA,EAC7B,MAAM,EAAE,KAAK,CAAC,QAAQ,WAAW,CAAC;AAAA,EAClC,SAAS,EAAE,OAAO,EAAE,IAAI,GAAG,mCAAmC;AAAA,EAC9D,cAAc,EACX,KAAK,CAAC,UAAU,aAAa,YAAY,MAAM,iBAAiB,QAAQ,CAAC,EACzE,SAAS,EACT,SAAS;AAAA,EACZ,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS;AAAA,EAC5C,OAAO,EACJ;AAAA,IACC,EAAE,OAAO;AAAA,MACP,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,SAAS;AAAA,MACrD,MAAM,EAAE,KAAK;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,MACD,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC;AAAA,MACzC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MACzC,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MAC1C,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MACzC,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MAC1C,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MAC1C,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,IAC7C,CAAC;AAAA,EACH,EACC,SAAS,EACT,SAAS;AACd,CAAC;AAEM,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,UAAU,EAAE,MAAM,aAAa,EAAE,IAAI,GAAG,oCAAoC;AAAA,EAC5E,WAAW;AAAA,EACX,gBAAgB,EAAE,QAAQ,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQrC,gBAAgB;AAAA;AAAA,EAEhB,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,qCAAqC,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAKxF,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,4CAA4C,EAAE,IAAI,GAAG,EAAE,SAAS;AACvG,CAAC;AAMD,IAAM,qBAAqB,EAAE,OAAO,EAAE,IAAI,GAAG,qBAAqB,EAAE,IAAI,GAAK;AAC7E,IAAM,iBAAiB,EACpB,KAAK;AAAA,EACJ;AAAA,EAAQ;AAAA,EAAc;AAAA,EAAc;AAAA,EAAU;AAAA,EAC9C;AAAA,EAAgB;AAAA,EAAa;AAAA,EAAc;AAAA,EAAU;AAAA,EAAS;AAAA,EAAQ;AAAA,EACtE;AACF,CAAC,EACA,SAAS;AACZ,IAAM,mBAAmB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS;AAC3D,IAAM,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS;AACjE,IAAM,kBAAkB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAC5D,IAAM,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AACtD,IAAM,qBAAqB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAI,EAAE,SAAS;AAEzD,IAAM,2BAA2B,EAAE,OAAO;AAAA,EAC/C,eAAe;AAAA,EACf,gBAAgB;AAAA,EAChB,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,SAAS;AAAA,EACT,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,MAAM;AAAA,EACN,WAAW;AAAA,EACX,KAAK;AAAA,EACL,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA,EAKd,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,qCAAqC,EAAE,IAAI,IAAI,EAAE,SAAS;AAAA,EACxF,YAAY,EACT,OAAO,EACP,KAAK,EACL,IAAI,GAAG,4CAA4C,EACnD,IAAI,GAAG,EACP,SAAS;AACd,CAAC;AAEM,IAAM,gCAAgC;AAMtC,IAAM,iCAAiC,EAAE,OAAO;AAAA,EACrD,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,sBAAsB;AAAA,EACzD,QAAQ,EAAE,KAAK;AAAA,IACb;AAAA,IAAU;AAAA,IAAkB;AAAA,IAAe;AAAA,IAAY;AAAA,IAAc;AAAA,EACvE,CAAC;AAAA,EACD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB;AAAA,EAC7D,WAAW;AACb,CAAC;AAMM,IAAM,gCAAgC,EAAE,OAAO;AAAA,EACpD,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,sBAAsB;AAAA,EACzD,YAAY,EAAE,KAAK,CAAC,WAAW,SAAS,GAAG;AAAA,IACzC,UAAU,OAAO,EAAE,SAAS,4CAA4C;AAAA,EAC1E,CAAC;AAAA,EACD,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,6BAA6B;AAAA,EACvE,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS;AAAA,EACvC,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAI,EAAE,SAAS;AAAA,EAC9C,QAAQ;AAAA,EACR,WAAW;AACb,CAAC;AAMM,IAAM,iCAAiC,EAAE,OAAO;AAAA,EACrD,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC9C,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS;AAAA,EACvC,QAAQ;AAAA,EACR,WAAW;AACb,CAAC;AAMM,IAAM,yBAAyB,EAAE,OAAO;AAAA,EAC7C,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,mBAAmB;AAAA,EAC5C,YAAY;AAAA,EACZ,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC1D,WAAW;AAAA,EACX,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AACnD,CAAC;AAEM,IAAM,kCAAkC,EAAE,OAAO;AAAA,EACtD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,WAAW;AACb,CAAC;AAEM,IAAM,mCAAmC,EAAE,OAAO;AAAA,EACvD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,WAAW;AAAA,EACX,cAAc,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,6CAA6C;AAAA,EACnF,aAAa,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,4CAA4C;AACnF,CAAC;AAMM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,UAAU,EAAE,OAAO,EAAE,IAAI,GAAM,EAAE,SAAS;AAAA,EAC1C,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,UAAU,eAAe,SAAS;AACpC,CAAC;AAMD,IAAM,+BAA+B,EAClC,OAAO,EACP,KAAK,EACL,IAAI,CAAC,EACL,IAAI,GAAG,EACP;AAAA,EACC,CAAC,UAAU,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AAAA,EACvD;AACF;AAEF,IAAM,sBAAsB,EACzB,OAAO,EACP,KAAK,EACL,IAAI,CAAC,EACL,IAAI,GAAG,EACP;AAAA,EACC,CAAC,UAAU,UAAU,OAAO,UAAU,QAAQ,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AAAA,EAC1F;AACF;AAEF,IAAM,wBAAwB,EAC3B,OAAO,EACP,KAAK,EACL,IAAI,GAAG,8CAA8C,EACrD,IAAI,GAAG,EACP;AAAA,EACC;AAAA,EACA;AACF;AAEK,IAAM,6BAA6B,EACvC,OAAO;AAAA,EACN,MAAM,EACH,OAAO,EACP,KAAK,EACL,IAAI,GAAG,kBAAkB,EACzB,IAAI,IAAI,qCAAqC,EAC7C;AAAA,IACC;AAAA,IACA;AAAA,EACF;AAAA,EACF,WAAW;AAAA,EACX,OAAO,sBAAsB,SAAS;AAAA,EACtC,cAAc,EAAE,MAAM,4BAA4B,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,EACrE,SAAS,EAAE,MAAM,mBAAmB,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EACxD,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,SAAS,EAAE,QAAQ,EAAE,SAAS;AAChC,CAAC;AAEI,IAAM,6BAA6B,EACvC,OAAO;AAAA,EACN,aAAa,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,yBAAyB,EAAE,IAAI,IAAI;AAAA,EACzE,WAAW;AAAA,EACX,MAAM,EAAE,KAAK,CAAC,QAAQ,aAAa,MAAM,CAAC,EAAE,SAAS;AAAA,EACrD,YAAY,EAAE,OAAO,EAAE,IAAI,GAAG,8BAA8B,EAAE,IAAI,IAAI,EAAE,SAAS;AACnF,CAAC;AAEI,IAAM,2BAA2B,EACrC,OAAO;AAAA,EACN,WAAW;AAAA,EACX,YAAY;AACd,CAAC;AAMH,SAAS,uBAAuB,OAAwB;AACtD,MAAI;AACF,gCAA4B,OAAO,MAAM;AACzC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,wBAAwB,EAC3B,OAAO,EACP,KAAK,EACL,IAAI,GAAG,wBAAwB,EAC/B,IAAI,IAAI,EACR;AAAA,EACC;AAAA,EACA;AACF;AAEF,IAAM,6BAA6B,EAAE,OAAO;AAAA,EAC1C,MAAM;AAAA,EACN,QAAQ,EAAE,OAAO,EAAE,MAAM,mBAAmB,0CAA0C;AAAA,EACtF,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,EAC7B,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,yBAAyB;AACnE,CAAC;AAED,IAAM,kCAAkC,EACrC,OAAO,EACP,KAAK,EACL,IAAI,GAAG,gDAAgD,EACvD,IAAI,EAAE,EACN,OAAO,CAAC,UAAU,OAAO,SAAS,KAAK,MAAM,KAAK,CAAC,GAAG;AAAA,EACrD,SAAS;AACX,CAAC;AAEI,IAAM,mCAAmC,EAAE,OAAO;AAAA,EACvD,WAAW;AAAA,EACX,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,gBAAgB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACrC,gBAAgB,gCAAgC,SAAS;AAAA,EACzD,WAAW,EACR,MAAM,0BAA0B,EAChC,IAAI,KAAS,gDAAgD,EAC7D,SAAS;AACd,CAAC;AAEM,IAAM,gCAAgC,EAC1C,OAAO;AAAA,EACN,WAAW;AAAA,EACX,WAAW,EAAE,QAAQ;AAAA,EACrB,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAC3C,CAAC,EACA,OAAO,CAAC,UAAU,MAAM,cAAc,UAAa,MAAM,cAAc,MAAM;AAAA,EAC5E,SAAS;AAAA,EACT,MAAM,CAAC,WAAW;AACpB,CAAC;AAEI,IAAM,gCAAgC,EAAE,OAAO;AAAA,EACpD,WAAW;AAAA,EACX,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,OAAO,EACJ,MAAM,qBAAqB,EAC3B,IAAI,KAAM,0CAA0C;AACzD,CAAC;AAEM,IAAM,sCAAsC,EAAE,OAAO;AAAA,EAC1D,WAAW;AAAA,EACX,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,MAAM;AAAA,EACN,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EACzC,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,yCAAyC,EAAE,SAAS;AAC1F,CAAC;AAMD,IAAM,mBAAmB,CAAyB,WAChD,OAAO,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,UAAU,SAAS,MAAS;AAEtE,IAAM,6BAA6B,EAChC,OAAO;AAAA,EACN,MAAM,EAAE,KAAK,4BAA4B;AAAA,EACzC,aAAa,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC;AAAA,EAChE,SAAS,iBAAiB,EAAE,QAAQ,CAAC;AACvC,CAAC,EACA,OAAO;AAEV,IAAM,+BAA+B,EAClC,OAAO;AAAA,EACN,QAAQ,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EAC1D,SAAS,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EAC3D,SAAS,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EAC3D,OAAO,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EACzD,mBAAmB,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;AAAA,EACtF,iBAAiB,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC;AAAA,EACpE,YAAY,iBAAiB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAAA,EACrD,OAAO,iBAAiB,EAAE,QAAQ,CAAC;AAAA,EACnC,WAAW,iBAAiB,EAAE,QAAQ,CAAC;AAAA,EACvC,iBAAiB,iBAAiB,EAAE,KAAK,CAAC,QAAQ,cAAc,cAAc,YAAY,WAAW,CAAC,CAAC;AAAA,EACvG,WAAW,iBAAiB,EAAE,QAAQ,CAAC;AAAA,EACvC,QAAQ,iBAAiB,EAAE,KAAK,CAAC,QAAQ,mBAAmB,SAAS,CAAC,CAAC;AAAA,EACvE,eAAe,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC,EAAE,IAAI,EAAE,CAAC;AACrF,CAAC,EACA,OAAO;AAEH,IAAM,gCAAgC,EAC1C,OAAO;AAAA,EACN,gBAAgB,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC;AAAA,EACnE,YAAY,iBAAiB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAAA,EACrD,MAAM,iBAAiB,EAAE,KAAK,iCAAiC,CAAC;AAAA,EAChE,kBAAkB,iBAAiB,EAAE,KAAK,mCAAmC,CAAC;AAAA,EAC9E,sBAAsB,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;AAAA,EACzF,WAAW,iBAAiB,EAAE,MAAM,0BAA0B,EAAE,IAAI,GAAG,CAAC;AAAA,EACxE,mBAAmB,iBAAiB,EAAE,MAAM,4BAA4B,EAAE,IAAI,GAAG,CAAC;AACpF,CAAC,EACA,OAAO;AA+EV,IAAM,UAA4C;AAAA,EAChD,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,kBAAkB;AAAA,EAClB,SAAS;AAAA,EACT,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,WAAW;AAAA,EACX,oBAAoB;AAAA,EACpB,qBAAqB;AAAA,EACrB,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,eAAe;AAAA,EACf,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,wBAAwB;AAAA,EACxB,kBAAkB;AAAA,EAClB,kBAAkB;AACpB;AAOO,SAAS,gBACd,YACA,MAC+E;AAC/E,QAAM,SAAS,QAAQ,UAAU;AACjC,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,QACL,OAAO,mBAAmB,UAAU;AAAA,QACpC,MAAM;AAAA,QACN,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,OAAO,UAAU,IAAI;AACpC,MAAI,OAAO,SAAS;AAClB,WAAO,EAAE,SAAS,MAAM,MAAM,OAAO,KAAU;AAAA,EACjD;AACA,SAAO,EAAE,SAAS,OAAO,OAAO,eAAe,OAAO,KAAK,EAAE;AAC/D;","names":[]}

package/src/recall/archive-scoring.ts

@@ -1,544 +0,0 @@
-// ---------------------------------------------------------------------------
-// Off-thread archive scoring for the cold-fallback recall path (issue #1674).
-//
-// `searchLongTermArchiveFallback` (orchestrator.ts) falls back to scanning
-// EVERY archived memory file when hybrid/vector search returns zero hits.
-// The scoring loop — for each memory × for each token, `haystack.includes(token)`
-// — is fully synchronous, unbounded, and CPU-bound. Under concurrent recall
-// load this monopolized the JS main thread: N concurrent recalls serialized
-// on one core and each blew past the client-side timeout even though total
-// CPU work would have finished comfortably if parallelized.
-//
-// This module extracts the scoring loop into a pure function and provides two
-// strategies:
-//
-//   1. `SyncArchiveScoring`   — runs the pure function on the calling thread
-//                               (the OLD behavior; preserved for prove-fail
-//                               tests and as the graceful fallback).
-//   2. `OffThreadArchiveScoring` — dispatches the pure function to a
-//                               `worker_threads` pool so concurrent recalls
-//                               run on separate cores instead of serializing
-//                               on the main thread. Falls back to sync if
-//                               workers cannot be created.
-//
-// Both strategies share the identical `scoreArchiveMemories` pure function,
-// so the scoring semantics are byte-identical regardless of which path runs.
-// ---------------------------------------------------------------------------
-
-import os from "node:os";
-import { Worker } from "node:worker_threads";
-import { log } from "../logger.js";
-import type { MemoryFile } from "../types.js";
-
-// ─────────────────────────────────────────────────────────────────────────────
-// Wire types — plain-serializable shapes that cross the worker boundary via
-// structured clone. Only the fields the scoring loop reads are included.
-// ─────────────────────────────────────────────────────────────────────────────
-
-/** Minimal serializable projection of {@link MemoryFile} for scoring. */
-export interface ArchiveScoreItem {
-  id: string;
-  path: string;
-  content: string;
-  category: string;
-  tags: string[];
-}
-
-/** Scoring output — maps 1:1 to the relevant QmdSearchResult fields. */
-export interface ArchiveScoreResult {
-  docid: string;
-  path: string;
-  score: number;
-  snippet: string;
-}
-
-/** Worker request envelope. */
-interface ScoreTask {
-  items: ArchiveScoreItem[];
-  tokens: string[];
-}
-
-/** Worker reply envelope. */
-type ScoreReply = { ok: true; results: ArchiveScoreResult[] } | { ok: false; error: string };
-
-// ─────────────────────────────────────────────────────────────────────────────
-// Pure scoring function — shared by both strategies and by the inline worker.
-// Extracted verbatim from the original inline loop in
-// `searchLongTermArchiveFallback` so behavior is identical.
-// ─────────────────────────────────────────────────────────────────────────────
-
-/**
- * Score archived memories against query tokens using substring overlap.
- *
- * For each memory, builds a lowercase haystack from `[content, category, ...tags]`,
- * counts how many distinct tokens appear in it, and scores by `hits / tokens.length`.
- * Memories with zero hits are dropped. Snippets are the first 400 chars of content
- * with newlines collapsed to spaces — matching the original orchestrator behavior.
- *
- * This function is intentionally synchronous and CPU-bound; that is precisely
- * why the off-thread strategy exists.
- */
-export function scoreArchiveMemories(
-  items: ReadonlyArray<ArchiveScoreItem>,
-  tokens: ReadonlyArray<string>
-): ArchiveScoreResult[] {
-  if (items.length === 0 || tokens.length === 0) return [];
-
-  const scored: ArchiveScoreResult[] = [];
-  for (const item of items) {
-    const haystack = [item.content, item.category, ...item.tags].join(" ").toLowerCase();
-    let hits = 0;
-    for (const token of tokens) {
-      if (haystack.includes(token)) hits += 1;
-    }
-    if (hits === 0) continue;
-    scored.push({
-      docid: item.id,
-      path: item.path,
-      score: hits / tokens.length,
-      snippet: item.content.slice(0, 400).replace(/\n/g, " "),
-    });
-  }
-  return scored;
-}
-
-/**
- * Project a {@link MemoryFile} into the minimal serializable shape the scoring
- * function consumes. Called on the main thread BEFORE dispatching to a worker
- * so the heavy `MemoryFrontmatter` (dozens of optional fields, nested objects)
- * never crosses the worker boundary.
- */
-export function memoryFileToScoreItem(memory: MemoryFile): ArchiveScoreItem {
-  return {
-    id: memory.frontmatter.id,
-    path: memory.path,
-    content: memory.content,
-    category: memory.frontmatter.category,
-    tags: memory.frontmatter.tags ?? [],
-  };
-}
-
-// ─────────────────────────────────────────────────────────────────────────────
-// Strategy interface
-// ─────────────────────────────────────────────────────────────────────────────
-
-/**
- * Pluggable scoring backend. The orchestrator holds one instance and calls
- * `score()` from the cold-fallback path. The default is off-thread; tests and
- * restricted environments can swap in the sync strategy.
- */
-export interface ArchiveScoringStrategy {
-  score(
-    items: ReadonlyArray<ArchiveScoreItem>,
-    tokens: ReadonlyArray<string>,
-    abortSignal?: AbortSignal
-  ): Promise<ArchiveScoreResult[]>;
-}
-
-// ─────────────────────────────────────────────────────────────────────────────
-// 1. SyncArchiveScoring — the OLD serialized behavior, preserved for fallback
-// ─────────────────────────────────────────────────────────────────────────────
-
-/**
- * Runs the scoring loop synchronously on the calling thread.
- *
- * This is the exact behavior that caused issue #1674: the synchronous loop
- * blocks the event loop for its entire duration, so concurrent recall
- * requests serialize behind each other. It is retained as the graceful
- * fallback when worker_threads are unavailable, and as the prove-fail
- * baseline in regression tests.
- */
-export class SyncArchiveScoring implements ArchiveScoringStrategy {
-  async score(
-    items: ReadonlyArray<ArchiveScoreItem>,
-    tokens: ReadonlyArray<string>,
-    abortSignal?: AbortSignal
-  ): Promise<ArchiveScoreResult[]> {
-    if (items.length === 0 || tokens.length === 0) return [];
-    if (abortSignal?.aborted) return [];
-    // Process in chunks so an abort during a large archive scan is observed
-    // without burning the full synchronous CPU pass (#1674 review: sync
-    // fallback should check mid-scoring abort, like the old inline loop).
-    const CHUNK = 500;
-    if (items.length <= CHUNK) return scoreArchiveMemories(items, tokens);
-    const results: ArchiveScoreResult[] = [];
-    for (let i = 0; i < items.length; i += CHUNK) {
-      if (abortSignal?.aborted) return [];
-      const scored = scoreArchiveMemories(items.slice(i, i + CHUNK), tokens);
-      for (const r of scored) results.push(r);
-    }
-    return results;
-  }
-}
-
-// ─────────────────────────────────────────────────────────────────────────────
-// Inline worker code (eval mode) — eliminates file-resolution / build-config
-// issues entirely. The worker is self-contained CJS (no imports), so it runs
-// identically under tsx, compiled dist, and published npm packages.
-// ─────────────────────────────────────────────────────────────────────────────
-
-/**
- * Inline worker source. Runs via `new Worker(code, { eval: true })`.
- *
- * MUST stay byte-identical to {@link scoreArchiveMemories} above. The
- * regression test "worker scoring matches canonical scoreArchiveMemories"
- * asserts this equivalence at runtime.
- */
-const WORKER_SOURCE = String.raw`
-const { parentPort } = require('node:worker_threads');
-
-function scoreArchiveMemories(items, tokens) {
-  if (items.length === 0 || tokens.length === 0) return [];
-  var scored = [];
-  for (var i = 0; i < items.length; i++) {
-    var item = items[i];
-    var haystack = [item.content, item.category].concat(item.tags || []).join(' ').toLowerCase();
-    var hits = 0;
-    for (var j = 0; j < tokens.length; j++) {
-      if (haystack.indexOf(tokens[j]) !== -1) hits++;
-    }
-    if (hits === 0) continue;
-    scored.push({
-      docid: item.id,
-      path: item.path,
-      score: hits / tokens.length,
-      snippet: item.content.slice(0, 400).replace(/\n/g, ' '),
-    });
-  }
-  return scored;
-}
-
-if (parentPort) {
-  parentPort.on('message', function(task) {
-    try {
-      var results = scoreArchiveMemories(task.items, task.tokens);
-      parentPort.postMessage({ ok: true, results: results });
-    } catch (err) {
-      parentPort.postMessage({ ok: false, error: err && err.message ? err.message : String(err) });
-    }
-  });
-}
-`;
-
-// ─────────────────────────────────────────────────────────────────────────────
-// 2. OffThreadArchiveScoring — worker pool for genuine multi-core parallelism
-// ─────────────────────────────────────────────────────────────────────────────
-
-/**
- * Default worker pool size. Uses `availableParallelism()` (Node 19.4+) minus
- * one so the main thread always has a dedicated core for I/O dispatch. Capped
- * at 8 to bound memory overhead (each worker has its own V8 heap).
- */
-function defaultPoolSize(): number {
-  const cpus = typeof os.availableParallelism === "function" ? os.availableParallelism() : os.cpus().length;
-  return Math.max(1, Math.min(Math.max(1, cpus - 1), 8));
-}
-
-/**
- * Safety-net timeout for a single dispatch. The cold-fallback pipeline already
- * has its own deadline mechanism (runColdStepWithinDeadline); this is a
- * last-resort guard so a hung worker never blocks recall indefinitely.
- * Generously large to avoid interfering with large corpora (issue #1674
- * reported scans up to ~70s on large archives).
- */
-const DISPATCH_TIMEOUT_MS = 120_000;
-
-/** Lazy worker pool. Workers are created on first use and recycled. */
-class ArchiveScoringWorkerPool {
-  private readonly targetSize: number;
-  private workers: Worker[] = [];
-  private idle: Worker[] = [];
-  private waiters: Array<{ resolve: (worker: Worker) => void; reject: (err: Error) => void }> = [];
-  private terminated = false;
-  private busy = 0;
-
-  /**
-   * Workers currently checked out and scoring — NOT callers waiting in line.
-   * A caller parked in `acquire()` is queued, not running, so this is the only
-   * honest measure of real task overlap: with a size-1 pool it never exceeds 1
-   * no matter how many callers are queued behind it.
-   */
-  get busyWorkers(): number {
-    return this.busy;
-  }
-
-  constructor(size: number = defaultPoolSize()) {
-    this.targetSize = Math.max(1, size);
-  }
-
-  async run(task: ScoreTask, abortSignal?: AbortSignal): Promise<ArchiveScoreResult[]> {
-    if (this.terminated) throw new Error("archive-scoring pool terminated");
-    const worker = await this.acquire(abortSignal);
-    // If the caller already aborted before dispatch, return the worker to idle
-    // instead of retiring it — it was never posted to (#1674).
-    if (abortSignal?.aborted) {
-      this.release(worker);
-      return [];
-    }
-    let abandoned = false;
-    this.busy += 1;
-    try {
-      return await this.dispatch(worker, task, abortSignal, () => {
-        abandoned = true;
-      });
-    } finally {
-      this.busy -= 1;
-      if (abandoned) this.retireWorker(worker);
-      else this.release(worker);
-    }
-  }
-
-  async terminate(): Promise<void> {
-    if (this.terminated) return;
-    this.terminated = true;
-    // Reject all queued waiters so they don't hang indefinitely (#1674).
-    const queued = this.waiters;
-    this.waiters = [];
-    for (const w of queued) w.reject(new Error("archive-scoring pool terminated"));
-    const all = [...this.workers];
-    this.workers = [];
-    this.idle = [];
-    await Promise.allSettled(all.map((w) => w.terminate()));
-  }
-
-  private async acquire(abortSignal?: AbortSignal): Promise<Worker> {
-    const idle = this.idle.pop();
-    if (idle) return idle;
-    if (this.workers.length < this.targetSize) return this.spawn();
-    // Park until a worker is released. If the caller aborts (or the pool
-    // terminates) while queued, reject so the recall falls back to sync
-    // instead of consuming a worker for a request that already timed out.
-    return new Promise<Worker>((resolve, reject) => {
-      const entry = { resolve, reject };
-      this.waiters.push(entry);
-      if (!abortSignal) return;
-      const onAbort = () => {
-        const idx = this.waiters.indexOf(entry);
-        if (idx !== -1) this.waiters.splice(idx, 1);
-        reject(new Error("archive-scoring acquire aborted"));
-      };
-      if (abortSignal.aborted) { onAbort(); return; }
-      abortSignal.addEventListener("abort", onAbort, { once: true });
-    });
-  }
-
-  private release(worker: Worker): void {
-    const next = this.waiters.shift();
-    if (next) {
-      next.resolve(worker);
-    } else if (!this.terminated) {
-      this.idle.push(worker);
-    } else {
-      void worker.terminate();
-    }
-  }
-
-  /** Terminate a worker that may still be busy, then spawn a replacement
-   *  if a waiter is queued. */
-  private retireWorker(worker: Worker): void {
-    const idx = this.workers.indexOf(worker);
-    if (idx !== -1) this.workers.splice(idx, 1);
-    void worker.terminate();
-    const next = this.waiters.shift();
-    if (next) next.resolve(this.spawn());
-  }
-
-  private spawn(): Worker {
-    const worker = new Worker(WORKER_SOURCE, { eval: true });
-    // Unref so idle workers never keep the event loop alive (#1674).
-    worker.unref();
-    this.workers.push(worker);
-    return worker;
-  }
-
-  private dispatch(
-    worker: Worker,
-    task: ScoreTask,
-    abortSignal: AbortSignal | undefined,
-    onAbandon: () => void
-  ): Promise<ArchiveScoreResult[]> {
-    return new Promise<ArchiveScoreResult[]>((resolve, reject) => {
-      let settled = false;
-      const timer = setTimeout(() => {
-        if (settled) return;
-        settled = true;
-        cleanup();
-        onAbandon();
-        log.debug(`archive-scoring dispatch timed out after ${DISPATCH_TIMEOUT_MS}ms — falling back to sync`);
-        reject(new Error(`archive-scoring dispatch timed out after ${DISPATCH_TIMEOUT_MS}ms`));
-      }, DISPATCH_TIMEOUT_MS);
-
-      const onMessage = (reply: ScoreReply) => {
-        if (settled) return;
-        settled = true;
-        cleanup();
-        if (reply.ok) resolve(reply.results);
-        else reject(new Error(reply.error));
-      };
-      const onError = (err: Error) => {
-        if (settled) return;
-        settled = true;
-        cleanup();
-        onAbandon();
-        reject(err);
-      };
-      // worker.terminate() ends via 'exit', not 'error' — listen so in-flight
-      // dispatches during pool shutdown reject immediately instead of hanging
-      // until the 120s timeout (#1674).
-      const onExit = (code: number) => {
-        if (settled) return;
-        settled = true;
-        cleanup();
-        onAbandon();
-        reject(new Error(`archive-scoring worker exited with code ${code}`));
-      };
-      const onAbort = () => {
-        if (settled) return;
-        settled = true;
-        cleanup();
-        onAbandon();
-        resolve([]);
-      };
-
-      const cleanup = () => {
-        clearTimeout(timer);
-        worker.off("message", onMessage);
-        worker.off("error", onError);
-        worker.off("exit", onExit);
-        abortSignal?.removeEventListener("abort", onAbort);
-      };
-
-      worker.on("message", onMessage);
-      worker.on("error", onError);
-      worker.on("exit", onExit);
-      abortSignal?.addEventListener("abort", onAbort, { once: true });
-      worker.postMessage(task);
-    });
-  }
-}
-
-/**
- * Off-thread scoring via a `worker_threads` pool.
- *
- * Concurrent `score()` calls are dispatched to separate workers, giving
- * genuine multi-core parallelism: K concurrent recalls run on K cores
- * instead of serializing on the main JS thread. If the pool cannot be
- * created (e.g. restricted runtime), it transparently falls back to
- * {@link SyncArchiveScoring} so recall never breaks.
- */
-export class OffThreadArchiveScoring implements ArchiveScoringStrategy {
-  private pool: ArchiveScoringWorkerPool | null = null;
-  private poolFailed = false;
-  private readonly syncFallback = new SyncArchiveScoring();
-
-  constructor(poolSize?: number) {
-    if (poolSize !== undefined) {
-      this.pool = new ArchiveScoringWorkerPool(poolSize);
-    }
-  }
-
-  /** Workers currently scoring; 0 when no pool has been created yet. */
-  get busyWorkers(): number {
-    return this.pool?.busyWorkers ?? 0;
-  }
-
-  async score(
-    items: ReadonlyArray<ArchiveScoreItem>,
-    tokens: ReadonlyArray<string>,
-    abortSignal?: AbortSignal
-  ): Promise<ArchiveScoreResult[]> {
-    if (items.length === 0 || tokens.length === 0) return [];
-    if (abortSignal?.aborted) return [];
-
-    // Lazy pool init — workers are only created when the cold-fallback path
-    // is first hit, so hot-path recall pays zero overhead.
-    if (this.pool === null && !this.poolFailed) {
-      try {
-        this.pool = new ArchiveScoringWorkerPool();
-      } catch (err) {
-        this.poolFailed = true;
-        log.debug(`archive-scoring: worker pool unavailable, using sync fallback — ${(err as Error).message}`);
-      }
-    }
-
-    if (this.pool !== null) {
-      const dispatchStart = Date.now();
-      try {
-        const task: ScoreTask = {
-          items: items as ArchiveScoreItem[],
-          tokens: tokens as string[],
-        };
-        const results = await this.pool.run(task, abortSignal);
-        if (abortSignal?.aborted) return [];
-        return results;
-      } catch (err) {
-        // Timeout or worker error — fall back to sync scoring so recall
-        // quality is never silently dropped. An already-aborted signal
-        // short-circuits first. If the dispatch consumed most of the timeout
-        // budget (genuine timeout, not a fast error), skip the sync rescore —
-        // the recall deadline has very likely expired by then (#1674).
-        if (abortSignal?.aborted) return [];
-        if (Date.now() - dispatchStart > DISPATCH_TIMEOUT_MS * 0.5) return [];
-        log.debug(`archive-scoring: worker dispatch failed, using sync fallback — ${(err as Error).message}`);
-      }
-    }
-
-    return this.syncFallback.score(items, tokens, abortSignal);
-  }
-
-  /** @internal — terminate the underlying pool (tests / shutdown). */
-  async terminate(): Promise<void> {
-    if (this.pool !== null) {
-      await this.pool.terminate();
-      this.pool = null;
-    }
-  }
-}
-
-// ─────────────────────────────────────────────────────────────────────────────
-// Factory + process-wide default
-// ─────────────────────────────────────────────────────────────────────────────
-
-let defaultStrategy: ArchiveScoringStrategy | null = null;
-
-/**
- * Process-wide default archive-scoring strategy. Lazily creates an
- * {@link OffThreadArchiveScoring} on first use. All orchestrator instances
- * share one pool — a single daemon serves all concurrent sessions, so one
- * shared pool is the correct sizing unit.
- */
-export function getDefaultArchiveScoring(): ArchiveScoringStrategy {
-  if (defaultStrategy === null) {
-    defaultStrategy = new OffThreadArchiveScoring();
-  }
-  return defaultStrategy;
-}
-
-/**
- * Dispose the process-wide default archive-scoring strategy, terminating any
- * worker threads. Called from `Orchestrator.destroy()` so worker threads don't
- * outlive the orchestrator (#1674). The strategy is lazily recreated on the
- * next cold-fallback recall, so this is safe to call from tests that create
- * and destroy orchestrator instances.
- */
-export async function disposeDefaultArchiveScoring(): Promise<void> {
-  if (defaultStrategy !== null) {
-    const strategy = defaultStrategy;
-    defaultStrategy = null;
-    if (strategy instanceof OffThreadArchiveScoring) {
-      await strategy.terminate();
-    }
-  }
-}
-
-/**
- * Create a fresh strategy instance (for tests that need isolation or
- * explicit control over pool size / sync vs off-thread).
- */
-export function createArchiveScoring(opts?: {
-  poolSize?: number;
-  sync?: boolean;
-}): ArchiveScoringStrategy {
-  if (opts?.sync) return new SyncArchiveScoring();
-  return new OffThreadArchiveScoring(opts?.poolSize);
-}