@remnic/core 9.69.36 → 9.69.37

package/dist/{chunk-ZTG4P7NZ.js → chunk-3IXB77DA.js}

@@ -6,23 +6,23 @@ import {
   loadSyncState,
   syncWearableSource,
   wearableSourceLabel
-} from "./chunk-YXLUTALO.js";
+} from "./chunk-SAKA6PPL.js";
+import {
+  runPeerProfileReasoner
+} from "./chunk-I74SUMNI.js";
 import {
   CompressionGuidelineCoordinator
 } from "./chunk-UXREWVW4.js";
 import {
   ActivityStore,
   MaintenanceScheduler
-} from "./chunk-2BQ4ZIWC.js";
-import {
-  runPeerProfileReasoner
-} from "./chunk-I74SUMNI.js";
+} from "./chunk-GNR6YEWZ.js";
 import {
   migrateFromEngram
 } from "./chunk-VZAKYDMJ.js";
 import {
   LcmEngine
-} from "./chunk-A7GQBJP5.js";
+} from "./chunk-2L5FSNPC.js";
 import {
   chunkTranscriptEntries
 } from "./chunk-TECVW3JP.js";
@@ -32,7 +32,7 @@ import {
 import {
   CompoundingEngine,
   defaultTierMigrationCycleBudget
-} from "./chunk-LNDLXMH6.js";
+} from "./chunk-GDDSXVWR.js";
 import {
   SharedContextManager
 } from "./chunk-CARRTDKC.js";
@@ -44,6 +44,12 @@ import {
   applyUtilityRankingRuntimeDelta,
   loadUtilityRuntimeValues
 } from "./chunk-SWIKABKI.js";
+import {
+  decideTierTransition
+} from "./chunk-GCBIXUPT.js";
+import {
+  TmtBuilder
+} from "./chunk-ECZU5BJH.js";
 import {
   extractTopics
 } from "./chunk-KVDUKH5E.js";
@@ -56,12 +62,6 @@ import {
 import {
   TierMigrationExecutor
 } from "./chunk-YRFAYOFQ.js";
-import {
-  decideTierTransition
-} from "./chunk-GCBIXUPT.js";
-import {
-  TmtBuilder
-} from "./chunk-ECZU5BJH.js";
 import {
   buildTargetedFactRecallSection,
   shouldRecallTargetedFactEvidence
@@ -69,6 +69,14 @@ import {
 import {
   SessionObserverState
 } from "./chunk-ODZKV2F7.js";
+import {
+  applyRuntimeRetrievalPolicy
+} from "./chunk-5IZL4DCV.js";
+import {
+  RerankCache,
+  reorderByRankedKeys,
+  rerankLocalOrNoop
+} from "./chunk-LUDXM7MD.js";
 import {
   buildResponseGuidanceRecallSection,
   shouldRecallResponseGuidance
@@ -94,20 +102,12 @@ import {
   recencyWindowFromPrompt,
   resolvePromptTagPrefilterAsync
 } from "./chunk-ZOKZIR5K.js";
-import {
-  applyRuntimeRetrievalPolicy
-} from "./chunk-5IZL4DCV.js";
 import {
   findUnresolvedEntityRefs
 } from "./chunk-X7XN6YU4.js";
 import {
   RelevanceStore
 } from "./chunk-KATEWTQJ.js";
-import {
-  RerankCache,
-  reorderByRankedKeys,
-  rerankLocalOrNoop
-} from "./chunk-LUDXM7MD.js";
 import {
   filterRecentScanMemoriesForStateView,
   indexStateViewAnnotatedResults,
@@ -143,6 +143,12 @@ import {
 import {
   runLiveConnectorsOnce
 } from "./chunk-YHLWPYHT.js";
+import {
+  classifyMemoryKind
+} from "./chunk-YAZNBMNF.js";
+import {
+  scoreEvidencePathDetail
+} from "./chunk-XXSOVESA.js";
 import {
   deriveHarmonicRecords,
   harmonicEntityReferenceMatches,
@@ -150,18 +156,12 @@ import {
   normalizedHarmonicEntityIdentity,
   persistHarmonicRecords
 } from "./chunk-LS2FHUML.js";
-import {
-  classifyMemoryKind
-} from "./chunk-YAZNBMNF.js";
-import {
-  scoreEvidencePathDetail
-} from "./chunk-XXSOVESA.js";
 import {
   ExtractionEngine
-} from "./chunk-LEMD7WZJ.js";
+} from "./chunk-KUK56OPR.js";
 import {
   parseMemoryActionEligibilityContext
-} from "./chunk-AJTG3CP7.js";
+} from "./chunk-JHU4EYDV.js";
 import {
   buildFocusedListRecallSection,
   shouldRecallFocusedListEvidence
@@ -175,7 +175,7 @@ import {
   getVerdictKind,
   judgeFactDurability,
   validateProcedureExtraction
-} from "./chunk-BNGHPYZU.js";
+} from "./chunk-BLHX5FQW.js";
 import {
   pickFactEventTimeAnchor,
   resolveFactEventTime
@@ -199,7 +199,7 @@ import {
   buildEntityRecallSection,
   entityRecentTranscriptLookbackHours,
   readRecentEntityTranscriptEntries
-} from "./chunk-TKFSXDOB.js";
+} from "./chunk-FLLORID2.js";
 import {
   tryDirectAnswer
 } from "./chunk-VY47VI2T.js";
@@ -208,7 +208,7 @@ import {
 } from "./chunk-LVXBC6YB.js";
 import {
   refreshConvergedNamespaces
-} from "./chunk-DK4X5B6I.js";
+} from "./chunk-TFRDUD3M.js";
 import {
   builtInConnectorPackageSpecifier,
   ensureBuiltInWearableConnectors,
@@ -217,7 +217,7 @@ import {
   runTimelinePublishCli,
   screenCandidateFact,
   summarizeVaultPublish
-} from "./chunk-F6IVBYFS.js";
+} from "./chunk-YIZ2EUUL.js";
 import {
   normalizeReplaySessionKey
 } from "./chunk-AJVLDJU6.js";
@@ -227,30 +227,30 @@ import {
 import {
   compareVerifiedEpisodeResults,
   searchVerifiedEpisodes
-} from "./chunk-PHP3MUGF.js";
+} from "./chunk-UYVXIY6C.js";
 import {
   ThreadingManager
 } from "./chunk-OJP3N7UK.js";
 import {
   compareVerifiedSemanticRuleResults,
   searchVerifiedSemanticRules
-} from "./chunk-GLZH5VEN.js";
+} from "./chunk-76DRU7C4.js";
 import {
   searchWorkProductLedgerEntries
 } from "./chunk-G7NYVKD6.js";
 import {
   TranscriptManager
 } from "./chunk-AM4T6CHX.js";
-import {
-  PolicyRuntimeManager
-} from "./chunk-2LA3H54D.js";
 import {
   runNamespaceMaintenanceFanout,
   summarizeNamespaceMaintenanceHealth
-} from "./chunk-EEBQFG5E.js";
+} from "./chunk-3YMDY3ZF.js";
 import {
   planNamespaceMaintenance
-} from "./chunk-ZBEGS7OB.js";
+} from "./chunk-JPKZTCWZ.js";
+import {
+  PolicyRuntimeManager
+} from "./chunk-2LA3H54D.js";
 import {
   isAboveImportanceThreshold,
   scoreImportance
@@ -279,7 +279,7 @@ import {
   materializeAfterSemanticConsolidation,
   parseConsolidationResponse,
   parseOperatorAwareConsolidationResponse
-} from "./chunk-QBLDCI6E.js";
+} from "./chunk-HHDTBYDJ.js";
 import {
   BoxBuilder
 } from "./chunk-B7RWBZXW.js";
@@ -300,7 +300,7 @@ import {
   detectMeetings,
   embeddingsFromCosineHits,
   normalizeConnectorScope
-} from "./chunk-DVOBLPSQ.js";
+} from "./chunk-D2DIYEFW.js";
 import {
   compileCorrectionRule,
   correctionsFilePath,
@@ -334,7 +334,7 @@ import {
 } from "./chunk-MI2OTWV5.js";
 import {
   MeetingsInputError
-} from "./chunk-OQ7SSRXP.js";
+} from "./chunk-DOKKRZPH.js";
 import {
   WearablesInputError,
   describeErrorForOperator
@@ -349,23 +349,27 @@ import {
 import {
   removeNodeEdgesForRewrite,
   rollbackNodeEdgeRewrite
-} from "./chunk-DGS34QSY.js";
+} from "./chunk-6E5GYDIE.js";
 import {
   NamespaceCatalog
-} from "./chunk-VYXDUPYE.js";
+} from "./chunk-Q7JK6YEB.js";
 import {
   RecallResultFormatter,
   SessionContextCoordinator,
   capturePassiveCorrections,
   clusterByKey,
   detectPassiveCorrections
-} from "./chunk-JHZCXUQI.js";
+} from "./chunk-JLXWRQNR.js";
 import {
   importCapsule
-} from "./chunk-ZHXSOMYH.js";
+} from "./chunk-VVX5PZFS.js";
 import {
   isCodingGraphInstalled
 } from "./chunk-VQ7B2Q6M.js";
