@remnic/core 9.69.22 → 9.69.24

package/dist/chunk-DK6GMO6D.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/maintenance/rebuild-memory-projection.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, rm, stat } from \"node:fs/promises\";\nimport { StorageManager } from \"../storage.js\";\nimport { log } from \"../logger.js\";\nimport {\n  listMemoryGovernanceRuns,\n  readMemoryGovernanceRunArtifact,\n} from \"./memory-governance.js\";\nimport { loadPersistedNativeKnowledgeChunks } from \"../native-knowledge.js\";\nimport { toBackupStamp } from \"./backup-stamp.js\";\nimport type {\n  MemoryFile,\n  MemoryLifecycleEvent,\n  MemoryProjectionCurrentState,\n  MemoryStatus,\n} from \"../types.js\";\nimport {\n  buildLifecycleEventsForMemory,\n  inferMemoryStatus,\n  MEMORY_LIFECYCLE_EVENT_SORT_ORDER,\n  memoryLifecycleEventProjectionIdentity,\n  sortMemoryLifecycleEvents,\n  toMemoryPathRel,\n} from \"../memory-lifecycle-ledger-utils.js\";\nimport {\n  getMemoryProjectionPath,\n  initializeMemoryProjectionDb,\n  isProjectedMemoryPathValid,\n  type ProjectedEntityMentionRow,\n  type MemoryProjectionGovernanceAppliedActionRow,\n  type MemoryProjectionGovernanceReviewQueueRow,\n  type ProjectedNativeKnowledgeChunkRow,\n  MEMORY_PROJECTION_SCHEMA_VERSION,\n  memoryCurrentSelectExpressions,\n  parseCurrentRow,\n  readProjectedEntityMentions,\n  readProjectedGovernanceRecord,\n  readProjectedNativeKnowledgeChunks,\n  parseTimelineRows,\n} from \"../memory-projection-store.js\";\nimport {\n  normalizeProjectionPreview,\n  normalizeProjectionTags,\n} from \"../memory-projection-format.js\";\nimport { openBetterSqlite3 } from \"../runtime/better-sqlite.js\";\nimport { commitPreparedFileAtomically } from \"./atomic-file.js\";\nimport { isSupportPassportPrivateMemory } from \"../support-passport/card-projection.js\";\n\nexport interface RebuildMemoryProjectionOptions {\n  memoryDir: string;\n  /** Reuse the caller's live StorageManager (must be rooted at memoryDir). */\n  storage?: StorageManager;\n  defaultNamespace?: string;\n  dryRun?: boolean;\n  now?: Date;\n  updatedAfter?: string;\n  updatedBefore?: string;\n}\n\nexport type {\n  SkippedBlankIdMemory,\n  SkippedBlankIdTimelineEvent,\n  SkippedDuplicateMemory,\n  SkippedDuplicateTimelineEvent,\n} from \"./projection-support.js\";\nimport {\n  assertInjectedStorageRooted,\n  readProjectedEntityMentionRows,\n  readProjectedGovernanceRows,\n  readProjectedNativeKnowledgeRows,\n  writeProjectionMetaHighWater,\n} from \"./projection-support.js\";\nimport type {\n  SkippedBlankIdMemory,\n  SkippedBlankIdTimelineEvent,\n  SkippedDuplicateMemory,\n  SkippedDuplicateTimelineEvent,\n} from \"./projection-support.js\";\n\n\nexport interface RebuildMemoryProjectionResult {\n  dryRun: boolean;\n  scannedMemories: number;\n  currentRows: number;\n  timelineRows: number;\n  entityMentionRows: number;\n  nativeKnowledgeRows: number;\n  reviewQueueRows: number;\n  outputPath: string;\n  backupPath?: string;\n  usedLifecycleLedger: boolean;\n  skippedDuplicateMemories: SkippedDuplicateMemory[];\n  skippedBlankIdMemories: SkippedBlankIdMemory[];\n  skippedDuplicateTimelineEvents: SkippedDuplicateTimelineEvent[];\n  skippedBlankIdTimelineEvents: SkippedBlankIdTimelineEvent[];\n  scope: {\n    updatedAfter: string | null;\n    updatedBefore: string | null;\n  };\n}\n\nexport interface VerifyMemoryProjectionOptions {\n  memoryDir: string;\n  defaultNamespace?: string;\n  updatedAfter?: string;\n  updatedBefore?: string;\n}\n\nexport interface VerifyMemoryProjectionResult {\n  outputPath: string;\n  projectionExists: boolean;\n  ok: boolean;\n  expectedCurrentRows: number;\n  actualCurrentRows: number;\n  expectedTimelineRows: number;\n  actualTimelineRows: number;\n  expectedEntityMentionRows: number;\n  actualEntityMentionRows: number;\n  expectedNativeKnowledgeRows: number;\n  actualNativeKnowledgeRows: number;\n  expectedReviewQueueRows: number;\n  actualReviewQueueRows: number;\n  missingCurrentMemoryIds: string[];\n  extraCurrentMemoryIds: string[];\n  mismatchedCurrentMemoryIds: string[];\n  missingTimelineEventIds: string[];\n  extraTimelineEventIds: string[];\n  missingEntityMentionKeys: string[];\n  extraEntityMentionKeys: string[];\n  mismatchedEntityMentionKeys: string[];\n  missingNativeKnowledgeChunkIds: string[];\n  extraNativeKnowledgeChunkIds: string[];\n  mismatchedNativeKnowledgeChunkIds: string[];\n  missingReviewQueueEntryIds: string[];\n  extraReviewQueueEntryIds: string[];\n  mismatchedReviewQueueEntryIds: string[];\n  usedLifecycleLedger: boolean;\n  scope: {\n    updatedAfter: string | null;\n    updatedBefore: string | null;\n  };\n}\n\nexport interface RepairMemoryProjectionOptions extends RebuildMemoryProjectionOptions {}\n\nexport interface RepairMemoryProjectionResult {\n  dryRun: boolean;\n  repaired: boolean;\n  verify: VerifyMemoryProjectionResult;\n  rebuild?: RebuildMemoryProjectionResult;\n}\n\nfunction isNodeError(err: unknown): err is NodeJS.ErrnoException {\n  return typeof err === \"object\" && err !== null && \"code\" in err;\n}\n\nexport async function backupExistingProjection(\n  memoryDir: string,\n  outputPath: string,\n  now: Date,\n): Promise<string | undefined> {\n  try {\n    await stat(outputPath);\n  } catch (err) {\n    if (isNodeError(err) && err.code === \"ENOENT\") {\n      return undefined;\n    }\n    throw err;\n  }\n\n  const backupPath = path.join(\n    memoryDir,\n    \"archive\",\n    \"memory-projection\",\n    toBackupStamp(now),\n    \"state\",\n    \"memory-projection.sqlite\",\n  );\n  return backupPath;\n}\n\nfunction inferProjectedStatus(pathRel: string, memory: MemoryFile): MemoryStatus {\n  return inferMemoryStatus(memory.frontmatter, pathRel);\n}\n\nfunction toCurrentStateRow(memoryDir: string, memory: MemoryFile): MemoryProjectionCurrentState {\n  const pathRel = toMemoryPathRel(memoryDir, memory.path);\n  return {\n    memoryId: memory.frontmatter.id,\n    category: memory.frontmatter.category,\n    status: inferProjectedStatus(pathRel, memory),\n    lifecycleState: memory.frontmatter.lifecycleState,\n    path: memory.path,\n    pathRel,\n    created: memory.frontmatter.created,\n    updated: memory.frontmatter.updated,\n    archivedAt: memory.frontmatter.archivedAt,\n    supersededAt: memory.frontmatter.supersededAt,\n    entityRef: memory.frontmatter.entityRef,\n    source: memory.frontmatter.source,\n    confidence: memory.frontmatter.confidence,\n    confidenceTier: memory.frontmatter.confidenceTier,\n    memoryKind: memory.frontmatter.memoryKind,\n    accessCount: memory.frontmatter.accessCount,\n    lastAccessed: memory.frontmatter.lastAccessed,\n    tags: normalizeProjectionTags(memory.frontmatter.tags),\n    preview: normalizeProjectionPreview(memory.content),\n    privateRecord: isSupportPassportPrivateMemory(memory),\n  };\n}\n\nfunction buildEntityMentionRows(\n  currentRows: MemoryProjectionCurrentState[],\n): ProjectedEntityMentionRow[] {\n  return currentRows.flatMap((row) => {\n    const mentions: ProjectedEntityMentionRow[] = [];\n    if (row.entityRef) {\n      mentions.push({\n        memoryId: row.memoryId,\n        entityRef: row.entityRef,\n        mentionSource: \"frontmatter.entityRef\",\n        created: row.created,\n        updated: row.updated,\n      });\n    }\n    for (const tag of row.tags ?? []) {\n      if (!tag.includes(\":\")) continue;\n      mentions.push({\n        memoryId: row.memoryId,\n        entityRef: tag,\n        mentionSource: \"tag\",\n        created: row.created,\n        updated: row.updated,\n      });\n    }\n    return mentions;\n  });\n}\n\nfunction buildGovernanceActionRowKey(action: {\n  action: string;\n  memoryId: string;\n  reasonCode: string;\n  originalPath: string;\n  currentPath: string;\n}): string {\n  return [\n    action.action,\n    action.memoryId,\n    action.reasonCode,\n    action.originalPath,\n    action.currentPath,\n  ].join(\"::\");\n}\n\nasync function loadLatestGovernanceProjection(memoryDir: string): Promise<{\n  runId: string;\n  summary: unknown;\n  metrics: unknown;\n  reviewQueueRows: MemoryProjectionGovernanceReviewQueueRow[];\n  appliedActionRows: MemoryProjectionGovernanceAppliedActionRow[];\n  report: string;\n} | null> {\n  const runId = (await listMemoryGovernanceRuns(memoryDir))[0];\n  if (!runId) return null;\n  try {\n    const artifact = await readMemoryGovernanceRunArtifact(memoryDir, runId);\n    return {\n      runId,\n      summary: artifact.summary,\n      metrics: artifact.metrics,\n      reviewQueueRows: artifact.reviewQueue.map((entry) => ({\n        runId,\n        entryId: entry.entryId,\n        memoryId: entry.memoryId,\n        path: entry.path,\n        reasonCode: entry.reasonCode,\n        severity: entry.severity,\n        suggestedAction: entry.suggestedAction,\n        suggestedStatus: entry.suggestedStatus,\n        relatedMemoryIds: [...entry.relatedMemoryIds],\n      })),\n      appliedActionRows: artifact.appliedActions.map((action) => ({\n        runId,\n        rowKey: buildGovernanceActionRowKey(action),\n        action: action.action,\n        memoryId: action.memoryId,\n        reasonCode: action.reasonCode,\n        beforeStatus: action.beforeStatus,\n        afterStatus: action.afterStatus,\n        originalPath: action.originalPath,\n        currentPath: action.currentPath,\n      })),\n      report: artifact.report,\n    };\n  } catch {\n    return null;\n  }\n}\n\nfunction loadTimelineEvents(\n  memories: MemoryFile[],\n  lifecycleEvents: MemoryLifecycleEvent[],\n): { events: MemoryLifecycleEvent[]; usedLifecycleLedger: boolean } {\n  if (lifecycleEvents.length > 0) {\n    return {\n      events: sortMemoryLifecycleEvents(lifecycleEvents),\n      usedLifecycleLedger: true,\n    };\n  }\n\n  return {\n    events: sortMemoryLifecycleEvents(memories.flatMap((memory) => buildLifecycleEventsForMemory(memory))),\n    usedLifecycleLedger: false,\n  };\n}\n\nfunction normalizeScopedIso(value: string | undefined): string | null {\n  if (!value) return null;\n  const trimmed = value.trim();\n  if (!trimmed) return null;\n  const parsed = new Date(trimmed);\n  if (Number.isNaN(parsed.getTime())) {\n    throw new Error(`invalid projection scope timestamp: ${value}`);\n  }\n  return parsed.toISOString();\n}\n\nfunction normalizeProjectionScope(options: {\n  updatedAfter?: string;\n  updatedBefore?: string;\n}): {\n  updatedAfter: string | null;\n  updatedBefore: string | null;\n} {\n  const updatedAfter = normalizeScopedIso(options.updatedAfter);\n  const updatedBefore = normalizeScopedIso(options.updatedBefore);\n  if (\n    updatedAfter &&\n    updatedBefore &&\n    new Date(updatedAfter).getTime() > new Date(updatedBefore).getTime()\n  ) {\n    throw new Error(\"updatedAfter must be less than or equal to updatedBefore\");\n  }\n  return {\n    updatedAfter,\n    updatedBefore,\n  };\n}\n\nfunction hasScopedProjectionFilter(scope: {\n  updatedAfter: string | null;\n  updatedBefore: string | null;\n}): boolean {\n  return scope.updatedAfter !== null || scope.updatedBefore !== null;\n}\n\nfunction memoryScopeTimestamp(memory: MemoryFile): string {\n  const candidate = memory.frontmatter.updated || memory.frontmatter.created;\n  return candidate;\n}\n\nfunction isTimestampInProjectionScope(\n  timestamp: string,\n  scope: { updatedAfter: string | null; updatedBefore: string | null },\n): boolean {\n  if (!scope.updatedAfter && !scope.updatedBefore) return true;\n  const parsed = new Date(timestamp);\n  if (Number.isNaN(parsed.getTime())) return false;\n  if (scope.updatedAfter && parsed.getTime() < new Date(scope.updatedAfter).getTime()) return false;\n  if (scope.updatedBefore && parsed.getTime() >= new Date(scope.updatedBefore).getTime()) return false;\n  return true;\n}\n\nfunction filterMemoriesForProjectionScope(\n  memories: MemoryFile[],\n  scope: { updatedAfter: string | null; updatedBefore: string | null },\n): MemoryFile[] {\n  if (!scope.updatedAfter && !scope.updatedBefore) return memories;\n  return memories.filter((memory) => isTimestampInProjectionScope(memoryScopeTimestamp(memory), scope));\n}\n\nfunction filterCurrentStateRowsForProjectionScope(\n  rows: MemoryProjectionCurrentState[],\n  scope: { updatedAfter: string | null; updatedBefore: string | null },\n): MemoryProjectionCurrentState[] {\n  if (!scope.updatedAfter && !scope.updatedBefore) return rows;\n  return rows.filter((row) => isTimestampInProjectionScope(row.updated || row.created, scope));\n}\n\nfunction serializeCurrentStateRow(row: MemoryProjectionCurrentState): string {\n  return JSON.stringify({\n    memoryId: row.memoryId,\n    category: row.category,\n    status: row.status,\n    lifecycleState: row.lifecycleState ?? null,\n    pathRel: row.pathRel,\n    created: row.created,\n    updated: row.updated,\n    archivedAt: row.archivedAt ?? null,\n    supersededAt: row.supersededAt ?? null,\n    entityRef: row.entityRef ?? null,\n    source: row.source,\n    confidence: row.confidence,\n    confidenceTier: row.confidenceTier,\n    memoryKind: row.memoryKind ?? null,\n    accessCount: row.accessCount ?? null,\n    lastAccessed: row.lastAccessed ?? null,\n    tags: row.tags ?? [],\n    preview: row.preview ?? \"\",\n    privateRecord: row.privateRecord === true,\n  });\n}\n\nfunction serializeTimelineEvent(event: MemoryLifecycleEvent): string {\n  return JSON.stringify({\n    eventId: event.eventId,\n    memoryId: event.memoryId,\n    eventType: event.eventType,\n    timestamp: event.timestamp,\n    actor: event.actor,\n    reasonCode: event.reasonCode ?? null,\n    ruleVersion: event.ruleVersion,\n    relatedMemoryIds: event.relatedMemoryIds ?? [],\n    before: event.before ?? null,\n    after: event.after ?? null,\n    correlationId: event.correlationId ?? null,\n  });\n}\n\nfunction serializeEntityMentionRow(row: ProjectedEntityMentionRow): string {\n  return JSON.stringify(row);\n}\n\nfunction serializeNativeKnowledgeRow(row: ProjectedNativeKnowledgeChunkRow): string {\n  return JSON.stringify({\n    chunkId: row.chunkId,\n    sourceKind: row.sourceKind,\n    sourcePath: row.sourcePath,\n    title: row.title,\n    startLine: row.startLine,\n    endLine: row.endLine,\n    namespace: row.namespace ?? null,\n    privacyClass: row.privacyClass ?? null,\n    derivedDate: row.derivedDate ?? null,\n    sessionKey: row.sessionKey ?? null,\n    workflowKey: row.workflowKey ?? null,\n    author: row.author ?? null,\n    agent: row.agent ?? null,\n    sourceHash: row.sourceHash ?? null,\n    preview: row.preview,\n  });\n}\n\nfunction serializeGovernanceReviewQueueRow(\n  row: MemoryProjectionGovernanceReviewQueueRow,\n): string {\n  return JSON.stringify({\n    runId: row.runId,\n    entryId: row.entryId,\n    memoryId: row.memoryId,\n    path: row.path,\n    reasonCode: row.reasonCode,\n    severity: row.severity,\n    suggestedAction: row.suggestedAction,\n    suggestedStatus: row.suggestedStatus ?? null,\n    relatedMemoryIds: row.relatedMemoryIds,\n  });\n}\n\nfunction selectProjectionMemories(\n  tiers: MemoryFile[][],\n): {\n  allMemories: MemoryFile[];\n  memories: MemoryFile[];\n  skippedDuplicateMemories: SkippedDuplicateMemory[];\n  skippedBlankIdMemories: SkippedBlankIdMemory[];\n} {\n  const allMemories = tiers.flat();\n  const memories: MemoryFile[] = [];\n  const keptById = new Map<string, MemoryFile>();\n  const skippedDuplicateMemories: SkippedDuplicateMemory[] = [];\n  const skippedBlankIdMemories: SkippedBlankIdMemory[] = [];\n\n  // Tier order is authoritative: hot wins over cold, and cold wins over archive.\n  // Paths break ties within a tier so the winner does not depend on readdir order.\n  for (const tier of tiers) {\n    for (const memory of [...tier].sort((left, right) => left.path.localeCompare(right.path))) {\n      const memoryId = memory.frontmatter.id.trim();\n      if (!memoryId) {\n        skippedBlankIdMemories.push({ path: memory.path });\n        log.warn(`projection rebuild skipped blank memory id: path=${memory.path}`);\n        continue;\n      }\n      const kept = keptById.get(memoryId);\n      if (kept) {\n        skippedDuplicateMemories.push({\n          memoryId,\n          keptPath: kept.path,\n          skippedPath: memory.path,\n        });\n        log.warn(\n          `projection rebuild skipped duplicate memory id=${memoryId}: kept=${kept.path} skipped=${memory.path}`,\n        );\n        continue;\n      }\n      keptById.set(memoryId, memory);\n      memories.push(memory);\n    }\n  }\n\n  return { allMemories, memories, skippedDuplicateMemories, skippedBlankIdMemories };\n}\n\nfunction deduplicateTimelineEvents(\n  events: MemoryLifecycleEvent[],\n  sourcePathFor: (event: MemoryLifecycleEvent) => string,\n): {\n  events: MemoryLifecycleEvent[];\n  skipped: SkippedDuplicateTimelineEvent[];\n  skippedBlankIds: SkippedBlankIdTimelineEvent[];\n} {\n  const keptById = new Map<string, { event: MemoryLifecycleEvent; path: string }>();\n  const unique: MemoryLifecycleEvent[] = [];\n  const skipped: SkippedDuplicateTimelineEvent[] = [];\n  const skippedBlankIds: SkippedBlankIdTimelineEvent[] = [];\n  for (const event of sortMemoryLifecycleEvents(events)) {\n    const sourcePath = sourcePathFor(event);\n    if (!event.memoryId.trim()) {\n      skippedBlankIds.push({ eventId: event.eventId, path: sourcePath });\n      log.warn(\n        `projection rebuild skipped timeline event with blank memory id: `\n        + `event_id=${event.eventId} path=${sourcePath}`,\n      );\n      continue;\n    }\n    const kept = keptById.get(event.eventId);\n    if (kept) {\n      skipped.push({\n        eventId: event.eventId,\n        keptPath: kept.path,\n        skippedPath: sourcePath,\n      });\n      log.warn(\n        `projection rebuild skipped duplicate timeline event_id=${event.eventId}: `\n        + `kept=${kept.path} skipped=${sourcePath}`,\n      );\n      continue;\n    }\n    keptById.set(event.eventId, { event, path: sourcePath });\n    unique.push(event);\n  }\n  return { events: unique, skipped, skippedBlankIds };\n}\n\nasync function loadAuthoritativeProjectionSnapshot(options: {\n  memoryDir: string;\n  defaultNamespace?: string;\n  storage?: StorageManager;\n  updatedAfter?: string;\n  updatedBefore?: string;\n}): Promise<{\n  allMemories: MemoryFile[];\n  currentRows: MemoryProjectionCurrentState[];\n  timelineRows: MemoryLifecycleEvent[];\n  scopedCurrentRows: MemoryProjectionCurrentState[];\n  scopedTimelineRows: MemoryLifecycleEvent[];\n  entityMentionRows: ProjectedEntityMentionRow[];\n  scopedEntityMentionRows: ProjectedEntityMentionRow[];\n  nativeKnowledgeRows: ProjectedNativeKnowledgeChunkRow[];\n  governance:\n    | {\n      runId: string;\n      summary: unknown;\n      metrics: unknown;\n      reviewQueueRows: MemoryProjectionGovernanceReviewQueueRow[];\n      appliedActionRows: MemoryProjectionGovernanceAppliedActionRow[];\n      report: string;\n    }\n    | null;\n  usedLifecycleLedger: boolean;\n  sourceLifecycleLedgerEventCount: number;\n  scope: {\n    updatedAfter: string | null;\n    updatedBefore: string | null;\n  };\n  skippedDuplicateMemories: SkippedDuplicateMemory[];\n  skippedBlankIdMemories: SkippedBlankIdMemory[];\n  skippedDuplicateTimelineEvents: SkippedDuplicateTimelineEvent[];\n  skippedBlankIdTimelineEvents: SkippedBlankIdTimelineEvent[];\n}> {\n  const storage = assertInjectedStorageRooted(\"rebuildMemoryProjection\", options.memoryDir, options.storage) ?? new StorageManager(options.memoryDir);\n  // Force a fresh disk read — projection verify/rebuild must see the true\n  // on-disk state, not a potentially stale in-process cache.\n  storage.invalidateAllMemoriesCacheForDir();\n  const selected = selectProjectionMemories([\n    await storage.readAllMemories(),\n    await storage.readAllColdMemories(),\n    await storage.readArchivedMemories(),\n  ]);\n  const allMemories = selected.allMemories;\n  const projectionMemories = selected.memories;\n  const lifecycleEvents = await storage.readAllMemoryLifecycleEvents();\n  const timeline = loadTimelineEvents(projectionMemories, lifecycleEvents);\n  const lifecycleLedgerPath = path.join(\n    options.memoryDir,\n    \"state\",\n    \"memory-lifecycle-ledger.jsonl\",\n  );\n  const memoryPathById = new Map(\n    projectionMemories.map((memory) => [memory.frontmatter.id, memory.path]),\n  );\n  const deduplicatedTimeline = deduplicateTimelineEvents(\n    timeline.events,\n    (event) => timeline.usedLifecycleLedger\n      ? lifecycleLedgerPath\n      : memoryPathById.get(event.memoryId) ?? lifecycleLedgerPath,\n  );\n  const events = deduplicatedTimeline.events;\n  const usedLifecycleLedger = timeline.usedLifecycleLedger;\n  const sourceLifecycleLedgerEventCount = new Set(\n    lifecycleEvents.map(memoryLifecycleEventProjectionIdentity),\n  ).size;\n  const currentRows = projectionMemories.map((memory) => toCurrentStateRow(options.memoryDir, memory));\n  const scope = normalizeProjectionScope(options);\n  const scopedMemories = filterMemoriesForProjectionScope(projectionMemories, scope);\n  const scopedMemoryIds = new Set(scopedMemories.map((memory) => memory.frontmatter.id));\n  const nativeKnowledgeRows = await loadPersistedNativeKnowledgeChunks({\n    memoryDir: options.memoryDir,\n    defaultNamespace: options.defaultNamespace ?? \"default\",\n  }).then((rows) => rows.map((row) => ({\n    chunkId: row.chunkId,\n    sourceKind: row.sourceKind,\n    sourcePath: row.sourcePath,\n    title: row.title,\n    startLine: row.startLine,\n    endLine: row.endLine,\n    namespace: row.namespace ?? options.defaultNamespace ?? \"default\",\n    privacyClass: row.privacyClass,\n    derivedDate: row.derivedDate,\n    sessionKey: row.sessionKey,\n    workflowKey: row.workflowKey,\n    author: row.author,\n    agent: row.agent,\n    sourceHash: row.sourceHash,\n    preview: normalizeProjectionPreview(row.content),\n  })));\n  const governance = await loadLatestGovernanceProjection(options.memoryDir);\n  const entityMentionRows = buildEntityMentionRows(currentRows);\n\n  return {\n    allMemories,\n    currentRows,\n    timelineRows: events,\n    scopedCurrentRows: currentRows.filter((row) => scopedMemoryIds.has(row.memoryId)),\n    scopedTimelineRows: events.filter((event) => scopedMemoryIds.has(event.memoryId)),\n    entityMentionRows,\n    scopedEntityMentionRows: entityMentionRows.filter((row) => scopedMemoryIds.has(row.memoryId)),\n    nativeKnowledgeRows,\n    governance,\n    usedLifecycleLedger,\n    sourceLifecycleLedgerEventCount,\n    scope,\n    skippedDuplicateMemories: selected.skippedDuplicateMemories,\n    skippedBlankIdMemories: selected.skippedBlankIdMemories,\n    skippedDuplicateTimelineEvents: deduplicatedTimeline.skipped,\n    skippedBlankIdTimelineEvents: deduplicatedTimeline.skippedBlankIds,\n  };\n}\n\nfunction readProjectedCurrentRows(\n  memoryDir: string,\n): { projectionExists: boolean; rows: MemoryProjectionCurrentState[] } {\n  const dbPath = getMemoryProjectionPath(memoryDir);\n  try {\n    const db = openBetterSqlite3(dbPath, { readonly: true, fileMustExist: true });\n    try {\n      const selectExpressions = memoryCurrentSelectExpressions(db);\n      const rows = db.prepare(`\n        SELECT\n          memory_id,\n          category,\n          status,\n          lifecycle_state,\n          path_rel,\n          created_at,\n          updated_at,\n          archived_at,\n          superseded_at,\n          entity_ref,\n          source,\n          confidence,\n          confidence_tier,\n          memory_kind,\n          access_count,\n          last_accessed,\n          ${selectExpressions.tagsJson}, ${selectExpressions.previewText}, ${selectExpressions.privateRecord}\n        FROM memory_current\n      `).all() as Array<Record<string, unknown>>;\n\n      return {\n        projectionExists: true,\n        rows: rows\n          .map((row) => parseCurrentRow(memoryDir, row))\n          .filter((row): row is MemoryProjectionCurrentState => row !== null),\n      };\n    } finally {\n      db.close();\n    }\n  } catch {\n    return { projectionExists: false, rows: [] };\n  }\n}\n\nfunction readProjectedTimelineRows(\n  memoryDir: string,\n): { projectionExists: boolean; rows: MemoryLifecycleEvent[] } {\n  const dbPath = getMemoryProjectionPath(memoryDir);\n  try {\n    const db = openBetterSqlite3(dbPath, { readonly: true, fileMustExist: true });\n    try {\n      const rows = db.prepare(`\n        SELECT\n          event_id,\n          memory_id,\n          event_type,\n          timestamp,\n          actor,\n          reason_code,\n          rule_version,\n          related_memory_ids_json,\n          before_json,\n          after_json,\n          correlation_id\n        FROM memory_timeline\n      `).all() as Array<Record<string, unknown>>;\n\n      return {\n        projectionExists: true,\n        rows: parseTimelineRows(rows),\n      };\n    } finally {\n      db.close();\n    }\n  } catch {\n    return { projectionExists: false, rows: [] };\n  }\n}\n\n\nfunction writeProjectionDb(\n  dbPath: string,\n  nowIso: string,\n  currentRows: MemoryProjectionCurrentState[],\n  timelineRows: MemoryLifecycleEvent[],\n  entityMentionRows: ProjectedEntityMentionRow[],\n  nativeKnowledgeRows: ProjectedNativeKnowledgeChunkRow[],\n  governance: Awaited<ReturnType<typeof loadLatestGovernanceProjection>>,\n  usedLifecycleLedger: boolean,\n  sourceLifecycleLedgerEventCount: number,\n): void {\n  const db = openBetterSqlite3(dbPath);\n  const memoryDir = path.dirname(path.dirname(dbPath));\n  try {\n    initializeMemoryProjectionDb(db);\n\n    const insertMeta = db.prepare(\"INSERT OR REPLACE INTO meta(key, value) VALUES (?, ?)\");\n    insertMeta.run(\"schemaVersion\", String(MEMORY_PROJECTION_SCHEMA_VERSION));\n    insertMeta.run(\"rebuiltAt\", nowIso);\n    insertMeta.run(\"usedLifecycleLedger\", usedLifecycleLedger ? \"true\" : \"false\");\n    writeProjectionMetaHighWater(insertMeta, sourceLifecycleLedgerEventCount, timelineRows);\n    insertMeta.run(\"latestGovernanceRunId\", governance?.runId ?? \"\");\n\n    const insertCurrent = db.prepare(`\n      INSERT INTO memory_current (\n        memory_id,\n        category,\n        status,\n        lifecycle_state,\n        path_rel,\n        path_valid,\n        created_at,\n        updated_at,\n        archived_at,\n        superseded_at,\n        entity_ref,\n        source,\n        confidence,\n        confidence_tier,\n        memory_kind,\n        access_count,\n        last_accessed,\n        tags_json, preview_text, private_record\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertTimeline = db.prepare(`\n      INSERT INTO memory_timeline (\n        event_id,\n        memory_id,\n        event_type,\n        timestamp,\n        event_order,\n        actor,\n        reason_code,\n        rule_version,\n        related_memory_ids_json,\n        before_json,\n        after_json,\n        correlation_id\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertEntityMention = db.prepare(`\n      INSERT INTO memory_entity_mentions (\n        memory_id,\n        entity_ref,\n        mention_source,\n        created_at,\n        updated_at\n      ) VALUES (?, ?, ?, ?, ?)\n    `);\n\n    const insertNativeKnowledge = db.prepare(`\n      INSERT INTO native_knowledge_chunks (\n        chunk_id,\n        source_kind,\n        source_path,\n        title,\n        start_line,\n        end_line,\n        namespace,\n        privacy_class,\n        derived_date,\n        session_key,\n        workflow_key,\n        author,\n        agent,\n        source_hash,\n        preview_text\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertGovernanceReviewQueue = db.prepare(`\n      INSERT INTO memory_review_queue (\n        entry_id,\n        run_id,\n        memory_id,\n        path,\n        reason_code,\n        severity,\n        suggested_action,\n        suggested_status,\n        related_memory_ids_json\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertGovernanceAppliedAction = db.prepare(`\n      INSERT INTO memory_review_actions (\n        row_key,\n        run_id,\n        action,\n        memory_id,\n        reason_code,\n        before_status,\n        after_status,\n        original_path,\n        current_path\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertGovernanceRun = db.prepare(`\n      INSERT INTO memory_review_runs (\n        run_id,\n        created_at,\n        mode,\n        summary_json,\n        metrics_json,\n        applied_actions_json,\n        report_markdown\n      ) VALUES (?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const writeTx = db.transaction(() => {\n      for (const row of currentRows) {\n        insertCurrent.run(\n          row.memoryId,\n          row.category,\n          row.status,\n          row.lifecycleState ?? null,\n          row.pathRel,\n          isProjectedMemoryPathValid(memoryDir, row.pathRel) ? 1 : 0,\n          row.created,\n          row.updated,\n          row.archivedAt ?? null,\n          row.supersededAt ?? null,\n          row.entityRef ?? null,\n          row.source,\n          row.confidence,\n          row.confidenceTier,\n          row.memoryKind ?? null,\n          row.accessCount ?? null,\n          row.lastAccessed ?? null, JSON.stringify(row.tags ?? []), row.preview ?? \"\",\n          row.privateRecord === true ? 1 : 0,\n        );\n      }\n\n      for (const event of timelineRows) {\n        insertTimeline.run(\n          event.eventId,\n          event.memoryId,\n          event.eventType,\n          event.timestamp,\n          MEMORY_LIFECYCLE_EVENT_SORT_ORDER[event.eventType],\n          event.actor,\n          event.reasonCode ?? null,\n          event.ruleVersion,\n          JSON.stringify(event.relatedMemoryIds ?? []),\n          event.before ? JSON.stringify(event.before) : null,\n          event.after ? JSON.stringify(event.after) : null,\n          event.correlationId ?? null,\n        );\n      }\n\n      for (const row of entityMentionRows) {\n        insertEntityMention.run(\n          row.memoryId,\n          row.entityRef,\n          row.mentionSource,\n          row.created,\n          row.updated,\n        );\n      }\n\n      for (const row of nativeKnowledgeRows) {\n        insertNativeKnowledge.run(\n          row.chunkId,\n          row.sourceKind,\n          row.sourcePath,\n          row.title,\n          row.startLine,\n          row.endLine,\n          row.namespace ?? null,\n          row.privacyClass ?? null,\n          row.derivedDate ?? null,\n          row.sessionKey ?? null,\n          row.workflowKey ?? null,\n          row.author ?? null,\n          row.agent ?? null,\n          row.sourceHash ?? null,\n          row.preview,\n        );\n      }\n\n      for (const row of governance?.reviewQueueRows ?? []) {\n        insertGovernanceReviewQueue.run(\n          row.entryId,\n          row.runId,\n          row.memoryId,\n          row.path,\n          row.reasonCode,\n          row.severity,\n          row.suggestedAction,\n          row.suggestedStatus ?? null,\n          JSON.stringify(row.relatedMemoryIds),\n        );\n      }\n\n      for (const row of governance?.appliedActionRows ?? []) {\n        insertGovernanceAppliedAction.run(\n          row.rowKey,\n          row.runId,\n          row.action,\n          row.memoryId,\n          row.reasonCode,\n          row.beforeStatus,\n          row.afterStatus ?? null,\n          row.originalPath,\n          row.currentPath,\n        );\n      }\n\n      if (governance) {\n        const createdAt =\n          typeof (governance.summary as { createdAt?: unknown } | undefined)?.createdAt === \"string\"\n            ? (governance.summary as { createdAt: string }).createdAt\n            : nowIso;\n        const mode =\n          typeof (governance.summary as { mode?: unknown } | undefined)?.mode === \"string\"\n            ? (governance.summary as { mode: string }).mode\n            : \"shadow\";\n        insertGovernanceRun.run(\n          governance.runId,\n          createdAt,\n          mode,\n          JSON.stringify(governance.summary ?? null),\n          JSON.stringify(governance.metrics ?? null),\n          JSON.stringify(\n            (governance.appliedActionRows ?? []).map((row) => ({\n              action: row.action,\n              memoryId: row.memoryId,\n              reasonCode: row.reasonCode,\n              beforeStatus: row.beforeStatus,\n              afterStatus: row.afterStatus,\n              originalPath: row.originalPath,\n              currentPath: row.currentPath,\n            })),\n          ),\n          governance.report,\n        );\n      }\n    });\n\n    writeTx();\n  } finally {\n    db.close();\n  }\n}\n\nfunction mergeScopedCurrentRows(\n  existingRows: MemoryProjectionCurrentState[],\n  replacementRows: MemoryProjectionCurrentState[],\n  scopedMemoryIds: Set<string>,\n): MemoryProjectionCurrentState[] {\n  return [...existingRows.filter((row) => !scopedMemoryIds.has(row.memoryId)), ...replacementRows]\n    .sort((a, b) => a.memoryId.localeCompare(b.memoryId));\n}\n\nfunction mergeScopedTimelineRows(\n  existingRows: MemoryLifecycleEvent[],\n  replacementRows: MemoryLifecycleEvent[],\n  scopedMemoryIds: Set<string>,\n): MemoryLifecycleEvent[] {\n  return sortMemoryLifecycleEvents([\n    ...existingRows.filter((event) => !scopedMemoryIds.has(event.memoryId)),\n    ...replacementRows,\n  ]);\n}\n\nfunction mergeScopedEntityMentionRows(\n  existingRows: ProjectedEntityMentionRow[],\n  replacementRows: ProjectedEntityMentionRow[],\n  scopedMemoryIds: Set<string>,\n): ProjectedEntityMentionRow[] {\n  return [\n    ...existingRows.filter((row) => !scopedMemoryIds.has(row.memoryId)),\n    ...replacementRows,\n  ].sort((left, right) =>\n    [left.entityRef, left.memoryId, left.mentionSource].join(\"::\").localeCompare(\n      [right.entityRef, right.memoryId, right.mentionSource].join(\"::\"),\n    )\n  );\n}\n\nexport async function rebuildMemoryProjection(\n  options: RebuildMemoryProjectionOptions,\n): Promise<RebuildMemoryProjectionResult> {\n  const dryRun = options.dryRun !== false;\n  const now = options.now ?? new Date();\n  const outputPath = getMemoryProjectionPath(options.memoryDir);\n  const snapshot = await loadAuthoritativeProjectionSnapshot(options);\n\n  let backupPath: string | undefined;\n  if (!dryRun) {\n    let nextCurrentRows = snapshot.currentRows;\n    let nextTimelineRows = snapshot.timelineRows;\n    let nextEntityMentionRows = snapshot.entityMentionRows;\n    let nextNativeKnowledgeRows = snapshot.nativeKnowledgeRows;\n    let nextGovernance = snapshot.governance;\n    if (hasScopedProjectionFilter(snapshot.scope)) {\n      nextCurrentRows = snapshot.scopedCurrentRows;\n      nextTimelineRows = snapshot.scopedTimelineRows;\n      nextEntityMentionRows = snapshot.scopedEntityMentionRows;\n      const projectedCurrent = readProjectedCurrentRows(options.memoryDir);\n      const projectedTimeline = readProjectedTimelineRows(options.memoryDir);\n      const projectedEntityMentions = readProjectedEntityMentionRows(options.memoryDir);\n      const projectedNativeKnowledge = readProjectedNativeKnowledgeRows(options.memoryDir);\n      const projectedGovernance = readProjectedGovernanceRows(options.memoryDir);\n      if (projectedCurrent.projectionExists && projectedTimeline.projectionExists) {\n        const actualScopedCurrentRows = filterCurrentStateRowsForProjectionScope(\n          projectedCurrent.rows,\n          snapshot.scope,\n        );\n        const scopedMemoryIds = new Set([\n          ...snapshot.scopedCurrentRows.map((row) => row.memoryId),\n          ...snapshot.scopedTimelineRows.map((event) => event.memoryId),\n          ...actualScopedCurrentRows.map((row) => row.memoryId),\n        ]);\n        nextCurrentRows = mergeScopedCurrentRows(\n          projectedCurrent.rows,\n          snapshot.scopedCurrentRows,\n          scopedMemoryIds,\n        );\n        nextTimelineRows = mergeScopedTimelineRows(\n          projectedTimeline.rows,\n          snapshot.scopedTimelineRows,\n          scopedMemoryIds,\n        );\n        nextEntityMentionRows = mergeScopedEntityMentionRows(\n          projectedEntityMentions.rows,\n          snapshot.scopedEntityMentionRows,\n          scopedMemoryIds,\n        );\n      }\n      if (projectedNativeKnowledge.projectionExists) {\n        // Native knowledge rows are always loaded from the full persisted sync state,\n        // so scoped memory rebuilds should publish the fresh snapshot instead of\n        // pinning the projection to stale previously projected rows.\n        nextNativeKnowledgeRows = snapshot.nativeKnowledgeRows;\n      }\n      if (projectedGovernance.projectionExists && projectedGovernance.runId) {\n        // Governance rows are also sourced from standalone artifact snapshots, so\n        // scoped memory rebuilds should keep the latest governance artifact data\n        // instead of restoring whatever happened to be in the prior projection.\n        nextGovernance = snapshot.governance;\n      }\n    }\n\n    const tempPath = `${outputPath}.tmp`;\n    await mkdir(path.dirname(outputPath), { recursive: true });\n    await rm(tempPath, { force: true });\n    writeProjectionDb(\n      tempPath,\n      now.toISOString(),\n      nextCurrentRows,\n      nextTimelineRows,\n      nextEntityMentionRows,\n      nextNativeKnowledgeRows,\n      nextGovernance,\n      snapshot.usedLifecycleLedger,\n      snapshot.sourceLifecycleLedgerEventCount,\n    );\n    backupPath = await backupExistingProjection(options.memoryDir, outputPath, now);\n    backupPath = await commitPreparedFileAtomically(tempPath, outputPath, backupPath);\n  }\n\n  return {\n    dryRun,\n    scannedMemories: snapshot.allMemories.length,\n    currentRows: snapshot.scopedCurrentRows.length,\n    timelineRows: snapshot.scopedTimelineRows.length,\n    entityMentionRows: snapshot.scopedEntityMentionRows.length,\n    nativeKnowledgeRows: snapshot.nativeKnowledgeRows.length,\n    reviewQueueRows: snapshot.governance?.reviewQueueRows.length ?? 0,\n    outputPath,\n    backupPath,\n    usedLifecycleLedger: snapshot.usedLifecycleLedger,\n    skippedDuplicateMemories: snapshot.skippedDuplicateMemories,\n    skippedBlankIdMemories: snapshot.skippedBlankIdMemories,\n    skippedDuplicateTimelineEvents: snapshot.skippedDuplicateTimelineEvents,\n    skippedBlankIdTimelineEvents: snapshot.skippedBlankIdTimelineEvents,\n    scope: snapshot.scope,\n  };\n}\n\nexport async function verifyMemoryProjection(\n  options: VerifyMemoryProjectionOptions,\n): Promise<VerifyMemoryProjectionResult> {\n  const outputPath = getMemoryProjectionPath(options.memoryDir);\n  const snapshot = await loadAuthoritativeProjectionSnapshot(options);\n  const projectedCurrent = readProjectedCurrentRows(options.memoryDir);\n  const projectedTimeline = readProjectedTimelineRows(options.memoryDir);\n  const projectedEntityMentions = readProjectedEntityMentionRows(options.memoryDir);\n  const projectedNativeKnowledge = readProjectedNativeKnowledgeRows(options.memoryDir);\n  const projectedGovernance = readProjectedGovernanceRows(options.memoryDir);\n  const projectionExists = projectedCurrent.projectionExists\n    || projectedTimeline.projectionExists\n    || projectedEntityMentions.projectionExists\n    || projectedNativeKnowledge.projectionExists\n    || projectedGovernance.projectionExists;\n\n  const actualScopedCurrentRows = filterCurrentStateRowsForProjectionScope(projectedCurrent.rows, snapshot.scope);\n  const expectedCurrentById = new Map(\n    snapshot.scopedCurrentRows.map((row) => [row.memoryId, serializeCurrentStateRow(row)]),\n  );\n  const actualCurrentById = new Map(\n    actualScopedCurrentRows.map((row) => [row.memoryId, serializeCurrentStateRow(row)]),\n  );\n\n  const missingCurrentMemoryIds = [...expectedCurrentById.keys()]\n    .filter((memoryId) => !actualCurrentById.has(memoryId))\n    .sort();\n  const extraCurrentMemoryIds = [...actualCurrentById.keys()]\n    .filter((memoryId) => !expectedCurrentById.has(memoryId))\n    .sort();\n  const mismatchedCurrentMemoryIds = [...expectedCurrentById.keys()]\n    .filter((memoryId) =>\n      actualCurrentById.has(memoryId) && actualCurrentById.get(memoryId) !== expectedCurrentById.get(memoryId)\n    )\n    .sort();\n\n  const selectedMemoryIds = new Set([\n    ...snapshot.scopedCurrentRows.map((row) => row.memoryId),\n    ...actualScopedCurrentRows.map((row) => row.memoryId),\n  ]);\n  const expectedTimelineById = new Map(\n    snapshot.scopedTimelineRows.map((event) => [event.eventId, serializeTimelineEvent(event)]),\n  );\n  const actualTimelineRows = projectedTimeline.rows.filter((event) => selectedMemoryIds.has(event.memoryId));\n  const actualTimelineById = new Map(\n    actualTimelineRows.map((event) => [event.eventId, serializeTimelineEvent(event)]),\n  );\n  const missingTimelineEventIds = [...expectedTimelineById.keys()]\n    .filter((eventId) => !actualTimelineById.has(eventId))\n    .sort();\n  const extraTimelineEventIds = [...actualTimelineById.keys()]\n    .filter((eventId) => !expectedTimelineById.has(eventId))\n    .sort();\n\n  const expectedEntityMentionsByKey = new Map(\n    snapshot.scopedEntityMentionRows.map((row) => [\n      `${row.memoryId}::${row.entityRef}::${row.mentionSource}`,\n      serializeEntityMentionRow(row),\n    ]),\n  );\n  const actualScopedEntityMentionRows = projectedEntityMentions.rows.filter((row) => selectedMemoryIds.has(row.memoryId));\n  const actualEntityMentionsByKey = new Map(\n    actualScopedEntityMentionRows.map((row) => [\n      `${row.memoryId}::${row.entityRef}::${row.mentionSource}`,\n      serializeEntityMentionRow(row),\n    ]),\n  );\n  const missingEntityMentionKeys = [...expectedEntityMentionsByKey.keys()]\n    .filter((key) => !actualEntityMentionsByKey.has(key))\n    .sort();\n  const extraEntityMentionKeys = [...actualEntityMentionsByKey.keys()]\n    .filter((key) => !expectedEntityMentionsByKey.has(key))\n    .sort();\n  const mismatchedEntityMentionKeys = [...expectedEntityMentionsByKey.keys()]\n    .filter((key) =>\n      actualEntityMentionsByKey.has(key) && actualEntityMentionsByKey.get(key) !== expectedEntityMentionsByKey.get(key)\n    )\n    .sort();\n\n  const expectedNativeKnowledgeById = new Map(\n    snapshot.nativeKnowledgeRows.map((row) => [row.chunkId, serializeNativeKnowledgeRow(row)]),\n  );\n  const actualNativeKnowledgeById = new Map(\n    projectedNativeKnowledge.rows.map((row) => [row.chunkId, serializeNativeKnowledgeRow(row)]),\n  );\n  const missingNativeKnowledgeChunkIds = [...expectedNativeKnowledgeById.keys()]\n    .filter((chunkId) => !actualNativeKnowledgeById.has(chunkId))\n    .sort();\n  const extraNativeKnowledgeChunkIds = [...actualNativeKnowledgeById.keys()]\n    .filter((chunkId) => !expectedNativeKnowledgeById.has(chunkId))\n    .sort();\n  const mismatchedNativeKnowledgeChunkIds = [...expectedNativeKnowledgeById.keys()]\n    .filter((chunkId) =>\n      actualNativeKnowledgeById.has(chunkId) && actualNativeKnowledgeById.get(chunkId) !== expectedNativeKnowledgeById.get(chunkId)\n    )\n    .sort();\n\n  const expectedReviewQueueById = new Map(\n    (snapshot.governance?.reviewQueueRows ?? []).map((row) => [\n      `${row.runId}::${row.entryId}`,\n      serializeGovernanceReviewQueueRow(row),\n    ]),\n  );\n  const actualReviewQueueById = new Map(\n    projectedGovernance.reviewQueueRows.map((row) => [\n      `${row.runId}::${row.entryId}`,\n      serializeGovernanceReviewQueueRow(row),\n    ]),\n  );\n  const missingReviewQueueEntryIds = [...expectedReviewQueueById.keys()]\n    .filter((entryId) => !actualReviewQueueById.has(entryId))\n    .sort();\n  const extraReviewQueueEntryIds = [...actualReviewQueueById.keys()]\n    .filter((entryId) => !expectedReviewQueueById.has(entryId))\n    .sort();\n  const mismatchedReviewQueueEntryIds = [...expectedReviewQueueById.keys()]\n    .filter((entryId) =>\n      actualReviewQueueById.has(entryId) && actualReviewQueueById.get(entryId) !== expectedReviewQueueById.get(entryId)\n    )\n    .sort();\n\n  return {\n    outputPath,\n    projectionExists,\n    ok:\n      projectionExists &&\n      missingCurrentMemoryIds.length === 0 &&\n      extraCurrentMemoryIds.length === 0 &&\n      mismatchedCurrentMemoryIds.length === 0 &&\n      missingTimelineEventIds.length === 0 &&\n      extraTimelineEventIds.length === 0 &&\n      missingEntityMentionKeys.length === 0 &&\n      extraEntityMentionKeys.length === 0 &&\n      mismatchedEntityMentionKeys.length === 0 &&\n      missingNativeKnowledgeChunkIds.length === 0 &&\n      extraNativeKnowledgeChunkIds.length === 0 &&\n      mismatchedNativeKnowledgeChunkIds.length === 0 &&\n      missingReviewQueueEntryIds.length === 0 &&\n      extraReviewQueueEntryIds.length === 0 &&\n      mismatchedReviewQueueEntryIds.length === 0,\n    expectedCurrentRows: snapshot.scopedCurrentRows.length,\n    actualCurrentRows: actualScopedCurrentRows.length,\n    expectedTimelineRows: snapshot.scopedTimelineRows.length,\n    actualTimelineRows: actualTimelineRows.length,\n    expectedEntityMentionRows: snapshot.scopedEntityMentionRows.length,\n    actualEntityMentionRows: actualScopedEntityMentionRows.length,\n    expectedNativeKnowledgeRows: snapshot.nativeKnowledgeRows.length,\n    actualNativeKnowledgeRows: projectedNativeKnowledge.rows.length,\n    expectedReviewQueueRows: snapshot.governance?.reviewQueueRows.length ?? 0,\n    actualReviewQueueRows: projectedGovernance.reviewQueueRows.length,\n    missingCurrentMemoryIds,\n    extraCurrentMemoryIds,\n    mismatchedCurrentMemoryIds,\n    missingTimelineEventIds,\n    extraTimelineEventIds,\n    missingEntityMentionKeys,\n    extraEntityMentionKeys,\n    mismatchedEntityMentionKeys,\n    missingNativeKnowledgeChunkIds,\n    extraNativeKnowledgeChunkIds,\n    mismatchedNativeKnowledgeChunkIds,\n    missingReviewQueueEntryIds,\n    extraReviewQueueEntryIds,\n    mismatchedReviewQueueEntryIds,\n    usedLifecycleLedger: snapshot.usedLifecycleLedger,\n    scope: snapshot.scope,\n  };\n}\n\nexport async function repairMemoryProjection(\n  options: RepairMemoryProjectionOptions,\n): Promise<RepairMemoryProjectionResult> {\n  const dryRun = options.dryRun !== false;\n  const verify = await verifyMemoryProjection(options);\n  if (verify.ok) {\n    return {\n      dryRun,\n      repaired: false,\n      verify,\n    };\n  }\n  if (dryRun) {\n    return {\n      dryRun: true,\n      repaired: false,\n      verify,\n    };\n  }\n\n  const rebuild = await rebuildMemoryProjection({\n    ...options,\n    dryRun: false,\n  });\n  const verified = await verifyMemoryProjection(options);\n  return {\n    dryRun: false,\n    repaired: verified.ok,\n    verify: verified,\n    rebuild,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,IAAI,YAAY;AAuJhC,SAAS,YAAY,KAA4C;AAC/D,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU;AAC9D;AAEA,eAAsB,yBACpB,WACA,YACA,KAC6B;AAC7B,MAAI;AACF,UAAM,KAAK,UAAU;AAAA,EACvB,SAAS,KAAK;AACZ,QAAI,YAAY,GAAG,KAAK,IAAI,SAAS,UAAU;AAC7C,aAAO;AAAA,IACT;AACA,UAAM;AAAA,EACR;AAEA,QAAM,aAAa,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,GAAG;AAAA,IACjB;AAAA,IACA;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,SAAiB,QAAkC;AAC/E,SAAO,kBAAkB,OAAO,aAAa,OAAO;AACtD;AAEA,SAAS,kBAAkB,WAAmB,QAAkD;AAC9F,QAAM,UAAU,gBAAgB,WAAW,OAAO,IAAI;AACtD,SAAO;AAAA,IACL,UAAU,OAAO,YAAY;AAAA,IAC7B,UAAU,OAAO,YAAY;AAAA,IAC7B,QAAQ,qBAAqB,SAAS,MAAM;AAAA,IAC5C,gBAAgB,OAAO,YAAY;AAAA,IACnC,MAAM,OAAO;AAAA,IACb;AAAA,IACA,SAAS,OAAO,YAAY;AAAA,IAC5B,SAAS,OAAO,YAAY;AAAA,IAC5B,YAAY,OAAO,YAAY;AAAA,IAC/B,cAAc,OAAO,YAAY;AAAA,IACjC,WAAW,OAAO,YAAY;AAAA,IAC9B,QAAQ,OAAO,YAAY;AAAA,IAC3B,YAAY,OAAO,YAAY;AAAA,IAC/B,gBAAgB,OAAO,YAAY;AAAA,IACnC,YAAY,OAAO,YAAY;AAAA,IAC/B,aAAa,OAAO,YAAY;AAAA,IAChC,cAAc,OAAO,YAAY;AAAA,IACjC,MAAM,wBAAwB,OAAO,YAAY,IAAI;AAAA,IACrD,SAAS,2BAA2B,OAAO,OAAO;AAAA,IAClD,eAAe,+BAA+B,MAAM;AAAA,EACtD;AACF;AAEA,SAAS,uBACP,aAC6B;AAC7B,SAAO,YAAY,QAAQ,CAAC,QAAQ;AAClC,UAAM,WAAwC,CAAC;AAC/C,QAAI,IAAI,WAAW;AACjB,eAAS,KAAK;AAAA,QACZ,UAAU,IAAI;AAAA,QACd,WAAW,IAAI;AAAA,QACf,eAAe;AAAA,QACf,SAAS,IAAI;AAAA,QACb,SAAS,IAAI;AAAA,MACf,CAAC;AAAA,IACH;AACA,eAAW,OAAO,IAAI,QAAQ,CAAC,GAAG;AAChC,UAAI,CAAC,IAAI,SAAS,GAAG,EAAG;AACxB,eAAS,KAAK;AAAA,QACZ,UAAU,IAAI;AAAA,QACd,WAAW;AAAA,QACX,eAAe;AAAA,QACf,SAAS,IAAI;AAAA,QACb,SAAS,IAAI;AAAA,MACf,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,4BAA4B,QAM1B;AACT,SAAO;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,EACT,EAAE,KAAK,IAAI;AACb;AAEA,eAAe,+BAA+B,WAOpC;AACR,QAAM,SAAS,MAAM,yBAAyB,SAAS,GAAG,CAAC;AAC3D,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI;AACF,UAAM,WAAW,MAAM,gCAAgC,WAAW,KAAK;AACvE,WAAO;AAAA,MACL;AAAA,MACA,SAAS,SAAS;AAAA,MAClB,SAAS,SAAS;AAAA,MAClB,iBAAiB,SAAS,YAAY,IAAI,CAAC,WAAW;AAAA,QACpD;AAAA,QACA,SAAS,MAAM;AAAA,QACf,UAAU,MAAM;AAAA,QAChB,MAAM,MAAM;AAAA,QACZ,YAAY,MAAM;AAAA,QAClB,UAAU,MAAM;AAAA,QAChB,iBAAiB,MAAM;AAAA,QACvB,iBAAiB,MAAM;AAAA,QACvB,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,MAC9C,EAAE;AAAA,MACF,mBAAmB,SAAS,eAAe,IAAI,CAAC,YAAY;AAAA,QAC1D;AAAA,QACA,QAAQ,4BAA4B,MAAM;AAAA,QAC1C,QAAQ,OAAO;AAAA,QACf,UAAU,OAAO;AAAA,QACjB,YAAY,OAAO;AAAA,QACnB,cAAc,OAAO;AAAA,QACrB,aAAa,OAAO;AAAA,QACpB,cAAc,OAAO;AAAA,QACrB,aAAa,OAAO;AAAA,MACtB,EAAE;AAAA,MACF,QAAQ,SAAS;AAAA,IACnB;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,mBACP,UACA,iBACkE;AAClE,MAAI,gBAAgB,SAAS,GAAG;AAC9B,WAAO;AAAA,MACL,QAAQ,0BAA0B,eAAe;AAAA,MACjD,qBAAqB;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,0BAA0B,SAAS,QAAQ,CAAC,WAAW,8BAA8B,MAAM,CAAC,CAAC;AAAA,IACrG,qBAAqB;AAAA,EACvB;AACF;AAEA,SAAS,mBAAmB,OAA0C;AACpE,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,SAAS,IAAI,KAAK,OAAO;AAC/B,MAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,GAAG;AAClC,UAAM,IAAI,MAAM,uCAAuC,KAAK,EAAE;AAAA,EAChE;AACA,SAAO,OAAO,YAAY;AAC5B;AAEA,SAAS,yBAAyB,SAMhC;AACA,QAAM,eAAe,mBAAmB,QAAQ,YAAY;AAC5D,QAAM,gBAAgB,mBAAmB,QAAQ,aAAa;AAC9D,MACE,gBACA,iBACA,IAAI,KAAK,YAAY,EAAE,QAAQ,IAAI,IAAI,KAAK,aAAa,EAAE,QAAQ,GACnE;AACA,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,0BAA0B,OAGvB;AACV,SAAO,MAAM,iBAAiB,QAAQ,MAAM,kBAAkB;AAChE;AAEA,SAAS,qBAAqB,QAA4B;AACxD,QAAM,YAAY,OAAO,YAAY,WAAW,OAAO,YAAY;AACnE,SAAO;AACT;AAEA,SAAS,6BACP,WACA,OACS;AACT,MAAI,CAAC,MAAM,gBAAgB,CAAC,MAAM,cAAe,QAAO;AACxD,QAAM,SAAS,IAAI,KAAK,SAAS;AACjC,MAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,EAAG,QAAO;AAC3C,MAAI,MAAM,gBAAgB,OAAO,QAAQ,IAAI,IAAI,KAAK,MAAM,YAAY,EAAE,QAAQ,EAAG,QAAO;AAC5F,MAAI,MAAM,iBAAiB,OAAO,QAAQ,KAAK,IAAI,KAAK,MAAM,aAAa,EAAE,QAAQ,EAAG,QAAO;AAC/F,SAAO;AACT;AAEA,SAAS,iCACP,UACA,OACc;AACd,MAAI,CAAC,MAAM,gBAAgB,CAAC,MAAM,cAAe,QAAO;AACxD,SAAO,SAAS,OAAO,CAAC,WAAW,6BAA6B,qBAAqB,MAAM,GAAG,KAAK,CAAC;AACtG;AAEA,SAAS,yCACP,MACA,OACgC;AAChC,MAAI,CAAC,MAAM,gBAAgB,CAAC,MAAM,cAAe,QAAO;AACxD,SAAO,KAAK,OAAO,CAAC,QAAQ,6BAA6B,IAAI,WAAW,IAAI,SAAS,KAAK,CAAC;AAC7F;AAEA,SAAS,yBAAyB,KAA2C;AAC3E,SAAO,KAAK,UAAU;AAAA,IACpB,UAAU,IAAI;AAAA,IACd,UAAU,IAAI;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,gBAAgB,IAAI,kBAAkB;AAAA,IACtC,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,YAAY,IAAI,cAAc;AAAA,IAC9B,cAAc,IAAI,gBAAgB;AAAA,IAClC,WAAW,IAAI,aAAa;AAAA,IAC5B,QAAQ,IAAI;AAAA,IACZ,YAAY,IAAI;AAAA,IAChB,gBAAgB,IAAI;AAAA,IACpB,YAAY,IAAI,cAAc;AAAA,IAC9B,aAAa,IAAI,eAAe;AAAA,IAChC,cAAc,IAAI,gBAAgB;AAAA,IAClC,MAAM,IAAI,QAAQ,CAAC;AAAA,IACnB,SAAS,IAAI,WAAW;AAAA,IACxB,eAAe,IAAI,kBAAkB;AAAA,EACvC,CAAC;AACH;AAEA,SAAS,uBAAuB,OAAqC;AACnE,SAAO,KAAK,UAAU;AAAA,IACpB,SAAS,MAAM;AAAA,IACf,UAAU,MAAM;AAAA,IAChB,WAAW,MAAM;AAAA,IACjB,WAAW,MAAM;AAAA,IACjB,OAAO,MAAM;AAAA,IACb,YAAY,MAAM,cAAc;AAAA,IAChC,aAAa,MAAM;AAAA,IACnB,kBAAkB,MAAM,oBAAoB,CAAC;AAAA,IAC7C,QAAQ,MAAM,UAAU;AAAA,IACxB,OAAO,MAAM,SAAS;AAAA,IACtB,eAAe,MAAM,iBAAiB;AAAA,EACxC,CAAC;AACH;AAEA,SAAS,0BAA0B,KAAwC;AACzE,SAAO,KAAK,UAAU,GAAG;AAC3B;AAEA,SAAS,4BAA4B,KAA+C;AAClF,SAAO,KAAK,UAAU;AAAA,IACpB,SAAS,IAAI;AAAA,IACb,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,OAAO,IAAI;AAAA,IACX,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,WAAW,IAAI,aAAa;AAAA,IAC5B,cAAc,IAAI,gBAAgB;AAAA,IAClC,aAAa,IAAI,eAAe;AAAA,IAChC,YAAY,IAAI,cAAc;AAAA,IAC9B,aAAa,IAAI,eAAe;AAAA,IAChC,QAAQ,IAAI,UAAU;AAAA,IACtB,OAAO,IAAI,SAAS;AAAA,IACpB,YAAY,IAAI,cAAc;AAAA,IAC9B,SAAS,IAAI;AAAA,EACf,CAAC;AACH;AAEA,SAAS,kCACP,KACQ;AACR,SAAO,KAAK,UAAU;AAAA,IACpB,OAAO,IAAI;AAAA,IACX,SAAS,IAAI;AAAA,IACb,UAAU,IAAI;AAAA,IACd,MAAM,IAAI;AAAA,IACV,YAAY,IAAI;AAAA,IAChB,UAAU,IAAI;AAAA,IACd,iBAAiB,IAAI;AAAA,IACrB,iBAAiB,IAAI,mBAAmB;AAAA,IACxC,kBAAkB,IAAI;AAAA,EACxB,CAAC;AACH;AAEA,SAAS,yBACP,OAMA;AACA,QAAM,cAAc,MAAM,KAAK;AAC/B,QAAM,WAAyB,CAAC;AAChC,QAAM,WAAW,oBAAI,IAAwB;AAC7C,QAAM,2BAAqD,CAAC;AAC5D,QAAM,yBAAiD,CAAC;AAIxD,aAAW,QAAQ,OAAO;AACxB,eAAW,UAAU,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC,GAAG;AACzF,YAAM,WAAW,OAAO,YAAY,GAAG,KAAK;AAC5C,UAAI,CAAC,UAAU;AACb,+BAAuB,KAAK,EAAE,MAAM,OAAO,KAAK,CAAC;AACjD,YAAI,KAAK,oDAAoD,OAAO,IAAI,EAAE;AAC1E;AAAA,MACF;AACA,YAAM,OAAO,SAAS,IAAI,QAAQ;AAClC,UAAI,MAAM;AACR,iCAAyB,KAAK;AAAA,UAC5B;AAAA,UACA,UAAU,KAAK;AAAA,UACf,aAAa,OAAO;AAAA,QACtB,CAAC;AACD,YAAI;AAAA,UACF,kDAAkD,QAAQ,UAAU,KAAK,IAAI,YAAY,OAAO,IAAI;AAAA,QACtG;AACA;AAAA,MACF;AACA,eAAS,IAAI,UAAU,MAAM;AAC7B,eAAS,KAAK,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,SAAO,EAAE,aAAa,UAAU,0BAA0B,uBAAuB;AACnF;AAEA,SAAS,0BACP,QACA,eAKA;AACA,QAAM,WAAW,oBAAI,IAA2D;AAChF,QAAM,SAAiC,CAAC;AACxC,QAAM,UAA2C,CAAC;AAClD,QAAM,kBAAiD,CAAC;AACxD,aAAW,SAAS,0BAA0B,MAAM,GAAG;AACrD,UAAM,aAAa,cAAc,KAAK;AACtC,QAAI,CAAC,MAAM,SAAS,KAAK,GAAG;AAC1B,sBAAgB,KAAK,EAAE,SAAS,MAAM,SAAS,MAAM,WAAW,CAAC;AACjE,UAAI;AAAA,QACF,4EACc,MAAM,OAAO,SAAS,UAAU;AAAA,MAChD;AACA;AAAA,IACF;AACA,UAAM,OAAO,SAAS,IAAI,MAAM,OAAO;AACvC,QAAI,MAAM;AACR,cAAQ,KAAK;AAAA,QACX,SAAS,MAAM;AAAA,QACf,UAAU,KAAK;AAAA,QACf,aAAa;AAAA,MACf,CAAC;AACD,UAAI;AAAA,QACF,0DAA0D,MAAM,OAAO,UAC7D,KAAK,IAAI,YAAY,UAAU;AAAA,MAC3C;AACA;AAAA,IACF;AACA,aAAS,IAAI,MAAM,SAAS,EAAE,OAAO,MAAM,WAAW,CAAC;AACvD,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO,EAAE,QAAQ,QAAQ,SAAS,gBAAgB;AACpD;AAEA,eAAe,oCAAoC,SAmChD;AACD,QAAM,UAAU,4BAA4B,2BAA2B,QAAQ,WAAW,QAAQ,OAAO,KAAK,IAAI,eAAe,QAAQ,SAAS;AAGlJ,UAAQ,iCAAiC;AACzC,QAAM,WAAW,yBAAyB;AAAA,IACxC,MAAM,QAAQ,gBAAgB;AAAA,IAC9B,MAAM,QAAQ,oBAAoB;AAAA,IAClC,MAAM,QAAQ,qBAAqB;AAAA,EACrC,CAAC;AACD,QAAM,cAAc,SAAS;AAC7B,QAAM,qBAAqB,SAAS;AACpC,QAAM,kBAAkB,MAAM,QAAQ,6BAA6B;AACnE,QAAM,WAAW,mBAAmB,oBAAoB,eAAe;AACvE,QAAM,sBAAsB,KAAK;AAAA,IAC/B,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,EACF;AACA,QAAM,iBAAiB,IAAI;AAAA,IACzB,mBAAmB,IAAI,CAAC,WAAW,CAAC,OAAO,YAAY,IAAI,OAAO,IAAI,CAAC;AAAA,EACzE;AACA,QAAM,uBAAuB;AAAA,IAC3B,SAAS;AAAA,IACT,CAAC,UAAU,SAAS,sBAChB,sBACA,eAAe,IAAI,MAAM,QAAQ,KAAK;AAAA,EAC5C;AACA,QAAM,SAAS,qBAAqB;AACpC,QAAM,sBAAsB,SAAS;AACrC,QAAM,kCAAkC,IAAI;AAAA,IAC1C,gBAAgB,IAAI,sCAAsC;AAAA,EAC5D,EAAE;AACF,QAAM,cAAc,mBAAmB,IAAI,CAAC,WAAW,kBAAkB,QAAQ,WAAW,MAAM,CAAC;AACnG,QAAM,QAAQ,yBAAyB,OAAO;AAC9C,QAAM,iBAAiB,iCAAiC,oBAAoB,KAAK;AACjF,QAAM,kBAAkB,IAAI,IAAI,eAAe,IAAI,CAAC,WAAW,OAAO,YAAY,EAAE,CAAC;AACrF,QAAM,sBAAsB,MAAM,mCAAmC;AAAA,IACnE,WAAW,QAAQ;AAAA,IACnB,kBAAkB,QAAQ,oBAAoB;AAAA,EAChD,CAAC,EAAE,KAAK,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS;AAAA,IACnC,SAAS,IAAI;AAAA,IACb,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,OAAO,IAAI;AAAA,IACX,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,WAAW,IAAI,aAAa,QAAQ,oBAAoB;AAAA,IACxD,cAAc,IAAI;AAAA,IAClB,aAAa,IAAI;AAAA,IACjB,YAAY,IAAI;AAAA,IAChB,aAAa,IAAI;AAAA,IACjB,QAAQ,IAAI;AAAA,IACZ,OAAO,IAAI;AAAA,IACX,YAAY,IAAI;AAAA,IAChB,SAAS,2BAA2B,IAAI,OAAO;AAAA,EACjD,EAAE,CAAC;AACH,QAAM,aAAa,MAAM,+BAA+B,QAAQ,SAAS;AACzE,QAAM,oBAAoB,uBAAuB,WAAW;AAE5D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,mBAAmB,YAAY,OAAO,CAAC,QAAQ,gBAAgB,IAAI,IAAI,QAAQ,CAAC;AAAA,IAChF,oBAAoB,OAAO,OAAO,CAAC,UAAU,gBAAgB,IAAI,MAAM,QAAQ,CAAC;AAAA,IAChF;AAAA,IACA,yBAAyB,kBAAkB,OAAO,CAAC,QAAQ,gBAAgB,IAAI,IAAI,QAAQ,CAAC;AAAA,IAC5F;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,0BAA0B,SAAS;AAAA,IACnC,wBAAwB,SAAS;AAAA,IACjC,gCAAgC,qBAAqB;AAAA,IACrD,8BAA8B,qBAAqB;AAAA,EACrD;AACF;AAEA,SAAS,yBACP,WACqE;AACrE,QAAM,SAAS,wBAAwB,SAAS;AAChD,MAAI;AACF,UAAM,KAAK,kBAAkB,QAAQ,EAAE,UAAU,MAAM,eAAe,KAAK,CAAC;AAC5E,QAAI;AACF,YAAM,oBAAoB,+BAA+B,EAAE;AAC3D,YAAM,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAkBlB,kBAAkB,QAAQ,KAAK,kBAAkB,WAAW,KAAK,kBAAkB,aAAa;AAAA;AAAA,OAErG,EAAE,IAAI;AAEP,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,MAAM,KACH,IAAI,CAAC,QAAQ,gBAAgB,WAAW,GAAG,CAAC,EAC5C,OAAO,CAAC,QAA6C,QAAQ,IAAI;AAAA,MACtE;AAAA,IACF,UAAE;AACA,SAAG,MAAM;AAAA,IACX;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,kBAAkB,OAAO,MAAM,CAAC,EAAE;AAAA,EAC7C;AACF;AAEA,SAAS,0BACP,WAC6D;AAC7D,QAAM,SAAS,wBAAwB,SAAS;AAChD,MAAI;AACF,UAAM,KAAK,kBAAkB,QAAQ,EAAE,UAAU,MAAM,eAAe,KAAK,CAAC;AAC5E,QAAI;AACF,YAAM,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAcvB,EAAE,IAAI;AAEP,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,MAAM,kBAAkB,IAAI;AAAA,MAC9B;AAAA,IACF,UAAE;AACA,SAAG,MAAM;AAAA,IACX;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,kBAAkB,OAAO,MAAM,CAAC,EAAE;AAAA,EAC7C;AACF;AAGA,SAAS,kBACP,QACA,QACA,aACA,cACA,mBACA,qBACA,YACA,qBACA,iCACM;AACN,QAAM,KAAK,kBAAkB,MAAM;AACnC,QAAM,YAAY,KAAK,QAAQ,KAAK,QAAQ,MAAM,CAAC;AACnD,MAAI;AACF,iCAA6B,EAAE;AAE/B,UAAM,aAAa,GAAG,QAAQ,uDAAuD;AACrF,eAAW,IAAI,iBAAiB,OAAO,gCAAgC,CAAC;AACxE,eAAW,IAAI,aAAa,MAAM;AAClC,eAAW,IAAI,uBAAuB,sBAAsB,SAAS,OAAO;AAC5E,iCAA6B,YAAY,iCAAiC,YAAY;AACtF,eAAW,IAAI,yBAAyB,YAAY,SAAS,EAAE;AAE/D,UAAM,gBAAgB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAqBhC;AAED,UAAM,iBAAiB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAejC;AAED,UAAM,sBAAsB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAQtC;AAED,UAAM,wBAAwB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAkBxC;AAED,UAAM,8BAA8B,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAY9C;AAED,UAAM,gCAAgC,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAYhD;AAED,UAAM,sBAAsB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAUtC;AAED,UAAM,UAAU,GAAG,YAAY,MAAM;AACnC,iBAAW,OAAO,aAAa;AAC7B,sBAAc;AAAA,UACZ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,kBAAkB;AAAA,UACtB,IAAI;AAAA,UACJ,2BAA2B,WAAW,IAAI,OAAO,IAAI,IAAI;AAAA,UACzD,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,cAAc;AAAA,UAClB,IAAI,gBAAgB;AAAA,UACpB,IAAI,aAAa;AAAA,UACjB,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,cAAc;AAAA,UAClB,IAAI,eAAe;AAAA,UACnB,IAAI,gBAAgB;AAAA,UAAM,KAAK,UAAU,IAAI,QAAQ,CAAC,CAAC;AAAA,UAAG,IAAI,WAAW;AAAA,UACzE,IAAI,kBAAkB,OAAO,IAAI;AAAA,QACnC;AAAA,MACF;AAEA,iBAAW,SAAS,cAAc;AAChC,uBAAe;AAAA,UACb,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,kCAAkC,MAAM,SAAS;AAAA,UACjD,MAAM;AAAA,UACN,MAAM,cAAc;AAAA,UACpB,MAAM;AAAA,UACN,KAAK,UAAU,MAAM,oBAAoB,CAAC,CAAC;AAAA,UAC3C,MAAM,SAAS,KAAK,UAAU,MAAM,MAAM,IAAI;AAAA,UAC9C,MAAM,QAAQ,KAAK,UAAU,MAAM,KAAK,IAAI;AAAA,UAC5C,MAAM,iBAAiB;AAAA,QACzB;AAAA,MACF;AAEA,iBAAW,OAAO,mBAAmB;AACnC,4BAAoB;AAAA,UAClB,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,QACN;AAAA,MACF;AAEA,iBAAW,OAAO,qBAAqB;AACrC,8BAAsB;AAAA,UACpB,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,aAAa;AAAA,UACjB,IAAI,gBAAgB;AAAA,UACpB,IAAI,eAAe;AAAA,UACnB,IAAI,cAAc;AAAA,UAClB,IAAI,eAAe;AAAA,UACnB,IAAI,UAAU;AAAA,UACd,IAAI,SAAS;AAAA,UACb,IAAI,cAAc;AAAA,UAClB,IAAI;AAAA,QACN;AAAA,MACF;AAEA,iBAAW,OAAO,YAAY,mBAAmB,CAAC,GAAG;AACnD,oCAA4B;AAAA,UAC1B,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,mBAAmB;AAAA,UACvB,KAAK,UAAU,IAAI,gBAAgB;AAAA,QACrC;AAAA,MACF;AAEA,iBAAW,OAAO,YAAY,qBAAqB,CAAC,GAAG;AACrD,sCAA8B;AAAA,UAC5B,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,eAAe;AAAA,UACnB,IAAI;AAAA,UACJ,IAAI;AAAA,QACN;AAAA,MACF;AAEA,UAAI,YAAY;AACd,cAAM,YACJ,OAAQ,WAAW,SAAiD,cAAc,WAC7E,WAAW,QAAkC,YAC9C;AACN,cAAM,OACJ,OAAQ,WAAW,SAA4C,SAAS,WACnE,WAAW,QAA6B,OACzC;AACN,4BAAoB;AAAA,UAClB,WAAW;AAAA,UACX;AAAA,UACA;AAAA,UACA,KAAK,UAAU,WAAW,WAAW,IAAI;AAAA,UACzC,KAAK,UAAU,WAAW,WAAW,IAAI;AAAA,UACzC,KAAK;AAAA,aACF,WAAW,qBAAqB,CAAC,GAAG,IAAI,CAAC,SAAS;AAAA,cACjD,QAAQ,IAAI;AAAA,cACZ,UAAU,IAAI;AAAA,cACd,YAAY,IAAI;AAAA,cAChB,cAAc,IAAI;AAAA,cAClB,aAAa,IAAI;AAAA,cACjB,cAAc,IAAI;AAAA,cAClB,aAAa,IAAI;AAAA,YACnB,EAAE;AAAA,UACJ;AAAA,UACA,WAAW;AAAA,QACb;AAAA,MACF;AAAA,IACF,CAAC;AAED,YAAQ;AAAA,EACV,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;AAEA,SAAS,uBACP,cACA,iBACA,iBACgC;AAChC,SAAO,CAAC,GAAG,aAAa,OAAO,CAAC,QAAQ,CAAC,gBAAgB,IAAI,IAAI,QAAQ,CAAC,GAAG,GAAG,eAAe,EAC5F,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,cAAc,EAAE,QAAQ,CAAC;AACxD;AAEA,SAAS,wBACP,cACA,iBACA,iBACwB;AACxB,SAAO,0BAA0B;AAAA,IAC/B,GAAG,aAAa,OAAO,CAAC,UAAU,CAAC,gBAAgB,IAAI,MAAM,QAAQ,CAAC;AAAA,IACtE,GAAG;AAAA,EACL,CAAC;AACH;AAEA,SAAS,6BACP,cACA,iBACA,iBAC6B;AAC7B,SAAO;AAAA,IACL,GAAG,aAAa,OAAO,CAAC,QAAQ,CAAC,gBAAgB,IAAI,IAAI,QAAQ,CAAC;AAAA,IAClE,GAAG;AAAA,EACL,EAAE;AAAA,IAAK,CAAC,MAAM,UACZ,CAAC,KAAK,WAAW,KAAK,UAAU,KAAK,aAAa,EAAE,KAAK,IAAI,EAAE;AAAA,MAC7D,CAAC,MAAM,WAAW,MAAM,UAAU,MAAM,aAAa,EAAE,KAAK,IAAI;AAAA,IAClE;AAAA,EACF;AACF;AAEA,eAAsB,wBACpB,SACwC;AACxC,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,aAAa,wBAAwB,QAAQ,SAAS;AAC5D,QAAM,WAAW,MAAM,oCAAoC,OAAO;AAElE,MAAI;AACJ,MAAI,CAAC,QAAQ;AACX,QAAI,kBAAkB,SAAS;AAC/B,QAAI,mBAAmB,SAAS;AAChC,QAAI,wBAAwB,SAAS;AACrC,QAAI,0BAA0B,SAAS;AACvC,QAAI,iBAAiB,SAAS;AAC9B,QAAI,0BAA0B,SAAS,KAAK,GAAG;AAC7C,wBAAkB,SAAS;AAC3B,yBAAmB,SAAS;AAC5B,8BAAwB,SAAS;AACjC,YAAM,mBAAmB,yBAAyB,QAAQ,SAAS;AACnE,YAAM,oBAAoB,0BAA0B,QAAQ,SAAS;AACrE,YAAM,0BAA0B,+BAA+B,QAAQ,SAAS;AAChF,YAAM,2BAA2B,iCAAiC,QAAQ,SAAS;AACnF,YAAM,sBAAsB,4BAA4B,QAAQ,SAAS;AACzE,UAAI,iBAAiB,oBAAoB,kBAAkB,kBAAkB;AAC3E,cAAM,0BAA0B;AAAA,UAC9B,iBAAiB;AAAA,UACjB,SAAS;AAAA,QACX;AACA,cAAM,kBAAkB,oBAAI,IAAI;AAAA,UAC9B,GAAG,SAAS,kBAAkB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,UACvD,GAAG,SAAS,mBAAmB,IAAI,CAAC,UAAU,MAAM,QAAQ;AAAA,UAC5D,GAAG,wBAAwB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,QACtD,CAAC;AACD,0BAAkB;AAAA,UAChB,iBAAiB;AAAA,UACjB,SAAS;AAAA,UACT;AAAA,QACF;AACA,2BAAmB;AAAA,UACjB,kBAAkB;AAAA,UAClB,SAAS;AAAA,UACT;AAAA,QACF;AACA,gCAAwB;AAAA,UACtB,wBAAwB;AAAA,UACxB,SAAS;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,yBAAyB,kBAAkB;AAI7C,kCAA0B,SAAS;AAAA,MACrC;AACA,UAAI,oBAAoB,oBAAoB,oBAAoB,OAAO;AAIrE,yBAAiB,SAAS;AAAA,MAC5B;AAAA,IACF;AAEA,UAAM,WAAW,GAAG,UAAU;AAC9B,UAAM,MAAM,KAAK,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AACzD,UAAM,GAAG,UAAU,EAAE,OAAO,KAAK,CAAC;AAClC;AAAA,MACE;AAAA,MACA,IAAI,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AACA,iBAAa,MAAM,yBAAyB,QAAQ,WAAW,YAAY,GAAG;AAC9E,iBAAa,MAAM,6BAA6B,UAAU,YAAY,UAAU;AAAA,EAClF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,iBAAiB,SAAS,YAAY;AAAA,IACtC,aAAa,SAAS,kBAAkB;AAAA,IACxC,cAAc,SAAS,mBAAmB;AAAA,IAC1C,mBAAmB,SAAS,wBAAwB;AAAA,IACpD,qBAAqB,SAAS,oBAAoB;AAAA,IAClD,iBAAiB,SAAS,YAAY,gBAAgB,UAAU;AAAA,IAChE;AAAA,IACA;AAAA,IACA,qBAAqB,SAAS;AAAA,IAC9B,0BAA0B,SAAS;AAAA,IACnC,wBAAwB,SAAS;AAAA,IACjC,gCAAgC,SAAS;AAAA,IACzC,8BAA8B,SAAS;AAAA,IACvC,OAAO,SAAS;AAAA,EAClB;AACF;AAEA,eAAsB,uBACpB,SACuC;AACvC,QAAM,aAAa,wBAAwB,QAAQ,SAAS;AAC5D,QAAM,WAAW,MAAM,oCAAoC,OAAO;AAClE,QAAM,mBAAmB,yBAAyB,QAAQ,SAAS;AACnE,QAAM,oBAAoB,0BAA0B,QAAQ,SAAS;AACrE,QAAM,0BAA0B,+BAA+B,QAAQ,SAAS;AAChF,QAAM,2BAA2B,iCAAiC,QAAQ,SAAS;AACnF,QAAM,sBAAsB,4BAA4B,QAAQ,SAAS;AACzE,QAAM,mBAAmB,iBAAiB,oBACrC,kBAAkB,oBAClB,wBAAwB,oBACxB,yBAAyB,oBACzB,oBAAoB;AAEzB,QAAM,0BAA0B,yCAAyC,iBAAiB,MAAM,SAAS,KAAK;AAC9G,QAAM,sBAAsB,IAAI;AAAA,IAC9B,SAAS,kBAAkB,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,yBAAyB,GAAG,CAAC,CAAC;AAAA,EACvF;AACA,QAAM,oBAAoB,IAAI;AAAA,IAC5B,wBAAwB,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,yBAAyB,GAAG,CAAC,CAAC;AAAA,EACpF;AAEA,QAAM,0BAA0B,CAAC,GAAG,oBAAoB,KAAK,CAAC,EAC3D,OAAO,CAAC,aAAa,CAAC,kBAAkB,IAAI,QAAQ,CAAC,EACrD,KAAK;AACR,QAAM,wBAAwB,CAAC,GAAG,kBAAkB,KAAK,CAAC,EACvD,OAAO,CAAC,aAAa,CAAC,oBAAoB,IAAI,QAAQ,CAAC,EACvD,KAAK;AACR,QAAM,6BAA6B,CAAC,GAAG,oBAAoB,KAAK,CAAC,EAC9D;AAAA,IAAO,CAAC,aACP,kBAAkB,IAAI,QAAQ,KAAK,kBAAkB,IAAI,QAAQ,MAAM,oBAAoB,IAAI,QAAQ;AAAA,EACzG,EACC,KAAK;AAER,QAAM,oBAAoB,oBAAI,IAAI;AAAA,IAChC,GAAG,SAAS,kBAAkB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,IACvD,GAAG,wBAAwB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,EACtD,CAAC;AACD,QAAM,uBAAuB,IAAI;AAAA,IAC/B,SAAS,mBAAmB,IAAI,CAAC,UAAU,CAAC,MAAM,SAAS,uBAAuB,KAAK,CAAC,CAAC;AAAA,EAC3F;AACA,QAAM,qBAAqB,kBAAkB,KAAK,OAAO,CAAC,UAAU,kBAAkB,IAAI,MAAM,QAAQ,CAAC;AACzG,QAAM,qBAAqB,IAAI;AAAA,IAC7B,mBAAmB,IAAI,CAAC,UAAU,CAAC,MAAM,SAAS,uBAAuB,KAAK,CAAC,CAAC;AAAA,EAClF;AACA,QAAM,0BAA0B,CAAC,GAAG,qBAAqB,KAAK,CAAC,EAC5D,OAAO,CAAC,YAAY,CAAC,mBAAmB,IAAI,OAAO,CAAC,EACpD,KAAK;AACR,QAAM,wBAAwB,CAAC,GAAG,mBAAmB,KAAK,CAAC,EACxD,OAAO,CAAC,YAAY,CAAC,qBAAqB,IAAI,OAAO,CAAC,EACtD,KAAK;AAER,QAAM,8BAA8B,IAAI;AAAA,IACtC,SAAS,wBAAwB,IAAI,CAAC,QAAQ;AAAA,MAC5C,GAAG,IAAI,QAAQ,KAAK,IAAI,SAAS,KAAK,IAAI,aAAa;AAAA,MACvD,0BAA0B,GAAG;AAAA,IAC/B,CAAC;AAAA,EACH;AACA,QAAM,gCAAgC,wBAAwB,KAAK,OAAO,CAAC,QAAQ,kBAAkB,IAAI,IAAI,QAAQ,CAAC;AACtH,QAAM,4BAA4B,IAAI;AAAA,IACpC,8BAA8B,IAAI,CAAC,QAAQ;AAAA,MACzC,GAAG,IAAI,QAAQ,KAAK,IAAI,SAAS,KAAK,IAAI,aAAa;AAAA,MACvD,0BAA0B,GAAG;AAAA,IAC/B,CAAC;AAAA,EACH;AACA,QAAM,2BAA2B,CAAC,GAAG,4BAA4B,KAAK,CAAC,EACpE,OAAO,CAAC,QAAQ,CAAC,0BAA0B,IAAI,GAAG,CAAC,EACnD,KAAK;AACR,QAAM,yBAAyB,CAAC,GAAG,0BAA0B,KAAK,CAAC,EAChE,OAAO,CAAC,QAAQ,CAAC,4BAA4B,IAAI,GAAG,CAAC,EACrD,KAAK;AACR,QAAM,8BAA8B,CAAC,GAAG,4BAA4B,KAAK,CAAC,EACvE;AAAA,IAAO,CAAC,QACP,0BAA0B,IAAI,GAAG,KAAK,0BAA0B,IAAI,GAAG,MAAM,4BAA4B,IAAI,GAAG;AAAA,EAClH,EACC,KAAK;AAER,QAAM,8BAA8B,IAAI;AAAA,IACtC,SAAS,oBAAoB,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,4BAA4B,GAAG,CAAC,CAAC;AAAA,EAC3F;AACA,QAAM,4BAA4B,IAAI;AAAA,IACpC,yBAAyB,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,4BAA4B,GAAG,CAAC,CAAC;AAAA,EAC5F;AACA,QAAM,iCAAiC,CAAC,GAAG,4BAA4B,KAAK,CAAC,EAC1E,OAAO,CAAC,YAAY,CAAC,0BAA0B,IAAI,OAAO,CAAC,EAC3D,KAAK;AACR,QAAM,+BAA+B,CAAC,GAAG,0BAA0B,KAAK,CAAC,EACtE,OAAO,CAAC,YAAY,CAAC,4BAA4B,IAAI,OAAO,CAAC,EAC7D,KAAK;AACR,QAAM,oCAAoC,CAAC,GAAG,4BAA4B,KAAK,CAAC,EAC7E;AAAA,IAAO,CAAC,YACP,0BAA0B,IAAI,OAAO,KAAK,0BAA0B,IAAI,OAAO,MAAM,4BAA4B,IAAI,OAAO;AAAA,EAC9H,EACC,KAAK;AAER,QAAM,0BAA0B,IAAI;AAAA,KACjC,SAAS,YAAY,mBAAmB,CAAC,GAAG,IAAI,CAAC,QAAQ;AAAA,MACxD,GAAG,IAAI,KAAK,KAAK,IAAI,OAAO;AAAA,MAC5B,kCAAkC,GAAG;AAAA,IACvC,CAAC;AAAA,EACH;AACA,QAAM,wBAAwB,IAAI;AAAA,IAChC,oBAAoB,gBAAgB,IAAI,CAAC,QAAQ;AAAA,MAC/C,GAAG,IAAI,KAAK,KAAK,IAAI,OAAO;AAAA,MAC5B,kCAAkC,GAAG;AAAA,IACvC,CAAC;AAAA,EACH;AACA,QAAM,6BAA6B,CAAC,GAAG,wBAAwB,KAAK,CAAC,EAClE,OAAO,CAAC,YAAY,CAAC,sBAAsB,IAAI,OAAO,CAAC,EACvD,KAAK;AACR,QAAM,2BAA2B,CAAC,GAAG,sBAAsB,KAAK,CAAC,EAC9D,OAAO,CAAC,YAAY,CAAC,wBAAwB,IAAI,OAAO,CAAC,EACzD,KAAK;AACR,QAAM,gCAAgC,CAAC,GAAG,wBAAwB,KAAK,CAAC,EACrE;AAAA,IAAO,CAAC,YACP,sBAAsB,IAAI,OAAO,KAAK,sBAAsB,IAAI,OAAO,MAAM,wBAAwB,IAAI,OAAO;AAAA,EAClH,EACC,KAAK;AAER,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,IACE,oBACA,wBAAwB,WAAW,KACnC,sBAAsB,WAAW,KACjC,2BAA2B,WAAW,KACtC,wBAAwB,WAAW,KACnC,sBAAsB,WAAW,KACjC,yBAAyB,WAAW,KACpC,uBAAuB,WAAW,KAClC,4BAA4B,WAAW,KACvC,+BAA+B,WAAW,KAC1C,6BAA6B,WAAW,KACxC,kCAAkC,WAAW,KAC7C,2BAA2B,WAAW,KACtC,yBAAyB,WAAW,KACpC,8BAA8B,WAAW;AAAA,IAC3C,qBAAqB,SAAS,kBAAkB;AAAA,IAChD,mBAAmB,wBAAwB;AAAA,IAC3C,sBAAsB,SAAS,mBAAmB;AAAA,IAClD,oBAAoB,mBAAmB;AAAA,IACvC,2BAA2B,SAAS,wBAAwB;AAAA,IAC5D,yBAAyB,8BAA8B;AAAA,IACvD,6BAA6B,SAAS,oBAAoB;AAAA,IAC1D,2BAA2B,yBAAyB,KAAK;AAAA,IACzD,yBAAyB,SAAS,YAAY,gBAAgB,UAAU;AAAA,IACxE,uBAAuB,oBAAoB,gBAAgB;AAAA,IAC3D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,qBAAqB,SAAS;AAAA,IAC9B,OAAO,SAAS;AAAA,EAClB;AACF;AAEA,eAAsB,uBACpB,SACuC;AACvC,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,SAAS,MAAM,uBAAuB,OAAO;AACnD,MAAI,OAAO,IAAI;AACb,WAAO;AAAA,MACL;AAAA,MACA,UAAU;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ;AACV,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,UAAU;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,MAAM,wBAAwB;AAAA,IAC5C,GAAG;AAAA,IACH,QAAQ;AAAA,EACV,CAAC;AACD,QAAM,WAAW,MAAM,uBAAuB,OAAO;AACrD,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,UAAU,SAAS;AAAA,IACnB,QAAQ;AAAA,IACR;AAAA,EACF;AACF;","names":[]}

