@remnic/core 1.1.10 → 1.1.12

package/dist/chunk-Z5S5HNGY.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extraction.ts"],"sourcesContent":["import OpenAI from \"openai\";\nimport { log } from \"./logger.js\";\nimport { delinearize } from \"./delinearize.js\";\nimport { LocalLlmClient } from \"./local-llm.js\";\nimport { FallbackLlmClient } from \"./fallback-llm.js\";\nimport {\n  ExtractionResultSchema,\n  ConsolidationResultSchema,\n  IdentityConsolidationResultSchema,\n  buildProfileConsolidationResultSchema,\n  ProactiveExtractionResultSchema,\n  ProactiveQuestionsResultSchema,\n  type ContradictionVerificationResult,\n  type SuggestedLinks,\n  type MemorySummaryResult,\n  type ProactiveQuestionsResultParsed,\n  DaySummaryResultSchema,\n} from \"./schemas.js\";\nimport type {\n  BufferTurn,\n  ExtractionResult,\n  ConsolidationResult,\n  MemoryFile,\n  PluginConfig,\n  LlmTraceEvent,\n  GatewayConfig,\n  MemoryCategory,\n  DaySummaryResult as DaySummaryResultShape,\n} from \"./types.js\";\nimport { ModelRegistry } from \"./model-registry.js\";\nimport { extractJsonCandidates } from \"./json-extract.js\";\nimport { sanitizeMemoryContent } from \"./sanitize.js\";\nimport { applyWorkExtractionBoundary } from \"./work/boundary.js\";\nimport { buildChatCompletionTokenLimit, shouldAssumeOpenAiChatCompletions } from \"./openai-chat-compat.js\";\nimport { formatDaySummaryMemories, loadDaySummaryPrompt, buildExtensionsFooterForSummary } from \"./day-summary.js\";\nimport { ProfilingCollector } from \"./profiling.js\";\nimport { normalizeProcedureSteps } from \"./procedural/procedure-types.js\";\nimport { normalizeReasoningTrace } from \"./reasoning-trace-types.js\";\n\ntype ExtractionQuestion = ExtractionResult[\"questions\"][number];\ntype ExtractedFactResult = ExtractionResult[\"facts\"][number];\ntype ExtractedEntityResult = ExtractionResult[\"entities\"][number];\ntype ExtractedRelationshipResult = NonNullable<ExtractionResult[\"relationships\"]>[number];\nconst PROACTIVE_MIN_CONFIDENCE = 0.8;\nconst CONSOLIDATION_RESPONSE_SCHEMA = `{\n  \"items\": [\n    {\n      \"existingId\": \"id\",\n      \"action\": \"ADD\",\n      \"mergeWith\": \"optional-existing-id\",\n      \"updatedContent\": \"optional replacement content\",\n      \"reason\": \"brief reason for this action\"\n    }\n  ],\n  \"profileUpdates\": [\"optional profile update\"],\n  \"entityUpdates\": [{\"name\": \"person-jane-doe\", \"type\": \"person\", \"facts\": [\"Now leads the backend team\", \"Recently migrated the user service to TypeScript\"]}]\n}`;\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n\nfunction normalizeQuestion(question: ExtractionQuestion): ExtractionQuestion {\n  const priority = Number.isFinite(question.priority)\n    ? Math.max(0, Math.min(1, question.priority))\n    : 0.5;\n  return {\n    question: typeof question.question === \"string\" ? question.question.trim() : \"\",\n    context: typeof question.context === \"string\" ? question.context.trim() : \"\",\n    priority,\n  };\n}\n\nfunction normalizeFactKey(fact: Pick<ExtractedFactResult, \"category\" | \"content\">): string {\n  return `${fact.category}:${fact.content.trim().toLowerCase()}`;\n}\n\nfunction normalizeEntityKey(entity: Pick<ExtractedEntityResult, \"name\" | \"type\">): string {\n  return `${entity.type}:${entity.name.trim().toLowerCase()}`;\n}\n\nfunction normalizeRelationshipKey(\n  relationship: Pick<ExtractedRelationshipResult, \"source\" | \"target\" | \"label\">,\n): string {\n  return `${relationship.source.trim().toLowerCase()}=>${relationship.target.trim().toLowerCase()}:${relationship.label.trim().toLowerCase()}`;\n}\n\nfunction normalizeProfileUpdateKey(update: string): string {\n  return update.trim().toLowerCase();\n}\n\nexport class ExtractionEngine {\n  private client: OpenAI | null;\n  private localLlm: LocalLlmClient;\n  private fallbackLlm: FallbackLlmClient;\n  private modelRegistry: ModelRegistry;\n  private profiler: ProfilingCollector;\n\n  constructor(\n    private readonly config: PluginConfig,\n    profilerArg?: ProfilingCollector,\n    localLlm?: LocalLlmClient,\n    gatewayConfig?: GatewayConfig,\n    modelRegistry?: ModelRegistry,\n  ) {\n    this.profiler = profilerArg ?? new ProfilingCollector({ enabled: false, storageDir: \"/tmp/engram-profiler-disabled\", maxTraces: 0 });\n    if (config.openaiApiKey) {\n      this.client = new OpenAI({\n        apiKey: config.openaiApiKey,\n        ...(config.openaiBaseUrl ? { baseURL: config.openaiBaseUrl } : {}),\n      });\n    } else {\n      this.client = null;\n      log.warn(\"no OpenAI API key — direct OpenAI client disabled; local and gateway fallback paths remain available\");\n    }\n    this.localLlm = localLlm ?? new LocalLlmClient(config, modelRegistry);\n    this.fallbackLlm = new FallbackLlmClient(gatewayConfig, {\n      workspaceDir: config.workspaceDir,\n    });\n    this.modelRegistry = modelRegistry ?? new ModelRegistry(config.memoryDir);\n    if (config.modelSource === \"gateway\") {\n      log.debug(\n        `extraction engine: gateway model source active; extraction uses the gateway chain as its primary path` +\n          (config.gatewayAgentId ? ` (agent: ${config.gatewayAgentId})` : \" (defaults)\"),\n      );\n    }\n  }\n\n  /**\n   * Whether LLM calls should be routed through the gateway model chain\n   * instead of the plugin's own local/OpenAI clients.\n   */\n  private get useGatewayModelSource(): boolean {\n    return this.config.modelSource === \"gateway\";\n  }\n\n  /**\n   * Whether the local LLM path should be attempted.\n   * Disabled when gateway model source is active (gateway chain replaces local).\n   */\n  private get shouldUseLocalLlm(): boolean {\n    return this.config.localLlmEnabled && !this.useGatewayModelSource;\n  }\n\n  /**\n   * Whether the direct OpenAI client should be used.\n   * Disabled when gateway model source is active.\n   */\n  private get shouldUseDirectClient(): boolean {\n    return !this.useGatewayModelSource && this.client !== null;\n  }\n\n  /**\n   * Build FallbackLlmOptions with the configured gateway agent ID injected.\n   */\n  private withGatewayAgent(options: import(\"./fallback-llm.js\").FallbackLlmOptions): import(\"./fallback-llm.js\").FallbackLlmOptions {\n    if (!this.useGatewayModelSource) return options;\n    const agentId = this.config.gatewayAgentId || undefined;\n    return agentId ? { ...options, agentId } : options;\n  }\n\n  private emit(event: LlmTraceEvent): void {\n    try {\n      const cb = (globalThis as any).__openclawEngramTrace;\n      if (typeof cb === \"function\") cb(event);\n    } catch {\n      // Never throw — broken subscriber must not crash extraction\n    }\n  }\n\n  private directClientUsesOpenAiTokenSemantics(): boolean {\n    return shouldAssumeOpenAiChatCompletions(this.config.openaiBaseUrl);\n  }\n\n  private sanitizeExtractionResult(result: ExtractionResult, messageTimestamp?: Date): ExtractionResult {\n    const proceduralOn = this.config.procedural?.enabled === true;\n    const ts = messageTimestamp ?? new Date();\n    const facts = result.facts\n      .filter((fact) => proceduralOn || fact.category !== \"procedure\")\n      .map((fact) => {\n        const sanitized = sanitizeMemoryContent(fact.content);\n        if (!sanitized.clean) {\n          log.warn(`extraction fact sanitized; violations=${sanitized.violations.join(\", \")}`);\n        }\n        let content = sanitized.text;\n        // De-linearize: resolve coreferences + anchor temporal expressions\n        if (this.config.delinearizeEnabled) {\n          content = delinearize(content, result.entities, ts);\n        }\n        return { ...fact, content };\n      });\n    return { ...result, facts };\n  }\n\n  private hasExtractionOutputs(result: ExtractionResult): boolean {\n    return result.facts.length > 0\n      || result.entities.length > 0\n      || result.questions.length > 0\n      || result.profileUpdates.length > 0\n      || (result.relationships?.length ?? 0) > 0;\n  }\n\n  private normalizeExtractionResultPayload(parsed: any): ExtractionResult {\n    const entities = Array.isArray(parsed?.entities)\n      ? parsed.entities\n          .map((e: any) => this.normalizeEntityUpdate(e))\n          .filter((e: any) => e.name.length > 0)\n      : [];\n\n    const facts = Array.isArray(parsed?.facts)\n      ? parsed.facts\n          .map((f: any) => ({\n            category: typeof f?.category === \"string\" ? f.category : \"fact\",\n            content: typeof f?.content === \"string\" ? f.content : typeof f?.text === \"string\" ? f.text : \"\",\n            confidence: typeof f?.confidence === \"number\" ? f.confidence : 0.7,\n            tags: Array.isArray(f?.tags) ? f.tags.filter((t: any) => typeof t === \"string\") : [],\n            entityRef: typeof f?.entityRef === \"string\" ? f.entityRef : undefined,\n            promptedByQuestion:\n              typeof f?.promptedByQuestion === \"string\" ? f.promptedByQuestion : undefined,\n            scope:\n              f?.scope === \"global\" || f?.scope === \"project\" ? f.scope : undefined,\n            structuredAttributes:\n              f?.structuredAttributes && typeof f.structuredAttributes === \"object\" && !Array.isArray(f.structuredAttributes)\n                ? Object.fromEntries(\n                    Object.entries(f.structuredAttributes)\n                      .filter(([k, v]) => typeof k === \"string\" && typeof v === \"string\")\n                  ) as Record<string, string>\n                : undefined,\n            procedureSteps: Array.isArray(f?.procedureSteps)\n              ? normalizeProcedureSteps(f.procedureSteps)\n              : undefined,\n            reasoningTrace: (() => {\n              // Accept both camelCase and snake_case payload keys. The\n              // category itself is snake_case and we already tolerate\n              // snake_case nested fields in normalizeReasoningTrace, so a\n              // loose local/direct LLM that outputs `reasoning_trace` on the\n              // fact should not silently drop the structured chain.\n              const candidate =\n                f?.reasoningTrace && typeof f.reasoningTrace === \"object\" && !Array.isArray(f.reasoningTrace)\n                  ? f.reasoningTrace\n                  : f?.reasoning_trace && typeof f.reasoning_trace === \"object\" && !Array.isArray(f.reasoning_trace)\n                    ? f.reasoning_trace\n                    : null;\n              return candidate ? normalizeReasoningTrace(candidate) ?? undefined : undefined;\n            })(),\n          }))\n          .filter((f: any) => f.content.length > 0)\n      : [];\n\n    const questions = Array.isArray(parsed?.questions)\n      ? parsed.questions\n          .map((q: any) => {\n            if (typeof q === \"string\") return { question: q, context: \"\", priority: 0.5 };\n            return {\n              question: typeof q?.question === \"string\" ? q.question : typeof q?.text === \"string\" ? q.text : \"\",\n              context: typeof q?.context === \"string\" ? q.context : \"\",\n              priority: typeof q?.priority === \"number\" ? q.priority : 0.5,\n            };\n          })\n          .filter((q: any) => q.question.length > 0)\n      : [];\n\n    return {\n      facts,\n      entities,\n      profileUpdates: Array.isArray(parsed?.profileUpdates)\n        ? parsed.profileUpdates.filter((u: any) => typeof u === \"string\" && u.trim().length > 0)\n        : [],\n      questions,\n      identityReflection: parsed?.identityReflection ?? undefined,\n      relationships: Array.isArray(parsed?.relationships)\n        ? parsed.relationships.filter(\n            (r: any) =>\n              typeof r?.source === \"string\" &&\n              typeof r?.target === \"string\" &&\n              typeof r?.label === \"string\",\n          )\n            .map((r: any) => ({\n              source: r.source,\n              target: r.target,\n              label: r.label,\n              promptedByQuestion:\n                typeof r?.promptedByQuestion === \"string\" ? r.promptedByQuestion : undefined,\n            }))\n        : undefined,\n    };\n  }\n\n  private normalizeEntityUpdate(entity: any): ExtractedEntityResult {\n    const rawUpdates = isPlainRecord(entity?.updates) ? entity.updates : null;\n    const directFacts = Array.isArray(entity?.facts)\n      ? entity.facts\n          .filter((fact: any) => typeof fact === \"string\")\n          .map((fact: string) => fact.trim())\n          .filter((fact: string) => fact.length > 0)\n      : [];\n    const updateFacts = rawUpdates && Array.isArray(rawUpdates.facts)\n      ? rawUpdates.facts\n          .filter((fact: unknown) => typeof fact === \"string\")\n          .map((fact: string) => fact.trim())\n          .filter((fact: string) => fact.length > 0)\n      : [];\n    const scalarUpdateFacts = rawUpdates\n      ? Object.keys(rawUpdates)\n          .sort((a, b) => a.localeCompare(b))\n          .filter((key) => ![\"facts\", \"name\", \"promptedByQuestion\", \"structuredSections\", \"type\"].includes(key))\n          .flatMap((key) => {\n            const value = rawUpdates[key];\n            if (typeof value === \"string\" && value.trim().length > 0) {\n              return [`${key}: ${value.trim()}`];\n            }\n            if (typeof value === \"number\" || typeof value === \"boolean\") {\n              return [`${key}: ${String(value)}`];\n            }\n            return [];\n          })\n      : [];\n    const structuredSectionsSource = Array.isArray(entity?.structuredSections)\n      ? entity.structuredSections\n      : Array.isArray(rawUpdates?.structuredSections)\n        ? rawUpdates.structuredSections\n        : [];\n    const name =\n      typeof entity?.name === \"string\"\n        ? entity.name.trim()\n        : typeof entity?.entityId === \"string\"\n          ? entity.entityId.trim()\n          : typeof rawUpdates?.name === \"string\"\n            ? rawUpdates.name.trim()\n            : \"\";\n    const type =\n      typeof entity?.type === \"string\" && entity.type.trim().length > 0\n        ? entity.type.trim()\n        : typeof rawUpdates?.type === \"string\" && rawUpdates.type.trim().length > 0\n          ? rawUpdates.type.trim()\n          : \"other\";\n\n    return {\n      name,\n      type,\n      facts: [...directFacts, ...updateFacts, ...scalarUpdateFacts],\n      structuredSections: structuredSectionsSource.length > 0\n        ? structuredSectionsSource\n            .map((section: any) => ({\n              key: typeof section?.key === \"string\" ? section.key.trim() : \"\",\n              title: typeof section?.title === \"string\" ? section.title.trim() : \"\",\n              facts: Array.isArray(section?.facts)\n                ? section.facts.filter((fact: any) => typeof fact === \"string\")\n                    .map((fact: string) => fact.trim())\n                    .filter((fact: string) => fact.length > 0)\n                : [],\n            }))\n            .filter((section: any) => (\n              section.key.length > 0 &&\n              section.title.length > 0 &&\n              section.facts.length > 0\n            ))\n        : undefined,\n      promptedByQuestion:\n        typeof entity?.promptedByQuestion === \"string\"\n          ? entity.promptedByQuestion\n          : typeof rawUpdates?.promptedByQuestion === \"string\"\n            ? rawUpdates.promptedByQuestion\n            : undefined,\n    };\n  }\n\n  private parseJsonObject(content?: string | null): any | null {\n    const trimmed = content?.trim();\n    if (!trimmed) return null;\n\n    for (const candidate of extractJsonCandidates(trimmed)) {\n      try {\n        return JSON.parse(candidate);\n      } catch {\n        // keep trying candidates\n      }\n    }\n\n    return null;\n  }\n\n  private normalizeContradictionVerificationResult(parsed: any): ContradictionVerificationResult | null {\n    if (!parsed || typeof parsed.isContradiction !== \"boolean\") return null;\n\n    const rawWhich = parsed.whichIsNewer ?? parsed.winner;\n    const normalizedWhich =\n      rawWhich === \"first\" || rawWhich === \"existing\"\n        ? \"first\"\n        : rawWhich === \"second\" || rawWhich === \"new\"\n          ? \"second\"\n          : \"unclear\";\n\n    return {\n      isContradiction: Boolean(parsed.isContradiction),\n      confidence: typeof parsed.confidence === \"number\" ? parsed.confidence : 0.5,\n      reasoning:\n        typeof parsed.reasoning === \"string\"\n          ? parsed.reasoning\n          : typeof parsed.explanation === \"string\"\n            ? parsed.explanation\n            : \"\",\n      whichIsNewer: normalizedWhich,\n    };\n  }\n\n  private normalizeSuggestedLinksResult(parsed: any): SuggestedLinks | null {\n    if (!parsed || !Array.isArray(parsed.links)) {\n      return null;\n    }\n\n    const normalizedLinks = parsed.links\n      .map((link: any) => {\n        const rawLinkType = link?.linkType ?? link?.type;\n        return {\n          targetId: typeof link?.targetId === \"string\" ? link.targetId : \"\",\n          linkType:\n            rawLinkType === \"follows\" ||\n            rawLinkType === \"references\" ||\n            rawLinkType === \"contradicts\" ||\n            rawLinkType === \"supports\" ||\n            rawLinkType === \"related\"\n              ? rawLinkType\n              : \"related\",\n          strength: typeof link?.strength === \"number\" ? Math.max(0, Math.min(1, link.strength)) : 0.5,\n          reason: typeof link?.reason === \"string\" ? link.reason : undefined,\n        };\n      })\n      .filter((link: any) => link.targetId.length > 0);\n\n    return { links: normalizedLinks };\n  }\n\n  private normalizeMemorySummaryResult(parsed: any): MemorySummaryResult | null {\n    if (!parsed) return null;\n\n    const normalized: MemorySummaryResult = {\n      summaryText:\n        typeof parsed.summaryText === \"string\"\n          ? parsed.summaryText\n          : typeof parsed.summary === \"string\"\n            ? parsed.summary\n            : \"\",\n      keyFacts: Array.isArray(parsed.keyFacts) ? parsed.keyFacts.filter((f: unknown) => typeof f === \"string\") : [],\n      keyEntities: Array.isArray(parsed.keyEntities)\n        ? parsed.keyEntities.filter((e: unknown) => typeof e === \"string\")\n        : Array.isArray(parsed.entities)\n          ? parsed.entities.filter((e: unknown) => typeof e === \"string\")\n          : [],\n    };\n\n    return normalized.summaryText.length > 0 ? normalized : null;\n  }\n\n  private normalizeDaySummaryResult(parsed: any): DaySummaryResultShape | null {\n    if (!parsed) return null;\n\n    const normalized: DaySummaryResultShape = {\n      summary: typeof parsed.summary === \"string\" ? parsed.summary.trim() : \"\",\n      bullets: Array.isArray(parsed.bullets)\n        ? parsed.bullets.filter((item: unknown) => typeof item === \"string\").map((item: string) => item.trim()).filter(Boolean)\n        : [],\n      next_actions: Array.isArray(parsed.next_actions)\n        ? parsed.next_actions.filter((item: unknown) => typeof item === \"string\").map((item: string) => item.trim()).filter(Boolean)\n        : [],\n      risks_or_open_loops: Array.isArray(parsed.risks_or_open_loops)\n        ? parsed.risks_or_open_loops.filter((item: unknown) => typeof item === \"string\").map((item: string) => item.trim()).filter(Boolean)\n        : [],\n    };\n\n    return normalized.summary.length > 0 ? normalized : null;\n  }\n\n  private sanitizeConsolidationResult(result: {\n    items?: unknown[];\n    profileUpdates?: unknown[];\n    entityUpdates?: unknown[];\n  }): ConsolidationResult {\n    const items: ConsolidationResult[\"items\"] = [];\n    for (const item of Array.isArray(result.items) ? result.items : []) {\n      const rawAction = typeof (item as any)?.action === \"string\" ? (item as any).action.toUpperCase() : \"SKIP\";\n      const action =\n        rawAction === \"ADD\" ||\n        rawAction === \"MERGE\" ||\n        rawAction === \"UPDATE\" ||\n        rawAction === \"INVALIDATE\" ||\n        rawAction === \"SKIP\"\n          ? rawAction\n          : \"SKIP\";\n      const existingId =\n        typeof (item as any)?.existingId === \"string\"\n          ? (item as any).existingId.trim()\n          : typeof (item as any)?.newMemoryId === \"string\"\n            ? (item as any).newMemoryId.trim()\n            : typeof (item as any)?.memoryId === \"string\"\n              ? (item as any).memoryId.trim()\n              : \"\";\n      if (!existingId) continue;\n      const mergeWith = typeof (item as any)?.mergeWith === \"string\" ? (item as any).mergeWith : undefined;\n      const reason = typeof (item as any)?.reason === \"string\" ? (item as any).reason : \"\";\n      const rawUpdatedContent = typeof (item as any)?.updatedContent === \"string\" ? (item as any).updatedContent : undefined;\n      if (!rawUpdatedContent) {\n        items.push({ existingId, action, mergeWith, updatedContent: undefined, reason });\n        continue;\n      }\n      const sanitized = sanitizeMemoryContent(rawUpdatedContent);\n      if (!sanitized.clean) {\n        log.warn(`consolidation item sanitized (${existingId}); violations=${sanitized.violations.join(\", \")}`);\n      }\n      items.push({\n        existingId,\n        action,\n        mergeWith,\n        updatedContent: sanitized.text,\n        reason,\n      });\n    }\n    const profileUpdates = (Array.isArray(result.profileUpdates) ? result.profileUpdates : [])\n      .map((update: any) =>\n        typeof update === \"string\"\n          ? update.trim()\n          : typeof update?.content === \"string\"\n            ? update.content.trim()\n            : \"\",\n      )\n      .filter((update) => update.length > 0);\n    const entityUpdates = (Array.isArray(result.entityUpdates) ? result.entityUpdates : [])\n      .map((entity: any) => this.normalizeEntityUpdate(entity))\n      .filter((entity: ExtractedEntityResult) => entity.name.length > 0);\n    return { items, profileUpdates, entityUpdates };\n  }\n\n  private async applyProactiveQuestionPass(\n    conversation: string,\n    base: ExtractionResult,\n  ): Promise<ExtractionResult> {\n    if (!this.config.proactiveExtractionEnabled) return base;\n    const maxAdditional = Math.max(0, Math.floor(this.config.maxProactiveQuestionsPerExtraction));\n    if (maxAdditional === 0) return base;\n    if (this.config.proactiveExtractionTimeoutMs === 0) return base;\n    if (this.config.proactiveExtractionMaxTokens === 0) return base;\n\n    try {\n      const proactive = await this.generateProactiveQuestions(conversation, base, maxAdditional);\n      if (proactive.length === 0) return base;\n      const proactiveAdditions = await this.answerProactiveQuestions(\n        conversation,\n        base,\n        proactive,\n        maxAdditional,\n      );\n      if (!this.hasExtractionOutputs(proactiveAdditions)) return base;\n      return this.mergeProactiveExtractionPass(base, proactiveAdditions, maxAdditional);\n    } catch (err) {\n      log.debug(`proactive extraction question pass failed (ignored): ${err}`);\n      return base;\n    }\n  }\n\n  private parseProactiveQuestionsFromText(\n    content: string,\n    existingQuestionKeys: Set<string>,\n  ): ExtractionQuestion[] {\n    for (const candidate of extractJsonCandidates(content)) {\n      try {\n        const parsed = JSON.parse(candidate) as Partial<ProactiveQuestionsResultParsed>;\n        if (!Array.isArray(parsed.questions)) continue;\n        return parsed.questions\n          .map((q) => normalizeQuestion(q as ExtractionQuestion))\n          .filter((q) => q.question.length > 0)\n          .filter((q) => !existingQuestionKeys.has(q.question.toLowerCase()));\n      } catch {\n        // Continue to next candidate.\n      }\n    }\n    return [];\n  }\n\n  private parseProactiveExtractionResultFromText(content: string): ExtractionResult | null {\n    for (const candidate of extractJsonCandidates(content)) {\n      try {\n        const parsed = ProactiveExtractionResultSchema.parse(JSON.parse(candidate));\n        return this.normalizeExtractionResultPayload({\n          ...parsed,\n          questions: [],\n        });\n      } catch {\n        // Continue to next candidate.\n      }\n    }\n    return null;\n  }\n\n  private async generateProactiveQuestions(\n    conversation: string,\n    base: ExtractionResult,\n    maxAdditional: number,\n  ): Promise<ExtractionQuestion[]> {\n    const existingQuestionKeys = new Set(\n      (base.questions ?? [])\n        .map((q) => q.question.trim().toLowerCase())\n        .filter((q) => q.length > 0),\n    );\n    const factsPreview = base.facts\n      .slice(0, 8)\n      .map((f) => `- (${f.category}) ${f.content}`)\n      .join(\"\\n\");\n    const existingQuestionsPreview = (base.questions ?? [])\n      .slice(0, 8)\n      .map((q) => `- ${q.question}`)\n      .join(\"\\n\");\n\n    const prompt = [\n      \"You are doing a proactive second-pass memory extraction.\",\n      `Generate up to ${maxAdditional} additional high-value follow-up questions not already covered.`,\n      \"Return only valid JSON with this shape:\",\n      '{\"questions\":[{\"question\":\"...\",\"context\":\"...\",\"priority\":0.0}]}',\n      \"\",\n      \"Current extracted facts:\",\n      factsPreview || \"(none)\",\n      \"\",\n      \"Questions already extracted (do not repeat):\",\n      existingQuestionsPreview || \"(none)\",\n      \"\",\n      \"Conversation:\",\n      conversation,\n    ].join(\"\\n\");\n\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResponse = await this.localLlm.chatCompletion(\n          [\n            {\n              role: \"system\",\n              content: \"You are a proactive memory extraction assistant. Output valid JSON only.\",\n            },\n            { role: \"user\", content: prompt },\n          ],\n          {\n            temperature: 0.2,\n            maxTokens: this.config.proactiveExtractionMaxTokens,\n            timeoutMs: this.config.proactiveExtractionTimeoutMs,\n            operation: \"proactive_extraction\",\n            priority: \"background\",\n          },\n        );\n        if (localResponse?.content) {\n          const localParsed = this.parseProactiveQuestionsFromText(\n            localResponse.content.trim(),\n            existingQuestionKeys,\n          );\n          if (localParsed.length > 0) {\n            return localParsed.slice(0, maxAdditional);\n          }\n        }\n        if (!this.config.localLlmFallback) {\n          return [];\n        }\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          throw err;\n        }\n      }\n    }\n\n    const fallbackResult = await this.fallbackLlm.parseWithSchema(\n      [\n        {\n          role: \"system\",\n          content: \"Generate additional proactive memory follow-up questions. Return valid JSON only.\",\n        },\n        { role: \"user\", content: prompt },\n      ],\n      ProactiveQuestionsResultSchema,\n      this.withGatewayAgent({\n        temperature: 0.2,\n        maxTokens: this.config.proactiveExtractionMaxTokens,\n        timeoutMs: this.config.proactiveExtractionTimeoutMs,\n      }),\n    );\n    if (!fallbackResult?.questions) return [];\n    return fallbackResult.questions\n      .map((q) => normalizeQuestion(q as ExtractionQuestion))\n      .filter((q) => q.question.length > 0)\n      .filter((q) => !existingQuestionKeys.has(q.question.toLowerCase()))\n      .slice(0, maxAdditional);\n  }\n\n  private async answerProactiveQuestions(\n    conversation: string,\n    base: ExtractionResult,\n    proactiveQuestions: ExtractionQuestion[],\n    maxAdditional: number,\n  ): Promise<ExtractionResult> {\n    const factsPreview = base.facts\n      .slice(0, 8)\n      .map((f) => `- (${f.category}) ${f.content}`)\n      .join(\"\\n\");\n    const entitiesPreview = base.entities\n      .slice(0, 8)\n      .map((entity) => `- (${entity.type}) ${entity.name}: ${entity.facts.join(\"; \") || \"(no facts)\"}`)\n      .join(\"\\n\");\n    const proactivePreview = proactiveQuestions\n      .slice(0, maxAdditional)\n      .map((question, index) => `${index + 1}. ${question.question}${question.context ? `\\n   context: ${question.context}` : \"\"}`)\n      .join(\"\\n\");\n\n    const prompt = [\n      \"You are answering proactive memory follow-up questions using only the provided buffered conversation.\",\n      `Return at most ${maxAdditional} additional high-confidence memory candidates that were omitted from the base extraction.`,\n      \"Only include information directly supported by the conversation. Do not speculate. Do not repeat the base extraction.\",\n      \"Return only valid JSON with this shape:\",\n      '{\"facts\":[{\"category\":\"fact\",\"content\":\"...\",\"confidence\":0.0,\"tags\":[\"...\"],\"entityRef\":\"optional\",\"promptedByQuestion\":\"optional\"}],\"profileUpdates\":[\"...\"],\"entities\":[{\"name\":\"...\",\"type\":\"person\",\"facts\":[\"...\"],\"structuredSections\":[{\"key\":\"beliefs\",\"title\":\"Beliefs\",\"facts\":[\"...\"]}],\"promptedByQuestion\":\"optional\"}],\"relationships\":[{\"source\":\"...\",\"target\":\"...\",\"label\":\"...\",\"promptedByQuestion\":\"optional\"}]}',\n      \"\",\n      \"Base extracted facts (do not repeat):\",\n      factsPreview || \"(none)\",\n      \"\",\n      \"Base extracted entities (do not repeat):\",\n      entitiesPreview || \"(none)\",\n      \"\",\n      \"Answer these follow-up questions from the same conversation only:\",\n      proactivePreview || \"(none)\",\n      \"\",\n      \"Conversation:\",\n      conversation,\n    ].join(\"\\n\");\n\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResponse = await this.localLlm.chatCompletion(\n          [\n            {\n              role: \"system\",\n              content: \"You are a proactive memory extraction assistant. Output valid JSON only.\",\n            },\n            { role: \"user\", content: prompt },\n          ],\n          {\n            temperature: 0.2,\n            maxTokens: this.config.proactiveExtractionMaxTokens,\n            timeoutMs: this.config.proactiveExtractionTimeoutMs,\n            operation: \"proactive_extraction\",\n            priority: \"background\",\n          },\n        );\n        if (localResponse?.content) {\n          const parsed = this.parseProactiveExtractionResultFromText(localResponse.content.trim());\n          if (parsed) {\n            return this.sanitizeExtractionResult(parsed);\n          }\n        }\n        if (!this.config.localLlmFallback) {\n          return { facts: [], profileUpdates: [], entities: [], questions: [] };\n        }\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          throw err;\n        }\n      }\n    }\n\n    const fallbackResult = await this.fallbackLlm.parseWithSchema(\n      [\n        {\n          role: \"system\",\n          content: \"Answer proactive memory follow-up questions from the provided conversation only. Return valid JSON only.\",\n        },\n        { role: \"user\", content: prompt },\n      ],\n      ProactiveExtractionResultSchema,\n      this.withGatewayAgent({\n        temperature: 0.2,\n        maxTokens: this.config.proactiveExtractionMaxTokens,\n        timeoutMs: this.config.proactiveExtractionTimeoutMs,\n      }),\n    );\n    if (!fallbackResult) {\n      return { facts: [], profileUpdates: [], entities: [], questions: [] };\n    }\n    return this.sanitizeExtractionResult(\n      this.normalizeExtractionResultPayload({\n        ...fallbackResult,\n        questions: [],\n      }),\n    );\n  }\n\n  private mergeProactiveExtractionPass(\n    base: ExtractionResult,\n    proactive: ExtractionResult,\n    maxAdditional: number,\n  ): ExtractionResult {\n    const allowlist = this.config.proactiveExtractionCategoryAllowlist;\n    let remainingBudget = Math.max(0, Math.floor(maxAdditional));\n    const mergedFacts = [...base.facts];\n    const seenFacts = new Set(base.facts.map((fact) => normalizeFactKey(fact)));\n    for (const fact of proactive.facts) {\n      if (remainingBudget <= 0) break;\n      if (fact.confidence < PROACTIVE_MIN_CONFIDENCE) continue;\n      if (allowlist && !allowlist.includes(fact.category as MemoryCategory)) continue;\n      const key = normalizeFactKey(fact);\n      if (seenFacts.has(key)) continue;\n      seenFacts.add(key);\n      mergedFacts.push({ ...fact, source: \"proactive\" });\n      remainingBudget -= 1;\n    }\n\n    const mergedEntities = base.entities.map((entity) => ({\n      ...entity,\n      facts: [...entity.facts],\n      structuredSections: entity.structuredSections\n        ? entity.structuredSections.map((section) => ({\n            ...section,\n            facts: [...section.facts],\n          }))\n        : undefined,\n    }));\n    const entityIndex = new Map(mergedEntities.map((entity, index) => [normalizeEntityKey(entity), index]));\n    for (const entity of proactive.entities) {\n      if (remainingBudget <= 0) break;\n      const key = normalizeEntityKey(entity);\n      const existingIndex = entityIndex.get(key);\n      if (typeof existingIndex === \"number\") {\n        const existing = mergedEntities[existingIndex]!;\n        const nextFacts = new Set(existing.facts.map((fact) => fact.trim()));\n        const nextSections = new Map(\n          (existing.structuredSections ?? []).map((section) => [section.key, {\n            ...section,\n            facts: [...section.facts],\n          }]),\n        );\n        let changed = false;\n        for (const fact of entity.facts) {\n          const trimmed = fact.trim();\n          if (!trimmed || nextFacts.has(trimmed)) continue;\n          nextFacts.add(trimmed);\n          changed = true;\n        }\n        for (const section of entity.structuredSections ?? []) {\n          const existingSection = nextSections.get(section.key);\n          if (!existingSection) {\n            nextSections.set(section.key, {\n              key: section.key,\n              title: section.title,\n              facts: [...section.facts],\n            });\n            changed = true;\n            continue;\n          }\n          const nextSectionFacts = new Set(existingSection.facts.map((fact) => fact.trim()));\n          for (const fact of section.facts) {\n            const trimmed = fact.trim();\n            if (!trimmed || nextSectionFacts.has(trimmed)) continue;\n            nextSectionFacts.add(trimmed);\n            changed = true;\n          }\n          existingSection.facts = Array.from(nextSectionFacts);\n        }\n        if (changed) {\n          mergedEntities[existingIndex] = {\n            ...existing,\n            facts: Array.from(nextFacts),\n            structuredSections: Array.from(nextSections.values()),\n            source: \"proactive\",\n            promptedByQuestion: existing.promptedByQuestion ?? entity.promptedByQuestion,\n          };\n          remainingBudget -= 1;\n        }\n        continue;\n      }\n      mergedEntities.push({\n        ...entity,\n        source: \"proactive\",\n        structuredSections: entity.structuredSections\n          ? entity.structuredSections.map((section) => ({\n              ...section,\n              facts: [...section.facts],\n            }))\n          : undefined,\n      });\n      entityIndex.set(key, mergedEntities.length - 1);\n      remainingBudget -= 1;\n    }\n\n    const mergedProfileUpdates = [...base.profileUpdates];\n    const seenProfileUpdates = new Set(base.profileUpdates.map((update) => normalizeProfileUpdateKey(update)));\n    for (const update of proactive.profileUpdates) {\n      if (remainingBudget <= 0) break;\n      const key = normalizeProfileUpdateKey(update);\n      if (!key || seenProfileUpdates.has(key)) continue;\n      seenProfileUpdates.add(key);\n      mergedProfileUpdates.push(update.trim());\n      remainingBudget -= 1;\n    }\n\n    const mergedRelationships = [...(base.relationships ?? [])];\n    const seenRelationships = new Set(mergedRelationships.map((relationship) => normalizeRelationshipKey(relationship)));\n    for (const relationship of proactive.relationships ?? []) {\n      if (remainingBudget <= 0) break;\n      const key = normalizeRelationshipKey(relationship);\n      if (seenRelationships.has(key)) continue;\n      seenRelationships.add(key);\n      mergedRelationships.push({ ...relationship, extractionSource: \"proactive\" });\n      remainingBudget -= 1;\n    }\n\n    return {\n      ...base,\n      facts: mergedFacts,\n      entities: mergedEntities,\n      profileUpdates: mergedProfileUpdates,\n      relationships: mergedRelationships,\n    };\n  }\n\n  private async parseWithGatewayFallback<T>(\n    traceId: string,\n    operation: LlmTraceEvent[\"operation\"],\n    startedAtMs: number,\n    schema: { parse: (data: unknown) => T },\n    messages: Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n    options: { temperature?: number; maxTokens?: number } = {},\n  ): Promise<T | null> {\n    const detailed = await this.fallbackLlm.parseWithSchemaDetailed(messages, schema, this.withGatewayAgent(options));\n    if (detailed?.result) {\n      const durationMs = Date.now() - startedAtMs;\n      this.emit({\n        kind: \"llm_end\",\n        traceId,\n        model: detailed.modelUsed,\n        operation,\n        durationMs,\n        output: JSON.stringify(detailed.result).slice(0, 2000),\n      });\n      return detailed.result;\n    }\n    return null;\n  }\n\n  async extract(turns: BufferTurn[], existingEntities?: string[]): Promise<ExtractionResult> {\n\n    // Guard: skip if buffer is empty or all turns are whitespace-only\n    const substantiveTurns = turns.filter((t) => t.content.trim().length > 0);\n    if (substantiveTurns.length === 0) {\n      log.debug(\"extraction skipped — no substantive turns in buffer\");\n      return { facts: [], profileUpdates: [], entities: [], questions: [] };\n    }\n\n    const boundedTurns = substantiveTurns\n      .map((turn) => ({\n        ...turn,\n        content: turn.role === \"assistant\"\n          ? applyWorkExtractionBoundary(turn.content)\n          : turn.content,\n      }))\n      .filter((turn) => turn.content.trim().length > 0);\n    const conversation = boundedTurns\n      .map((t) => `[${t.role}] ${t.content}`)\n      .join(\"\\n\\n\");\n    if (conversation.trim().length === 0) {\n      log.debug(\"extraction skipped — conversation only contained non-memory work-layer context\");\n      return { facts: [], profileUpdates: [], entities: [], questions: [] };\n    }\n\n    // Use the last turn's timestamp for temporal anchoring (more accurate than wall-clock)\n    const lastTurnTs = boundedTurns.length > 0 ? new Date(boundedTurns[boundedTurns.length - 1].timestamp) : undefined;\n    const messageTimestamp = lastTurnTs && !isNaN(lastTurnTs.getTime()) ? lastTurnTs : undefined;\n\n    const traceId = crypto.randomUUID();\n    // Only emit llm_start for the direct path when a client or local LLM is configured.\n    // Fallback-only deployments skip this to avoid fake spans in Opik.\n    const emittedDirectStart = !!(this.shouldUseDirectClient || this.shouldUseLocalLlm);\n    if (emittedDirectStart) {\n      this.emit({ kind: \"llm_start\", traceId, model: this.config.model, operation: \"extraction\", input: conversation });\n    }\n    let closedDirectTrace = false;\n    const startTime = Date.now();\n\n    // --- profiling instrumentation ---\n    const extractionTraceId = this.profiler.startTrace(\"extraction\", undefined, {\n      model: this.config.model,\n      localLlm: this.config.localLlmEnabled,\n    });\n    this.profiler.startSpan(\"total\", extractionTraceId);\n\n    try {\n    // Try local LLM first if enabled\n    if (this.shouldUseLocalLlm) {\n      this.profiler.startSpan(\"local-llm\", extractionTraceId);\n      try {\n        const localResult = await this.extractWithLocalLlm(conversation, existingEntities);\n        if (localResult) {\n          const durationMs = Date.now() - startTime;\n          this.profiler.endSpan(\"local-llm\", extractionTraceId);\n          this.emit({ kind: \"llm_end\", traceId, model: this.config.localLlmModel, operation: \"extraction\", durationMs });\n          log.debug(`extraction: used local LLM — ${localResult.facts.length} facts, ${localResult.entities.length} entities`);\n          const sanitized = this.sanitizeExtractionResult(localResult, messageTimestamp);\n          return await this.applyProactiveQuestionPass(conversation, sanitized);\n        }\n        // Local failed, fall back if allowed\n        if (!this.config.localLlmFallback) {\n          log.warn(\"extraction: local LLM failed and fallback disabled\");\n          return { facts: [], profileUpdates: [], entities: [], questions: [] };\n        }\n        log.info(\"extraction: local LLM unavailable, falling back to gateway default AI\");\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          log.warn(\"extraction: local LLM error and fallback disabled:\", err);\n          return { facts: [], profileUpdates: [], entities: [], questions: [] };\n        }\n        log.info(\"extraction: local LLM error, falling back to gateway default AI:\", err);\n      } finally {\n        // End local-llm span if it wasn't ended on the success path\n        try { this.profiler.endSpan(\"local-llm\", extractionTraceId); } catch { /* span may already be closed */ }\n      }\n    }\n\n    // Try direct OpenAI-compatible client (Scryr, OpenRouter, etc.)\n    if (this.shouldUseDirectClient) {\n      this.profiler.startSpan(\"direct-client\", extractionTraceId);\n      try {\n        const directResult = await this.extractWithDirectClient(conversation, existingEntities);\n        if (directResult) {\n          const durationMs = Date.now() - startTime;\n          this.profiler.endSpan(\"direct-client\", extractionTraceId);\n          this.emit({ kind: \"llm_end\", traceId, model: this.config.model, operation: \"extraction\", durationMs });\n          log.debug(`extraction: used direct client (${this.config.model}) — ${directResult.facts.length} facts, ${directResult.entities.length} entities`);\n          const sanitized = this.sanitizeExtractionResult(directResult, messageTimestamp);\n          return await this.applyProactiveQuestionPass(conversation, sanitized);\n        }\n        // Emit error event so Opik sees the direct client failure before fallback.\n        // Wrapped in try/catch so a subscriber error doesn't break the fallback path.\n        try {\n          this.emit({\n            kind: \"llm_error\", traceId, model: this.config.model, operation: \"extraction\",\n            durationMs: Date.now() - startTime, error: \"direct client returned no result\",\n          });\n        } catch { /* trace emit must not block fallback */ }\n        closedDirectTrace = true;\n        log.info(\"extraction: direct client returned no result, falling back to gateway AI\");\n      } catch (err) {\n        try {\n          this.emit({\n            kind: \"llm_error\", traceId, model: this.config.model, operation: \"extraction\",\n            durationMs: Date.now() - startTime, error: String(err),\n          });\n        } catch { /* trace emit must not block fallback */ }\n        closedDirectTrace = true;\n        log.info(\"extraction: direct client failed, falling back to gateway AI:\", err);\n      } finally {\n        try { this.profiler.endSpan(\"direct-client\", extractionTraceId); } catch { /* span may already be closed */ }\n      }\n    }\n\n    // Close any orphaned direct-path llm_start (e.g., local LLM failed, no direct client)\n    if (emittedDirectStart && !closedDirectTrace) {\n      try {\n        this.emit({\n          kind: \"llm_error\", traceId, model: this.config.model, operation: \"extraction\",\n          durationMs: Date.now() - startTime, error: \"local LLM failed, handing off to gateway fallback\",\n        });\n      } catch { /* trace emit must not block fallback */ }\n    }\n\n    // In gateway mode this is the primary extraction path. In plugin mode it is the\n    // final fallback after local/direct attempts fail. Emit a fresh llm_start so the\n    // gateway-backed call gets its own trace rather than being orphaned under the\n    // direct-client traceId.\n    const fallbackTraceId = crypto.randomUUID();\n    const fallbackStartTime = Date.now();\n    if (this.useGatewayModelSource) {\n      log.debug(\n        `extraction: using gateway model chain as primary path` +\n          (this.config.gatewayAgentId ? ` (agent: ${this.config.gatewayAgentId})` : \" (defaults)\"),\n      );\n    } else {\n      log.info(\"extraction: falling back to gateway default AI\");\n    }\n\n    this.profiler.startSpan(\"gateway-fallback\", extractionTraceId);\n    try {\n      const messages = [\n        { role: \"system\" as const, content: this.buildExtractionInstructions(existingEntities) },\n        { role: \"user\" as const, content: conversation },\n      ];\n\n      this.emit({ kind: \"llm_start\", traceId: fallbackTraceId, model: \"fallback\", operation: \"extraction\", input: conversation });\n\n      const detailed = await this.fallbackLlm.parseWithSchemaDetailed(\n        messages,\n        ExtractionResultSchema,\n        this.withGatewayAgent({ temperature: 0.3, maxTokens: 4096, timeoutMs: 30_000 }),\n      );\n\n      const fallbackDurationMs = Date.now() - fallbackStartTime;\n\n      if (detailed?.result && Array.isArray(detailed.result.facts)) {\n        const result = detailed.result;\n        this.emit({\n          kind: \"llm_end\", traceId: fallbackTraceId, model: detailed.modelUsed, operation: \"extraction\",\n          durationMs: fallbackDurationMs, output: JSON.stringify(result).slice(0, 2000),\n        });\n        log.debug(\n          `extracted ${result.facts.length} facts, ${result.entities.length} entities, ${(result.questions ?? []).length} questions via fallback (${detailed.modelUsed})`,\n        );\n        // Zod schema accepts snake_case aliases (final_answer / observed_outcome)\n        // alongside camelCase for gateway-tolerance, but the downstream\n        // ExtractedFact contract only exposes camelCase. Collapse each fact's\n        // reasoningTrace through normalizeReasoningTrace before passing it on so\n        // gateway output matches the shape local/direct-client paths produce.\n        const normalizedFacts = result.facts.map((f: any) => {\n          if (!f?.reasoningTrace) return f;\n          return {\n            ...f,\n            reasoningTrace: normalizeReasoningTrace(f.reasoningTrace) ?? undefined,\n          };\n        });\n        const sanitized = this.sanitizeExtractionResult({\n          ...result,\n          facts: normalizedFacts,\n          questions: result.questions ?? [],\n          identityReflection: result.identityReflection ?? undefined,\n        } as ExtractionResult, messageTimestamp);\n        return await this.applyProactiveQuestionPass(conversation, sanitized);\n      }\n\n      this.emit({\n        kind: \"llm_error\", traceId: fallbackTraceId, model: \"fallback\", operation: \"extraction\",\n        durationMs: fallbackDurationMs, error: \"fallback returned no parsed output\",\n      });\n      log.warn(\"extraction fallback returned no parsed output\");\n      return { facts: [], profileUpdates: [], entities: [], questions: [] };\n    } catch (err) {\n      this.emit({\n        kind: \"llm_error\", traceId: fallbackTraceId, model: \"fallback\", operation: \"extraction\",\n        durationMs: Date.now() - fallbackStartTime, error: String(err),\n      });\n      log.error(\"extraction fallback failed\", err);\n      return { facts: [], profileUpdates: [], entities: [], questions: [] };\n    } finally {\n      try { this.profiler.endSpan(\"gateway-fallback\", extractionTraceId); } catch { /* span may already be closed */ }\n    }\n\n    } finally {\n      // --- profiling: close the total span and trace ---\n      this.profiler.endSpan(\"total\", extractionTraceId);\n      this.profiler.endTrace(extractionTraceId); // persists to JSONL file\n    }\n  }\n\n  /**\n   * Extract memories using local LLM with JSON mode.\n   * Uses a minimal prompt to fit within local model context limits (typically 4k-8k).\n   */\n  private async extractWithLocalLlm(conversation: string, existingEntities?: string[]): Promise<ExtractionResult | null> {\n    log.debug(\n      `extractWithLocalLlm: starting extraction, localLlmEnabled=${this.shouldUseLocalLlm}, model=${this.config.localLlmModel}`,\n    );\n\n    // Get dynamic context sizes based on model capabilities (with optional user override)\n    const contextSizes = this.modelRegistry.calculateContextSizes(\n      this.config.localLlmModel,\n      this.config.localLlmMaxContext\n    );\n    log.debug(`Model context: ${contextSizes.description}`);\n\n    const maxConversationChars = contextSizes.maxInputChars;\n    const truncatedConversation = conversation.length > maxConversationChars\n      ? conversation.slice(0, maxConversationChars) + \"\\n\\n[truncated]\"\n      : conversation;\n\n    const localPrompt = `You are a memory extraction system. Extract durable, reusable memories from this conversation.\n\nMemory categories — use the MOST SPECIFIC category that fits:\n- fact: Objective information about the world\n- preference: User likes, dislikes, or stylistic choices\n- correction: User correcting a mistake (highest priority)\n- entity: People, projects, tools, companies (use canonical hyphenated names like \"my-project\")\n- decision: Choices made with rationale\n- relationship: How entities relate (e.g., \"Alice manages Bob\")\n- principle: Durable rules or operating beliefs (e.g., \"never use X API\")\n- commitment: Promises, obligations, deadlines\n- moment: Emotionally significant events\n- skill: Demonstrated capabilities\n- rule: Explicit operational rules or constraints\n- procedure: Repeatable workflows — use when the user describes a multi-step play (≥2 ordered steps). Put the human-readable trigger/context in \"content\" (e.g. \"When you deploy…\") and list steps in \"procedureSteps\" as [{\"order\":1,\"intent\":\"…\"}, …] mirroring the gateway extraction schema.\n- reasoning_trace: Stored solution chains — use when the user narrates HOW they solved a specific problem step-by-step (\"here's how I figured out…\", \"the debugging went like this…\"). Put a short title in \"content\" (e.g. \"How I debugged the staging latency spike\") and the chain in \"reasoningTrace\": {\"steps\":[{\"order\":1,\"description\":\"…\"}, …], \"finalAnswer\":\"…\", \"observedOutcome\":\"…\" (optional)}. Require ≥2 ordered steps and a finalAnswer. Do NOT use for ordinary decisions (prefer \"decision\") or reusable workflows (prefer \"procedure\").\n\nIMPORTANT: Do NOT label everything as \"fact\". Use \"decision\" for architectural choices, \"commitment\" for deadlines/promises, \"principle\" for reusable rules, \"correction\" for when the user rejects a suggestion, etc.\n\n=== DO NOT EXTRACT (negative examples) ===\nThese are operational noise - skip them:\n- \"The user has a cron job that runs every 30 minutes\" (scheduled task descriptions)\n- \"The user encountered error XYZ at 3:45 PM\" (temporary error states)\n- \"The file is located at /path/to/project/file\" (transient file paths)\n- \"The system is using 4GB of memory\" (current resource usage)\n- \"The user ran the 'git status' command\" (individual command executions)\n- \"The conversation took place on Tuesday\" (session metadata)\n- \"The agent read the file at /path/to/file.txt\" (agent's own actions)\n- \"The user's OpenClaw automation posts to #channel on failures\" (automation behavior descriptions)\n- \"The user stores state in /path/to/state.json\" (implementation details)\n- \"The X-watch automation has been stalled for 58 hours\" (system status updates)\n- \"The user processed 5 batch files and extracted insights\" (processing summaries)\n- \"The user has a cron job that runs a Checkpoint Loop every 2 hours\" (automation schedules)\n- \"The user runs a Morning Surprise cron job daily at 7:30 AM\" (automation schedules)\n- \"The user runs an X Bookmarks → Insights pipeline hourly at :13\" (automation schedules)\n- \"The user's system mines X/Twitter mentions for ideas every 10a/2p/6p\" (automation schedules)\n- \"The user runs a Health Insights cron job weekday mornings\" (automation schedules)\n- \"The system monitors the showcase page every 12 hours\" (system monitoring configurations)\n\n=== DO EXTRACT (positive examples) ===\nThese are durable insights - capture them:\n- \"The user prefers dark mode interfaces and finds light mode uncomfortable\" (preference)\n- \"The user works primarily with TypeScript and avoids Python for frontend code\" (long-term fact)\n- \"The user's side project 'alpha-trader' uses a custom algorithm for arbitrage\" (entity + detail)\n- \"The user corrected that PostgreSQL 15 is required, not version 14\" (correction)\n- \"The user never commits code without running tests first\" (principle)\n- \"The user has a meeting with the design team every Friday at 2pm\" (commitment)\n\n=== Rules ===\n- Extract only NEW information worth remembering across sessions\n- Skip transient details (file paths, current errors, temporary states, agent actions)\n- Confidence: Explicit (0.95-1.0), Implied (0.70-0.94), Inferred (0.40-0.69), Speculative (0.00-0.39)\n- Corrections get highest confidence (0.95+)\n- Each fact should be standalone and self-contained\n- CRITICAL: Use canonical hyphenated entity names (e.g., \"jane-doe\" not \"janedoe\")\n- CRITICAL: NEVER extract the same fact twice - check for duplicates before adding to facts array\n- CRITICAL: NEVER extract cron job schedules, automation configurations, or system monitoring details (these are operational noise)\n- If uncertain about relevance, prefer NOT extracting${this.config.extractionScopeClassificationEnabled ? `\n- For each fact, set \"scope\" to \"global\" (cross-project knowledge: framework bugs, library behavior, user preferences, tool configs, general patterns) or \"project\" (codebase-specific: file paths, env configs, deployment details, project workarounds). When in doubt, prefer \"project\".` : \"\"}\n\n=== Structured Attributes ===\nWhen a fact contains measurable, categorical, or precisely valued data, add a \"structuredAttributes\" object with key-value string pairs. This captures exact values for precise retrieval later.\nExamples of when to add structuredAttributes:\n- Product details: {\"price\": \"29.99\", \"brand\": \"Sony\", \"color\": \"black\", \"rating\": \"4.5\"}\n- Person details: {\"age\": \"32\", \"occupation\": \"engineer\", \"city\": \"Austin\"}\n- Events with dates: {\"date\": \"2024-03-15\", \"location\": \"San Francisco\"}\n- Decisions: {\"chosen\": \"PostgreSQL\", \"rejected\": \"MongoDB\", \"reason\": \"ACID compliance\"}\n- Quantities/measurements: {\"budget\": \"50000\", \"team_size\": \"5\", \"deadline\": \"2024-06-01\"}\nOnly add structuredAttributes when there are concrete values. Skip for abstract or narrative facts.\n\nAlso generate:\n1. 1-3 genuine questions you're curious about from this conversation\n2. Profile updates about user patterns/behaviors (if any)\n3. Relationships between entities (max 5). Use normalized names like \"person-jane-doe\", \"company-acme-corp\".\n4. For entity facts that fit a durable named heading, include entity.structuredSections with {key, title, facts}.\n\nOutput JSON:\n{\n  \"facts\": [{\"category\": \"decision\", \"content\": \"Chose PostgreSQL over MongoDB for the user service\", \"importance\": 8, \"confidence\": 0.9, \"scope\": \"project\", \"structuredAttributes\": {\"chosen\": \"PostgreSQL\", \"rejected\": \"MongoDB\"}}, {\"category\": \"procedure\", \"content\": \"When you cut a hotfix release, follow the checklist\", \"importance\": 8, \"confidence\": 0.9, \"scope\": \"project\", \"procedureSteps\": [{\"order\": 1, \"intent\": \"Branch from main and cherry-pick the fix\"}, {\"order\": 2, \"intent\": \"Run CI and tag the release\"}]}, {\"category\": \"reasoning_trace\", \"content\": \"How I debugged the staging latency spike\", \"importance\": 7, \"confidence\": 0.9, \"scope\": \"project\", \"reasoningTrace\": {\"steps\": [{\"order\": 1, \"description\": \"Checked CPU/memory dashboards — both were flat\"}, {\"order\": 2, \"description\": \"Ran a traceroute and saw retries against the cache tier\"}, {\"order\": 3, \"description\": \"Tailed cache-tier logs and spotted eviction storms\"}], \"finalAnswer\": \"Root cause was an undersized eviction policy on the session cache\", \"observedOutcome\": \"Increased cache size, p95 returned to baseline within 10 minutes\"}}, {\"category\": \"commitment\", \"content\": \"Must ship v2.0 API by end of March\", \"importance\": 10, \"confidence\": 1.0, \"scope\": \"project\", \"structuredAttributes\": {\"deadline\": \"end of March\", \"deliverable\": \"v2.0 API\"}}, {\"category\": \"fact\", \"content\": \"The store backend uses Redis for session caching\", \"importance\": 6, \"confidence\": 0.95, \"scope\": \"project\", \"entityRef\": \"project-acme-store\"}, {\"category\": \"principle\", \"content\": \"Always run migrations in a transaction to avoid partial schema updates\", \"importance\": 8, \"confidence\": 0.9, \"scope\": \"global\"}],\n  \"entities\": [{\"name\": \"person-jane-doe\", \"type\": \"person\", \"facts\": [\"Works at Acme Corp\", \"Prefers Python over JavaScript\"], \"structuredSections\": [{\"key\": \"beliefs\", \"title\": \"Beliefs\", \"facts\": [\"Python is a better fit than JavaScript for backend work.\"]}]}, {\"name\": \"project-acme-store\", \"type\": \"project\", \"facts\": [\"Built with Next.js\", \"Deployed on Vercel\"]}],\n  \"profileUpdates\": [\"User prefers dark mode in all editors\"],\n  \"questions\": [{\"question\": \"Which cloud provider hosts the staging environment?\", \"context\": \"Came up during deployment discussion\", \"priority\": 0.5}],\n  \"relationships\": [{\"source\": \"person-jane-doe\", \"target\": \"company-acme-corp\", \"label\": \"works at\"}]\n}\n\nConversation:\n${truncatedConversation}`;\n\n    log.debug(\n      `extractWithLocalLlm: calling localLlm.chatCompletion with prompt length ${localPrompt.length}...`,\n    );\n    const response = await this.localLlm.chatCompletion(\n      [\n        { role: \"system\", content: \"You are a memory extraction system. Output valid JSON only.\" },\n        { role: \"user\", content: localPrompt },\n      ],\n      {\n        temperature: 0.1,\n        maxTokens: contextSizes.maxOutputTokens,\n        operation: \"extraction\",\n        priority: \"background\",\n      },\n    );\n\n    if (!response?.content) {\n      log.debug(\"extractWithLocalLlm: chatCompletion returned null or empty content\");\n      return null;\n    }\n\n    const content = response.content.trim();\n    // Avoid logging model output content by default (may contain user data).\n    log.debug(`extractWithLocalLlm: got response content, length=${content.length}`);\n\n    try {\n      for (const candidate of extractJsonCandidates(content)) {\n        try {\n          log.debug(`extractWithLocalLlm: attempting JSON parse, candidate length=${candidate.length}`);\n          const parsed = JSON.parse(candidate);\n\n          const result: ExtractionResult = this.normalizeExtractionResultPayload(parsed);\n\n          log.debug(\n            `extractWithLocalLlm: successfully parsed response, facts=${result.facts.length}, entities=${result.entities.length}, profileUpdates=${result.profileUpdates.length}, questions=${result.questions.length}`,\n          );\n          return result;\n        } catch {\n          // keep trying candidates\n        }\n      }\n      return null;\n    } catch (err) {\n      // Try to extract partial facts from truncated JSON\n      log.debug(\"extractWithLocalLlm: JSON parse failed, attempting partial extraction...\");\n      const partial = this.extractPartialFacts(content);\n      if (partial.facts.length > 0 || partial.entities.length > 0) {\n        log.debug(\n          `extractWithLocalLlm: extracted ${partial.facts.length} partial facts from truncated JSON`,\n        );\n        return partial;\n      }\n\n      // Could not extract anything\n      const errMsg = err instanceof Error ? err.message : String(err);\n      log.debug(`extractWithLocalLlm: JSON parse error: ${errMsg}`);\n      return null;\n    }\n  }\n\n  /**\n   * Extract memories using direct OpenAI-compatible client (Chat Completions API).\n   * Works with Scryr, OpenRouter, and other OpenAI-compatible endpoints.\n   */\n  private async extractWithDirectClient(\n    conversation: string,\n    existingEntities?: string[],\n  ): Promise<ExtractionResult | null> {\n    if (!this.client) return null;\n\n    const tokenParams = buildChatCompletionTokenLimit(this.config.model, this.config.extractionMaxOutputTokens, {\n      assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n    });\n    log.debug(`extractWithDirectClient: calling model=${this.config.model} tokenParams=${JSON.stringify(tokenParams)}`);\n\n    const response = await this.client.chat.completions.create({\n      model: this.config.model,\n      messages: [\n        {\n          role: \"system\",\n          content:\n            this.buildExtractionInstructions(existingEntities) +\n            `\\n\\nRespond with valid JSON matching this schema:\n{\n  \"facts\": [{\"category\": \"decision\", \"content\": \"Chose React over Vue for the dashboard rewrite\", \"importance\": 8, \"confidence\": 0.9, \"tags\": [\"frontend\"], \"scope\": \"project\", \"structuredAttributes\": {\"chosen\": \"React\", \"rejected\": \"Vue\"}}, {\"category\": \"fact\", \"content\": \"The API gateway uses rate limiting at 1000 req/min\", \"importance\": 6, \"confidence\": 0.95, \"tags\": [\"infra\"], \"scope\": \"project\", \"entityRef\": \"project-dashboard\", \"structuredAttributes\": {\"rate_limit\": \"1000 req/min\"}}, {\"category\": \"reasoning_trace\", \"content\": \"How I chose the dashboard rewrite framework\", \"confidence\": 0.9, \"tags\": [\"frontend\"], \"scope\": \"project\", \"reasoningTrace\": {\"steps\": [{\"order\": 1, \"description\": \"Listed constraints: SSR needed, team mostly JS\"}, {\"order\": 2, \"description\": \"Ran a spike in Vue 3 — worked, but ecosystem felt thin for our needs\"}, {\"order\": 3, \"description\": \"Ran the same spike in React — integrated faster with Next.js\"}], \"finalAnswer\": \"Picked React with Next.js for SSR + ecosystem fit\"}}],\n  \"entities\": [{\"name\": \"person-sarah-chen\", \"type\": \"person\", \"facts\": [\"Leads the backend team\", \"Joined from Google in 2024\"], \"structuredSections\": [{\"key\": \"beliefs\", \"title\": \"Beliefs\", \"facts\": [\"Small teams should own whole systems.\"]}]}, {\"name\": \"project-dashboard\", \"type\": \"project\", \"facts\": [\"React-based admin panel\", \"Deployed on AWS ECS\"]}],\n  \"profileUpdates\": [\"User prefers TypeScript over plain JavaScript\"],\n  \"questions\": [{\"question\": \"What database does the analytics service use?\", \"context\": \"Came up during discussion of migration plan\", \"priority\": 0.5}],\n  \"relationships\": [{\"source\": \"person-sarah-chen\", \"target\": \"project-dashboard\", \"label\": \"leads development of\"}]\n}`,\n        },\n        { role: \"user\", content: conversation },\n      ],\n      ...tokenParams,\n    });\n\n    const content = response.choices?.[0]?.message?.content?.trim();\n    if (!content) {\n      log.info(`extractWithDirectClient: empty response — choices=${JSON.stringify(response.choices?.length ?? 0)} finishReason=${response.choices?.[0]?.finish_reason ?? \"n/a\"}`);\n      return null;\n    }\n\n    log.info(\n      `extractWithDirectClient: got response, length=${content.length}`,\n    );\n\n    for (const candidate of extractJsonCandidates(content)) {\n      try {\n        const parsed = JSON.parse(candidate);\n\n        return this.normalizeExtractionResultPayload(parsed);\n      } catch {\n        // keep trying candidates\n      }\n    }\n\n    log.info(`extractWithDirectClient: failed to parse JSON from response (first 200 chars: ${content.slice(0, 200)})`);\n    return null;\n  }\n\n  /**\n   * Extract partial facts from truncated JSON responses.\n   * Local LLMs sometimes hit token limits mid-JSON. This tries to salvage valid facts.\n   */\n  private extractPartialFacts(jsonStr: string): ExtractionResult {\n    const allowedCategories = new Set([\n      \"fact\",\n      \"preference\",\n      \"correction\",\n      \"entity\",\n      \"decision\",\n      \"relationship\",\n      \"principle\",\n      \"commitment\",\n      \"moment\",\n      \"skill\",\n      \"rule\",\n      \"procedure\",\n      \"reasoning_trace\",\n    ]);\n    const allowedEntityTypes = new Set([\n      \"person\",\n      \"project\",\n      \"tool\",\n      \"company\",\n      \"place\",\n      \"other\",\n    ]);\n\n    const facts: ExtractionResult[\"facts\"] = [];\n    const entities: ExtractionResult[\"entities\"] = [];\n\n    try {\n      // Find all complete fact objects (ones with all required fields)\n      const factRegex = /\\{\\s*\"category\"\\s*:\\s*\"([^\"]+)\"\\s*,\\s*\"content\"\\s*:\\s*\"([^\"]+)\"\\s*,\\s*\"confidence\"\\s*:\\s*([0-9.]+)/g;\n      let match;\n      while ((match = factRegex.exec(jsonStr)) !== null) {\n        const rawCat = match[1];\n        const category = allowedCategories.has(rawCat) ? (rawCat as ExtractionResult[\"facts\"][number][\"category\"]) : \"fact\";\n        facts.push({\n          category,\n          content: match[2].replace(/\\\\n/g, '\\n').replace(/\\\\\"/g, '\"'),\n          confidence: parseFloat(match[3]),\n          tags: [],\n        });\n      }\n\n      // Find all complete entity objects\n      const entityRegex = /\\{\\s*\"name\"\\s*:\\s*\"([^\"]+)\"\\s*,\\s*\"type\"\\s*:\\s*\"([^\"]+)\"/g;\n      while ((match = entityRegex.exec(jsonStr)) !== null) {\n        const rawType = match[2];\n        const type = allowedEntityTypes.has(rawType) ? (rawType as ExtractionResult[\"entities\"][number][\"type\"]) : \"other\";\n        entities.push({\n          name: match[1],\n          type,\n          facts: [],\n        });\n      }\n    } catch {\n      // Ignore regex errors\n    }\n\n    return { facts, entities, profileUpdates: [], questions: [] };\n  }\n\n  /**\n   * Build extraction instructions shared between local and cloud LLM.\n   */\n  private buildExtractionInstructions(existingEntities?: string[]): string {\n    return `You are a memory extraction system. Analyze the following conversation and extract durable, reusable memories.\n\nMemory categories:\n- fact: Objective information about the world\n- preference: User likes, dislikes, or stylistic choices\n- correction: User correcting a mistake or misconception (highest priority)\n- entity: Information about a specific person, project, tool, or company\n- decision: A choice that was made with rationale\n- relationship: How two entities relate to each other (e.g., \"Alice is Bob's manager\", \"Acme Corp uses Shopify\")\n- principle: Durable rules, values, or operating beliefs (e.g., \"never use Chat Completions API\")\n- commitment: Promises, obligations, or deadlines (e.g., \"deploy by Friday\", \"call accountant Monday\")\n- moment: Emotionally significant events or milestones (e.g., \"first successful deployment of engram\")\n- skill: Capabilities the user or agent has demonstrated (e.g., \"user is proficient with Kubernetes\")${this.config.causalRuleExtractionEnabled ? `\n- rule: Causal rules discovered through experience (format: \"IF <condition> THEN <action/outcome>\", e.g., \"IF Shopify API returns 401 THEN the admin token is missing read_products scope\")` : \"\"}\n- procedure: A reusable workflow the user wants remembered the same way across sessions. Set category to \"procedure\". Use \"content\" for a short title that includes explicit trigger phrasing (e.g. \"When you deploy to production…\", \"Whenever you ship a release…\"). Add \"procedureSteps\": an array of at least two objects {\"order\": number, \"intent\": \"concrete step description\"} in execution order. Optional per-step \"toolCall\": {\"kind\": \"…\", \"signature\": \"…\"}, \"expectedOutcome\", \"optional\": true.\n- reasoning_trace: A stored solution chain / chain-of-thought the user walked through to solve a problem (e.g. \"Here's how I debugged the latency spike: first I checked…, then I…, finally I…\"). Set category to \"reasoning_trace\". Use \"content\" for a short title summarising the problem (e.g. \"How I debugged the staging latency spike\"). Add \"reasoningTrace\": {\"steps\": [{\"order\": number, \"description\": \"what happened at this step\"}, …], \"finalAnswer\": \"the conclusion or answer\", \"observedOutcome\": \"optional confirmation of how it played out\"}. Require at least two ordered steps AND a finalAnswer. Use this category only when the user explicitly narrates their reasoning — not for ordinary decisions (use \"decision\") or reusable workflows (use \"procedure\").\n\nRules:\n- Only extract genuinely NEW information worth remembering across sessions\n- Skip transient task details (file paths being edited, current errors, etc.)\n- Priority: corrections > principles${this.config.causalRuleExtractionEnabled ? \" > rules\" : \"\"} > preferences > commitments > decisions > relationships > entities > moments > skills > facts\n- Corrections (user saying \"actually, don't do X\" or \"I prefer Y\") get highest confidence\n- Each fact should be a standalone, self-contained statement\n- Entity references should use normalized names (lowercase, hyphenated: \"jane-doe\", \"acme-corp\")\n- CRITICAL: Entity names must be CANONICAL. Always use the hyphenated multi-word form: \"acme-corp\" NOT \"acmecorp\" or \"acme\". \"jane-doe\" NOT \"janedoe\" or \"jane\". If unsure, prefer the most specific full name.\n- Avoid creating entities typed as \"other\" when a more specific type fits (company, project, tool, person, place)\n- When entity facts clearly belong under a durable named heading, add them to entity.structuredSections as {key, title, facts}. Example person headings: \"Beliefs\", \"Communication Style\", \"Building / Working On\". Leave structuredSections empty when no stable heading fits.\n- Tags should be concise and reusable (e.g., \"coding-style\", \"personal\", \"tools\")\n- When a fact contains measurable, categorical, or precisely valued data, include a \"structuredAttributes\" field with key-value string pairs (e.g., {\"price\": \"29.99\", \"brand\": \"Sony\"}, {\"date\": \"2024-03-15\", \"location\": \"SF\"}, {\"chosen\": \"PostgreSQL\", \"rejected\": \"MongoDB\"}). Only for concrete values, not narrative content.\n- Set confidence using these tiers:\n  * Explicit (0.95-1.0): Direct user statements — \"I prefer X\", \"my name is Y\"\n  * Implied (0.70-0.94): Strong contextual inference — user consistently does X, clear from conversation flow\n  * Inferred (0.40-0.69): Pattern recognition — reasonable guess from limited evidence\n  * Speculative (0.00-0.39): Tentative hypothesis — weak signal, needs future confirmation. Speculative memories auto-expire after 30 days if not confirmed.\n- For commitments: include any deadline or timeframe mentioned${this.config.extractionScopeClassificationEnabled ? `\n\nScope classification:\nFor each fact, set \"scope\" to one of:\n- \"global\" — knowledge that applies across projects: core framework/library bugs, API behavior patterns, user preferences (editor, language, style), tool configurations, general coding patterns, infrastructure knowledge, technology facts not tied to one codebase\n- \"project\" — knowledge specific to one codebase: file paths, environment configs, deployment details, project-specific workarounds, team/stakeholder info tied to one project, repo-specific conventions\nWhen in doubt, prefer \"project\" — it is safer to keep knowledge scoped narrowly.\nExamples:\n  \"Magento 2.4.8 has a race condition in checkout\" → \"global\"\n  \"User prefers dark mode in all editors\" → \"global\"\n  \"The staging server is at staging.acme.com\" → \"project\"\n  \"The deploy script lives at scripts/deploy.sh\" → \"project\"\n  \"PostgreSQL 15 requires the uuid-ossp extension for gen_random_uuid()\" → \"global\"\n  \"The acme-store repo uses a custom Webpack config for SSR\" → \"project\"` : \"\"}\n\nEntity creation rules (STRICT):\n- Only create entities for DURABLE things: real people, companies, products, tools, ongoing projects\n- NEVER create entities for transient items: individual PRs, branches, Jira tickets, meetings, agent task IDs, log files, database tables, cron job runs, sessions\n- When you learn something about a transient item (e.g., PR #58 fixed a bug), store it as a FACT with an entityRef to the parent project — do NOT create an entity for the PR itself\n- Prefer attaching facts to broad parent entities rather than creating sub-entities. E.g., \"acme-store uses Algolia for search\" is a fact on entity \"acme-store\", NOT a new entity \"acme-store-algolia-connector\"\n- The entity list should be SHORT — think \"things that would have their own Wikipedia page\" not \"things mentioned in passing\"\n\n${existingEntities && existingEntities.length > 0 ? `\nKNOWN ENTITIES (use these exact names when referencing existing things):\n${existingEntities.join(\", \")}\n\nWhen you see something that matches a known entity, use THAT name exactly. Only create a NEW entity if nothing in this list represents it.\n` : \"\"}\nAlso extract relationships between entities mentioned in the conversation.\n- Format: {source: \"entity-name\", target: \"entity-name\", label: \"relationship description\"}\n- Max 5 relationships per extraction\n- Only include clear, durable relationships (e.g., \"works at\", \"created\", \"manages\", \"uses\")\n- Use normalized entity names (e.g., \"person-jane-doe\", \"company-acme-corp\")\n\nAlso generate 1-3 genuine questions you're curious about based on this conversation. These should be things you'd actually want answers to in future sessions — not prompts, but real curiosity.\n\nFinally, write a brief identity reflection about the AGENT who had this conversation (not about you, the extraction system). Based on what the agent said and did in the conversation:\n- What communication patterns did the agent show? (e.g., proactive vs reactive, verbose vs concise)\n- Did the agent handle the user's needs well or miss something?\n- What behavioral tendencies are visible? (e.g., cautious, creative, thorough, impatient)\n- What could the agent improve next time?\nDo NOT write about the extraction process itself. Do NOT say things like \"I extracted durable facts\" — that's about YOUR job, not the agent's behavior.`;\n  }\n\n  async consolidate(\n    newMemories: MemoryFile[],\n    existingMemories: MemoryFile[],\n    currentProfile: string,\n  ): Promise<ConsolidationResult> {\n    const newList = newMemories\n      .map(\n        (m) =>\n          `[${m.frontmatter.id}] (${m.frontmatter.category}) ${m.content}`,\n      )\n      .join(\"\\n\");\n\n    const existingList = existingMemories\n      .slice(-50) // Only consolidate against recent memories\n      .map(\n        (m) =>\n          `[${m.frontmatter.id}] (${m.frontmatter.category}) ${m.content}`,\n      )\n      .join(\"\\n\");\n\n    const cTraceId = crypto.randomUUID();\n    this.emit({ kind: \"llm_start\", traceId: cTraceId, model: this.config.model, operation: \"consolidation\", input: newList });\n    const cStartTime = Date.now();\n\n    // Try local LLM first if enabled\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResult = await this.consolidateWithLocalLlm(newList, existingList, currentProfile);\n        if (localResult) {\n          const durationMs = Date.now() - cStartTime;\n          this.emit({ kind: \"llm_end\", traceId: cTraceId, model: this.config.localLlmModel, operation: \"consolidation\", durationMs });\n          log.debug(`consolidation: used local LLM — ${localResult.items.length} decisions`);\n          return this.sanitizeConsolidationResult(localResult);\n        }\n        if (!this.config.localLlmFallback) {\n          log.warn(\"consolidation: local LLM failed and fallback disabled\");\n          return { items: [], profileUpdates: [], entityUpdates: [] };\n        }\n        log.info(\"consolidation: local LLM unavailable, falling back to gateway AI\");\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          log.warn(\"consolidation: local LLM error and fallback disabled:\", err);\n          return { items: [], profileUpdates: [], entityUpdates: [] };\n        }\n        log.info(\"consolidation: local LLM error, falling back to gateway AI:\", err);\n      }\n    }\n\n    const fallbackResult = await this.parseWithGatewayFallback(\n      cTraceId,\n      \"consolidation\",\n      cStartTime,\n      ConsolidationResultSchema,\n      [\n        {\n          role: \"system\",\n          content: `You are a memory consolidation system. Compare new memories against existing ones and decide what to do with each.\n\nActions:\n- ADD: Keep the new memory as-is (no duplicate exists)\n- MERGE: Combine with an existing memory (provide mergeWith ID and updated content)\n- UPDATE: Replace existing memory content (provide updated content)\n- INVALIDATE: Remove existing memory (it's been superseded or is wrong)\n- SKIP: This new memory is redundant (exact duplicate or subset of existing)\n\nAlso:\n- Suggest profile updates based on patterns across memories\n- Identify entity updates for entity tracking${this.config.causalRuleExtractionEnabled ? `\n- When merging or updating memories, look for IF→THEN causal patterns. If a memory describes \"X failed/succeeded because Y\" or \"doing X led to Y\", rewrite its content to make the causal rule explicit in the form \"IF <condition> THEN <action/outcome>\".` : \"\"}`,\n        },\n        {\n          role: \"user\",\n          content: `Current behavioral profile:\n${currentProfile || \"(empty)\"}\n\nExisting memories:\n${existingList || \"(none)\"}\n\nNew memories to consolidate:\n${newList}\n\nConsolidate the new memories against existing ones.`,\n        },\n      ],\n      { temperature: 0.3, maxTokens: 4096 },\n    );\n    if (fallbackResult) {\n      log.debug(`consolidation: ${fallbackResult.items.length} decisions via fallback`);\n      return this.sanitizeConsolidationResult({\n        items: fallbackResult.items,\n        profileUpdates: fallbackResult.profileUpdates,\n        entityUpdates: fallbackResult.entityUpdates,\n      });\n    }\n\n    // Fall back to OpenAI API\n    if (!this.client) {\n      log.warn(\"consolidation skipped — no OpenAI API key and local LLM failed/disabled\");\n      return { items: [], profileUpdates: [], entityUpdates: [] };\n    }\n\n    try {\n      const instructionText = `You are a memory consolidation system. Compare new memories against existing ones and decide what to do with each.\n\nActions:\n- ADD: Keep the new memory as-is (no duplicate exists)\n- MERGE: Combine with an existing memory (provide mergeWith ID and updated content)\n- UPDATE: Replace existing memory content (provide updated content)\n- INVALIDATE: Remove existing memory (it's been superseded or is wrong)\n- SKIP: This new memory is redundant (exact duplicate or subset of existing)\n\nAlso:\n- Suggest profile updates based on patterns across memories\n- Identify entity updates for entity tracking${this.config.causalRuleExtractionEnabled ? `\n- When merging or updating memories, look for IF→THEN causal patterns. If a memory describes \"X failed/succeeded because Y\" or \"doing X led to Y\", rewrite its content to make the causal rule explicit in the form \"IF <condition> THEN <action/outcome>\".` : \"\"}\n\nCurrent behavioral profile:\n${currentProfile || \"(empty)\"}\n\nExisting memories:\n${existingList || \"(none)\"}\n\nNew memories to consolidate:\n${newList}\n\nRespond with valid JSON only, matching this schema:\n${CONSOLIDATION_RESPONSE_SCHEMA}`;\n\n      const response = await this.client.chat.completions.create({\n        model: this.config.model,\n        messages: [\n          { role: \"system\", content: instructionText },\n          { role: \"user\", content: \"Consolidate the new memories against existing ones.\" },\n        ],\n        ...(this.config.reasoningEffort !== \"none\" ? { reasoning_effort: this.config.reasoningEffort } : {}),\n        ...buildChatCompletionTokenLimit(this.config.model, 4096, {\n          assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n        }),\n      });\n\n      const rawContent = response.choices?.[0]?.message?.content?.trim();\n      const cDurationMs = Date.now() - cStartTime;\n      const cUsage = (response as any).usage;\n\n      let parsed: any = null;\n      if (rawContent) {\n        for (const candidate of extractJsonCandidates(rawContent)) {\n          try {\n            parsed = JSON.parse(candidate);\n            break;\n          } catch {\n            // keep trying candidates\n          }\n        }\n      }\n\n      this.emit({\n        kind: \"llm_end\", traceId: cTraceId, model: this.config.model, operation: \"consolidation\", durationMs: cDurationMs,\n        output: parsed ? JSON.stringify(parsed).slice(0, 2000) : undefined,\n        tokenUsage: cUsage ? { input: cUsage.prompt_tokens, output: cUsage.completion_tokens, total: cUsage.total_tokens } : undefined,\n      });\n\n      if (parsed && Array.isArray(parsed.items)) {\n        log.debug(\n          `consolidation: ${parsed.items.length} decisions`,\n        );\n        return this.sanitizeConsolidationResult({\n          items: parsed.items,\n          profileUpdates: Array.isArray(parsed.profileUpdates) ? parsed.profileUpdates : [],\n          entityUpdates: Array.isArray(parsed.entityUpdates) ? parsed.entityUpdates : [],\n        });\n      }\n\n      log.warn(\"consolidation returned no parsed output\");\n      return { items: [], profileUpdates: [], entityUpdates: [] };\n    } catch (err) {\n      this.emit({\n        kind: \"llm_error\", traceId: cTraceId, model: this.config.model, operation: \"consolidation\",\n        durationMs: Date.now() - cStartTime, error: String(err),\n      });\n      log.error(\"consolidation failed\", err);\n      return { items: [], profileUpdates: [], entityUpdates: [] };\n    }\n  }\n\n  /**\n   * Consolidate memories using local LLM.\n   */\n  private async consolidateWithLocalLlm(\n    newList: string,\n    existingList: string,\n    currentProfile: string,\n  ): Promise<ConsolidationResult | null> {\n    // Get dynamic context sizes\n    const contextSizes = this.modelRegistry.calculateContextSizes(\n      this.config.localLlmModel,\n      this.config.localLlmMaxContext\n    );\n    log.debug(`Consolidation model context: ${contextSizes.description}`);\n\n    const prompt = `You are a memory consolidation system. Compare new memories against existing ones and decide what to do with each.\n\nActions:\n- ADD: Keep the new memory as-is (no duplicate exists)\n- MERGE: Combine with an existing memory (provide mergeWith ID and updated content)\n- UPDATE: Replace existing memory content (provide updated content)\n- INVALIDATE: Remove existing memory (it's been superseded or is wrong)\n- SKIP: This new memory is redundant (exact duplicate or subset of existing)\n\nAlso:\n- Suggest profile updates based on patterns across memories\n- Identify entity updates for entity tracking${this.config.causalRuleExtractionEnabled ? `\n- When merging or updating memories, look for IF→THEN causal patterns. If a memory describes \"X failed/succeeded because Y\" or \"doing X led to Y\", rewrite its content to make the causal rule explicit in the form \"IF <condition> THEN <action/outcome>\".` : \"\"}\n\nCurrent behavioral profile:\n${currentProfile || \"(empty)\"}\n\nExisting memories:\n${existingList || \"(none)\"}\n\nNew memories to consolidate:\n${newList}\n\nRespond with valid JSON matching this schema:\n${CONSOLIDATION_RESPONSE_SCHEMA}`;\n\n    const response = await this.localLlm.chatCompletion(\n      [\n        { role: \"system\", content: \"You are a memory consolidation system. Output valid JSON only.\" },\n        { role: \"user\", content: prompt },\n      ],\n      {\n        temperature: 0.3,\n        maxTokens: contextSizes.maxOutputTokens,\n        operation: \"consolidation\",\n        priority: \"background\",\n      },\n    );\n\n    if (!response?.content) {\n      return null;\n    }\n\n    try {\n      const content = response.content.trim();\n      for (const candidate of extractJsonCandidates(content)) {\n        try {\n          const parsed = JSON.parse(candidate);\n          return {\n            items: Array.isArray((parsed as any).items) ? (parsed as any).items : [],\n            profileUpdates: Array.isArray((parsed as any).profileUpdates)\n              ? (parsed as any).profileUpdates\n              : [],\n            entityUpdates: Array.isArray((parsed as any).entityUpdates)\n              ? (parsed as any).entityUpdates\n              : [],\n          } as ConsolidationResult;\n        } catch {\n          // keep trying candidates\n        }\n      }\n      return null;\n    } catch (err) {\n      log.warn(\"local LLM consolidation: failed to parse JSON response:\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Consolidate a bloated profile.md into a compact version.\n   * The LLM merges duplicates, removes stale info, and preserves section structure.\n   * Returns the consolidated markdown or null on failure.\n   */\n  async consolidateProfile(\n    fullProfileContent: string,\n    targetLines: number = 50,\n  ): Promise<{ consolidatedProfile: string; removedCount: number; summary: string } | null> {\n    const pTraceId = crypto.randomUUID();\n    this.emit({ kind: \"llm_start\", traceId: pTraceId, model: this.config.model, operation: \"profile_consolidation\", input: fullProfileContent.slice(0, 2000) });\n    const pStartTime = Date.now();\n\n    // Try local LLM first if enabled\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResult = await this.consolidateProfileWithLocalLlm(fullProfileContent, targetLines);\n        if (localResult) {\n          const durationMs = Date.now() - pStartTime;\n          this.emit({ kind: \"llm_end\", traceId: pTraceId, model: this.config.localLlmModel, operation: \"profile_consolidation\", durationMs });\n          log.debug(`profile consolidation: used local LLM — removed ${localResult.removedCount} items`);\n          return localResult;\n        }\n        if (!this.config.localLlmFallback) {\n          log.warn(\"profile consolidation: local LLM failed and fallback disabled\");\n          return null;\n        }\n        log.info(\"profile consolidation: local LLM unavailable, falling back to gateway AI\");\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          log.warn(\"profile consolidation: local LLM error and fallback disabled:\", err);\n          return null;\n        }\n        log.info(\"profile consolidation: local LLM error, falling back to gateway AI:\", err);\n      }\n    }\n\n    const profileFallback = await this.parseWithGatewayFallback(\n      pTraceId,\n      \"profile_consolidation\",\n      pStartTime,\n      buildProfileConsolidationResultSchema(targetLines),\n      [\n        {\n          role: \"system\",\n          content: `You are a profile consolidation system. You are given a behavioral profile (markdown) that has grown too large. Your job is to produce a CONSOLIDATED version that:\n\n1. PRESERVES all ## section headers and their structure\n2. MERGES duplicate or near-duplicate bullet points into single, clear statements\n3. REMOVES stale information that has been superseded by newer bullets\n4. REMOVES trivial or overly specific operational details that won't be useful across sessions\n5. KEEPS the most important, durable observations about the user's preferences, habits, identity, and working style\n6. Target roughly ${targetLines} lines — this is a soft target, prioritize quality over length\n7. Write in the same style as the existing profile — concise bullets, no fluff\n\nThe output should be the COMPLETE consolidated profile as valid markdown, starting with \"# Behavioral Profile\".`,\n        },\n        { role: \"user\", content: fullProfileContent },\n      ],\n      { temperature: 0.3, maxTokens: 4096 },\n    );\n    if (profileFallback) {\n      log.debug(\n        `profile consolidation: removed ${profileFallback.removedCount} items — ${profileFallback.summary} (fallback)`,\n      );\n      return profileFallback;\n    }\n\n    // Fall back to OpenAI API\n    if (!this.client) {\n      log.warn(\"profile consolidation skipped — no OpenAI API key and local LLM failed/disabled\");\n      return null;\n    }\n\n    try {\n      const instructionText = `You are a profile consolidation system. You are given a behavioral profile (markdown) that has grown too large. Your job is to produce a CONSOLIDATED version that:\n\n1. PRESERVES all ## section headers and their structure\n2. MERGES duplicate or near-duplicate bullet points into single, clear statements\n3. REMOVES stale information that has been superseded by newer bullets\n4. REMOVES trivial or overly specific operational details that won't be useful across sessions\n5. KEEPS the most important, durable observations about the user's preferences, habits, identity, and working style\n6. Target roughly ${targetLines} lines — this is a soft target, prioritize quality over length\n7. Write in the same style as the existing profile — concise bullets, no fluff\n\nThe output should be the COMPLETE consolidated profile as valid markdown, starting with \"# Behavioral Profile\".\n\nRespond with valid JSON matching this schema:\n{\n  \"consolidatedProfile\": \"# Behavioral Profile\\\\n\\\\n... (complete markdown)\",\n  \"removedCount\": 42,\n  \"summary\": \"brief summary of what was consolidated\"\n}`;\n\n      const response = await this.client.chat.completions.create({\n        model: this.config.model,\n        messages: [\n          { role: \"system\", content: instructionText },\n          { role: \"user\", content: fullProfileContent },\n        ],\n        ...(this.config.reasoningEffort !== \"none\" ? { reasoning_effort: this.config.reasoningEffort } : {}),\n        ...buildChatCompletionTokenLimit(this.config.model, 4096, {\n          assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n        }),\n      });\n\n      const rawContent = response.choices?.[0]?.message?.content?.trim();\n      const pDurationMs = Date.now() - pStartTime;\n      const pUsage = (response as any).usage;\n\n      let parsed: any = null;\n      if (rawContent) {\n        for (const candidate of extractJsonCandidates(rawContent)) {\n          try {\n            parsed = JSON.parse(candidate);\n            break;\n          } catch {\n            // keep trying candidates\n          }\n        }\n      }\n\n      this.emit({\n        kind: \"llm_end\", traceId: pTraceId, model: this.config.model, operation: \"profile_consolidation\", durationMs: pDurationMs,\n        output: parsed ? parsed.summary : undefined,\n        tokenUsage: pUsage ? { input: pUsage.prompt_tokens, output: pUsage.completion_tokens, total: pUsage.total_tokens } : undefined,\n      });\n\n      if (parsed && typeof parsed.consolidatedProfile === \"string\") {\n        log.debug(\n          `profile consolidation: removed ${parsed.removedCount ?? 0} items — ${parsed.summary ?? \"\"}`,\n        );\n        return {\n          consolidatedProfile: parsed.consolidatedProfile,\n          removedCount: Number(parsed.removedCount || 0),\n          summary: String(parsed.summary || \"\"),\n        };\n      }\n\n      log.warn(\"profile consolidation returned no parsed output\");\n      return null;\n    } catch (err) {\n      this.emit({\n        kind: \"llm_error\", traceId: pTraceId, model: this.config.model, operation: \"profile_consolidation\",\n        durationMs: Date.now() - pStartTime, error: String(err),\n      });\n      log.error(\"profile consolidation failed\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Consolidate profile using local LLM.\n   */\n  private async consolidateProfileWithLocalLlm(\n    fullProfileContent: string,\n    targetLines: number = 50,\n  ): Promise<{ consolidatedProfile: string; removedCount: number; summary: string } | null> {\n    // Get dynamic context sizes\n    const contextSizes = this.modelRegistry.calculateContextSizes(\n      this.config.localLlmModel,\n      this.config.localLlmMaxContext\n    );\n    log.debug(`Profile consolidation model context: ${contextSizes.description}`);\n\n    const prompt = `You are a profile consolidation system. You are given a behavioral profile (markdown) that has grown too large. Your job is to produce a CONSOLIDATED version that:\n\n1. PRESERVES all ## section headers and their structure\n2. MERGES duplicate or near-duplicate bullet points into single, clear statements\n3. REMOVES stale information that has been superseded by newer bullets\n4. REMOVES trivial or overly specific operational details that won't be useful across sessions\n5. KEEPS the most important, durable observations about the user's preferences, habits, identity, and working style\n6. Target roughly ${targetLines} lines — this is a soft target, prioritize quality over length\n7. Write in the same style as the existing profile — concise bullets, no fluff\n\nProfile to consolidate:\n${fullProfileContent}\n\nRespond with valid JSON matching this schema:\n{\n  \"consolidatedProfile\": \"# Behavioral Profile\\\\n\\\\n... (complete markdown)\",\n  \"removedCount\": 42,\n  \"summary\": \"brief summary of what was consolidated\"\n}`;\n\n    const response = await this.localLlm.chatCompletion(\n      [\n        { role: \"system\", content: \"You are a profile consolidation system. Output valid JSON only.\" },\n        { role: \"user\", content: prompt },\n      ],\n      {\n        temperature: 0.3,\n        maxTokens: contextSizes.maxOutputTokens,\n        operation: \"profile_consolidation\",\n        priority: \"background\",\n      },\n    );\n\n    if (!response?.content) {\n      return null;\n    }\n\n    try {\n      const content = response.content.trim();\n      for (const candidate of extractJsonCandidates(content)) {\n        try {\n          const parsed = JSON.parse(candidate);\n          return {\n            consolidatedProfile: String((parsed as any).consolidatedProfile || \"\"),\n            removedCount: Number((parsed as any).removedCount || 0),\n            summary: String((parsed as any).summary || \"\"),\n          };\n        } catch {\n          // keep trying candidates\n        }\n      }\n      return null;\n    } catch (err) {\n      log.warn(\"local LLM profile consolidation: failed to parse JSON response:\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Consolidate IDENTITY.md reflections into a concise \"Learned Patterns\" section.\n   * Returns the new content for the IDENTITY.md file (everything below the static header).\n   */\n  async consolidateIdentity(\n    fullIdentityContent: string,\n    staticHeaderEndMarker: string,\n  ): Promise<{ learnedPatterns: string[]; summary: string } | null> {\n    const iTraceId = crypto.randomUUID();\n    this.emit({ kind: \"llm_start\", traceId: iTraceId, model: this.config.model, operation: \"identity_consolidation\", input: fullIdentityContent.slice(0, 2000) });\n    const iStartTime = Date.now();\n\n    // Try local LLM first if enabled\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResult = await this.consolidateIdentityWithLocalLlm(fullIdentityContent);\n        if (localResult) {\n          const durationMs = Date.now() - iStartTime;\n          this.emit({ kind: \"llm_end\", traceId: iTraceId, model: this.config.localLlmModel, operation: \"identity_consolidation\", durationMs });\n          log.debug(`identity consolidation: used local LLM — ${localResult.learnedPatterns.length} patterns`);\n          return localResult;\n        }\n        if (!this.config.localLlmFallback) {\n          log.warn(\"identity consolidation: local LLM failed and fallback disabled\");\n          return null;\n        }\n        log.info(\"identity consolidation: local LLM unavailable, falling back to gateway AI\");\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          log.warn(\"identity consolidation: local LLM error and fallback disabled:\", err);\n          return null;\n        }\n        log.info(\"identity consolidation: local LLM error, falling back to gateway AI:\", err);\n      }\n    }\n\n    const identityFallback = await this.parseWithGatewayFallback(\n      iTraceId,\n      \"identity_consolidation\",\n      iStartTime,\n      IdentityConsolidationResultSchema,\n      [\n        {\n          role: \"system\",\n          content: `You are an identity consolidation system. You are given the full contents of an IDENTITY.md file that contains many individual reflection entries. Your job is to:\n\n1. Read all the reflection entries (sections starting with \"## Reflection\")\n2. Extract the most important, durable behavioral patterns and lessons learned\n3. Consolidate them into concise, standalone statements (aim for 10-25 key patterns)\n4. Remove redundancy — if multiple reflections say the same thing, merge into one clear statement\n5. Prioritize patterns that are actionable and recurring over one-off observations\n6. Write a brief summary paragraph\n\nThe goal is to reduce a bloated file to a compact, high-signal set of learned patterns while preserving all genuinely useful self-knowledge.`,\n        },\n        { role: \"user\", content: fullIdentityContent },\n      ],\n      { temperature: 0.3, maxTokens: 4096 },\n    );\n    if (identityFallback) {\n      log.debug(\n        `identity consolidation: ${identityFallback.learnedPatterns.length} patterns (fallback)`,\n      );\n      return identityFallback;\n    }\n\n    // Fall back to OpenAI API\n    if (!this.client) {\n      log.warn(\"identity consolidation skipped — no OpenAI API key and local LLM failed/disabled\");\n      return null;\n    }\n\n    try {\n      const instructionText = `You are an identity consolidation system. You are given the full contents of an IDENTITY.md file that contains many individual reflection entries. Your job is to:\n\n1. Read all the reflection entries (sections starting with \"## Reflection\")\n2. Extract the most important, durable behavioral patterns and lessons learned\n3. Consolidate them into concise, standalone statements (aim for 10-25 key patterns)\n4. Remove redundancy — if multiple reflections say the same thing, merge into one clear statement\n5. Prioritize patterns that are actionable and recurring over one-off observations\n6. Write a brief summary paragraph\n\nThe goal is to reduce a bloated file to a compact, high-signal set of learned patterns while preserving all genuinely useful self-knowledge.\n\nRespond with valid JSON matching this schema:\n{\n  \"learnedPatterns\": [\"pattern 1\", \"pattern 2\", \"pattern 3\"],\n  \"summary\": \"brief summary of consolidation\"\n}`;\n\n      const response = await this.client.chat.completions.create({\n        model: this.config.model,\n        messages: [\n          { role: \"system\", content: instructionText },\n          { role: \"user\", content: fullIdentityContent },\n        ],\n        ...(this.config.reasoningEffort !== \"none\" ? { reasoning_effort: this.config.reasoningEffort } : {}),\n        ...buildChatCompletionTokenLimit(this.config.model, 4096, {\n          assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n        }),\n      });\n\n      const rawContent = response.choices?.[0]?.message?.content?.trim();\n      const iDurationMs = Date.now() - iStartTime;\n      const iUsage = (response as any).usage;\n\n      let parsed: any = null;\n      if (rawContent) {\n        for (const candidate of extractJsonCandidates(rawContent)) {\n          try {\n            parsed = JSON.parse(candidate);\n            break;\n          } catch {\n            // keep trying candidates\n          }\n        }\n      }\n\n      this.emit({\n        kind: \"llm_end\", traceId: iTraceId, model: this.config.model, operation: \"identity_consolidation\", durationMs: iDurationMs,\n        output: parsed ? parsed.summary : undefined,\n        tokenUsage: iUsage ? { input: iUsage.prompt_tokens, output: iUsage.completion_tokens, total: iUsage.total_tokens } : undefined,\n      });\n\n      if (parsed && Array.isArray(parsed.learnedPatterns)) {\n        const learnedPatterns = parsed.learnedPatterns\n          .filter((pattern: unknown) => typeof pattern === \"string\")\n          .map((pattern: string) => pattern.trim())\n          .filter((pattern: string) => pattern.length > 0);\n        log.debug(\n          `identity consolidation: ${learnedPatterns.length} patterns`,\n        );\n        return {\n          learnedPatterns,\n          summary: String(parsed.summary || \"\"),\n        };\n      }\n\n      log.warn(\"identity consolidation returned no parsed output\");\n      return null;\n    } catch (err) {\n      this.emit({\n        kind: \"llm_error\", traceId: iTraceId, model: this.config.model, operation: \"identity_consolidation\",\n        durationMs: Date.now() - iStartTime, error: String(err),\n      });\n      log.error(\"identity consolidation failed\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Consolidate identity using local LLM.\n   */\n  private async consolidateIdentityWithLocalLlm(\n    fullIdentityContent: string,\n  ): Promise<{ learnedPatterns: string[]; summary: string } | null> {\n    // Get dynamic context sizes\n    const contextSizes = this.modelRegistry.calculateContextSizes(\n      this.config.localLlmModel,\n      this.config.localLlmMaxContext\n    );\n    log.debug(`Identity consolidation model context: ${contextSizes.description}`);\n\n    const prompt = `You are an identity consolidation system. You are given the full contents of an IDENTITY.md file that contains many individual reflection entries. Your job is to:\n\n1. Read all the reflection entries (sections starting with \"## Reflection\")\n2. Extract the most important, durable behavioral patterns and lessons learned\n3. Consolidate them into concise, standalone statements (aim for 10-25 key patterns)\n4. Remove redundancy — if multiple reflections say the same thing, merge into one clear statement\n5. Prioritize patterns that are actionable and recurring over one-off observations\n6. Write a brief summary paragraph\n\nThe goal is to reduce a bloated file to a compact, high-signal set of learned patterns while preserving all genuinely useful self-knowledge.\n\nIDENTITY.md content:\n${fullIdentityContent}\n\nRespond with valid JSON matching this schema:\n{\n  \"learnedPatterns\": [\"pattern 1\", \"pattern 2\", \"pattern 3\"],\n  \"summary\": \"brief summary of consolidation\"\n}`;\n\n    const response = await this.localLlm.chatCompletion(\n      [\n        { role: \"system\", content: \"You are an identity consolidation system. Output valid JSON only.\" },\n        { role: \"user\", content: prompt },\n      ],\n      {\n        temperature: 0.3,\n        maxTokens: contextSizes.maxOutputTokens,\n        operation: \"identity_consolidation\",\n        priority: \"background\",\n      },\n    );\n\n    if (!response?.content) {\n      return null;\n    }\n\n    try {\n      const content = response.content.trim();\n      for (const candidate of extractJsonCandidates(content)) {\n        try {\n          const parsed = JSON.parse(candidate);\n          return {\n            learnedPatterns: Array.isArray((parsed as any).learnedPatterns)\n              ? (parsed as any).learnedPatterns\n              : [],\n            summary: String((parsed as any).summary || \"\"),\n          };\n        } catch {\n          // keep trying candidates\n        }\n      }\n      return null;\n    } catch (err) {\n      log.warn(\"local LLM identity consolidation: failed to parse JSON response:\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Verify if two memories contradict each other using LLM.\n   * Called when QMD finds semantically similar memories (Phase 2B).\n   */\n  async verifyContradiction(\n    newMemory: { content: string; category: string },\n    existingMemory: { id: string; content: string; category: string; created: string },\n  ): Promise<ContradictionVerificationResult | null> {\n    const input = `Memory 1 (existing, created ${existingMemory.created}):\nCategory: ${existingMemory.category}\nContent: ${existingMemory.content}\n\nMemory 2 (new):\nCategory: ${newMemory.category}\nContent: ${newMemory.content}`;\n\n    try {\n      const instructionText = `You are a contradiction detection system. Analyze whether two memories contradict each other.\n\nIMPORTANT: Not all similar memories are contradictions!\n- \"User likes TypeScript\" and \"User likes Python\" are NOT contradictions (preferences can coexist)\n- \"User prefers dark mode\" and \"User prefers light mode\" ARE contradictions (mutually exclusive)\n- \"User's email is a@b.com\" and \"User's email is c@d.com\" ARE contradictions (only one email)\n- \"User works at Acme\" and \"User used to work at Acme\" might be a contradiction (temporal change)\n\nOnly mark as contradiction if the two statements CANNOT both be true at the same time.\n\nIf they ARE contradictory, determine which represents the more recent/current state based on:\n- Explicit time references (\"now\", \"currently\", \"used to\", \"no longer\")\n- The fact that newer corrections often start with \"actually\" or \"correction\"\n- Context clues about change over time\n\nRespond with valid JSON matching this schema:\n{\n  \"isContradiction\": true,\n  \"confidence\": 0.95,\n  \"reasoning\": \"why they contradict or don't\",\n  \"whichIsNewer\": \"first\"\n}`;\n\n      if (this.shouldUseLocalLlm) {\n        try {\n          const localResponse = await this.localLlm.chatCompletion(\n            [\n              { role: \"system\", content: instructionText },\n              { role: \"user\", content: input },\n            ],\n            {\n              temperature: 0.3,\n              maxTokens: 2048,\n              operation: \"contradiction_verification\",\n              priority: \"background\",\n            },\n          );\n          const normalized = this.normalizeContradictionVerificationResult(\n            this.parseJsonObject(localResponse?.content),\n          );\n          if (normalized) {\n            log.debug(\n              `contradiction check via local LLM: ${normalized.isContradiction ? \"YES\" : \"NO\"} (confidence: ${normalized.confidence})`,\n            );\n            return normalized;\n          }\n          if (!this.config.localLlmFallback) {\n            log.warn(\"contradiction verification skipped — local LLM returned invalid JSON and cloud fallback is disabled\");\n            return null;\n          }\n        } catch (err) {\n          if (!this.config.localLlmFallback) {\n            log.warn(`contradiction verification skipped — local LLM failed and cloud fallback is disabled: ${err}`);\n            return null;\n          }\n        }\n      }\n\n      if (!this.shouldUseDirectClient) {\n        const fallbackResponse = await this.fallbackLlm.chatCompletion(\n          [\n            { role: \"system\", content: instructionText },\n            { role: \"user\", content: input },\n          ],\n          this.withGatewayAgent({ temperature: 0.3, maxTokens: 2048 }),\n        );\n        const normalized = this.normalizeContradictionVerificationResult(\n          this.parseJsonObject(fallbackResponse?.content),\n        );\n        if (normalized) {\n          log.debug(\n            `contradiction check via fallback: ${normalized.isContradiction ? \"YES\" : \"NO\"} (confidence: ${normalized.confidence})`,\n          );\n          return normalized;\n        }\n        log.warn(\"contradiction verification skipped — no OpenAI API key and fallback unavailable\");\n        return null;\n      }\n\n      const response = await this.client!.chat.completions.create({\n        model: this.config.model,\n        messages: [\n          { role: \"system\", content: instructionText },\n          { role: \"user\", content: input },\n        ],\n        ...buildChatCompletionTokenLimit(this.config.model, 2048, {\n          assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n        }),\n      });\n\n      const normalized = this.normalizeContradictionVerificationResult(\n        this.parseJsonObject(response.choices?.[0]?.message?.content),\n      );\n      if (normalized) {\n        log.debug(\n          `contradiction check: ${normalized.isContradiction ? \"YES\" : \"NO\"} (confidence: ${normalized.confidence})`,\n        );\n        return normalized;\n      }\n\n      return null;\n    } catch (err) {\n      log.error(\"contradiction verification failed\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Suggest links between a new memory and existing memories (Phase 3A).\n   * Called during extraction to build the knowledge graph.\n   */\n  async suggestLinks(\n    newMemory: { content: string; category: string },\n    candidateMemories: Array<{ id: string; content: string; category: string }>,\n  ): Promise<SuggestedLinks | null> {\n    if (candidateMemories.length === 0) {\n      return { links: [] };\n    }\n\n    const candidateList = candidateMemories\n      .map((m, i) => `[${i + 1}] ID: ${m.id}\\nCategory: ${m.category}\\nContent: ${m.content}`)\n      .join(\"\\n\\n\");\n\n    const input = `New memory:\nCategory: ${newMemory.category}\nContent: ${newMemory.content}\n\nCandidate memories to link to:\n${candidateList}`;\n\n    try {\n      const instructionText = `You are a memory linking system. Analyze the new memory and suggest relationships to existing memories.\n\nLink types:\n- follows: This memory is a continuation or next step (e.g., decision follows discussion)\n- references: This memory mentions or refers to the other (e.g., fact references entity)\n- contradicts: This memory conflicts with the other (use sparingly, only for true contradictions)\n- supports: This memory provides evidence or reinforcement (e.g., example supports principle)\n- related: General topical relationship\n\nRules:\n- Only suggest links with strength > 0.5\n- Quality over quantity — 0-3 links is typical\n- Prefer specific link types over generic \"related\"\n- Consider entity references, topics, and causal relationships\n\nRespond with valid JSON matching this schema:\n{\n  \"links\": [{\"targetId\": \"memory-id\", \"linkType\": \"follows|references|contradicts|supports|related\", \"strength\": 0.8, \"reason\": \"why\"}]\n}`;\n\n      if (this.shouldUseLocalLlm) {\n        try {\n          const localResponse = await this.localLlm.chatCompletion(\n            [\n              { role: \"system\", content: instructionText },\n              { role: \"user\", content: input },\n            ],\n            {\n              temperature: 0.3,\n              maxTokens: 2048,\n              operation: \"link_suggestion\",\n              priority: \"background\",\n            },\n          );\n          const normalized = this.normalizeSuggestedLinksResult(this.parseJsonObject(localResponse?.content));\n          if (normalized) {\n            log.debug(`suggested ${normalized.links.length} links via local LLM`);\n            return normalized;\n          }\n          if (!this.config.localLlmFallback) {\n            log.warn(\"link suggestion skipped — local LLM returned invalid JSON and cloud fallback is disabled\");\n            return null;\n          }\n        } catch (err) {\n          if (!this.config.localLlmFallback) {\n            log.warn(`link suggestion skipped — local LLM failed and cloud fallback is disabled: ${err}`);\n            return null;\n          }\n        }\n      }\n\n      if (!this.shouldUseDirectClient) {\n        const fallbackResponse = await this.fallbackLlm.chatCompletion(\n          [\n            { role: \"system\", content: instructionText },\n            { role: \"user\", content: input },\n          ],\n          this.withGatewayAgent({ temperature: 0.3, maxTokens: 2048 }),\n        );\n        const normalized = this.normalizeSuggestedLinksResult(this.parseJsonObject(fallbackResponse?.content));\n        if (normalized) {\n          log.debug(`suggested ${normalized.links.length} links via fallback`);\n          return normalized;\n        }\n        log.warn(\"link suggestion skipped — no OpenAI API key and fallback unavailable\");\n        return null;\n      }\n\n      const response = await this.client!.chat.completions.create({\n        model: this.config.model,\n        messages: [\n          { role: \"system\", content: instructionText },\n          { role: \"user\", content: input },\n        ],\n        ...buildChatCompletionTokenLimit(this.config.model, 2048, {\n          assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n        }),\n      });\n\n      const normalized = this.normalizeSuggestedLinksResult(\n        this.parseJsonObject(response.choices?.[0]?.message?.content),\n      );\n      if (normalized) {\n        log.debug(`suggested ${normalized.links.length} links`);\n        return normalized;\n      }\n\n      return null;\n    } catch (err) {\n      log.error(\"link suggestion failed\", err);\n      return null;\n    }\n  }\n\n  async generateDaySummary(memories: string | MemoryFile[]): Promise<DaySummaryResultShape | null> {\n    if (!this.config.daySummaryEnabled) {\n      log.warn(\"day summary skipped — disabled by config\");\n      return null;\n    }\n\n    const memoryContext = formatDaySummaryMemories(memories);\n    if (memoryContext.length === 0) return null;\n\n    const instructionText = await loadDaySummaryPrompt();\n\n    // Append extension footer when extensions are active (#382)\n    let extensionsFooter = \"\";\n    try {\n      extensionsFooter = await buildExtensionsFooterForSummary(this.config);\n    } catch {\n      // Non-fatal: skip extension footer if discovery fails\n    }\n\n    const userPrompt = `Generate an end-of-day summary from this Remnic memory context:\n\n${memoryContext}${extensionsFooter.length > 0 ? `\\n\\n${extensionsFooter}` : \"\"}`;\n    const traceId = crypto.randomUUID();\n    const startedAt = Date.now();\n    this.emit({ kind: \"llm_start\", traceId, model: this.config.model, operation: \"day_summary\", input: memoryContext.slice(0, 4000) });\n\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResponse = await this.localLlm.chatCompletion(\n          [\n            { role: \"system\", content: `${instructionText}\n\nReturn valid JSON only.` },\n            { role: \"user\", content: userPrompt },\n          ],\n          {\n            temperature: 0.2,\n            maxTokens: 2048,\n            operation: \"day_summary\",\n            priority: \"background\",\n          },\n        );\n        const normalized = this.normalizeDaySummaryResult(this.parseJsonObject(localResponse?.content));\n        if (normalized) {\n          this.emit({ kind: \"llm_end\", traceId, model: this.config.localLlmModel, operation: \"day_summary\", durationMs: Date.now() - startedAt, output: JSON.stringify(normalized).slice(0, 2000) });\n          log.debug(`generated day summary via local LLM (${normalized.bullets.length} bullets)`);\n          return normalized;\n        }\n        if (!this.config.localLlmFallback) {\n          this.emit({ kind: \"llm_error\", traceId, model: this.config.localLlmModel, operation: \"day_summary\", durationMs: Date.now() - startedAt, error: \"local LLM returned invalid JSON and fallback disabled\" });\n          log.warn(\"day summary skipped — local LLM returned invalid JSON and fallback disabled\");\n          return null;\n        }\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          this.emit({ kind: \"llm_error\", traceId, model: this.config.localLlmModel, operation: \"day_summary\", durationMs: Date.now() - startedAt, error: String(err) });\n          log.warn(`day summary skipped — local LLM failed and fallback disabled: ${err}`);\n          return null;\n        }\n      }\n    }\n\n    const fallbackResult = await this.parseWithGatewayFallback(\n      traceId,\n      \"day_summary\",\n      startedAt,\n      DaySummaryResultSchema,\n      [\n        { role: \"system\", content: `${instructionText}\n\nReturn valid JSON only.` },\n        { role: \"user\", content: userPrompt },\n      ],\n      { temperature: 0.2, maxTokens: 2048 },\n    );\n    if (fallbackResult) {\n      const normalized = this.normalizeDaySummaryResult(fallbackResult);\n      if (normalized) {\n        log.debug(`generated day summary via fallback (${normalized.bullets.length} bullets)`);\n        return normalized;\n      }\n    }\n\n    // Direct Responses API fallback (AGENTS.md-compliant: never Chat Completions)\n    if (this.shouldUseDirectClient) {\n      try {\n        const response = await (this.client as any).responses.create({\n          model: this.config.model,\n          instructions: `${instructionText}\\n\\nReturn valid JSON only.`,\n          input: userPrompt,\n          max_output_tokens: 2048,\n        });\n        const rawText = typeof response.output_text === \"string\" ? response.output_text : JSON.stringify(response.output_text ?? \"\");\n        const normalized = this.normalizeDaySummaryResult(this.parseJsonObject(rawText));\n        if (normalized) {\n          this.emit({ kind: \"llm_end\", traceId, model: this.config.model, operation: \"day_summary\", durationMs: Date.now() - startedAt, output: JSON.stringify(normalized).slice(0, 2000) });\n          log.debug(`generated day summary via Responses API (${normalized.bullets.length} bullets)`);\n          return normalized;\n        }\n        this.emit({ kind: \"llm_error\", traceId, model: this.config.model, operation: \"day_summary\", durationMs: Date.now() - startedAt, error: \"Responses API returned unparseable output\" });\n      } catch (err) {\n        this.emit({ kind: \"llm_error\", traceId, model: this.config.model, operation: \"day_summary\", durationMs: Date.now() - startedAt, error: `Responses API failed: ${err}` });\n      }\n    }\n\n    this.emit({ kind: \"llm_error\", traceId, model: this.config.model, operation: \"day_summary\", durationMs: Date.now() - startedAt, error: \"all generation paths exhausted (local LLM + gateway + Responses API)\" });\n    log.warn(\"day summary skipped — all generation paths exhausted\");\n    return null;\n  }\n\n\n  /**\n   * Summarize a batch of old memories into a compact summary (Phase 4A).\n   */\n  async summarizeMemories(\n    memories: Array<{ id: string; content: string; category: string; created: string }>,\n  ): Promise<MemorySummaryResult | null> {\n    if (memories.length === 0) return null;\n\n    const memoryList = memories\n      .map((m) => `[${m.id}] (${m.category}, ${m.created.slice(0, 10)})\\n${m.content}`)\n      .join(\"\\n\\n\");\n\n    try {\n      const instructionText = `You are a memory summarization system. You are given a batch of old memories that need to be compressed into a summary.\n\nYour task:\n1. Write a concise summary paragraph (2-4 sentences) capturing the essence of these memories\n2. Extract the 5-10 most important facts that should be preserved\n3. List the key entities mentioned\n\nGuidelines:\n- Preserve specific, actionable information\n- Merge redundant details into single statements\n- Focus on durable insights, not transient details\n- Maintain any preferences, decisions, or corrections as key facts\n\nRespond with valid JSON matching this schema:\n{\n  \"summaryText\": \"concise summary paragraph\",\n  \"keyFacts\": [\"fact 1\", \"fact 2\"],\n  \"keyEntities\": [\"entity-1\", \"entity-2\"]\n}`;\n\n      if (this.shouldUseLocalLlm) {\n        try {\n          const localResponse = await this.localLlm.chatCompletion(\n            [\n              { role: \"system\", content: instructionText },\n              { role: \"user\", content: `Summarize these ${memories.length} memories:\\n\\n${memoryList}` },\n            ],\n            {\n              temperature: 0.3,\n              maxTokens: 4096,\n              operation: \"memory_summarization\",\n              priority: \"background\",\n            },\n          );\n          const normalized = this.normalizeMemorySummaryResult(this.parseJsonObject(localResponse?.content));\n          if (normalized) {\n            log.debug(\n              `summarized ${memories.length} memories into ${normalized.keyFacts.length} key facts via local LLM`,\n            );\n            return normalized;\n          }\n          if (!this.config.localLlmFallback) {\n            log.warn(\"summarization skipped — local LLM returned invalid JSON and cloud fallback is disabled\");\n            return null;\n          }\n        } catch (err) {\n          if (!this.config.localLlmFallback) {\n            log.warn(`summarization skipped — local LLM failed and cloud fallback is disabled: ${err}`);\n            return null;\n          }\n        }\n      }\n\n      if (!this.shouldUseDirectClient) {\n        const fallbackResponse = await this.fallbackLlm.chatCompletion(\n          [\n            { role: \"system\", content: instructionText },\n            { role: \"user\", content: `Summarize these ${memories.length} memories:\\n\\n${memoryList}` },\n          ],\n          this.withGatewayAgent({ temperature: 0.3, maxTokens: 4096 }),\n        );\n        const normalized = this.normalizeMemorySummaryResult(this.parseJsonObject(fallbackResponse?.content));\n        if (normalized) {\n          log.debug(`summarized ${memories.length} memories into ${normalized.keyFacts.length} key facts via fallback`);\n          return normalized;\n        }\n        log.warn(\"summarization skipped — no OpenAI API key and fallback unavailable\");\n        return null;\n      }\n\n      const response = await this.client!.chat.completions.create({\n        model: this.config.model,\n        messages: [\n          { role: \"system\", content: instructionText },\n          { role: \"user\", content: `Summarize these ${memories.length} memories:\\n\\n${memoryList}` },\n        ],\n        ...buildChatCompletionTokenLimit(this.config.model, 4096, {\n          assumeOpenAI: this.directClientUsesOpenAiTokenSemantics(),\n        }),\n      });\n\n      const normalized = this.normalizeMemorySummaryResult(\n        this.parseJsonObject(response.choices?.[0]?.message?.content),\n      );\n      if (normalized) {\n        log.debug(`summarized ${memories.length} memories into ${normalized.keyFacts.length} key facts`);\n        return normalized;\n      }\n\n      return null;\n    } catch (err) {\n      log.error(\"memory summarization failed\", err);\n      return null;\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,YAAY;AA2CnB,IAAM,2BAA2B;AACjC,IAAM,gCAAgC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AActC,SAAS,cAAc,OAAkD;AACvE,SAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,KAAK;AAC5E;AAEA,SAAS,kBAAkB,UAAkD;AAC3E,QAAM,WAAW,OAAO,SAAS,SAAS,QAAQ,IAC9C,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,SAAS,QAAQ,CAAC,IAC1C;AACJ,SAAO;AAAA,IACL,UAAU,OAAO,SAAS,aAAa,WAAW,SAAS,SAAS,KAAK,IAAI;AAAA,IAC7E,SAAS,OAAO,SAAS,YAAY,WAAW,SAAS,QAAQ,KAAK,IAAI;AAAA,IAC1E;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,MAAiE;AACzF,SAAO,GAAG,KAAK,QAAQ,IAAI,KAAK,QAAQ,KAAK,EAAE,YAAY,CAAC;AAC9D;AAEA,SAAS,mBAAmB,QAA8D;AACxF,SAAO,GAAG,OAAO,IAAI,IAAI,OAAO,KAAK,KAAK,EAAE,YAAY,CAAC;AAC3D;AAEA,SAAS,yBACP,cACQ;AACR,SAAO,GAAG,aAAa,OAAO,KAAK,EAAE,YAAY,CAAC,KAAK,aAAa,OAAO,KAAK,EAAE,YAAY,CAAC,IAAI,aAAa,MAAM,KAAK,EAAE,YAAY,CAAC;AAC5I;AAEA,SAAS,0BAA0B,QAAwB;AACzD,SAAO,OAAO,KAAK,EAAE,YAAY;AACnC;AAEO,IAAM,mBAAN,MAAuB;AAAA,EAO5B,YACmB,QACjB,aACA,UACA,eACA,eACA;AALiB;AAMjB,SAAK,WAAW,eAAe,IAAI,mBAAmB,EAAE,SAAS,OAAO,YAAY,iCAAiC,WAAW,EAAE,CAAC;AACnI,QAAI,OAAO,cAAc;AACvB,WAAK,SAAS,IAAI,OAAO;AAAA,QACvB,QAAQ,OAAO;AAAA,QACf,GAAI,OAAO,gBAAgB,EAAE,SAAS,OAAO,cAAc,IAAI,CAAC;AAAA,MAClE,CAAC;AAAA,IACH,OAAO;AACL,WAAK,SAAS;AACd,UAAI,KAAK,2GAAsG;AAAA,IACjH;AACA,SAAK,WAAW,YAAY,IAAI,eAAe,QAAQ,aAAa;AACpE,SAAK,cAAc,IAAI,kBAAkB,eAAe;AAAA,MACtD,cAAc,OAAO;AAAA,IACvB,CAAC;AACD,SAAK,gBAAgB,iBAAiB,IAAI,cAAc,OAAO,SAAS;AACxE,QAAI,OAAO,gBAAgB,WAAW;AACpC,UAAI;AAAA,QACF,2GACG,OAAO,iBAAiB,YAAY,OAAO,cAAc,MAAM;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AAAA,EA3BmB;AAAA,EAPX;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoCR,IAAY,wBAAiC;AAC3C,WAAO,KAAK,OAAO,gBAAgB;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAY,oBAA6B;AACvC,WAAO,KAAK,OAAO,mBAAmB,CAAC,KAAK;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAY,wBAAiC;AAC3C,WAAO,CAAC,KAAK,yBAAyB,KAAK,WAAW;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA,EAKQ,iBAAiB,SAAyG;AAChI,QAAI,CAAC,KAAK,sBAAuB,QAAO;AACxC,UAAM,UAAU,KAAK,OAAO,kBAAkB;AAC9C,WAAO,UAAU,EAAE,GAAG,SAAS,QAAQ,IAAI;AAAA,EAC7C;AAAA,EAEQ,KAAK,OAA4B;AACvC,QAAI;AACF,YAAM,KAAM,WAAmB;AAC/B,UAAI,OAAO,OAAO,WAAY,IAAG,KAAK;AAAA,IACxC,QAAQ;AAAA,IAER;AAAA,EACF;AAAA,EAEQ,uCAAgD;AACtD,WAAO,kCAAkC,KAAK,OAAO,aAAa;AAAA,EACpE;AAAA,EAEQ,yBAAyB,QAA0B,kBAA2C;AACpG,UAAM,eAAe,KAAK,OAAO,YAAY,YAAY;AACzD,UAAM,KAAK,oBAAoB,oBAAI,KAAK;AACxC,UAAM,QAAQ,OAAO,MAClB,OAAO,CAAC,SAAS,gBAAgB,KAAK,aAAa,WAAW,EAC9D,IAAI,CAAC,SAAS;AACb,YAAM,YAAY,sBAAsB,KAAK,OAAO;AACpD,UAAI,CAAC,UAAU,OAAO;AACpB,YAAI,KAAK,yCAAyC,UAAU,WAAW,KAAK,IAAI,CAAC,EAAE;AAAA,MACrF;AACA,UAAI,UAAU,UAAU;AAExB,UAAI,KAAK,OAAO,oBAAoB;AAClC,kBAAU,YAAY,SAAS,OAAO,UAAU,EAAE;AAAA,MACpD;AACA,aAAO,EAAE,GAAG,MAAM,QAAQ;AAAA,IAC5B,CAAC;AACH,WAAO,EAAE,GAAG,QAAQ,MAAM;AAAA,EAC5B;AAAA,EAEQ,qBAAqB,QAAmC;AAC9D,WAAO,OAAO,MAAM,SAAS,KACxB,OAAO,SAAS,SAAS,KACzB,OAAO,UAAU,SAAS,KAC1B,OAAO,eAAe,SAAS,MAC9B,OAAO,eAAe,UAAU,KAAK;AAAA,EAC7C;AAAA,EAEQ,iCAAiC,QAA+B;AACtE,UAAM,WAAW,MAAM,QAAQ,QAAQ,QAAQ,IAC3C,OAAO,SACJ,IAAI,CAAC,MAAW,KAAK,sBAAsB,CAAC,CAAC,EAC7C,OAAO,CAAC,MAAW,EAAE,KAAK,SAAS,CAAC,IACvC,CAAC;AAEL,UAAM,QAAQ,MAAM,QAAQ,QAAQ,KAAK,IACrC,OAAO,MACJ,IAAI,CAAC,OAAY;AAAA,MAChB,UAAU,OAAO,GAAG,aAAa,WAAW,EAAE,WAAW;AAAA,MACzD,SAAS,OAAO,GAAG,YAAY,WAAW,EAAE,UAAU,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO;AAAA,MAC7F,YAAY,OAAO,GAAG,eAAe,WAAW,EAAE,aAAa;AAAA,MAC/D,MAAM,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,KAAK,OAAO,CAAC,MAAW,OAAO,MAAM,QAAQ,IAAI,CAAC;AAAA,MACnF,WAAW,OAAO,GAAG,cAAc,WAAW,EAAE,YAAY;AAAA,MAC5D,oBACE,OAAO,GAAG,uBAAuB,WAAW,EAAE,qBAAqB;AAAA,MACrE,OACE,GAAG,UAAU,YAAY,GAAG,UAAU,YAAY,EAAE,QAAQ;AAAA,MAC9D,sBACE,GAAG,wBAAwB,OAAO,EAAE,yBAAyB,YAAY,CAAC,MAAM,QAAQ,EAAE,oBAAoB,IAC1G,OAAO;AAAA,QACL,OAAO,QAAQ,EAAE,oBAAoB,EAClC,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,OAAO,MAAM,YAAY,OAAO,MAAM,QAAQ;AAAA,MACtE,IACA;AAAA,MACN,gBAAgB,MAAM,QAAQ,GAAG,cAAc,IAC3C,wBAAwB,EAAE,cAAc,IACxC;AAAA,MACJ,iBAAiB,MAAM;AAMrB,cAAM,YACJ,GAAG,kBAAkB,OAAO,EAAE,mBAAmB,YAAY,CAAC,MAAM,QAAQ,EAAE,cAAc,IACxF,EAAE,iBACF,GAAG,mBAAmB,OAAO,EAAE,oBAAoB,YAAY,CAAC,MAAM,QAAQ,EAAE,eAAe,IAC7F,EAAE,kBACF;AACR,eAAO,YAAY,wBAAwB,SAAS,KAAK,SAAY;AAAA,MACvE,GAAG;AAAA,IACL,EAAE,EACD,OAAO,CAAC,MAAW,EAAE,QAAQ,SAAS,CAAC,IAC1C,CAAC;AAEL,UAAM,YAAY,MAAM,QAAQ,QAAQ,SAAS,IAC7C,OAAO,UACJ,IAAI,CAAC,MAAW;AACf,UAAI,OAAO,MAAM,SAAU,QAAO,EAAE,UAAU,GAAG,SAAS,IAAI,UAAU,IAAI;AAC5E,aAAO;AAAA,QACL,UAAU,OAAO,GAAG,aAAa,WAAW,EAAE,WAAW,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO;AAAA,QAChG,SAAS,OAAO,GAAG,YAAY,WAAW,EAAE,UAAU;AAAA,QACtD,UAAU,OAAO,GAAG,aAAa,WAAW,EAAE,WAAW;AAAA,MAC3D;AAAA,IACF,CAAC,EACA,OAAO,CAAC,MAAW,EAAE,SAAS,SAAS,CAAC,IAC3C,CAAC;AAEL,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,gBAAgB,MAAM,QAAQ,QAAQ,cAAc,IAChD,OAAO,eAAe,OAAO,CAAC,MAAW,OAAO,MAAM,YAAY,EAAE,KAAK,EAAE,SAAS,CAAC,IACrF,CAAC;AAAA,MACL;AAAA,MACA,oBAAoB,QAAQ,sBAAsB;AAAA,MAClD,eAAe,MAAM,QAAQ,QAAQ,aAAa,IAC9C,OAAO,cAAc;AAAA,QACnB,CAAC,MACC,OAAO,GAAG,WAAW,YACrB,OAAO,GAAG,WAAW,YACrB,OAAO,GAAG,UAAU;AAAA,MACxB,EACG,IAAI,CAAC,OAAY;AAAA,QAChB,QAAQ,EAAE;AAAA,QACV,QAAQ,EAAE;AAAA,QACV,OAAO,EAAE;AAAA,QACT,oBACE,OAAO,GAAG,uBAAuB,WAAW,EAAE,qBAAqB;AAAA,MACvE,EAAE,IACJ;AAAA,IACN;AAAA,EACF;AAAA,EAEQ,sBAAsB,QAAoC;AAChE,UAAM,aAAa,cAAc,QAAQ,OAAO,IAAI,OAAO,UAAU;AACrE,UAAM,cAAc,MAAM,QAAQ,QAAQ,KAAK,IAC3C,OAAO,MACJ,OAAO,CAAC,SAAc,OAAO,SAAS,QAAQ,EAC9C,IAAI,CAAC,SAAiB,KAAK,KAAK,CAAC,EACjC,OAAO,CAAC,SAAiB,KAAK,SAAS,CAAC,IAC3C,CAAC;AACL,UAAM,cAAc,cAAc,MAAM,QAAQ,WAAW,KAAK,IAC5D,WAAW,MACR,OAAO,CAAC,SAAkB,OAAO,SAAS,QAAQ,EAClD,IAAI,CAAC,SAAiB,KAAK,KAAK,CAAC,EACjC,OAAO,CAAC,SAAiB,KAAK,SAAS,CAAC,IAC3C,CAAC;AACL,UAAM,oBAAoB,aACtB,OAAO,KAAK,UAAU,EACnB,KAAK,CAAC,GAAG,MAAM,EAAE,cAAc,CAAC,CAAC,EACjC,OAAO,CAAC,QAAQ,CAAC,CAAC,SAAS,QAAQ,sBAAsB,sBAAsB,MAAM,EAAE,SAAS,GAAG,CAAC,EACpG,QAAQ,CAAC,QAAQ;AAChB,YAAM,QAAQ,WAAW,GAAG;AAC5B,UAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,SAAS,GAAG;AACxD,eAAO,CAAC,GAAG,GAAG,KAAK,MAAM,KAAK,CAAC,EAAE;AAAA,MACnC;AACA,UAAI,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW;AAC3D,eAAO,CAAC,GAAG,GAAG,KAAK,OAAO,KAAK,CAAC,EAAE;AAAA,MACpC;AACA,aAAO,CAAC;AAAA,IACV,CAAC,IACH,CAAC;AACL,UAAM,2BAA2B,MAAM,QAAQ,QAAQ,kBAAkB,IACrE,OAAO,qBACP,MAAM,QAAQ,YAAY,kBAAkB,IAC1C,WAAW,qBACX,CAAC;AACP,UAAM,OACJ,OAAO,QAAQ,SAAS,WACpB,OAAO,KAAK,KAAK,IACjB,OAAO,QAAQ,aAAa,WAC1B,OAAO,SAAS,KAAK,IACrB,OAAO,YAAY,SAAS,WAC1B,WAAW,KAAK,KAAK,IACrB;AACV,UAAM,OACJ,OAAO,QAAQ,SAAS,YAAY,OAAO,KAAK,KAAK,EAAE,SAAS,IAC5D,OAAO,KAAK,KAAK,IACjB,OAAO,YAAY,SAAS,YAAY,WAAW,KAAK,KAAK,EAAE,SAAS,IACtE,WAAW,KAAK,KAAK,IACrB;AAER,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,OAAO,CAAC,GAAG,aAAa,GAAG,aAAa,GAAG,iBAAiB;AAAA,MAC5D,oBAAoB,yBAAyB,SAAS,IAClD,yBACG,IAAI,CAAC,aAAkB;AAAA,QACtB,KAAK,OAAO,SAAS,QAAQ,WAAW,QAAQ,IAAI,KAAK,IAAI;AAAA,QAC7D,OAAO,OAAO,SAAS,UAAU,WAAW,QAAQ,MAAM,KAAK,IAAI;AAAA,QACnE,OAAO,MAAM,QAAQ,SAAS,KAAK,IAC/B,QAAQ,MAAM,OAAO,CAAC,SAAc,OAAO,SAAS,QAAQ,EACzD,IAAI,CAAC,SAAiB,KAAK,KAAK,CAAC,EACjC,OAAO,CAAC,SAAiB,KAAK,SAAS,CAAC,IAC3C,CAAC;AAAA,MACP,EAAE,EACD,OAAO,CAAC,YACP,QAAQ,IAAI,SAAS,KACrB,QAAQ,MAAM,SAAS,KACvB,QAAQ,MAAM,SAAS,CACxB,IACH;AAAA,MACJ,oBACE,OAAO,QAAQ,uBAAuB,WAClC,OAAO,qBACP,OAAO,YAAY,uBAAuB,WACxC,WAAW,qBACX;AAAA,IACV;AAAA,EACF;AAAA,EAEQ,gBAAgB,SAAqC;AAC3D,UAAM,UAAU,SAAS,KAAK;AAC9B,QAAI,CAAC,QAAS,QAAO;AAErB,eAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,UAAI;AACF,eAAO,KAAK,MAAM,SAAS;AAAA,MAC7B,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,yCAAyC,QAAqD;AACpG,QAAI,CAAC,UAAU,OAAO,OAAO,oBAAoB,UAAW,QAAO;AAEnE,UAAM,WAAW,OAAO,gBAAgB,OAAO;AAC/C,UAAM,kBACJ,aAAa,WAAW,aAAa,aACjC,UACA,aAAa,YAAY,aAAa,QACpC,WACA;AAER,WAAO;AAAA,MACL,iBAAiB,QAAQ,OAAO,eAAe;AAAA,MAC/C,YAAY,OAAO,OAAO,eAAe,WAAW,OAAO,aAAa;AAAA,MACxE,WACE,OAAO,OAAO,cAAc,WACxB,OAAO,YACP,OAAO,OAAO,gBAAgB,WAC5B,OAAO,cACP;AAAA,MACR,cAAc;AAAA,IAChB;AAAA,EACF;AAAA,EAEQ,8BAA8B,QAAoC;AACxE,QAAI,CAAC,UAAU,CAAC,MAAM,QAAQ,OAAO,KAAK,GAAG;AAC3C,aAAO;AAAA,IACT;AAEA,UAAM,kBAAkB,OAAO,MAC5B,IAAI,CAAC,SAAc;AAClB,YAAM,cAAc,MAAM,YAAY,MAAM;AAC5C,aAAO;AAAA,QACL,UAAU,OAAO,MAAM,aAAa,WAAW,KAAK,WAAW;AAAA,QAC/D,UACE,gBAAgB,aAChB,gBAAgB,gBAChB,gBAAgB,iBAChB,gBAAgB,cAChB,gBAAgB,YACZ,cACA;AAAA,QACN,UAAU,OAAO,MAAM,aAAa,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,QAAQ,CAAC,IAAI;AAAA,QACzF,QAAQ,OAAO,MAAM,WAAW,WAAW,KAAK,SAAS;AAAA,MAC3D;AAAA,IACF,CAAC,EACA,OAAO,CAAC,SAAc,KAAK,SAAS,SAAS,CAAC;AAEjD,WAAO,EAAE,OAAO,gBAAgB;AAAA,EAClC;AAAA,EAEQ,6BAA6B,QAAyC;AAC5E,QAAI,CAAC,OAAQ,QAAO;AAEpB,UAAM,aAAkC;AAAA,MACtC,aACE,OAAO,OAAO,gBAAgB,WAC1B,OAAO,cACP,OAAO,OAAO,YAAY,WACxB,OAAO,UACP;AAAA,MACR,UAAU,MAAM,QAAQ,OAAO,QAAQ,IAAI,OAAO,SAAS,OAAO,CAAC,MAAe,OAAO,MAAM,QAAQ,IAAI,CAAC;AAAA,MAC5G,aAAa,MAAM,QAAQ,OAAO,WAAW,IACzC,OAAO,YAAY,OAAO,CAAC,MAAe,OAAO,MAAM,QAAQ,IAC/D,MAAM,QAAQ,OAAO,QAAQ,IAC3B,OAAO,SAAS,OAAO,CAAC,MAAe,OAAO,MAAM,QAAQ,IAC5D,CAAC;AAAA,IACT;AAEA,WAAO,WAAW,YAAY,SAAS,IAAI,aAAa;AAAA,EAC1D;AAAA,EAEQ,0BAA0B,QAA2C;AAC3E,QAAI,CAAC,OAAQ,QAAO;AAEpB,UAAM,aAAoC;AAAA,MACxC,SAAS,OAAO,OAAO,YAAY,WAAW,OAAO,QAAQ,KAAK,IAAI;AAAA,MACtE,SAAS,MAAM,QAAQ,OAAO,OAAO,IACjC,OAAO,QAAQ,OAAO,CAAC,SAAkB,OAAO,SAAS,QAAQ,EAAE,IAAI,CAAC,SAAiB,KAAK,KAAK,CAAC,EAAE,OAAO,OAAO,IACpH,CAAC;AAAA,MACL,cAAc,MAAM,QAAQ,OAAO,YAAY,IAC3C,OAAO,aAAa,OAAO,CAAC,SAAkB,OAAO,SAAS,QAAQ,EAAE,IAAI,CAAC,SAAiB,KAAK,KAAK,CAAC,EAAE,OAAO,OAAO,IACzH,CAAC;AAAA,MACL,qBAAqB,MAAM,QAAQ,OAAO,mBAAmB,IACzD,OAAO,oBAAoB,OAAO,CAAC,SAAkB,OAAO,SAAS,QAAQ,EAAE,IAAI,CAAC,SAAiB,KAAK,KAAK,CAAC,EAAE,OAAO,OAAO,IAChI,CAAC;AAAA,IACP;AAEA,WAAO,WAAW,QAAQ,SAAS,IAAI,aAAa;AAAA,EACtD;AAAA,EAEQ,4BAA4B,QAIZ;AACtB,UAAM,QAAsC,CAAC;AAC7C,eAAW,QAAQ,MAAM,QAAQ,OAAO,KAAK,IAAI,OAAO,QAAQ,CAAC,GAAG;AAClE,YAAM,YAAY,OAAQ,MAAc,WAAW,WAAY,KAAa,OAAO,YAAY,IAAI;AACnG,YAAM,SACJ,cAAc,SACd,cAAc,WACd,cAAc,YACd,cAAc,gBACd,cAAc,SACV,YACA;AACN,YAAM,aACJ,OAAQ,MAAc,eAAe,WAChC,KAAa,WAAW,KAAK,IAC9B,OAAQ,MAAc,gBAAgB,WACnC,KAAa,YAAY,KAAK,IAC/B,OAAQ,MAAc,aAAa,WAChC,KAAa,SAAS,KAAK,IAC5B;AACV,UAAI,CAAC,WAAY;AACjB,YAAM,YAAY,OAAQ,MAAc,cAAc,WAAY,KAAa,YAAY;AAC3F,YAAM,SAAS,OAAQ,MAAc,WAAW,WAAY,KAAa,SAAS;AAClF,YAAM,oBAAoB,OAAQ,MAAc,mBAAmB,WAAY,KAAa,iBAAiB;AAC7G,UAAI,CAAC,mBAAmB;AACtB,cAAM,KAAK,EAAE,YAAY,QAAQ,WAAW,gBAAgB,QAAW,OAAO,CAAC;AAC/E;AAAA,MACF;AACA,YAAM,YAAY,sBAAsB,iBAAiB;AACzD,UAAI,CAAC,UAAU,OAAO;AACpB,YAAI,KAAK,iCAAiC,UAAU,iBAAiB,UAAU,WAAW,KAAK,IAAI,CAAC,EAAE;AAAA,MACxG;AACA,YAAM,KAAK;AAAA,QACT;AAAA,QACA;AAAA,QACA;AAAA,QACA,gBAAgB,UAAU;AAAA,QAC1B;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,kBAAkB,MAAM,QAAQ,OAAO,cAAc,IAAI,OAAO,iBAAiB,CAAC,GACrF;AAAA,MAAI,CAAC,WACJ,OAAO,WAAW,WACd,OAAO,KAAK,IACZ,OAAO,QAAQ,YAAY,WACzB,OAAO,QAAQ,KAAK,IACpB;AAAA,IACR,EACC,OAAO,CAAC,WAAW,OAAO,SAAS,CAAC;AACvC,UAAM,iBAAiB,MAAM,QAAQ,OAAO,aAAa,IAAI,OAAO,gBAAgB,CAAC,GAClF,IAAI,CAAC,WAAgB,KAAK,sBAAsB,MAAM,CAAC,EACvD,OAAO,CAAC,WAAkC,OAAO,KAAK,SAAS,CAAC;AACnE,WAAO,EAAE,OAAO,gBAAgB,cAAc;AAAA,EAChD;AAAA,EAEA,MAAc,2BACZ,cACA,MAC2B;AAC3B,QAAI,CAAC,KAAK,OAAO,2BAA4B,QAAO;AACpD,UAAM,gBAAgB,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,OAAO,kCAAkC,CAAC;AAC5F,QAAI,kBAAkB,EAAG,QAAO;AAChC,QAAI,KAAK,OAAO,iCAAiC,EAAG,QAAO;AAC3D,QAAI,KAAK,OAAO,iCAAiC,EAAG,QAAO;AAE3D,QAAI;AACF,YAAM,YAAY,MAAM,KAAK,2BAA2B,cAAc,MAAM,aAAa;AACzF,UAAI,UAAU,WAAW,EAAG,QAAO;AACnC,YAAM,qBAAqB,MAAM,KAAK;AAAA,QACpC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,CAAC,KAAK,qBAAqB,kBAAkB,EAAG,QAAO;AAC3D,aAAO,KAAK,6BAA6B,MAAM,oBAAoB,aAAa;AAAA,IAClF,SAAS,KAAK;AACZ,UAAI,MAAM,wDAAwD,GAAG,EAAE;AACvE,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEQ,gCACN,SACA,sBACsB;AACtB,eAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,UAAI;AACF,cAAM,SAAS,KAAK,MAAM,SAAS;AACnC,YAAI,CAAC,MAAM,QAAQ,OAAO,SAAS,EAAG;AACtC,eAAO,OAAO,UACX,IAAI,CAAC,MAAM,kBAAkB,CAAuB,CAAC,EACrD,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,CAAC,EACnC,OAAO,CAAC,MAAM,CAAC,qBAAqB,IAAI,EAAE,SAAS,YAAY,CAAC,CAAC;AAAA,MACtE,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO,CAAC;AAAA,EACV;AAAA,EAEQ,uCAAuC,SAA0C;AACvF,eAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,UAAI;AACF,cAAM,SAAS,gCAAgC,MAAM,KAAK,MAAM,SAAS,CAAC;AAC1E,eAAO,KAAK,iCAAiC;AAAA,UAC3C,GAAG;AAAA,UACH,WAAW,CAAC;AAAA,QACd,CAAC;AAAA,MACH,QAAQ;AAAA,MAER;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,2BACZ,cACA,MACA,eAC+B;AAC/B,UAAM,uBAAuB,IAAI;AAAA,OAC9B,KAAK,aAAa,CAAC,GACjB,IAAI,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,YAAY,CAAC,EAC1C,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAAA,IAC/B;AACA,UAAM,eAAe,KAAK,MACvB,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,MAAM,EAAE,QAAQ,KAAK,EAAE,OAAO,EAAE,EAC3C,KAAK,IAAI;AACZ,UAAM,4BAA4B,KAAK,aAAa,CAAC,GAClD,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,KAAK,EAAE,QAAQ,EAAE,EAC5B,KAAK,IAAI;AAEZ,UAAM,SAAS;AAAA,MACb;AAAA,MACA,kBAAkB,aAAa;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB;AAAA,MAChB;AAAA,MACA;AAAA,MACA,4BAA4B;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,IAAI;AAEX,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,gBAAgB,MAAM,KAAK,SAAS;AAAA,UACxC;AAAA,YACE;AAAA,cACE,MAAM;AAAA,cACN,SAAS;AAAA,YACX;AAAA,YACA,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,UAClC;AAAA,UACA;AAAA,YACE,aAAa;AAAA,YACb,WAAW,KAAK,OAAO;AAAA,YACvB,WAAW,KAAK,OAAO;AAAA,YACvB,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,eAAe,SAAS;AAC1B,gBAAM,cAAc,KAAK;AAAA,YACvB,cAAc,QAAQ,KAAK;AAAA,YAC3B;AAAA,UACF;AACA,cAAI,YAAY,SAAS,GAAG;AAC1B,mBAAO,YAAY,MAAM,GAAG,aAAa;AAAA,UAC3C;AAAA,QACF;AACA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,iBAAO,CAAC;AAAA,QACV;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,UAAM,iBAAiB,MAAM,KAAK,YAAY;AAAA,MAC5C;AAAA,QACE;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,QACA,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,MACA,KAAK,iBAAiB;AAAA,QACpB,aAAa;AAAA,QACb,WAAW,KAAK,OAAO;AAAA,QACvB,WAAW,KAAK,OAAO;AAAA,MACzB,CAAC;AAAA,IACH;AACA,QAAI,CAAC,gBAAgB,UAAW,QAAO,CAAC;AACxC,WAAO,eAAe,UACnB,IAAI,CAAC,MAAM,kBAAkB,CAAuB,CAAC,EACrD,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,CAAC,EACnC,OAAO,CAAC,MAAM,CAAC,qBAAqB,IAAI,EAAE,SAAS,YAAY,CAAC,CAAC,EACjE,MAAM,GAAG,aAAa;AAAA,EAC3B;AAAA,EAEA,MAAc,yBACZ,cACA,MACA,oBACA,eAC2B;AAC3B,UAAM,eAAe,KAAK,MACvB,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,MAAM,EAAE,QAAQ,KAAK,EAAE,OAAO,EAAE,EAC3C,KAAK,IAAI;AACZ,UAAM,kBAAkB,KAAK,SAC1B,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,WAAW,MAAM,OAAO,IAAI,KAAK,OAAO,IAAI,KAAK,OAAO,MAAM,KAAK,IAAI,KAAK,YAAY,EAAE,EAC/F,KAAK,IAAI;AACZ,UAAM,mBAAmB,mBACtB,MAAM,GAAG,aAAa,EACtB,IAAI,CAAC,UAAU,UAAU,GAAG,QAAQ,CAAC,KAAK,SAAS,QAAQ,GAAG,SAAS,UAAU;AAAA,cAAiB,SAAS,OAAO,KAAK,EAAE,EAAE,EAC3H,KAAK,IAAI;AAEZ,UAAM,SAAS;AAAA,MACb;AAAA,MACA,kBAAkB,aAAa;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB;AAAA,MAChB;AAAA,MACA;AAAA,MACA,mBAAmB;AAAA,MACnB;AAAA,MACA;AAAA,MACA,oBAAoB;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,IAAI;AAEX,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,gBAAgB,MAAM,KAAK,SAAS;AAAA,UACxC;AAAA,YACE;AAAA,cACE,MAAM;AAAA,cACN,SAAS;AAAA,YACX;AAAA,YACA,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,UAClC;AAAA,UACA;AAAA,YACE,aAAa;AAAA,YACb,WAAW,KAAK,OAAO;AAAA,YACvB,WAAW,KAAK,OAAO;AAAA,YACvB,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,eAAe,SAAS;AAC1B,gBAAM,SAAS,KAAK,uCAAuC,cAAc,QAAQ,KAAK,CAAC;AACvF,cAAI,QAAQ;AACV,mBAAO,KAAK,yBAAyB,MAAM;AAAA,UAC7C;AAAA,QACF;AACA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,iBAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,QACtE;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAEA,UAAM,iBAAiB,MAAM,KAAK,YAAY;AAAA,MAC5C;AAAA,QACE;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,QACA,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,MACA,KAAK,iBAAiB;AAAA,QACpB,aAAa;AAAA,QACb,WAAW,KAAK,OAAO;AAAA,QACvB,WAAW,KAAK,OAAO;AAAA,MACzB,CAAC;AAAA,IACH;AACA,QAAI,CAAC,gBAAgB;AACnB,aAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,IACtE;AACA,WAAO,KAAK;AAAA,MACV,KAAK,iCAAiC;AAAA,QACpC,GAAG;AAAA,QACH,WAAW,CAAC;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF;AAAA,EAEQ,6BACN,MACA,WACA,eACkB;AAClB,UAAM,YAAY,KAAK,OAAO;AAC9B,QAAI,kBAAkB,KAAK,IAAI,GAAG,KAAK,MAAM,aAAa,CAAC;AAC3D,UAAM,cAAc,CAAC,GAAG,KAAK,KAAK;AAClC,UAAM,YAAY,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,SAAS,iBAAiB,IAAI,CAAC,CAAC;AAC1E,eAAW,QAAQ,UAAU,OAAO;AAClC,UAAI,mBAAmB,EAAG;AAC1B,UAAI,KAAK,aAAa,yBAA0B;AAChD,UAAI,aAAa,CAAC,UAAU,SAAS,KAAK,QAA0B,EAAG;AACvE,YAAM,MAAM,iBAAiB,IAAI;AACjC,UAAI,UAAU,IAAI,GAAG,EAAG;AACxB,gBAAU,IAAI,GAAG;AACjB,kBAAY,KAAK,EAAE,GAAG,MAAM,QAAQ,YAAY,CAAC;AACjD,yBAAmB;AAAA,IACrB;AAEA,UAAM,iBAAiB,KAAK,SAAS,IAAI,CAAC,YAAY;AAAA,MACpD,GAAG;AAAA,MACH,OAAO,CAAC,GAAG,OAAO,KAAK;AAAA,MACvB,oBAAoB,OAAO,qBACvB,OAAO,mBAAmB,IAAI,CAAC,aAAa;AAAA,QAC1C,GAAG;AAAA,QACH,OAAO,CAAC,GAAG,QAAQ,KAAK;AAAA,MAC1B,EAAE,IACF;AAAA,IACN,EAAE;AACF,UAAM,cAAc,IAAI,IAAI,eAAe,IAAI,CAAC,QAAQ,UAAU,CAAC,mBAAmB,MAAM,GAAG,KAAK,CAAC,CAAC;AACtG,eAAW,UAAU,UAAU,UAAU;AACvC,UAAI,mBAAmB,EAAG;AAC1B,YAAM,MAAM,mBAAmB,MAAM;AACrC,YAAM,gBAAgB,YAAY,IAAI,GAAG;AACzC,UAAI,OAAO,kBAAkB,UAAU;AACrC,cAAM,WAAW,eAAe,aAAa;AAC7C,cAAM,YAAY,IAAI,IAAI,SAAS,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC;AACnE,cAAM,eAAe,IAAI;AAAA,WACtB,SAAS,sBAAsB,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,KAAK;AAAA,YACjE,GAAG;AAAA,YACH,OAAO,CAAC,GAAG,QAAQ,KAAK;AAAA,UAC1B,CAAC,CAAC;AAAA,QACJ;AACA,YAAI,UAAU;AACd,mBAAW,QAAQ,OAAO,OAAO;AAC/B,gBAAM,UAAU,KAAK,KAAK;AAC1B,cAAI,CAAC,WAAW,UAAU,IAAI,OAAO,EAAG;AACxC,oBAAU,IAAI,OAAO;AACrB,oBAAU;AAAA,QACZ;AACA,mBAAW,WAAW,OAAO,sBAAsB,CAAC,GAAG;AACrD,gBAAM,kBAAkB,aAAa,IAAI,QAAQ,GAAG;AACpD,cAAI,CAAC,iBAAiB;AACpB,yBAAa,IAAI,QAAQ,KAAK;AAAA,cAC5B,KAAK,QAAQ;AAAA,cACb,OAAO,QAAQ;AAAA,cACf,OAAO,CAAC,GAAG,QAAQ,KAAK;AAAA,YAC1B,CAAC;AACD,sBAAU;AACV;AAAA,UACF;AACA,gBAAM,mBAAmB,IAAI,IAAI,gBAAgB,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC;AACjF,qBAAW,QAAQ,QAAQ,OAAO;AAChC,kBAAM,UAAU,KAAK,KAAK;AAC1B,gBAAI,CAAC,WAAW,iBAAiB,IAAI,OAAO,EAAG;AAC/C,6BAAiB,IAAI,OAAO;AAC5B,sBAAU;AAAA,UACZ;AACA,0BAAgB,QAAQ,MAAM,KAAK,gBAAgB;AAAA,QACrD;AACA,YAAI,SAAS;AACX,yBAAe,aAAa,IAAI;AAAA,YAC9B,GAAG;AAAA,YACH,OAAO,MAAM,KAAK,SAAS;AAAA,YAC3B,oBAAoB,MAAM,KAAK,aAAa,OAAO,CAAC;AAAA,YACpD,QAAQ;AAAA,YACR,oBAAoB,SAAS,sBAAsB,OAAO;AAAA,UAC5D;AACA,6BAAmB;AAAA,QACrB;AACA;AAAA,MACF;AACA,qBAAe,KAAK;AAAA,QAClB,GAAG;AAAA,QACH,QAAQ;AAAA,QACR,oBAAoB,OAAO,qBACvB,OAAO,mBAAmB,IAAI,CAAC,aAAa;AAAA,UAC1C,GAAG;AAAA,UACH,OAAO,CAAC,GAAG,QAAQ,KAAK;AAAA,QAC1B,EAAE,IACF;AAAA,MACN,CAAC;AACD,kBAAY,IAAI,KAAK,eAAe,SAAS,CAAC;AAC9C,yBAAmB;AAAA,IACrB;AAEA,UAAM,uBAAuB,CAAC,GAAG,KAAK,cAAc;AACpD,UAAM,qBAAqB,IAAI,IAAI,KAAK,eAAe,IAAI,CAAC,WAAW,0BAA0B,MAAM,CAAC,CAAC;AACzG,eAAW,UAAU,UAAU,gBAAgB;AAC7C,UAAI,mBAAmB,EAAG;AAC1B,YAAM,MAAM,0BAA0B,MAAM;AAC5C,UAAI,CAAC,OAAO,mBAAmB,IAAI,GAAG,EAAG;AACzC,yBAAmB,IAAI,GAAG;AAC1B,2BAAqB,KAAK,OAAO,KAAK,CAAC;AACvC,yBAAmB;AAAA,IACrB;AAEA,UAAM,sBAAsB,CAAC,GAAI,KAAK,iBAAiB,CAAC,CAAE;AAC1D,UAAM,oBAAoB,IAAI,IAAI,oBAAoB,IAAI,CAAC,iBAAiB,yBAAyB,YAAY,CAAC,CAAC;AACnH,eAAW,gBAAgB,UAAU,iBAAiB,CAAC,GAAG;AACxD,UAAI,mBAAmB,EAAG;AAC1B,YAAM,MAAM,yBAAyB,YAAY;AACjD,UAAI,kBAAkB,IAAI,GAAG,EAAG;AAChC,wBAAkB,IAAI,GAAG;AACzB,0BAAoB,KAAK,EAAE,GAAG,cAAc,kBAAkB,YAAY,CAAC;AAC3E,yBAAmB;AAAA,IACrB;AAEA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO;AAAA,MACP,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,eAAe;AAAA,IACjB;AAAA,EACF;AAAA,EAEA,MAAc,yBACZ,SACA,WACA,aACA,QACA,UACA,UAAwD,CAAC,GACtC;AACnB,UAAM,WAAW,MAAM,KAAK,YAAY,wBAAwB,UAAU,QAAQ,KAAK,iBAAiB,OAAO,CAAC;AAChH,QAAI,UAAU,QAAQ;AACpB,YAAM,aAAa,KAAK,IAAI,IAAI;AAChC,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QACN;AAAA,QACA,OAAO,SAAS;AAAA,QAChB;AAAA,QACA;AAAA,QACA,QAAQ,KAAK,UAAU,SAAS,MAAM,EAAE,MAAM,GAAG,GAAI;AAAA,MACvD,CAAC;AACD,aAAO,SAAS;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,QAAQ,OAAqB,kBAAwD;AAGzF,UAAM,mBAAmB,MAAM,OAAO,CAAC,MAAM,EAAE,QAAQ,KAAK,EAAE,SAAS,CAAC;AACxE,QAAI,iBAAiB,WAAW,GAAG;AACjC,UAAI,MAAM,0DAAqD;AAC/D,aAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,IACtE;AAEA,UAAM,eAAe,iBAClB,IAAI,CAAC,UAAU;AAAA,MACd,GAAG;AAAA,MACH,SAAS,KAAK,SAAS,cACnB,4BAA4B,KAAK,OAAO,IACxC,KAAK;AAAA,IACX,EAAE,EACD,OAAO,CAAC,SAAS,KAAK,QAAQ,KAAK,EAAE,SAAS,CAAC;AAClD,UAAM,eAAe,aAClB,IAAI,CAAC,MAAM,IAAI,EAAE,IAAI,KAAK,EAAE,OAAO,EAAE,EACrC,KAAK,MAAM;AACd,QAAI,aAAa,KAAK,EAAE,WAAW,GAAG;AACpC,UAAI,MAAM,qFAAgF;AAC1F,aAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,IACtE;AAGA,UAAM,aAAa,aAAa,SAAS,IAAI,IAAI,KAAK,aAAa,aAAa,SAAS,CAAC,EAAE,SAAS,IAAI;AACzG,UAAM,mBAAmB,cAAc,CAAC,MAAM,WAAW,QAAQ,CAAC,IAAI,aAAa;AAEnF,UAAM,UAAU,OAAO,WAAW;AAGlC,UAAM,qBAAqB,CAAC,EAAE,KAAK,yBAAyB,KAAK;AACjE,QAAI,oBAAoB;AACtB,WAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,cAAc,OAAO,aAAa,CAAC;AAAA,IAClH;AACA,QAAI,oBAAoB;AACxB,UAAM,YAAY,KAAK,IAAI;AAG3B,UAAM,oBAAoB,KAAK,SAAS,WAAW,cAAc,QAAW;AAAA,MAC1E,OAAO,KAAK,OAAO;AAAA,MACnB,UAAU,KAAK,OAAO;AAAA,IACxB,CAAC;AACD,SAAK,SAAS,UAAU,SAAS,iBAAiB;AAElD,QAAI;AAEJ,UAAI,KAAK,mBAAmB;AAC1B,aAAK,SAAS,UAAU,aAAa,iBAAiB;AACtD,YAAI;AACF,gBAAM,cAAc,MAAM,KAAK,oBAAoB,cAAc,gBAAgB;AACjF,cAAI,aAAa;AACf,kBAAM,aAAa,KAAK,IAAI,IAAI;AAChC,iBAAK,SAAS,QAAQ,aAAa,iBAAiB;AACpD,iBAAK,KAAK,EAAE,MAAM,WAAW,SAAS,OAAO,KAAK,OAAO,eAAe,WAAW,cAAc,WAAW,CAAC;AAC7G,gBAAI,MAAM,qCAAgC,YAAY,MAAM,MAAM,WAAW,YAAY,SAAS,MAAM,WAAW;AACnH,kBAAM,YAAY,KAAK,yBAAyB,aAAa,gBAAgB;AAC7E,mBAAO,MAAM,KAAK,2BAA2B,cAAc,SAAS;AAAA,UACtE;AAEA,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,oDAAoD;AAC7D,mBAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,UACtE;AACA,cAAI,KAAK,uEAAuE;AAAA,QAClF,SAAS,KAAK;AACZ,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,sDAAsD,GAAG;AAClE,mBAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,UACtE;AACA,cAAI,KAAK,oEAAoE,GAAG;AAAA,QAClF,UAAE;AAEA,cAAI;AAAE,iBAAK,SAAS,QAAQ,aAAa,iBAAiB;AAAA,UAAG,QAAQ;AAAA,UAAmC;AAAA,QAC1G;AAAA,MACF;AAGA,UAAI,KAAK,uBAAuB;AAC9B,aAAK,SAAS,UAAU,iBAAiB,iBAAiB;AAC1D,YAAI;AACF,gBAAM,eAAe,MAAM,KAAK,wBAAwB,cAAc,gBAAgB;AACtF,cAAI,cAAc;AAChB,kBAAM,aAAa,KAAK,IAAI,IAAI;AAChC,iBAAK,SAAS,QAAQ,iBAAiB,iBAAiB;AACxD,iBAAK,KAAK,EAAE,MAAM,WAAW,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,cAAc,WAAW,CAAC;AACrG,gBAAI,MAAM,mCAAmC,KAAK,OAAO,KAAK,YAAO,aAAa,MAAM,MAAM,WAAW,aAAa,SAAS,MAAM,WAAW;AAChJ,kBAAM,YAAY,KAAK,yBAAyB,cAAc,gBAAgB;AAC9E,mBAAO,MAAM,KAAK,2BAA2B,cAAc,SAAS;AAAA,UACtE;AAGA,cAAI;AACF,iBAAK,KAAK;AAAA,cACR,MAAM;AAAA,cAAa;AAAA,cAAS,OAAO,KAAK,OAAO;AAAA,cAAO,WAAW;AAAA,cACjE,YAAY,KAAK,IAAI,IAAI;AAAA,cAAW,OAAO;AAAA,YAC7C,CAAC;AAAA,UACH,QAAQ;AAAA,UAA2C;AACnD,8BAAoB;AACpB,cAAI,KAAK,0EAA0E;AAAA,QACrF,SAAS,KAAK;AACZ,cAAI;AACF,iBAAK,KAAK;AAAA,cACR,MAAM;AAAA,cAAa;AAAA,cAAS,OAAO,KAAK,OAAO;AAAA,cAAO,WAAW;AAAA,cACjE,YAAY,KAAK,IAAI,IAAI;AAAA,cAAW,OAAO,OAAO,GAAG;AAAA,YACvD,CAAC;AAAA,UACH,QAAQ;AAAA,UAA2C;AACnD,8BAAoB;AACpB,cAAI,KAAK,iEAAiE,GAAG;AAAA,QAC/E,UAAE;AACA,cAAI;AAAE,iBAAK,SAAS,QAAQ,iBAAiB,iBAAiB;AAAA,UAAG,QAAQ;AAAA,UAAmC;AAAA,QAC9G;AAAA,MACF;AAGA,UAAI,sBAAsB,CAAC,mBAAmB;AAC5C,YAAI;AACF,eAAK,KAAK;AAAA,YACR,MAAM;AAAA,YAAa;AAAA,YAAS,OAAO,KAAK,OAAO;AAAA,YAAO,WAAW;AAAA,YACjE,YAAY,KAAK,IAAI,IAAI;AAAA,YAAW,OAAO;AAAA,UAC7C,CAAC;AAAA,QACH,QAAQ;AAAA,QAA2C;AAAA,MACrD;AAMA,YAAM,kBAAkB,OAAO,WAAW;AAC1C,YAAM,oBAAoB,KAAK,IAAI;AACnC,UAAI,KAAK,uBAAuB;AAC9B,YAAI;AAAA,UACF,2DACG,KAAK,OAAO,iBAAiB,YAAY,KAAK,OAAO,cAAc,MAAM;AAAA,QAC9E;AAAA,MACF,OAAO;AACL,YAAI,KAAK,gDAAgD;AAAA,MAC3D;AAEA,WAAK,SAAS,UAAU,oBAAoB,iBAAiB;AAC7D,UAAI;AACF,cAAM,WAAW;AAAA,UACf,EAAE,MAAM,UAAmB,SAAS,KAAK,4BAA4B,gBAAgB,EAAE;AAAA,UACvF,EAAE,MAAM,QAAiB,SAAS,aAAa;AAAA,QACjD;AAEA,aAAK,KAAK,EAAE,MAAM,aAAa,SAAS,iBAAiB,OAAO,YAAY,WAAW,cAAc,OAAO,aAAa,CAAC;AAE1H,cAAM,WAAW,MAAM,KAAK,YAAY;AAAA,UACtC;AAAA,UACA;AAAA,UACA,KAAK,iBAAiB,EAAE,aAAa,KAAK,WAAW,MAAM,WAAW,IAAO,CAAC;AAAA,QAChF;AAEA,cAAM,qBAAqB,KAAK,IAAI,IAAI;AAExC,YAAI,UAAU,UAAU,MAAM,QAAQ,SAAS,OAAO,KAAK,GAAG;AAC5D,gBAAM,SAAS,SAAS;AACxB,eAAK,KAAK;AAAA,YACR,MAAM;AAAA,YAAW,SAAS;AAAA,YAAiB,OAAO,SAAS;AAAA,YAAW,WAAW;AAAA,YACjF,YAAY;AAAA,YAAoB,QAAQ,KAAK,UAAU,MAAM,EAAE,MAAM,GAAG,GAAI;AAAA,UAC9E,CAAC;AACD,cAAI;AAAA,YACF,aAAa,OAAO,MAAM,MAAM,WAAW,OAAO,SAAS,MAAM,eAAe,OAAO,aAAa,CAAC,GAAG,MAAM,4BAA4B,SAAS,SAAS;AAAA,UAC9J;AAMA,gBAAM,kBAAkB,OAAO,MAAM,IAAI,CAAC,MAAW;AACnD,gBAAI,CAAC,GAAG,eAAgB,QAAO;AAC/B,mBAAO;AAAA,cACL,GAAG;AAAA,cACH,gBAAgB,wBAAwB,EAAE,cAAc,KAAK;AAAA,YAC/D;AAAA,UACF,CAAC;AACD,gBAAM,YAAY,KAAK,yBAAyB;AAAA,YAC9C,GAAG;AAAA,YACH,OAAO;AAAA,YACP,WAAW,OAAO,aAAa,CAAC;AAAA,YAChC,oBAAoB,OAAO,sBAAsB;AAAA,UACnD,GAAuB,gBAAgB;AACvC,iBAAO,MAAM,KAAK,2BAA2B,cAAc,SAAS;AAAA,QACtE;AAEA,aAAK,KAAK;AAAA,UACR,MAAM;AAAA,UAAa,SAAS;AAAA,UAAiB,OAAO;AAAA,UAAY,WAAW;AAAA,UAC3E,YAAY;AAAA,UAAoB,OAAO;AAAA,QACzC,CAAC;AACD,YAAI,KAAK,+CAA+C;AACxD,eAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,MACtE,SAAS,KAAK;AACZ,aAAK,KAAK;AAAA,UACR,MAAM;AAAA,UAAa,SAAS;AAAA,UAAiB,OAAO;AAAA,UAAY,WAAW;AAAA,UAC3E,YAAY,KAAK,IAAI,IAAI;AAAA,UAAmB,OAAO,OAAO,GAAG;AAAA,QAC/D,CAAC;AACD,YAAI,MAAM,8BAA8B,GAAG;AAC3C,eAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,UAAU,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,MACtE,UAAE;AACA,YAAI;AAAE,eAAK,SAAS,QAAQ,oBAAoB,iBAAiB;AAAA,QAAG,QAAQ;AAAA,QAAmC;AAAA,MACjH;AAAA,IAEA,UAAE;AAEA,WAAK,SAAS,QAAQ,SAAS,iBAAiB;AAChD,WAAK,SAAS,SAAS,iBAAiB;AAAA,IAC1C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,oBAAoB,cAAsB,kBAA+D;AACrH,QAAI;AAAA,MACF,6DAA6D,KAAK,iBAAiB,WAAW,KAAK,OAAO,aAAa;AAAA,IACzH;AAGA,UAAM,eAAe,KAAK,cAAc;AAAA,MACtC,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AACA,QAAI,MAAM,kBAAkB,aAAa,WAAW,EAAE;AAEtD,UAAM,uBAAuB,aAAa;AAC1C,UAAM,wBAAwB,aAAa,SAAS,uBAChD,aAAa,MAAM,GAAG,oBAAoB,IAAI,oBAC9C;AAEJ,UAAM,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uDAyD+B,KAAK,OAAO,uCAAuC;AAAA,+RACqL,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA4B/R,qBAAqB;AAEnB,QAAI;AAAA,MACF,2EAA2E,YAAY,MAAM;AAAA,IAC/F;AACA,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,8DAA8D;AAAA,QACzF,EAAE,MAAM,QAAQ,SAAS,YAAY;AAAA,MACvC;AAAA,MACA;AAAA,QACE,aAAa;AAAA,QACb,WAAW,aAAa;AAAA,QACxB,WAAW;AAAA,QACX,UAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,UAAU,SAAS;AACtB,UAAI,MAAM,oEAAoE;AAC9E,aAAO;AAAA,IACT;AAEA,UAAM,UAAU,SAAS,QAAQ,KAAK;AAEtC,QAAI,MAAM,qDAAqD,QAAQ,MAAM,EAAE;AAE/E,QAAI;AACF,iBAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,YAAI;AACF,cAAI,MAAM,gEAAgE,UAAU,MAAM,EAAE;AAC5F,gBAAM,SAAS,KAAK,MAAM,SAAS;AAEnC,gBAAM,SAA2B,KAAK,iCAAiC,MAAM;AAE7E,cAAI;AAAA,YACF,4DAA4D,OAAO,MAAM,MAAM,cAAc,OAAO,SAAS,MAAM,oBAAoB,OAAO,eAAe,MAAM,eAAe,OAAO,UAAU,MAAM;AAAA,UAC3M;AACA,iBAAO;AAAA,QACT,QAAQ;AAAA,QAER;AAAA,MACF;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AAEZ,UAAI,MAAM,0EAA0E;AACpF,YAAM,UAAU,KAAK,oBAAoB,OAAO;AAChD,UAAI,QAAQ,MAAM,SAAS,KAAK,QAAQ,SAAS,SAAS,GAAG;AAC3D,YAAI;AAAA,UACF,kCAAkC,QAAQ,MAAM,MAAM;AAAA,QACxD;AACA,eAAO;AAAA,MACT;AAGA,YAAM,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC9D,UAAI,MAAM,0CAA0C,MAAM,EAAE;AAC5D,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,wBACZ,cACA,kBACkC;AAClC,QAAI,CAAC,KAAK,OAAQ,QAAO;AAEzB,UAAM,cAAc,8BAA8B,KAAK,OAAO,OAAO,KAAK,OAAO,2BAA2B;AAAA,MAC1G,cAAc,KAAK,qCAAqC;AAAA,IAC1D,CAAC;AACD,QAAI,MAAM,0CAA0C,KAAK,OAAO,KAAK,gBAAgB,KAAK,UAAU,WAAW,CAAC,EAAE;AAElH,UAAM,WAAW,MAAM,KAAK,OAAO,KAAK,YAAY,OAAO;AAAA,MACzD,OAAO,KAAK,OAAO;AAAA,MACnB,UAAU;AAAA,QACR;AAAA,UACE,MAAM;AAAA,UACN,SACE,KAAK,4BAA4B,gBAAgB,IACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAQJ;AAAA,QACA,EAAE,MAAM,QAAQ,SAAS,aAAa;AAAA,MACxC;AAAA,MACA,GAAG;AAAA,IACL,CAAC;AAED,UAAM,UAAU,SAAS,UAAU,CAAC,GAAG,SAAS,SAAS,KAAK;AAC9D,QAAI,CAAC,SAAS;AACZ,UAAI,KAAK,0DAAqD,KAAK,UAAU,SAAS,SAAS,UAAU,CAAC,CAAC,iBAAiB,SAAS,UAAU,CAAC,GAAG,iBAAiB,KAAK,EAAE;AAC3K,aAAO;AAAA,IACT;AAEA,QAAI;AAAA,MACF,iDAAiD,QAAQ,MAAM;AAAA,IACjE;AAEA,eAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,UAAI;AACF,cAAM,SAAS,KAAK,MAAM,SAAS;AAEnC,eAAO,KAAK,iCAAiC,MAAM;AAAA,MACrD,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,KAAK,iFAAiF,QAAQ,MAAM,GAAG,GAAG,CAAC,GAAG;AAClH,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,oBAAoB,SAAmC;AAC7D,UAAM,oBAAoB,oBAAI,IAAI;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AACD,UAAM,qBAAqB,oBAAI,IAAI;AAAA,MACjC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAED,UAAM,QAAmC,CAAC;AAC1C,UAAM,WAAyC,CAAC;AAEhD,QAAI;AAEF,YAAM,YAAY;AAClB,UAAI;AACJ,cAAQ,QAAQ,UAAU,KAAK,OAAO,OAAO,MAAM;AACjD,cAAM,SAAS,MAAM,CAAC;AACtB,cAAM,WAAW,kBAAkB,IAAI,MAAM,IAAK,SAA2D;AAC7G,cAAM,KAAK;AAAA,UACT;AAAA,UACA,SAAS,MAAM,CAAC,EAAE,QAAQ,QAAQ,IAAI,EAAE,QAAQ,QAAQ,GAAG;AAAA,UAC3D,YAAY,WAAW,MAAM,CAAC,CAAC;AAAA,UAC/B,MAAM,CAAC;AAAA,QACT,CAAC;AAAA,MACH;AAGA,YAAM,cAAc;AACpB,cAAQ,QAAQ,YAAY,KAAK,OAAO,OAAO,MAAM;AACnD,cAAM,UAAU,MAAM,CAAC;AACvB,cAAM,OAAO,mBAAmB,IAAI,OAAO,IAAK,UAA2D;AAC3G,iBAAS,KAAK;AAAA,UACZ,MAAM,MAAM,CAAC;AAAA,UACb;AAAA,UACA,OAAO,CAAC;AAAA,QACV,CAAC;AAAA,MACH;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,WAAO,EAAE,OAAO,UAAU,gBAAgB,CAAC,GAAG,WAAW,CAAC,EAAE;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA,EAKQ,4BAA4B,kBAAqC;AACvE,WAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uGAY4F,KAAK,OAAO,8BAA8B;AAAA,+LAC8C,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sCAO3J,KAAK,OAAO,8BAA8B,aAAa,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gEAc/B,KAAK,OAAO,uCAAuC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iFAavC,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS5E,oBAAoB,iBAAiB,SAAS,IAAI;AAAA;AAAA,EAElD,iBAAiB,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,IAGzB,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeJ;AAAA,EAEA,MAAM,YACJ,aACA,kBACA,gBAC8B;AAC9B,UAAM,UAAU,YACb;AAAA,MACC,CAAC,MACC,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,QAAQ,KAAK,EAAE,OAAO;AAAA,IAClE,EACC,KAAK,IAAI;AAEZ,UAAM,eAAe,iBAClB,MAAM,GAAG,EACT;AAAA,MACC,CAAC,MACC,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,QAAQ,KAAK,EAAE,OAAO;AAAA,IAClE,EACC,KAAK,IAAI;AAEZ,UAAM,WAAW,OAAO,WAAW;AACnC,SAAK,KAAK,EAAE,MAAM,aAAa,SAAS,UAAU,OAAO,KAAK,OAAO,OAAO,WAAW,iBAAiB,OAAO,QAAQ,CAAC;AACxH,UAAM,aAAa,KAAK,IAAI;AAG5B,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,cAAc,MAAM,KAAK,wBAAwB,SAAS,cAAc,cAAc;AAC5F,YAAI,aAAa;AACf,gBAAM,aAAa,KAAK,IAAI,IAAI;AAChC,eAAK,KAAK,EAAE,MAAM,WAAW,SAAS,UAAU,OAAO,KAAK,OAAO,eAAe,WAAW,iBAAiB,WAAW,CAAC;AAC1H,cAAI,MAAM,wCAAmC,YAAY,MAAM,MAAM,YAAY;AACjF,iBAAO,KAAK,4BAA4B,WAAW;AAAA,QACrD;AACA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,uDAAuD;AAChE,iBAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,eAAe,CAAC,EAAE;AAAA,QAC5D;AACA,YAAI,KAAK,kEAAkE;AAAA,MAC7E,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,yDAAyD,GAAG;AACrE,iBAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,eAAe,CAAC,EAAE;AAAA,QAC5D;AACA,YAAI,KAAK,+DAA+D,GAAG;AAAA,MAC7E;AAAA,IACF;AAEA,UAAM,iBAAiB,MAAM,KAAK;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,QACE;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,+CAW4B,KAAK,OAAO,8BAA8B;AAAA,oQACsK,EAAE;AAAA,QACzP;AAAA,QACA;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA,EACjB,kBAAkB,SAAS;AAAA;AAAA;AAAA,EAG3B,gBAAgB,QAAQ;AAAA;AAAA;AAAA,EAGxB,OAAO;AAAA;AAAA;AAAA,QAGD;AAAA,MACF;AAAA,MACA,EAAE,aAAa,KAAK,WAAW,KAAK;AAAA,IACtC;AACA,QAAI,gBAAgB;AAClB,UAAI,MAAM,kBAAkB,eAAe,MAAM,MAAM,yBAAyB;AAChF,aAAO,KAAK,4BAA4B;AAAA,QACtC,OAAO,eAAe;AAAA,QACtB,gBAAgB,eAAe;AAAA,QAC/B,eAAe,eAAe;AAAA,MAChC,CAAC;AAAA,IACH;AAGA,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAI,KAAK,8EAAyE;AAClF,aAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,eAAe,CAAC,EAAE;AAAA,IAC5D;AAEA,QAAI;AACF,YAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,+CAWiB,KAAK,OAAO,8BAA8B;AAAA,oQACsK,EAAE;AAAA;AAAA;AAAA,EAG/P,kBAAkB,SAAS;AAAA;AAAA;AAAA,EAG3B,gBAAgB,QAAQ;AAAA;AAAA;AAAA,EAGxB,OAAO;AAAA;AAAA;AAAA,EAGP,6BAA6B;AAEzB,YAAM,WAAW,MAAM,KAAK,OAAO,KAAK,YAAY,OAAO;AAAA,QACzD,OAAO,KAAK,OAAO;AAAA,QACnB,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,UAC3C,EAAE,MAAM,QAAQ,SAAS,sDAAsD;AAAA,QACjF;AAAA,QACA,GAAI,KAAK,OAAO,oBAAoB,SAAS,EAAE,kBAAkB,KAAK,OAAO,gBAAgB,IAAI,CAAC;AAAA,QAClG,GAAG,8BAA8B,KAAK,OAAO,OAAO,MAAM;AAAA,UACxD,cAAc,KAAK,qCAAqC;AAAA,QAC1D,CAAC;AAAA,MACH,CAAC;AAED,YAAM,aAAa,SAAS,UAAU,CAAC,GAAG,SAAS,SAAS,KAAK;AACjE,YAAM,cAAc,KAAK,IAAI,IAAI;AACjC,YAAM,SAAU,SAAiB;AAEjC,UAAI,SAAc;AAClB,UAAI,YAAY;AACd,mBAAW,aAAa,sBAAsB,UAAU,GAAG;AACzD,cAAI;AACF,qBAAS,KAAK,MAAM,SAAS;AAC7B;AAAA,UACF,QAAQ;AAAA,UAER;AAAA,QACF;AAAA,MACF;AAEA,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QAAW,SAAS;AAAA,QAAU,OAAO,KAAK,OAAO;AAAA,QAAO,WAAW;AAAA,QAAiB,YAAY;AAAA,QACtG,QAAQ,SAAS,KAAK,UAAU,MAAM,EAAE,MAAM,GAAG,GAAI,IAAI;AAAA,QACzD,YAAY,SAAS,EAAE,OAAO,OAAO,eAAe,QAAQ,OAAO,mBAAmB,OAAO,OAAO,aAAa,IAAI;AAAA,MACvH,CAAC;AAED,UAAI,UAAU,MAAM,QAAQ,OAAO,KAAK,GAAG;AACzC,YAAI;AAAA,UACF,kBAAkB,OAAO,MAAM,MAAM;AAAA,QACvC;AACA,eAAO,KAAK,4BAA4B;AAAA,UACtC,OAAO,OAAO;AAAA,UACd,gBAAgB,MAAM,QAAQ,OAAO,cAAc,IAAI,OAAO,iBAAiB,CAAC;AAAA,UAChF,eAAe,MAAM,QAAQ,OAAO,aAAa,IAAI,OAAO,gBAAgB,CAAC;AAAA,QAC/E,CAAC;AAAA,MACH;AAEA,UAAI,KAAK,yCAAyC;AAClD,aAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,eAAe,CAAC,EAAE;AAAA,IAC5D,SAAS,KAAK;AACZ,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QAAa,SAAS;AAAA,QAAU,OAAO,KAAK,OAAO;AAAA,QAAO,WAAW;AAAA,QAC3E,YAAY,KAAK,IAAI,IAAI;AAAA,QAAY,OAAO,OAAO,GAAG;AAAA,MACxD,CAAC;AACD,UAAI,MAAM,wBAAwB,GAAG;AACrC,aAAO,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,GAAG,eAAe,CAAC,EAAE;AAAA,IAC5D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,wBACZ,SACA,cACA,gBACqC;AAErC,UAAM,eAAe,KAAK,cAAc;AAAA,MACtC,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AACA,QAAI,MAAM,gCAAgC,aAAa,WAAW,EAAE;AAEpE,UAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,+CAW4B,KAAK,OAAO,8BAA8B;AAAA,oQACsK,EAAE;AAAA;AAAA;AAAA,EAG/P,kBAAkB,SAAS;AAAA;AAAA;AAAA,EAG3B,gBAAgB,QAAQ;AAAA;AAAA;AAAA,EAGxB,OAAO;AAAA;AAAA;AAAA,EAGP,6BAA6B;AAE3B,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,iEAAiE;AAAA,QAC5F,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,QACE,aAAa;AAAA,QACb,WAAW,aAAa;AAAA,QACxB,WAAW;AAAA,QACX,UAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,UAAU,SAAS;AACtB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,UAAU,SAAS,QAAQ,KAAK;AACtC,iBAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,SAAS;AACnC,iBAAO;AAAA,YACL,OAAO,MAAM,QAAS,OAAe,KAAK,IAAK,OAAe,QAAQ,CAAC;AAAA,YACvE,gBAAgB,MAAM,QAAS,OAAe,cAAc,IACvD,OAAe,iBAChB,CAAC;AAAA,YACL,eAAe,MAAM,QAAS,OAAe,aAAa,IACrD,OAAe,gBAChB,CAAC;AAAA,UACP;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,KAAK,2DAA2D,GAAG;AACvE,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,mBACJ,oBACA,cAAsB,IACkE;AACxF,UAAM,WAAW,OAAO,WAAW;AACnC,SAAK,KAAK,EAAE,MAAM,aAAa,SAAS,UAAU,OAAO,KAAK,OAAO,OAAO,WAAW,yBAAyB,OAAO,mBAAmB,MAAM,GAAG,GAAI,EAAE,CAAC;AAC1J,UAAM,aAAa,KAAK,IAAI;AAG5B,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,cAAc,MAAM,KAAK,+BAA+B,oBAAoB,WAAW;AAC7F,YAAI,aAAa;AACf,gBAAM,aAAa,KAAK,IAAI,IAAI;AAChC,eAAK,KAAK,EAAE,MAAM,WAAW,SAAS,UAAU,OAAO,KAAK,OAAO,eAAe,WAAW,yBAAyB,WAAW,CAAC;AAClI,cAAI,MAAM,wDAAmD,YAAY,YAAY,QAAQ;AAC7F,iBAAO;AAAA,QACT;AACA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,+DAA+D;AACxE,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,0EAA0E;AAAA,MACrF,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,iEAAiE,GAAG;AAC7E,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,uEAAuE,GAAG;AAAA,MACrF;AAAA,IACF;AAEA,UAAM,kBAAkB,MAAM,KAAK;AAAA,MACjC;AAAA,MACA;AAAA,MACA;AAAA,MACA,sCAAsC,WAAW;AAAA,MACjD;AAAA,QACE;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAOC,WAAW;AAAA;AAAA;AAAA;AAAA,QAIvB;AAAA,QACA,EAAE,MAAM,QAAQ,SAAS,mBAAmB;AAAA,MAC9C;AAAA,MACA,EAAE,aAAa,KAAK,WAAW,KAAK;AAAA,IACtC;AACA,QAAI,iBAAiB;AACnB,UAAI;AAAA,QACF,kCAAkC,gBAAgB,YAAY,iBAAY,gBAAgB,OAAO;AAAA,MACnG;AACA,aAAO;AAAA,IACT;AAGA,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAI,KAAK,sFAAiF;AAC1F,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAOV,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAYzB,YAAM,WAAW,MAAM,KAAK,OAAO,KAAK,YAAY,OAAO;AAAA,QACzD,OAAO,KAAK,OAAO;AAAA,QACnB,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,UAC3C,EAAE,MAAM,QAAQ,SAAS,mBAAmB;AAAA,QAC9C;AAAA,QACA,GAAI,KAAK,OAAO,oBAAoB,SAAS,EAAE,kBAAkB,KAAK,OAAO,gBAAgB,IAAI,CAAC;AAAA,QAClG,GAAG,8BAA8B,KAAK,OAAO,OAAO,MAAM;AAAA,UACxD,cAAc,KAAK,qCAAqC;AAAA,QAC1D,CAAC;AAAA,MACH,CAAC;AAED,YAAM,aAAa,SAAS,UAAU,CAAC,GAAG,SAAS,SAAS,KAAK;AACjE,YAAM,cAAc,KAAK,IAAI,IAAI;AACjC,YAAM,SAAU,SAAiB;AAEjC,UAAI,SAAc;AAClB,UAAI,YAAY;AACd,mBAAW,aAAa,sBAAsB,UAAU,GAAG;AACzD,cAAI;AACF,qBAAS,KAAK,MAAM,SAAS;AAC7B;AAAA,UACF,QAAQ;AAAA,UAER;AAAA,QACF;AAAA,MACF;AAEA,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QAAW,SAAS;AAAA,QAAU,OAAO,KAAK,OAAO;AAAA,QAAO,WAAW;AAAA,QAAyB,YAAY;AAAA,QAC9G,QAAQ,SAAS,OAAO,UAAU;AAAA,QAClC,YAAY,SAAS,EAAE,OAAO,OAAO,eAAe,QAAQ,OAAO,mBAAmB,OAAO,OAAO,aAAa,IAAI;AAAA,MACvH,CAAC;AAED,UAAI,UAAU,OAAO,OAAO,wBAAwB,UAAU;AAC5D,YAAI;AAAA,UACF,kCAAkC,OAAO,gBAAgB,CAAC,iBAAY,OAAO,WAAW,EAAE;AAAA,QAC5F;AACA,eAAO;AAAA,UACL,qBAAqB,OAAO;AAAA,UAC5B,cAAc,OAAO,OAAO,gBAAgB,CAAC;AAAA,UAC7C,SAAS,OAAO,OAAO,WAAW,EAAE;AAAA,QACtC;AAAA,MACF;AAEA,UAAI,KAAK,iDAAiD;AAC1D,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QAAa,SAAS;AAAA,QAAU,OAAO,KAAK,OAAO;AAAA,QAAO,WAAW;AAAA,QAC3E,YAAY,KAAK,IAAI,IAAI;AAAA,QAAY,OAAO,OAAO,GAAG;AAAA,MACxD,CAAC;AACD,UAAI,MAAM,gCAAgC,GAAG;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,+BACZ,oBACA,cAAsB,IACkE;AAExF,UAAM,eAAe,KAAK,cAAc;AAAA,MACtC,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AACA,QAAI,MAAM,wCAAwC,aAAa,WAAW,EAAE;AAE5E,UAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oBAOC,WAAW;AAAA;AAAA;AAAA;AAAA,EAI7B,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAShB,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,kEAAkE;AAAA,QAC7F,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,QACE,aAAa;AAAA,QACb,WAAW,aAAa;AAAA,QACxB,WAAW;AAAA,QACX,UAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,UAAU,SAAS;AACtB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,UAAU,SAAS,QAAQ,KAAK;AACtC,iBAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,SAAS;AACnC,iBAAO;AAAA,YACL,qBAAqB,OAAQ,OAAe,uBAAuB,EAAE;AAAA,YACrE,cAAc,OAAQ,OAAe,gBAAgB,CAAC;AAAA,YACtD,SAAS,OAAQ,OAAe,WAAW,EAAE;AAAA,UAC/C;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,KAAK,mEAAmE,GAAG;AAC/E,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,oBACJ,qBACA,uBACgE;AAChE,UAAM,WAAW,OAAO,WAAW;AACnC,SAAK,KAAK,EAAE,MAAM,aAAa,SAAS,UAAU,OAAO,KAAK,OAAO,OAAO,WAAW,0BAA0B,OAAO,oBAAoB,MAAM,GAAG,GAAI,EAAE,CAAC;AAC5J,UAAM,aAAa,KAAK,IAAI;AAG5B,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,cAAc,MAAM,KAAK,gCAAgC,mBAAmB;AAClF,YAAI,aAAa;AACf,gBAAM,aAAa,KAAK,IAAI,IAAI;AAChC,eAAK,KAAK,EAAE,MAAM,WAAW,SAAS,UAAU,OAAO,KAAK,OAAO,eAAe,WAAW,0BAA0B,WAAW,CAAC;AACnI,cAAI,MAAM,iDAA4C,YAAY,gBAAgB,MAAM,WAAW;AACnG,iBAAO;AAAA,QACT;AACA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,gEAAgE;AACzE,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,2EAA2E;AAAA,MACtF,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,kEAAkE,GAAG;AAC9E,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,wEAAwE,GAAG;AAAA,MACtF;AAAA,IACF;AAEA,UAAM,mBAAmB,MAAM,KAAK;AAAA,MAClC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,QACE;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAUX;AAAA,QACA,EAAE,MAAM,QAAQ,SAAS,oBAAoB;AAAA,MAC/C;AAAA,MACA,EAAE,aAAa,KAAK,WAAW,KAAK;AAAA,IACtC;AACA,QAAI,kBAAkB;AACpB,UAAI;AAAA,QACF,2BAA2B,iBAAiB,gBAAgB,MAAM;AAAA,MACpE;AACA,aAAO;AAAA,IACT;AAGA,QAAI,CAAC,KAAK,QAAQ;AAChB,UAAI,KAAK,uFAAkF;AAC3F,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAiBxB,YAAM,WAAW,MAAM,KAAK,OAAO,KAAK,YAAY,OAAO;AAAA,QACzD,OAAO,KAAK,OAAO;AAAA,QACnB,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,UAC3C,EAAE,MAAM,QAAQ,SAAS,oBAAoB;AAAA,QAC/C;AAAA,QACA,GAAI,KAAK,OAAO,oBAAoB,SAAS,EAAE,kBAAkB,KAAK,OAAO,gBAAgB,IAAI,CAAC;AAAA,QAClG,GAAG,8BAA8B,KAAK,OAAO,OAAO,MAAM;AAAA,UACxD,cAAc,KAAK,qCAAqC;AAAA,QAC1D,CAAC;AAAA,MACH,CAAC;AAED,YAAM,aAAa,SAAS,UAAU,CAAC,GAAG,SAAS,SAAS,KAAK;AACjE,YAAM,cAAc,KAAK,IAAI,IAAI;AACjC,YAAM,SAAU,SAAiB;AAEjC,UAAI,SAAc;AAClB,UAAI,YAAY;AACd,mBAAW,aAAa,sBAAsB,UAAU,GAAG;AACzD,cAAI;AACF,qBAAS,KAAK,MAAM,SAAS;AAC7B;AAAA,UACF,QAAQ;AAAA,UAER;AAAA,QACF;AAAA,MACF;AAEA,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QAAW,SAAS;AAAA,QAAU,OAAO,KAAK,OAAO;AAAA,QAAO,WAAW;AAAA,QAA0B,YAAY;AAAA,QAC/G,QAAQ,SAAS,OAAO,UAAU;AAAA,QAClC,YAAY,SAAS,EAAE,OAAO,OAAO,eAAe,QAAQ,OAAO,mBAAmB,OAAO,OAAO,aAAa,IAAI;AAAA,MACvH,CAAC;AAED,UAAI,UAAU,MAAM,QAAQ,OAAO,eAAe,GAAG;AACnD,cAAM,kBAAkB,OAAO,gBAC5B,OAAO,CAAC,YAAqB,OAAO,YAAY,QAAQ,EACxD,IAAI,CAAC,YAAoB,QAAQ,KAAK,CAAC,EACvC,OAAO,CAAC,YAAoB,QAAQ,SAAS,CAAC;AACjD,YAAI;AAAA,UACF,2BAA2B,gBAAgB,MAAM;AAAA,QACnD;AACA,eAAO;AAAA,UACL;AAAA,UACA,SAAS,OAAO,OAAO,WAAW,EAAE;AAAA,QACtC;AAAA,MACF;AAEA,UAAI,KAAK,kDAAkD;AAC3D,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,WAAK,KAAK;AAAA,QACR,MAAM;AAAA,QAAa,SAAS;AAAA,QAAU,OAAO,KAAK,OAAO;AAAA,QAAO,WAAW;AAAA,QAC3E,YAAY,KAAK,IAAI,IAAI;AAAA,QAAY,OAAO,OAAO,GAAG;AAAA,MACxD,CAAC;AACD,UAAI,MAAM,iCAAiC,GAAG;AAC9C,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,gCACZ,qBACgE;AAEhE,UAAM,eAAe,KAAK,cAAc;AAAA,MACtC,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AACA,QAAI,MAAM,yCAAyC,aAAa,WAAW,EAAE;AAE7E,UAAM,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYjB,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQjB,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,oEAAoE;AAAA,QAC/F,EAAE,MAAM,QAAQ,SAAS,OAAO;AAAA,MAClC;AAAA,MACA;AAAA,QACE,aAAa;AAAA,QACb,WAAW,aAAa;AAAA,QACxB,WAAW;AAAA,QACX,UAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,UAAU,SAAS;AACtB,aAAO;AAAA,IACT;AAEA,QAAI;AACF,YAAM,UAAU,SAAS,QAAQ,KAAK;AACtC,iBAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,SAAS;AACnC,iBAAO;AAAA,YACL,iBAAiB,MAAM,QAAS,OAAe,eAAe,IACzD,OAAe,kBAChB,CAAC;AAAA,YACL,SAAS,OAAQ,OAAe,WAAW,EAAE;AAAA,UAC/C;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,KAAK,oEAAoE,GAAG;AAChF,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,oBACJ,WACA,gBACiD;AACjD,UAAM,QAAQ,+BAA+B,eAAe,OAAO;AAAA,YAC3D,eAAe,QAAQ;AAAA,WACxB,eAAe,OAAO;AAAA;AAAA;AAAA,YAGrB,UAAU,QAAQ;AAAA,WACnB,UAAU,OAAO;AAExB,QAAI;AACF,YAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAuBxB,UAAI,KAAK,mBAAmB;AAC1B,YAAI;AACF,gBAAM,gBAAgB,MAAM,KAAK,SAAS;AAAA,YACxC;AAAA,cACE,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,cAC3C,EAAE,MAAM,QAAQ,SAAS,MAAM;AAAA,YACjC;AAAA,YACA;AAAA,cACE,aAAa;AAAA,cACb,WAAW;AAAA,cACX,WAAW;AAAA,cACX,UAAU;AAAA,YACZ;AAAA,UACF;AACA,gBAAMA,cAAa,KAAK;AAAA,YACtB,KAAK,gBAAgB,eAAe,OAAO;AAAA,UAC7C;AACA,cAAIA,aAAY;AACd,gBAAI;AAAA,cACF,sCAAsCA,YAAW,kBAAkB,QAAQ,IAAI,iBAAiBA,YAAW,UAAU;AAAA,YACvH;AACA,mBAAOA;AAAA,UACT;AACA,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,0GAAqG;AAC9G,mBAAO;AAAA,UACT;AAAA,QACF,SAAS,KAAK;AACZ,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,8FAAyF,GAAG,EAAE;AACvG,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,KAAK,uBAAuB;AAC/B,cAAM,mBAAmB,MAAM,KAAK,YAAY;AAAA,UAC9C;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,YAC3C,EAAE,MAAM,QAAQ,SAAS,MAAM;AAAA,UACjC;AAAA,UACA,KAAK,iBAAiB,EAAE,aAAa,KAAK,WAAW,KAAK,CAAC;AAAA,QAC7D;AACA,cAAMA,cAAa,KAAK;AAAA,UACtB,KAAK,gBAAgB,kBAAkB,OAAO;AAAA,QAChD;AACA,YAAIA,aAAY;AACd,cAAI;AAAA,YACF,qCAAqCA,YAAW,kBAAkB,QAAQ,IAAI,iBAAiBA,YAAW,UAAU;AAAA,UACtH;AACA,iBAAOA;AAAA,QACT;AACA,YAAI,KAAK,sFAAiF;AAC1F,eAAO;AAAA,MACT;AAEA,YAAM,WAAW,MAAM,KAAK,OAAQ,KAAK,YAAY,OAAO;AAAA,QAC1D,OAAO,KAAK,OAAO;AAAA,QACnB,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,UAC3C,EAAE,MAAM,QAAQ,SAAS,MAAM;AAAA,QACjC;AAAA,QACA,GAAG,8BAA8B,KAAK,OAAO,OAAO,MAAM;AAAA,UACxD,cAAc,KAAK,qCAAqC;AAAA,QAC1D,CAAC;AAAA,MACH,CAAC;AAED,YAAM,aAAa,KAAK;AAAA,QACtB,KAAK,gBAAgB,SAAS,UAAU,CAAC,GAAG,SAAS,OAAO;AAAA,MAC9D;AACA,UAAI,YAAY;AACd,YAAI;AAAA,UACF,wBAAwB,WAAW,kBAAkB,QAAQ,IAAI,iBAAiB,WAAW,UAAU;AAAA,QACzG;AACA,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,qCAAqC,GAAG;AAClD,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,aACJ,WACA,mBACgC;AAChC,QAAI,kBAAkB,WAAW,GAAG;AAClC,aAAO,EAAE,OAAO,CAAC,EAAE;AAAA,IACrB;AAEA,UAAM,gBAAgB,kBACnB,IAAI,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE;AAAA,YAAe,EAAE,QAAQ;AAAA,WAAc,EAAE,OAAO,EAAE,EACtF,KAAK,MAAM;AAEd,UAAM,QAAQ;AAAA,YACN,UAAU,QAAQ;AAAA,WACnB,UAAU,OAAO;AAAA;AAAA;AAAA,EAG1B,aAAa;AAEX,QAAI;AACF,YAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoBxB,UAAI,KAAK,mBAAmB;AAC1B,YAAI;AACF,gBAAM,gBAAgB,MAAM,KAAK,SAAS;AAAA,YACxC;AAAA,cACE,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,cAC3C,EAAE,MAAM,QAAQ,SAAS,MAAM;AAAA,YACjC;AAAA,YACA;AAAA,cACE,aAAa;AAAA,cACb,WAAW;AAAA,cACX,WAAW;AAAA,cACX,UAAU;AAAA,YACZ;AAAA,UACF;AACA,gBAAMA,cAAa,KAAK,8BAA8B,KAAK,gBAAgB,eAAe,OAAO,CAAC;AAClG,cAAIA,aAAY;AACd,gBAAI,MAAM,aAAaA,YAAW,MAAM,MAAM,sBAAsB;AACpE,mBAAOA;AAAA,UACT;AACA,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,+FAA0F;AACnG,mBAAO;AAAA,UACT;AAAA,QACF,SAAS,KAAK;AACZ,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,mFAA8E,GAAG,EAAE;AAC5F,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,KAAK,uBAAuB;AAC/B,cAAM,mBAAmB,MAAM,KAAK,YAAY;AAAA,UAC9C;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,YAC3C,EAAE,MAAM,QAAQ,SAAS,MAAM;AAAA,UACjC;AAAA,UACA,KAAK,iBAAiB,EAAE,aAAa,KAAK,WAAW,KAAK,CAAC;AAAA,QAC7D;AACA,cAAMA,cAAa,KAAK,8BAA8B,KAAK,gBAAgB,kBAAkB,OAAO,CAAC;AACrG,YAAIA,aAAY;AACd,cAAI,MAAM,aAAaA,YAAW,MAAM,MAAM,qBAAqB;AACnE,iBAAOA;AAAA,QACT;AACA,YAAI,KAAK,2EAAsE;AAC/E,eAAO;AAAA,MACT;AAEA,YAAM,WAAW,MAAM,KAAK,OAAQ,KAAK,YAAY,OAAO;AAAA,QAC1D,OAAO,KAAK,OAAO;AAAA,QACnB,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,UAC3C,EAAE,MAAM,QAAQ,SAAS,MAAM;AAAA,QACjC;AAAA,QACA,GAAG,8BAA8B,KAAK,OAAO,OAAO,MAAM;AAAA,UACxD,cAAc,KAAK,qCAAqC;AAAA,QAC1D,CAAC;AAAA,MACH,CAAC;AAED,YAAM,aAAa,KAAK;AAAA,QACtB,KAAK,gBAAgB,SAAS,UAAU,CAAC,GAAG,SAAS,OAAO;AAAA,MAC9D;AACA,UAAI,YAAY;AACd,YAAI,MAAM,aAAa,WAAW,MAAM,MAAM,QAAQ;AACtD,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,0BAA0B,GAAG;AACvC,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,mBAAmB,UAAwE;AAC/F,QAAI,CAAC,KAAK,OAAO,mBAAmB;AAClC,UAAI,KAAK,+CAA0C;AACnD,aAAO;AAAA,IACT;AAEA,UAAM,gBAAgB,yBAAyB,QAAQ;AACvD,QAAI,cAAc,WAAW,EAAG,QAAO;AAEvC,UAAM,kBAAkB,MAAM,qBAAqB;AAGnD,QAAI,mBAAmB;AACvB,QAAI;AACF,yBAAmB,MAAM,gCAAgC,KAAK,MAAM;AAAA,IACtE,QAAQ;AAAA,IAER;AAEA,UAAM,aAAa;AAAA;AAAA,EAErB,aAAa,GAAG,iBAAiB,SAAS,IAAI;AAAA;AAAA,EAAO,gBAAgB,KAAK,EAAE;AAC1E,UAAM,UAAU,OAAO,WAAW;AAClC,UAAM,YAAY,KAAK,IAAI;AAC3B,SAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,eAAe,OAAO,cAAc,MAAM,GAAG,GAAI,EAAE,CAAC;AAEjI,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,gBAAgB,MAAM,KAAK,SAAS;AAAA,UACxC;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,GAAG,eAAe;AAAA;AAAA,yBAEhC;AAAA,YACb,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,UACtC;AAAA,UACA;AAAA,YACE,aAAa;AAAA,YACb,WAAW;AAAA,YACX,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,QACF;AACA,cAAM,aAAa,KAAK,0BAA0B,KAAK,gBAAgB,eAAe,OAAO,CAAC;AAC9F,YAAI,YAAY;AACd,eAAK,KAAK,EAAE,MAAM,WAAW,SAAS,OAAO,KAAK,OAAO,eAAe,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,QAAQ,KAAK,UAAU,UAAU,EAAE,MAAM,GAAG,GAAI,EAAE,CAAC;AACzL,cAAI,MAAM,wCAAwC,WAAW,QAAQ,MAAM,WAAW;AACtF,iBAAO;AAAA,QACT;AACA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,eAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,eAAe,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,OAAO,wDAAwD,CAAC;AACxM,cAAI,KAAK,kFAA6E;AACtF,iBAAO;AAAA,QACT;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,eAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,eAAe,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,OAAO,OAAO,GAAG,EAAE,CAAC;AAC5J,cAAI,KAAK,sEAAiE,GAAG,EAAE;AAC/E,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAEA,UAAM,iBAAiB,MAAM,KAAK;AAAA,MAChC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,GAAG,eAAe;AAAA;AAAA,yBAE5B;AAAA,QACjB,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,MACtC;AAAA,MACA,EAAE,aAAa,KAAK,WAAW,KAAK;AAAA,IACtC;AACA,QAAI,gBAAgB;AAClB,YAAM,aAAa,KAAK,0BAA0B,cAAc;AAChE,UAAI,YAAY;AACd,YAAI,MAAM,uCAAuC,WAAW,QAAQ,MAAM,WAAW;AACrF,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,KAAK,uBAAuB;AAC9B,UAAI;AACF,cAAM,WAAW,MAAO,KAAK,OAAe,UAAU,OAAO;AAAA,UAC3D,OAAO,KAAK,OAAO;AAAA,UACnB,cAAc,GAAG,eAAe;AAAA;AAAA;AAAA,UAChC,OAAO;AAAA,UACP,mBAAmB;AAAA,QACrB,CAAC;AACD,cAAM,UAAU,OAAO,SAAS,gBAAgB,WAAW,SAAS,cAAc,KAAK,UAAU,SAAS,eAAe,EAAE;AAC3H,cAAM,aAAa,KAAK,0BAA0B,KAAK,gBAAgB,OAAO,CAAC;AAC/E,YAAI,YAAY;AACd,eAAK,KAAK,EAAE,MAAM,WAAW,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,QAAQ,KAAK,UAAU,UAAU,EAAE,MAAM,GAAG,GAAI,EAAE,CAAC;AACjL,cAAI,MAAM,4CAA4C,WAAW,QAAQ,MAAM,WAAW;AAC1F,iBAAO;AAAA,QACT;AACA,aAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,OAAO,4CAA4C,CAAC;AAAA,MACtL,SAAS,KAAK;AACZ,aAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,OAAO,yBAAyB,GAAG,GAAG,CAAC;AAAA,MACzK;AAAA,IACF;AAEA,SAAK,KAAK,EAAE,MAAM,aAAa,SAAS,OAAO,KAAK,OAAO,OAAO,WAAW,eAAe,YAAY,KAAK,IAAI,IAAI,WAAW,OAAO,uEAAuE,CAAC;AAC/M,QAAI,KAAK,2DAAsD;AAC/D,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,kBACJ,UACqC;AACrC,QAAI,SAAS,WAAW,EAAG,QAAO;AAElC,UAAM,aAAa,SAChB,IAAI,CAAC,MAAM,IAAI,EAAE,EAAE,MAAM,EAAE,QAAQ,KAAK,EAAE,QAAQ,MAAM,GAAG,EAAE,CAAC;AAAA,EAAM,EAAE,OAAO,EAAE,EAC/E,KAAK,MAAM;AAEd,QAAI;AACF,YAAM,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAoBxB,UAAI,KAAK,mBAAmB;AAC1B,YAAI;AACF,gBAAM,gBAAgB,MAAM,KAAK,SAAS;AAAA,YACxC;AAAA,cACE,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,cAC3C,EAAE,MAAM,QAAQ,SAAS,mBAAmB,SAAS,MAAM;AAAA;AAAA,EAAiB,UAAU,GAAG;AAAA,YAC3F;AAAA,YACA;AAAA,cACE,aAAa;AAAA,cACb,WAAW;AAAA,cACX,WAAW;AAAA,cACX,UAAU;AAAA,YACZ;AAAA,UACF;AACA,gBAAMA,cAAa,KAAK,6BAA6B,KAAK,gBAAgB,eAAe,OAAO,CAAC;AACjG,cAAIA,aAAY;AACd,gBAAI;AAAA,cACF,cAAc,SAAS,MAAM,kBAAkBA,YAAW,SAAS,MAAM;AAAA,YAC3E;AACA,mBAAOA;AAAA,UACT;AACA,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,6FAAwF;AACjG,mBAAO;AAAA,UACT;AAAA,QACF,SAAS,KAAK;AACZ,cAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,gBAAI,KAAK,iFAA4E,GAAG,EAAE;AAC1F,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAEA,UAAI,CAAC,KAAK,uBAAuB;AAC/B,cAAM,mBAAmB,MAAM,KAAK,YAAY;AAAA,UAC9C;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,YAC3C,EAAE,MAAM,QAAQ,SAAS,mBAAmB,SAAS,MAAM;AAAA;AAAA,EAAiB,UAAU,GAAG;AAAA,UAC3F;AAAA,UACA,KAAK,iBAAiB,EAAE,aAAa,KAAK,WAAW,KAAK,CAAC;AAAA,QAC7D;AACA,cAAMA,cAAa,KAAK,6BAA6B,KAAK,gBAAgB,kBAAkB,OAAO,CAAC;AACpG,YAAIA,aAAY;AACd,cAAI,MAAM,cAAc,SAAS,MAAM,kBAAkBA,YAAW,SAAS,MAAM,yBAAyB;AAC5G,iBAAOA;AAAA,QACT;AACA,YAAI,KAAK,yEAAoE;AAC7E,eAAO;AAAA,MACT;AAEA,YAAM,WAAW,MAAM,KAAK,OAAQ,KAAK,YAAY,OAAO;AAAA,QAC1D,OAAO,KAAK,OAAO;AAAA,QACnB,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,UAC3C,EAAE,MAAM,QAAQ,SAAS,mBAAmB,SAAS,MAAM;AAAA;AAAA,EAAiB,UAAU,GAAG;AAAA,QAC3F;AAAA,QACA,GAAG,8BAA8B,KAAK,OAAO,OAAO,MAAM;AAAA,UACxD,cAAc,KAAK,qCAAqC;AAAA,QAC1D,CAAC;AAAA,MACH,CAAC;AAED,YAAM,aAAa,KAAK;AAAA,QACtB,KAAK,gBAAgB,SAAS,UAAU,CAAC,GAAG,SAAS,OAAO;AAAA,MAC9D;AACA,UAAI,YAAY;AACd,YAAI,MAAM,cAAc,SAAS,MAAM,kBAAkB,WAAW,SAAS,MAAM,YAAY;AAC/F,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,+BAA+B,GAAG;AAC5C,aAAO;AAAA,IACT;AAAA,EACF;AACF;","names":["normalized"]}