+import {
+  listTrustZoneRecords,
+  searchTrustZoneRecords
+} from "./chunk-ROBHL3GL.js";
 import {
   applyTrustScoreStage,
   buildTrustSignalsForRerank,
@@ -373,10 +377,6 @@ import {
   trustResultFor,
   trustResultKey
 } from "./chunk-GNVZQ5JN.js";
-import {
-  listTrustZoneRecords,
-  searchTrustZoneRecords
-} from "./chunk-ROBHL3GL.js";
 import {
   HourlySummarizer
 } from "./chunk-JR6PP7UM.js";
@@ -395,14 +395,14 @@ import {
 } from "./chunk-A5UQ52YQ.js";
 import {
   buildXraySnapshot
-} from "./chunk-5JG5EBVL.js";
+} from "./chunk-4DPDIOVA.js";
 import {
   objectiveStateStoreOverrideForNamespace,
   searchObjectiveStateSnapshots
 } from "./chunk-HM7RHKS4.js";
 import {
   searchHarmonicRetrieval
-} from "./chunk-FVJ4D6L7.js";
+} from "./chunk-JMPYZJQN.js";
 import {
   ProfilingCollector
 } from "./chunk-NLE6TSLG.js";
@@ -432,16 +432,16 @@ import {
 } from "./chunk-BMWN7B3Y.js";
 import {
   NamespaceStorageRouter
-} from "./chunk-RUXPVSML.js";
+} from "./chunk-2AR5JFD7.js";
 import {
   GraphIndex
-} from "./chunk-5FAGCOZD.js";
+} from "./chunk-GWK7FEUL.js";
 import {
   GraphEdgeAppendError
 } from "./chunk-GKCXTSFF.js";
 import {
   buildChainFollowupGenerator
-} from "./chunk-CNV2A557.js";
+} from "./chunk-CYEMS2PG.js";
 import {
   QmdResultResolver,
   StorageManager,
@@ -460,10 +460,7 @@ import {
   reconstructFusionInputs,
   selfDeps,
   serializeFusionDay
-} from "./chunk-5VAF4ID4.js";
-import {
-  buildRetiredFactTombstoneInputs
-} from "./chunk-46WM6JX2.js";
+} from "./chunk-ZEPVWLCN.js";
 import {
   bodyIsEscaped,
   decodeTranscriptBody,
@@ -474,15 +471,18 @@ import {
   saveSpeakerRegistry,
   speakerRegistryKey
 } from "./chunk-UHVXE24Y.js";
+import {
+  buildRetiredFactTombstoneInputs
+} from "./chunk-46WM6JX2.js";
 import {
   NamespaceSearchRouter,
   namespaceCollectionName
-} from "./chunk-Y63ZFP4X.js";
+} from "./chunk-7RKBPXY6.js";
 import {
   createConversationIndexRuntime,
   createSearchBackend,
   isSearchBackendEnabled
-} from "./chunk-JRWW7GM6.js";
+} from "./chunk-Q6D7EUSQ.js";
 import {
   NoopSearchBackend
 } from "./chunk-CYEPCZN5.js";