package/dist/chunk-DP4EBV7C.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/maintenance/rebuild-memory-lifecycle-ledger.ts"],"sourcesContent":["import path from \"node:path\";\nimport { stat } from \"node:fs/promises\";\nimport { StorageManager } from \"../storage.js\";\nimport { assertInjectedStorageRooted } from \"./projection-support.js\";\nimport { log } from \"../logger.js\";\nimport { displayErrorDetail } from \"../runtime/better-sqlite.js\";\nimport type { MemoryLifecycleEvent } from \"../types.js\";\nimport { toBackupStamp } from \"./backup-stamp.js\";\nimport { copyExistingFileToBackup, writeFileAtomically } from \"./atomic-file.js\";\nimport {\n  buildLifecycleEventsForMemory,\n  compareMemoryLifecycleEvents,\n  sortMemoryLifecycleEvents,\n  isFrontmatterDerivedLifecycleEventType,\n  memoryLifecycleEventProjectionIdentity,\n  memoryLifecycleLedgerLockPath,\n  MEMORY_LIFECYCLE_LEDGER_LOCK_STALE_MS,\n} from \"../memory-lifecycle-ledger-utils.js\";\nimport { withHeldFileLock, type HeldFileLockOptions, type HeldFileLockController } from \"../utils/serialize-mutations.js\";\nimport { probeEncryptedRegularFileHeader } from \"../secure-store/secure-fs.js\";\n\n\nexport interface RebuildMemoryLifecycleLedgerOptions {\n  memoryDir: string;\n  dryRun?: boolean;\n  now?: Date;\n  /**\n   * Active storage context (issue #1910). When provided, memories are read\n   * through it (so encrypted-at-rest memories in a secure-store deployment are\n   * decrypted with the live key) and the rebuilt ledger is rewritten through\n   * its secure writer (so it stays encrypted at rest). Its `dir` MUST equal\n   * `memoryDir`. When omitted, a fresh plaintext `StorageManager` is used and\n   * the ledger is written as plaintext — the CLI default.\n   */\n  storage?: StorageManager;\n  /**\n   * Preserve append-only lifecycle events that have no frontmatter equivalent\n   * (issue #1910). `buildLifecycleEventsForMemory` only reconstructs\n   * `created`/`updated`/`superseded`/`archived` from frontmatter, so a bare\n   * rebuild silently drops history like `explicit_capture_accepted`,\n   * `explicit_capture_queued`, `imported`, `promoted`, `merged`, `restored`,\n   * and `rejected`. When true, the existing ledger's non-reconstructable rows\n   * are read (via the same secure/permissive `readAllMemoryLifecycleEvents`\n   * path), merged with the rebuilt rows, deduplicated by `eventId`, and sorted\n   * canonically. Background auto-compaction sets this so it never loses events;\n   * the manual/CLI repair rebuild leaves it off (reconstruct purely from\n   * frontmatter).\n   */\n  preserveExistingEvents?: boolean;\n  /**\n   * Override the ledger-lock acquisition timing (issue #2033). Only\n   * `maxWaitMs`/`pollMs` are honored; `staleMs` stays fixed at\n   * `MEMORY_LIFECYCLE_LEDGER_LOCK_STALE_MS`. Used by tests to force the\n   * lock-acquisition-failure branch (`acquired=false`) deterministically\n   * without a multi-second wait.\n   */\n  lockOptions?: Pick<HeldFileLockOptions, \"maxWaitMs\" | \"pollMs\">;\n  /**\n   * Upper bound (bytes) on the rewritten ledger when preserving events (issue\n   * #2033). A preserving compaction carries over ALL append-only history, which\n   * — if the history alone is large — could leave the rewritten ledger over the\n   * whole-file read/decrypt cap (STATE_FILE_MAX_DECRYPT_BYTES), the exact\n   * unreadable-ledger failure compaction exists to prevent. When set and the\n   * preserved payload would exceed it, the OLDEST rows are dropped from the\n   * active ledger until it fits; because the full pre-compaction ledger is\n   * copied verbatim to the timestamped backup first, those rows are archived,\n   * not lost. Ignored when `preserveExistingEvents` is off (a frontmatter-only\n   * rebuild is already bounded by the corpus). `0`/undefined disables bounding.\n   */\n  maxLedgerBytes?: number;\n}\n\nexport interface SkippedLifecycleBlankIdMemory {\n  path: string;\n}\n\nexport interface SkippedDuplicateLifecycleEvent {\n  eventId: string;\n  keptPath: string;\n  skippedPath: string;\n}\n\nexport interface RebuildMemoryLifecycleLedgerResult {\n  dryRun: boolean;\n  scannedMemories: number;\n  rebuiltRows: number;\n  outputPath: string;\n  backupPath?: string;\n  skippedBlankIdMemories: SkippedLifecycleBlankIdMemory[];\n  skippedDuplicateEvents: SkippedDuplicateLifecycleEvent[];\n  /**\n   * Count of existing-ledger rows carried over beyond the frontmatter\n   * reconstruction (only set when `preserveExistingEvents` is on; issue #1910):\n   * append-only history with no frontmatter equivalent, plus any\n   * frontmatter-derived row that raced in after the corpus scan and so was not\n   * reproduced by the reconstruction (#2033).\n   */\n  preservedAppendOnlyRows?: number;\n  /**\n   * Count of oldest rows dropped from the ACTIVE ledger to keep it under\n   * `maxLedgerBytes` (issue #2033). They remain in the verbatim timestamped\n   * backup, so this is a bound-and-archive, not a loss. Set only when bounding\n   * actually trimmed rows.\n   */\n  archivedOverflowRows?: number;\n  /**\n   * Whether the active ledger was actually backed up and rewritten (issue #2033\n   * thread PRRT_kwDORJXyws6SExst). A preserving write-mode rebuild that would\n   * reproduce the current ledger byte-for-byte (same decrypted content AND same\n   * at-rest format) skips the backup+rewrite, so callers can distinguish a real\n   * compaction from a no-op and avoid re-archiving an unchanged ledger every\n   * interval. `true` for every dry run's non-write preview is never set — only\n   * write-mode results carry it; defaults to `false` when no rewrite happened.\n   */\n  rewritten?: boolean;\n}\n\nfunction isNodeError(err: unknown): err is NodeJS.ErrnoException {\n  return typeof err === \"object\" && err !== null && \"code\" in err;\n}\n\n/** Serialized on-disk size (bytes, incl. trailing newline) of one ledger row. */\nfunction lifecycleRowBytes(event: MemoryLifecycleEvent): number {\n  return Buffer.byteLength(`${JSON.stringify(event)}\\n`, \"utf8\");\n}\n\n/**\n * Keep the NEWEST canonically-ordered events whose serialized payload fits\n * strictly under `cap` bytes (issue #2033). Recency is by `timestamp` (newest\n * first), tie-broken by the canonical comparator, so a large append-only\n * history is trimmed to its most recent rows rather than to a single memoryId\n * group (the ledger's on-disk order is by memoryId then time).\n *\n * A row too large to fit the remaining budget is SKIPPED, and scanning\n * continues to older rows that still fit — one oversized (or future-dated,\n * hence recency-first) row cannot truncate the entire older history. The kept\n * subset is returned in the input's canonical order; the caller relies on the\n * verbatim backup to retain the dropped rows.\n */\nexport function boundLifecycleEventsToByteCap(\n  events: MemoryLifecycleEvent[],\n  cap: number,\n): { kept: MemoryLifecycleEvent[]; dropped: number } {\n  if (!(cap > 0)) return { kept: events, dropped: 0 };\n  const sizes = new Map<MemoryLifecycleEvent, number>();\n  let total = 0;\n  for (const event of events) {\n    const bytes = lifecycleRowBytes(event);\n    sizes.set(event, bytes);\n    total += bytes;\n  }\n  if (total <= cap) return { kept: events, dropped: 0 };\n  const byRecency = [...events].sort((a, b) => {\n    if (a.timestamp !== b.timestamp) return b.timestamp.localeCompare(a.timestamp);\n    return -compareMemoryLifecycleEvents(a, b);\n  });\n  const keep = new Set<MemoryLifecycleEvent>();\n  let running = 0;\n  for (const event of byRecency) {\n    const bytes = sizes.get(event)!;\n    if (running + bytes > cap) continue; // skip this row, keep scanning older rows that still fit\n    running += bytes;\n    keep.add(event);\n  }\n  const kept = events.filter((event) => keep.has(event));\n  return { kept, dropped: events.length - kept.length };\n}\n\nexport async function backupExistingLedger(\n  memoryDir: string,\n  outputPath: string,\n  now: Date,\n): Promise<string | undefined> {\n  try {\n    await stat(outputPath);\n  } catch (err) {\n    if (isNodeError(err) && err.code === \"ENOENT\") {\n      return undefined;\n    }\n    throw err;\n  }\n\n  const backupPath = path.join(\n    memoryDir,\n    \"archive\",\n    \"memory-lifecycle-ledger\",\n    toBackupStamp(now),\n    \"state\",\n    \"memory-lifecycle-ledger.jsonl\",\n  );\n  return backupPath;\n}\n\nexport async function rebuildMemoryLifecycleLedger(\n  options: RebuildMemoryLifecycleLedgerOptions,\n): Promise<RebuildMemoryLifecycleLedgerResult> {\n  const dryRun = options.dryRun !== false;\n  const now = options.now ?? new Date();\n  const outputPath = path.join(options.memoryDir, \"state\", \"memory-lifecycle-ledger.jsonl\");\n  const storage = assertInjectedStorageRooted(\"rebuildMemoryLifecycleLedger\", options.memoryDir, options.storage) ?? new StorageManager(options.memoryDir);\n  const secureRewrite = options.storage !== undefined;\n  const tiers = [\n    await storage.readAllMemories(),\n    await storage.readAllColdMemories(),\n    await storage.readArchivedMemories(),\n  ];\n  const allMemories = tiers.flat();\n  const skippedBlankIdMemories: SkippedLifecycleBlankIdMemory[] = [];\n  const eventCandidates: Array<{ event: MemoryLifecycleEvent; path: string }> = [];\n  for (const tier of tiers) {\n    for (const memory of [...tier].sort((left, right) => left.path.localeCompare(right.path))) {\n      if (!memory.frontmatter.id.trim()) {\n        skippedBlankIdMemories.push({ path: memory.path });\n        log.warn(`lifecycle ledger rebuild skipped blank memory id: path=${memory.path}`);\n        continue;\n      }\n      for (const event of buildLifecycleEventsForMemory(memory)) {\n        eventCandidates.push({ event, path: memory.path });\n      }\n    }\n  }\n\n  const orderedEvents = sortMemoryLifecycleEvents(eventCandidates.map((candidate) => candidate.event));\n  const candidateByEvent = new Map(\n    eventCandidates.map((candidate) => [candidate.event, candidate]),\n  );\n  const keptByEventId = new Map<string, { event: MemoryLifecycleEvent; path: string }>();\n  const events: MemoryLifecycleEvent[] = [];\n  const skippedDuplicateEvents: SkippedDuplicateLifecycleEvent[] = [];\n  for (const event of orderedEvents) {\n    const candidate = candidateByEvent.get(event)!;\n    const kept = keptByEventId.get(event.eventId);\n    if (kept) {\n      skippedDuplicateEvents.push({\n        eventId: event.eventId,\n        keptPath: kept.path,\n        skippedPath: candidate.path,\n      });\n      log.warn(\n        `lifecycle ledger rebuild skipped duplicate event_id=${event.eventId}: `\n        + `kept=${kept.path} skipped=${candidate.path}`,\n      );\n      continue;\n    }\n    keptByEventId.set(event.eventId, candidate);\n    events.push(event);\n  }\n\n  let finalEvents = events;\n  let preservedAppendOnlyRows: number | undefined;\n  let archivedOverflowRows: number | undefined;\n  let backupPath: string | undefined;\n  let rewritten = false;\n  // The preserve-read + whole-file rewrite are serialized against concurrent\n  // lifecycle appends ONLY in write mode (issue #1910, codex):\n  // appendMemoryLifecycleEvents holds this same cross-process lock, so an event\n  // appended after the preserve-read but before the atomic rename waits and\n  // lands on the compacted ledger instead of being clobbered by the rename. A\n  // DRY RUN takes no lock — it reads the ledger read-only to compute the\n  // preserve/merge/byte-cap PREVIEW and never rewrites, so it must not block\n  // appends (#2033 Cursor). The corpus scan above stays outside the lock in\n  // both modes — frontmatter-derived rows come from the memory files.\n  const runLedgerCriticalSection = async (\n    acquired: boolean,\n    lock: HeldFileLockController | null,\n  ): Promise<void> => {\n    // A WRITE that read or rewrote the ledger without the lock could race a\n    // concurrent append/rewrite and lose data, so REFUSE the unlocked fallback\n    // withHeldFileLock takes on acquisition timeout (issue #2033 CodeRabbit\n    // Critical / codex). A dry run passes lock=null and acquired=true: it never\n    // reaches the rewrite, so the unlocked preview read is safe.\n    if (!dryRun && !acquired) {\n      throw new Error(\n        \"lifecycle ledger rebuild aborted: could not acquire the ledger lock within the \"\n        + \"acquisition budget; refusing to read or rewrite unlocked so a concurrent append \"\n        + \"or compaction cannot be clobbered (issue #1910).\",\n      );\n    }\n    if (options.preserveExistingEvents) {\n      // Merge the frontmatter reconstruction (`events`) with the CURRENT ledger\n      // so compaction never deletes a lifecycle row that raced the scan (issue\n      // #1910, #2033). Read the existing ledger through the uncapped BUFFER\n      // path — it decrypts with the live key when `storage` carries the secure\n      // context and bypasses the whole-file string decrypt cap, so an oversize\n      // encrypted ledger (the exact file compaction must shrink) is still\n      // readable here rather than aborting (#2033 Cursor High).\n      // preserveExistingEvents means \"never lose history\": if the current\n      // ledger genuinely cannot be read (corruption, or a locked required\n      // store), ABORT rather than rewrite from frontmatter only and silently\n      // drop that history. An absent ledger reads as [] (ENOENT swallowed\n      // downstream), so a throw here is always a real read failure.\n      let existing: MemoryLifecycleEvent[];\n      try {\n        existing = await storage.readAllMemoryLifecycleEventsForCompaction();\n      } catch (err) {\n        throw new Error(\n          `lifecycle ledger rebuild aborted: cannot read existing events to preserve `\n          + `(${displayErrorDetail(err) || \"unknown error\"})`,\n        );\n      }\n      // The corpus scan (`events`) runs OUTSIDE the lock and is therefore a\n      // stale snapshot; `existing` is read here under the lock and is\n      // authoritative for what the ledger holds at rewrite time. A\n      // frontmatter-derived row (created/updated/superseded/archived) is safe to\n      // collapse into the reconstruction ONLY when the scan actually reproduced\n      // the same logical event — same (memoryId, eventType, timestamp), which is\n      // exactly what the live append stamps (fm.created/updated/...) and what\n      // makeRebuiltMemoryLifecycleEvent emits. A frontmatter-derived row whose\n      // content key the reconstruction did NOT produce raced in after the scan\n      // (a memory created/updated between the scan and this locked read); the\n      // reconstruction has no equivalent, so dropping it by eventType alone\n      // would delete it. Preserve it instead, deduped by content key so a\n      // retried append of the same logical event still collapses to one. Rows\n      // that are not frontmatter-derived are append-only history with no\n      // reconstruction — always carried over, deduped by eventId in the merge.\n      const reconstructedKeys = new Set(events.map(memoryLifecycleEventProjectionIdentity));\n      const racedFrontmatterByKey = new Map<string, MemoryLifecycleEvent>();\n      const appendOnly: MemoryLifecycleEvent[] = [];\n      for (const event of existing) {\n        if (!isFrontmatterDerivedLifecycleEventType(event.eventType)) {\n          appendOnly.push(event);\n          continue;\n        }\n        const key = memoryLifecycleEventProjectionIdentity(event);\n        if (reconstructedKeys.has(key)) continue; // collapsed into reconstruction\n        if (!racedFrontmatterByKey.has(key)) racedFrontmatterByKey.set(key, event);\n      }\n      const mergedById = new Map<string, MemoryLifecycleEvent>();\n      for (const event of sortMemoryLifecycleEvents([\n        ...events,\n        ...racedFrontmatterByKey.values(),\n        ...appendOnly,\n      ])) {\n        if (!mergedById.has(event.eventId)) mergedById.set(event.eventId, event);\n      }\n      finalEvents = [...mergedById.values()];\n      preservedAppendOnlyRows = finalEvents.length - events.length;\n      // Bound the rewritten ledger so a preserving compaction can never leave it\n      // over the whole-file read/decrypt cap (#2033). This must run whenever a\n      // cap is set — NOT only when `existing.length > 0`: an oversized on-disk\n      // ledger whose every row fails validation reads as `existing === []`, yet\n      // `finalEvents` (the frontmatter reconstruction) can itself exceed the cap.\n      // Overflow (oldest) rows are dropped from the active ledger but survive\n      // both in the timestamped backup (a verbatim copy when the ledger is\n      // plaintext, re-encrypted under the backup path's own AAD when it is\n      // encrypted so it still decrypts there, #2033) and, for frontmatter-derived\n      // rows, in the memory files they were reconstructed from — so a later full\n      // rebuild regenerates them.\n      if (options.maxLedgerBytes && options.maxLedgerBytes > 0) {\n        const bounded = boundLifecycleEventsToByteCap(finalEvents, options.maxLedgerBytes);\n        if (bounded.dropped > 0) {\n          finalEvents = bounded.kept;\n          archivedOverflowRows = bounded.dropped;\n          log.warn(\n            `lifecycle ledger rebuild bounded to ${options.maxLedgerBytes} bytes: `\n            + `dropped ${bounded.dropped} oldest row(s) from the active ledger `\n            + `(preserved in the backup) to stay under the read/decrypt cap.`,\n          );\n        }\n      }\n    }\n\n    // Re-assert the lock immediately before the destructive active-ledger\n    // rewrite. Everything above (the preserve read, merge, sort, byte-cap\n    // bound, and JSON serialize) is CPU-bound and blocks the event loop, so the\n    // timer heartbeat inside withHeldFileLock cannot refresh the lock's mtime;\n    // a peer that judged the lock stale within the 30s window could have broken\n    // it and appended to the current ledger. `lock.refresh()` (a) reports the\n    // lock LOST so we ABORT rather than rename our compacted file over that\n    // peer's append, and (b) when still held, re-stamps the mtime so the bounded\n    // write below cannot itself be judged stale mid-rename (issue #1910/#2033).\n    const abortIfLockLost = async (): Promise<void> => {\n      if (lock && await lock.refresh()) return;\n      throw new Error(\n        \"lifecycle ledger rebuild aborted: lost the ledger lock during the compaction \"\n        + \"rewrite (a peer stale-broke it while the event loop was blocked by CPU-bound \"\n        + \"merge/serialize); refusing to clobber a concurrent append (issue #1910/#2033).\",\n      );\n    };\n    if (!dryRun) {\n      const payload = finalEvents.map((event) => JSON.stringify(event)).join(\"\\n\");\n      const content = payload.length > 0 ? `${payload}\\n` : \"\";\n      // No-op skip (#2033 thread PRRT_kwDORJXyws6SExst): a preserving rebuild\n      // bounds the ACTIVE ledger to the read/decrypt cap, so a VALID ledger that\n      // sits above the configured compaction trigger but below the cap would\n      // otherwise be rewritten to identical content and re-archived on every\n      // maintenance interval — unbounded growth of archive/memory-lifecycle-ledger\n      // plus pointless disk/CPU churn. Skip the backup+rewrite when it would\n      // change neither the logical (decrypted) content NOR the at-rest format.\n      // The raw read here doubles as the source for the encrypted verbatim backup\n      // below, so the current ledger is read at most once. An absent ledger reads\n      // as ENOENT (a create is always a real change) and any other read/probe\n      // error propagates rather than masking a needed rewrite.\n      let currentEncrypted = false;\n      let priorRawBuffer: Buffer | null = null;\n      try {\n        currentEncrypted = await probeEncryptedRegularFileHeader(outputPath);\n        priorRawBuffer = await storage.readMemoryLifecycleLedgerRawBufferForCompaction();\n      } catch (err) {\n        if (!isNodeError(err) || err.code !== \"ENOENT\") throw err;\n      }\n      // Preserve encryption at rest (#2033). An already-encrypted ledger (or its\n      // encrypted backup) MUST be rewritten encrypted even when the\n      // `secureStoreEncryptOnWrite` policy is paused — otherwise the compaction\n      // silently DOWNGRADES encrypted state to plaintext. Force encryption\n      // whenever the current ledger is encrypted and the store is unlocked (a\n      // key is available); reaching this point with an encrypted ledger already\n      // implies an unlocked store, since the raw read above decrypts and would\n      // have thrown under a locked key. A plaintext ledger keeps the ordinary\n      // policy (`willEncryptStateWrites`), so existing plaintext behavior holds.\n      const forceEncrypt =\n        secureRewrite && currentEncrypted && storage.isSecureStoreUnlocked();\n      const replacementEncrypted =\n        secureRewrite && (storage.willEncryptStateWrites() || forceEncrypt);\n      // Compare as buffers, never decoding the raw ledger to one giant string:\n      // a multi-hundred-MB decrypted ledger can exceed V8's max string length,\n      // so `priorRawBuffer.equals(...)` (byte compare) must be used, NOT\n      // `.toString()` (#2033 giant-string invariant). `content` is the freshly\n      // serialized replacement, already a string; Buffer.from() reuses it.\n      if (\n        priorRawBuffer !== null &&\n        currentEncrypted === replacementEncrypted &&\n        priorRawBuffer.equals(Buffer.from(content, \"utf8\"))\n      ) {\n        // Nothing to change: leave the active ledger and archive untouched.\n        rewritten = false;\n      } else {\n        const desiredBackup = await backupExistingLedger(options.memoryDir, outputPath, now);\n        if (secureRewrite) {\n          // Preserve encrypted-at-rest (issue #1910). The BACKUP needs care under\n          // secure-store (#2033): when the existing ledger is encrypted, its bytes\n          // are path-bound via AAD, so a byte-for-byte copy to the archive path\n          // cannot be decrypted there — it would silently orphan the overflow rows\n          // a bounded rewrite claims to preserve. Reuse the RAW decrypted ledger\n          // content read above (no event parsing, so malformed/truncated/future\n          // rows survive exactly as the plaintext verbatim copy keeps them) and\n          // re-encrypt it under the backup path's own AAD, yielding a directly\n          // decryptable backup that retains every original byte. A PLAINTEXT\n          // existing ledger is already readable, so a verbatim copy is correct.\n          // Then rewrite the active ledger through the secure writer.\n          if (desiredBackup && currentEncrypted) {\n            const rawForBackup =\n              priorRawBuffer ?? (await storage.readMemoryLifecycleLedgerRawBufferForCompaction());\n            await storage.writeMemoryLifecycleLedgerContent(rawForBackup, desiredBackup, forceEncrypt);\n            backupPath = desiredBackup;\n          } else {\n            backupPath = desiredBackup\n              ? await copyExistingFileToBackup(outputPath, desiredBackup)\n              : undefined;\n          }\n          await abortIfLockLost();\n          await storage.writeMemoryLifecycleLedgerContent(content, undefined, forceEncrypt);\n        } else {\n          await abortIfLockLost();\n          backupPath = await writeFileAtomically(outputPath, content, desiredBackup);\n        }\n        rewritten = true;\n      }\n    }\n  };\n  // Write mode holds the ledger lock across the preserve-read and atomic\n  // rewrite so a concurrent append lands on the compacted ledger instead of\n  // being clobbered. A dry run computes the SAME preserve/merge/byte-cap\n  // preview but WITHOUT the lock (read-only, no rewrite), so `rebuiltRows`,\n  // `preservedAppendOnlyRows`, and `archivedOverflowRows` report what a --write\n  // would apply while never blocking concurrent appends (#2033 Cursor). A dry\n  // run with nothing to preserve touches nothing at all.\n  if (!dryRun) {\n    await withHeldFileLock(\n      memoryLifecycleLedgerLockPath(outputPath),\n      { staleMs: MEMORY_LIFECYCLE_LEDGER_LOCK_STALE_MS, ...options.lockOptions },\n      runLedgerCriticalSection,\n    );\n  } else if (options.preserveExistingEvents) {\n    await runLedgerCriticalSection(true, null);\n  }\n\n  return {\n    dryRun,\n    scannedMemories: allMemories.length,\n    rebuiltRows: finalEvents.length,\n    outputPath,\n    backupPath,\n    skippedBlankIdMemories,\n    skippedDuplicateEvents,\n    preservedAppendOnlyRows,\n    archivedOverflowRows,\n    rewritten,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,YAAY;AAoHrB,SAAS,YAAY,KAA4C;AAC/D,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU;AAC9D;AAGA,SAAS,kBAAkB,OAAqC;AAC9D,SAAO,OAAO,WAAW,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA,GAAM,MAAM;AAC/D;AAeO,SAAS,8BACd,QACA,KACmD;AACnD,MAAI,EAAE,MAAM,GAAI,QAAO,EAAE,MAAM,QAAQ,SAAS,EAAE;AAClD,QAAM,QAAQ,oBAAI,IAAkC;AACpD,MAAI,QAAQ;AACZ,aAAW,SAAS,QAAQ;AAC1B,UAAM,QAAQ,kBAAkB,KAAK;AACrC,UAAM,IAAI,OAAO,KAAK;AACtB,aAAS;AAAA,EACX;AACA,MAAI,SAAS,IAAK,QAAO,EAAE,MAAM,QAAQ,SAAS,EAAE;AACpD,QAAM,YAAY,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAC3C,QAAI,EAAE,cAAc,EAAE,UAAW,QAAO,EAAE,UAAU,cAAc,EAAE,SAAS;AAC7E,WAAO,CAAC,6BAA6B,GAAG,CAAC;AAAA,EAC3C,CAAC;AACD,QAAM,OAAO,oBAAI,IAA0B;AAC3C,MAAI,UAAU;AACd,aAAW,SAAS,WAAW;AAC7B,UAAM,QAAQ,MAAM,IAAI,KAAK;AAC7B,QAAI,UAAU,QAAQ,IAAK;AAC3B,eAAW;AACX,SAAK,IAAI,KAAK;AAAA,EAChB;AACA,QAAM,OAAO,OAAO,OAAO,CAAC,UAAU,KAAK,IAAI,KAAK,CAAC;AACrD,SAAO,EAAE,MAAM,SAAS,OAAO,SAAS,KAAK,OAAO;AACtD;AAEA,eAAsB,qBACpB,WACA,YACA,KAC6B;AAC7B,MAAI;AACF,UAAM,KAAK,UAAU;AAAA,EACvB,SAAS,KAAK;AACZ,QAAI,YAAY,GAAG,KAAK,IAAI,SAAS,UAAU;AAC7C,aAAO;AAAA,IACT;AACA,UAAM;AAAA,EACR;AAEA,QAAM,aAAa,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,GAAG;AAAA,IACjB;AAAA,IACA;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,6BACpB,SAC6C;AAC7C,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,aAAa,KAAK,KAAK,QAAQ,WAAW,SAAS,+BAA+B;AACxF,QAAM,UAAU,4BAA4B,gCAAgC,QAAQ,WAAW,QAAQ,OAAO,KAAK,IAAI,eAAe,QAAQ,SAAS;AACvJ,QAAM,gBAAgB,QAAQ,YAAY;AAC1C,QAAM,QAAQ;AAAA,IACZ,MAAM,QAAQ,gBAAgB;AAAA,IAC9B,MAAM,QAAQ,oBAAoB;AAAA,IAClC,MAAM,QAAQ,qBAAqB;AAAA,EACrC;AACA,QAAM,cAAc,MAAM,KAAK;AAC/B,QAAM,yBAA0D,CAAC;AACjE,QAAM,kBAAwE,CAAC;AAC/E,aAAW,QAAQ,OAAO;AACxB,eAAW,UAAU,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC,GAAG;AACzF,UAAI,CAAC,OAAO,YAAY,GAAG,KAAK,GAAG;AACjC,+BAAuB,KAAK,EAAE,MAAM,OAAO,KAAK,CAAC;AACjD,YAAI,KAAK,0DAA0D,OAAO,IAAI,EAAE;AAChF;AAAA,MACF;AACA,iBAAW,SAAS,8BAA8B,MAAM,GAAG;AACzD,wBAAgB,KAAK,EAAE,OAAO,MAAM,OAAO,KAAK,CAAC;AAAA,MACnD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,gBAAgB,0BAA0B,gBAAgB,IAAI,CAAC,cAAc,UAAU,KAAK,CAAC;AACnG,QAAM,mBAAmB,IAAI;AAAA,IAC3B,gBAAgB,IAAI,CAAC,cAAc,CAAC,UAAU,OAAO,SAAS,CAAC;AAAA,EACjE;AACA,QAAM,gBAAgB,oBAAI,IAA2D;AACrF,QAAM,SAAiC,CAAC;AACxC,QAAM,yBAA2D,CAAC;AAClE,aAAW,SAAS,eAAe;AACjC,UAAM,YAAY,iBAAiB,IAAI,KAAK;AAC5C,UAAM,OAAO,cAAc,IAAI,MAAM,OAAO;AAC5C,QAAI,MAAM;AACR,6BAAuB,KAAK;AAAA,QAC1B,SAAS,MAAM;AAAA,QACf,UAAU,KAAK;AAAA,QACf,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,UAAI;AAAA,QACF,uDAAuD,MAAM,OAAO,UAC1D,KAAK,IAAI,YAAY,UAAU,IAAI;AAAA,MAC/C;AACA;AAAA,IACF;AACA,kBAAc,IAAI,MAAM,SAAS,SAAS;AAC1C,WAAO,KAAK,KAAK;AAAA,EACnB;AAEA,MAAI,cAAc;AAClB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,YAAY;AAUhB,QAAM,2BAA2B,OAC/B,UACA,SACkB;AAMlB,QAAI,CAAC,UAAU,CAAC,UAAU;AACxB,YAAM,IAAI;AAAA,QACR;AAAA,MAGF;AAAA,IACF;AACA,QAAI,QAAQ,wBAAwB;AAalC,UAAI;AACJ,UAAI;AACF,mBAAW,MAAM,QAAQ,0CAA0C;AAAA,MACrE,SAAS,KAAK;AACZ,cAAM,IAAI;AAAA,UACR,8EACM,mBAAmB,GAAG,KAAK,eAAe;AAAA,QAClD;AAAA,MACF;AAgBA,YAAM,oBAAoB,IAAI,IAAI,OAAO,IAAI,sCAAsC,CAAC;AACpF,YAAM,wBAAwB,oBAAI,IAAkC;AACpE,YAAM,aAAqC,CAAC;AAC5C,iBAAW,SAAS,UAAU;AAC5B,YAAI,CAAC,uCAAuC,MAAM,SAAS,GAAG;AAC5D,qBAAW,KAAK,KAAK;AACrB;AAAA,QACF;AACA,cAAM,MAAM,uCAAuC,KAAK;AACxD,YAAI,kBAAkB,IAAI,GAAG,EAAG;AAChC,YAAI,CAAC,sBAAsB,IAAI,GAAG,EAAG,uBAAsB,IAAI,KAAK,KAAK;AAAA,MAC3E;AACA,YAAM,aAAa,oBAAI,IAAkC;AACzD,iBAAW,SAAS,0BAA0B;AAAA,QAC5C,GAAG;AAAA,QACH,GAAG,sBAAsB,OAAO;AAAA,QAChC,GAAG;AAAA,MACL,CAAC,GAAG;AACF,YAAI,CAAC,WAAW,IAAI,MAAM,OAAO,EAAG,YAAW,IAAI,MAAM,SAAS,KAAK;AAAA,MACzE;AACA,oBAAc,CAAC,GAAG,WAAW,OAAO,CAAC;AACrC,gCAA0B,YAAY,SAAS,OAAO;AAYtD,UAAI,QAAQ,kBAAkB,QAAQ,iBAAiB,GAAG;AACxD,cAAM,UAAU,8BAA8B,aAAa,QAAQ,cAAc;AACjF,YAAI,QAAQ,UAAU,GAAG;AACvB,wBAAc,QAAQ;AACtB,iCAAuB,QAAQ;AAC/B,cAAI;AAAA,YACF,uCAAuC,QAAQ,cAAc,mBAChD,QAAQ,OAAO;AAAA,UAE9B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAWA,UAAM,kBAAkB,YAA2B;AACjD,UAAI,QAAQ,MAAM,KAAK,QAAQ,EAAG;AAClC,YAAM,IAAI;AAAA,QACR;AAAA,MAGF;AAAA,IACF;AACA,QAAI,CAAC,QAAQ;AACX,YAAM,UAAU,YAAY,IAAI,CAAC,UAAU,KAAK,UAAU,KAAK,CAAC,EAAE,KAAK,IAAI;AAC3E,YAAM,UAAU,QAAQ,SAAS,IAAI,GAAG,OAAO;AAAA,IAAO;AAYtD,UAAI,mBAAmB;AACvB,UAAI,iBAAgC;AACpC,UAAI;AACF,2BAAmB,MAAM,gCAAgC,UAAU;AACnE,yBAAiB,MAAM,QAAQ,gDAAgD;AAAA,MACjF,SAAS,KAAK;AACZ,YAAI,CAAC,YAAY,GAAG,KAAK,IAAI,SAAS,SAAU,OAAM;AAAA,MACxD;AAUA,YAAM,eACJ,iBAAiB,oBAAoB,QAAQ,sBAAsB;AACrE,YAAM,uBACJ,kBAAkB,QAAQ,uBAAuB,KAAK;AAMxD,UACE,mBAAmB,QACnB,qBAAqB,wBACrB,eAAe,OAAO,OAAO,KAAK,SAAS,MAAM,CAAC,GAClD;AAEA,oBAAY;AAAA,MACd,OAAO;AACL,cAAM,gBAAgB,MAAM,qBAAqB,QAAQ,WAAW,YAAY,GAAG;AACnF,YAAI,eAAe;AAYjB,cAAI,iBAAiB,kBAAkB;AACrC,kBAAM,eACJ,kBAAmB,MAAM,QAAQ,gDAAgD;AACnF,kBAAM,QAAQ,kCAAkC,cAAc,eAAe,YAAY;AACzF,yBAAa;AAAA,UACf,OAAO;AACL,yBAAa,gBACT,MAAM,yBAAyB,YAAY,aAAa,IACxD;AAAA,UACN;AACA,gBAAM,gBAAgB;AACtB,gBAAM,QAAQ,kCAAkC,SAAS,QAAW,YAAY;AAAA,QAClF,OAAO;AACL,gBAAM,gBAAgB;AACtB,uBAAa,MAAM,oBAAoB,YAAY,SAAS,aAAa;AAAA,QAC3E;AACA,oBAAY;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAQA,MAAI,CAAC,QAAQ;AACX,UAAM;AAAA,MACJ,8BAA8B,UAAU;AAAA,MACxC,EAAE,SAAS,uCAAuC,GAAG,QAAQ,YAAY;AAAA,MACzE;AAAA,IACF;AAAA,EACF,WAAW,QAAQ,wBAAwB;AACzC,UAAM,yBAAyB,MAAM,IAAI;AAAA,EAC3C;AAEA,SAAO;AAAA,IACL;AAAA,IACA,iBAAiB,YAAY;AAAA,IAC7B,aAAa,YAAY;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;","names":[]}