package/dist/chunk-ZTSE2ZJ6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/temporal-supersession.ts"],"sourcesContent":["/**\n * Temporal Supersession (issue #375)\n *\n * When a new fact lands with `structuredAttributes` keyed on a known\n * `entityRef`, any prior fact whose supersession key collides with the new\n * fact's key is marked `status: \"superseded\"` and linked via\n * `supersededBy` / `supersededAt`.  Recall filters those superseded memories\n * by default so agents see only the \"current\" value per entity attribute.\n *\n * The algorithm is intentionally O(N) over the memory corpus per write, but\n * skips cheaply when the new fact has no structuredAttributes.  It reuses the\n * cached `readAllMemories()` path so cost is amortized with the rest of the\n * write pipeline.\n */\nimport type { MemoryFile, MemoryFrontmatter } from \"./types.js\";\nimport type { StorageManager } from \"./storage.js\";\nimport { log } from \"./logger.js\";\n\n/**\n * Shared normalization for supersession key components.\n *\n * Trims surrounding whitespace, lowercases, then collapses any run of\n * whitespace OR hyphens to a single hyphen, and strips any leading/trailing\n * hyphens that result.  Both `computeSupersessionKey` and\n * `lookupAttributeByNormalizedKey` must use this so that keys produced at\n * write time and keys used at lookup time are identical regardless of how\n * the LLM encoded whitespace, hyphens, or casing (Finding B fix).\n *\n * Symmetry guarantee: `\"foo bar\"`, `\"foo-bar\"`, `\"foo - bar\"`, and\n * `\"foo  bar\"` all canonicalize to `\"foo-bar\"`.\n *\n * Exported so external tests can verify the canonical form.\n */\nexport function normalizeSupersessionKey(raw: string): string {\n  return raw\n    .trim()\n    .toLowerCase()\n    .replace(/[\\s\\-]+/g, \"-\")\n    .replace(/^-+|-+$/g, \"\");\n}\n\n/**\n * Stable supersession key for an (entityRef, attributeName) pair.\n *\n * The algorithm is:\n *  - normalize the entityRef (trim, lower-case, collapse whitespace)\n *  - normalize the attributeName the same way\n *  - join with `::`\n *\n * Exported so tests and tools can recompute it without depending on storage.\n */\nexport function computeSupersessionKey(\n  entityRef: string | undefined,\n  attributeName: string,\n): string | null {\n  if (!entityRef || typeof entityRef !== \"string\") return null;\n  if (!attributeName || typeof attributeName !== \"string\") return null;\n  const entity = normalizeSupersessionKey(entityRef);\n  const attr = normalizeSupersessionKey(attributeName);\n  if (entity.length === 0 || attr.length === 0) return null;\n  return `${entity}::${attr}`;\n}\n\n/**\n * Compute the full set of supersession keys for a fact with structured\n * attributes.  Returns an empty array if no keys can be derived.\n */\nexport function supersessionKeysForFact(spec: {\n  entityRef?: string;\n  structuredAttributes?: Record<string, string>;\n}): string[] {\n  if (!spec.entityRef) return [];\n  if (!spec.structuredAttributes) return [];\n  const keys: string[] = [];\n  for (const attrName of Object.keys(spec.structuredAttributes)) {\n    const key = computeSupersessionKey(spec.entityRef, attrName);\n    if (key) keys.push(key);\n  }\n  return keys;\n}\n\n/**\n * Look up a structured-attribute value by a raw key, normalizing both sides\n * with `normalizeSupersessionKey` before comparing.  This ensures that keys\n * written by the LLM with mixed case, surrounding whitespace, or internal\n * whitespace (e.g. `\"City\"`, `\" city \"`, `\"job   title\"`, `\"job-title\"`)\n * are all matched against normalized keys produced by `computeSupersessionKey`\n * (Finding B fix — uses the same helper so both sides are identical).\n *\n * The storage format is NOT changed — we only normalize at lookup time.\n */\nexport function lookupAttributeByNormalizedKey(\n  attributes: Record<string, unknown>,\n  rawKey: string,\n): unknown {\n  const normalizedTarget = normalizeSupersessionKey(rawKey);\n  for (const [k, v] of Object.entries(attributes)) {\n    if (normalizeSupersessionKey(k) === normalizedTarget) return v;\n  }\n  return undefined;\n}\n\n/**\n * Decide whether an existing memory should be superseded by a newly-written\n * memory that carries the supplied supersession key set.\n *\n * Only memories that:\n *  - are currently `active`\n *  - share an `entityRef` with the new fact\n *  - share at least one supersession key with the new fact\n *  - are older than the new fact\n *  - have a conflicting value (different string) for the overlapping key\n * are eligible.  This keeps supersession local to the attribute that actually\n * changed — if fact A sets `{city: Austin, tool: vim}` and fact B sets\n * `{city: NYC}`, only the city attribute is superseded, not the tool.\n */\nexport function shouldSupersedeExisting(args: {\n  candidate: MemoryFrontmatter;\n  newEntityRef: string;\n  newAttributes: Record<string, string>;\n  newCreatedAt: string;\n  newMemoryId: string;\n}): { matchedKeys: string[] } | null {\n  const { candidate, newEntityRef, newAttributes, newCreatedAt, newMemoryId } = args;\n\n  if (candidate.id === newMemoryId) return null;\n  if (candidate.status && candidate.status !== \"active\") return null;\n  if (!candidate.entityRef) return null;\n  if (!candidate.structuredAttributes) return null;\n\n  // Reuse the shared `normalizeSupersessionKey` helper so this comparison\n  // cannot drift from the canonical form used to build supersession keys\n  // elsewhere in this file.\n  const candidateEntityNorm = normalizeSupersessionKey(candidate.entityRef);\n  const newEntityNorm = normalizeSupersessionKey(newEntityRef);\n  if (candidateEntityNorm !== newEntityNorm) return null;\n\n  // Must be older than the new fact — equal timestamps are ignored to avoid\n  // races within the same millisecond.\n  const candidateCreated = Date.parse(candidate.created);\n  const newCreated = Date.parse(newCreatedAt);\n  if (!Number.isFinite(candidateCreated) || !Number.isFinite(newCreated)) return null;\n  if (candidateCreated >= newCreated) return null;\n\n  const matchedKeys: string[] = [];\n  for (const [attrName, newValue] of Object.entries(newAttributes)) {\n    // Use normalized key lookup so mixed-case or whitespace-padded keys\n    // stored by the LLM are matched correctly (Finding 2 fix).\n    const candidateValue = lookupAttributeByNormalizedKey(\n      candidate.structuredAttributes,\n      attrName,\n    );\n    if (candidateValue === undefined) continue;\n    // Only supersede on conflicting values — identical values are a no-op.\n    if (normalizeValue(String(candidateValue)) === normalizeValue(newValue)) continue;\n    const key = computeSupersessionKey(newEntityRef, attrName);\n    if (key) matchedKeys.push(key);\n  }\n\n  return matchedKeys.length > 0 ? { matchedKeys } : null;\n}\n\nfunction normalizeValue(v: string): string {\n  return v.trim().toLowerCase();\n}\n\nexport interface TemporalSupersessionResult {\n  supersededIds: string[];\n  matchedKeys: string[];\n}\n\n/**\n * Scan existing memories and mark any that are superseded by the\n * just-written memory.  Fails open on I/O errors — the new memory is already\n * on disk, and supersession is a best-effort hygiene step.\n */\nexport async function applyTemporalSupersession(args: {\n  storage: StorageManager;\n  newMemoryId: string;\n  entityRef?: string;\n  structuredAttributes?: Record<string, string>;\n  createdAt: string;\n  enabled: boolean;\n  /**\n   * When true, skip the persisted `frontmatter.created` lookup and use\n   * `args.createdAt` directly as the ordering anchor.  Set this on the\n   * hash-dedup short-circuit path where `newMemoryId` points to an existing\n   * OLD fact (no new file is written) and its persisted timestamp would be\n   * stale relative to the incoming promotion event (PR #402 Finding Uyui).\n   */\n  useCallerTimestamp?: boolean;\n}): Promise<TemporalSupersessionResult> {\n  const empty: TemporalSupersessionResult = { supersededIds: [], matchedKeys: [] };\n  if (!args.enabled) return empty;\n  if (!args.entityRef) return empty;\n  if (!args.structuredAttributes) return empty;\n  if (Object.keys(args.structuredAttributes).length === 0) return empty;\n\n  const newKeys = supersessionKeysForFact({\n    entityRef: args.entityRef,\n    structuredAttributes: args.structuredAttributes,\n  });\n  if (newKeys.length === 0) return empty;\n\n  let hotMemories: MemoryFile[];\n  try {\n    hotMemories = await args.storage.readAllMemories();\n  } catch (err) {\n    log.warn(`temporal-supersession: readAllMemories failed: ${err}`);\n    return empty;\n  }\n\n  // Finding 1 fix: use the on-disk `frontmatter.created` of the newly-written\n  // memory rather than a wall-clock timestamp sampled after `writeMemory`\n  // returns.  In concurrent writers the two can differ by enough to cause\n  // wrong-direction supersession.  If the memory is not yet visible in the\n  // cache (edge case during fast concurrent writes) fall back to args.createdAt.\n  //\n  // PR #402 round-12 (Finding Uyui): on the hash-dedup early-return path the\n  // caller supplies the OLD matching fact's id as `newMemoryId` (no new file is\n  // written).  That makes `newMemoryFile.frontmatter.created` an arbitrarily\n  // old timestamp.  When `args.useCallerTimestamp` is set the caller explicitly\n  // opts out of the persisted-timestamp lookup so `args.createdAt` (the current\n  // wall-clock) is used directly, keeping ordering correct regardless of how\n  // old the matching fact is.\n  const newMemoryFile = hotMemories.find((m) => m.frontmatter.id === args.newMemoryId);\n  const persistedCreatedAt = args.useCallerTimestamp\n    ? args.createdAt\n    : (newMemoryFile?.frontmatter.created ?? args.createdAt);\n\n  const supersededIds: string[] = [];\n  const matchedKeys = new Set<string>();\n\n  // Process hot then cold.  Hot-then-cold ordering is safer because hot\n  // writes are more frequent and the CAS re-read guards against double-writes.\n  // A Set<string> of already-processed ids ensures that a memory visible in\n  // both tiers (same logical memory with different filesystem paths during a\n  // migration race) is processed at most once.  Keying on `frontmatter.id`\n  // is correct because the same logical memory has the same id regardless of\n  // which tier's directory it currently lives in (PR #402 Finding 1 fix).\n  // Fall back to path-based keying when id is absent (defensive).\n  const processedIds = new Set<string>();\n\n  // Finding UOGi fix (round-6): readAllColdMemories() performs a full uncached\n  // recursive directory scan of cold/.  After Finding UTsP broadened the scan\n  // to cover the entire cold root (not just facts/+corrections/), the per-call\n  // cost grows with the cold tree size.\n  //\n  // The fix is a TTL-based in-memory cache inside StorageManager\n  // (readAllColdMemories caches its result for COLD_SCAN_CACHE_TTL_MS) that is\n  // shared across consecutive supersession calls within the same write burst.\n  // The cache is invalidated automatically on any hot→cold demotion (which\n  // calls invalidateAllMemoriesCache, which also clears the cold cache) and\n  // expires after the TTL as a safety net.\n  //\n  // This means back-to-back structured-attribute writes in the same burst\n  // (e.g. batch extraction) pay the cold I/O cost at most once, not N times.\n  // Correctness is preserved because the cache TTL ensures eventual consistency\n  // and the invalidation hook covers the hot→cold path.\n\n  let coldMemories: MemoryFile[];\n  try {\n    coldMemories = await args.storage.readAllColdMemories();\n  } catch (err) {\n    log.warn(`temporal-supersession: readAllColdMemories failed: ${err}`);\n    coldMemories = [];\n  }\n\n  // Combine hot and cold memories into a single scan.  New memory itself is\n  // excluded inline.  We do NOT skip cold scan when hot produced zero\n  // supersessions — the P1 finding is precisely that stale cold facts leak\n  // when hot has no hits.\n  const allCandidates: MemoryFile[] = [...hotMemories, ...coldMemories];\n\n  for (const memory of allCandidates) {\n    if (memory.frontmatter.id === args.newMemoryId) continue;\n    const dedupeKey = memory.frontmatter.id ?? memory.path;\n    if (processedIds.has(dedupeKey)) continue;\n    // NOTE: do NOT call processedIds.add(dedupeKey) here.  We defer marking\n    // the id as processed until AFTER the CAS re-read succeeds.  If we mark\n    // it here and the re-read fails (e.g. the hot entry has already been\n    // migrated to cold storage), the same logical id that appears later in\n    // the cold tier scan would be silently skipped, leaving a stale cold\n    // fact unsuperseded.  Deferring ensures that a failed primary-tier read\n    // grants the alternate tier a chance to process the same id (PR #402\n    // round-6 Finding 1 fix).\n\n    const decision = shouldSupersedeExisting({\n      candidate: memory.frontmatter,\n      newEntityRef: args.entityRef,\n      newAttributes: args.structuredAttributes,\n      newCreatedAt: persistedCreatedAt,\n      newMemoryId: args.newMemoryId,\n    });\n    if (!decision) {\n      // No supersession decision — safe to mark as processed now so the\n      // alternate tier doesn't re-evaluate an identical non-matching entry.\n      processedIds.add(dedupeKey);\n      continue;\n    }\n\n    try {\n      // CAS-style re-read immediately before the write.  `readAllMemories()`\n      // is a snapshot — with concurrent writers, another run may have already\n      // superseded this candidate since we loaded it.  If we blindly trust the\n      // snapshot we can clobber a newer `supersededBy` link with a stale one.\n      //\n      // File storage offers no true locking, so the best we can do is:\n      //   1. re-read the exact file we're about to mutate\n      //   2. verify status is still \"active\" and no `supersededBy` is set\n      //   3. only then issue the write\n      // If the re-read shows a newer concurrent writer beat us to it, skip.\n      // This CAS pattern applies equally to hot and cold tier candidates.\n      // Mark as processed AFTER confirming the candidate is readable so that\n      // a migration-race read failure on the hot entry does not silently\n      // prevent the cold entry from being evaluated (Finding 1, round 6).\n      const fresh = await args.storage.readMemoryByPath(memory.path);\n      if (!fresh) {\n        log.debug(\n          `[engram] temporal supersession skipped candidate ${memory.frontmatter.id}: no longer readable at ${memory.path} — leaving id available for alternate tier`,\n        );\n        // Do NOT add to processedIds — allow the cold-tier copy to be\n        // evaluated in the next iteration of the same scan.\n        continue;\n      }\n      // Candidate is readable — mark the id as processed now to prevent the\n      // alternate tier from double-writing.\n      processedIds.add(dedupeKey);\n      const freshStatus = fresh.frontmatter.status ?? \"active\";\n      if (freshStatus !== \"active\" || fresh.frontmatter.supersededBy) {\n        log.debug(\n          `[engram] temporal supersession skipped candidate ${memory.frontmatter.id}: already superseded by concurrent writer`,\n        );\n        continue;\n      }\n\n      // Finding 2 fix: the `supersededAt` / `updated` timestamps written to the\n      // old fact must never run backwards relative to its own persisted\n      // `created` timestamp.  If the caller-supplied `args.createdAt` (which\n      // represents \"when the new replacing fact was authored\") is earlier than\n      // either the new fact's persisted `created` (T_new) or the old fact's\n      // persisted `created` (T_old), we'd be writing a nonsensical\n      // `supersededAt` that precedes the old memory's own creation.  Clamp to\n      // the monotonic maximum so time only moves forward.\n      // This monotonic clamp is applied for both hot and cold tier writes.\n      const oldCreatedMs = new Date(fresh.frontmatter.created).getTime();\n      const newCreatedMs = new Date(persistedCreatedAt).getTime();\n      const argCreatedMs = new Date(args.createdAt).getTime();\n      const maxMs = Math.max(\n        Number.isFinite(oldCreatedMs) ? oldCreatedMs : 0,\n        Number.isFinite(newCreatedMs) ? newCreatedMs : 0,\n        Number.isFinite(argCreatedMs) ? argCreatedMs : 0,\n      );\n      const supersededAt = new Date(maxMs).toISOString();\n\n      // Issue #680 — explicit fact lifecycle.  When the new fact\n      // supersedes this one, set the predecessor's `invalid_at` to the\n      // successor's effective valid_at.  Skip when the predecessor\n      // already carries an `invalid_at` so manual / earlier values\n      // are preserved (idempotent).\n      //\n      // Codex P1 on PR #713: in the hash-dedup early-return path\n      // (`useCallerTimestamp: true`), `newMemoryFile` is actually the\n      // OLD matching fact — no new file was written — so its\n      // `valid_at` is the predecessor's own old timestamp, not the\n      // successor's effective time. Use `persistedCreatedAt`\n      // directly in that path so the predecessor's invalid_at lines\n      // up with the caller's wall-clock, not the matching fact's old\n      // valid_at. The non-dedup path keeps the previous behavior\n      // (prefer the new file's explicit valid_at, fall back to its\n      // persisted created).\n      let invalidAtPatch: string | undefined;\n      if (!fresh.frontmatter.invalid_at) {\n        if (args.useCallerTimestamp) {\n          invalidAtPatch = persistedCreatedAt;\n        } else {\n          const newValidAt = newMemoryFile?.frontmatter.valid_at?.trim();\n          invalidAtPatch =\n            newValidAt && newValidAt.length > 0 ? newValidAt : persistedCreatedAt;\n        }\n      }\n      const wrote = await args.storage.writeMemoryFrontmatter(\n        fresh,\n        {\n          status: \"superseded\",\n          supersededBy: args.newMemoryId,\n          supersededAt,\n          updated: supersededAt,\n          ...(invalidAtPatch ? { invalid_at: invalidAtPatch } : {}),\n        },\n        {\n          actor: \"temporal-supersession\",\n          reasonCode: \"structured-attribute-update\",\n          relatedMemoryIds: [args.newMemoryId],\n        },\n      );\n      if (wrote) {\n        supersededIds.push(memory.frontmatter.id);\n        for (const key of decision.matchedKeys) matchedKeys.add(key);\n      }\n    } catch (err) {\n      log.warn(\n        `temporal-supersession: failed to mark ${memory.frontmatter.id} superseded: ${err}`,\n      );\n    }\n  }\n\n  if (supersededIds.length > 0) {\n    log.debug(\n      `temporal-supersession: marked ${supersededIds.length} memories superseded by ${args.newMemoryId} (keys=${Array.from(matchedKeys).join(\",\")})`,\n    );\n  }\n\n  return { supersededIds, matchedKeys: Array.from(matchedKeys) };\n}\n\n/**\n * Recall-side filter: returns true when the candidate should be excluded\n * from recall because it has been temporally superseded.  When\n * `includeInRecall` is true, this always returns false (the fact is kept),\n * matching the audit/history opt-in described in the config.\n */\nexport function shouldFilterSupersededFromRecall(\n  frontmatter: MemoryFrontmatter,\n  options: { enabled: boolean; includeInRecall: boolean },\n): boolean {\n  if (!options.enabled) return false;\n  if (options.includeInRecall) return false;\n  return frontmatter.status === \"superseded\";\n}\n"],"mappings":";;;;;AAiCO,SAAS,yBAAyB,KAAqB;AAC5D,SAAO,IACJ,KAAK,EACL,YAAY,EACZ,QAAQ,YAAY,GAAG,EACvB,QAAQ,YAAY,EAAE;AAC3B;AAYO,SAAS,uBACd,WACA,eACe;AACf,MAAI,CAAC,aAAa,OAAO,cAAc,SAAU,QAAO;AACxD,MAAI,CAAC,iBAAiB,OAAO,kBAAkB,SAAU,QAAO;AAChE,QAAM,SAAS,yBAAyB,SAAS;AACjD,QAAM,OAAO,yBAAyB,aAAa;AACnD,MAAI,OAAO,WAAW,KAAK,KAAK,WAAW,EAAG,QAAO;AACrD,SAAO,GAAG,MAAM,KAAK,IAAI;AAC3B;AAMO,SAAS,wBAAwB,MAG3B;AACX,MAAI,CAAC,KAAK,UAAW,QAAO,CAAC;AAC7B,MAAI,CAAC,KAAK,qBAAsB,QAAO,CAAC;AACxC,QAAM,OAAiB,CAAC;AACxB,aAAW,YAAY,OAAO,KAAK,KAAK,oBAAoB,GAAG;AAC7D,UAAM,MAAM,uBAAuB,KAAK,WAAW,QAAQ;AAC3D,QAAI,IAAK,MAAK,KAAK,GAAG;AAAA,EACxB;AACA,SAAO;AACT;AAYO,SAAS,+BACd,YACA,QACS;AACT,QAAM,mBAAmB,yBAAyB,MAAM;AACxD,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC/C,QAAI,yBAAyB,CAAC,MAAM,iBAAkB,QAAO;AAAA,EAC/D;AACA,SAAO;AACT;AAgBO,SAAS,wBAAwB,MAMH;AACnC,QAAM,EAAE,WAAW,cAAc,eAAe,cAAc,YAAY,IAAI;AAE9E,MAAI,UAAU,OAAO,YAAa,QAAO;AACzC,MAAI,UAAU,UAAU,UAAU,WAAW,SAAU,QAAO;AAC9D,MAAI,CAAC,UAAU,UAAW,QAAO;AACjC,MAAI,CAAC,UAAU,qBAAsB,QAAO;AAK5C,QAAM,sBAAsB,yBAAyB,UAAU,SAAS;AACxE,QAAM,gBAAgB,yBAAyB,YAAY;AAC3D,MAAI,wBAAwB,cAAe,QAAO;AAIlD,QAAM,mBAAmB,KAAK,MAAM,UAAU,OAAO;AACrD,QAAM,aAAa,KAAK,MAAM,YAAY;AAC1C,MAAI,CAAC,OAAO,SAAS,gBAAgB,KAAK,CAAC,OAAO,SAAS,UAAU,EAAG,QAAO;AAC/E,MAAI,oBAAoB,WAAY,QAAO;AAE3C,QAAM,cAAwB,CAAC;AAC/B,aAAW,CAAC,UAAU,QAAQ,KAAK,OAAO,QAAQ,aAAa,GAAG;AAGhE,UAAM,iBAAiB;AAAA,MACrB,UAAU;AAAA,MACV;AAAA,IACF;AACA,QAAI,mBAAmB,OAAW;AAElC,QAAI,eAAe,OAAO,cAAc,CAAC,MAAM,eAAe,QAAQ,EAAG;AACzE,UAAM,MAAM,uBAAuB,cAAc,QAAQ;AACzD,QAAI,IAAK,aAAY,KAAK,GAAG;AAAA,EAC/B;AAEA,SAAO,YAAY,SAAS,IAAI,EAAE,YAAY,IAAI;AACpD;AAEA,SAAS,eAAe,GAAmB;AACzC,SAAO,EAAE,KAAK,EAAE,YAAY;AAC9B;AAYA,eAAsB,0BAA0B,MAeR;AACtC,QAAM,QAAoC,EAAE,eAAe,CAAC,GAAG,aAAa,CAAC,EAAE;AAC/E,MAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,MAAI,CAAC,KAAK,UAAW,QAAO;AAC5B,MAAI,CAAC,KAAK,qBAAsB,QAAO;AACvC,MAAI,OAAO,KAAK,KAAK,oBAAoB,EAAE,WAAW,EAAG,QAAO;AAEhE,QAAM,UAAU,wBAAwB;AAAA,IACtC,WAAW,KAAK;AAAA,IAChB,sBAAsB,KAAK;AAAA,EAC7B,CAAC;AACD,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,MAAI;AACJ,MAAI;AACF,kBAAc,MAAM,KAAK,QAAQ,gBAAgB;AAAA,EACnD,SAAS,KAAK;AACZ,QAAI,KAAK,kDAAkD,GAAG,EAAE;AAChE,WAAO;AAAA,EACT;AAeA,QAAM,gBAAgB,YAAY,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO,KAAK,WAAW;AACnF,QAAM,qBAAqB,KAAK,qBAC5B,KAAK,YACJ,eAAe,YAAY,WAAW,KAAK;AAEhD,QAAM,gBAA0B,CAAC;AACjC,QAAM,cAAc,oBAAI,IAAY;AAUpC,QAAM,eAAe,oBAAI,IAAY;AAmBrC,MAAI;AACJ,MAAI;AACF,mBAAe,MAAM,KAAK,QAAQ,oBAAoB;AAAA,EACxD,SAAS,KAAK;AACZ,QAAI,KAAK,sDAAsD,GAAG,EAAE;AACpE,mBAAe,CAAC;AAAA,EAClB;AAMA,QAAM,gBAA8B,CAAC,GAAG,aAAa,GAAG,YAAY;AAEpE,aAAW,UAAU,eAAe;AAClC,QAAI,OAAO,YAAY,OAAO,KAAK,YAAa;AAChD,UAAM,YAAY,OAAO,YAAY,MAAM,OAAO;AAClD,QAAI,aAAa,IAAI,SAAS,EAAG;AAUjC,UAAM,WAAW,wBAAwB;AAAA,MACvC,WAAW,OAAO;AAAA,MAClB,cAAc,KAAK;AAAA,MACnB,eAAe,KAAK;AAAA,MACpB,cAAc;AAAA,MACd,aAAa,KAAK;AAAA,IACpB,CAAC;AACD,QAAI,CAAC,UAAU;AAGb,mBAAa,IAAI,SAAS;AAC1B;AAAA,IACF;AAEA,QAAI;AAeF,YAAM,QAAQ,MAAM,KAAK,QAAQ,iBAAiB,OAAO,IAAI;AAC7D,UAAI,CAAC,OAAO;AACV,YAAI;AAAA,UACF,oDAAoD,OAAO,YAAY,EAAE,2BAA2B,OAAO,IAAI;AAAA,QACjH;AAGA;AAAA,MACF;AAGA,mBAAa,IAAI,SAAS;AAC1B,YAAM,cAAc,MAAM,YAAY,UAAU;AAChD,UAAI,gBAAgB,YAAY,MAAM,YAAY,cAAc;AAC9D,YAAI;AAAA,UACF,oDAAoD,OAAO,YAAY,EAAE;AAAA,QAC3E;AACA;AAAA,MACF;AAWA,YAAM,eAAe,IAAI,KAAK,MAAM,YAAY,OAAO,EAAE,QAAQ;AACjE,YAAM,eAAe,IAAI,KAAK,kBAAkB,EAAE,QAAQ;AAC1D,YAAM,eAAe,IAAI,KAAK,KAAK,SAAS,EAAE,QAAQ;AACtD,YAAM,QAAQ,KAAK;AAAA,QACjB,OAAO,SAAS,YAAY,IAAI,eAAe;AAAA,QAC/C,OAAO,SAAS,YAAY,IAAI,eAAe;AAAA,QAC/C,OAAO,SAAS,YAAY,IAAI,eAAe;AAAA,MACjD;AACA,YAAM,eAAe,IAAI,KAAK,KAAK,EAAE,YAAY;AAkBjD,UAAI;AACJ,UAAI,CAAC,MAAM,YAAY,YAAY;AACjC,YAAI,KAAK,oBAAoB;AAC3B,2BAAiB;AAAA,QACnB,OAAO;AACL,gBAAM,aAAa,eAAe,YAAY,UAAU,KAAK;AAC7D,2BACE,cAAc,WAAW,SAAS,IAAI,aAAa;AAAA,QACvD;AAAA,MACF;AACA,YAAM,QAAQ,MAAM,KAAK,QAAQ;AAAA,QAC/B;AAAA,QACA;AAAA,UACE,QAAQ;AAAA,UACR,cAAc,KAAK;AAAA,UACnB;AAAA,UACA,SAAS;AAAA,UACT,GAAI,iBAAiB,EAAE,YAAY,eAAe,IAAI,CAAC;AAAA,QACzD;AAAA,QACA;AAAA,UACE,OAAO;AAAA,UACP,YAAY;AAAA,UACZ,kBAAkB,CAAC,KAAK,WAAW;AAAA,QACrC;AAAA,MACF;AACA,UAAI,OAAO;AACT,sBAAc,KAAK,OAAO,YAAY,EAAE;AACxC,mBAAW,OAAO,SAAS,YAAa,aAAY,IAAI,GAAG;AAAA,MAC7D;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,yCAAyC,OAAO,YAAY,EAAE,gBAAgB,GAAG;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,QAAI;AAAA,MACF,iCAAiC,cAAc,MAAM,2BAA2B,KAAK,WAAW,UAAU,MAAM,KAAK,WAAW,EAAE,KAAK,GAAG,CAAC;AAAA,IAC7I;AAAA,EACF;AAEA,SAAO,EAAE,eAAe,aAAa,MAAM,KAAK,WAAW,EAAE;AAC/D;AAQO,SAAS,iCACd,aACA,SACS;AACT,MAAI,CAAC,QAAQ,QAAS,QAAO;AAC7B,MAAI,QAAQ,gBAAiB,QAAO;AACpC,SAAO,YAAY,WAAW;AAChC;","names":[]}