@@ -496,7 +496,7 @@ import {
 } from "./chunk-S2V7RUCL.js";
 import {
   confidenceTier
-} from "./chunk-4MDKNUV4.js";
+} from "./chunk-RN3MVLW3.js";
 import {
   lintWorkspaceFiles,
   rotateMarkdownFileToArchive
@@ -617,7 +617,7 @@ import {
 } from "./chunk-QDW3E4RD.js";
 import {
   searchCausalTrajectories
-} from "./chunk-B3O3IRZN.js";
+} from "./chunk-LMMQKZK3.js";
 import {
   activityDayWindow,
   assertValidTimezone,
@@ -16947,7 +16947,7 @@ var OrchestratorInitCoordinator = class {
     if (signal.aborted) return;
     if (lifecycleCaps.lifecyclePolicy && resolveQmdCapabilities(this.deps.config).qmdTierMigration) {
       try {
-        const { runFirstStartMigration } = await import("./first-start-migration-L3UFX5CU.js");
+        const { runFirstStartMigration } = await import("./first-start-migration-GZ45G5FS.js");
         const result = await runFirstStartMigration({
           storage: this.deps.storage,
           config: this.deps.config,
@@ -16970,7 +16970,7 @@ var OrchestratorInitCoordinator = class {
     if (signal.aborted) return;
     if (!this.deps.wearablesAutoSyncHandle && this.deps.config.wearables.enabled && this.deps.config.wearables.autoSyncEnabled && Object.values(this.deps.config.wearables.sources).some((source) => source.enabled)) {
       try {
-        const { startWearablesAutoSync } = await import("./auto-sync-4YFATLFQ.js");
+        const { startWearablesAutoSync } = await import("./auto-sync-FSRJDU63.js");
         if (signal.aborted) return;
         this.deps.wearablesAutoSyncHandle = startWearablesAutoSync(
           {
@@ -30429,4 +30429,4 @@ export {
   blendGraphExpandedRecallScore,
   Orchestrator
 };
-//# sourceMappingURL=chunk-ZTG4P7NZ.js.map
+//# sourceMappingURL=chunk-3IXB77DA.js.map

package/dist/{chunk-WHHEPAO3.js → chunk-3K6UFW5B.js}

@@ -7,10 +7,10 @@ import {
 import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
-} from "./chunk-HUT2JR6I.js";
+} from "./chunk-L5OXE4PX.js";
 import {
   StorageManager
-} from "./chunk-5VAF4ID4.js";
+} from "./chunk-ZEPVWLCN.js";
 import {
   normalizeProjectionPreview,
   normalizeProjectionTags
@@ -1005,4 +1005,4 @@ export {
   verifyMemoryProjection,
   repairMemoryProjection
 };
-//# sourceMappingURL=chunk-WHHEPAO3.js.map
+//# sourceMappingURL=chunk-3K6UFW5B.js.map

package/dist/{chunk-UBG4GAEP.js → chunk-3OHISDDW.js}

@@ -30,6 +30,9 @@ var RECONCILE_MANIFEST_FORMAT = "remnic-reconcile-manifest";
 var RECONCILE_MANIFEST_SCHEMA_VERSION = 1;
 var CONTENT_HASH_NORMALIZER_VERSION = 4;
 var IDENTITY_RESOLUTION_VERSION = 2;
+function peerManifestRevision(citationTemplate) {
+  return `schema=${RECONCILE_MANIFEST_SCHEMA_VERSION};normalizer=${CONTENT_HASH_NORMALIZER_VERSION};identity=${IDENTITY_RESOLUTION_VERSION};citation=${citationTemplateFingerprint(citationTemplate)}`;
+}
 var SHA256_PATTERN = /^[a-f0-9]{64}$/i;
 var MEMORY_DIRS = new Set(RECALL_FALLBACK_DIRS);
 function isMemoryPath(filePath) {
@@ -336,6 +339,7 @@ export {
   RECONCILE_MANIFEST_SCHEMA_VERSION,
   CONTENT_HASH_NORMALIZER_VERSION,
   IDENTITY_RESOLUTION_VERSION,
+  peerManifestRevision,
   citationTemplateFingerprint,
   isReconcileMemoryIdentity,
   isCachedIdentityReusable,
@@ -343,4 +347,4 @@ export {
   buildReconcileManifest,
   collapseActiveFactDuplicates
 };
-//# sourceMappingURL=chunk-UBG4GAEP.js.map
+//# sourceMappingURL=chunk-3OHISDDW.js.map

package/dist/chunk-3OHISDDW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/reconcile/manifest.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { computeLegacyContentHash, normalizeLegacyContent } from \"../content-hash.js\";\nimport { inferMemoryStatus } from \"../memory-lifecycle-ledger-utils.js\";\nimport { DEFAULT_CITATION_FORMAT, stripCitationForTemplate } from \"../source-attribution.js\";\nimport { ContentHashIndex, type ContentHashPathEntry } from \"../storage/content-hash-index.js\";\nimport { storedContentIdentityCandidates } from \"../structured-attributes.js\";\nimport type { MemoryFrontmatter, MemoryStatus } from \"../types.js\";\nimport { RECALL_FALLBACK_DIRS } from \"../utils/category-dir.js\";\nimport {\n  type ReconcileFileState,\n  type ReconcilePlan,\n  type ReconcilePlanEntry,\n  type ReconcileSemanticAgreement,\n  type ReconcileSemanticChange,\n  compareReconcilePlanEntries,\n  semanticAgreementKey,\n  summarizeReconcilePlan,\n} from \"./plan.js\";\n\nexport const RECONCILE_MANIFEST_FORMAT = \"remnic-reconcile-manifest\";\nexport const RECONCILE_MANIFEST_SCHEMA_VERSION = 1;\nexport const CONTENT_HASH_NORMALIZER_VERSION = 4;\n/**\n * Version of the identity-resolution LOGIC (alias recovery, candidate\n * ordering), independent of the content normalizer: a cached manifest entry\n * written before an identity-resolution change carries an older value and is\n * reparsed even when its normalizerVersion still matches (issue #2367\n * review round 2). Bump when parsedMemoryIdentity's output shape or\n * semantics change.\n */\nexport const IDENTITY_RESOLUTION_VERSION = 2;\n\n/**\n * Identity of the manifest-affecting implementation this peer builds\n * STREAMED manifests with. Advertised via offline-sync capabilities so the\n * client can key peer-side plan caches on it: a peer that upgrades its\n * normalization logic or citation template without rewriting stored files\n * keeps the same file hashes, and only this revision invalidates the stale\n * cached identities (#2803 / #2956 review).\n */\nexport function peerManifestRevision(citationTemplate?: string): string {\n  return `schema=${RECONCILE_MANIFEST_SCHEMA_VERSION};normalizer=${CONTENT_HASH_NORMALIZER_VERSION};identity=${IDENTITY_RESOLUTION_VERSION};citation=${citationTemplateFingerprint(citationTemplate)}`;\n}\n\nexport interface ReconcileMemoryIdentity {\n  id: string;\n  category: string;\n  contentHash: string;\n  /**\n   * Recovered current-normalizer identities for a record whose persisted hash\n   * is ambiguous under the legacy normalizer (issue #2367). The persisted\n   * hash stays primary; these participate in duplicate bucketing so a\n   * replica carrying the current form of the same fact still collapses.\n   */\n  contentHashAliases?: readonly string[];\n  /** See IDENTITY_RESOLUTION_VERSION; absent on pre-versioning cache entries. */\n  normalizerVersion?: number;\n  identityResolutionVersion?: number;\n  status: MemoryStatus;\n}\n\nexport interface ReconcileManifestFile extends ReconcileFileState {\n  memory?: ReconcileMemoryIdentity;\n  /** Present on sha-only (negative) entries so an upgrade re-parses them. */\n  normalizerVersion?: number;\n  identityResolutionVersion?: number;\n}\n\ntype ActiveFactManifestFile = ReconcileManifestFile & { memory: ReconcileMemoryIdentity };\n\nexport interface ReconcileManifest {\n  format: typeof RECONCILE_MANIFEST_FORMAT;\n  schemaVersion: typeof RECONCILE_MANIFEST_SCHEMA_VERSION;\n  files: ReconcileManifestFile[];\n}\n\nexport type ReconcileMemoryParser = (raw: string) => { frontmatter: MemoryFrontmatter; content: string } | null;\n\nexport interface BuildReconcileManifestOptions {\n  files: Iterable<ReconcileFileState>;\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>;\n  parseMemory: ReconcileMemoryParser;\n  cachedFiles?: Iterable<ReconcileManifestFile>;\n  citationTemplate?: string;\n}\n\nconst SHA256_PATTERN = /^[a-f0-9]{64}$/i;\nconst MEMORY_DIRS = new Set(RECALL_FALLBACK_DIRS);\n\nfunction isMemoryPath(filePath: string): boolean {\n  if (!filePath.endsWith(\".md\")) return false;\n  const segments = filePath.split(\"/\");\n  let index = 0;\n  if (segments[index] === \"cold\" || segments[index] === \"archive\") index += 1;\n  return MEMORY_DIRS.has(segments[index] ?? \"\");\n}\n\nfunction parsedMemoryIdentity(\n  filePath: string,\n  raw: Buffer | string,\n  parseMemory: ReconcileMemoryParser,\n  citationTemplate: string\n): ReconcileMemoryIdentity | undefined {\n  if (!isMemoryPath(filePath)) return undefined;\n  const parsed = parseMemory(Buffer.isBuffer(raw) ? raw.toString(\"utf8\") : raw);\n  if (!parsed?.frontmatter.id) return undefined;\n\n  const storedHash =\n    parsed.frontmatter.contentHash && SHA256_PATTERN.test(parsed.frontmatter.contentHash)\n      ? parsed.frontmatter.contentHash.toLowerCase()\n      : undefined;\n  const candidates = storedContentIdentityCandidates(parsed.content, (content) =>\n    stripCitationForTemplate(content, citationTemplate)\n  );\n  const bodyHash = ContentHashIndex.computeHash(candidates[0] ?? \"\");\n  const currentMatch = candidates.find((content) => ContentHashIndex.computeHash(content) === storedHash);\n  const legacyMatch = [...candidates].reverse().find((content) => computeLegacyContentHash(content) === storedHash);\n  let contentHash: string;\n  let contentHashAliases: string[] | undefined;\n  if (currentMatch) {\n    contentHash = ContentHashIndex.computeHash(currentMatch);\n  } else if (legacyMatch && normalizeLegacyContent(legacyMatch).length > 0) {\n    // A non-empty legacy equality is ambiguous (issue #2367): the persisted\n    // hash may be an explicit contentHashSource identity that merely collides\n    // with the body's ASCII skeleton under the lossy legacy normalizer, and\n    // nothing in the record proves which it is. Keep the persisted hash as\n    // the primary identity and expose the recovered current identity as an\n    // alias so replicas carrying either form still collapse.\n    contentHash = storedHash ?? bodyHash;\n    const recovered = ContentHashIndex.computeHash(legacyMatch);\n    if (recovered !== contentHash) contentHashAliases = [recovered];\n  } else {\n    // An EMPTY legacy skeleton identifies nothing (every non-ASCII body maps\n    // to it), so preserving it would collapse unrelated records. Recovering\n    // the current identity here is repair, not replacement.\n    contentHash = legacyMatch ? ContentHashIndex.computeHash(legacyMatch) : (storedHash ?? bodyHash);\n  }\n\n  return {\n    id: parsed.frontmatter.id,\n    category: parsed.frontmatter.category,\n    contentHash,\n    ...(contentHashAliases ? { contentHashAliases } : {}),\n    normalizerVersion: CONTENT_HASH_NORMALIZER_VERSION,\n    identityResolutionVersion: IDENTITY_RESOLUTION_VERSION,\n    status: inferMemoryStatus(parsed.frontmatter, filePath),\n  };\n}\n\n/**\n * Stable fingerprint of the citation template that `parsedMemoryIdentity` uses\n * to strip inline attribution before hashing. A persisted identity cache is\n * only reusable while this matches: identical file content under a different\n * template yields a different `contentHash`, which would silently change\n * duplicate and conflict decisions on a warm plan.\n */\nexport function citationTemplateFingerprint(citationTemplate?: string): string {\n  return createHash(\"sha256\")\n    .update(citationTemplate ?? DEFAULT_CITATION_FORMAT)\n    .digest(\"hex\")\n    .slice(0, 16);\n}\n\n/**\n * Structural guard for identities read back from an on-disk cache. A cache file\n * is untrusted JSON: without this an entry carrying `memory: null` survives the\n * loader's cast and then throws when the hit path dereferences\n * `memory.normalizerVersion`, aborting a manifest build that should instead\n * fall back to a cold parse.\n */\nexport function isReconcileMemoryIdentity(value: unknown): value is ReconcileMemoryIdentity {\n  if (!value || typeof value !== \"object\" || Array.isArray(value)) return false;\n  const memory = value as Record<string, unknown>;\n  if (typeof memory.id !== \"string\") return false;\n  if (typeof memory.category !== \"string\") return false;\n  if (typeof memory.contentHash !== \"string\" || !SHA256_PATTERN.test(memory.contentHash)) return false;\n  if (typeof memory.status !== \"string\") return false;\n  if (memory.normalizerVersion !== undefined && typeof memory.normalizerVersion !== \"number\") return false;\n  if (memory.identityResolutionVersion !== undefined && typeof memory.identityResolutionVersion !== \"number\") {\n    return false;\n  }\n  if (\n    memory.contentHashAliases !== undefined &&\n    (!Array.isArray(memory.contentHashAliases) ||\n      memory.contentHashAliases.some((alias) => typeof alias !== \"string\" || !SHA256_PATTERN.test(alias)))\n  ) {\n    return false;\n  }\n  return true;\n}\n\n/** A cache hit is valid only when the entry was built by the current parser.\n * Positive hits carry versions on `memory`; sha-only negatives stamp the same\n * versions on the entry itself. Unversioned negatives are pre-upgrade leftovers\n * and must miss so a newer parser can recognize an identity it previously skipped. */\nexport function isCachedIdentityReusable(cached: ReconcileManifestFile): boolean {\n  if (cached.memory !== undefined) {\n    return (\n      cached.memory.normalizerVersion === CONTENT_HASH_NORMALIZER_VERSION &&\n      cached.memory.identityResolutionVersion === IDENTITY_RESOLUTION_VERSION\n    );\n  }\n  return (\n    cached.normalizerVersion === CONTENT_HASH_NORMALIZER_VERSION &&\n    cached.identityResolutionVersion === IDENTITY_RESOLUTION_VERSION\n  );\n}\n\nexport async function buildReconcileManifestFile(\n  file: ReconcileFileState,\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>,\n  parseMemory: ReconcileMemoryParser,\n  citationTemplate = DEFAULT_CITATION_FORMAT\n): Promise<ReconcileManifestFile> {\n  let raw: Buffer | string | null = null;\n  let readFailed = false;\n  if (isMemoryPath(file.path)) {\n    try {\n      raw = await readFile(file);\n    } catch {\n      readFailed = true;\n      raw = null;\n    }\n  }\n  if (raw !== null && createHash(\"sha256\").update(raw).digest(\"hex\") !== file.sha256.toLowerCase()) {\n    raw = null;\n  }\n  const memory = raw === null ? undefined : parsedMemoryIdentity(file.path, raw, parseMemory, citationTemplate);\n  // A thrown read is not a negative identity. Stamping versions here would\n  // make the next warm cycle treat the failure as \"this file has no id\".\n  if (readFailed) return { ...file };\n  return {\n    ...file,\n    ...(memory\n      ? { memory }\n      : {\n          normalizerVersion: CONTENT_HASH_NORMALIZER_VERSION,\n          identityResolutionVersion: IDENTITY_RESOLUTION_VERSION,\n        }),\n  };\n}\n\n/** Read-batch size for manifest builds. Uncached files are independent (a\n * per-file read + sha256 + frontmatter parse); processing them in bounded\n * batches amortizes the per-file promise/async-hook overhead that dominates\n * boot-scale corpus builds (measured: ~66% of CPU in async_hooks._propagate +\n * GC at ~100k files) and overlaps IO waits, while the bound keeps memory flat.\n * Order is preserved: results land in input order regardless of completion\n * order, so the manifest output is byte-identical to the sequential form. */\nconst MANIFEST_BUILD_BATCH_SIZE = 50;\n\nexport async function buildReconcileManifest(options: BuildReconcileManifestOptions): Promise<ReconcileManifest> {\n  const cachedByPath = new Map<string, ReconcileManifestFile>();\n  for (const cached of options.cachedFiles ?? []) {\n    cachedByPath.set(cached.path, cached);\n  }\n\n  const allFiles = [...options.files];\n  // Every result — cache hit or rebuild — is stored at its own input index.\n  // Pushing hits onto a dense array while rebuilds are assigned by index\n  // silently drops entries whenever a miss precedes a hit: the rebuild lands\n  // on the slot the hit already occupied.\n  const files: ReconcileManifestFile[] = new Array(allFiles.length);\n  // Cache hits stay on a synchronous fast path (no promise allocation, no\n  // Promise.all — a fully-cached rebuild must not regress); only the uncached\n  // entries ride the bounded batches.\n  const uncached: Array<{ index: number; file: ReconcileFileState }> = [];\n  for (let i = 0; i < allFiles.length; i += 1) {\n    const file = allFiles[i]!;\n    const cached = cachedByPath.get(file.path);\n    if (\n      cached !== undefined &&\n      cached.sha256.toLowerCase() === file.sha256.toLowerCase() &&\n      isCachedIdentityReusable(cached)\n    ) {\n      files[i] = {\n        ...file,\n        ...(cached.memory\n          ? { memory: cached.memory }\n          : {\n              normalizerVersion: cached.normalizerVersion,\n              identityResolutionVersion: cached.identityResolutionVersion,\n            }),\n      };\n    } else {\n      uncached.push({ index: i, file });\n    }\n  }\n  for (let i = 0; i < uncached.length; i += MANIFEST_BUILD_BATCH_SIZE) {\n    const batch = uncached.slice(i, i + MANIFEST_BUILD_BATCH_SIZE);\n    const results = await Promise.all(\n      batch.map(({ file }) =>\n        buildReconcileManifestFile(file, options.readFile, options.parseMemory, options.citationTemplate)\n      )\n    );\n    for (let j = 0; j < batch.length; j += 1) {\n      files[batch[j]!.index] = results[j]!;\n    }\n  }\n  files.sort((left, right) => (left.path < right.path ? -1 : left.path > right.path ? 1 : 0));\n  return {\n    format: RECONCILE_MANIFEST_FORMAT,\n    schemaVersion: RECONCILE_MANIFEST_SCHEMA_VERSION,\n    files,\n  };\n}\n\nfunction activeFactByPath(manifest: ReconcileManifest | undefined): Map<string, ActiveFactManifestFile> {\n  const result = new Map<string, ActiveFactManifestFile>();\n  for (const file of manifest?.files ?? []) {\n    if (file.memory?.category === \"fact\" && file.memory.status === \"active\") {\n      result.set(file.path, file as ActiveFactManifestFile);\n    }\n  }\n  return result;\n}\n\nfunction memoryIdentityHashes(memory: ReconcileMemoryIdentity): string[] {\n  return [memory.contentHash, ...(memory.contentHashAliases ?? [])];\n}\n\nfunction contentHashRows(files: Iterable<ActiveFactManifestFile>, contentHash: string): ContentHashPathEntry[] {\n  const rows: ContentHashPathEntry[] = [];\n  for (const file of files) {\n    rows.push({ path: file.path, contentHash });\n  }\n  return rows;\n}\n\nfunction classifySemanticChange(\n  current: ReconcileSemanticAgreement,\n  prior: ReconcileSemanticAgreement | undefined\n): ReconcileSemanticChange {\n  if (!prior) return \"unchanged\";\n  const localChanged = current.local.sha256 !== prior.local.sha256;\n  const peerChanged = current.peer.sha256 !== prior.peer.sha256;\n  if (localChanged && peerChanged) return \"both_modified\";\n  if (localChanged) return \"local_changed\";\n  if (peerChanged) return \"peer_changed\";\n  return \"unchanged\";\n}\n\nexport function collapseActiveFactDuplicates(\n  plan: ReconcilePlan,\n  localManifests: ReadonlyMap<string, ReconcileManifest>,\n  peerManifests: ReadonlyMap<string, ReconcileManifest>,\n  priorSemanticAgreements?: ReadonlyMap<string, readonly ReconcileSemanticAgreement[]>\n): ReconcilePlan {\n  const entriesByNamespace = new Map<string, ReconcilePlanEntry[]>();\n  for (const entry of plan.entries) {\n    const entries = entriesByNamespace.get(entry.namespace) ?? [];\n    entries.push({ ...entry });\n    entriesByNamespace.set(entry.namespace, entries);\n  }\n\n  let changed = false;\n  for (const namespace of new Set([...localManifests.keys(), ...peerManifests.keys()])) {\n    const entries = entriesByNamespace.get(namespace) ?? [];\n    const localManifest = localManifests.get(namespace);\n    const peerManifest = peerManifests.get(namespace);\n    const localByPath = activeFactByPath(localManifest);\n    const peerByPath = activeFactByPath(peerManifest);\n    const localFilesByPath = new Map((localManifest?.files ?? []).map((file) => [file.path, file]));\n    const peerFilesByPath = new Map((peerManifest?.files ?? []).map((file) => [file.path, file]));\n    const priorSemanticByPathPair = new Map(\n      (priorSemanticAgreements?.get(namespace) ?? []).map((agreement) => [semanticAgreementKey(agreement), agreement])\n    );\n    const localByHash = new Map<string, ActiveFactManifestFile[]>();\n    const peerByHash = new Map<string, ActiveFactManifestFile[]>();\n\n    for (const file of localByPath.values()) {\n      for (const hash of memoryIdentityHashes(file.memory)) {\n        const bucket = localByHash.get(hash) ?? [];\n        bucket.push(file);\n        localByHash.set(hash, bucket);\n      }\n    }\n    for (const file of peerByPath.values()) {\n      for (const hash of memoryIdentityHashes(file.memory)) {\n        const bucket = peerByHash.get(hash) ?? [];\n        bucket.push(file);\n        peerByHash.set(hash, bucket);\n      }\n    }\n\n    const removed = new Set<ReconcilePlanEntry>();\n    const replacements: ReconcilePlanEntry[] = [];\n    const processedPathPairs = new Set<string>();\n    for (const hash of new Set([...localByHash.keys(), ...peerByHash.keys()])) {\n      const localCandidates = (localByHash.get(hash) ?? []).filter((file) => {\n        const opposite = peerFilesByPath.get(file.path);\n        const activeOpposite = peerByPath.get(file.path);\n        return (\n          opposite === undefined ||\n          (activeOpposite !== undefined && memoryIdentityHashes(activeOpposite.memory).includes(hash))\n        );\n      });\n      const peerCandidates = (peerByHash.get(hash) ?? []).filter((file) => {\n        const opposite = localFilesByPath.get(file.path);\n        const activeOpposite = localByPath.get(file.path);\n        return (\n          opposite === undefined ||\n          (activeOpposite !== undefined && memoryIdentityHashes(activeOpposite.memory).includes(hash))\n        );\n      });\n      const localPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(localCandidates, hash));\n      const peerPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(peerCandidates, hash));\n\n      if (localPath && peerPath && localPath !== peerPath) {\n        const pathPair = `${localPath}\\0${peerPath}`;\n        if (processedPathPairs.has(pathPair)) continue;\n        processedPathPairs.add(pathPair);\n        const localFile = localByPath.get(localPath);\n        const peerFile = peerByPath.get(peerPath);\n        if (!localFile || !peerFile) continue;\n        const duplicatePaths = new Set([\n          ...localCandidates.map((file) => file.path),\n          ...peerCandidates.map((file) => file.path),\n        ]);\n        const authoritativeSamePathEntries = new Set(\n          entries.filter(\n            (entry) =>\n              duplicatePaths.has(entry.path) &&\n              localFilesByPath.has(entry.path) &&\n              peerFilesByPath.has(entry.path) &&\n              entry.action !== \"identical\"\n          )\n        );\n        if (authoritativeSamePathEntries.size > 0) {\n          for (const entry of entries) {\n            if (\n              duplicatePaths.has(entry.path) &&\n              !authoritativeSamePathEntries.has(entry) &&\n              (entry.action === \"pull\" || entry.action === \"push\" || entry.action === \"identical\")\n            ) {\n              removed.add(entry);\n              changed = true;\n            }\n          }\n          continue;\n        }\n        const unsafeEntry = entries.some(\n          (entry) => duplicatePaths.has(entry.path) && (entry.action === \"suppress\" || entry.action === \"conflict\")\n        );\n        if (unsafeEntry) continue;\n        for (const entry of entries) {\n          if (\n            duplicatePaths.has(entry.path) &&\n            (entry.action === \"pull\" || entry.action === \"push\" || entry.action === \"identical\")\n          ) {\n            removed.add(entry);\n          }\n        }\n        const semanticAgreement: ReconcileSemanticAgreement = {\n          local: { path: localPath, sha256: localFile.sha256 },\n          peer: { path: peerPath, sha256: peerFile.sha256 },\n        };\n        replacements.push({\n          path: localPath < peerPath ? localPath : peerPath,\n          namespace,\n          action: \"identical\",\n          reason: \"semantic_duplicate\",\n          semanticAgreement,\n          semanticChange: classifySemanticChange(\n            semanticAgreement,\n            priorSemanticByPathPair.get(semanticAgreementKey(semanticAgreement))\n          ),\n        });\n        changed = true;\n        continue;\n      }\n\n      const sameSideEntries = entries.filter((entry) => {\n        if (localPath && entry.reason === \"local_only\") {\n          return localCandidates.some((file) => file.path === entry.path);\n        }\n        if (peerPath && entry.reason === \"peer_only\") {\n          return peerCandidates.some((file) => file.path === entry.path);\n        }\n        return false;\n      });\n      const canonicalPath = localPath ?? peerPath;\n      const hasSharedCanonical = localPath !== undefined && localPath === peerPath;\n      if (!canonicalPath || sameSideEntries.length === 0 || (!hasSharedCanonical && sameSideEntries.length < 2)) {\n        continue;\n      }\n      for (const entry of sameSideEntries) {\n        if (entry.path !== canonicalPath) {\n          removed.add(entry);\n          changed = true;\n        }\n      }\n    }\n\n    if (removed.size > 0 || replacements.length > 0) {\n      entriesByNamespace.set(\n        namespace,\n        [...entries.filter((entry) => !removed.has(entry)), ...replacements].sort(compareReconcilePlanEntries)\n      );\n    }\n  }\n\n  if (!changed) return plan;\n  const entries = [...entriesByNamespace.values()].flat().sort(compareReconcilePlanEntries);\n  return {\n    entries,\n    byNamespace: summarizeReconcilePlan(entries),\n    converged: entries.every((entry) => entry.action === \"identical\"),\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,kBAAkB;AAmBpB,IAAM,4BAA4B;AAClC,IAAM,oCAAoC;AAC1C,IAAM,kCAAkC;AASxC,IAAM,8BAA8B;AAUpC,SAAS,qBAAqB,kBAAmC;AACtE,SAAO,UAAU,iCAAiC,eAAe,+BAA+B,aAAa,2BAA2B,aAAa,4BAA4B,gBAAgB,CAAC;AACpM;AA4CA,IAAM,iBAAiB;AACvB,IAAM,cAAc,IAAI,IAAI,oBAAoB;AAEhD,SAAS,aAAa,UAA2B;AAC/C,MAAI,CAAC,SAAS,SAAS,KAAK,EAAG,QAAO;AACtC,QAAM,WAAW,SAAS,MAAM,GAAG;AACnC,MAAI,QAAQ;AACZ,MAAI,SAAS,KAAK,MAAM,UAAU,SAAS,KAAK,MAAM,UAAW,UAAS;AAC1E,SAAO,YAAY,IAAI,SAAS,KAAK,KAAK,EAAE;AAC9C;AAEA,SAAS,qBACP,UACA,KACA,aACA,kBACqC;AACrC,MAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AACpC,QAAM,SAAS,YAAY,OAAO,SAAS,GAAG,IAAI,IAAI,SAAS,MAAM,IAAI,GAAG;AAC5E,MAAI,CAAC,QAAQ,YAAY,GAAI,QAAO;AAEpC,QAAM,aACJ,OAAO,YAAY,eAAe,eAAe,KAAK,OAAO,YAAY,WAAW,IAChF,OAAO,YAAY,YAAY,YAAY,IAC3C;AACN,QAAM,aAAa;AAAA,IAAgC,OAAO;AAAA,IAAS,CAAC,YAClE,yBAAyB,SAAS,gBAAgB;AAAA,EACpD;AACA,QAAM,WAAW,iBAAiB,YAAY,WAAW,CAAC,KAAK,EAAE;AACjE,QAAM,eAAe,WAAW,KAAK,CAAC,YAAY,iBAAiB,YAAY,OAAO,MAAM,UAAU;AACtG,QAAM,cAAc,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE,KAAK,CAAC,YAAY,yBAAyB,OAAO,MAAM,UAAU;AAChH,MAAI;AACJ,MAAI;AACJ,MAAI,cAAc;AAChB,kBAAc,iBAAiB,YAAY,YAAY;AAAA,EACzD,WAAW,eAAe,uBAAuB,WAAW,EAAE,SAAS,GAAG;AAOxE,kBAAc,cAAc;AAC5B,UAAM,YAAY,iBAAiB,YAAY,WAAW;AAC1D,QAAI,cAAc,YAAa,sBAAqB,CAAC,SAAS;AAAA,EAChE,OAAO;AAIL,kBAAc,cAAc,iBAAiB,YAAY,WAAW,IAAK,cAAc;AAAA,EACzF;AAEA,SAAO;AAAA,IACL,IAAI,OAAO,YAAY;AAAA,IACvB,UAAU,OAAO,YAAY;AAAA,IAC7B;AAAA,IACA,GAAI,qBAAqB,EAAE,mBAAmB,IAAI,CAAC;AAAA,IACnD,mBAAmB;AAAA,IACnB,2BAA2B;AAAA,IAC3B,QAAQ,kBAAkB,OAAO,aAAa,QAAQ;AAAA,EACxD;AACF;AASO,SAAS,4BAA4B,kBAAmC;AAC7E,SAAO,WAAW,QAAQ,EACvB,OAAO,oBAAoB,uBAAuB,EAClD,OAAO,KAAK,EACZ,MAAM,GAAG,EAAE;AAChB;AASO,SAAS,0BAA0B,OAAkD;AAC1F,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,QAAM,SAAS;AACf,MAAI,OAAO,OAAO,OAAO,SAAU,QAAO;AAC1C,MAAI,OAAO,OAAO,aAAa,SAAU,QAAO;AAChD,MAAI,OAAO,OAAO,gBAAgB,YAAY,CAAC,eAAe,KAAK,OAAO,WAAW,EAAG,QAAO;AAC/F,MAAI,OAAO,OAAO,WAAW,SAAU,QAAO;AAC9C,MAAI,OAAO,sBAAsB,UAAa,OAAO,OAAO,sBAAsB,SAAU,QAAO;AACnG,MAAI,OAAO,8BAA8B,UAAa,OAAO,OAAO,8BAA8B,UAAU;AAC1G,WAAO;AAAA,EACT;AACA,MACE,OAAO,uBAAuB,WAC7B,CAAC,MAAM,QAAQ,OAAO,kBAAkB,KACvC,OAAO,mBAAmB,KAAK,CAAC,UAAU,OAAO,UAAU,YAAY,CAAC,eAAe,KAAK,KAAK,CAAC,IACpG;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAMO,SAAS,yBAAyB,QAAwC;AAC/E,MAAI,OAAO,WAAW,QAAW;AAC/B,WACE,OAAO,OAAO,sBAAsB,mCACpC,OAAO,OAAO,8BAA8B;AAAA,EAEhD;AACA,SACE,OAAO,sBAAsB,mCAC7B,OAAO,8BAA8B;AAEzC;AAEA,eAAsB,2BACpB,MACA,UACA,aACA,mBAAmB,yBACa;AAChC,MAAI,MAA8B;AAClC,MAAI,aAAa;AACjB,MAAI,aAAa,KAAK,IAAI,GAAG;AAC3B,QAAI;AACF,YAAM,MAAM,SAAS,IAAI;AAAA,IAC3B,QAAQ;AACN,mBAAa;AACb,YAAM;AAAA,IACR;AAAA,EACF;AACA,MAAI,QAAQ,QAAQ,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,MAAM,KAAK,OAAO,YAAY,GAAG;AAChG,UAAM;AAAA,EACR;AACA,QAAM,SAAS,QAAQ,OAAO,SAAY,qBAAqB,KAAK,MAAM,KAAK,aAAa,gBAAgB;AAG5G,MAAI,WAAY,QAAO,EAAE,GAAG,KAAK;AACjC,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAI,SACA,EAAE,OAAO,IACT;AAAA,MACE,mBAAmB;AAAA,MACnB,2BAA2B;AAAA,IAC7B;AAAA,EACN;AACF;AASA,IAAM,4BAA4B;AAElC,eAAsB,uBAAuB,SAAoE;AAC/G,QAAM,eAAe,oBAAI,IAAmC;AAC5D,aAAW,UAAU,QAAQ,eAAe,CAAC,GAAG;AAC9C,iBAAa,IAAI,OAAO,MAAM,MAAM;AAAA,EACtC;AAEA,QAAM,WAAW,CAAC,GAAG,QAAQ,KAAK;AAKlC,QAAM,QAAiC,IAAI,MAAM,SAAS,MAAM;AAIhE,QAAM,WAA+D,CAAC;AACtE,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,UAAM,OAAO,SAAS,CAAC;AACvB,UAAM,SAAS,aAAa,IAAI,KAAK,IAAI;AACzC,QACE,WAAW,UACX,OAAO,OAAO,YAAY,MAAM,KAAK,OAAO,YAAY,KACxD,yBAAyB,MAAM,GAC/B;AACA,YAAM,CAAC,IAAI;AAAA,QACT,GAAG;AAAA,QACH,GAAI,OAAO,SACP,EAAE,QAAQ,OAAO,OAAO,IACxB;AAAA,UACE,mBAAmB,OAAO;AAAA,UAC1B,2BAA2B,OAAO;AAAA,QACpC;AAAA,MACN;AAAA,IACF,OAAO;AACL,eAAS,KAAK,EAAE,OAAO,GAAG,KAAK,CAAC;AAAA,IAClC;AAAA,EACF;AACA,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,2BAA2B;AACnE,UAAM,QAAQ,SAAS,MAAM,GAAG,IAAI,yBAAyB;AAC7D,UAAM,UAAU,MAAM,QAAQ;AAAA,MAC5B,MAAM;AAAA,QAAI,CAAC,EAAE,KAAK,MAChB,2BAA2B,MAAM,QAAQ,UAAU,QAAQ,aAAa,QAAQ,gBAAgB;AAAA,MAClG;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACxC,YAAM,MAAM,CAAC,EAAG,KAAK,IAAI,QAAQ,CAAC;AAAA,IACpC;AAAA,EACF;AACA,QAAM,KAAK,CAAC,MAAM,UAAW,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI,CAAE;AAC1F,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,eAAe;AAAA,IACf;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,UAA8E;AACtG,QAAM,SAAS,oBAAI,IAAoC;AACvD,aAAW,QAAQ,UAAU,SAAS,CAAC,GAAG;AACxC,QAAI,KAAK,QAAQ,aAAa,UAAU,KAAK,OAAO,WAAW,UAAU;AACvE,aAAO,IAAI,KAAK,MAAM,IAA8B;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,QAA2C;AACvE,SAAO,CAAC,OAAO,aAAa,GAAI,OAAO,sBAAsB,CAAC,CAAE;AAClE;AAEA,SAAS,gBAAgB,OAAyC,aAA6C;AAC7G,QAAM,OAA+B,CAAC;AACtC,aAAW,QAAQ,OAAO;AACxB,SAAK,KAAK,EAAE,MAAM,KAAK,MAAM,YAAY,CAAC;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,uBACP,SACA,OACyB;AACzB,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,eAAe,QAAQ,MAAM,WAAW,MAAM,MAAM;AAC1D,QAAM,cAAc,QAAQ,KAAK,WAAW,MAAM,KAAK;AACvD,MAAI,gBAAgB,YAAa,QAAO;AACxC,MAAI,aAAc,QAAO;AACzB,MAAI,YAAa,QAAO;AACxB,SAAO;AACT;AAEO,SAAS,6BACd,MACA,gBACA,eACA,yBACe;AACf,QAAM,qBAAqB,oBAAI,IAAkC;AACjE,aAAW,SAAS,KAAK,SAAS;AAChC,UAAMA,WAAU,mBAAmB,IAAI,MAAM,SAAS,KAAK,CAAC;AAC5D,IAAAA,SAAQ,KAAK,EAAE,GAAG,MAAM,CAAC;AACzB,uBAAmB,IAAI,MAAM,WAAWA,QAAO;AAAA,EACjD;AAEA,MAAI,UAAU;AACd,aAAW,aAAa,oBAAI,IAAI,CAAC,GAAG,eAAe,KAAK,GAAG,GAAG,cAAc,KAAK,CAAC,CAAC,GAAG;AACpF,UAAMA,WAAU,mBAAmB,IAAI,SAAS,KAAK,CAAC;AACtD,UAAM,gBAAgB,eAAe,IAAI,SAAS;AAClD,UAAM,eAAe,cAAc,IAAI,SAAS;AAChD,UAAM,cAAc,iBAAiB,aAAa;AAClD,UAAM,aAAa,iBAAiB,YAAY;AAChD,UAAM,mBAAmB,IAAI,KAAK,eAAe,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAC9F,UAAM,kBAAkB,IAAI,KAAK,cAAc,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAC5F,UAAM,0BAA0B,IAAI;AAAA,OACjC,yBAAyB,IAAI,SAAS,KAAK,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,qBAAqB,SAAS,GAAG,SAAS,CAAC;AAAA,IACjH;AACA,UAAM,cAAc,oBAAI,IAAsC;AAC9D,UAAM,aAAa,oBAAI,IAAsC;AAE7D,eAAW,QAAQ,YAAY,OAAO,GAAG;AACvC,iBAAW,QAAQ,qBAAqB,KAAK,MAAM,GAAG;AACpD,cAAM,SAAS,YAAY,IAAI,IAAI,KAAK,CAAC;AACzC,eAAO,KAAK,IAAI;AAChB,oBAAY,IAAI,MAAM,MAAM;AAAA,MAC9B;AAAA,IACF;AACA,eAAW,QAAQ,WAAW,OAAO,GAAG;AACtC,iBAAW,QAAQ,qBAAqB,KAAK,MAAM,GAAG;AACpD,cAAM,SAAS,WAAW,IAAI,IAAI,KAAK,CAAC;AACxC,eAAO,KAAK,IAAI;AAChB,mBAAW,IAAI,MAAM,MAAM;AAAA,MAC7B;AAAA,IACF;AAEA,UAAM,UAAU,oBAAI,IAAwB;AAC5C,UAAM,eAAqC,CAAC;AAC5C,UAAM,qBAAqB,oBAAI,IAAY;AAC3C,eAAW,QAAQ,oBAAI,IAAI,CAAC,GAAG,YAAY,KAAK,GAAG,GAAG,WAAW,KAAK,CAAC,CAAC,GAAG;AACzE,YAAM,mBAAmB,YAAY,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,CAAC,SAAS;AACrE,cAAM,WAAW,gBAAgB,IAAI,KAAK,IAAI;AAC9C,cAAM,iBAAiB,WAAW,IAAI,KAAK,IAAI;AAC/C,eACE,aAAa,UACZ,mBAAmB,UAAa,qBAAqB,eAAe,MAAM,EAAE,SAAS,IAAI;AAAA,MAE9F,CAAC;AACD,YAAM,kBAAkB,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,CAAC,SAAS;AACnE,cAAM,WAAW,iBAAiB,IAAI,KAAK,IAAI;AAC/C,cAAM,iBAAiB,YAAY,IAAI,KAAK,IAAI;AAChD,eACE,aAAa,UACZ,mBAAmB,UAAa,qBAAqB,eAAe,MAAM,EAAE,SAAS,IAAI;AAAA,MAE9F,CAAC;AACD,YAAM,YAAY,iBAAiB,kBAAkB,MAAM,gBAAgB,iBAAiB,IAAI,CAAC;AACjG,YAAM,WAAW,iBAAiB,kBAAkB,MAAM,gBAAgB,gBAAgB,IAAI,CAAC;AAE/F,UAAI,aAAa,YAAY,cAAc,UAAU;AACnD,cAAM,WAAW,GAAG,SAAS,KAAK,QAAQ;AAC1C,YAAI,mBAAmB,IAAI,QAAQ,EAAG;AACtC,2BAAmB,IAAI,QAAQ;AAC/B,cAAM,YAAY,YAAY,IAAI,SAAS;AAC3C,cAAM,WAAW,WAAW,IAAI,QAAQ;AACxC,YAAI,CAAC,aAAa,CAAC,SAAU;AAC7B,cAAM,iBAAiB,oBAAI,IAAI;AAAA,UAC7B,GAAG,gBAAgB,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,UAC1C,GAAG,eAAe,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,QAC3C,CAAC;AACD,cAAM,+BAA+B,IAAI;AAAA,UACvCA,SAAQ;AAAA,YACN,CAAC,UACC,eAAe,IAAI,MAAM,IAAI,KAC7B,iBAAiB,IAAI,MAAM,IAAI,KAC/B,gBAAgB,IAAI,MAAM,IAAI,KAC9B,MAAM,WAAW;AAAA,UACrB;AAAA,QACF;AACA,YAAI,6BAA6B,OAAO,GAAG;AACzC,qBAAW,SAASA,UAAS;AAC3B,gBACE,eAAe,IAAI,MAAM,IAAI,KAC7B,CAAC,6BAA6B,IAAI,KAAK,MACtC,MAAM,WAAW,UAAU,MAAM,WAAW,UAAU,MAAM,WAAW,cACxE;AACA,sBAAQ,IAAI,KAAK;AACjB,wBAAU;AAAA,YACZ;AAAA,UACF;AACA;AAAA,QACF;AACA,cAAM,cAAcA,SAAQ;AAAA,UAC1B,CAAC,UAAU,eAAe,IAAI,MAAM,IAAI,MAAM,MAAM,WAAW,cAAc,MAAM,WAAW;AAAA,QAChG;AACA,YAAI,YAAa;AACjB,mBAAW,SAASA,UAAS;AAC3B,cACE,eAAe,IAAI,MAAM,IAAI,MAC5B,MAAM,WAAW,UAAU,MAAM,WAAW,UAAU,MAAM,WAAW,cACxE;AACA,oBAAQ,IAAI,KAAK;AAAA,UACnB;AAAA,QACF;AACA,cAAM,oBAAgD;AAAA,UACpD,OAAO,EAAE,MAAM,WAAW,QAAQ,UAAU,OAAO;AAAA,UACnD,MAAM,EAAE,MAAM,UAAU,QAAQ,SAAS,OAAO;AAAA,QAClD;AACA,qBAAa,KAAK;AAAA,UAChB,MAAM,YAAY,WAAW,YAAY;AAAA,UACzC;AAAA,UACA,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR;AAAA,UACA,gBAAgB;AAAA,YACd;AAAA,YACA,wBAAwB,IAAI,qBAAqB,iBAAiB,CAAC;AAAA,UACrE;AAAA,QACF,CAAC;AACD,kBAAU;AACV;AAAA,MACF;AAEA,YAAM,kBAAkBA,SAAQ,OAAO,CAAC,UAAU;AAChD,YAAI,aAAa,MAAM,WAAW,cAAc;AAC9C,iBAAO,gBAAgB,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,IAAI;AAAA,QAChE;AACA,YAAI,YAAY,MAAM,WAAW,aAAa;AAC5C,iBAAO,eAAe,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,IAAI;AAAA,QAC/D;AACA,eAAO;AAAA,MACT,CAAC;AACD,YAAM,gBAAgB,aAAa;AACnC,YAAM,qBAAqB,cAAc,UAAa,cAAc;AACpE,UAAI,CAAC,iBAAiB,gBAAgB,WAAW,KAAM,CAAC,sBAAsB,gBAAgB,SAAS,GAAI;AACzG;AAAA,MACF;AACA,iBAAW,SAAS,iBAAiB;AACnC,YAAI,MAAM,SAAS,eAAe;AAChC,kBAAQ,IAAI,KAAK;AACjB,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO,KAAK,aAAa,SAAS,GAAG;AAC/C,yBAAmB;AAAA,QACjB;AAAA,QACA,CAAC,GAAGA,SAAQ,OAAO,CAAC,UAAU,CAAC,QAAQ,IAAI,KAAK,CAAC,GAAG,GAAG,YAAY,EAAE,KAAK,2BAA2B;AAAA,MACvG;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,UAAU,CAAC,GAAG,mBAAmB,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,2BAA2B;AACxF,SAAO;AAAA,IACL;AAAA,IACA,aAAa,uBAAuB,OAAO;AAAA,IAC3C,WAAW,QAAQ,MAAM,CAAC,UAAU,MAAM,WAAW,WAAW;AAAA,EAClE;AACF;","names":["entries"]}

package/dist/chunk-3SL52JKD.js

@@ -0,0 +1,160 @@
+import {
+  validateSpanOffsets
+} from "./chunk-QJ2AX6DU.js";
+import {
+  sliceSpanText
+} from "./chunk-JE26AUX6.js";
+import {
+  stampSpanSource,
+  verifySpanSource
+} from "./chunk-A6CXG5WI.js";
+import {
+  log
+} from "./chunk-3WCASNQZ.js";
+
+// src/extraction-span-materialize.ts
+var SPAN_MAX_SLICE_CHARS = 400;
+var SPAN_MAX_FRAME_WORDS = 15;
+function stripUntrustedFactSpans(facts) {
+  return facts.map((fact) => {
+    if (fact.span === void 0 || fact.span === null) return fact;
+    const { span: _span, ...rest } = fact;
+    return rest;
+  });
+}
+function buildSpanMaterializeTurns(texts) {
+  return texts.map((text) => ({ text, stamp: stampSpanSource(text) }));
+}
+function truncateLocalExtractionConversation(conversation, maxConversationChars) {
+  return conversation.length > maxConversationChars ? `${conversation.slice(0, maxConversationChars)}
+
+[truncated]` : conversation;
+}
+function bindLocalExtractionPrompt(conversation, turns, maxConversationChars, renderedConversation = conversation) {
+  const promptConversation = truncateLocalExtractionConversation(conversation, maxConversationChars);
+  if (conversation.length <= maxConversationChars || !conversation.endsWith(renderedConversation)) {
+    return { promptConversation, spanTurns: buildSpanMaterializeTurns(turns.map((turn) => turn.content)) };
+  }
+  const renderedStart = conversation.length - renderedConversation.length;
+  const limit = maxConversationChars;
+  const texts = [];
+  let pos = 0;
+  for (let index = 0; index < turns.length; index += 1) {
+    const turn = turns[index];
+    if (turn === void 0) {
+      texts.push("");
+      continue;
+    }
+    if (index > 0) pos += 2;
+    const label = turn.extractionContextOnly === true ? `context ${turn.role}` : turn.role;
+    pos += `[${label}] `.length;
+    const absStart = renderedStart + pos;
+    const absEnd = absStart + turn.content.length;
+    texts.push(absEnd > absStart && limit > absStart ? conversation.slice(absStart, Math.min(absEnd, limit)) : "");
+    pos += turn.content.length;
+  }
+  return { promptConversation, spanTurns: buildSpanMaterializeTurns(texts) };
+}
+function factCarriesSpan(fact) {
+  return fact.span !== void 0 && fact.span !== null;
+}
+function materializeFactSpan(fact, turns, mode) {
+  const span = fact.span ?? null;
+  if (span === null) {
+    return { fact, outcome: "fallback" };
+  }
+  const { sourceMessageIndex, charStart, charEnd, frame, sourceHash, sourceLength } = span;
+  const turn = turns[sourceMessageIndex];
+  if (!Number.isInteger(sourceMessageIndex) || sourceMessageIndex < 0 || sourceMessageIndex >= turns.length || turn === void 0) {
+    return { fact: stripSpan(fact), outcome: "fallback" };
+  }
+  const stampCheck = verifySpanSource(turn.text, turn.stamp);
+  if (!stampCheck.ok) {
+    return { fact: stripSpan(fact), outcome: "fallback" };
+  }
+  if (sourceHash !== void 0 && sourceHash !== turn.stamp.hash || sourceLength !== void 0 && sourceLength !== turn.stamp.length) {
+    return { fact: stripSpan(fact), outcome: "fallback" };
+  }
+  const offsetCheck = validateSpanOffsets({ start: charStart, end: charEnd, textLength: turn.text.length });
+  if (!offsetCheck.ok) {
+    return { fact: stripSpan(fact), outcome: "fallback" };
+  }
+  const slice = sliceSpanText({ text: turn.text, start: charStart, end: charEnd });
+  if (slice.length > SPAN_MAX_SLICE_CHARS || slice.trim().length === 0) {
+    return { fact: stripSpan(fact), outcome: "fallback" };
+  }
+  const frameWords = frame.trim().split(/\s+/).filter(Boolean);
+  if (frameWords.length === 0 || frameWords.length > SPAN_MAX_FRAME_WORDS) {
+    return { fact: stripSpan(fact), outcome: "fallback" };
+  }
+  const trimmedFrame = frameWords.join(" ");
+  const materialized = /[:—-]$/.test(trimmedFrame) ? `${trimmedFrame} ${slice}` : `${trimmedFrame}: ${slice}`;
+  if (mode === "on") {
+    return {
+      fact: { ...stripSpan(fact), content: materialized, quote: slice },
+      outcome: "span",
+      materialized
+    };
+  }
+  return { fact: stripSpan(fact), outcome: "span", materialized };
+}
+function spanAgreesWithContent(materialized, content) {
+  const left = materialized.trim();
+  const right = content.trim();
+  return left === right || left.includes(right) || right.includes(left);
+}
+function applyExtractionSpanMaterialization(result, turns, mode) {
+  if (mode === "off") {
+    return { ...result, facts: stripUntrustedFactSpans(result.facts) };
+  }
+  let attempts = 0;
+  let fallbacks = 0;
+  let agreements = 0;
+  const facts = result.facts.flatMap((fact) => {
+    if (!factCarriesSpan(fact)) {
+      return mode === "on" ? [] : [fact];
+    }
+    attempts += 1;
+    const { fact: materialized, outcome, materialized: text } = materializeFactSpan(
+      fact,
+      turns,
+      mode
+    );
+    if (outcome === "fallback") {
+      fallbacks += 1;
+    } else if (mode === "shadow" && text !== void 0) {
+      if (spanAgreesWithContent(text, fact.content)) {
+        agreements += 1;
+      }
+    }
+    return [materialized];
+  });
+  if (mode === "shadow") {
+    log.info(
+      `extraction span-mode shadow: ${agreements}/${attempts} span facts agree with generated content (${fallbacks} span validation fallbacks)`
+    );
+  } else if (fallbacks > 0) {
+    log.info(
+      `extraction span-mode: ${fallbacks}/${attempts} span facts fell back to generated content`
+    );
+  }
+  return { ...result, facts };
+}
+function stripSpan(fact) {
+  const { span: _span, ...rest } = fact;
+  return rest;
+}
+
+export {
+  SPAN_MAX_SLICE_CHARS,
+  SPAN_MAX_FRAME_WORDS,
+  stripUntrustedFactSpans,
+  buildSpanMaterializeTurns,
+  truncateLocalExtractionConversation,
+  bindLocalExtractionPrompt,
+  factCarriesSpan,
+  materializeFactSpan,
+  spanAgreesWithContent,
+  applyExtractionSpanMaterialization
+};
+//# sourceMappingURL=chunk-3SL52JKD.js.map