@remnic/core 10.0.13 → 10.0.15

package/dist/{chunk-375ARKRS.js → chunk-D5SSBCYY.js}

@@ -1,7 +1,14 @@
+import {
+  filterEntityFacts,
+  isQuoteAnchoredClaim,
+  isQuoteAnchoredRelationship,
+  quoteAnchoredEntitySupport,
+  quoteAnchors,
+  tokenPool
+} from "./chunk-77R7BQZ2.js";
 import {
   GROUNDING_AUXILIARY_TOKENS,
   GROUNDING_COPULAR_FORMS,
-  GROUNDING_ENTITY_TYPE_PREFIXES,
   GROUNDING_MIN_COVERAGE,
   GROUNDING_MIN_SHARED_TOKENS,
   GROUNDING_STOPWORDS,
@@ -12,8 +19,10 @@ import {
   groundingTokenSequence,
   hasContradictoryPolarity,
   hasExplicitRoleSubjectToken,
+  isGroundedEntityName,
   isInterrogativeSourceSentence,
   normalizeForExactMatch,
+  normalizedEntityIdentifierTokens,
   normalizedGroundingAlignmentTokenSequence,
   normalizedGroundingTokenSequence,
   sourceSentences,
@@ -22,7 +31,7 @@ import {
   stemToken,
   tokenSequence,
   tokenize
-} from "./chunk-LNH76ZJX.js";
+} from "./chunk-AIYXVWUH.js";
 import {
   anchorTemporalExpressions
 } from "./chunk-VEWZZM3H.js";
@@ -41,7 +50,8 @@ function applyExtractionSourceGrounding(result, sourceText, assertionSourceText
     anchorSource(assertionSourceText),
     anchoredRoleSources,
     options.anchorTemporalExpressions ? anchorSource : void 0,
-    options.spanMode ?? "off"
+    options.spanMode ?? "off",
+    options.anchorTemporalExpressions ? (quote) => anchorSource(options.quoteTransform?.(quote) ?? quote) : void 0
   );
 }
 function groundingCopularClaim(text) {
@@ -242,18 +252,6 @@ function isSourceGrounded(candidate, source, includeInterrogativeSource = false)
   }
   return isSourceGroundedClause(candidate, sourceText, includeInterrogativeSource);
 }
-function normalizedEntityIdentifierTokens(name) {
-  const identifier = normalizeForExactMatch(name).replace(/[-_]+/gu, " ");
-  const tokens = groundingLexemes(identifier).filter(({ token }) => GROUNDING_STOPWORDS[token] !== true).map(({ token }) => stemToken(token, true));
-  return tokens.length > 1 && GROUNDING_ENTITY_TYPE_PREFIXES.has(tokens[0] ?? "") ? tokens.slice(1) : tokens;
-}
-function isGroundedEntityName(name, source) {
-  const nameTokens = normalizedEntityIdentifierTokens(name);
-  return nameTokens.length > 0 && sourceSentences(source).some((sentence) => {
-    const sentenceTokens = groundingLexemes(sentence).filter(({ token }) => GROUNDING_STOPWORDS[token] !== true).map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS));
-    return containsContiguousGroundingTokens(nameTokens, sentenceTokens);
-  });
-}
 function buildEntitySupportSource(name, source) {
   const nameTokens = normalizedEntityIdentifierTokens(name);
   if (nameTokens.length === 0) return "";
@@ -399,6 +397,17 @@ function isGroundedCandidate(candidate, source, assertionSource, includeInterrog
   const requirePredicateSupport = !includeInterrogativeSource && assertionSource !== void 0 && normalizeForExactMatch(assertionSource) !== normalizeForExactMatch(source);
   return clauses.length > 0 && (clauses.every((clause) => hasGroundingAnchor(clause, assertionSource, includeInterrogativeSource, requirePredicateSupport)) || hasAnswerSupport(candidate, source, assertionSource));
 }
+function groundWithinQuoteAnchors(content, anchors, sourceHas) {
+  const anchor = anchors.find((candidate) => isQuoteAnchoredClaim(content, candidate, sourceHas));
+  if (anchor === void 0) return void 0;
+  return {
+    source: anchor.window,
+    assertionSource: void 0,
+    allowRoleNormalization: GROUNDING_ROLE_SUBJECT_TOKENS.has(
+      (groundingTokenSequence(content)[0] ?? "").replace(/^[\u0000\u0001]/u, "")
+    )
+  };
+}
 function buildFactSupportSource(source, supportingSentences) {
   const sentences = sourceSentences(source);
   const selectedIndices = /* @__PURE__ */ new Set();
@@ -436,7 +445,7 @@ function buildProcedureSupportSource(fact, source, factSupportSource) {
     );
   }).join(" ");
 }