package/dist/contradiction-scan-3Z6YW7YA.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/contradiction/contradiction-judge.ts","../src/contradiction/contradiction-scan.ts"],"sourcesContent":["/**\n * Contradiction Judge — LLM-as-judge for semantic contradiction detection (issue #520).\n *\n * Pairs semantically-similar memories and classifies their relationship.\n * Reuses the extraction-judge adapter pattern but with a contradiction-specific\n * prompt and verdict taxonomy.\n *\n * Design constraints:\n *   - Default verdict on any failure is \"needs-user\" (rule 48: least-privileged default).\n *   - Never auto-resolve; all verdicts enter the review queue.\n *   - Content-hash caching avoids redundant LLM calls across runs.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { log } from \"../logger.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport type { LocalLlmClient } from \"../local-llm.js\";\nimport type { FallbackLlmClient } from \"../fallback-llm.js\";\nimport { extractJsonCandidates } from \"../json-extract.js\";\n\n// ── Types ──────────────────────────────────────────────────────────────────────\n\nexport type ContradictionVerdict =\n  | \"contradicts\"\n  | \"independent\"\n  | \"duplicates\"\n  | \"needs-user\";\n\nexport interface ContradictionJudgeInput {\n  /** Memory ID of the first fact. */\n  memoryIdA: string;\n  /** Memory ID of the second fact. */\n  memoryIdB: string;\n  /** Content text of the first fact. */\n  textA: string;\n  /** Content text of the second fact. */\n  textB: string;\n  /** Category of the first fact (optional context). */\n  categoryA?: string;\n  /** Category of the second fact (optional context). */\n  categoryB?: string;\n}\n\nexport interface ContradictionJudgeResult {\n  /** Memory IDs of the pair. */\n  memoryIdA: string;\n  memoryIdB: string;\n  /** Verdict from the judge. */\n  verdict: ContradictionVerdict;\n  /** Human-readable rationale. */\n  rationale: string;\n  /** Confidence in [0, 1]. */\n  confidence: number;\n}\n\nexport interface ContradictionJudgeBatchResult {\n  /** Results keyed by pair key (\"idA:idB\"). */\n  results: Map<string, ContradictionJudgeResult>;\n  /** Number served from cache. */\n  cached: number;\n  /** Number produced by LLM call. */\n  judged: number;\n  /** Total wall-clock time in ms. */\n  elapsed: number;\n}\n\n// ── Prompt ─────────────────────────────────────────────────────────────────────\n\nconst CONTRADICTION_JUDGE_PROMPT = `You are a memory contradiction classifier. You will receive pairs of stored memories and must classify their semantic relationship.\n\nFor each pair, respond with a JSON array where each element has:\n- \"pairKey\": the pairKey provided in the input\n- \"verdict\": one of \"contradicts\", \"independent\", \"duplicates\", \"needs-user\"\n- \"rationale\": one sentence explaining why\n- \"confidence\": number between 0 and 1\n\nVERDICT DEFINITIONS:\n- \"contradicts\": The two memories make claims that cannot both be true. One must be wrong or outdated.\n- \"duplicates\": The two memories convey essentially the same information (near-paraphrase).\n- \"independent\": The memories are topically similar but do not conflict or duplicate.\n- \"needs-user\": Cannot determine with sufficient confidence; requires human review.\n\nIMPORTANT:\n- Be conservative. When in doubt, prefer \"needs-user\" over a wrong classification.\n- Two memories about the same entity/topic are NOT necessarily contradictory.\n- Temporal changes (\"Joshua uses pnpm\" vs \"Joshua switched to npm\") ARE contradictions.\n- Different aspects of the same entity (\"Joshua uses pnpm\" vs \"Joshua works on Remnic\") are \"independent\".`;\n\n// ── Cache ──────────────────────────────────────────────────────────────────────\n\n/** Module-level fallback cache — only used when caller does not supply one. */\nlet defaultVerdictCache: Map<string, ContradictionJudgeResult> = new Map();\nconst CACHE_MAX = 10_000;\n\nfunction pairKey(idA: string, idB: string): string {\n  const sorted = [idA, idB].sort();\n  return `${sorted[0]}:${sorted[1]}`;\n}\n\nfunction contentHash(a: ContradictionJudgeInput): string {\n  // Sort each side pair to be order-independent (matching pairKey behavior)\n  const sides = [\n    [a.textA.trim(), (a.categoryA ?? \"\").trim()].join(\"|\"),\n    [a.textB.trim(), (a.categoryB ?? \"\").trim()].join(\"|\"),\n  ].sort();\n  const normalized = sides.join(\"|||\");\n  return createHash(\"sha256\").update(normalized).digest(\"hex\").slice(0, 16);\n}\n\nexport function createVerdictCache(): Map<string, ContradictionJudgeResult> {\n  return new Map();\n}\n\nexport function clearVerdictCache(): void {\n  defaultVerdictCache.clear();\n}\n\nexport function verdictCacheSize(): number {\n  return defaultVerdictCache.size;\n}\n\n// ── Public API ──────────────────────────────────────────────────────────────────\n\n/**\n * Judge a batch of memory pairs for contradiction.\n *\n * Uses content-hash caching to skip pairs already judged in a prior run.\n * On any LLM failure, all unresolved pairs default to \"needs-user\".\n */\nexport async function judgeContradictionPairs(\n  pairs: ContradictionJudgeInput[],\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n  cache?: Map<string, ContradictionJudgeResult>,\n): Promise<ContradictionJudgeBatchResult> {\n  const startTime = Date.now();\n  const results = new Map<string, ContradictionJudgeResult>();\n  const activeCache = cache ?? defaultVerdictCache;\n  let cached = 0;\n  let judged = 0;\n\n  // Partition into cached vs needs-judging\n  const toJudge: ContradictionJudgeInput[] = [];\n  for (const pair of pairs) {\n    const key = pairKey(pair.memoryIdA, pair.memoryIdB);\n    const hash = contentHash(pair);\n    const cachedResult = activeCache.get(hash);\n    if (cachedResult) {\n      results.set(key, { ...cachedResult, memoryIdA: pair.memoryIdA, memoryIdB: pair.memoryIdB });\n      cached++;\n    } else {\n      toJudge.push(pair);\n    }\n  }\n\n  if (toJudge.length === 0) {\n    return { results, cached, judged, elapsed: Date.now() - startTime };\n  }\n\n  // Build the prompt with all pairs\n  const pairDescriptions = toJudge.map((p, i) => {\n    const pk = pairKey(p.memoryIdA, p.memoryIdB);\n    const catA = p.categoryA ? ` [${p.categoryA}]` : \"\";\n    const catB = p.categoryB ? ` [${p.categoryB}]` : \"\";\n    return `Pair ${i + 1} (pairKey: \"${pk}\"):${catA} \"${p.textA}\"${catB} \"${p.textB}\"`;\n  });\n\n  const userMessage = `Classify these ${toJudge.length} memory pair(s):\\n\\n${pairDescriptions.join(\"\\n\\n\")}`;\n\n  // Try LLM call\n  let llmResponse: string | null = null;\n\n  if (localLlm) {\n    try {\n      llmResponse = await callLlm(localLlm, config, userMessage);\n    } catch (err) {\n      log.warn(\"[contradiction-judge] local LLM call failed: %s\", err instanceof Error ? err.message : err);\n    }\n  }\n\n  if (!llmResponse && fallbackLlm) {\n    try {\n      llmResponse = await callLlm(fallbackLlm, config, userMessage);\n    } catch (err) {\n      log.warn(\"[contradiction-judge] fallback LLM call failed: %s\", err instanceof Error ? err.message : err);\n    }\n  }\n\n  // Parse response or default to needs-user\n  if (llmResponse) {\n    const candidates = extractJsonCandidates(llmResponse);\n    const parsed = parseJudgeResponse(candidates, toJudge);\n\n    for (const result of parsed) {\n      const key = pairKey(result.memoryIdA, result.memoryIdB);\n      results.set(key, result);\n\n      // Update cache\n      const input = toJudge.find(\n        (p) => pairKey(p.memoryIdA, p.memoryIdB) === key,\n      );\n      if (input) {\n        const hash = contentHash(input);\n        if (activeCache.size >= CACHE_MAX) {\n          const firstKey = activeCache.keys().next().value;\n          if (firstKey !== undefined) activeCache.delete(firstKey);\n        }\n        activeCache.set(hash, result);\n      }\n      judged++;\n    }\n  } else {\n    // All unresolved → needs-user (rule 48)\n    for (const pair of toJudge) {\n      const key = pairKey(pair.memoryIdA, pair.memoryIdB);\n      const result: ContradictionJudgeResult = {\n        memoryIdA: pair.memoryIdA,\n        memoryIdB: pair.memoryIdB,\n        verdict: \"needs-user\",\n        rationale: \"LLM call failed; requires manual review\",\n        confidence: 0,\n      };\n      results.set(key, result);\n      judged++;\n    }\n  }\n\n  return { results, cached, judged, elapsed: Date.now() - startTime };\n}\n\n// ── Internals ──────────────────────────────────────────────────────────────────\n\nasync function callLlm(\n  client: LocalLlmClient | FallbackLlmClient,\n  config: PluginConfig,\n  userMessage: string,\n): Promise<string> {\n  const messages: Array<{ role: \"user\" | \"assistant\" | \"system\"; content: string }> = [\n    { role: \"system\", content: CONTRADICTION_JUDGE_PROMPT },\n    { role: \"user\", content: userMessage },\n  ];\n  if (\"chatCompletion\" in client && typeof client.chatCompletion === \"function\") {\n    const result = await client.chatCompletion(messages, {\n      temperature: 0.1,\n      maxTokens: 4096,\n    });\n    return result?.content ?? \"\";\n  }\n  // FallbackLlmClient — try OpenAI-compatible chat completions\n  if (\"complete\" in client && typeof (client as Record<string, unknown>).complete === \"function\") {\n    const result = await (client as { complete: (msg: Array<{ role: string; content: string }>) => Promise<{ content: string }> }).complete(messages);\n    return result.content ?? \"\";\n  }\n  return \"\";\n}\n\nfunction parseJudgeResponse(\n  candidates: string[],\n  inputs: ContradictionJudgeInput[],\n): ContradictionJudgeResult[] {\n  const VALID_VERDICTS: ContradictionVerdict[] = [\"contradicts\", \"independent\", \"duplicates\", \"needs-user\"];\n\n  for (const candidate of candidates) {\n    try {\n      const parsed = JSON.parse(candidate);\n      const items = Array.isArray(parsed) ? parsed : [parsed];\n      const results: ContradictionJudgeResult[] = [];\n      const matchedKeys = new Set<string>();\n\n      for (const item of items) {\n        if (!item || typeof item !== \"object\") continue;\n\n        const verdict = typeof item.verdict === \"string\" && VALID_VERDICTS.includes(item.verdict as ContradictionVerdict)\n          ? (item.verdict as ContradictionVerdict)\n          : \"needs-user\";\n\n        const pairKeyVal = typeof item.pairKey === \"string\" ? item.pairKey : null;\n        const input = pairKeyVal\n          ? inputs.find((p) => pairKey(p.memoryIdA, p.memoryIdB) === pairKeyVal)\n          : null;\n\n        // If we can't match the pairKey, fall back to index-based matching\n        const fallbackInput = input ?? inputs[results.length] ?? inputs[0];\n        if (!fallbackInput) continue;\n\n        matchedKeys.add(pairKey(fallbackInput.memoryIdA, fallbackInput.memoryIdB));\n\n        const confidence = typeof item.confidence === \"number\"\n          ? Math.min(1, Math.max(0, item.confidence))\n          : 0.5;\n\n        results.push({\n          memoryIdA: fallbackInput.memoryIdA,\n          memoryIdB: fallbackInput.memoryIdB,\n          verdict,\n          rationale: typeof item.rationale === \"string\" ? item.rationale : \"No rationale provided\",\n          confidence,\n        });\n      }\n\n      // Backfill any inputs the LLM omitted with needs-user\n      for (const inp of inputs) {\n        const key = pairKey(inp.memoryIdA, inp.memoryIdB);\n        if (!matchedKeys.has(key)) {\n          results.push({\n            memoryIdA: inp.memoryIdA,\n            memoryIdB: inp.memoryIdB,\n            verdict: \"needs-user\",\n            rationale: \"LLM response omitted this pair\",\n            confidence: 0,\n          });\n        }\n      }\n\n      if (results.length > 0) return results;\n    } catch {\n      continue;\n    }\n  }\n\n  // All parse attempts failed → needs-user for every input\n  return inputs.map((p) => ({\n    memoryIdA: p.memoryIdA,\n    memoryIdB: p.memoryIdB,\n    verdict: \"needs-user\" as ContradictionVerdict,\n    rationale: \"Failed to parse judge response\",\n    confidence: 0,\n  }));\n}\n\nexport { pairKey as _pairKey, contentHash as _contentHash };\n","/**\n * Contradiction Scan — pair generator + scan driver (issue #520).\n *\n * Nightly cron that pairs semantically-similar active memories within\n * the same namespace, sends candidate pairs to the LLM-as-judge\n * contradiction classifier, and drops contradicting pairs into a\n * review queue for user resolution.\n *\n * Pair generation (cheap pre-filter):\n *   1. Find candidate peers via embedding cosine >= similarityFloor.\n *   2. Restrict to pairs sharing at least one entityRef OR overlapping\n *      topic tokens >= topicOverlapFloor.\n *   3. Skip pairs already judged independent/both-valid within cooldown.\n *   4. Cap per-run work at maxPairsPerRun.\n */\n\nimport type { StorageManager } from \"../storage.js\";\nimport type { PluginConfig, MemoryFile, MemoryStatus } from \"../types.js\";\nimport type { SemanticDedupLookup } from \"../dedup/semantic.js\";\nimport { log } from \"../logger.js\";\nimport { judgeContradictionPairs, type ContradictionJudgeInput } from \"./contradiction-judge.js\";\nimport {\n  writePairs,\n  listPairs,\n  isCoolingDown,\n  computePairId,\n  type ContradictionPair,\n} from \"./contradiction-review.js\";\nimport type { LocalLlmClient } from \"../local-llm.js\";\nimport type { FallbackLlmClient } from \"../fallback-llm.js\";\n\n// ── Types ──────────────────────────────────────────────────────────────────────\n\n/** The set of statuses that represent \"live\" memories eligible for scanning. */\nexport const ACTIVE_STATUSES: Set<MemoryStatus> = new Set([\"active\"]);\n\n/** High-value taxonomy buckets to scan. */\nconst SCAN_CATEGORIES = new Set([\n  \"decision\",\n  \"principle\",\n  \"rule\",\n  \"entity\",\n  \"fact\",\n  \"preference\",\n]);\n\nexport interface ScanResult {\n  /** Total active memories scanned. */\n  scanned: number;\n  /** Candidate pairs generated by the pre-filter. */\n  candidates: number;\n  /** Pairs sent to judge. */\n  judged: number;\n  /** Pairs written to review queue. */\n  queued: number;\n  /** Pairs skipped due to cooldown. */\n  cooledDown: number;\n  /** Total wall-clock time in ms. */\n  elapsedMs: number;\n}\n\nexport interface ScanDependencies {\n  storage: StorageManager;\n  config: PluginConfig;\n  memoryDir: string;\n  /** Pre-built embedding lookup. When provided, used as-is for Strategy 3. */\n  embeddingLookup?: SemanticDedupLookup;\n  /**\n   * Factory to build a namespace-scoped embedding lookup.\n   * When provided, takes precedence over `embeddingLookup`.\n   * The scan driver passes its own `storage` so the lookup queries the correct index.\n   */\n  embeddingLookupFactory?: (storage: StorageManager) => SemanticDedupLookup | undefined;\n  localLlm: LocalLlmClient | null;\n  fallbackLlm: FallbackLlmClient | null;\n  namespace?: string;\n}\n\n// ── Main scan driver ───────────────────────────────────────────────────────────\n\n/**\n * Run a contradiction scan over the memory corpus.\n *\n * This is the entry point called by the nightly cron and by the CLI.\n */\nexport async function runContradictionScan(deps: ScanDependencies): Promise<ScanResult> {\n  const startTime = Date.now();\n  const { storage, config, memoryDir, embeddingLookup, embeddingLookupFactory, localLlm, fallbackLlm, namespace } = deps;\n  const scanConfig = config.contradictionScan;\n\n  // Prefer the factory (which uses the scan's own storage for correct namespace scoping)\n  // over a pre-built lookup (which may use default-namespace storage).\n  const scopedEmbeddingLookup = embeddingLookupFactory\n    ? embeddingLookupFactory(storage)\n    : embeddingLookup;\n\n  if (!scanConfig.enabled) {\n    log.info(\"[contradiction-scan] disabled by config\");\n    return { scanned: 0, candidates: 0, judged: 0, queued: 0, cooledDown: 0, elapsedMs: 0 };\n  }\n\n  // 1. Load active memories in scan categories\n  const memories = await loadEligibleMemories(storage, namespace);\n  log.info(\"[contradiction-scan] loaded %d eligible memories\", memories.length);\n\n  if (memories.length < 2) {\n    return { scanned: memories.length, candidates: 0, judged: 0, queued: 0, cooledDown: 0, elapsedMs: Date.now() - startTime };\n  }\n\n  // 2. Load existing review pairs for cooldown checking\n  const existingPairs = listPairs(memoryDir, { filter: \"all\", namespace, limit: 10000 }).pairs;\n  const existingMap = new Map<string, ContradictionPair>();\n  for (const p of existingPairs) {\n    existingMap.set(p.pairId, p);\n  }\n\n  // 3. Generate candidate pairs\n  const candidates = await generatePairs(memories, existingMap, scanConfig, scopedEmbeddingLookup);\n  const cooledDown = candidates.skipped;\n  log.info(\"[contradiction-scan] generated %d candidates (%d cooled down)\", candidates.pairs.length, cooledDown);\n\n  if (candidates.pairs.length === 0) {\n    return {\n      scanned: memories.length,\n      candidates: 0,\n      judged: 0,\n      queued: 0,\n      cooledDown,\n      elapsedMs: Date.now() - startTime,\n    };\n  }\n\n  // 4. Cap at maxPairsPerRun (deterministic selection by pairId)\n  const capped = candidates.pairs\n    .sort((a, b) => computePairId(a.idA, a.idB).localeCompare(computePairId(b.idA, b.idB)))\n    .slice(0, scanConfig.maxPairsPerRun);\n\n  // 5. Build judge inputs\n  const judgeInputs: ContradictionJudgeInput[] = capped.map((pair) => ({\n    memoryIdA: pair.idA,\n    memoryIdB: pair.idB,\n    textA: pair.textA,\n    textB: pair.textB,\n    categoryA: pair.categoryA,\n    categoryB: pair.categoryB,\n  }));\n\n  // 6. Send to judge (per-scan cache avoids module-level singleton leak)\n  const scanCache = new Map<string, import(\"./contradiction-judge.js\").ContradictionJudgeResult>();\n  const judgeResult = await judgeContradictionPairs(judgeInputs, config, localLlm, fallbackLlm, scanCache);\n  log.info(\"[contradiction-scan] judge completed: %d judged, %d cached in %dms\", judgeResult.judged, judgeResult.cached, judgeResult.elapsed);\n\n  // 7. Write to review queue\n  const queueEntries: Array<Omit<ContradictionPair, \"pairId\"> & { memoryIds: [string, string] }> = [];\n  for (const [key, result] of judgeResult.results) {\n    queueEntries.push({\n      memoryIds: [result.memoryIdA, result.memoryIdB],\n      verdict: result.verdict,\n      rationale: result.rationale,\n      confidence: result.confidence,\n      detectedAt: new Date().toISOString(),\n      // Set lastReviewedAt for non-actionable verdicts so cooldown prevents re-judging\n      lastReviewedAt: result.verdict === \"independent\" ? new Date().toISOString() : undefined,\n      namespace,\n    });\n  }\n\n  const written = writePairs(memoryDir, queueEntries);\n  const elapsed = Date.now() - startTime;\n  log.info(\"[contradiction-scan] complete: %d queued in %dms\", written.length, elapsed);\n\n  return {\n    scanned: memories.length,\n    candidates: candidates.pairs.length,\n    judged: judgeResult.judged,\n    queued: written.length,\n    cooledDown,\n    elapsedMs: elapsed,\n  };\n}\n\n// ── Pair generation ────────────────────────────────────────────────────────────\n\ninterface CandidatePair {\n  idA: string;\n  idB: string;\n  textA: string;\n  textB: string;\n  categoryA?: string;\n  categoryB?: string;\n}\n\ninterface PairGenResult {\n  pairs: CandidatePair[];\n  skipped: number;\n}\n\nasync function generatePairs(\n  memories: MemoryFile[],\n  existingPairs: Map<string, ContradictionPair>,\n  scanConfig: PluginConfig[\"contradictionScan\"],\n  embeddingLookup?: SemanticDedupLookup,\n): Promise<PairGenResult> {\n  const pairs: CandidatePair[] = [];\n  const embeddingPairs: CandidatePair[] = [];\n  let skipped = 0;\n  const seen = new Set<string>();\n\n  // Build index by entityRef for fast lookup\n  const byEntity = new Map<string, MemoryFile[]>();\n  for (const mem of memories) {\n    const entity = mem.frontmatter.entityRef;\n    if (entity) {\n      const existing = byEntity.get(entity) ?? [];\n      existing.push(mem);\n      byEntity.set(entity, existing);\n    }\n  }\n\n  // Strategy 1: Entity-ref based pairing (high precision)\n  for (const [, group] of byEntity) {\n    if (group.length < 2) continue;\n    for (let i = 0; i < group.length; i++) {\n      for (let j = i + 1; j < group.length; j++) {\n        const a = group[i];\n        const b = group[j];\n        const pairId = computePairId(a.frontmatter.id!, b.frontmatter.id!);\n\n        if (seen.has(pairId)) continue;\n        seen.add(pairId);\n\n        // Check cooldown\n        const existing = existingPairs.get(pairId);\n        if (existing && isCoolingDown(existing, scanConfig.cooldownDays)) {\n          skipped++;\n          continue;\n        }\n\n        pairs.push({\n          idA: a.frontmatter.id!,\n          idB: b.frontmatter.id!,\n          textA: a.content,\n          textB: b.content,\n          categoryA: a.frontmatter.category as string | undefined,\n          categoryB: b.frontmatter.category as string | undefined,\n        });\n      }\n    }\n  }\n\n  // Strategy 2: Tag/topic overlap for memories without shared entityRef\n  const noEntity = memories.filter((m) => !m.frontmatter.entityRef);\n  for (let i = 0; i < noEntity.length; i++) {\n    for (let j = i + 1; j < noEntity.length; j++) {\n      const a = noEntity[i];\n      const b = noEntity[j];\n      const overlap = jaccardOverlap(\n        (a.frontmatter.tags as string[]) ?? [],\n        (b.frontmatter.tags as string[]) ?? [],\n      );\n\n      if (overlap < scanConfig.topicOverlapFloor) continue;\n\n      const pairId = computePairId(a.frontmatter.id!, b.frontmatter.id!);\n      if (seen.has(pairId)) continue;\n      seen.add(pairId);\n\n      const existing = existingPairs.get(pairId);\n      if (existing && isCoolingDown(existing, scanConfig.cooldownDays)) {\n        skipped++;\n        continue;\n      }\n\n      pairs.push({\n        idA: a.frontmatter.id!,\n        idB: b.frontmatter.id!,\n        textA: a.content,\n        textB: b.content,\n        categoryA: a.frontmatter.category as string | undefined,\n        categoryB: b.frontmatter.category as string | undefined,\n      });\n    }\n  }\n\n  // Strategy 3: Embedding cosine similarity (enforces similarityFloor config)\n  if (embeddingLookup) {\n    const memoryById = new Map(memories.map((m) => [m.frontmatter.id!, m]));\n    for (const mem of memories) {\n      const id = mem.frontmatter.id!;\n      try {\n        const hits = await embeddingLookup(mem.content, 20);\n        for (const hit of hits) {\n          if (hit.score < scanConfig.similarityFloor) continue;\n          if (hit.id === id) continue;\n          const peer = memoryById.get(hit.id);\n          if (!peer) continue;\n\n          const pairId = computePairId(id, hit.id);\n          if (seen.has(pairId)) continue;\n          seen.add(pairId);\n\n          const existing = existingPairs.get(pairId);\n          if (existing && isCoolingDown(existing, scanConfig.cooldownDays)) {\n            skipped++;\n            continue;\n          }\n\n          embeddingPairs.push({\n            idA: id,\n            idB: hit.id,\n            textA: mem.content,\n            textB: peer.content,\n            categoryA: mem.frontmatter.category as string | undefined,\n            categoryB: peer.frontmatter.category as string | undefined,\n          });\n        }\n      } catch {\n        // Embedding backend unavailable — skip, entity-ref/tag strategies already covered\n      }\n    }\n  }\n\n  // Append embedding pairs after high-precision entity/topic pairs so the\n  // downstream sort+slice(maxPairsPerRun) keeps precision-first ordering.\n  pairs.push(...embeddingPairs);\n\n  return { pairs, skipped };\n}\n\n// ── Helpers ────────────────────────────────────────────────────────────────────\n\nasync function loadEligibleMemories(storage: StorageManager, namespace?: string): Promise<MemoryFile[]> {\n  let all: MemoryFile[];\n  try {\n    all = await storage.readAllMemories();\n  } catch {\n    return [];\n  }\n\n  return all.filter((mem) => {\n    const fm = mem.frontmatter;\n    // Only active memories (rule 53: explicit ACTIVE_STATUSES set)\n    const status = (fm.status as MemoryStatus) ?? \"active\";\n    if (!ACTIVE_STATUSES.has(status)) return false;\n\n    // Only scan high-value categories\n    const category = fm.category as string | undefined;\n    if (category && !SCAN_CATEGORIES.has(category)) return false;\n\n    // Must have content\n    if (!mem.content || mem.content.trim().length === 0) return false;\n\n    // Must have an ID\n    if (!fm.id) return false;\n\n    // Namespace scoping is handled at the storage layer — memoryDir is\n    // already namespace-scoped, so readAllMemories() returns only memories\n    // within the requested namespace.\n\n    return true;\n  });\n}\n\nfunction jaccardOverlap(a: string[], b: string[]): number {\n  if (a.length === 0 && b.length === 0) return 0;\n  const setA = new Set(a.map((t) => t.toLowerCase()));\n  const setB = new Set(b.map((t) => t.toLowerCase()));\n  let intersection = 0;\n  for (const item of setA) {\n    if (setB.has(item)) intersection++;\n  }\n  const union = setA.size + setB.size - intersection;\n  return union === 0 ? 0 : intersection / union;\n}\n"],"mappings":";;;;;;;;;;;;;;;AAaA,SAAS,kBAAkB;AAuD3B,IAAM,6BAA6B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAuBnC,IAAI,sBAA6D,oBAAI,IAAI;AACzE,IAAM,YAAY;AAElB,SAAS,QAAQ,KAAa,KAAqB;AACjD,QAAM,SAAS,CAAC,KAAK,GAAG,EAAE,KAAK;AAC/B,SAAO,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC;AAClC;AAEA,SAAS,YAAY,GAAoC;AAEvD,QAAM,QAAQ;AAAA,IACZ,CAAC,EAAE,MAAM,KAAK,IAAI,EAAE,aAAa,IAAI,KAAK,CAAC,EAAE,KAAK,GAAG;AAAA,IACrD,CAAC,EAAE,MAAM,KAAK,IAAI,EAAE,aAAa,IAAI,KAAK,CAAC,EAAE,KAAK,GAAG;AAAA,EACvD,EAAE,KAAK;AACP,QAAM,aAAa,MAAM,KAAK,KAAK;AACnC,SAAO,WAAW,QAAQ,EAAE,OAAO,UAAU,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AAC1E;AAsBA,eAAsB,wBACpB,OACA,QACA,UACA,aACA,OACwC;AACxC,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,UAAU,oBAAI,IAAsC;AAC1D,QAAM,cAAc,SAAS;AAC7B,MAAI,SAAS;AACb,MAAI,SAAS;AAGb,QAAM,UAAqC,CAAC;AAC5C,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,QAAQ,KAAK,WAAW,KAAK,SAAS;AAClD,UAAM,OAAO,YAAY,IAAI;AAC7B,UAAM,eAAe,YAAY,IAAI,IAAI;AACzC,QAAI,cAAc;AAChB,cAAQ,IAAI,KAAK,EAAE,GAAG,cAAc,WAAW,KAAK,WAAW,WAAW,KAAK,UAAU,CAAC;AAC1F;AAAA,IACF,OAAO;AACL,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,EAAE,SAAS,QAAQ,QAAQ,SAAS,KAAK,IAAI,IAAI,UAAU;AAAA,EACpE;AAGA,QAAM,mBAAmB,QAAQ,IAAI,CAAC,GAAG,MAAM;AAC7C,UAAM,KAAK,QAAQ,EAAE,WAAW,EAAE,SAAS;AAC3C,UAAM,OAAO,EAAE,YAAY,KAAK,EAAE,SAAS,MAAM;AACjD,UAAM,OAAO,EAAE,YAAY,KAAK,EAAE,SAAS,MAAM;AACjD,WAAO,QAAQ,IAAI,CAAC,eAAe,EAAE,MAAM,IAAI,KAAK,EAAE,KAAK,IAAI,IAAI,KAAK,EAAE,KAAK;AAAA,EACjF,CAAC;AAED,QAAM,cAAc,kBAAkB,QAAQ,MAAM;AAAA;AAAA,EAAuB,iBAAiB,KAAK,MAAM,CAAC;AAGxG,MAAI,cAA6B;AAEjC,MAAI,UAAU;AACZ,QAAI;AACF,oBAAc,MAAM,QAAQ,UAAU,QAAQ,WAAW;AAAA,IAC3D,SAAS,KAAK;AACZ,UAAI,KAAK,mDAAmD,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IACtG;AAAA,EACF;AAEA,MAAI,CAAC,eAAe,aAAa;AAC/B,QAAI;AACF,oBAAc,MAAM,QAAQ,aAAa,QAAQ,WAAW;AAAA,IAC9D,SAAS,KAAK;AACZ,UAAI,KAAK,sDAAsD,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IACzG;AAAA,EACF;AAGA,MAAI,aAAa;AACf,UAAM,aAAa,sBAAsB,WAAW;AACpD,UAAM,SAAS,mBAAmB,YAAY,OAAO;AAErD,eAAW,UAAU,QAAQ;AAC3B,YAAM,MAAM,QAAQ,OAAO,WAAW,OAAO,SAAS;AACtD,cAAQ,IAAI,KAAK,MAAM;AAGvB,YAAM,QAAQ,QAAQ;AAAA,QACpB,CAAC,MAAM,QAAQ,EAAE,WAAW,EAAE,SAAS,MAAM;AAAA,MAC/C;AACA,UAAI,OAAO;AACT,cAAM,OAAO,YAAY,KAAK;AAC9B,YAAI,YAAY,QAAQ,WAAW;AACjC,gBAAM,WAAW,YAAY,KAAK,EAAE,KAAK,EAAE;AAC3C,cAAI,aAAa,OAAW,aAAY,OAAO,QAAQ;AAAA,QACzD;AACA,oBAAY,IAAI,MAAM,MAAM;AAAA,MAC9B;AACA;AAAA,IACF;AAAA,EACF,OAAO;AAEL,eAAW,QAAQ,SAAS;AAC1B,YAAM,MAAM,QAAQ,KAAK,WAAW,KAAK,SAAS;AAClD,YAAM,SAAmC;AAAA,QACvC,WAAW,KAAK;AAAA,QAChB,WAAW,KAAK;AAAA,QAChB,SAAS;AAAA,QACT,WAAW;AAAA,QACX,YAAY;AAAA,MACd;AACA,cAAQ,IAAI,KAAK,MAAM;AACvB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,QAAQ,QAAQ,SAAS,KAAK,IAAI,IAAI,UAAU;AACpE;AAIA,eAAe,QACb,QACA,QACA,aACiB;AACjB,QAAM,WAA8E;AAAA,IAClF,EAAE,MAAM,UAAU,SAAS,2BAA2B;AAAA,IACtD,EAAE,MAAM,QAAQ,SAAS,YAAY;AAAA,EACvC;AACA,MAAI,oBAAoB,UAAU,OAAO,OAAO,mBAAmB,YAAY;AAC7E,UAAM,SAAS,MAAM,OAAO,eAAe,UAAU;AAAA,MACnD,aAAa;AAAA,MACb,WAAW;AAAA,IACb,CAAC;AACD,WAAO,QAAQ,WAAW;AAAA,EAC5B;AAEA,MAAI,cAAc,UAAU,OAAQ,OAAmC,aAAa,YAAY;AAC9F,UAAM,SAAS,MAAO,OAAyG,SAAS,QAAQ;AAChJ,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,SAAS,mBACP,YACA,QAC4B;AAC5B,QAAM,iBAAyC,CAAC,eAAe,eAAe,cAAc,YAAY;AAExG,aAAW,aAAa,YAAY;AAClC,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,SAAS;AACnC,YAAM,QAAQ,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;AACtD,YAAM,UAAsC,CAAC;AAC7C,YAAM,cAAc,oBAAI,IAAY;AAEpC,iBAAW,QAAQ,OAAO;AACxB,YAAI,CAAC,QAAQ,OAAO,SAAS,SAAU;AAEvC,cAAM,UAAU,OAAO,KAAK,YAAY,YAAY,eAAe,SAAS,KAAK,OAA+B,IAC3G,KAAK,UACN;AAEJ,cAAM,aAAa,OAAO,KAAK,YAAY,WAAW,KAAK,UAAU;AACrE,cAAM,QAAQ,aACV,OAAO,KAAK,CAAC,MAAM,QAAQ,EAAE,WAAW,EAAE,SAAS,MAAM,UAAU,IACnE;AAGJ,cAAM,gBAAgB,SAAS,OAAO,QAAQ,MAAM,KAAK,OAAO,CAAC;AACjE,YAAI,CAAC,cAAe;AAEpB,oBAAY,IAAI,QAAQ,cAAc,WAAW,cAAc,SAAS,CAAC;AAEzE,cAAM,aAAa,OAAO,KAAK,eAAe,WAC1C,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC,IACxC;AAEJ,gBAAQ,KAAK;AAAA,UACX,WAAW,cAAc;AAAA,UACzB,WAAW,cAAc;AAAA,UACzB;AAAA,UACA,WAAW,OAAO,KAAK,cAAc,WAAW,KAAK,YAAY;AAAA,UACjE;AAAA,QACF,CAAC;AAAA,MACH;AAGA,iBAAW,OAAO,QAAQ;AACxB,cAAM,MAAM,QAAQ,IAAI,WAAW,IAAI,SAAS;AAChD,YAAI,CAAC,YAAY,IAAI,GAAG,GAAG;AACzB,kBAAQ,KAAK;AAAA,YACX,WAAW,IAAI;AAAA,YACf,WAAW,IAAI;AAAA,YACf,SAAS;AAAA,YACT,WAAW;AAAA,YACX,YAAY;AAAA,UACd,CAAC;AAAA,QACH;AAAA,MACF;AAEA,UAAI,QAAQ,SAAS,EAAG,QAAO;AAAA,IACjC,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AAGA,SAAO,OAAO,IAAI,CAAC,OAAO;AAAA,IACxB,WAAW,EAAE;AAAA,IACb,WAAW,EAAE;AAAA,IACb,SAAS;AAAA,IACT,WAAW;AAAA,IACX,YAAY;AAAA,EACd,EAAE;AACJ;;;ACvSO,IAAM,kBAAqC,oBAAI,IAAI,CAAC,QAAQ,CAAC;AAGpE,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAyCD,eAAsB,qBAAqB,MAA6C;AACtF,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,EAAE,SAAS,QAAQ,WAAW,iBAAiB,wBAAwB,UAAU,aAAa,UAAU,IAAI;AAClH,QAAM,aAAa,OAAO;AAI1B,QAAM,wBAAwB,yBAC1B,uBAAuB,OAAO,IAC9B;AAEJ,MAAI,CAAC,WAAW,SAAS;AACvB,QAAI,KAAK,yCAAyC;AAClD,WAAO,EAAE,SAAS,GAAG,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,YAAY,GAAG,WAAW,EAAE;AAAA,EACxF;AAGA,QAAM,WAAW,MAAM,qBAAqB,SAAS,SAAS;AAC9D,MAAI,KAAK,oDAAoD,SAAS,MAAM;AAE5E,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,EAAE,SAAS,SAAS,QAAQ,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,YAAY,GAAG,WAAW,KAAK,IAAI,IAAI,UAAU;AAAA,EAC3H;AAGA,QAAM,gBAAgB,UAAU,WAAW,EAAE,QAAQ,OAAO,WAAW,OAAO,IAAM,CAAC,EAAE;AACvF,QAAM,cAAc,oBAAI,IAA+B;AACvD,aAAW,KAAK,eAAe;AAC7B,gBAAY,IAAI,EAAE,QAAQ,CAAC;AAAA,EAC7B;AAGA,QAAM,aAAa,MAAM,cAAc,UAAU,aAAa,YAAY,qBAAqB;AAC/F,QAAM,aAAa,WAAW;AAC9B,MAAI,KAAK,iEAAiE,WAAW,MAAM,QAAQ,UAAU;AAE7G,MAAI,WAAW,MAAM,WAAW,GAAG;AACjC,WAAO;AAAA,MACL,SAAS,SAAS;AAAA,MAClB,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR;AAAA,MACA,WAAW,KAAK,IAAI,IAAI;AAAA,IAC1B;AAAA,EACF;AAGA,QAAM,SAAS,WAAW,MACvB,KAAK,CAAC,GAAG,MAAM,cAAc,EAAE,KAAK,EAAE,GAAG,EAAE,cAAc,cAAc,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,EACrF,MAAM,GAAG,WAAW,cAAc;AAGrC,QAAM,cAAyC,OAAO,IAAI,CAAC,UAAU;AAAA,IACnE,WAAW,KAAK;AAAA,IAChB,WAAW,KAAK;AAAA,IAChB,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,WAAW,KAAK;AAAA,IAChB,WAAW,KAAK;AAAA,EAClB,EAAE;AAGF,QAAM,YAAY,oBAAI,IAAyE;AAC/F,QAAM,cAAc,MAAM,wBAAwB,aAAa,QAAQ,UAAU,aAAa,SAAS;AACvG,MAAI,KAAK,sEAAsE,YAAY,QAAQ,YAAY,QAAQ,YAAY,OAAO;AAG1I,QAAM,eAA2F,CAAC;AAClG,aAAW,CAAC,KAAK,MAAM,KAAK,YAAY,SAAS;AAC/C,iBAAa,KAAK;AAAA,MAChB,WAAW,CAAC,OAAO,WAAW,OAAO,SAAS;AAAA,MAC9C,SAAS,OAAO;AAAA,MAChB,WAAW,OAAO;AAAA,MAClB,YAAY,OAAO;AAAA,MACnB,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA;AAAA,MAEnC,gBAAgB,OAAO,YAAY,iBAAgB,oBAAI,KAAK,GAAE,YAAY,IAAI;AAAA,MAC9E;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,UAAU,WAAW,WAAW,YAAY;AAClD,QAAM,UAAU,KAAK,IAAI,IAAI;AAC7B,MAAI,KAAK,oDAAoD,QAAQ,QAAQ,OAAO;AAEpF,SAAO;AAAA,IACL,SAAS,SAAS;AAAA,IAClB,YAAY,WAAW,MAAM;AAAA,IAC7B,QAAQ,YAAY;AAAA,IACpB,QAAQ,QAAQ;AAAA,IAChB;AAAA,IACA,WAAW;AAAA,EACb;AACF;AAkBA,eAAe,cACb,UACA,eACA,YACA,iBACwB;AACxB,QAAM,QAAyB,CAAC;AAChC,QAAM,iBAAkC,CAAC;AACzC,MAAI,UAAU;AACd,QAAM,OAAO,oBAAI,IAAY;AAG7B,QAAM,WAAW,oBAAI,IAA0B;AAC/C,aAAW,OAAO,UAAU;AAC1B,UAAM,SAAS,IAAI,YAAY;AAC/B,QAAI,QAAQ;AACV,YAAM,WAAW,SAAS,IAAI,MAAM,KAAK,CAAC;AAC1C,eAAS,KAAK,GAAG;AACjB,eAAS,IAAI,QAAQ,QAAQ;AAAA,IAC/B;AAAA,EACF;AAGA,aAAW,CAAC,EAAE,KAAK,KAAK,UAAU;AAChC,QAAI,MAAM,SAAS,EAAG;AACtB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,eAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACzC,cAAM,IAAI,MAAM,CAAC;AACjB,cAAM,IAAI,MAAM,CAAC;AACjB,cAAM,SAAS,cAAc,EAAE,YAAY,IAAK,EAAE,YAAY,EAAG;AAEjE,YAAI,KAAK,IAAI,MAAM,EAAG;AACtB,aAAK,IAAI,MAAM;AAGf,cAAM,WAAW,cAAc,IAAI,MAAM;AACzC,YAAI,YAAY,cAAc,UAAU,WAAW,YAAY,GAAG;AAChE;AACA;AAAA,QACF;AAEA,cAAM,KAAK;AAAA,UACT,KAAK,EAAE,YAAY;AAAA,UACnB,KAAK,EAAE,YAAY;AAAA,UACnB,OAAO,EAAE;AAAA,UACT,OAAO,EAAE;AAAA,UACT,WAAW,EAAE,YAAY;AAAA,UACzB,WAAW,EAAE,YAAY;AAAA,QAC3B,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAGA,QAAM,WAAW,SAAS,OAAO,CAAC,MAAM,CAAC,EAAE,YAAY,SAAS;AAChE,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAS,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AAC5C,YAAM,IAAI,SAAS,CAAC;AACpB,YAAM,IAAI,SAAS,CAAC;AACpB,YAAM,UAAU;AAAA,QACb,EAAE,YAAY,QAAqB,CAAC;AAAA,QACpC,EAAE,YAAY,QAAqB,CAAC;AAAA,MACvC;AAEA,UAAI,UAAU,WAAW,kBAAmB;AAE5C,YAAM,SAAS,cAAc,EAAE,YAAY,IAAK,EAAE,YAAY,EAAG;AACjE,UAAI,KAAK,IAAI,MAAM,EAAG;AACtB,WAAK,IAAI,MAAM;AAEf,YAAM,WAAW,cAAc,IAAI,MAAM;AACzC,UAAI,YAAY,cAAc,UAAU,WAAW,YAAY,GAAG;AAChE;AACA;AAAA,MACF;AAEA,YAAM,KAAK;AAAA,QACT,KAAK,EAAE,YAAY;AAAA,QACnB,KAAK,EAAE,YAAY;AAAA,QACnB,OAAO,EAAE;AAAA,QACT,OAAO,EAAE;AAAA,QACT,WAAW,EAAE,YAAY;AAAA,QACzB,WAAW,EAAE,YAAY;AAAA,MAC3B,CAAC;AAAA,IACH;AAAA,EACF;AAGA,MAAI,iBAAiB;AACnB,UAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,IAAK,CAAC,CAAC,CAAC;AACtE,eAAW,OAAO,UAAU;AAC1B,YAAM,KAAK,IAAI,YAAY;AAC3B,UAAI;AACF,cAAM,OAAO,MAAM,gBAAgB,IAAI,SAAS,EAAE;AAClD,mBAAW,OAAO,MAAM;AACtB,cAAI,IAAI,QAAQ,WAAW,gBAAiB;AAC5C,cAAI,IAAI,OAAO,GAAI;AACnB,gBAAM,OAAO,WAAW,IAAI,IAAI,EAAE;AAClC,cAAI,CAAC,KAAM;AAEX,gBAAM,SAAS,cAAc,IAAI,IAAI,EAAE;AACvC,cAAI,KAAK,IAAI,MAAM,EAAG;AACtB,eAAK,IAAI,MAAM;AAEf,gBAAM,WAAW,cAAc,IAAI,MAAM;AACzC,cAAI,YAAY,cAAc,UAAU,WAAW,YAAY,GAAG;AAChE;AACA;AAAA,UACF;AAEA,yBAAe,KAAK;AAAA,YAClB,KAAK;AAAA,YACL,KAAK,IAAI;AAAA,YACT,OAAO,IAAI;AAAA,YACX,OAAO,KAAK;AAAA,YACZ,WAAW,IAAI,YAAY;AAAA,YAC3B,WAAW,KAAK,YAAY;AAAA,UAC9B,CAAC;AAAA,QACH;AAAA,MACF,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AAIA,QAAM,KAAK,GAAG,cAAc;AAE5B,SAAO,EAAE,OAAO,QAAQ;AAC1B;AAIA,eAAe,qBAAqB,SAAyB,WAA2C;AACtG,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,QAAQ,gBAAgB;AAAA,EACtC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AAEA,SAAO,IAAI,OAAO,CAAC,QAAQ;AACzB,UAAM,KAAK,IAAI;AAEf,UAAM,SAAU,GAAG,UAA2B;AAC9C,QAAI,CAAC,gBAAgB,IAAI,MAAM,EAAG,QAAO;AAGzC,UAAM,WAAW,GAAG;AACpB,QAAI,YAAY,CAAC,gBAAgB,IAAI,QAAQ,EAAG,QAAO;AAGvD,QAAI,CAAC,IAAI,WAAW,IAAI,QAAQ,KAAK,EAAE,WAAW,EAAG,QAAO;AAG5D,QAAI,CAAC,GAAG,GAAI,QAAO;AAMnB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,eAAe,GAAa,GAAqB;AACxD,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAC7C,QAAM,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAClD,QAAM,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAClD,MAAI,eAAe;AACnB,aAAW,QAAQ,MAAM;AACvB,QAAI,KAAK,IAAI,IAAI,EAAG;AAAA,EACtB;AACA,QAAM,QAAQ,KAAK,OAAO,KAAK,OAAO;AACtC,SAAO,UAAU,IAAI,IAAI,eAAe;AAC1C;","names":[]}