-function filterGroundedFact(fact, source, assertionSource, roleAssertionSources, eventTimeNormalizer, spanMode = "off") {
+function filterGroundedFact(fact, source, assertionSource, roleAssertionSources, eventTimeNormalizer, spanMode = "off", anchors, sourceHas) {
   const quote = typeof fact.quote === "string" ? fact.quote : "";
   const materializedPrefix = quote.length > 0 && fact.content.endsWith(quote) && fact.content !== quote ? fact.content.slice(0, fact.content.length - quote.length) : "";
   const embeddedQuote = spanMode === "on" && quote.trim().length > 0 && (materializedPrefix.endsWith(": ") || /[:—-]\s$/.test(materializedPrefix)) ? quote : void 0;
@@ -446,6 +455,7 @@ function filterGroundedFact(fact, source, assertionSource, roleAssertionSources,
   );
   let gateContent = fact.content;
   let factContext = contentContext;
+  let quoteAnchored = false;
   if (!isGroundedCandidate(
     fact.content,
     contentContext.source,
@@ -453,23 +463,29 @@ function filterGroundedFact(fact, source, assertionSource, roleAssertionSources,
     false,
     contentContext.allowRoleNormalization
   )) {
-    if (embeddedQuote === void 0) return void 0;
-    gateContent = embeddedQuote;
-    factContext = selectGroundingContext(
-      gateContent,
-      resolveGroundingContext(gateContent, source, assertionSource, roleAssertionSources)
-    );
-    if (!isGroundedCandidate(
-      gateContent,
-      factContext.source,
-      factContext.assertionSource,
-      false,
-      factContext.allowRoleNormalization
-    )) return void 0;
+    const quoteContext = spanMode === "on" ? void 0 : groundWithinQuoteAnchors(fact.content, anchors, sourceHas);
+    if (quoteContext !== void 0) {
+      factContext = quoteContext;
+      quoteAnchored = true;
+    } else {
+      if (embeddedQuote === void 0) return void 0;
+      gateContent = embeddedQuote;
+      factContext = selectGroundingContext(
+        gateContent,
+        resolveGroundingContext(gateContent, source, assertionSource, roleAssertionSources)
+      );
+      if (!isGroundedCandidate(
+        gateContent,
+        factContext.source,
+        factContext.assertionSource,
+        false,
+        factContext.allowRoleNormalization
+      )) return void 0;
+    }
   }
   const factEventTime = fact.eventTime;
   const groundedFactEventTime = factEventTime === void 0 ? void 0 : eventTimeNormalizer?.(factEventTime) ?? factEventTime;
-  const factSupportingSentences = sourceSentences(factContext.assertionSource ?? factContext.source).filter(
+  const factSupportingSentences = quoteAnchored ? [] : sourceSentences(factContext.assertionSource ?? factContext.source).filter(
     (sentence) => isGroundedCandidate(
       gateContent,
       sentence,
@@ -489,7 +505,7 @@ function filterGroundedFact(fact, source, assertionSource, roleAssertionSources,
   ) ?? factSupportingSentences[0];
   const eventTimeSource = factSupportingSource ?? factContext.source;
   const eventTimeAssertionSource = factSupportingSource === void 0 ? factContext.assertionSource : void 0;
-  const factSupportSource = buildFactSupportSource(
+  const factSupportSource = quoteAnchored ? factContext.source : buildFactSupportSource(
     factContext.assertionSource ?? factContext.source,
     factSupportingSentences
   );
@@ -568,28 +584,12 @@ function filterGroundedFact(fact, source, assertionSource, roleAssertionSources,
     ...groundedEventTime !== void 0 ? { eventTime: groundedEventTime } : {}
   };
 }
-function filterGroundedEntity(entity, source, assertionSource) {
-  if (!isGroundedEntityName(entity.name, source)) return void 0;
-  const entitySource = buildEntitySupportSource(entity.name, source);
-  const entityAssertionSource = assertionSource === void 0 ? void 0 : buildEntitySupportSource(entity.name, assertionSource);
-  const facts = entity.facts.filter(
-    (fact) => isGroundedCandidate(fact, entitySource, entityAssertionSource)
-  );
-  const structuredSections = entity.structuredSections?.flatMap((section) => {
-    const groundedFacts = section.facts.filter(
-      (fact) => isGroundedCandidate(fact, entitySource, entityAssertionSource)
-    );
-    return groundedFacts.length > 0 ? [{ ...section, facts: groundedFacts }] : [];
-  });
-  if (facts.length === 0 && (structuredSections === void 0 || structuredSections.length === 0)) {
-    return void 0;
-  }
-  const { structuredSections: _structuredSections, ...entityWithoutSections } = entity;
-  return {
-    ...entityWithoutSections,
-    facts,
-    ...structuredSections && structuredSections.length > 0 ? { structuredSections } : {}
-  };
+function filterGroundedEntity(entity, source, assertionSource, anchorSupport) {
+  const nameGrounded = isGroundedEntityName(entity.name, source);
+  if (!nameGrounded && anchorSupport === void 0) return void 0;
+  const entitySource = nameGrounded ? buildEntitySupportSource(entity.name, source) : "";
+  const entityAssertionSource = !nameGrounded || assertionSource === void 0 ? void 0 : buildEntitySupportSource(entity.name, assertionSource);
+  return filterEntityFacts(entity, (fact) => nameGrounded && isGroundedCandidate(fact, entitySource, entityAssertionSource) || anchorSupport?.(fact) === true);
 }
 function normalizedEntitySourceText(name) {
   return normalizedEntityIdentifierTokens(name).join(" ");
@@ -764,7 +764,7 @@ function isRoleGroundedCandidate(candidate, source, assertionSource, roleAsserti
     context.allowRoleNormalization
   );
 }
-function filterExtractionResultBySource(result, source, assertionSource, roleAssertionSources, eventTimeNormalizer, spanMode = "off") {
+function filterExtractionResultBySource(result, source, assertionSource, roleAssertionSources, eventTimeNormalizer, spanMode = "off", quoteTransform) {
   if (source.trim().length === 0) {
     return {
       ...result,
@@ -776,22 +776,33 @@ function filterExtractionResultBySource(result, source, assertionSource, roleAss
       identityReflection: void 0
     };
   }
+  const quoteSource = assertionSource ?? source;
+  const keptAnchors = [];
+  const sourceHas = tokenPool(
+    result.facts.some((fact) => typeof fact.quote === "string") ? tokenize(quoteSource) : /* @__PURE__ */ new Set()
+  );
   const facts = result.facts.flatMap((fact) => {
+    const anchors = quoteAnchors(fact.quote, quoteSource, quoteTransform);
     const grounded = filterGroundedFact(
       fact,
       source,
       assertionSource,
       roleAssertionSources,
       eventTimeNormalizer,
-      spanMode
+      spanMode,
+      anchors,
+      sourceHas
     );
-    return grounded === void 0 ? [] : [grounded];
+    if (grounded === void 0) return [];
+    keptAnchors.push(...anchors);
+    return [grounded];
   });
   const profileUpdates = result.profileUpdates.filter(
     (update) => isRoleGroundedCandidate(update, source, assertionSource, roleAssertionSources)
   );
   const entities = result.entities.flatMap((entity) => {
-    const grounded = filterGroundedEntity(entity, source, assertionSource);
+    const anchorSupport = quoteAnchoredEntitySupport(entity, keptAnchors, sourceHas);
+    const grounded = filterGroundedEntity(entity, source, assertionSource, anchorSupport);
     return grounded === void 0 ? [] : [grounded];
   });
   const questions = result.questions.flatMap((question) => {
@@ -799,7 +810,7 @@ function filterExtractionResultBySource(result, source, assertionSource, roleAss
     return grounded === void 0 ? [] : [grounded];
   });
   const relationships = result.relationships?.filter(
-    (relationship) => isGroundedRelationship(relationship, source, assertionSource)
+    (relationship) => isGroundedRelationship(relationship, source, assertionSource) || isQuoteAnchoredRelationship(relationship, keptAnchors, sourceHas)
   );
   const identityReflection = result.identityReflection && isRoleGroundedCandidate(
     result.identityReflection,
@@ -822,4 +833,4 @@ export {
   applyExtractionSourceGrounding,
   filterExtractionResultBySource
 };
-//# sourceMappingURL=chunk-375ARKRS.js.map
+//# sourceMappingURL=chunk-D5SSBCYY.js.map

package/dist/chunk-D5SSBCYY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/extraction-source-grounding-rules.ts"],"sourcesContent":["import type { ExtractionResult } from \"./types.js\";\nimport { anchorTemporalExpressions } from \"./delinearize.js\";\nimport {\n  filterEntityFacts,\n  isQuoteAnchoredClaim,\n  isQuoteAnchoredRelationship,\n  quoteAnchoredEntitySupport,\n  quoteAnchors,\n  tokenPool,\n  type QuoteAnchor,\n  type TokenPool,\n} from \"./extraction-quote-grounding.js\";\nimport {\n  GROUNDING_AUXILIARY_TOKENS,\n  GROUNDING_COPULAR_FORMS,\n  GROUNDING_MIN_COVERAGE,\n  GROUNDING_MIN_SHARED_TOKENS,\n  GROUNDING_STOPWORDS,\n  areGroundingTokensCompatible,\n  containsContiguousGroundingTokens,\n  containsExactTokenSequence,\n  groundingLexemes,\n  groundingTokenSequence,\n  hasContradictoryPolarity,\n  hasExplicitRoleSubjectToken,\n  isGroundedEntityName,\n  isInterrogativeSourceSentence,\n  normalizeForExactMatch,\n  normalizedEntityIdentifierTokens,\n  normalizedGroundingAlignmentTokenSequence,\n  normalizedGroundingTokenSequence,\n  sourceSentences,\n  spacelessScriptGroundedTokenScore,\n  splitGroundingClauses,\n  stemToken,\n  tokenize,\n  tokenSequence,\n} from \"./extraction-source-grounding-helpers.js\";\n\nexport interface ExtractionSourceGroundingOptions {\n  sourceGrounding: boolean;\n  anchorTemporalExpressions: boolean;\n  spanMode?: \"off\" | \"shadow\" | \"on\";\n  /** Rewrite applied to the source before this stage, so a verbatim quote can still be located in it. */\n  quoteTransform?: (quote: string) => string;\n}\n\nexport function applyExtractionSourceGrounding(\n  result: ExtractionResult,\n  sourceText: string,\n  assertionSourceText: string = sourceText,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n  messageTimestamp: Date | undefined,\n  options: ExtractionSourceGroundingOptions,\n): ExtractionResult {\n  if (!options.sourceGrounding) return result;\n  const anchorSource = (source: string): string =>\n    options.anchorTemporalExpressions\n      ? anchorTemporalExpressions(source, messageTimestamp ?? new Date())\n      : source;\n  const anchoredRoleSources = roleAssertionSources === undefined\n    ? undefined\n    : {\n      profile: roleAssertionSources.profile === undefined\n        ? undefined\n        : anchorSource(roleAssertionSources.profile),\n      identity: roleAssertionSources.identity === undefined\n        ? undefined\n        : anchorSource(roleAssertionSources.identity),\n    };\n  return filterExtractionResultBySource(\n    result,\n    anchorSource(sourceText),\n    anchorSource(assertionSourceText),\n    anchoredRoleSources,\n    options.anchorTemporalExpressions ? anchorSource : undefined,\n    options.spanMode ?? \"off\",\n    options.anchorTemporalExpressions\n      ? (quote) => anchorSource(options.quoteTransform?.(quote) ?? quote)\n      : undefined,\n  );\n}\n\nexport interface ExtractionGroundingRoleSources {\n  profile?: string;\n  identity?: string;\n}\n\n\n\ninterface GroundingCopularClaim {\n  subject: string;\n  predicate: string;\n}\n\nfunction groundingCopularClaim(text: string): GroundingCopularClaim | undefined {\n  const lexemes = groundingLexemes(text);\n  const copulaIndex = lexemes.findIndex(({ token }) => GROUNDING_COPULAR_FORMS.has(token));\n  if (copulaIndex <= 0) return undefined;\n\n  let subjectIndex = copulaIndex - 1;\n  while (\n    subjectIndex >= 0\n    && GROUNDING_AUXILIARY_TOKENS.has(lexemes[subjectIndex]!.token)\n  ) {\n    subjectIndex -= 1;\n  }\n  const subjectLexeme = lexemes[subjectIndex];\n  const predicateLexeme = lexemes\n    .slice(copulaIndex + 1)\n    .find(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n  if (subjectLexeme === undefined || predicateLexeme === undefined) return undefined;\n\n  return {\n    subject: stemToken(subjectLexeme.token, subjectLexeme.preserveTerminalS, true),\n    predicate: stemToken(predicateLexeme.token, predicateLexeme.preserveTerminalS, true),\n  };\n}\n\nfunction hasCopularPredicateEvidence(candidate: string, source: string): boolean {\n  const candidateClaim = groundingCopularClaim(candidate);\n  if (candidateClaim === undefined) return true;\n  const sourceClaim = groundingCopularClaim(source);\n  return sourceClaim !== undefined\n    && areGroundingTokensCompatible(candidateClaim.subject, sourceClaim.subject)\n    && areGroundingTokensCompatible(candidateClaim.predicate, sourceClaim.predicate);\n}\nconst GROUNDING_ALIGNMENT_MODIFIERS = new Set([\n  \"actively\",\n  \"again\",\n  \"already\",\n  \"currently\",\n  \"eventually\",\n  \"finally\",\n  \"generally\",\n  \"mainly\",\n  \"newly\",\n  \"now\",\n  \"often\",\n  \"previously\",\n  \"primarily\",\n  \"quickly\",\n  \"recently\",\n  \"repeatedly\",\n  \"simply\",\n  \"slowly\",\n  \"sometimes\",\n  \"still\",\n  \"successfully\",\n  \"typically\",\n  \"usually\",\n]);\n\nfunction isGroundingAlignmentModifier(token: string): boolean {\n  return GROUNDING_ALIGNMENT_MODIFIERS.has(token);\n}\n\nfunction groundingSubjectTokenSequence(text: string): string[] {\n  const lexemes = groundingLexemes(text)\n    .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n  const predicateIndex = lexemes.findIndex(({ isPredicate }) => isPredicate);\n  if (predicateIndex < 1) return [];\n  return lexemes\n    .slice(0, predicateIndex)\n    .filter(({ token }) => !isGroundingAlignmentModifier(token) && !token.endsWith(\"ly\"))\n    .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS, true));\n}\n\n\nfunction hasAlignedSubjectPredicateOverlap(candidate: string, source: string): boolean {\n  const candidateTokens = normalizedGroundingAlignmentTokenSequence(candidate);\n  const sourceTokens = normalizedGroundingAlignmentTokenSequence(source);\n  const candidateSubjectTokens = groundingSubjectTokenSequence(candidate);\n  const sourceSubjectTokens = groundingSubjectTokenSequence(source);\n  const hasCorrectionReordering = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate)\n    && /\\b(?:not|rather\\s+than|instead\\s+of)\\b/iu.test(source);\n  if (\n    candidateSubjectTokens.length > 0\n    && sourceSubjectTokens.length > 0\n    && !hasCorrectionReordering\n    && (\n      candidateSubjectTokens.length !== sourceSubjectTokens.length\n      || candidateSubjectTokens.some(\n        (token, index) => !areGroundingTokensCompatible(token, sourceSubjectTokens[index]!),\n      )\n    )\n  ) {\n    return false;\n  }\n  if (candidateTokens.length < 3 || sourceTokens.length < 3) {\n    return hasCopularPredicateEvidence(candidate, source);\n  }\n\n  const candidateSubject = candidateTokens[0];\n  if (candidateSubject === undefined) return false;\n  for (let sourceSubjectIndex = 0; sourceSubjectIndex < sourceTokens.length; sourceSubjectIndex += 1) {\n    if (!areGroundingTokensCompatible(candidateSubject, sourceTokens[sourceSubjectIndex]!)) continue;\n    let sourceCursor = sourceSubjectIndex + 1;\n    let foundAlignedToken = false;\n    let aligned = true;\n    for (let candidateIndex = 1; candidateIndex < candidateTokens.length; candidateIndex += 1) {\n      const candidateToken = candidateTokens[candidateIndex]!;\n      const sourceIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceCursor && areGroundingTokensCompatible(candidateToken, sourceToken),\n      );\n      if (sourceIndex === -1) {\n        if (hasCorrectionReordering) continue;\n        aligned = false;\n        break;\n      }\n      foundAlignedToken = true;\n      const candidateNext = candidateTokens[candidateIndex + 1];\n      const sourceNext = sourceTokens[sourceIndex + 1];\n      if (\n        candidateNext !== undefined\n        && sourceNext !== undefined\n        && !hasCorrectionReordering\n        && !areGroundingTokensCompatible(candidateNext, sourceNext)\n        && !isGroundingAlignmentModifier(sourceNext)\n      ) {\n        aligned = false;\n        break;\n      }\n      sourceCursor = sourceIndex + 1;\n    }\n    if (aligned && foundAlignedToken) return true;\n  }\n  return false;\n}\n\nfunction omitsSourceDisjunction(candidate: string, source: string): boolean {\n  if (!/\\bor\\b/iu.test(source) || /\\bor\\b/iu.test(candidate)) return false;\n  const candidateTokens = normalizedGroundingTokenSequence(candidate);\n  return splitGroundingClauses([source], true).some((sourceSpan) => {\n    const sourceSpanTokens = normalizedGroundingTokenSequence(sourceSpan);\n    return candidateTokens.length === sourceSpanTokens.length\n      && candidateTokens.every(\n        (token, index) => areGroundingTokensCompatible(token, sourceSpanTokens[index]!),\n      );\n  });\n}\n\nfunction groundedTokenScore(\n  candidate: string,\n  source: string,\n  requireAlignedArguments = true,\n  requireAllCandidateTokensGrounded = true,\n): number {\n  const scriptAwareScore = spacelessScriptGroundedTokenScore(candidate, source);\n  if (scriptAwareScore !== null) return scriptAwareScore;\n  const candidateTokens = tokenize(candidate);\n  if (candidateTokens.size === 0) return 0;\n  const sourceTokens = tokenize(source);\n  const allowCorrectionReordering = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate);\n  let sharedTokens = 0;\n  let allCandidateTokensGrounded = true;\n  for (const token of candidateTokens) {\n    if ([...sourceTokens].some((sourceToken) => areGroundingTokensCompatible(token, sourceToken))) {\n      sharedTokens += 1;\n    } else if (!allowCorrectionReordering && token !== \"rather\" && token !== \"instead\") {\n      allCandidateTokensGrounded = false;\n    }\n  }\n  if (\n    (requireAllCandidateTokensGrounded && !allCandidateTokensGrounded)\n    || sharedTokens < GROUNDING_MIN_SHARED_TOKENS\n    || sharedTokens / candidateTokens.size < GROUNDING_MIN_COVERAGE\n  ) {\n    return 0;\n  }\n  if (requireAlignedArguments && !hasAlignedSubjectPredicateOverlap(candidate, source)) return 0;\n  return sharedTokens / candidateTokens.size;\n}\n\nfunction candidateClauses(candidate: string): string[] {\n  return sourceSentences(candidate).flatMap((sentence) =>\n    /\\bor\\b/iu.test(sentence) ? [sentence] : splitGroundingClauses([sentence]));\n}\n\nfunction isSourceGroundedClause(\n  candidate: string,\n  source: string,\n  includeInterrogativeSource = false,\n): boolean {\n  let bestSupportedScore = 0;\n  let bestContradictedScore = 0;\n  const sentences = sourceSentences(source);\n  for (let index = 0; index < sentences.length; index += 1) {\n    const sentence = sentences[index];\n    if (isYesNoAnswer(sentence)) {\n      const precedingSentence = sentences[index - 1];\n      const answerToken = tokenSequence(sentence)[0];\n      const contradictoryPolarity = precedingSentence !== undefined\n        ? hasContradictoryPolarity(candidate, precedingSentence)\n        : false;\n      if (\n        precedingSentence !== undefined\n        && isInterrogativeSourceSentence(precedingSentence)\n        && !omitsSourceDisjunction(candidate, precedingSentence)\n        && groundedTokenScore(candidate, precedingSentence) === 1\n        && (\n          (answerToken === \"yes\" && !contradictoryPolarity)\n          || (answerToken === \"no\" && contradictoryPolarity)\n        )\n      ) {\n        return true;\n      }\n      continue;\n    }\n    const sentenceText = normalizeForExactMatch(sentence);\n    const isExplanatoryLabel = sentenceText.startsWith(`${normalizeForExactMatch(candidate)}:`)\n      && !sentence.trim().endsWith(\"?\");\n    if (!includeInterrogativeSource && isInterrogativeSourceSentence(sentence) && !isExplanatoryLabel) {\n      continue;\n    }\n    if (omitsSourceDisjunction(candidate, sentence)) continue;\n    const sourceSpans = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate)\n      ? [sentence]\n      : splitGroundingClauses([sentence], true);\n    for (const sourceSpan of sourceSpans) {\n      const sourceSpanText = normalizeForExactMatch(sourceSpan);\n      if (containsExactTokenSequence(candidate, sourceSpanText)) {\n        if (!hasContradictoryPolarity(candidate, sourceSpan)) return true;\n        bestContradictedScore = Math.max(bestContradictedScore, 1);\n        continue;\n      }\n      const score = groundedTokenScore(\n        candidate,\n        sourceSpan,\n        !includeInterrogativeSource,\n        !includeInterrogativeSource,\n      );\n      if (score === 0) continue;\n      if (hasContradictoryPolarity(candidate, sourceSpan)) {\n        bestContradictedScore = Math.max(bestContradictedScore, score);\n      } else {\n        bestSupportedScore = Math.max(bestSupportedScore, score);\n      }\n    }\n  }\n  return bestSupportedScore > bestContradictedScore;\n}\nfunction isSourceGrounded(\n  candidate: string,\n  source: string,\n  includeInterrogativeSource = false,\n): boolean {\n  const candidateText = normalizeForExactMatch(candidate);\n  const sourceText = source.normalize(\"NFKC\").trim();\n  if (candidateText.length === 0 || sourceText.length === 0) return false;\n  const hasSupportedExactMatch = sourceSentences(sourceText).some((sentence) => {\n    const sentenceText = normalizeForExactMatch(sentence);\n    const isExplanatoryLabel = sentenceText.startsWith(`${candidateText}:`)\n      && !sentence.trim().endsWith(\"?\");\n    if (!includeInterrogativeSource && isInterrogativeSourceSentence(sentence) && !isExplanatoryLabel) return false;\n    if (omitsSourceDisjunction(candidateText, sentenceText)) return false;\n    return containsExactTokenSequence(candidateText, sentenceText)\n      && !hasContradictoryPolarity(candidateText, sentenceText);\n  });\n  if (hasSupportedExactMatch) return true;\n\n  const clauses = candidateClauses(candidate);\n  if (clauses.length > 1) {\n    return clauses.every((clause) =>\n      isSourceGroundedClause(clause, sourceText, includeInterrogativeSource));\n  }\n  return isSourceGroundedClause(candidate, sourceText, includeInterrogativeSource);\n}\n\nfunction buildEntitySupportSource(name: string, source: string): string {\n  const nameTokens = normalizedEntityIdentifierTokens(name);\n  if (nameTokens.length === 0) return \"\";\n  return sourceSentences(source)\n    .filter((sentence) => {\n      const sentenceTokens = groundingLexemes(sentence)\n        .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true)\n        .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS));\n      return containsContiguousGroundingTokens(nameTokens, sentenceTokens);\n    })\n    .join(\" \");\n}\n\nfunction hasGroundedPredicateAnchor(candidate: string, sentence: string): boolean {\n  const candidateTokens = normalizedGroundingTokenSequence(candidate);\n  const sourceTokens = normalizedGroundingTokenSequence(sentence);\n  const comparableCandidateTokens = GROUNDING_ROLE_SUBJECT_TOKENS.has(\n    (candidateTokens[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n  )\n    ? candidateTokens.slice(1)\n    : candidateTokens;\n  if (comparableCandidateTokens.length < 2) return false;\n  const subjectToken = comparableCandidateTokens[0];\n  if (\n    subjectToken === undefined\n    || !sourceTokens.some((sourceToken) => areGroundingTokensCompatible(subjectToken, sourceToken))\n  ) {\n    return false;\n  }\n  const candidatePredicateTokens = comparableCandidateTokens.slice(1);\n  const sharedPredicateTokens = candidatePredicateTokens.filter((token) =>\n    sourceTokens.some((sourceToken) => areGroundingTokensCompatible(token, sourceToken)));\n  const requiredSharedTokens = Math.min(2, candidatePredicateTokens.length);\n  return sharedPredicateTokens.length >= requiredSharedTokens;\n}\nfunction hasGroundingAnchor(\n  candidate: string,\n  assertionSource: string,\n  includeInterrogativeSource = false,\n  requirePredicateSupport = false,\n): boolean {\n  return sourceSentences(assertionSource).some((sentence) => {\n    if (!includeInterrogativeSource && isInterrogativeSourceSentence(sentence)) return false;\n    if (omitsSourceDisjunction(candidate, sentence)) return false;\n    const sourceSpans = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate)\n      ? [sentence]\n      : splitGroundingClauses([sentence], true);\n    return sourceSpans.some((sourceSpan) => {\n      const exactMatch = containsExactTokenSequence(candidate, sourceSpan)\n        && !hasContradictoryPolarity(candidate, sourceSpan);\n      if (exactMatch) return true;\n      if (requirePredicateSupport && !hasGroundedPredicateAnchor(candidate, sourceSpan)) return false;\n      return groundedTokenScore(candidate, sourceSpan) > 0\n        || hasRoleNormalizedGrounding(candidate, sourceSpan);\n    });\n  });\n}\n\nfunction hasAnswerSupport(\n  candidate: string,\n  source: string,\n  assertionSource: string,\n): boolean {\n  const assertedAnswerSentences = new Set(\n    sourceSentences(assertionSource)\n      .filter((sentence) => {\n        const answerToken = tokenSequence(sentence)[0];\n        return answerToken === \"yes\" || answerToken === \"no\";\n      })\n      .map((sentence) => normalizeForExactMatch(sentence)),\n  );\n  if (assertedAnswerSentences.size === 0) return false;\n  const sentences = sourceSentences(source);\n  return sentences.some((sentence, index) => {\n    const answerToken = tokenSequence(sentence)[0];\n    if (answerToken !== \"yes\" && answerToken !== \"no\") return false;\n    if (!assertedAnswerSentences.has(normalizeForExactMatch(sentence))) return false;\n    const precedingSentence = sentences[index - 1];\n    if (\n      precedingSentence === undefined\n      || !isInterrogativeSourceSentence(precedingSentence)\n      || omitsSourceDisjunction(candidate, precedingSentence)\n      || groundedTokenScore(candidate, precedingSentence) !== 1\n    ) {\n      return false;\n    }\n    const contradictoryPolarity = hasContradictoryPolarity(candidate, precedingSentence);\n    return answerToken === \"yes\" ? !contradictoryPolarity : contradictoryPolarity;\n  });\n}\n\nconst GROUNDING_ROLE_SUBJECT_TOKENS = new Set([\"assistant\", \"user\"]);\n\nfunction hasRoleNormalizedGrounding(candidate: string, source: string): boolean {\n  const candidateTokens = groundingTokenSequence(candidate);\n  if (!GROUNDING_ROLE_SUBJECT_TOKENS.has(\n    (candidateTokens[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n  )) return false;\n  const claimTokens = candidateTokens.slice(1);\n  if (claimTokens.length === 0) return false;\n\n  return sourceSentences(source).some((sentence) => {\n    if (isInterrogativeSourceSentence(sentence)) return false;\n    const sourceTokens = groundingTokenSequence(sentence);\n    const requiredSharedTokens = Math.min(GROUNDING_MIN_SHARED_TOKENS, claimTokens.length);\n    let sourceIndex = 0;\n    let sharedTokens = 0;\n    for (const claimToken of claimTokens) {\n      const matchingIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceIndex && areGroundingTokensCompatible(claimToken, sourceToken),\n      );\n      if (matchingIndex === -1) continue;\n      sharedTokens += 1;\n      sourceIndex = matchingIndex + 1;\n    }\n    return sharedTokens >= requiredSharedTokens\n      && !hasContradictoryPolarity(candidate, sentence);\n  });\n}\n\ninterface GroundingContext {\n  source: string;\n  assertionSource: string | undefined;\n  allowRoleNormalization: boolean;\n  fallbackSource?: string;\n  fallbackAssertionSource?: string;\n}\n\nfunction resolveGroundingContext(\n  candidate: string,\n  source: string,\n  assertionSource: string | undefined,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n): GroundingContext {\n  const candidateRole = (groundingTokenSequence(candidate)[0] ?? \"\")\n    .replace(/^[\\u0000\\u0001]/u, \"\");\n  if (!GROUNDING_ROLE_SUBJECT_TOKENS.has(candidateRole)) {\n    return { source, assertionSource, allowRoleNormalization: false };\n  }\n  if (roleAssertionSources === undefined) {\n    return { source, assertionSource, allowRoleNormalization: true };\n  }\n  const roleSource = candidateRole === \"user\"\n    ? roleAssertionSources.profile\n    : roleAssertionSources.identity;\n  if (roleSource === undefined) {\n    return { source, assertionSource, allowRoleNormalization: true };\n  }\n  return {\n    source: roleSource,\n    assertionSource: roleSource,\n    allowRoleNormalization: true,\n    fallbackSource: source,\n    fallbackAssertionSource: assertionSource,\n  };\n}\n\nfunction selectGroundingContext(candidate: string, context: GroundingContext): GroundingContext {\n  if (isGroundedCandidate(\n    candidate,\n    context.source,\n    context.assertionSource,\n    false,\n    context.allowRoleNormalization,\n  )) {\n    return context;\n  }\n  if (\n    context.fallbackSource === undefined\n    || !hasExplicitRoleSubjectToken(\n      (groundingTokenSequence(candidate)[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n      sourceSentences(context.fallbackSource).map((sentence) => groundingTokenSequence(sentence)),\n    )\n  ) return context;\n  const fallbackContext: GroundingContext = {\n    source: context.fallbackSource,\n    assertionSource: context.fallbackAssertionSource,\n    allowRoleNormalization: false,\n  };\n  return isGroundedCandidate(\n    candidate,\n    fallbackContext.source,\n    fallbackContext.assertionSource,\n    false,\n    fallbackContext.allowRoleNormalization,\n  )\n    ? fallbackContext\n    : context;\n}\n\nfunction isGroundedCandidate(\n  candidate: string,\n  source: string,\n  assertionSource: string | undefined,\n  includeInterrogativeSource = false,\n  allowRoleNormalization = false,\n): boolean {\n  const allowInterrogativeSource = includeInterrogativeSource\n    || (\n      assertionSource !== undefined\n      && normalizeForExactMatch(assertionSource) !== normalizeForExactMatch(source)\n    );\n  const sourceGrounded = isSourceGrounded(candidate, source, allowInterrogativeSource);\n  const roleGrounded = allowRoleNormalization && hasRoleNormalizedGrounding(candidate, source);\n  const candidateTokens = groundingTokenSequence(candidate);\n  const roleNormalizedCandidate = allowRoleNormalization\n    && GROUNDING_ROLE_SUBJECT_TOKENS.has(\n      (candidateTokens[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n    );\n  if (roleNormalizedCandidate && !roleGrounded) return false;\n  if (!sourceGrounded && !roleGrounded) return false;\n  if (assertionSource === undefined) return true;\n  const clauses = candidateClauses(candidate);\n  const requirePredicateSupport = !includeInterrogativeSource\n    && assertionSource !== undefined\n    && normalizeForExactMatch(assertionSource) !== normalizeForExactMatch(source);\n  return clauses.length > 0\n    && (\n      clauses.every((clause) =>\n        hasGroundingAnchor(clause, assertionSource, includeInterrogativeSource, requirePredicateSupport))\n      || hasAnswerSupport(candidate, source, assertionSource)\n    );\n}\n\nfunction groundWithinQuoteAnchors(\n  content: string,\n  anchors: readonly QuoteAnchor[],\n  sourceHas: TokenPool,\n): GroundingContext | undefined {\n  const anchor = anchors.find((candidate) => isQuoteAnchoredClaim(content, candidate, sourceHas));\n  if (anchor === undefined) return undefined;\n  return {\n    source: anchor.window,\n    assertionSource: undefined,\n    allowRoleNormalization: GROUNDING_ROLE_SUBJECT_TOKENS.has(\n      (groundingTokenSequence(content)[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n    ),\n  };\n}\n\nfunction buildFactSupportSource(\n  source: string,\n  supportingSentences: ReadonlyArray<string>,\n): string {\n  const sentences = sourceSentences(source);\n  const selectedIndices = new Set<number>();\n  for (const supportingSentence of supportingSentences) {\n    const supportIndex = sentences.indexOf(supportingSentence);\n    if (supportIndex < 0) continue;\n    let endIndex = supportIndex;\n    while (\n      endIndex < sentences.length - 1\n      && sentences[endIndex]!.trimEnd().endsWith(\";\")\n      && /^(?:its|their|this|that|these|those)\\b/iu.test(\n        sentences[endIndex + 1]!.trimStart(),\n      )\n    ) {\n      endIndex += 1;\n    }\n    for (let index = supportIndex; index <= endIndex; index += 1) {\n      selectedIndices.add(index);\n    }\n  }\n  return [...selectedIndices]\n    .sort((left, right) => left - right)\n    .map((index) => sentences[index]!)\n    .join(\" \");\n}\nfunction buildProcedureSupportSource(\n  fact: ExtractionResult[\"facts\"][number],\n  source: string,\n  factSupportSource: string,\n): string {\n  if (fact.category !== \"procedure\" || fact.procedureSteps === undefined) return factSupportSource;\n  const parentSupportSentences = new Set(\n    sourceSentences(factSupportSource).map((sentence) => normalizeForExactMatch(sentence)),\n  );\n  const parentGroundedSteps = fact.procedureSteps.filter((step) =>\n    isGroundedCandidate(step.intent, factSupportSource, undefined, false),\n  );\n  if (parentGroundedSteps.length === 0) return factSupportSource;\n  return sourceSentences(source)\n    .filter((sentence) => {\n      if (parentSupportSentences.has(normalizeForExactMatch(sentence))) return true;\n      const sentenceTokens = tokenize(sentence);\n      return parentGroundedSteps.some((step) =>\n        [...tokenize(step.intent)].some((token) =>\n          [...sentenceTokens].some((sourceToken) => areGroundingTokensCompatible(token, sourceToken)),\n        ),\n      );\n    })\n    .join(\" \");\n}\nfunction filterGroundedFact(\n  fact: ExtractionResult[\"facts\"][number],\n  source: string,\n  assertionSource: string | undefined,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n  eventTimeNormalizer: ((eventTime: string) => string) | undefined,\n  spanMode: \"off\" | \"shadow\" | \"on\" = \"off\",\n  anchors: readonly QuoteAnchor[],\n  sourceHas: TokenPool,\n): ExtractionResult[\"facts\"][number] | undefined {\n  // Span-materialized content (issue #2333) is \"frame: verbatim slice\". The\n  // frame is generated deixis, so full-content gating would drop a verbatim\n  // fact. Only on-mode facts whose content is that materialized shape may\n  // fall back to the slice. Shadow stays zero-diff with off.\n  const quote = typeof fact.quote === \"string\" ? fact.quote : \"\";\n  const materializedPrefix = quote.length > 0 && fact.content.endsWith(quote) && fact.content !== quote\n    ? fact.content.slice(0, fact.content.length - quote.length)\n    : \"\";\n  const embeddedQuote =\n    spanMode === \"on\"\n    && quote.trim().length > 0\n    && (materializedPrefix.endsWith(\": \") || /[:—-]\\s$/.test(materializedPrefix))\n      ? quote\n      : undefined;\n  const contentContext = selectGroundingContext(\n    fact.content,\n    resolveGroundingContext(fact.content, source, assertionSource, roleAssertionSources),\n  );\n  let gateContent = fact.content;\n  let factContext = contentContext;\n  let quoteAnchored = false;\n  if (\n    !isGroundedCandidate(\n      fact.content,\n      contentContext.source,\n      contentContext.assertionSource,\n      false,\n      contentContext.allowRoleNormalization,\n    )\n  ) {\n    const quoteContext = spanMode === \"on\"\n      ? undefined\n      : groundWithinQuoteAnchors(fact.content, anchors, sourceHas);\n    if (quoteContext !== undefined) {\n      factContext = quoteContext;\n      quoteAnchored = true;\n    } else {\n      if (embeddedQuote === undefined) return undefined;\n      gateContent = embeddedQuote;\n      factContext = selectGroundingContext(\n        gateContent,\n        resolveGroundingContext(gateContent, source, assertionSource, roleAssertionSources),\n      );\n      if (!isGroundedCandidate(\n        gateContent,\n        factContext.source,\n        factContext.assertionSource,\n        false,\n        factContext.allowRoleNormalization,\n      )) return undefined;\n    }\n  }\n  const factEventTime = fact.eventTime;\n  const groundedFactEventTime = factEventTime === undefined\n    ? undefined\n    : eventTimeNormalizer?.(factEventTime) ?? factEventTime;\n  // A quote-anchored claim is reworded from the quote and its turn, so no single\n  // sentence grounds it; the anchor window is the support for its sub-fields.\n  const factSupportingSentences = quoteAnchored ? [] : sourceSentences(factContext.assertionSource ?? factContext.source).filter(\n    (sentence) =>\n    isGroundedCandidate(\n      gateContent,\n      sentence,\n      undefined,\n      false,\n      factContext.allowRoleNormalization,\n    ),\n  );\n  const factSupportingSource = factEventTime === undefined\n    ? factSupportingSentences[0]\n    : factSupportingSentences.find((sentence) =>\n      isGroundedCandidate(\n        groundedFactEventTime ?? factEventTime,\n        sentence,\n        undefined,\n        false,\n        factContext.allowRoleNormalization,\n      ),\n    ) ?? factSupportingSentences[0];\n  const eventTimeSource = factSupportingSource ?? factContext.source;\n  const eventTimeAssertionSource = factSupportingSource === undefined\n    ? factContext.assertionSource\n    : undefined;\n\n  const factSupportSource = quoteAnchored\n    ? factContext.source\n    : buildFactSupportSource(\n      factContext.assertionSource ?? factContext.source,\n      factSupportingSentences,\n    );\n  const groundedAttributes = fact.structuredAttributes\n    ? Object.fromEntries(\n      Object.entries(fact.structuredAttributes)\n        .filter(([key, value]) =>\n          isGroundedCandidate(\n            `${key}: ${value}`,\n            factSupportSource,\n            undefined,\n            false,\n            factContext.allowRoleNormalization,\n          ),\n        ),\n    )\n    : undefined;\n  const procedureGroundingSource = buildProcedureSupportSource(\n    fact,\n    factContext.assertionSource ?? factContext.source,\n    factSupportSource,\n  );\n  const groundedProcedureSteps = fact.procedureSteps\n    ? fact.procedureSteps.flatMap((step) => {\n      if (!isGroundedCandidate(step.intent, procedureGroundingSource, undefined, false)) return [];\n      const expectedOutcome = step.expectedOutcome\n        && isGroundedCandidate(step.expectedOutcome, procedureGroundingSource, undefined, false)\n        ? step.expectedOutcome\n        : undefined;\n      const toolCall = step.toolCall\n        && isGroundedCandidate(step.toolCall.signature, procedureGroundingSource, undefined, false)\n        ? step.toolCall\n        : undefined;\n      const {\n        expectedOutcome: _expectedOutcome,\n        toolCall: _toolCall,\n        ...stepWithoutOptionalFields\n      } = step;\n      return [{\n        ...stepWithoutOptionalFields,\n        ...(expectedOutcome !== undefined ? { expectedOutcome } : {}),\n        ...(toolCall !== undefined ? { toolCall } : {}),\n      }];\n    })\n    : undefined;\n  const groundedReasoningTrace = fact.reasoningTrace\n    && fact.reasoningTrace.steps.length > 0\n    && isGroundedCandidate(\n      fact.reasoningTrace.finalAnswer,\n      factContext.source,\n      factContext.assertionSource,\n      false,\n      factContext.allowRoleNormalization,\n    )\n    && fact.reasoningTrace.steps.every((step) =>\n      isGroundedCandidate(\n        step.description,\n        factContext.source,\n        factContext.assertionSource,\n        false,\n        factContext.allowRoleNormalization,\n      ),\n    )\n    ? {\n      steps: fact.reasoningTrace.steps,\n      finalAnswer: fact.reasoningTrace.finalAnswer,\n      ...(fact.reasoningTrace.observedOutcome\n        && isGroundedCandidate(\n          fact.reasoningTrace.observedOutcome,\n          factContext.source,\n          factContext.assertionSource,\n          false,\n          factContext.allowRoleNormalization,\n        )\n        ? { observedOutcome: fact.reasoningTrace.observedOutcome }\n        : {}),\n    }\n    : undefined;\n  const groundedEventTime = groundedFactEventTime\n    && isGroundedCandidate(groundedFactEventTime, eventTimeSource, eventTimeAssertionSource)\n    ? factEventTime\n    : undefined;\n  const groundedEntityRef = fact.entityRef !== undefined\n    && isGroundedEntityName(fact.entityRef, factSupportSource)\n    ? fact.entityRef\n    : undefined;\n  const {\n    entityRef: _entityRef,\n    structuredAttributes: _structuredAttributes,\n    procedureSteps: _procedureSteps,\n    reasoningTrace: _reasoningTrace,\n    eventTime: _eventTime,\n    ...factWithoutGroundingFields\n  } = fact;\n  return {\n    ...factWithoutGroundingFields,\n    ...(groundedEntityRef !== undefined ? { entityRef: groundedEntityRef } : {}),\n    ...(groundedAttributes && Object.keys(groundedAttributes).length > 0\n      ? { structuredAttributes: groundedAttributes }\n      : {}),\n    ...(groundedProcedureSteps && groundedProcedureSteps.length > 0\n      ? { procedureSteps: groundedProcedureSteps }\n      : {}),\n    ...(groundedReasoningTrace !== undefined ? { reasoningTrace: groundedReasoningTrace } : {}),\n    ...(groundedEventTime !== undefined ? { eventTime: groundedEventTime } : {}),\n  };\n}\n\nfunction filterGroundedEntity(\n  entity: ExtractionResult[\"entities\"][number],\n  source: string,\n  assertionSource: string | undefined,\n  anchorSupport?: (fact: string) => boolean,\n): ExtractionResult[\"entities\"][number] | undefined {\n  const nameGrounded = isGroundedEntityName(entity.name, source);\n  if (!nameGrounded && anchorSupport === undefined) return undefined;\n  const entitySource = nameGrounded ? buildEntitySupportSource(entity.name, source) : \"\";\n  const entityAssertionSource = !nameGrounded || assertionSource === undefined\n    ? undefined\n    : buildEntitySupportSource(entity.name, assertionSource);\n  return filterEntityFacts(entity, (fact) =>\n    (nameGrounded && isGroundedCandidate(fact, entitySource, entityAssertionSource))\n    || anchorSupport?.(fact) === true);\n}\n\nfunction normalizedEntitySourceText(name: string): string {\n  return normalizedEntityIdentifierTokens(name).join(\" \");\n}\n\nfunction isGroundedRelationship(\n  relationship: NonNullable<ExtractionResult[\"relationships\"]>[number],\n  source: string,\n  assertionSource: string | undefined,\n): boolean {\n  const sourceName = normalizedEntitySourceText(relationship.source);\n  const targetName = normalizedEntitySourceText(relationship.target);\n  const labelTokens = tokenize(relationship.label);\n  if (sourceName.length === 0 || targetName.length === 0 || labelTokens.size === 0) return false;\n  const relationText = `${sourceName} ${relationship.label} ${targetName}`;\n  const hasCoherentSourceSpan = sourceSentences(source).some((sentence) => {\n    if (isInterrogativeSourceSentence(sentence)) return false;\n    return groundedTokenScore(relationText, sentence) === 1\n      && !hasContradictoryPolarity(relationText, sentence);\n  });\n  return hasCoherentSourceSpan\n    && isGroundedCandidate(relationText, source, assertionSource);\n}\nconst GROUNDING_TEMPORAL_WORDS = new Set([\n  \"today\",\n  \"yesterday\",\n  \"tomorrow\",\n  \"now\",\n  \"recently\",\n  \"earlier\",\n  \"later\",\n  \"soon\",\n  \"morning\",\n  \"afternoon\",\n  \"evening\",\n  \"tonight\",\n  \"night\",\n  \"noon\",\n  \"midnight\",\n  \"monday\",\n  \"tuesday\",\n  \"wednesday\",\n  \"thursday\",\n  \"friday\",\n  \"saturday\",\n  \"sunday\",\n  \"january\",\n  \"february\",\n  \"march\",\n  \"april\",\n  \"may\",\n  \"june\",\n  \"july\",\n  \"august\",\n  \"september\",\n  \"october\",\n  \"november\",\n  \"december\",\n  \"q1\",\n  \"q2\",\n  \"q3\",\n  \"q4\",\n]);\nconst GROUNDING_TEMPORAL_CLOCK_PATTERN = /\\b\\d{1,2}:\\d{2}(?:\\s*[ap]\\.?m\\.?)?\\b/iu;\nconst GROUNDING_TEMPORAL_DURATION_PATTERN = new RegExp(\n  \"\\\\b(?:\\\\d+|one|two|three|four|five|six|seven|eight|nine|ten)\\\\s+\"\n    + \"(?:seconds?|minutes?|hours?|days?|weeks?|months?|quarters?|years?)\\\\b\",\n  \"iu\",\n);\n\nfunction isWhenQuestion(question: string): boolean {\n  return /^(?:when|what\\s+(?:time|date)|which\\s+day)\\b/iu.test(question.trim());\n}\nfunction isWhyQuestion(question: string): boolean {\n  return /^why\\b/iu.test(question.trim());\n}\n\nfunction hasCausalAnswerEvidence(question: string, sentence: string): boolean {\n  if (!isWhyQuestion(question)) return true;\n  return /\\b(?:because|since|due\\s+to|owing\\s+to|thanks\\s+to|therefore|thus|hence|so)\\b/iu.test(\n    sentence,\n  );\n}\n\nfunction hasTemporalAnswerEvidence(question: string, sentence: string): boolean {\n  if (!isWhenQuestion(question)) return true;\n  return groundingLexemes(sentence).some(({ token }) =>\n    GROUNDING_TEMPORAL_WORDS.has(token) || /^(?:19|20)\\d{2}$/u.test(token),\n  )\n    || GROUNDING_TEMPORAL_CLOCK_PATTERN.test(sentence)\n    || GROUNDING_TEMPORAL_DURATION_PATTERN.test(sentence);\n}\n\n\nfunction isUnknownAnswerSentence(sentence: string): boolean {\n  return /\\b(?:unknown|unclear|unsure|unresolved|unanswered|not\\s+(?:known|sure|available)|don't\\s+know|do\\s+not\\s+know|no\\s+idea|pending)\\b/iu\n    .test(sentence);\n}\n\nfunction isYesNoAnswer(sentence: string): boolean {\n  return /^(?:yes|no)(?:[.!?]|,\\s*(?:absolutely|definitely|indeed|exactly|correct|of\\s+course|use\\s+that|do\\s+that)[.!?]?)?$/iu\n    .test(sentence.trim());\n}\n\nconst GROUNDING_WH_OBJECT_QUESTION_PATTERN = new RegExp(\n  \"^(?:(?:what|which)(?:\\\\s+.+?)?|who|whom)\\\\s+\"\n    + \"(?:is|are|was|were|do|does|did|can|could|will|would|should|has|have|had)\\\\s+\"\n    + \"(.+?)\\\\??$\",\n  \"iu\",\n);\n\nfunction hasWhAnswerRoleAlignment(question: string, sentence: string): boolean {\n  const normalizedQuestion = question.trim();\n  const objectQuestionMatch = GROUNDING_WH_OBJECT_QUESTION_PATTERN.exec(normalizedQuestion);\n  const sourceTokens = normalizedGroundingTokenSequence(sentence);\n  if (objectQuestionMatch !== null) {\n    const questionBodyLexemes = groundingLexemes(objectQuestionMatch[1] ?? \"\");\n    const predicateIndex = questionBodyLexemes.findIndex(({ isPredicate }) => isPredicate);\n    if (predicateIndex < 1) return false;\n    const subjectTokens = groundingTokenSequence(\n      questionBodyLexemes.slice(0, predicateIndex).map(({ surface }) => surface).join(\" \"),\n    );\n    const predicateTokens = groundingTokenSequence(\n      questionBodyLexemes.slice(predicateIndex).map(({ surface }) => surface).join(\" \"),\n    );\n    if (subjectTokens.length === 0 || predicateTokens.length === 0) return false;\n    let sourceIndex = 0;\n    for (const token of [...subjectTokens, ...predicateTokens]) {\n      const matchedIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceIndex && areGroundingTokensCompatible(token, sourceToken),\n      );\n      if (matchedIndex === -1) return false;\n      sourceIndex = matchedIndex + 1;\n    }\n    return true;\n  }\n\n  const subjectQuestionMatch = /^(?:who|what)\\s+([^\\s?]+)\\s+(.+?)\\??$/iu.exec(normalizedQuestion);\n  if (subjectQuestionMatch === null) return true;\n  const predicateTokens = groundingTokenSequence(subjectQuestionMatch[1] ?? \"\");\n  const objectTokens = groundingTokenSequence(subjectQuestionMatch[2] ?? \"\");\n  if (predicateTokens.length === 0 || objectTokens.length === 0) return true;\n  const predicateStart = sourceTokens.findIndex((sourceToken) =>\n    areGroundingTokensCompatible(predicateTokens[0]!, sourceToken));\n  if (predicateStart === -1) return false;\n  let sourceIndex = predicateStart + predicateTokens.length;\n  for (const objectToken of objectTokens) {\n    const objectIndex = sourceTokens.findIndex(\n      (sourceToken, index) =>\n        index >= sourceIndex && areGroundingTokensCompatible(objectToken, sourceToken),\n    );\n    if (objectIndex === -1) return false;\n    sourceIndex = objectIndex + 1;\n  }\n  return true;\n}\n\nfunction isQuestionAnsweredBySource(\n  question: string,\n  source: string,\n  assertionSource: string | undefined,\n): boolean {\n  const questionTokens = tokenize(question);\n  if (questionTokens.size === 0) return false;\n  const isYesNoQuestion = /^(?:is|are|am|was|were|do|does|did|can|could|will|would|should|has|have|had)\\b/iu\n    .test(question.trim());\n  const assertedSentences = new Set(sourceSentences(assertionSource ?? source).map((sentence) => normalizeForExactMatch(sentence)));\n  const sentences = sourceSentences(source);\n  return sentences.some((sentence, index) => {\n    if (!assertedSentences.has(normalizeForExactMatch(sentence))) return false;\n    if (isInterrogativeSourceSentence(sentence)) return false;\n    if (isYesNoAnswer(sentence)) {\n      const precedingSentence = sentences[index - 1];\n      return precedingSentence !== undefined\n        && isInterrogativeSourceSentence(precedingSentence)\n        && groundedTokenScore(question, precedingSentence) === 1;\n    }\n    if (isUnknownAnswerSentence(sentence)) return false;\n    const score = groundedTokenScore(question, sentence, false);\n    if (score !== 1) return false;\n    const sentenceTokens = tokenize(sentence);\n    const hasAnswerToken = [...sentenceTokens].some((token) => !questionTokens.has(token));\n    return (isYesNoQuestion || hasAnswerToken)\n      && hasTemporalAnswerEvidence(question, sentence)\n      && hasCausalAnswerEvidence(question, sentence)\n      && hasWhAnswerRoleAlignment(question, sentence);\n  });\n}\n\nfunction groundQuestion(\n  question: ExtractionResult[\"questions\"][number],\n  source: string,\n  assertionSource: string | undefined,\n): ExtractionResult[\"questions\"][number] | undefined {\n  if (isQuestionAnsweredBySource(question.question, source, assertionSource)) return undefined;\n  if (!isGroundedCandidate(question.question, source, assertionSource, true)) return undefined;\n  const normalizedContext = question.context.trim();\n  if (\n    normalizedContext.length > 0\n    && !isGroundedCandidate(normalizedContext, assertionSource ?? source, undefined, false)\n  ) {\n    return { ...question, context: \"\" };\n  }\n  return question;\n}\n\nfunction isRoleGroundedCandidate(\n  candidate: string,\n  source: string,\n  assertionSource: string | undefined,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n): boolean {\n  const context = selectGroundingContext(\n    candidate,\n    resolveGroundingContext(candidate, source, assertionSource, roleAssertionSources),\n  );\n  return isGroundedCandidate(\n    candidate,\n    context.source,\n    context.assertionSource,\n    false,\n    context.allowRoleNormalization,\n  );\n}\n\nexport function filterExtractionResultBySource(\n  result: ExtractionResult,\n  source: string,\n  assertionSource?: string,\n  roleAssertionSources?: ExtractionGroundingRoleSources,\n  eventTimeNormalizer?: (eventTime: string) => string,\n  spanMode: \"off\" | \"shadow\" | \"on\" = \"off\",\n  quoteTransform?: (quote: string) => string,\n): ExtractionResult {\n  if (source.trim().length === 0) {\n    return {\n      ...result,\n      facts: [],\n      profileUpdates: [],\n      entities: [],\n      questions: [],\n      ...(result.relationships !== undefined ? { relationships: [] } : {}),\n      identityReflection: undefined,\n    };\n  }\n\n  const quoteSource = assertionSource ?? source;\n  const keptAnchors: QuoteAnchor[] = [];\n  const sourceHas = tokenPool(\n    result.facts.some((fact) => typeof fact.quote === \"string\") ? tokenize(quoteSource) : new Set(),\n  );\n  const facts = result.facts.flatMap((fact) => {\n    const anchors = quoteAnchors(fact.quote, quoteSource, quoteTransform);\n    const grounded = filterGroundedFact(\n      fact,\n      source,\n      assertionSource,\n      roleAssertionSources,\n      eventTimeNormalizer,\n      spanMode,\n      anchors,\n      sourceHas,\n    );\n    if (grounded === undefined) return [];\n    keptAnchors.push(...anchors);\n    return [grounded];\n  });\n  const profileUpdates = result.profileUpdates.filter((update) =>\n    isRoleGroundedCandidate(update, source, assertionSource, roleAssertionSources),\n  );\n  const entities = result.entities.flatMap((entity) => {\n    const anchorSupport = quoteAnchoredEntitySupport(entity, keptAnchors, sourceHas);\n    const grounded = filterGroundedEntity(entity, source, assertionSource, anchorSupport);\n    return grounded === undefined ? [] : [grounded];\n  });\n  const questions = result.questions.flatMap((question) => {\n    const grounded = groundQuestion(question, source, assertionSource);\n    return grounded === undefined ? [] : [grounded];\n  });\n  const relationships = result.relationships?.filter((relationship) =>\n    isGroundedRelationship(relationship, source, assertionSource)\n    || isQuoteAnchoredRelationship(relationship, keptAnchors, sourceHas),\n  );\n  const identityReflection = result.identityReflection\n    && isRoleGroundedCandidate(\n      result.identityReflection,\n      source,\n      assertionSource,\n      roleAssertionSources,\n    )\n    ? result.identityReflection\n    : undefined;\n\n  return {\n    ...result,\n    facts,\n    profileUpdates,\n    entities,\n    questions,\n    ...(result.relationships !== undefined ? { relationships } : {}),\n    ...(identityReflection !== undefined ? { identityReflection } : { identityReflection: undefined }),\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CO,SAAS,+BACd,QACA,YACA,sBAA8B,YAC9B,sBACA,kBACA,SACkB;AAClB,MAAI,CAAC,QAAQ,gBAAiB,QAAO;AACrC,QAAM,eAAe,CAAC,WACpB,QAAQ,4BACJ,0BAA0B,QAAQ,oBAAoB,oBAAI,KAAK,CAAC,IAChE;AACN,QAAM,sBAAsB,yBAAyB,SACjD,SACA;AAAA,IACA,SAAS,qBAAqB,YAAY,SACtC,SACA,aAAa,qBAAqB,OAAO;AAAA,IAC7C,UAAU,qBAAqB,aAAa,SACxC,SACA,aAAa,qBAAqB,QAAQ;AAAA,EAChD;AACF,SAAO;AAAA,IACL;AAAA,IACA,aAAa,UAAU;AAAA,IACvB,aAAa,mBAAmB;AAAA,IAChC;AAAA,IACA,QAAQ,4BAA4B,eAAe;AAAA,IACnD,QAAQ,YAAY;AAAA,IACpB,QAAQ,4BACJ,CAAC,UAAU,aAAa,QAAQ,iBAAiB,KAAK,KAAK,KAAK,IAChE;AAAA,EACN;AACF;AAcA,SAAS,sBAAsB,MAAiD;AAC9E,QAAM,UAAU,iBAAiB,IAAI;AACrC,QAAM,cAAc,QAAQ,UAAU,CAAC,EAAE,MAAM,MAAM,wBAAwB,IAAI,KAAK,CAAC;AACvF,MAAI,eAAe,EAAG,QAAO;AAE7B,MAAI,eAAe,cAAc;AACjC,SACE,gBAAgB,KACb,2BAA2B,IAAI,QAAQ,YAAY,EAAG,KAAK,GAC9D;AACA,oBAAgB;AAAA,EAClB;AACA,QAAM,gBAAgB,QAAQ,YAAY;AAC1C,QAAM,kBAAkB,QACrB,MAAM,cAAc,CAAC,EACrB,KAAK,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC1D,MAAI,kBAAkB,UAAa,oBAAoB,OAAW,QAAO;AAEzE,SAAO;AAAA,IACL,SAAS,UAAU,cAAc,OAAO,cAAc,mBAAmB,IAAI;AAAA,IAC7E,WAAW,UAAU,gBAAgB,OAAO,gBAAgB,mBAAmB,IAAI;AAAA,EACrF;AACF;AAEA,SAAS,4BAA4B,WAAmB,QAAyB;AAC/E,QAAM,iBAAiB,sBAAsB,SAAS;AACtD,MAAI,mBAAmB,OAAW,QAAO;AACzC,QAAM,cAAc,sBAAsB,MAAM;AAChD,SAAO,gBAAgB,UAClB,6BAA6B,eAAe,SAAS,YAAY,OAAO,KACxE,6BAA6B,eAAe,WAAW,YAAY,SAAS;AACnF;AACA,IAAM,gCAAgC,oBAAI,IAAI;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,6BAA6B,OAAwB;AAC5D,SAAO,8BAA8B,IAAI,KAAK;AAChD;AAEA,SAAS,8BAA8B,MAAwB;AAC7D,QAAM,UAAU,iBAAiB,IAAI,EAClC,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC5D,QAAM,iBAAiB,QAAQ,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACzE,MAAI,iBAAiB,EAAG,QAAO,CAAC;AAChC,SAAO,QACJ,MAAM,GAAG,cAAc,EACvB,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,6BAA6B,KAAK,KAAK,CAAC,MAAM,SAAS,IAAI,CAAC,EACnF,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,mBAAmB,IAAI,CAAC;AACpF;AAGA,SAAS,kCAAkC,WAAmB,QAAyB;AACrF,QAAM,kBAAkB,0CAA0C,SAAS;AAC3E,QAAM,eAAe,0CAA0C,MAAM;AACrE,QAAM,yBAAyB,8BAA8B,SAAS;AACtE,QAAM,sBAAsB,8BAA8B,MAAM;AAChE,QAAM,0BAA0B,uCAAuC,KAAK,SAAS,KAChF,2CAA2C,KAAK,MAAM;AAC3D,MACE,uBAAuB,SAAS,KAC7B,oBAAoB,SAAS,KAC7B,CAAC,4BAEF,uBAAuB,WAAW,oBAAoB,UACnD,uBAAuB;AAAA,IACxB,CAAC,OAAO,UAAU,CAAC,6BAA6B,OAAO,oBAAoB,KAAK,CAAE;AAAA,EACpF,IAEF;AACA,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,SAAS,KAAK,aAAa,SAAS,GAAG;AACzD,WAAO,4BAA4B,WAAW,MAAM;AAAA,EACtD;AAEA,QAAM,mBAAmB,gBAAgB,CAAC;AAC1C,MAAI,qBAAqB,OAAW,QAAO;AAC3C,WAAS,qBAAqB,GAAG,qBAAqB,aAAa,QAAQ,sBAAsB,GAAG;AAClG,QAAI,CAAC,6BAA6B,kBAAkB,aAAa,kBAAkB,CAAE,EAAG;AACxF,QAAI,eAAe,qBAAqB;AACxC,QAAI,oBAAoB;AACxB,QAAI,UAAU;AACd,aAAS,iBAAiB,GAAG,iBAAiB,gBAAgB,QAAQ,kBAAkB,GAAG;AACzF,YAAM,iBAAiB,gBAAgB,cAAc;AACrD,YAAM,cAAc,aAAa;AAAA,QAC/B,CAAC,aAAa,UACZ,SAAS,gBAAgB,6BAA6B,gBAAgB,WAAW;AAAA,MACrF;AACA,UAAI,gBAAgB,IAAI;AACtB,YAAI,wBAAyB;AAC7B,kBAAU;AACV;AAAA,MACF;AACA,0BAAoB;AACpB,YAAM,gBAAgB,gBAAgB,iBAAiB,CAAC;AACxD,YAAM,aAAa,aAAa,cAAc,CAAC;AAC/C,UACE,kBAAkB,UACf,eAAe,UACf,CAAC,2BACD,CAAC,6BAA6B,eAAe,UAAU,KACvD,CAAC,6BAA6B,UAAU,GAC3C;AACA,kBAAU;AACV;AAAA,MACF;AACA,qBAAe,cAAc;AAAA,IAC/B;AACA,QAAI,WAAW,kBAAmB,QAAO;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,WAAmB,QAAyB;AAC1E,MAAI,CAAC,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,SAAS,EAAG,QAAO;AACnE,QAAM,kBAAkB,iCAAiC,SAAS;AAClE,SAAO,sBAAsB,CAAC,MAAM,GAAG,IAAI,EAAE,KAAK,CAAC,eAAe;AAChE,UAAM,mBAAmB,iCAAiC,UAAU;AACpE,WAAO,gBAAgB,WAAW,iBAAiB,UAC9C,gBAAgB;AAAA,MACjB,CAAC,OAAO,UAAU,6BAA6B,OAAO,iBAAiB,KAAK,CAAE;AAAA,IAChF;AAAA,EACJ,CAAC;AACH;AAEA,SAAS,mBACP,WACA,QACA,0BAA0B,MAC1B,oCAAoC,MAC5B;AACR,QAAM,mBAAmB,kCAAkC,WAAW,MAAM;AAC5E,MAAI,qBAAqB,KAAM,QAAO;AACtC,QAAM,kBAAkB,SAAS,SAAS;AAC1C,MAAI,gBAAgB,SAAS,EAAG,QAAO;AACvC,QAAM,eAAe,SAAS,MAAM;AACpC,QAAM,4BAA4B,uCAAuC,KAAK,SAAS;AACvF,MAAI,eAAe;AACnB,MAAI,6BAA6B;AACjC,aAAW,SAAS,iBAAiB;AACnC,QAAI,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC,GAAG;AAC7F,sBAAgB;AAAA,IAClB,WAAW,CAAC,6BAA6B,UAAU,YAAY,UAAU,WAAW;AAClF,mCAA6B;AAAA,IAC/B;AAAA,EACF;AACA,MACG,qCAAqC,CAAC,8BACpC,eAAe,+BACf,eAAe,gBAAgB,OAAO,wBACzC;AACA,WAAO;AAAA,EACT;AACA,MAAI,2BAA2B,CAAC,kCAAkC,WAAW,MAAM,EAAG,QAAO;AAC7F,SAAO,eAAe,gBAAgB;AACxC;AAEA,SAAS,iBAAiB,WAA6B;AACrD,SAAO,gBAAgB,SAAS,EAAE,QAAQ,CAAC,aACzC,WAAW,KAAK,QAAQ,IAAI,CAAC,QAAQ,IAAI,sBAAsB,CAAC,QAAQ,CAAC,CAAC;AAC9E;AAEA,SAAS,uBACP,WACA,QACA,6BAA6B,OACpB;AACT,MAAI,qBAAqB;AACzB,MAAI,wBAAwB;AAC5B,QAAM,YAAY,gBAAgB,MAAM;AACxC,WAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS,GAAG;AACxD,UAAM,WAAW,UAAU,KAAK;AAChC,QAAI,cAAc,QAAQ,GAAG;AAC3B,YAAM,oBAAoB,UAAU,QAAQ,CAAC;AAC7C,YAAM,cAAc,cAAc,QAAQ,EAAE,CAAC;AAC7C,YAAM,wBAAwB,sBAAsB,SAChD,yBAAyB,WAAW,iBAAiB,IACrD;AACJ,UACE,sBAAsB,UACnB,8BAA8B,iBAAiB,KAC/C,CAAC,uBAAuB,WAAW,iBAAiB,KACpD,mBAAmB,WAAW,iBAAiB,MAAM,MAErD,gBAAgB,SAAS,CAAC,yBACvB,gBAAgB,QAAQ,wBAE9B;AACA,eAAO;AAAA,MACT;AACA;AAAA,IACF;AACA,UAAM,eAAe,uBAAuB,QAAQ;AACpD,UAAM,qBAAqB,aAAa,WAAW,GAAG,uBAAuB,SAAS,CAAC,GAAG,KACrF,CAAC,SAAS,KAAK,EAAE,SAAS,GAAG;AAClC,QAAI,CAAC,8BAA8B,8BAA8B,QAAQ,KAAK,CAAC,oBAAoB;AACjG;AAAA,IACF;AACA,QAAI,uBAAuB,WAAW,QAAQ,EAAG;AACjD,UAAM,cAAc,uCAAuC,KAAK,SAAS,IACrE,CAAC,QAAQ,IACT,sBAAsB,CAAC,QAAQ,GAAG,IAAI;AAC1C,eAAW,cAAc,aAAa;AACpC,YAAM,iBAAiB,uBAAuB,UAAU;AACxD,UAAI,2BAA2B,WAAW,cAAc,GAAG;AACzD,YAAI,CAAC,yBAAyB,WAAW,UAAU,EAAG,QAAO;AAC7D,gCAAwB,KAAK,IAAI,uBAAuB,CAAC;AACzD;AAAA,MACF;AACA,YAAM,QAAQ;AAAA,QACZ;AAAA,QACA;AAAA,QACA,CAAC;AAAA,QACD,CAAC;AAAA,MACH;AACA,UAAI,UAAU,EAAG;AACjB,UAAI,yBAAyB,WAAW,UAAU,GAAG;AACnD,gCAAwB,KAAK,IAAI,uBAAuB,KAAK;AAAA,MAC/D,OAAO;AACL,6BAAqB,KAAK,IAAI,oBAAoB,KAAK;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AACA,SAAO,qBAAqB;AAC9B;AACA,SAAS,iBACP,WACA,QACA,6BAA6B,OACpB;AACT,QAAM,gBAAgB,uBAAuB,SAAS;AACtD,QAAM,aAAa,OAAO,UAAU,MAAM,EAAE,KAAK;AACjD,MAAI,cAAc,WAAW,KAAK,WAAW,WAAW,EAAG,QAAO;AAClE,QAAM,yBAAyB,gBAAgB,UAAU,EAAE,KAAK,CAAC,aAAa;AAC5E,UAAM,eAAe,uBAAuB,QAAQ;AACpD,UAAM,qBAAqB,aAAa,WAAW,GAAG,aAAa,GAAG,KACjE,CAAC,SAAS,KAAK,EAAE,SAAS,GAAG;AAClC,QAAI,CAAC,8BAA8B,8BAA8B,QAAQ,KAAK,CAAC,mBAAoB,QAAO;AAC1G,QAAI,uBAAuB,eAAe,YAAY,EAAG,QAAO;AAChE,WAAO,2BAA2B,eAAe,YAAY,KACxD,CAAC,yBAAyB,eAAe,YAAY;AAAA,EAC5D,CAAC;AACD,MAAI,uBAAwB,QAAO;AAEnC,QAAM,UAAU,iBAAiB,SAAS;AAC1C,MAAI,QAAQ,SAAS,GAAG;AACtB,WAAO,QAAQ,MAAM,CAAC,WACpB,uBAAuB,QAAQ,YAAY,0BAA0B,CAAC;AAAA,EAC1E;AACA,SAAO,uBAAuB,WAAW,YAAY,0BAA0B;AACjF;AAEA,SAAS,yBAAyB,MAAc,QAAwB;AACtE,QAAM,aAAa,iCAAiC,IAAI;AACxD,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO,gBAAgB,MAAM,EAC1B,OAAO,CAAC,aAAa;AACpB,UAAM,iBAAiB,iBAAiB,QAAQ,EAC7C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI,EACzD,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,iBAAiB,CAAC;AAC5E,WAAO,kCAAkC,YAAY,cAAc;AAAA,EACrE,CAAC,EACA,KAAK,GAAG;AACb;AAEA,SAAS,2BAA2B,WAAmB,UAA2B;AAChF,QAAM,kBAAkB,iCAAiC,SAAS;AAClE,QAAM,eAAe,iCAAiC,QAAQ;AAC9D,QAAM,4BAA4B,8BAA8B;AAAA,KAC7D,gBAAgB,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,EAC3D,IACI,gBAAgB,MAAM,CAAC,IACvB;AACJ,MAAI,0BAA0B,SAAS,EAAG,QAAO;AACjD,QAAM,eAAe,0BAA0B,CAAC;AAChD,MACE,iBAAiB,UACd,CAAC,aAAa,KAAK,CAAC,gBAAgB,6BAA6B,cAAc,WAAW,CAAC,GAC9F;AACA,WAAO;AAAA,EACT;AACA,QAAM,2BAA2B,0BAA0B,MAAM,CAAC;AAClE,QAAM,wBAAwB,yBAAyB,OAAO,CAAC,UAC7D,aAAa,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC,CAAC;AACtF,QAAM,uBAAuB,KAAK,IAAI,GAAG,yBAAyB,MAAM;AACxE,SAAO,sBAAsB,UAAU;AACzC;AACA,SAAS,mBACP,WACA,iBACA,6BAA6B,OAC7B,0BAA0B,OACjB;AACT,SAAO,gBAAgB,eAAe,EAAE,KAAK,CAAC,aAAa;AACzD,QAAI,CAAC,8BAA8B,8BAA8B,QAAQ,EAAG,QAAO;AACnF,QAAI,uBAAuB,WAAW,QAAQ,EAAG,QAAO;AACxD,UAAM,cAAc,uCAAuC,KAAK,SAAS,IACrE,CAAC,QAAQ,IACT,sBAAsB,CAAC,QAAQ,GAAG,IAAI;AAC1C,WAAO,YAAY,KAAK,CAAC,eAAe;AACtC,YAAM,aAAa,2BAA2B,WAAW,UAAU,KAC9D,CAAC,yBAAyB,WAAW,UAAU;AACpD,UAAI,WAAY,QAAO;AACvB,UAAI,2BAA2B,CAAC,2BAA2B,WAAW,UAAU,EAAG,QAAO;AAC1F,aAAO,mBAAmB,WAAW,UAAU,IAAI,KAC9C,2BAA2B,WAAW,UAAU;AAAA,IACvD,CAAC;AAAA,EACH,CAAC;AACH;AAEA,SAAS,iBACP,WACA,QACA,iBACS;AACT,QAAM,0BAA0B,IAAI;AAAA,IAClC,gBAAgB,eAAe,EAC5B,OAAO,CAAC,aAAa;AACpB,YAAM,cAAc,cAAc,QAAQ,EAAE,CAAC;AAC7C,aAAO,gBAAgB,SAAS,gBAAgB;AAAA,IAClD,CAAC,EACA,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC;AAAA,EACvD;AACA,MAAI,wBAAwB,SAAS,EAAG,QAAO;AAC/C,QAAM,YAAY,gBAAgB,MAAM;AACxC,SAAO,UAAU,KAAK,CAAC,UAAU,UAAU;AACzC,UAAM,cAAc,cAAc,QAAQ,EAAE,CAAC;AAC7C,QAAI,gBAAgB,SAAS,gBAAgB,KAAM,QAAO;AAC1D,QAAI,CAAC,wBAAwB,IAAI,uBAAuB,QAAQ,CAAC,EAAG,QAAO;AAC3E,UAAM,oBAAoB,UAAU,QAAQ,CAAC;AAC7C,QACE,sBAAsB,UACnB,CAAC,8BAA8B,iBAAiB,KAChD,uBAAuB,WAAW,iBAAiB,KACnD,mBAAmB,WAAW,iBAAiB,MAAM,GACxD;AACA,aAAO;AAAA,IACT;AACA,UAAM,wBAAwB,yBAAyB,WAAW,iBAAiB;AACnF,WAAO,gBAAgB,QAAQ,CAAC,wBAAwB;AAAA,EAC1D,CAAC;AACH;AAEA,IAAM,gCAAgC,oBAAI,IAAI,CAAC,aAAa,MAAM,CAAC;AAEnE,SAAS,2BAA2B,WAAmB,QAAyB;AAC9E,QAAM,kBAAkB,uBAAuB,SAAS;AACxD,MAAI,CAAC,8BAA8B;AAAA,KAChC,gBAAgB,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,EAC3D,EAAG,QAAO;AACV,QAAM,cAAc,gBAAgB,MAAM,CAAC;AAC3C,MAAI,YAAY,WAAW,EAAG,QAAO;AAErC,SAAO,gBAAgB,MAAM,EAAE,KAAK,CAAC,aAAa;AAChD,QAAI,8BAA8B,QAAQ,EAAG,QAAO;AACpD,UAAM,eAAe,uBAAuB,QAAQ;AACpD,UAAM,uBAAuB,KAAK,IAAI,6BAA6B,YAAY,MAAM;AACrF,QAAI,cAAc;AAClB,QAAI,eAAe;AACnB,eAAW,cAAc,aAAa;AACpC,YAAM,gBAAgB,aAAa;AAAA,QACjC,CAAC,aAAa,UACZ,SAAS,eAAe,6BAA6B,YAAY,WAAW;AAAA,MAChF;AACA,UAAI,kBAAkB,GAAI;AAC1B,sBAAgB;AAChB,oBAAc,gBAAgB;AAAA,IAChC;AACA,WAAO,gBAAgB,wBAClB,CAAC,yBAAyB,WAAW,QAAQ;AAAA,EACpD,CAAC;AACH;AAUA,SAAS,wBACP,WACA,QACA,iBACA,sBACkB;AAClB,QAAM,iBAAiB,uBAAuB,SAAS,EAAE,CAAC,KAAK,IAC5D,QAAQ,oBAAoB,EAAE;AACjC,MAAI,CAAC,8BAA8B,IAAI,aAAa,GAAG;AACrD,WAAO,EAAE,QAAQ,iBAAiB,wBAAwB,MAAM;AAAA,EAClE;AACA,MAAI,yBAAyB,QAAW;AACtC,WAAO,EAAE,QAAQ,iBAAiB,wBAAwB,KAAK;AAAA,EACjE;AACA,QAAM,aAAa,kBAAkB,SACjC,qBAAqB,UACrB,qBAAqB;AACzB,MAAI,eAAe,QAAW;AAC5B,WAAO,EAAE,QAAQ,iBAAiB,wBAAwB,KAAK;AAAA,EACjE;AACA,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,iBAAiB;AAAA,IACjB,wBAAwB;AAAA,IACxB,gBAAgB;AAAA,IAChB,yBAAyB;AAAA,EAC3B;AACF;AAEA,SAAS,uBAAuB,WAAmB,SAA6C;AAC9F,MAAI;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR;AAAA,IACA,QAAQ;AAAA,EACV,GAAG;AACD,WAAO;AAAA,EACT;AACA,MACE,QAAQ,mBAAmB,UACxB,CAAC;AAAA,KACD,uBAAuB,SAAS,EAAE,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,IAC3E,gBAAgB,QAAQ,cAAc,EAAE,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC;AAAA,EAC5F,EACA,QAAO;AACT,QAAM,kBAAoC;AAAA,IACxC,QAAQ,QAAQ;AAAA,IAChB,iBAAiB,QAAQ;AAAA,IACzB,wBAAwB;AAAA,EAC1B;AACA,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB;AAAA,IACA,gBAAgB;AAAA,EAClB,IACI,kBACA;AACN;AAEA,SAAS,oBACP,WACA,QACA,iBACA,6BAA6B,OAC7B,yBAAyB,OAChB;AACT,QAAM,2BAA2B,8BAE7B,oBAAoB,UACjB,uBAAuB,eAAe,MAAM,uBAAuB,MAAM;AAEhF,QAAM,iBAAiB,iBAAiB,WAAW,QAAQ,wBAAwB;AACnF,QAAM,eAAe,0BAA0B,2BAA2B,WAAW,MAAM;AAC3F,QAAM,kBAAkB,uBAAuB,SAAS;AACxD,QAAM,0BAA0B,0BAC3B,8BAA8B;AAAA,KAC9B,gBAAgB,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,EAC3D;AACF,MAAI,2BAA2B,CAAC,aAAc,QAAO;AACrD,MAAI,CAAC,kBAAkB,CAAC,aAAc,QAAO;AAC7C,MAAI,oBAAoB,OAAW,QAAO;AAC1C,QAAM,UAAU,iBAAiB,SAAS;AAC1C,QAAM,0BAA0B,CAAC,8BAC5B,oBAAoB,UACpB,uBAAuB,eAAe,MAAM,uBAAuB,MAAM;AAC9E,SAAO,QAAQ,SAAS,MAEpB,QAAQ,MAAM,CAAC,WACb,mBAAmB,QAAQ,iBAAiB,4BAA4B,uBAAuB,CAAC,KAC/F,iBAAiB,WAAW,QAAQ,eAAe;AAE5D;AAEA,SAAS,yBACP,SACA,SACA,WAC8B;AAC9B,QAAM,SAAS,QAAQ,KAAK,CAAC,cAAc,qBAAqB,SAAS,WAAW,SAAS,CAAC;AAC9F,MAAI,WAAW,OAAW,QAAO;AACjC,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf,iBAAiB;AAAA,IACjB,wBAAwB,8BAA8B;AAAA,OACnD,uBAAuB,OAAO,EAAE,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,IAC3E;AAAA,EACF;AACF;AAEA,SAAS,uBACP,QACA,qBACQ;AACR,QAAM,YAAY,gBAAgB,MAAM;AACxC,QAAM,kBAAkB,oBAAI,IAAY;AACxC,aAAW,sBAAsB,qBAAqB;AACpD,UAAM,eAAe,UAAU,QAAQ,kBAAkB;AACzD,QAAI,eAAe,EAAG;AACtB,QAAI,WAAW;AACf,WACE,WAAW,UAAU,SAAS,KAC3B,UAAU,QAAQ,EAAG,QAAQ,EAAE,SAAS,GAAG,KAC3C,2CAA2C;AAAA,MAC5C,UAAU,WAAW,CAAC,EAAG,UAAU;AAAA,IACrC,GACA;AACA,kBAAY;AAAA,IACd;AACA,aAAS,QAAQ,cAAc,SAAS,UAAU,SAAS,GAAG;AAC5D,sBAAgB,IAAI,KAAK;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,CAAC,GAAG,eAAe,EACvB,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK,EAClC,IAAI,CAAC,UAAU,UAAU,KAAK,CAAE,EAChC,KAAK,GAAG;AACb;AACA,SAAS,4BACP,MACA,QACA,mBACQ;AACR,MAAI,KAAK,aAAa,eAAe,KAAK,mBAAmB,OAAW,QAAO;AAC/E,QAAM,yBAAyB,IAAI;AAAA,IACjC,gBAAgB,iBAAiB,EAAE,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC;AAAA,EACvF;AACA,QAAM,sBAAsB,KAAK,eAAe;AAAA,IAAO,CAAC,SACtD,oBAAoB,KAAK,QAAQ,mBAAmB,QAAW,KAAK;AAAA,EACtE;AACA,MAAI,oBAAoB,WAAW,EAAG,QAAO;AAC7C,SAAO,gBAAgB,MAAM,EAC1B,OAAO,CAAC,aAAa;AACpB,QAAI,uBAAuB,IAAI,uBAAuB,QAAQ,CAAC,EAAG,QAAO;AACzE,UAAM,iBAAiB,SAAS,QAAQ;AACxC,WAAO,oBAAoB;AAAA,MAAK,CAAC,SAC/B,CAAC,GAAG,SAAS,KAAK,MAAM,CAAC,EAAE;AAAA,QAAK,CAAC,UAC/B,CAAC,GAAG,cAAc,EAAE,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC;AAAA,MAC5F;AAAA,IACF;AAAA,EACF,CAAC,EACA,KAAK,GAAG;AACb;AACA,SAAS,mBACP,MACA,QACA,iBACA,sBACA,qBACA,WAAoC,OACpC,SACA,WAC+C;AAK/C,QAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,QAAM,qBAAqB,MAAM,SAAS,KAAK,KAAK,QAAQ,SAAS,KAAK,KAAK,KAAK,YAAY,QAC5F,KAAK,QAAQ,MAAM,GAAG,KAAK,QAAQ,SAAS,MAAM,MAAM,IACxD;AACJ,QAAM,gBACJ,aAAa,QACV,MAAM,KAAK,EAAE,SAAS,MACrB,mBAAmB,SAAS,IAAI,KAAK,WAAW,KAAK,kBAAkB,KACvE,QACA;AACN,QAAM,iBAAiB;AAAA,IACrB,KAAK;AAAA,IACL,wBAAwB,KAAK,SAAS,QAAQ,iBAAiB,oBAAoB;AAAA,EACrF;AACA,MAAI,cAAc,KAAK;AACvB,MAAI,cAAc;AAClB,MAAI,gBAAgB;AACpB,MACE,CAAC;AAAA,IACC,KAAK;AAAA,IACL,eAAe;AAAA,IACf,eAAe;AAAA,IACf;AAAA,IACA,eAAe;AAAA,EACjB,GACA;AACA,UAAM,eAAe,aAAa,OAC9B,SACA,yBAAyB,KAAK,SAAS,SAAS,SAAS;AAC7D,QAAI,iBAAiB,QAAW;AAC9B,oBAAc;AACd,sBAAgB;AAAA,IAClB,OAAO;AACL,UAAI,kBAAkB,OAAW,QAAO;AACxC,oBAAc;AACd,oBAAc;AAAA,QACZ;AAAA,QACA,wBAAwB,aAAa,QAAQ,iBAAiB,oBAAoB;AAAA,MACpF;AACA,UAAI,CAAC;AAAA,QACH;AAAA,QACA,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ;AAAA,QACA,YAAY;AAAA,MACd,EAAG,QAAO;AAAA,IACZ;AAAA,EACF;AACA,QAAM,gBAAgB,KAAK;AAC3B,QAAM,wBAAwB,kBAAkB,SAC5C,SACA,sBAAsB,aAAa,KAAK;AAG5C,QAAM,0BAA0B,gBAAgB,CAAC,IAAI,gBAAgB,YAAY,mBAAmB,YAAY,MAAM,EAAE;AAAA,IACtH,CAAC,aACD;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,IACd;AAAA,EACF;AACA,QAAM,uBAAuB,kBAAkB,SAC3C,wBAAwB,CAAC,IACzB,wBAAwB;AAAA,IAAK,CAAC,aAC9B;AAAA,MACE,yBAAyB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,IACd;AAAA,EACF,KAAK,wBAAwB,CAAC;AAChC,QAAM,kBAAkB,wBAAwB,YAAY;AAC5D,QAAM,2BAA2B,yBAAyB,SACtD,YAAY,kBACZ;AAEJ,QAAM,oBAAoB,gBACtB,YAAY,SACZ;AAAA,IACA,YAAY,mBAAmB,YAAY;AAAA,IAC3C;AAAA,EACF;AACF,QAAM,qBAAqB,KAAK,uBAC5B,OAAO;AAAA,IACP,OAAO,QAAQ,KAAK,oBAAoB,EACrC;AAAA,MAAO,CAAC,CAAC,KAAK,KAAK,MAClB;AAAA,QACE,GAAG,GAAG,KAAK,KAAK;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF;AAAA,EACJ,IACE;AACJ,QAAM,2BAA2B;AAAA,IAC/B;AAAA,IACA,YAAY,mBAAmB,YAAY;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,yBAAyB,KAAK,iBAChC,KAAK,eAAe,QAAQ,CAAC,SAAS;AACtC,QAAI,CAAC,oBAAoB,KAAK,QAAQ,0BAA0B,QAAW,KAAK,EAAG,QAAO,CAAC;AAC3F,UAAM,kBAAkB,KAAK,mBACxB,oBAAoB,KAAK,iBAAiB,0BAA0B,QAAW,KAAK,IACrF,KAAK,kBACL;AACJ,UAAM,WAAW,KAAK,YACjB,oBAAoB,KAAK,SAAS,WAAW,0BAA0B,QAAW,KAAK,IACxF,KAAK,WACL;AACJ,UAAM;AAAA,MACJ,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,GAAG;AAAA,IACL,IAAI;AACJ,WAAO,CAAC;AAAA,MACN,GAAG;AAAA,MACH,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,MAC3D,GAAI,aAAa,SAAY,EAAE,SAAS,IAAI,CAAC;AAAA,IAC/C,CAAC;AAAA,EACH,CAAC,IACC;AACJ,QAAM,yBAAyB,KAAK,kBAC/B,KAAK,eAAe,MAAM,SAAS,KACnC;AAAA,IACD,KAAK,eAAe;AAAA,IACpB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ;AAAA,IACA,YAAY;AAAA,EACd,KACG,KAAK,eAAe,MAAM;AAAA,IAAM,CAAC,SAClC;AAAA,MACE,KAAK;AAAA,MACL,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ;AAAA,MACA,YAAY;AAAA,IACd;AAAA,EACF,IACE;AAAA,IACA,OAAO,KAAK,eAAe;AAAA,IAC3B,aAAa,KAAK,eAAe;AAAA,IACjC,GAAI,KAAK,eAAe,mBACnB;AAAA,MACD,KAAK,eAAe;AAAA,MACpB,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ;AAAA,MACA,YAAY;AAAA,IACd,IACE,EAAE,iBAAiB,KAAK,eAAe,gBAAgB,IACvD,CAAC;AAAA,EACP,IACE;AACJ,QAAM,oBAAoB,yBACrB,oBAAoB,uBAAuB,iBAAiB,wBAAwB,IACrF,gBACA;AACJ,QAAM,oBAAoB,KAAK,cAAc,UACxC,qBAAqB,KAAK,WAAW,iBAAiB,IACvD,KAAK,YACL;AACJ,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,sBAAsB;AAAA,IACtB,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,WAAW;AAAA,IACX,GAAG;AAAA,EACL,IAAI;AACJ,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAI,sBAAsB,SAAY,EAAE,WAAW,kBAAkB,IAAI,CAAC;AAAA,IAC1E,GAAI,sBAAsB,OAAO,KAAK,kBAAkB,EAAE,SAAS,IAC/D,EAAE,sBAAsB,mBAAmB,IAC3C,CAAC;AAAA,IACL,GAAI,0BAA0B,uBAAuB,SAAS,IAC1D,EAAE,gBAAgB,uBAAuB,IACzC,CAAC;AAAA,IACL,GAAI,2BAA2B,SAAY,EAAE,gBAAgB,uBAAuB,IAAI,CAAC;AAAA,IACzF,GAAI,sBAAsB,SAAY,EAAE,WAAW,kBAAkB,IAAI,CAAC;AAAA,EAC5E;AACF;AAEA,SAAS,qBACP,QACA,QACA,iBACA,eACkD;AAClD,QAAM,eAAe,qBAAqB,OAAO,MAAM,MAAM;AAC7D,MAAI,CAAC,gBAAgB,kBAAkB,OAAW,QAAO;AACzD,QAAM,eAAe,eAAe,yBAAyB,OAAO,MAAM,MAAM,IAAI;AACpF,QAAM,wBAAwB,CAAC,gBAAgB,oBAAoB,SAC/D,SACA,yBAAyB,OAAO,MAAM,eAAe;AACzD,SAAO,kBAAkB,QAAQ,CAAC,SAC/B,gBAAgB,oBAAoB,MAAM,cAAc,qBAAqB,KAC3E,gBAAgB,IAAI,MAAM,IAAI;AACrC;AAEA,SAAS,2BAA2B,MAAsB;AACxD,SAAO,iCAAiC,IAAI,EAAE,KAAK,GAAG;AACxD;AAEA,SAAS,uBACP,cACA,QACA,iBACS;AACT,QAAM,aAAa,2BAA2B,aAAa,MAAM;AACjE,QAAM,aAAa,2BAA2B,aAAa,MAAM;AACjE,QAAM,cAAc,SAAS,aAAa,KAAK;AAC/C,MAAI,WAAW,WAAW,KAAK,WAAW,WAAW,KAAK,YAAY,SAAS,EAAG,QAAO;AACzF,QAAM,eAAe,GAAG,UAAU,IAAI,aAAa,KAAK,IAAI,UAAU;AACtE,QAAM,wBAAwB,gBAAgB,MAAM,EAAE,KAAK,CAAC,aAAa;AACvE,QAAI,8BAA8B,QAAQ,EAAG,QAAO;AACpD,WAAO,mBAAmB,cAAc,QAAQ,MAAM,KACjD,CAAC,yBAAyB,cAAc,QAAQ;AAAA,EACvD,CAAC;AACD,SAAO,yBACF,oBAAoB,cAAc,QAAQ,eAAe;AAChE;AACA,IAAM,2BAA2B,oBAAI,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,IAAM,mCAAmC;AACzC,IAAM,sCAAsC,IAAI;AAAA,EAC9C;AAAA,EAEA;AACF;AAEA,SAAS,eAAe,UAA2B;AACjD,SAAO,iDAAiD,KAAK,SAAS,KAAK,CAAC;AAC9E;AACA,SAAS,cAAc,UAA2B;AAChD,SAAO,WAAW,KAAK,SAAS,KAAK,CAAC;AACxC;AAEA,SAAS,wBAAwB,UAAkB,UAA2B;AAC5E,MAAI,CAAC,cAAc,QAAQ,EAAG,QAAO;AACrC,SAAO,kFAAkF;AAAA,IACvF;AAAA,EACF;AACF;AAEA,SAAS,0BAA0B,UAAkB,UAA2B;AAC9E,MAAI,CAAC,eAAe,QAAQ,EAAG,QAAO;AACtC,SAAO,iBAAiB,QAAQ,EAAE;AAAA,IAAK,CAAC,EAAE,MAAM,MAC9C,yBAAyB,IAAI,KAAK,KAAK,oBAAoB,KAAK,KAAK;AAAA,EACvE,KACK,iCAAiC,KAAK,QAAQ,KAC9C,oCAAoC,KAAK,QAAQ;AACxD;AAGA,SAAS,wBAAwB,UAA2B;AAC1D,SAAO,uIACJ,KAAK,QAAQ;AAClB;AAEA,SAAS,cAAc,UAA2B;AAChD,SAAO,uHACJ,KAAK,SAAS,KAAK,CAAC;AACzB;AAEA,IAAM,uCAAuC,IAAI;AAAA,EAC/C;AAAA,EAGA;AACF;AAEA,SAAS,yBAAyB,UAAkB,UAA2B;AAC7E,QAAM,qBAAqB,SAAS,KAAK;AACzC,QAAM,sBAAsB,qCAAqC,KAAK,kBAAkB;AACxF,QAAM,eAAe,iCAAiC,QAAQ;AAC9D,MAAI,wBAAwB,MAAM;AAChC,UAAM,sBAAsB,iBAAiB,oBAAoB,CAAC,KAAK,EAAE;AACzE,UAAM,iBAAiB,oBAAoB,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACrF,QAAI,iBAAiB,EAAG,QAAO;AAC/B,UAAM,gBAAgB;AAAA,MACpB,oBAAoB,MAAM,GAAG,cAAc,EAAE,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AAAA,IACrF;AACA,UAAMA,mBAAkB;AAAA,MACtB,oBAAoB,MAAM,cAAc,EAAE,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AAAA,IAClF;AACA,QAAI,cAAc,WAAW,KAAKA,iBAAgB,WAAW,EAAG,QAAO;AACvE,QAAIC,eAAc;AAClB,eAAW,SAAS,CAAC,GAAG,eAAe,GAAGD,gBAAe,GAAG;AAC1D,YAAM,eAAe,aAAa;AAAA,QAChC,CAAC,aAAa,UACZ,SAASC,gBAAe,6BAA6B,OAAO,WAAW;AAAA,MAC3E;AACA,UAAI,iBAAiB,GAAI,QAAO;AAChC,MAAAA,eAAc,eAAe;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AAEA,QAAM,uBAAuB,0CAA0C,KAAK,kBAAkB;AAC9F,MAAI,yBAAyB,KAAM,QAAO;AAC1C,QAAM,kBAAkB,uBAAuB,qBAAqB,CAAC,KAAK,EAAE;AAC5E,QAAM,eAAe,uBAAuB,qBAAqB,CAAC,KAAK,EAAE;AACzE,MAAI,gBAAgB,WAAW,KAAK,aAAa,WAAW,EAAG,QAAO;AACtE,QAAM,iBAAiB,aAAa,UAAU,CAAC,gBAC7C,6BAA6B,gBAAgB,CAAC,GAAI,WAAW,CAAC;AAChE,MAAI,mBAAmB,GAAI,QAAO;AAClC,MAAI,cAAc,iBAAiB,gBAAgB;AACnD,aAAW,eAAe,cAAc;AACtC,UAAM,cAAc,aAAa;AAAA,MAC/B,CAAC,aAAa,UACZ,SAAS,eAAe,6BAA6B,aAAa,WAAW;AAAA,IACjF;AACA,QAAI,gBAAgB,GAAI,QAAO;AAC/B,kBAAc,cAAc;AAAA,EAC9B;AACA,SAAO;AACT;AAEA,SAAS,2BACP,UACA,QACA,iBACS;AACT,QAAM,iBAAiB,SAAS,QAAQ;AACxC,MAAI,eAAe,SAAS,EAAG,QAAO;AACtC,QAAM,kBAAkB,mFACrB,KAAK,SAAS,KAAK,CAAC;AACvB,QAAM,oBAAoB,IAAI,IAAI,gBAAgB,mBAAmB,MAAM,EAAE,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC,CAAC;AAChI,QAAM,YAAY,gBAAgB,MAAM;AACxC,SAAO,UAAU,KAAK,CAAC,UAAU,UAAU;AACzC,QAAI,CAAC,kBAAkB,IAAI,uBAAuB,QAAQ,CAAC,EAAG,QAAO;AACrE,QAAI,8BAA8B,QAAQ,EAAG,QAAO;AACpD,QAAI,cAAc,QAAQ,GAAG;AAC3B,YAAM,oBAAoB,UAAU,QAAQ,CAAC;AAC7C,aAAO,sBAAsB,UACxB,8BAA8B,iBAAiB,KAC/C,mBAAmB,UAAU,iBAAiB,MAAM;AAAA,IAC3D;AACA,QAAI,wBAAwB,QAAQ,EAAG,QAAO;AAC9C,UAAM,QAAQ,mBAAmB,UAAU,UAAU,KAAK;AAC1D,QAAI,UAAU,EAAG,QAAO;AACxB,UAAM,iBAAiB,SAAS,QAAQ;AACxC,UAAM,iBAAiB,CAAC,GAAG,cAAc,EAAE,KAAK,CAAC,UAAU,CAAC,eAAe,IAAI,KAAK,CAAC;AACrF,YAAQ,mBAAmB,mBACtB,0BAA0B,UAAU,QAAQ,KAC5C,wBAAwB,UAAU,QAAQ,KAC1C,yBAAyB,UAAU,QAAQ;AAAA,EAClD,CAAC;AACH;AAEA,SAAS,eACP,UACA,QACA,iBACmD;AACnD,MAAI,2BAA2B,SAAS,UAAU,QAAQ,eAAe,EAAG,QAAO;AACnF,MAAI,CAAC,oBAAoB,SAAS,UAAU,QAAQ,iBAAiB,IAAI,EAAG,QAAO;AACnF,QAAM,oBAAoB,SAAS,QAAQ,KAAK;AAChD,MACE,kBAAkB,SAAS,KACxB,CAAC,oBAAoB,mBAAmB,mBAAmB,QAAQ,QAAW,KAAK,GACtF;AACA,WAAO,EAAE,GAAG,UAAU,SAAS,GAAG;AAAA,EACpC;AACA,SAAO;AACT;AAEA,SAAS,wBACP,WACA,QACA,iBACA,sBACS;AACT,QAAM,UAAU;AAAA,IACd;AAAA,IACA,wBAAwB,WAAW,QAAQ,iBAAiB,oBAAoB;AAAA,EAClF;AACA,SAAO;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR;AAAA,IACA,QAAQ;AAAA,EACV;AACF;AAEO,SAAS,+BACd,QACA,QACA,iBACA,sBACA,qBACA,WAAoC,OACpC,gBACkB;AAClB,MAAI,OAAO,KAAK,EAAE,WAAW,GAAG;AAC9B,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,CAAC;AAAA,MACR,gBAAgB,CAAC;AAAA,MACjB,UAAU,CAAC;AAAA,MACX,WAAW,CAAC;AAAA,MACZ,GAAI,OAAO,kBAAkB,SAAY,EAAE,eAAe,CAAC,EAAE,IAAI,CAAC;AAAA,MAClE,oBAAoB;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,cAAc,mBAAmB;AACvC,QAAM,cAA6B,CAAC;AACpC,QAAM,YAAY;AAAA,IAChB,OAAO,MAAM,KAAK,CAAC,SAAS,OAAO,KAAK,UAAU,QAAQ,IAAI,SAAS,WAAW,IAAI,oBAAI,IAAI;AAAA,EAChG;AACA,QAAM,QAAQ,OAAO,MAAM,QAAQ,CAAC,SAAS;AAC3C,UAAM,UAAU,aAAa,KAAK,OAAO,aAAa,cAAc;AACpE,UAAM,WAAW;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,QAAI,aAAa,OAAW,QAAO,CAAC;AACpC,gBAAY,KAAK,GAAG,OAAO;AAC3B,WAAO,CAAC,QAAQ;AAAA,EAClB,CAAC;AACD,QAAM,iBAAiB,OAAO,eAAe;AAAA,IAAO,CAAC,WACnD,wBAAwB,QAAQ,QAAQ,iBAAiB,oBAAoB;AAAA,EAC/E;AACA,QAAM,WAAW,OAAO,SAAS,QAAQ,CAAC,WAAW;AACnD,UAAM,gBAAgB,2BAA2B,QAAQ,aAAa,SAAS;AAC/E,UAAM,WAAW,qBAAqB,QAAQ,QAAQ,iBAAiB,aAAa;AACpF,WAAO,aAAa,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,EAChD,CAAC;AACD,QAAM,YAAY,OAAO,UAAU,QAAQ,CAAC,aAAa;AACvD,UAAM,WAAW,eAAe,UAAU,QAAQ,eAAe;AACjE,WAAO,aAAa,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,EAChD,CAAC;AACD,QAAM,gBAAgB,OAAO,eAAe;AAAA,IAAO,CAAC,iBAClD,uBAAuB,cAAc,QAAQ,eAAe,KACzD,4BAA4B,cAAc,aAAa,SAAS;AAAA,EACrE;AACA,QAAM,qBAAqB,OAAO,sBAC7B;AAAA,IACD,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,EACF,IACE,OAAO,qBACP;AAEJ,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,OAAO,kBAAkB,SAAY,EAAE,cAAc,IAAI,CAAC;AAAA,IAC9D,GAAI,uBAAuB,SAAY,EAAE,mBAAmB,IAAI,EAAE,oBAAoB,OAAU;AAAA,EAClG;AACF;","names":["predicateTokens","sourceIndex"]}

package/dist/{chunk-KI6UOSNR.js → chunk-DEY7B77Y.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-5FVVY2EB.js";
 import {
   withHeldFileLock
-} from "./chunk-EHRE7ZG3.js";
+} from "./chunk-5B5WYAHQ.js";
 import {
   SecureStoreLockedError,
   readMaybeEncryptedFile,
@@ -577,4 +577,4 @@ export {
   FactHashIndexNotAuthoritativeError,
   ContentHashIndex
 };
-//# sourceMappingURL=chunk-KI6UOSNR.js.map
+//# sourceMappingURL=chunk-DEY7B77Y.js.map

package/dist/chunk-DEY7B77Y.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/storage/content-hash-index.ts"],"sourcesContent":["// Content-hash dedup index for facts, extracted from storage.ts (issue #1909 /\n// PR #2016 write-hot-paths). Self-contained: cross-process locked reconcile /\n// rebuild saves plus the deferred durable-retry machinery. storage.ts imports\n// these back and re-exports the class + companion types that were previously\n// part of its public API.\nimport { mkdir, stat } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { computeContentHash, normalizeContent } from \"../content-hash.js\";\nimport { log } from \"../logger.js\";\nimport { SecureStoreLockedError, readMaybeEncryptedFile, writeMaybeEncryptedFile } from \"../secure-store/secure-fs.js\";\nimport { isErrnoCode } from \"../utils/errno.js\";\nimport { withHeldFileLock } from \"../utils/serialize-mutations.js\";\n\n/**\n * Stale threshold (ms) for the per-file advisory lock guarding a fact-hash\n * index merge-save (issue #1909 review round 7). The critical section is a\n * single read+atomic-rewrite of one index file (≤ a few MB), so a holder older\n * than this is treated as crashed. Generous to tolerate slow/encrypted disks\n * without breaking a legitimately in-progress publish.\n */\nconst CONTENT_HASH_INDEX_LOCK_STALE_MS = 30_000;\n/** Version marker for the normalized Unicode hash index format. */\nconst CONTENT_HASH_INDEX_FORMAT_HEADER = \"# remnic-content-hash-index:v2\";\n\nfunction parseHashIndex(raw: string): { versioned: boolean; hashes: Set<string> } {\n  const lines = raw\n    .split(\"\\n\")\n    .map((line) => line.trim())\n    .filter((line) => line.length > 0);\n  if (lines[0] !== CONTENT_HASH_INDEX_FORMAT_HEADER) {\n    return { versioned: false, hashes: new Set() };\n  }\n  return { versioned: true, hashes: new Set(lines.slice(1)) };\n}\n\nfunction serializeHashIndex(hashes: Set<string>): string {\n  return `${CONTENT_HASH_INDEX_FORMAT_HEADER}\\n${[...hashes].join(\"\\n\")}\\n`;\n}\n\n/**\n * Durable-retry policy for a deferred content-hash reconcile save whose\n * cross-process lock acquire timed out (issue #1909 / PR #2016). When the lock\n * is contended past `withHeldFileLock`'s bounded wait, the added hashes are held\n * only in this process's memory; relying on \"some later batch save\" is not\n * durable (the run may be the last before idle/shutdown), and a long-lived peer\n * that already built its authoritative in-memory index will not see the write.\n * So we schedule a bounded, exponentially-backed-off background retry that keeps\n * re-attempting the locked publish until it lands. Bounded because the durable\n * fact `.md` is already on disk and a process restart rebuilds the index from\n * the corpus regardless — exhausting retries degrades to that rebuild safety\n * net, never to data loss or a fatal append failure.\n */\nconst CONTENT_HASH_INDEX_RETRY_MAX_ATTEMPTS = 5;\n/** Base backoff (ms) before the first deferred reconcile-save retry; doubles each attempt. */\nconst CONTENT_HASH_INDEX_RETRY_BASE_MS = 500;\n/** Ceiling (ms) for the exponential reconcile-save retry backoff. */\nexport const CONTENT_HASH_INDEX_RETRY_MAX_DELAY_MS = 5_000;\n\n/**\n * Tuning for {@link ContentHashIndex} cross-process lock waits and the\n * deferred reconcile-save durable retry (issue #1909 / PR #2016). All optional;\n * production uses the module defaults. Tests inject small values so the\n * lock-timeout + retry path is exercised deterministically without real\n * multi-second waits.\n */\nexport interface ContentHashIndexLockOptions {\n  /** Bounded wait to acquire the per-file advisory lock; passed to `withHeldFileLock` (default 5000ms). */\n  readonly maxWaitMs?: number;\n  /** Poll interval while waiting for a busy lock (default 50ms). */\n  readonly pollMs?: number;\n  /** Base backoff before the first deferred-save retry (default 500ms). */\n  readonly retryBaseMs?: number;\n  /** Max deferred-save retries before falling back to the corpus-rebuild safety net (default 5). */\n  readonly retryMaxAttempts?: number;\n  /**\n   * Tombstone-blocked capture write-lock backoff (COS-392). These do not\n   * change the fact-hash index lock. Omitted fields use the 50ms / 2s / 60s\n   * defaults. Converge copies its config here before replicating a file.\n   */\n  readonly captureWriteLockInitialDelayMs?: number;\n  readonly captureWriteLockMaxDelayMs?: number;\n  readonly captureWriteLockDeadlineMs?: number;\n  /** Apply abort signal. Checked before each probe, during backoff, and before the write. */\n  readonly captureWriteLockSignal?: AbortSignal;\n}\n\n/**\n * Thrown when the fact-hash index cannot be made authoritative — the\n * cross-process rebuild lock could not be acquired within the bounded retry\n * budget (PR #2016). Callers that require an authoritative dedup answer surface\n * this instead of silently trusting a stale loaded snapshot.\n */\nexport class FactHashIndexNotAuthoritativeError extends Error {\n  constructor(stateDir: string) {\n    super(\n      `fact-hash index is not authoritative: the cross-process rebuild lock for ${stateDir} could not be acquired within the bounded retry budget`\n    );\n    this.name = \"FactHashIndexNotAuthoritativeError\";\n  }\n}\n\ntype DiskFingerprint = {\n  mtimeMs: number;\n  size: number;\n  dev: number;\n  ino: number;\n  ctimeMs: number;\n  birthtimeMs: number;\n};\nexport interface ContentHashPathEntry {\n  readonly path: string;\n  readonly contentHash: string;\n}\n\n/**\n * Content-hash dedup index for facts.\n * Normalizes content (lowercase, strip punctuation, collapse whitespace),\n * computes SHA-256, and stores hashes in a line-delimited file.\n * Prevents writing semantically identical facts.\n */\nexport class ContentHashIndex {\n  private hashes: Set<string> = new Set();\n  /**\n   * Fact-ONLY hash partition (issue #2474). `hashes` above is category-blind\n   * (every write category registers there); this subset carries only\n   * `category === \"fact\"` hashes so fact-only membership checks\n   * (`hasFact*`) can never be satisfied by an unrelated decision/preference\n   * sharing the same normalized body. In-memory only — never serialized to\n   * fact-hashes.txt; `clear()` drops it and every authoritative rebuild\n   * repopulates it via `addFactByHash`. Subset invariant: `factHashes ⊆\n   * hashes` — `addFact*` registers in both, and the removal sites that drop\n   * a shared hash also drop the partition entry (removal stays caller-paired\n   * because shared-index removal is category-blind: archiving a non-fact\n   * must not evict an active fact's fact-only membership).\n   */\n  private factHashes: Set<string> = new Set();\n  private dirty = false;\n  /** True when load() found the pre-Unicode, markerless on-disk format. */\n  private formatMigrationRequired = false;\n  /**\n   * Hashes explicitly removed since the last successful save (issue #1909 review\n   * round 8 thread 3). Tracked separately so `saveMergingWithDisk` can be\n   * removal-AWARE: under the file lock it reads the latest on-disk set, DROPS\n   * these, then unions our additions — so a removal batch cannot resurrect a\n   * hash (union alone would) and cannot clobber a concurrent extraction's\n   * appended hash (blind overwrite would). Consumed + cleared by every save.\n   */\n  private removed: Set<string> = new Set();\n  /**\n   * Hashes added by THIS instance since the last successful save (issue #1909\n   * review round 9 finding 3). Tracked separately from the loaded snapshot so a\n   * reconciling save publishes `(on-disk \\ removed) ∪ added` — it re-applies only\n   * OUR additions, never the stale loaded entries. Without this, seeding the\n   * merge from `this.hashes` (loaded ∪ added) would resurrect a hash a peer\n   * removed on disk while this instance held a stale snapshot.\n   */\n  private added: Set<string> = new Set();\n  private readonly filePath: string;\n  private readonly secureStoreKeyProvider: () => Buffer | null;\n  private readonly secureStoreWriteKeyProvider: () => Buffer | null;\n  private readonly memoryDir: string;\n  private readonly lockOptions: ContentHashIndexLockOptions;\n  /**\n   * Deferred reconcile-save durable-retry state (issue #1909 / PR #2016). At\n   * most ONE retry is ever armed (`reconcileRetryTimer` is the reentrancy guard)\n   * so successive timed-out saves cannot stack duplicate/parallel retries.\n   * `reconcileRetryBarrier` resolves when the chain settles (published or gave\n   * up) — awaited by tests and any caller wanting the eventual result.\n   */\n  private reconcileRetryTimer: NodeJS.Timeout | null = null;\n  private reconcileRetryAttempts = 0;\n  private reconcileRetryBarrier: Promise<void> | null = null;\n  private reconcileRetryResolve: (() => void) | null = null;\n  /**\n   * On-disk fingerprint captured at the last point THIS instance's in-memory\n   * set matched disk — after `load()`, `save()`, or a reconcile publish. A peer\n   * process that advances the durable index changes its file generation even\n   * when byte size and mtime collide, so the freshness check remains safe\n   * without an O(file-size) read on the hot path.\n   */\n  private lastSyncedFingerprint: DiskFingerprint | null = null;\n  constructor(\n    stateDir: string,\n    secureStoreKeyProvider: () => Buffer | null = () => null,\n    secureStoreWriteKeyProvider: () => Buffer | null = secureStoreKeyProvider,\n    memoryDir: string = path.dirname(stateDir),\n    lockOptions: ContentHashIndexLockOptions = {}\n  ) {\n    this.filePath = path.join(stateDir, \"fact-hashes.txt\");\n    this.secureStoreKeyProvider = secureStoreKeyProvider;\n    this.secureStoreWriteKeyProvider = secureStoreWriteKeyProvider;\n    this.memoryDir = memoryDir;\n    this.lockOptions = lockOptions;\n  }\n  /** Whether a caller with an authoritative corpus must rebuild this legacy index. */\n  get requiresFormatMigration(): boolean {\n    return this.formatMigrationRequired;\n  }\n\n  /** Load existing hashes from disk. Safe to call multiple times. */\n  async load(): Promise<void> {\n    try {\n      const raw = await readMaybeEncryptedFile(this.filePath, this.secureStoreKeyProvider(), this.memoryDir);\n      const parsed = parseHashIndex(raw);\n      this.formatMigrationRequired = !parsed.versioned;\n      if (!parsed.versioned) {\n        // Hashes from the pre-NFC format are unsafe after normalization changes.\n        // Ignore them until an authoritative corpus rebuild publishes v2.\n        this.hashes.clear();\n        log.warn(`content-hash index: ignored legacy unversioned index at ${this.filePath}`);\n      } else {\n        for (const hash of parsed.hashes) this.hashes.add(hash);\n      }\n      log.debug(`content-hash index: loaded ${this.hashes.size} hashes`);\n    } catch (err) {\n      if (err instanceof SecureStoreLockedError) throw err;\n      if (!isErrnoCode(err, \"ENOENT\")) throw err;\n      log.debug(\"content-hash index: no existing index — starting fresh\");\n    }\n    // The loaded set now reflects the on-disk file — baseline the fingerprint so\n    // a later peer write is detectable (PR #2016 review).\n    await this.captureSyncedFingerprint();\n  }\n\n  /** Cheap `stat` of the durable index file; null when it does not exist yet. */\n  private async statIndexFile(): Promise<DiskFingerprint | null> {\n    try {\n      const s = await stat(this.filePath);\n      return {\n        mtimeMs: s.mtimeMs,\n        size: s.size,\n        dev: s.dev,\n        ino: s.ino,\n        ctimeMs: s.ctimeMs,\n        birthtimeMs: s.birthtimeMs,\n      };\n    } catch (err) {\n      if (isErrnoCode(err, \"ENOENT\")) return null;\n      throw err;\n    }\n  }\n\n  /** Record the current on-disk fingerprint as this instance's synced baseline. */\n  private async captureSyncedFingerprint(): Promise<void> {\n    try {\n      this.lastSyncedFingerprint = await this.statIndexFile();\n    } catch (err) {\n      // A stat failure other than ENOENT leaves no baseline; the next freshness\n      // check reports non-current and the caller confirms against the corpus.\n      this.lastSyncedFingerprint = null;\n      log.debug(`content-hash index: could not fingerprint ${this.filePath}: ${err}`);\n    }\n  }\n\n  /**\n   * True when the durable index file is unchanged since this instance last\n   * synced it (load / save / reconcile). False when a peer advanced it, when\n   * the file appeared or vanished, or when freshness cannot be established\n   * (stat error) — the caller then treats the in-memory snapshot as\n   * non-authoritative and confirms a dedup miss against the durable corpus.\n   * The stat includes file identity and generation metadata so same-size,\n   * same-mtime atomic replacements are detected without reading the file body.\n   */\n  async isDiskFingerprintCurrent(): Promise<boolean> {\n    let current: DiskFingerprint | null;\n    try {\n      current = await this.statIndexFile();\n    } catch {\n      return false;\n    }\n    const last = this.lastSyncedFingerprint;\n    if (last === null || current === null) {\n      return last === null && current === null;\n    }\n    return (\n      current.mtimeMs === last.mtimeMs &&\n      current.size === last.size &&\n      current.dev === last.dev &&\n      current.ino === last.ino &&\n      current.ctimeMs === last.ctimeMs &&\n      current.birthtimeMs === last.birthtimeMs\n    );\n  }\n\n  /** Check if content already exists in the index. */\n  has(content: string): boolean {\n    return this.hashes.has(ContentHashIndex.computeHash(content));\n  }\n\n  /** Add content hash to the index. */\n  add(content: string): void {\n    const hash = ContentHashIndex.computeHash(content);\n    // A re-add supersedes a pending removal of the same hash (round 8 thread 3).\n    this.removed.delete(hash);\n    // Record OUR durable delta even when the local snapshot already holds the\n    // hash (PR #2016 thread SD-nG): local membership can be STALE — a peer\n    // removed this hash on disk while this instance kept it in memory. Skipping\n    // `added`/`dirty` on that path let the reconciling save compute\n    // (on-disk \\ removed) ∪ added and silently drop the reintroduced hash, so\n    // the peer never saw it again. Set semantics keep this idempotent (no\n    // duplicate entries) and the `removed.delete` above preserves remove/add\n    // ordering.\n    this.hashes.add(hash);\n    this.added.add(hash);\n    this.dirty = true;\n  }\n\n  get size(): number {\n    return this.hashes.size;\n  }\n\n  /** Clear all loaded hashes so the next save rewrites the index from scratch. */\n  clear(): void {\n    if (this.hashes.size > 0) {\n      this.hashes.clear();\n    }\n    // The fact-only partition is rebuilt with the shared set on every\n    // authoritative corpus rebuild, so it clears here too (issue #2474).\n    this.factHashes.clear();\n    // A full clear is always paired with a plain overwrite save() (rebuild);\n    // pending per-hash add/remove deltas are subsumed by writing the rebuilt set.\n    // Cancel any armed deferred-reconcile retry (PR #2016) so it cannot fire in\n    // the clear→rebuild→save window and union the pre-clear on-disk rows back.\n    this.added.clear();\n    this.removed.clear();\n    this.cancelReconcileRetry();\n    this.dirty = true;\n  }\n\n  /** Persist index to disk if changed (plain whole-file overwrite). */\n  async save(): Promise<void> {\n    if (!this.dirty) return;\n    await mkdir(path.dirname(this.filePath), { recursive: true });\n    // Snapshot the deltas + overwrite body THIS save publishes BEFORE the write\n    // yields the event loop. `writeMaybeEncryptedFile` materializes `serialized`\n    // eagerly, then the disk await lets a concurrent same-process add()/remove()\n    // land a late delta (PR #2016 thread PRRT_kwDORJXyws6SEBri). Clearing the\n    // LIVE added/removed sets afterward — as the previous unconditional\n    // clear()+`dirty = false` did — would drop that late hash from the index AND\n    // leave no retry, so peers never see it until a corpus rebuild. Consume only\n    // what we published; late deltas stay pending. Mirrors saveMergingWithDisk.\n    const publishedAdded = new Set<string>(this.added);\n    const publishedRemoved = new Set<string>(this.removed);\n    const serialized = serializeHashIndex(this.hashes);\n    await writeMaybeEncryptedFile(this.filePath, serialized, this.secureStoreWriteKeyProvider(), {}, this.memoryDir);\n    this.formatMigrationRequired = false;\n    // Consume ONLY the deltas this overwrite published; anything that arrived\n    // during the awaits above remains pending for the next save.\n    for (const h of publishedAdded) this.added.delete(h);\n    for (const h of publishedRemoved) this.removed.delete(h);\n    // Honest dirty state: true iff late deltas remain unpersisted.\n    this.dirty = this.added.size > 0 || this.removed.size > 0;\n    // This overwrite is now the on-disk state — re-baseline the freshness\n    // fingerprint so our own write is not later mistaken for a peer's (PR #2016).\n    await this.captureSyncedFingerprint();\n    if (this.dirty) {\n      // Late deltas landed mid-save: arm a bounded durable retry so they reach\n      // disk even without a further batch save — never a silent in-memory-only\n      // hash. The locked reconcile republishes only OUR delta onto the overwrite.\n      this.scheduleReconcileRetry();\n    } else {\n      // Clean overwrite supersedes any pending deferred reconcile work.\n      this.cancelReconcileRetry();\n    }\n    log.debug(`content-hash index: saved ${this.hashes.size} hashes`);\n  }\n\n  /**\n   * Persist the index by RECONCILING with the latest on-disk state under a\n   * cross-process lock (issue #1909). Used by the extraction-persist batch save\n   * for BOTH append and removal batches, so appends and removals to the same\n   * index serialize against each other:\n   *   final = (on-disk \\ this.removed) ∪ this.added\n   * Note it re-applies only OUR local additions (`added`), NOT the loaded\n   * snapshot (review round 9 finding 3): seeding from `this.hashes` would\n   * resurrect a hash a peer removed on disk while we held a stale snapshot. This\n   * preserves a concurrent writer's appended hashes (a blind overwrite would\n   * drop them), never resurrects a removed hash, and never loses our additions.\n   *\n   * Hardening:\n   *  - Dirty short-circuit (round 7 finding 3): when this instance neither added\n   *    nor removed anything this run, skip the O(file) read+rewrite entirely.\n   *  - Cross-process lock (round 7 finding 2): serialize the read→reconcile→write\n   *    window on a per-file advisory lock. If the lock is NOT acquired (timeout),\n   *    do NOT publish (round 9 finding 2): keep `dirty` set AND schedule a bounded\n   *    durable background retry (PR #2016) that keeps re-attempting the locked\n   *    publish until the deferred additions land — never an unlocked write that\n   *    could clobber a peer, and never a silent \"batch save complete\" that leaves\n   *    the addition in this process's memory only.\n   */\n  async saveMergingWithDisk(): Promise<void> {\n    if (!this.dirty) return;\n    // The advisory lock file lives beside the index — ensure the dir exists\n    // before acquiring it (the index dir may not exist on a first write).\n    await mkdir(path.dirname(this.filePath), { recursive: true });\n    const publish = async (): Promise<void> => {\n      // Snapshot the deltas this publish is responsible for. The read+rewrite\n      // below yields the event loop, so a concurrent add()/remove() can land\n      // new deltas while we await disk (PR #2016 thread SD7Tj). Consuming the\n      // LIVE sets afterward would drop those late deltas AND clear `dirty`,\n      // stranding them in no save at all. We consume only what we published;\n      // anything that arrived meanwhile stays pending for the next save.\n      const publishedAdded = new Set<string>(this.added);\n      const publishedRemoved = new Set<string>(this.removed);\n      const merged = new Set<string>(publishedAdded);\n      try {\n        const raw = await readMaybeEncryptedFile(this.filePath, this.secureStoreKeyProvider(), this.memoryDir);\n        const parsed = parseHashIndex(raw);\n        if (parsed.versioned) {\n          for (const hash of parsed.hashes) {\n            // Keep prior/concurrent on-disk hashes EXCEPT the ones we removed.\n            if (!publishedRemoved.has(hash)) merged.add(hash);\n          }\n        } else {\n          // Do not carry hashes from the pre-NFC format into a v2 write.\n          log.warn(`content-hash index: discarded legacy unversioned entries from ${this.filePath}`);\n        }\n      } catch (err) {\n        if (err instanceof SecureStoreLockedError) throw err;\n        if (!isErrnoCode(err, \"ENOENT\")) throw err;\n        // ENOENT → no on-disk index yet; write our additions as-is.\n      }\n      await mkdir(path.dirname(this.filePath), { recursive: true });\n      await writeMaybeEncryptedFile(\n        this.filePath,\n        serializeHashIndex(merged),\n        this.secureStoreWriteKeyProvider(),\n        {},\n        this.memoryDir\n      );\n      this.formatMigrationRequired = false;\n      // Consume ONLY the deltas we just published; deltas that arrived during\n      // the awaits above remain pending.\n      for (const h of publishedAdded) this.added.delete(h);\n      for (const h of publishedRemoved) this.removed.delete(h);\n      // Fold any still-pending deltas onto the reconciled set so the in-memory\n      // view stays consistent with what the next save will publish.\n      for (const h of this.added) merged.add(h);\n      for (const h of this.removed) merged.delete(h);\n      this.hashes = merged;\n      // Honest dirty state: true iff late deltas remain to be persisted. A\n      // subsequent batch save or the shutdown flush drains them.\n      this.dirty = this.added.size > 0 || this.removed.size > 0;\n      // The reconciled set is now the on-disk state — re-baseline the freshness\n      // fingerprint (captured under the held lock) so our own publish is not\n      // later mistaken for a peer's advance (PR #2016 review).\n      await this.captureSyncedFingerprint();\n    };\n    await withHeldFileLock(\n      `${this.filePath}.lock`,\n      {\n        staleMs: CONTENT_HASH_INDEX_LOCK_STALE_MS,\n        ...(this.lockOptions.maxWaitMs !== undefined ? { maxWaitMs: this.lockOptions.maxWaitMs } : {}),\n        ...(this.lockOptions.pollMs !== undefined ? { pollMs: this.lockOptions.pollMs } : {}),\n      },\n      async (acquired) => {\n        if (!acquired) {\n          // Never publish unlocked (round 9 finding 2): keep dirty AND schedule a\n          // durable background retry (PR #2016). Relying on an unguaranteed later\n          // batch save silently left the addition in this process's memory only;\n          // the retry keeps re-attempting the locked publish until the addition\n          // lands on disk.\n          log.warn(\n            `content-hash index: lock not acquired for ${this.filePath}; deferring reconcile save (dirty retained, scheduling durable retry)`\n          );\n          this.scheduleReconcileRetry();\n          return;\n        }\n        await publish();\n        if (this.dirty) {\n          // A concurrent add()/remove() landed during publish's disk awaits, so\n          // deltas remain unpersisted (PR #2016 thread SD7Tj). Arm a bounded\n          // durable retry so they reach disk even if no further batch save comes\n          // — never leave a settled barrier over pending work.\n          this.scheduleReconcileRetry();\n        } else {\n          // Published cleanly: any pending deferred retry is now satisfied.\n          this.cancelReconcileRetry();\n        }\n      }\n    );\n    log.debug(`content-hash index: reconcile-saved ${this.hashes.size} hashes`);\n  }\n\n  /**\n   * Rebuild-and-publish the index from an authoritative source (the durable\n   * corpus) under the SAME per-file cross-process lock the reconciling\n   * append/removal saves (`saveMergingWithDisk`) use (issue #1909 / PR #2016).\n   * The `populate` callback runs WHILE the lock is held and MUST repopulate this\n   * index from the corpus (`clear()` then `addByHash(...)` for every corpus\n   * hash); the rebuilt set is then published with a plain overwrite that is now\n   * serialized against every locked writer.\n   *\n   * This closes the finding where the previous unlocked clear→scan→save() could\n   * overwrite a peer's newer lock-merged or deferred additions: a locked writer\n   * that committed BEFORE the rebuild acquired the lock has its memory `.md` on\n   * disk and is re-scanned; one that commits AFTER the rebuild releases\n   * reconciles its additions on top of the freshly-published set. No union with\n   * the raw on-disk file is performed, so the rebuild keeps its\n   * garbage-collection property (orphaned hashes for deleted memories drop).\n   *\n   * Lock-acquisition failure is explicit and non-destructive: `populate` is NOT\n   * run and nothing is written (never an unlocked overwrite). Returns true when\n   * the rebuild was published under the lock, false when the lock timed out —\n   * the caller keeps the index non-authoritative and retries on next use. Uses\n   * the same non-reentrant file lock as the reconcile path, so it can never\n   * deadlock with the deferred reconcile-retry: a concurrent locked writer (or a\n   * fired retry) simply yields `acquired=false` after the bounded wait.\n   */\n  async rebuildUnderLock(populate: () => Promise<void>): Promise<boolean> {\n    // The advisory lock file lives beside the index — ensure the dir exists\n    // before acquiring it (the index dir may not exist on a first rebuild).\n    await mkdir(path.dirname(this.filePath), { recursive: true });\n    let published = false;\n    await withHeldFileLock(\n      `${this.filePath}.lock`,\n      {\n        staleMs: CONTENT_HASH_INDEX_LOCK_STALE_MS,\n        ...(this.lockOptions.maxWaitMs !== undefined ? { maxWaitMs: this.lockOptions.maxWaitMs } : {}),\n        ...(this.lockOptions.pollMs !== undefined ? { pollMs: this.lockOptions.pollMs } : {}),\n      },\n      async (acquired) => {\n        if (!acquired) {\n          // Never publish unlocked: a concurrent locked writer holds the lock,\n          // so overwriting now could clobber its addition. Leave the index as-is\n          // and let the caller retry the authoritative rebuild on next use.\n          log.warn(\n            `content-hash index: lock not acquired for ${this.filePath}; deferring authoritative rebuild (index left non-authoritative, retried on next use)`\n          );\n          return;\n        }\n        await populate();\n        // Publish under the held lock. save() takes no lock (no re-entrancy) and\n        // is a full overwrite that supersedes any pending add/remove deltas.\n        await this.save();\n        published = true;\n      }\n    );\n    return published;\n  }\n\n  /**\n   * True while a background durable reconcile-save retry is armed (PR #2016).\n   * Test/introspection hook.\n   */\n  get hasPendingReconcileRetry(): boolean {\n    return this.reconcileRetryTimer !== null;\n  }\n\n  /** True while this index has in-memory changes not yet published to disk. */\n  get hasPendingChanges(): boolean {\n    return this.dirty;\n  }\n\n  /**\n   * Resolve once any armed background reconcile-save retry chain has settled —\n   * either it published the deferred additions, or it exhausted its bounded\n   * attempts and fell back to the corpus-rebuild safety net. Resolves\n   * immediately when nothing is armed. Lets a caller (or a test) await the\n   * eventual durability outcome of a lock-timed-out save.\n   */\n  async whenReconcileRetrySettled(): Promise<void> {\n    await (this.reconcileRetryBarrier ?? Promise.resolve());\n  }\n\n  /**\n   * Drive any deferred lock-timeout reconcile save to completion INLINE at a\n   * lifecycle boundary (PR #2016 finding 3). The background retry timer is\n   * `unref`'d so it never keeps a long-lived daemon alive — but a short-lived\n   * writer (a one-shot CLI) can exit before it fires, leaving a durable fact\n   * `.md` whose hash never reached `fact-hashes.txt` for peers that already\n   * built their in-memory index. `orchestrator.destroy()` calls this so the\n   * addition publishes before the process exits; long-lived hosts only reach it\n   * at their own shutdown, so their in-flight retries keep running in the\n   * background until then. Bounded by the same attempt ceiling as the background\n   * retry; a permanently contended lock falls back to the corpus-rebuild-on-\n   * restart safety net (the fact `.md` is already durable). No deadlock: each\n   * attempt is the same non-reentrant, bounded-wait file lock.\n   */\n  async flushReconcileRetry(): Promise<void> {\n    if (!this.dirty) return;\n    const maxAttempts = this.lockOptions.retryMaxAttempts ?? CONTENT_HASH_INDEX_RETRY_MAX_ATTEMPTS;\n    const baseMs = this.lockOptions.retryBaseMs ?? CONTENT_HASH_INDEX_RETRY_BASE_MS;\n    for (let attempt = 0; this.dirty && attempt < maxAttempts; attempt += 1) {\n      // Cancel the unref'd background timer — we drive the locked publish inline.\n      if (this.reconcileRetryTimer) {\n        clearTimeout(this.reconcileRetryTimer);\n        this.reconcileRetryTimer = null;\n      }\n      await this.saveMergingWithDisk();\n      if (!this.dirty) break;\n      if (attempt < maxAttempts - 1) {\n        const wait = Math.min(baseMs * 2 ** attempt, CONTENT_HASH_INDEX_RETRY_MAX_DELAY_MS);\n        await new Promise<void>((resolve) => setTimeout(resolve, wait));\n      }\n    }\n    // Clear any timer the final saveMergingWithDisk armed and settle the barrier\n    // so awaiters unblock — the bounded inline drain has done its best.\n    if (this.reconcileRetryTimer) {\n      clearTimeout(this.reconcileRetryTimer);\n      this.reconcileRetryTimer = null;\n    }\n    this.reconcileRetryAttempts = 0;\n    this.settleReconcileRetry();\n  }\n\n  /**\n   * Schedule ONE bounded, exponentially-backed-off background retry of the\n   * deferred reconcile save (PR #2016). Reentrant-safe: an already-armed timer\n   * short-circuits, so successive timed-out saves never stack duplicate retries.\n   * When attempts are exhausted the chain settles without publishing — the\n   * durable fact `.md` is on disk and a process restart rebuilds the index from\n   * the corpus, so this degrades to that safety net, never a fatal failure.\n   */\n  private scheduleReconcileRetry(): void {\n    if (this.reconcileRetryTimer) return; // one retry in flight — no duplicate/reentrant retries\n    const maxAttempts = this.lockOptions.retryMaxAttempts ?? CONTENT_HASH_INDEX_RETRY_MAX_ATTEMPTS;\n    if (this.reconcileRetryAttempts >= maxAttempts) {\n      log.warn(\n        `content-hash index: exhausted ${maxAttempts} deferred reconcile-save retries for ${this.filePath}; ` +\n          `${this.added.size} addition(s) remain dirty in-memory (a process restart rebuilds the index from the durable corpus)`\n      );\n      this.reconcileRetryAttempts = 0;\n      this.settleReconcileRetry();\n      return;\n    }\n    if (!this.reconcileRetryBarrier) {\n      this.reconcileRetryBarrier = new Promise<void>((resolve) => {\n        this.reconcileRetryResolve = resolve;\n      });\n    }\n    const attempt = this.reconcileRetryAttempts + 1;\n    const baseMs = this.lockOptions.retryBaseMs ?? CONTENT_HASH_INDEX_RETRY_BASE_MS;\n    const delay = Math.min(baseMs * 2 ** (attempt - 1), CONTENT_HASH_INDEX_RETRY_MAX_DELAY_MS);\n    this.reconcileRetryTimer = setTimeout(() => {\n      this.reconcileRetryTimer = null;\n      this.reconcileRetryAttempts = attempt;\n      void this.saveMergingWithDisk()\n        .catch((err) => {\n          // A publish-time I/O/encryption error (not a lock timeout) is best-effort:\n          // log and let the corpus-rebuild safety net cover it rather than loop.\n          log.warn(`content-hash index: deferred reconcile-save retry failed for ${this.filePath}: ${err}`);\n        })\n        .finally(() => {\n          // If the attempt neither published (dirty cleared → cancelReconcileRetry)\n          // nor re-armed a further retry, the chain has ended — settle the barrier.\n          if (this.dirty && !this.reconcileRetryTimer) this.settleReconcileRetry();\n        });\n    }, delay);\n    this.reconcileRetryTimer.unref?.();\n  }\n\n  /** Cancel any armed reconcile-save retry and settle the barrier (a publish landed). */\n  private cancelReconcileRetry(): void {\n    if (this.reconcileRetryTimer) {\n      clearTimeout(this.reconcileRetryTimer);\n      this.reconcileRetryTimer = null;\n    }\n    this.reconcileRetryAttempts = 0;\n    this.settleReconcileRetry();\n  }\n\n  /** Resolve and clear the retry barrier if one is outstanding. */\n  private settleReconcileRetry(): void {\n    const resolve = this.reconcileRetryResolve;\n    this.reconcileRetryBarrier = null;\n    this.reconcileRetryResolve = null;\n    resolve?.();\n  }\n\n  /** Remove a hash from the index (used when archiving/deleting). */\n  remove(content: string): void {\n    const hash = ContentHashIndex.computeHash(content);\n    // Record the removal (round 8 thread 3) even when the hash is not in our\n    // in-memory set — a reconciling save must still drop it from the latest\n    // on-disk state. A removal supersedes a pending add. Always mark dirty.\n    this.added.delete(hash);\n    this.removed.add(hash);\n    this.hashes.delete(hash);\n    this.dirty = true;\n  }\n\n  /**\n   * Remove a pre-computed SHA-256 hash directly from the index without\n   * re-hashing.  Use this when the caller already holds the stored hash\n   * (e.g. `memory.frontmatter.contentHash`) to avoid the double-hash bug\n   * where `remove(hash)` would compute `hash(hash)` and never match the\n   * entry.\n   */\n  removeByHash(hash: string): void {\n    this.added.delete(hash);\n    this.removed.add(hash);\n    this.hashes.delete(hash);\n    this.dirty = true;\n  }\n\n  /**\n   * Add a pre-computed SHA-256 hash directly to the index without re-hashing.\n   * Use this when the caller already holds the stored hash\n   * (e.g. `memory.frontmatter.contentHash`) so that the index records the raw\n   * content hash rather than re-hashing the citation-annotated body.\n   *\n   * @internal Only called from `StorageManager.ensureFactHashIndexAuthoritative`.\n   * Not part of the public API — prefer `add(content)` for external callers.\n   */\n  addByHash(hash: string): void {\n    // A re-add supersedes a pending removal of the same hash.\n    this.removed.delete(hash);\n    // Record OUR durable delta even when the local snapshot already holds the\n    // hash (PR #2016 thread PRRT_kwDORJXyws6SEHve). Outside a rebuild\n    // (StorageManager.addActiveFactContentHash on reactivation) local\n    // membership can be STALE: a peer removed this hash on disk while this\n    // instance kept it in memory. Skipping added/dirty on that path let the\n    // reconciling save compute (on-disk \\ removed) ∪ added and silently drop\n    // the reintroduced hash, so the peer never saw it again. Set semantics keep\n    // this idempotent (no duplicate entries) and the removed.delete above\n    // preserves remove/add ordering. Mirrors add().\n    this.hashes.add(hash);\n    this.added.add(hash);\n    this.dirty = true;\n  }\n\n  // ── Fact-only partition (issue #2474) ─────────────────────────────────\n  // Folded here from StorageManager's parallel `factOnlyHashes` set, which had\n  // to be kept in lockstep by hand on every add/remove/rebuild site. The\n  // partition lives on the index instance, so every path that mutates the\n  // shared set and needs fact-only truth mutates it in the same breath.\n\n  /** Register fact content in BOTH the shared index and the fact-only partition. */\n  addFact(content: string): void {\n    this.addFactByHash(ContentHashIndex.computeHash(content));\n  }\n\n  /** Register a pre-computed fact hash in both the shared index and the fact-only partition. */\n  addFactByHash(hash: string): void {\n    this.addByHash(hash);\n    this.factHashes.add(hash);\n  }\n\n  /** Fact-ONLY membership: has this content been registered as a fact? */\n  hasFact(content: string): boolean {\n    return this.factHashes.has(ContentHashIndex.computeHash(content));\n  }\n\n  /** Fact-ONLY membership for a pre-computed SHA-256 hash. */\n  hasFactByHash(hash: string): boolean {\n    return this.factHashes.has(hash);\n  }\n\n  /**\n   * Drop fact-only partition membership WITHOUT touching the shared index.\n   * The shared removal stays caller-owned: a shared hash is dropped only when\n   * no other active memory holds it, while fact-only membership follows the\n   * fact's own lifecycle (supersede/archive/promotion).\n   */\n  removeFactByHash(hash: string): void {\n    this.factHashes.delete(hash);\n  }\n\n  /**\n   * Resolve a pre-computed semantic hash to one deterministic corpus path.\n   *\n   * This lookup is separate from durable hash membership: `this.hashes` stays\n   * one hash per line and `has(content)` keeps its existing raw-content contract.\n   * Reconciliation supplies short-lived manifest rows where hash and path coexist.\n   */\n  static resolvePathByHash(hash: string, entries: Iterable<ContentHashPathEntry>): string | undefined {\n    const canonicalHash = hash.toLowerCase();\n    if (!/^[a-f0-9]{64}$/.test(canonicalHash)) return undefined;\n    let canonicalPath: string | undefined;\n    for (const entry of entries) {\n      if (entry.contentHash.toLowerCase() !== canonicalHash || entry.path.length === 0) continue;\n      if (canonicalPath === undefined || entry.path < canonicalPath) canonicalPath = entry.path;\n    }\n    return canonicalPath;\n  }\n\n  /** Normalize content (delegates to content-hash.ts for a single source of truth). */\n  static normalizeContent(content: string): string {\n    return normalizeContent(content);\n  }\n\n  /** Compute SHA-256 hash (delegates to content-hash.ts for a single source of truth). */\n  static computeHash(content: string): string {\n    return computeContentHash(content);\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAKA,SAAS,OAAO,YAAY;AAC5B,OAAO,UAAU;AAcjB,IAAM,mCAAmC;AAEzC,IAAM,mCAAmC;AAEzC,SAAS,eAAe,KAA0D;AAChF,QAAM,QAAQ,IACX,MAAM,IAAI,EACV,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACnC,MAAI,MAAM,CAAC,MAAM,kCAAkC;AACjD,WAAO,EAAE,WAAW,OAAO,QAAQ,oBAAI,IAAI,EAAE;AAAA,EAC/C;AACA,SAAO,EAAE,WAAW,MAAM,QAAQ,IAAI,IAAI,MAAM,MAAM,CAAC,CAAC,EAAE;AAC5D;AAEA,SAAS,mBAAmB,QAA6B;AACvD,SAAO,GAAG,gCAAgC;AAAA,EAAK,CAAC,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC;AAAA;AACvE;AAeA,IAAM,wCAAwC;AAE9C,IAAM,mCAAmC;AAElC,IAAM,wCAAwC;AAoC9C,IAAM,qCAAN,cAAiD,MAAM;AAAA,EAC5D,YAAY,UAAkB;AAC5B;AAAA,MACE,4EAA4E,QAAQ;AAAA,IACtF;AACA,SAAK,OAAO;AAAA,EACd;AACF;AAqBO,IAAM,mBAAN,MAAM,kBAAiB;AAAA,EACpB,SAAsB,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAc9B,aAA0B,oBAAI,IAAI;AAAA,EAClC,QAAQ;AAAA;AAAA,EAER,0BAA0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS1B,UAAuB,oBAAI,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS/B,QAAqB,oBAAI,IAAI;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQT,sBAA6C;AAAA,EAC7C,yBAAyB;AAAA,EACzB,wBAA8C;AAAA,EAC9C,wBAA6C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ7C,wBAAgD;AAAA,EACxD,YACE,UACA,yBAA8C,MAAM,MACpD,8BAAmD,wBACnD,YAAoB,KAAK,QAAQ,QAAQ,GACzC,cAA2C,CAAC,GAC5C;AACA,SAAK,WAAW,KAAK,KAAK,UAAU,iBAAiB;AACrD,SAAK,yBAAyB;AAC9B,SAAK,8BAA8B;AACnC,SAAK,YAAY;AACjB,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA,EAEA,IAAI,0BAAmC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,MAAM,OAAsB;AAC1B,QAAI;AACF,YAAM,MAAM,MAAM,uBAAuB,KAAK,UAAU,KAAK,uBAAuB,GAAG,KAAK,SAAS;AACrG,YAAM,SAAS,eAAe,GAAG;AACjC,WAAK,0BAA0B,CAAC,OAAO;AACvC,UAAI,CAAC,OAAO,WAAW;AAGrB,aAAK,OAAO,MAAM;AAClB,YAAI,KAAK,2DAA2D,KAAK,QAAQ,EAAE;AAAA,MACrF,OAAO;AACL,mBAAW,QAAQ,OAAO,OAAQ,MAAK,OAAO,IAAI,IAAI;AAAA,MACxD;AACA,UAAI,MAAM,8BAA8B,KAAK,OAAO,IAAI,SAAS;AAAA,IACnE,SAAS,KAAK;AACZ,UAAI,eAAe,uBAAwB,OAAM;AACjD,UAAI,CAAC,YAAY,KAAK,QAAQ,EAAG,OAAM;AACvC,UAAI,MAAM,6DAAwD;AAAA,IACpE;AAGA,UAAM,KAAK,yBAAyB;AAAA,EACtC;AAAA;AAAA,EAGA,MAAc,gBAAiD;AAC7D,QAAI;AACF,YAAM,IAAI,MAAM,KAAK,KAAK,QAAQ;AAClC,aAAO;AAAA,QACL,SAAS,EAAE;AAAA,QACX,MAAM,EAAE;AAAA,QACR,KAAK,EAAE;AAAA,QACP,KAAK,EAAE;AAAA,QACP,SAAS,EAAE;AAAA,QACX,aAAa,EAAE;AAAA,MACjB;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,YAAY,KAAK,QAAQ,EAAG,QAAO;AACvC,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,2BAA0C;AACtD,QAAI;AACF,WAAK,wBAAwB,MAAM,KAAK,cAAc;AAAA,IACxD,SAAS,KAAK;AAGZ,WAAK,wBAAwB;AAC7B,UAAI,MAAM,6CAA6C,KAAK,QAAQ,KAAK,GAAG,EAAE;AAAA,IAChF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,2BAA6C;AACjD,QAAI;AACJ,QAAI;AACF,gBAAU,MAAM,KAAK,cAAc;AAAA,IACrC,QAAQ;AACN,aAAO;AAAA,IACT;AACA,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS,QAAQ,YAAY,MAAM;AACrC,aAAO,SAAS,QAAQ,YAAY;AAAA,IACtC;AACA,WACE,QAAQ,YAAY,KAAK,WACzB,QAAQ,SAAS,KAAK,QACtB,QAAQ,QAAQ,KAAK,OACrB,QAAQ,QAAQ,KAAK,OACrB,QAAQ,YAAY,KAAK,WACzB,QAAQ,gBAAgB,KAAK;AAAA,EAEjC;AAAA;AAAA,EAGA,IAAI,SAA0B;AAC5B,WAAO,KAAK,OAAO,IAAI,kBAAiB,YAAY,OAAO,CAAC;AAAA,EAC9D;AAAA;AAAA,EAGA,IAAI,SAAuB;AACzB,UAAM,OAAO,kBAAiB,YAAY,OAAO;AAEjD,SAAK,QAAQ,OAAO,IAAI;AASxB,SAAK,OAAO,IAAI,IAAI;AACpB,SAAK,MAAM,IAAI,IAAI;AACnB,SAAK,QAAQ;AAAA,EACf;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,QAAc;AACZ,QAAI,KAAK,OAAO,OAAO,GAAG;AACxB,WAAK,OAAO,MAAM;AAAA,IACpB;AAGA,SAAK,WAAW,MAAM;AAKtB,SAAK,MAAM,MAAM;AACjB,SAAK,QAAQ,MAAM;AACnB,SAAK,qBAAqB;AAC1B,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA,EAGA,MAAM,OAAsB;AAC1B,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAS5D,UAAM,iBAAiB,IAAI,IAAY,KAAK,KAAK;AACjD,UAAM,mBAAmB,IAAI,IAAY,KAAK,OAAO;AACrD,UAAM,aAAa,mBAAmB,KAAK,MAAM;AACjD,UAAM,wBAAwB,KAAK,UAAU,YAAY,KAAK,4BAA4B,GAAG,CAAC,GAAG,KAAK,SAAS;AAC/G,SAAK,0BAA0B;AAG/B,eAAW,KAAK,eAAgB,MAAK,MAAM,OAAO,CAAC;AACnD,eAAW,KAAK,iBAAkB,MAAK,QAAQ,OAAO,CAAC;AAEvD,SAAK,QAAQ,KAAK,MAAM,OAAO,KAAK,KAAK,QAAQ,OAAO;AAGxD,UAAM,KAAK,yBAAyB;AACpC,QAAI,KAAK,OAAO;AAId,WAAK,uBAAuB;AAAA,IAC9B,OAAO;AAEL,WAAK,qBAAqB;AAAA,IAC5B;AACA,QAAI,MAAM,6BAA6B,KAAK,OAAO,IAAI,SAAS;AAAA,EAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,MAAM,sBAAqC;AACzC,QAAI,CAAC,KAAK,MAAO;AAGjB,UAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,UAAM,UAAU,YAA2B;AAOzC,YAAM,iBAAiB,IAAI,IAAY,KAAK,KAAK;AACjD,YAAM,mBAAmB,IAAI,IAAY,KAAK,OAAO;AACrD,YAAM,SAAS,IAAI,IAAY,cAAc;AAC7C,UAAI;AACF,cAAM,MAAM,MAAM,uBAAuB,KAAK,UAAU,KAAK,uBAAuB,GAAG,KAAK,SAAS;AACrG,cAAM,SAAS,eAAe,GAAG;AACjC,YAAI,OAAO,WAAW;AACpB,qBAAW,QAAQ,OAAO,QAAQ;AAEhC,gBAAI,CAAC,iBAAiB,IAAI,IAAI,EAAG,QAAO,IAAI,IAAI;AAAA,UAClD;AAAA,QACF,OAAO;AAEL,cAAI,KAAK,iEAAiE,KAAK,QAAQ,EAAE;AAAA,QAC3F;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,eAAe,uBAAwB,OAAM;AACjD,YAAI,CAAC,YAAY,KAAK,QAAQ,EAAG,OAAM;AAAA,MAEzC;AACA,YAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,YAAM;AAAA,QACJ,KAAK;AAAA,QACL,mBAAmB,MAAM;AAAA,QACzB,KAAK,4BAA4B;AAAA,QACjC,CAAC;AAAA,QACD,KAAK;AAAA,MACP;AACA,WAAK,0BAA0B;AAG/B,iBAAW,KAAK,eAAgB,MAAK,MAAM,OAAO,CAAC;AACnD,iBAAW,KAAK,iBAAkB,MAAK,QAAQ,OAAO,CAAC;AAGvD,iBAAW,KAAK,KAAK,MAAO,QAAO,IAAI,CAAC;AACxC,iBAAW,KAAK,KAAK,QAAS,QAAO,OAAO,CAAC;AAC7C,WAAK,SAAS;AAGd,WAAK,QAAQ,KAAK,MAAM,OAAO,KAAK,KAAK,QAAQ,OAAO;AAIxD,YAAM,KAAK,yBAAyB;AAAA,IACtC;AACA,UAAM;AAAA,MACJ,GAAG,KAAK,QAAQ;AAAA,MAChB;AAAA,QACE,SAAS;AAAA,QACT,GAAI,KAAK,YAAY,cAAc,SAAY,EAAE,WAAW,KAAK,YAAY,UAAU,IAAI,CAAC;AAAA,QAC5F,GAAI,KAAK,YAAY,WAAW,SAAY,EAAE,QAAQ,KAAK,YAAY,OAAO,IAAI,CAAC;AAAA,MACrF;AAAA,MACA,OAAO,aAAa;AAClB,YAAI,CAAC,UAAU;AAMb,cAAI;AAAA,YACF,6CAA6C,KAAK,QAAQ;AAAA,UAC5D;AACA,eAAK,uBAAuB;AAC5B;AAAA,QACF;AACA,cAAM,QAAQ;AACd,YAAI,KAAK,OAAO;AAKd,eAAK,uBAAuB;AAAA,QAC9B,OAAO;AAEL,eAAK,qBAAqB;AAAA,QAC5B;AAAA,MACF;AAAA,IACF;AACA,QAAI,MAAM,uCAAuC,KAAK,OAAO,IAAI,SAAS;AAAA,EAC5E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA2BA,MAAM,iBAAiB,UAAiD;AAGtE,UAAM,MAAM,KAAK,QAAQ,KAAK,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,QAAI,YAAY;AAChB,UAAM;AAAA,MACJ,GAAG,KAAK,QAAQ;AAAA,MAChB;AAAA,QACE,SAAS;AAAA,QACT,GAAI,KAAK,YAAY,cAAc,SAAY,EAAE,WAAW,KAAK,YAAY,UAAU,IAAI,CAAC;AAAA,QAC5F,GAAI,KAAK,YAAY,WAAW,SAAY,EAAE,QAAQ,KAAK,YAAY,OAAO,IAAI,CAAC;AAAA,MACrF;AAAA,MACA,OAAO,aAAa;AAClB,YAAI,CAAC,UAAU;AAIb,cAAI;AAAA,YACF,6CAA6C,KAAK,QAAQ;AAAA,UAC5D;AACA;AAAA,QACF;AACA,cAAM,SAAS;AAGf,cAAM,KAAK,KAAK;AAChB,oBAAY;AAAA,MACd;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,2BAAoC;AACtC,WAAO,KAAK,wBAAwB;AAAA,EACtC;AAAA;AAAA,EAGA,IAAI,oBAA6B;AAC/B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,4BAA2C;AAC/C,WAAO,KAAK,yBAAyB,QAAQ,QAAQ;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,sBAAqC;AACzC,QAAI,CAAC,KAAK,MAAO;AACjB,UAAM,cAAc,KAAK,YAAY,oBAAoB;AACzD,UAAM,SAAS,KAAK,YAAY,eAAe;AAC/C,aAAS,UAAU,GAAG,KAAK,SAAS,UAAU,aAAa,WAAW,GAAG;AAEvE,UAAI,KAAK,qBAAqB;AAC5B,qBAAa,KAAK,mBAAmB;AACrC,aAAK,sBAAsB;AAAA,MAC7B;AACA,YAAM,KAAK,oBAAoB;AAC/B,UAAI,CAAC,KAAK,MAAO;AACjB,UAAI,UAAU,cAAc,GAAG;AAC7B,cAAM,OAAO,KAAK,IAAI,SAAS,KAAK,SAAS,qCAAqC;AAClF,cAAM,IAAI,QAAc,CAAC,YAAY,WAAW,SAAS,IAAI,CAAC;AAAA,MAChE;AAAA,IACF;AAGA,QAAI,KAAK,qBAAqB;AAC5B,mBAAa,KAAK,mBAAmB;AACrC,WAAK,sBAAsB;AAAA,IAC7B;AACA,SAAK,yBAAyB;AAC9B,SAAK,qBAAqB;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,yBAA+B;AACrC,QAAI,KAAK,oBAAqB;AAC9B,UAAM,cAAc,KAAK,YAAY,oBAAoB;AACzD,QAAI,KAAK,0BAA0B,aAAa;AAC9C,UAAI;AAAA,QACF,iCAAiC,WAAW,wCAAwC,KAAK,QAAQ,KAC5F,KAAK,MAAM,IAAI;AAAA,MACtB;AACA,WAAK,yBAAyB;AAC9B,WAAK,qBAAqB;AAC1B;AAAA,IACF;AACA,QAAI,CAAC,KAAK,uBAAuB;AAC/B,WAAK,wBAAwB,IAAI,QAAc,CAAC,YAAY;AAC1D,aAAK,wBAAwB;AAAA,MAC/B,CAAC;AAAA,IACH;AACA,UAAM,UAAU,KAAK,yBAAyB;AAC9C,UAAM,SAAS,KAAK,YAAY,eAAe;AAC/C,UAAM,QAAQ,KAAK,IAAI,SAAS,MAAM,UAAU,IAAI,qCAAqC;AACzF,SAAK,sBAAsB,WAAW,MAAM;AAC1C,WAAK,sBAAsB;AAC3B,WAAK,yBAAyB;AAC9B,WAAK,KAAK,oBAAoB,EAC3B,MAAM,CAAC,QAAQ;AAGd,YAAI,KAAK,gEAAgE,KAAK,QAAQ,KAAK,GAAG,EAAE;AAAA,MAClG,CAAC,EACA,QAAQ,MAAM;AAGb,YAAI,KAAK,SAAS,CAAC,KAAK,oBAAqB,MAAK,qBAAqB;AAAA,MACzE,CAAC;AAAA,IACL,GAAG,KAAK;AACR,SAAK,oBAAoB,QAAQ;AAAA,EACnC;AAAA;AAAA,EAGQ,uBAA6B;AACnC,QAAI,KAAK,qBAAqB;AAC5B,mBAAa,KAAK,mBAAmB;AACrC,WAAK,sBAAsB;AAAA,IAC7B;AACA,SAAK,yBAAyB;AAC9B,SAAK,qBAAqB;AAAA,EAC5B;AAAA;AAAA,EAGQ,uBAA6B;AACnC,UAAM,UAAU,KAAK;AACrB,SAAK,wBAAwB;AAC7B,SAAK,wBAAwB;AAC7B,cAAU;AAAA,EACZ;AAAA;AAAA,EAGA,OAAO,SAAuB;AAC5B,UAAM,OAAO,kBAAiB,YAAY,OAAO;AAIjD,SAAK,MAAM,OAAO,IAAI;AACtB,SAAK,QAAQ,IAAI,IAAI;AACrB,SAAK,OAAO,OAAO,IAAI;AACvB,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,MAAoB;AAC/B,SAAK,MAAM,OAAO,IAAI;AACtB,SAAK,QAAQ,IAAI,IAAI;AACrB,SAAK,OAAO,OAAO,IAAI;AACvB,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,UAAU,MAAoB;AAE5B,SAAK,QAAQ,OAAO,IAAI;AAUxB,SAAK,OAAO,IAAI,IAAI;AACpB,SAAK,MAAM,IAAI,IAAI;AACnB,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,QAAQ,SAAuB;AAC7B,SAAK,cAAc,kBAAiB,YAAY,OAAO,CAAC;AAAA,EAC1D;AAAA;AAAA,EAGA,cAAc,MAAoB;AAChC,SAAK,UAAU,IAAI;AACnB,SAAK,WAAW,IAAI,IAAI;AAAA,EAC1B;AAAA;AAAA,EAGA,QAAQ,SAA0B;AAChC,WAAO,KAAK,WAAW,IAAI,kBAAiB,YAAY,OAAO,CAAC;AAAA,EAClE;AAAA;AAAA,EAGA,cAAc,MAAuB;AACnC,WAAO,KAAK,WAAW,IAAI,IAAI;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,iBAAiB,MAAoB;AACnC,SAAK,WAAW,OAAO,IAAI;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,kBAAkB,MAAc,SAA6D;AAClG,UAAM,gBAAgB,KAAK,YAAY;AACvC,QAAI,CAAC,iBAAiB,KAAK,aAAa,EAAG,QAAO;AAClD,QAAI;AACJ,eAAW,SAAS,SAAS;AAC3B,UAAI,MAAM,YAAY,YAAY,MAAM,iBAAiB,MAAM,KAAK,WAAW,EAAG;AAClF,UAAI,kBAAkB,UAAa,MAAM,OAAO,cAAe,iBAAgB,MAAM;AAAA,IACvF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAO,iBAAiB,SAAyB;AAC/C,WAAO,iBAAiB,OAAO;AAAA,EACjC;AAAA;AAAA,EAGA,OAAO,YAAY,SAAyB;AAC1C,WAAO,mBAAmB,OAAO;AAAA,EACnC;AACF;","names":[]}

package/dist/{chunk-6VAHJ2F6.js → chunk-DMDWFQMR.js}

@@ -1,6 +1,6 @@
 import {
   readAllEdges
-} from "./chunk-BTJ6CAIA.js";
+} from "./chunk-4IYIGN53.js";
 import {
   readEdgeConfidence
 } from "./chunk-2LSZVONP.js";
@@ -162,4 +162,4 @@ export {
   parseGraphSnapshotSince,
   buildGraphSnapshot
 };
-//# sourceMappingURL=chunk-6VAHJ2F6.js.map
+//# sourceMappingURL=chunk-DMDWFQMR.js.map

package/dist/{chunk-BLVHDY2U.js → chunk-DOWACHYO.js}

@@ -1,3 +1,6 @@
+import {
+  isMacOsReplicationJunkBasename
+} from "./chunk-QUIRIG2P.js";
 import {
   log
 } from "./chunk-3WCASNQZ.js";
@@ -232,7 +235,7 @@ var ProfilingCollector = class {
     try {
       const dir = this.storageDir;
       const entries = await fsp.readdir(dir);
-      const jsonlFiles = entries.filter((f) => f.endsWith(".jsonl"));
+      const jsonlFiles = entries.filter((f) => !isMacOsReplicationJunkBasename(f) && f.endsWith(".jsonl"));
       const withMtime = await Promise.all(
         jsonlFiles.map(async (f) => ({
           name: f,
@@ -306,4 +309,4 @@ export {
   ProfilingCollector,
   formatProfileTraceAscii
 };
-//# sourceMappingURL=chunk-BLVHDY2U.js.map
+//# sourceMappingURL=chunk-DOWACHYO.js.map