@tangle-network/agent-eval 0.221.7 → 0.222.0

package/dist/canonical-CFpojCN5.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"canonical-CFpojCN5.d.ts","names":[],"sources":["../src/ledger-core/canonical.ts"],"mappings":";;KAqBY;;cAGC,qBAAmB;;cAGnB,oCAAoC;;;;iBAKjC,gBAAgB;iBAQhB,cAAc,iBAAiB;;;;;;;;;;;;;;;;iBAuB/B,aAAa"}

package/dist/client-hwo3cJjR.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"client-hwo3cJjR.d.ts","names":[],"sources":["../src/hosted/search-ledger-wire.ts","../src/hosted/types.ts","../src/hosted/client.ts"],"mappings":";;;;;cAqCa;cAEA;;cAsBA,qBAAmB,EAAA;;;;KACpB,gBAAgB,EAAE,aAAa;;;cAI9B,wBAAsB,EAAA;;;;GAM/B,EAAA,KAAA;KACQ,mBAAmB,EAAE,aAAa;cAEjC,iCAA+B,EAAA;;;;;;;;;GAkBxC,EAAA,KAAA;KACQ,4BAA4B,EAAE,aAAa;;cAG1C,4BAA0B,EAAA;;;;;;;;;;;GAM5B,EAAA,KAAA;KACC,uBAAuB,EAAE,aAAa;;;cAIrC,6BAA2B,EAAA;;;;;;;;GAM7B,EAAA,KAAA;KACC,wBAAwB,EAAE,aAAa;KA+BvC;EAEN;;EAEA,SAAS;EACT;;EAEA,MAAM;;EAEN;EAAoB,UAAU;;UAEnB;EACf,SAAS;;EAET,MAAM;;EAEN,gBAAgB,mBAAmB;;;;;;;;iBASrB,uBACd,OAAO,8BACN;;;;;;;;;;;;;;;;;;;;;;;;;cCtJU;KACD,2BAA2B;;UAKtB;;EAEf;;EAEA;;EAEA,yBAAyB;;EAEzB;;;;;;KASU;;;;;;UAOK;EACf;EACA;EACA;EACA;EACA,mBAAmB;EACnB,iBAAiB;EACjB,YAAY;EACZ,SAAS;IACP,cAAc;IACd;IACA,aAAa;;EAEf;IAAW;IAAgC;;;EAE3C;;EAEA;;EAEA;;EAEA;;UAKe;EACf,aAAa;EACb,OAAO;;UAGQ;;EAEf;;EAEA,UAAU;IAAQ;IAAe;;;;;UC7ClB;;EAEf;;EAEA;;EAEA;;EAEA,mBAAmB;;EAEnB;;EAEA;;;KAIU;EACN;EAAoB,MAAM;;EAC1B;EAAoB,UAAU;;UAEnB;EACf,aAAa,OAAO,kBAAkB,0BAA0B,QAAQ;;EAExE,iBAAiB,kBAAkB,SAAS,cAAc,QAAQ;EAClE,mBACE,SAAS,2BACT,SAAS,cACR,QAAQ;EACX,cACE,4BACA,OAAO,WAAW,cAClB,qBACA,SAAS,cACR,QAAQ;WACF,QAAQ;WACR,aAAa;;iBA8IR,mBAAmB,QAAQ,eAAe;;;;;;;;;;iBAqG1C,oBACd,YAAW,QAAQ;EAAkB,MAAM;IAC1C;;;iBAmBa,oBACd,YAAW,QAAQ;EAAkB,MAAM;IAC1C"}

package/dist/completion-verifier-asaV1nSj.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"completion-verifier-asaV1nSj.js","names":[],"sources":["../src/agent-profile.ts","../src/completion-verifier.ts"],"sourcesContent":["import { createHash } from 'node:crypto'\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport { type HarnessType, harnessSupportsModel } from '@tangle-network/agent-interface'\nimport { ValidationError } from './errors'\nimport { canonicalString } from './ledger-core/canonical'\n\nexport type { AgentProfile, HarnessType } from '@tangle-network/agent-interface'\n\n/**\n * The agentic coding harnesses an eval sweeps by default — the ones we care about\n * ranking. This is the SINGLE source of that list; consumers import it instead of\n * re-declaring their own (a re-declared list is how the fleet drifts). Pass an\n * explicit `harnesses` (e.g. `harnessTypeSchema.options` for literally every known\n * harness) to widen beyond these.\n */\nexport const CODING_HARNESSES: readonly HarnessType[] = [\n  'opencode',\n  'claude-code',\n  'codex',\n  'kimi-code',\n]\n\nexport interface ProfileAxisSpec {\n  /** The domain profile to sweep. Its prompt/tools/skills are held fixed; only the\n   *  harness and model vary. `model.default` is the fallback model. */\n  base: AgentProfile\n  /** Harnesses to cross. Default: {@link CODING_HARNESSES}. */\n  harnesses?: readonly HarnessType[]\n  /** Models to cross. Default: `[base.model.default]` — one model, i.e. today's\n   *  single-model behaviour, so omitting this never changes an existing run. */\n  models?: readonly string[]\n  /** Force every (harness, model) pair verbatim, even ones the harness can't run —\n   *  for deliberately testing failure modes. Default (false): SNAP instead — a\n   *  vendor-locked harness runs only the swept models in its family, or its native\n   *  default when it supports none, so no harness is dropped and none gets a\n   *  guaranteed-failing foreign-model cell. */\n  keepIncompatible?: boolean\n}\n\n/** Model sentinel for a vendor-locked harness that supports none of the swept models:\n *  it carries no provider prefix, so `harnessSupportsModel` accepts it and the harness\n *  resolves it to its own native default model at runtime (e.g. kimi-code → its Kimi\n *  model). Lets `expandProfileAxes` snap-instead-of-drop without a per-harness flagship\n *  table that would rot as router catalogs change. */\nexport const HARNESS_NATIVE_MODEL = 'default'\n\n/**\n * Expand a base profile across the harness × model matrix into the `AgentProfile[]`\n * that `runProfileMatrix` / `selfImprove` score — the ONE place \"which harnesses ×\n * which models do we evaluate\" lives, so no product hand-rolls its own harness list\n * or column→profile mapping (the pattern that let those copies drift and silently\n * break the harness pivot).\n *\n * Each cell clones `base`, sets the canonical top-level `harness` and `model.default`,\n * and stamps `metadata.harness` + `metadata.harnessModel` for matrix grouping. Both\n * metadata fields are hash-bearing, so every cell gets a distinct `agentProfileId` row\n * and results join back by harness/model via {@link harnessAxisOf} with no\n * hand-recomputed key. A vendor-locked harness snaps to its family's swept models — or\n * its native default ({@link HARNESS_NATIVE_MODEL}) when it supports none — so every\n * requested harness runs; `keepIncompatible` forces every pair verbatim.\n *\n * Omit `harnesses`/`models` to sweep the full default set — the \"turn it on for\n * everything we care about\" switch, identical in shape whether one harness or all.\n */\nexport function expandProfileAxes(spec: ProfileAxisSpec): AgentProfile[] {\n  const harnesses = spec.harnesses ?? CODING_HARNESSES\n  if (harnesses.length === 0) throw new ValidationError('expandProfileAxes: no harnesses to sweep')\n  const baseModel = spec.base.model?.default\n  const models = spec.models ?? (baseModel ? [baseModel] : [])\n  if (models.length === 0) {\n    throw new ValidationError(\n      'expandProfileAxes: no models to sweep — base profile has no model.default and none were supplied',\n    )\n  }\n  const out: AgentProfile[] = []\n  const seen = new Set<string>()\n  for (const harness of harnesses) {\n    // A universal (router-backed) harness — opencode/pi/claudish, and claude-code/codex\n    // since agent-interface 5.6.0 — runs every swept model. A vendor-locked harness\n    // (kimi-code) runs only the swept models in its own family; when it supports NONE\n    // of them it snaps to its native default (the `HARNESS_NATIVE_MODEL` sentinel it\n    // resolves at runtime) rather than being dropped, so every requested harness still appears in the\n    // sweep on a model it can actually run — e.g. sweeping `deepseek/x` puts opencode\n    // on deepseek and kimi-code on its own Kimi model, a real head-to-head.\n    // `keepIncompatible` forces every (harness, model) pair verbatim (failure-mode runs).\n    const supported = spec.keepIncompatible\n      ? models\n      : models.filter((model) => harnessSupportsModel(harness, model))\n    const effective = supported.length > 0 ? supported : [HARNESS_NATIVE_MODEL]\n    for (const model of effective) {\n      const profile: AgentProfile = {\n        ...spec.base,\n        harness,\n        name: `${spec.base.name ?? 'agent'}/${harness}/${model}`,\n        model: { ...spec.base.model, default: model },\n        metadata: { ...(spec.base.metadata ?? {}), harness, harnessModel: model },\n      }\n      const id = agentProfileId(profile)\n      if (seen.has(id)) continue\n      seen.add(id)\n      out.push(profile)\n    }\n  }\n  if (out.length === 0) {\n    // Unreachable in normal use — snapping guarantees ≥1 cell per harness — but keep a\n    // fail-closed guard so a future refactor can't silently produce an empty sweep.\n    throw new ValidationError(\n      `expandProfileAxes: produced no profiles (harnesses=[${harnesses.join(', ')}], models=[${models.join(', ')}]).`,\n    )\n  }\n  return out\n}\n\n/**\n * Read the (harness, model) a matrix cell ran under, off a profile or a result row's\n * profile — the join-back for a `byHarness` pivot. Returns undefined when the profile\n * wasn't produced by {@link expandProfileAxes}. Callers group `result.byProfile` by\n * this instead of recomputing an id (recomputing the wrong key is what broke the pivot\n * in the hand-rolled copies).\n */\nexport function harnessAxisOf(\n  profile: Pick<AgentProfile, 'metadata'>,\n): { harness: HarnessType; model: string } | undefined {\n  const m = profile.metadata as Record<string, unknown> | undefined\n  const harness = m?.harness\n  const model = m?.harnessModel\n  if (typeof harness === 'string' && typeof model === 'string') {\n    return { harness: harness as HarnessType, model }\n  }\n  return undefined\n}\n\n/**\n * Collision-resistant, path-safe, human-readable profile id for eval artifacts.\n * Scorecard joins still use `agentProfileHash`; this id is for run ids, matrix\n * keys, and directory names where two profiles must not collapse onto one row.\n * The suffix is the first 64 bits of the behaviour hash, enough for ordinary\n * eval matrices while keeping filenames readable.\n */\nexport function agentProfileId(profile: AgentProfile): string {\n  const label = pathSafeProfileLabel(agentProfileDisplayLabel(profile)) ?? 'profile'\n  return `${label}-${agentProfileHash(profile).slice(0, 16)}`\n}\n\n/**\n * Model snapshot used for `RunRecord.model`. Eval surfaces require a concrete\n * model id because run records reject bare/missing model aliases.\n */\nexport function agentProfileModelId(profile: AgentProfile): string {\n  const model = profile.model?.default?.trim()\n  if (!model) {\n    const label = agentProfileDisplayLabel(profile) ?? 'unnamed profile'\n    throw new ValidationError(\n      `AgentProfile \"${label}\" has no model.default — cannot record eval run`,\n    )\n  }\n  return model\n}\n\nfunction agentProfileDisplayLabel(profile: AgentProfile): string | undefined {\n  return profile.name?.trim() || profile.version?.trim() || undefined\n}\n\nfunction pathSafeProfileLabel(label: string | undefined): string | undefined {\n  const safe = label\n    ?.trim()\n    .replace(/[^A-Za-z0-9._-]+/g, '-')\n    .replace(/-+/g, '-')\n    .replace(/^-|-$/g, '')\n  return safe || undefined\n}\n\nfunction compact<T extends Record<string, unknown>>(input: T): Partial<T> {\n  const out: Record<string, unknown> = {}\n  for (const [key, value] of Object.entries(input)) {\n    if (value !== undefined) out[key] = value\n  }\n  return out as Partial<T>\n}\n\n/**\n * Deterministic behaviour identity for the canonical\n * `@tangle-network/agent-interface` AgentProfile.\n *\n * `name` and `description` are labels and do not affect the hash. Profile\n * `version`, prompt, model hints, tools, resources, hooks, modes, permissions,\n * and extensions do affect the hash. Resource array order is hash-bearing\n * because mount order can change agent behaviour. Undefined fields are treated\n * as absent; explicit `null` fields remain hash-bearing.\n */\nexport function agentProfileHash(profile: AgentProfile): string {\n  const model = agentProfileModelId(profile)\n  const behaviour = compact({\n    ...profile,\n    name: undefined,\n    description: undefined,\n    tags: profile.tags ? [...profile.tags].sort() : undefined,\n    model: compact({ ...profile.model, default: model }),\n  })\n  return createHash('sha256').update(canonicalString(behaviour)).digest('hex')\n}\n","/**\n * Completion verifier — the task-completion oracle.\n *\n * Answers the only eval question that is not a proxy: did the agent actually\n * COMPLETE the task — produce every required deliverable, persisted and\n * correct — rather than describe what should be done. A fluent transcript\n * that never produces the artifact scores zero here.\n *\n * Per requirement, a two-stage check:\n *   1. Structural — a produced item (vault artifact / approved proposal /\n *      tool call) of the right kind is matched against the requirement and\n *      carries non-empty content. Deterministic; no LLM.\n *   2. Correctness — only if structurally present AND the matched item\n *      carries content, one targeted check decides whether that item\n *      actually fulfils the requirement. A hallucinated artifact fails here;\n *      an absent one already failed stage 1.\n *\n * `completionRate` is satisfied / MEASURABLE requirements (unmeasured rows —\n * checker failures — are excluded from the denominator, never scored as\n * zeros). Quality dimensions are meaningless on an incomplete task — callers\n * gate on `fullyComplete` / `completionRate` before scoring quality.\n */\n\nimport { randomUUID } from 'node:crypto'\nimport type { ChatClient, ChatRequest } from './analyst/chat-client'\nimport type { ValidatedArtifact } from './artifact-validator'\nimport { CostLedger, type CostLedgerHandle } from './cost-ledger'\nimport { assertServedModel, ModelSubstitutionError } from './integrity/served-model'\nimport { recoverTruncatedJson } from './json-recovery'\nimport { JudgeParseError } from './judges'\nimport {\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  maximumChargeForLlmRequest,\n} from './llm-client'\nimport type { RawProviderEvent, RawProviderSink } from './trace/raw-provider-sink'\nimport {\n  certificationEvidenceDigest,\n  type DefaultVerdict,\n  type VerdictCertification,\n} from './verdict'\nimport type { CheckerIdentity, VerificationStrategySource } from './verification-strategy'\n\n/** What kind of produced state can satisfy a requirement structurally. */\nexport type SatisfiedBy = 'artifact' | 'proposal' | 'tool-call' | 'any'\n\nexport interface CompletionRequirement {\n  /** Stable id from the task gold (e.g. a persona's `expected_requirements[].req_id`). */\n  reqId: string\n  /** Human-readable description of the required deliverable. */\n  title: string\n  /** Optional kind/category hint, matched against a produced item's kind. */\n  category?: string\n  /** What produced state satisfies this requirement. Defaults to 'any'. */\n  satisfiedBy?: SatisfiedBy\n}\n\nexport interface TaskGold {\n  taskId: string\n  requirements: CompletionRequirement[]\n}\n\nexport interface ProducedProposal {\n  id: string\n  title: string\n  status: 'pending' | 'approved' | 'rejected'\n  /** Optional persisted body — when present, enables a correctness check. */\n  content?: string\n}\n\n/** Everything observable about what a run actually produced. */\nexport interface ProducedState {\n  /** Persisted vault artifacts. Reuses the shared `ValidatedArtifact` shape. */\n  artifacts: ValidatedArtifact[]\n  /** Proposals / filings the agent created. */\n  proposals: ProducedProposal[]\n  /** Names of tools the agent invoked. */\n  toolCalls: string[]\n}\n\nexport interface RequirementCheck {\n  reqId: string\n  title: string\n  /** A produced item of the right kind matched the requirement, non-empty. */\n  structurallyPresent: boolean\n  /**\n   * Whether the matched item actually fulfils the requirement. `null` when\n   * not structurally present, when the matched item carries no content\n   * to assess, or when the correctness check itself failed (`unmeasured`).\n   */\n  correct: boolean | null\n  /** structurallyPresent && !unmeasured && correct !== false. */\n  satisfied: boolean\n  /**\n   * Set when the correctness check itself errored (LLM call failure or an\n   * unparseable response after retry). The requirement's fulfilment is\n   * UNKNOWN — `correct` stays null, `satisfied` is false, and\n   * `completionVerdict` excludes the row from `completionRate`'s\n   * denominator. Never folded into a zero: a synthetic zero is\n   * indistinguishable from a real failure (see `JudgeParseError`).\n   */\n  unmeasured?: true\n  /** Why the correctness check could not be measured (present iff `unmeasured`). */\n  unmeasuredReason?: string\n  /** Human-readable evidence for the verdict. */\n  evidence: string[]\n}\n\n/** Extends the substrate verdict spine: `valid` = `fullyComplete` and\n *  `score` = `completionRate` — derived in `completionVerdict()`, the one\n *  place those equalities hold by construction. */\nexport interface CompletionVerdict extends DefaultVerdict {\n  taskId: string\n  requirements: RequirementCheck[]\n  /** satisfied / MEASURABLE requirements (unmeasured rows leave the denominator). */\n  completionRate: number\n  /** Every measurable requirement satisfied (false when anything is unmeasured). */\n  fullyComplete: boolean\n  /** Requirements whose correctness check errored — reported, never scored as zero. */\n  unmeasuredCount: number\n}\n\n/**\n * Construct a `CompletionVerdict` from the per-requirement checks, deriving\n * `completionRate` / `fullyComplete` and the spine fields (`valid` =\n * `fullyComplete`, `score` = `completionRate`) in one place. Throws on zero\n * requirements — a verdict over nothing is a misconfiguration, mirroring\n * `verifyCompletion`'s gold-spec guard.\n */\nexport function completionVerdict(input: {\n  taskId: string\n  requirements: RequirementCheck[]\n  /** What certified the correctness stage, when anything did. Omitted =\n   *  an uncertified verdict — the honest default for a bare checker. */\n  certification?: VerdictCertification\n}): CompletionVerdict {\n  if (input.requirements.length === 0) {\n    throw new Error(\n      `completionVerdict: task '${input.taskId}' has no requirement checks — nothing to derive a verdict from`,\n    )\n  }\n  const measurable = input.requirements.filter((r) => !r.unmeasured)\n  const unmeasuredCount = input.requirements.length - measurable.length\n  if (measurable.length === 0) {\n    // Every check errored: this is an infrastructure failure, not a scored\n    // run. A 0-rate verdict here would be a fabricated measurement.\n    throw new Error(\n      `completionVerdict: task '${input.taskId}' has no measurable requirements — all ${input.requirements.length} correctness checks failed (${input.requirements[0]?.unmeasuredReason ?? 'unknown reason'})`,\n    )\n  }\n  const satisfiedCount = measurable.filter((r) => r.satisfied).length\n  const completionRate = satisfiedCount / measurable.length\n  // A run with unmeasured rows can still report a rate over what WAS\n  // measured, but must not claim full completion.\n  const fullyComplete = unmeasuredCount === 0 && satisfiedCount === measurable.length\n  return {\n    taskId: input.taskId,\n    requirements: input.requirements,\n    completionRate,\n    fullyComplete,\n    unmeasuredCount,\n    valid: fullyComplete,\n    score: completionRate,\n    ...(input.certification === undefined ? {} : { certification: input.certification }),\n  }\n}\n\n/**\n * What a correctness checker declares about itself so the completion\n * verdict can carry a certification: which strategy member it discharges,\n * its exact identity, and the steps its answers rest on unverified.\n */\nexport interface CorrectnessCheckerAttestation {\n  strategy: VerificationStrategySource\n  checker: CheckerIdentity\n  assumptions: string[]\n}\n\n/**\n * Decides whether a produced item's content actually fulfils a requirement.\n * Injected so the structural verifier stays pure and unit-testable; the\n * production implementation is `createLlmCorrectnessChecker`.\n *\n * `attestation` is optional metadata on the function value: a checker that\n * carries one yields certified completion verdicts; a bare function yields\n * the same verdict uncertified. A plain arrow function remains a valid\n * checker.\n */\nexport interface CorrectnessChecker {\n  (\n    requirement: CompletionRequirement,\n    content: string,\n  ): Promise<{ correct: boolean; reason: string }>\n  attestation?: CorrectnessCheckerAttestation\n}\n\nconst STOPWORDS = new Set([\n  'the',\n  'a',\n  'an',\n  'of',\n  'for',\n  'and',\n  'or',\n  'to',\n  'in',\n  'on',\n  'with',\n  'by',\n])\n\n// Deliverable-FORM vocabulary — words that name the SHAPE of an output, not its\n// domain content. A correct \"swap-comparison view persisted as a ui/** artifact\"\n// is an OpenUI JSON whose body says nothing about \"artifact\" / \"persisted\" /\n// \"view\"; the discriminative tokens are the domain nouns (swap, comparison).\n// Stripped from the REQUIREMENT side of structural recall so a deliverable is\n// matched on what it IS about, not on the boilerplate describing its form. The\n// correctness checker strips the same class via TITLE_STOPWORDS. Anti-game holds:\n// the distinctive domain tokens remain, so an off-topic item still fails.\nconst REQUIREMENT_FORM_STOPWORDS = new Set([\n  'generated',\n  'generate',\n  'view',\n  'render',\n  'rendered',\n  'persisted',\n  'persist',\n  'artifact',\n  'file',\n  'document',\n  'note',\n  'proposal',\n  'deliverable',\n  'output',\n  'created',\n  'create',\n  'produce',\n  'produced',\n  'flag',\n])\n\nconst MATCH_THRESHOLD = 0.5\nconst MIN_CONTENT_CHARS = 50\n\nfunction tokens(s: string, extraStop?: Set<string>): Set<string> {\n  return new Set(\n    s\n      .toLowerCase()\n      .split(/[^a-z0-9]+/)\n      .filter((t) => t.length > 1 && !STOPWORDS.has(t) && !extraStop?.has(t)),\n  )\n}\n\n/**\n * Recall of the requirement's tokens within a candidate's identifying text.\n * Recall, not Jaccard — a candidate's path/id legitimately carries extra\n * tokens the requirement does not name. The requirement side drops\n * deliverable-FORM vocabulary so recall keys on the distinctive domain tokens.\n */\nfunction tokenRecall(requirementText: string, candidateText: string): number {\n  const req = tokens(requirementText, REQUIREMENT_FORM_STOPWORDS)\n  if (req.size === 0) return 0\n  const cand = tokens(candidateText)\n  let hit = 0\n  for (const t of req) if (cand.has(t)) hit++\n  return hit / req.size\n}\n\ninterface Candidate {\n  reqIndex: number\n  /** Unique key for a produced item — each item satisfies at most one requirement. */\n  itemKey: string\n  score: number\n  evidence: string\n  /** Content to correctness-check, or null when the matched item has none. */\n  content: string | null\n}\n\nfunction artifactCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  artifacts: ValidatedArtifact[],\n): Candidate[] {\n  const reqText = `${req.title} ${req.category ?? ''}`\n  const out: Candidate[] = []\n  artifacts.forEach((a, i) => {\n    if ((a.content ?? '').trim().length < MIN_CONTENT_CHARS) return\n    // Match against the artifact CONTENT too, not just its path + kind — a\n    // generated view / note whose path is generic still satisfies a requirement\n    // when its body covers it (e.g. an OpenUI comparison grounded in the on-file\n    // figures). Bounded slice keeps the recall text cheap; MATCH_THRESHOLD holds.\n    let score = tokenRecall(\n      reqText,\n      `${a.path ?? ''} ${a.kind} ${(a.content ?? '').slice(0, 4000)}`,\n    )\n    if (req.category && a.kind && req.category.toLowerCase() === a.kind.toLowerCase()) {\n      score = Math.max(score, 1)\n    }\n    if (score < MATCH_THRESHOLD) return\n    out.push({\n      reqIndex,\n      itemKey: `artifact:${i}`,\n      score,\n      evidence: `artifact '${a.path ?? a.kind}' matched (token recall ${score.toFixed(2)})`,\n      content: a.content ?? null,\n    })\n  })\n  return out\n}\n\nfunction proposalCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  proposals: ProducedProposal[],\n): Candidate[] {\n  const reqText = `${req.title} ${req.category ?? ''}`\n  const out: Candidate[] = []\n  for (const p of proposals) {\n    // Pending or rejected work is not a completed deliverable.\n    if (p.status !== 'approved') continue\n    // A proposal needs an assessable BODY to be a deliverable. A bare title is\n    // not completion: correctness cannot be judged on it, so a title-only match\n    // would auto-pass the oracle (structurallyPresent && correct===null →\n    // satisfied) with no verifiable content. Tool calls are the only\n    // legitimately content-less deliverable (`toolCallCandidates`).\n    const body = (p.content ?? '').trim()\n    if (body.length < MIN_CONTENT_CHARS) continue\n    // Match against the body as well as the (often short) title — a refusal /\n    // flag / analysis proposal whose title is a label still satisfies a\n    // descriptively-worded requirement when its content covers it. MATCH_THRESHOLD\n    // + the requirement's distinctive tokens keep an off-topic proposal out;\n    // correctness (a SEMANTIC checker, NOT this lexical pass) then judges\n    // polarity/fulfilment, so a negation that merely contains the tokens fails.\n    // Structural and correctness must use different evidence or the two-stage\n    // check collapses to one lexical gate.\n    const score = tokenRecall(reqText, `${p.title} ${body}`)\n    if (score < MATCH_THRESHOLD) continue\n    out.push({\n      reqIndex,\n      itemKey: `proposal:${p.id}`,\n      score,\n      evidence: `approved proposal '${p.title}' matched (token recall ${score.toFixed(2)})`,\n      content: body,\n    })\n  }\n  return out\n}\n\nfunction toolCallCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  toolCalls: string[],\n): Candidate[] {\n  const out: Candidate[] = []\n  toolCalls.forEach((name, i) => {\n    const score = tokenRecall(req.title, name)\n    if (score < MATCH_THRESHOLD) return\n    out.push({\n      reqIndex,\n      itemKey: `tool:${i}`,\n      score,\n      evidence: `tool call '${name}' matched (token recall ${score.toFixed(2)})`,\n      content: null,\n    })\n  })\n  return out\n}\n\n/**\n * Verify whether a run completed the task. `checkCorrectness` is injected —\n * `createLlmCorrectnessChecker` for production, a deterministic stub in tests.\n *\n * Throws on a gold spec with no requirements: an eval task that requires\n * nothing is a misconfiguration, not a vacuously-complete task.\n */\nexport async function verifyCompletion(\n  gold: TaskGold,\n  state: ProducedState,\n  checkCorrectness: CorrectnessChecker,\n): Promise<CompletionVerdict> {\n  if (gold.requirements.length === 0) {\n    throw new Error(\n      `verifyCompletion: task '${gold.taskId}' has no requirements — malformed gold spec`,\n    )\n  }\n\n  // Collect every above-threshold (requirement, produced-item) candidate, then\n  // assign greedily by descending score: each requirement and each produced\n  // item is used at most once. One deliverable fulfils one requirement.\n  const candidates: Candidate[] = []\n  gold.requirements.forEach((req, i) => {\n    const by = req.satisfiedBy ?? 'any'\n    if (by === 'artifact' || by === 'any') {\n      candidates.push(...artifactCandidates(req, i, state.artifacts))\n    }\n    if (by === 'proposal' || by === 'any') {\n      candidates.push(...proposalCandidates(req, i, state.proposals))\n    }\n    if (by === 'tool-call' || by === 'any') {\n      candidates.push(...toolCallCandidates(req, i, state.toolCalls))\n    }\n  })\n  candidates.sort((a, b) => b.score - a.score)\n\n  const assigned = new Map<number, Candidate>()\n  const itemTaken = new Set<string>()\n  for (const c of candidates) {\n    if (assigned.has(c.reqIndex) || itemTaken.has(c.itemKey)) continue\n    assigned.set(c.reqIndex, c)\n    itemTaken.add(c.itemKey)\n  }\n\n  const requirements: RequirementCheck[] = []\n  for (let i = 0; i < gold.requirements.length; i++) {\n    const req = gold.requirements[i]!\n    const match = assigned.get(i)\n    const evidence: string[] = []\n    let correct: boolean | null = null\n    let unmeasuredReason: string | undefined\n\n    if (match) {\n      evidence.push(match.evidence)\n      if (match.content !== null) {\n        try {\n          const r = await checkCorrectness(req, match.content)\n          correct = r.correct\n          evidence.push(`correctness: ${r.correct ? 'pass' : 'fail'} — ${r.reason}`)\n        } catch (err) {\n          // The CHECKER failed, not the requirement. Recording this as a\n          // zero would fabricate a model failure out of an infrastructure\n          // one; the requirement is unmeasured and leaves the denominator.\n          unmeasuredReason =\n            err instanceof JudgeParseError\n              ? `checker response unparseable after retry: ${err.raw.slice(0, 200)}`\n              : `checker call failed: ${err instanceof Error ? err.message : String(err)}`\n          evidence.push(`correctness: UNMEASURED — ${unmeasuredReason}`)\n        }\n      } else {\n        evidence.push('correctness: not assessed — matched item carries no content')\n      }\n    } else {\n      const by = req.satisfiedBy ?? 'any'\n      const kind = by === 'any' ? 'artifact/proposal/tool-call' : by\n      evidence.push(`no produced ${kind} matched this requirement`)\n    }\n\n    const structurallyPresent = match !== undefined\n    const unmeasured = unmeasuredReason !== undefined\n    const satisfied = structurallyPresent && !unmeasured && correct !== false\n    requirements.push({\n      reqId: req.reqId,\n      title: req.title,\n      structurallyPresent,\n      correct,\n      satisfied,\n      ...(unmeasured ? { unmeasured: true as const, unmeasuredReason } : {}),\n      evidence,\n    })\n  }\n\n  // The verdict blends the deterministic structural stage with the injected\n  // correctness stage, so the certification names the checker's own member\n  // and carries the structural stage's lexical nature as an assumption. A\n  // checker without an attestation yields an uncertified verdict.\n  const attestation = checkCorrectness.attestation\n  const certification: VerdictCertification | undefined = attestation\n    ? {\n        strategy: attestation.strategy,\n        checker: attestation.checker,\n        assumptions: [\n          'structural matching is lexical token recall over produced items — the correctness stage only sees items it matched',\n          ...attestation.assumptions,\n        ],\n        evidenceDigest: certificationEvidenceDigest({ taskId: gold.taskId, requirements }),\n      }\n    : undefined\n\n  return completionVerdict({\n    taskId: gold.taskId,\n    requirements,\n    ...(certification === undefined ? {} : { certification }),\n  })\n}\n\nexport interface LlmCorrectnessCheckerOpts {\n  model?: string\n  /** Optional ledger for direct use. */\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  costTags?: Record<string, string>\n  signal?: AbortSignal\n  /** Max chars of artifact content sent to the checker. */\n  maxContentChars?: number\n  /**\n   * Checker LLM calls per requirement before giving up (parse failures and\n   * call errors both consume attempts). The failure then surfaces as an\n   * `unmeasured` requirement, never a zero.\n   */\n  maxAttempts?: number\n  /**\n   * Forensic capture of every checker request/response/error — without it a\n   * checker failure is unauditable (the agent-turn raws never contain the\n   * checker's own calls). Same sink contract as `LlmClient`.\n   */\n  rawSink?: RawProviderSink\n}\n\n/**\n * Parse the correctness checker's model response. Tolerates a response\n * truncated mid-JSON (max_tokens cap) by auto-closing the prefix — the\n * verdict boolean usually lands in the first few tokens, so a recovered\n * prefix with a boolean `correct` is a real measurement, not a guess.\n * Fails loud (JudgeParseError) when no boolean verdict is recoverable.\n */\nfunction parseCorrectnessResponse(raw: string): { correct: boolean; reason: string } {\n  const readVerdict = (candidate: unknown): { correct: boolean; reason: string } | null => {\n    if (candidate === null || typeof candidate !== 'object') return null\n    const { correct, reason } = candidate as { correct?: unknown; reason?: unknown }\n    if (typeof correct !== 'boolean') return null\n    return { correct, reason: typeof reason === 'string' ? reason : '' }\n  }\n\n  const match = raw.match(/\\{[\\s\\S]*\\}/)\n  if (match) {\n    try {\n      const strict = readVerdict(JSON.parse(match[0]))\n      if (strict) return strict\n    } catch {\n      // fall through to truncation recovery\n    }\n  }\n  // The strict path needs a closing `}`; a cap-hit response has none. Take\n  // everything from the first `{` and auto-close it.\n  const start = raw.indexOf('{')\n  if (start !== -1) {\n    const recovered = readVerdict(recoverTruncatedJson(raw.slice(start)))\n    if (recovered) return recovered\n  }\n  throw new JudgeParseError('correctness-checker', raw)\n}\n\n/**\n * Production `CorrectnessChecker` — one LLM call per matched artifact,\n * deterministic (temperature 0), structured JSON out. Judges fulfilment\n * only: a plan, a gesture, or a description of what should be done does not\n * fulfil a requirement — the artifact must BE the deliverable.\n */\nexport function createLlmCorrectnessChecker(\n  chat: ChatClient,\n  opts: LlmCorrectnessCheckerOpts = {},\n): CorrectnessChecker {\n  const model = opts.model ?? 'claude-sonnet-4-6'\n  const maxContentChars = opts.maxContentChars ?? 8000\n  const maxAttempts = opts.maxAttempts ?? 2\n  const costLedger = opts.costLedger ?? new CostLedger()\n  const sink = opts.rawSink\n  const record = async (event: RawProviderEvent): Promise<void> => {\n    // Forensic capture is best-effort; the verdict is the system of record.\n    try {\n      await sink?.record(event)\n    } catch {\n      // Intentionally swallowed.\n    }\n  }\n  const checker: CorrectnessChecker = async (requirement, content) => {\n    const request = {\n      model,\n      messages: [\n        {\n          role: 'system' as const,\n          content:\n            'You verify whether a produced work artifact actually fulfils a stated requirement. Judge fulfilment only — is the deliverable substantively present and on-point — not polish. A plan to do it later, a vague gesture, or a description of what should be done does NOT fulfil a requirement; the artifact must BE the deliverable. Respond with a single JSON object: {\"correct\": boolean, \"reason\": string (<= 30 words)}.',\n        },\n        {\n          role: 'user' as const,\n          content: `Requirement: ${requirement.title}\\n${\n            requirement.category ? `Category: ${requirement.category}\\n` : ''\n          }\\nProduced artifact:\\n${content.slice(0, maxContentChars)}`,\n        },\n      ],\n      temperature: 0,\n      maxTokens: 200,\n    } satisfies ChatRequest\n    let lastErr: unknown\n    for (let attempt = 0; attempt < maxAttempts; attempt++) {\n      const started = Date.now()\n      await record({\n        eventId: randomUUID(),\n        provider: chat.transport,\n        model,\n        endpoint: '/chat',\n        baseUrl: '',\n        attemptIndex: attempt,\n        direction: 'request',\n        timestamp: started,\n        requestBody: request,\n        redactedFields: [],\n      })\n      try {\n        const paid = await costLedger.runPaidCall({\n          channel: 'verifier',\n          phase: opts.costPhase ?? 'completion.correctness',\n          actor: 'correctness-checker',\n          model,\n          maximumCharge:\n            chat.maximumAttempts === undefined\n              ? undefined\n              : maximumChargeForLlmRequest(request, { maximumAttempts: chat.maximumAttempts }),\n          tags: {\n            ...opts.costTags,\n            requirementId: requirement.reqId,\n            attempt: String(attempt),\n          },\n          signal: opts.signal,\n          execute: (signal, callId) => chat.chat(request, { signal, idempotencyKey: callId }),\n          receipt: costReceiptFromLlm,\n          receiptFromError: costReceiptFromLlmError,\n        })\n        if (!paid.succeeded) throw paid.error\n        const resp = paid.value\n        // Hold the transport to its own word: a verdict produced by a model\n        // other than the one requested is not this model's verdict. A\n        // transport that echoes no id cannot be made to prove identity here —\n        // callers needing that proof enable it at the client\n        // (`LlmClientOptions.assertServedModel`) or gate on `assertModelsServed`.\n        assertServedModel(model, resp.servedModel, {\n          allowUnreported: true,\n          context: `correctness checker for requirement ${requirement.reqId}`,\n        })\n        const raw = resp.content\n        await record({\n          eventId: randomUUID(),\n          provider: chat.transport,\n          model,\n          endpoint: '/chat',\n          baseUrl: '',\n          attemptIndex: attempt,\n          direction: 'response',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          responseBody: resp,\n          redactedFields: [],\n        })\n        return parseCorrectnessResponse(raw)\n      } catch (err) {\n        lastErr = err\n        await record({\n          eventId: randomUUID(),\n          provider: chat.transport,\n          model,\n          endpoint: '/chat',\n          baseUrl: '',\n          attemptIndex: attempt,\n          direction: 'error',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          errorMessage: err instanceof Error ? err.message : String(err),\n          redactedFields: [],\n        })\n        // Substitution is a verdict about identity, not a transient fault:\n        // another attempt reaches the same wrong model and spends more tokens.\n        if (err instanceof ModelSubstitutionError) throw err\n      }\n    }\n    throw lastErr instanceof Error ? lastErr : new Error(String(lastErr))\n  }\n  checker.attestation = {\n    strategy: 'judge',\n    checker: { name: 'llm-correctness-checker', version: model },\n    assumptions: [\n      'served-model identity is accepted when the transport reports none (assertServedModel allowUnreported)',\n    ],\n  }\n  return checker\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAeA,MAAa,mBAA2C;CACtD;CACA;CACA;CACA;AACF;;;;;;AAwBA,MAAa,uBAAuB;;;;;;;;;;;;;;;;;;;AAoBpC,SAAgB,kBAAkB,MAAuC;CACvE,MAAM,YAAY,KAAK,aAAa;CACpC,IAAI,UAAU,WAAW,GAAG,MAAM,IAAI,gBAAgB,0CAA0C;CAChG,MAAM,YAAY,KAAK,KAAK,OAAO;CACnC,MAAM,SAAS,KAAK,WAAW,YAAY,CAAC,SAAS,IAAI,CAAC;CAC1D,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,gBACR,kGACF;CAEF,MAAM,MAAsB,CAAC;CAC7B,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,WAAW,WAAW;EAS/B,MAAM,YAAY,KAAK,mBACnB,SACA,OAAO,QAAQ,UAAU,qBAAqB,SAAS,KAAK,CAAC;EACjE,MAAM,YAAY,UAAU,SAAS,IAAI,YAAY,CAAC,oBAAoB;EAC1E,KAAK,MAAM,SAAS,WAAW;GAC7B,MAAM,UAAwB;IAC5B,GAAG,KAAK;IACR;IACA,MAAM,GAAG,KAAK,KAAK,QAAQ,QAAQ,GAAG,QAAQ,GAAG;IACjD,OAAO;KAAE,GAAG,KAAK,KAAK;KAAO,SAAS;IAAM;IAC5C,UAAU;KAAE,GAAI,KAAK,KAAK,YAAY,CAAC;KAAI;KAAS,cAAc;IAAM;GAC1E;GACA,MAAM,KAAK,eAAe,OAAO;GACjC,IAAI,KAAK,IAAI,EAAE,GAAG;GAClB,KAAK,IAAI,EAAE;GACX,IAAI,KAAK,OAAO;EAClB;CACF;CACA,IAAI,IAAI,WAAW,GAGjB,MAAM,IAAI,gBACR,uDAAuD,UAAU,KAAK,IAAI,EAAE,aAAa,OAAO,KAAK,IAAI,EAAE,IAC7G;CAEF,OAAO;AACT;;;;;;;;AASA,SAAgB,cACd,SACqD;CACrD,MAAM,IAAI,QAAQ;CAClB,MAAM,UAAU,GAAG;CACnB,MAAM,QAAQ,GAAG;CACjB,IAAI,OAAO,YAAY,YAAY,OAAO,UAAU,UAClD,OAAO;EAAW;EAAwB;CAAM;AAGpD;;;;;;;;AASA,SAAgB,eAAe,SAA+B;CAE5D,OAAO,GADO,qBAAqB,yBAAyB,OAAO,CAAC,KAAK,UACzD,GAAG,iBAAiB,OAAO,CAAC,CAAC,MAAM,GAAG,EAAE;AAC1D;;;;;AAMA,SAAgB,oBAAoB,SAA+B;CACjE,MAAM,QAAQ,QAAQ,OAAO,SAAS,KAAK;CAC3C,IAAI,CAAC,OAAO;EACV,MAAM,QAAQ,yBAAyB,OAAO,KAAK;EACnD,MAAM,IAAI,gBACR,iBAAiB,MAAM,gDACzB;CACF;CACA,OAAO;AACT;AAEA,SAAS,yBAAyB,SAA2C;CAC3E,OAAO,QAAQ,MAAM,KAAK,KAAK,QAAQ,SAAS,KAAK,KAAK,KAAA;AAC5D;AAEA,SAAS,qBAAqB,OAA+C;CAM3E,OALa,OACT,KAAK,CAAC,CACP,QAAQ,qBAAqB,GAAG,CAAC,CACjC,QAAQ,OAAO,GAAG,CAAC,CACnB,QAAQ,UAAU,EAAE,KACR,KAAA;AACjB;AAEA,SAAS,QAA2C,OAAsB;CACxE,MAAM,MAA+B,CAAC;CACtC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,IAAI,UAAU,KAAA,GAAW,IAAI,OAAO;CAEtC,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,iBAAiB,SAA+B;CAC9D,MAAM,QAAQ,oBAAoB,OAAO;CACzC,MAAM,YAAY,QAAQ;EACxB,GAAG;EACH,MAAM,KAAA;EACN,aAAa,KAAA;EACb,MAAM,QAAQ,OAAO,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC,KAAK,IAAI,KAAA;EAChD,OAAO,QAAQ;GAAE,GAAG,QAAQ;GAAO,SAAS;EAAM,CAAC;CACrD,CAAC;CACD,OAAO,WAAW,QAAQ,CAAC,CAAC,OAAO,gBAAgB,SAAS,CAAC,CAAC,CAAC,OAAO,KAAK;AAC7E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACvEA,SAAgB,kBAAkB,OAMZ;CACpB,IAAI,MAAM,aAAa,WAAW,GAChC,MAAM,IAAI,MACR,4BAA4B,MAAM,OAAO,+DAC3C;CAEF,MAAM,aAAa,MAAM,aAAa,QAAQ,MAAM,CAAC,EAAE,UAAU;CACjE,MAAM,kBAAkB,MAAM,aAAa,SAAS,WAAW;CAC/D,IAAI,WAAW,WAAW,GAGxB,MAAM,IAAI,MACR,4BAA4B,MAAM,OAAO,yCAAyC,MAAM,aAAa,OAAO,8BAA8B,MAAM,aAAa,EAAE,EAAE,oBAAoB,iBAAiB,EACxM;CAEF,MAAM,iBAAiB,WAAW,QAAQ,MAAM,EAAE,SAAS,CAAC,CAAC;CAC7D,MAAM,iBAAiB,iBAAiB,WAAW;CAGnD,MAAM,gBAAgB,oBAAoB,KAAK,mBAAmB,WAAW;CAC7E,OAAO;EACL,QAAQ,MAAM;EACd,cAAc,MAAM;EACpB;EACA;EACA;EACA,OAAO;EACP,OAAO;EACP,GAAI,MAAM,kBAAkB,KAAA,IAAY,CAAC,IAAI,EAAE,eAAe,MAAM,cAAc;CACpF;AACF;AA+BA,MAAM,4BAAY,IAAI,IAAI;CACxB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAUD,MAAM,6CAA6B,IAAI,IAAI;CACzC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAM,kBAAkB;AACxB,MAAM,oBAAoB;AAE1B,SAAS,OAAO,GAAW,WAAsC;CAC/D,OAAO,IAAI,IACT,EACG,YAAY,CAAC,CACb,MAAM,YAAY,CAAC,CACnB,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC,CAC1E;AACF;;;;;;;AAQA,SAAS,YAAY,iBAAyB,eAA+B;CAC3E,MAAM,MAAM,OAAO,iBAAiB,0BAA0B;CAC9D,IAAI,IAAI,SAAS,GAAG,OAAO;CAC3B,MAAM,OAAO,OAAO,aAAa;CACjC,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG;CACtC,OAAO,MAAM,IAAI;AACnB;AAYA,SAAS,mBACP,KACA,UACA,WACa;CACb,MAAM,UAAU,GAAG,IAAI,MAAM,GAAG,IAAI,YAAY;CAChD,MAAM,MAAmB,CAAC;CAC1B,UAAU,SAAS,GAAG,MAAM;EAC1B,KAAK,EAAE,WAAW,GAAA,CAAI,KAAK,CAAC,CAAC,SAAS,mBAAmB;EAKzD,IAAI,QAAQ,YACV,SACA,GAAG,EAAE,QAAQ,GAAG,GAAG,EAAE,KAAK,IAAI,EAAE,WAAW,GAAA,CAAI,MAAM,GAAG,GAAI,GAC9D;EACA,IAAI,IAAI,YAAY,EAAE,QAAQ,IAAI,SAAS,YAAY,MAAM,EAAE,KAAK,YAAY,GAC9E,QAAQ,KAAK,IAAI,OAAO,CAAC;EAE3B,IAAI,QAAQ,iBAAiB;EAC7B,IAAI,KAAK;GACP;GACA,SAAS,YAAY;GACrB;GACA,UAAU,aAAa,EAAE,QAAQ,EAAE,KAAK,0BAA0B,MAAM,QAAQ,CAAC,EAAE;GACnF,SAAS,EAAE,WAAW;EACxB,CAAC;CACH,CAAC;CACD,OAAO;AACT;AAEA,SAAS,mBACP,KACA,UACA,WACa;CACb,MAAM,UAAU,GAAG,IAAI,MAAM,GAAG,IAAI,YAAY;CAChD,MAAM,MAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,WAAW;EAEzB,IAAI,EAAE,WAAW,YAAY;EAM7B,MAAM,QAAQ,EAAE,WAAW,GAAA,CAAI,KAAK;EACpC,IAAI,KAAK,SAAS,mBAAmB;EASrC,MAAM,QAAQ,YAAY,SAAS,GAAG,EAAE,MAAM,GAAG,MAAM;EACvD,IAAI,QAAQ,iBAAiB;EAC7B,IAAI,KAAK;GACP;GACA,SAAS,YAAY,EAAE;GACvB;GACA,UAAU,sBAAsB,EAAE,MAAM,0BAA0B,MAAM,QAAQ,CAAC,EAAE;GACnF,SAAS;EACX,CAAC;CACH;CACA,OAAO;AACT;AAEA,SAAS,mBACP,KACA,UACA,WACa;CACb,MAAM,MAAmB,CAAC;CAC1B,UAAU,SAAS,MAAM,MAAM;EAC7B,MAAM,QAAQ,YAAY,IAAI,OAAO,IAAI;EACzC,IAAI,QAAQ,iBAAiB;EAC7B,IAAI,KAAK;GACP;GACA,SAAS,QAAQ;GACjB;GACA,UAAU,cAAc,KAAK,0BAA0B,MAAM,QAAQ,CAAC,EAAE;GACxE,SAAS;EACX,CAAC;CACH,CAAC;CACD,OAAO;AACT;;;;;;;;AASA,eAAsB,iBACpB,MACA,OACA,kBAC4B;CAC5B,IAAI,KAAK,aAAa,WAAW,GAC/B,MAAM,IAAI,MACR,2BAA2B,KAAK,OAAO,4CACzC;CAMF,MAAM,aAA0B,CAAC;CACjC,KAAK,aAAa,SAAS,KAAK,MAAM;EACpC,MAAM,KAAK,IAAI,eAAe;EAC9B,IAAI,OAAO,cAAc,OAAO,OAC9B,WAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;EAEhE,IAAI,OAAO,cAAc,OAAO,OAC9B,WAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;EAEhE,IAAI,OAAO,eAAe,OAAO,OAC/B,WAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;CAElE,CAAC;CACD,WAAW,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CAE3C,MAAM,2BAAW,IAAI,IAAuB;CAC5C,MAAM,4BAAY,IAAI,IAAY;CAClC,KAAK,MAAM,KAAK,YAAY;EAC1B,IAAI,SAAS,IAAI,EAAE,QAAQ,KAAK,UAAU,IAAI,EAAE,OAAO,GAAG;EAC1D,SAAS,IAAI,EAAE,UAAU,CAAC;EAC1B,UAAU,IAAI,EAAE,OAAO;CACzB;CAEA,MAAM,eAAmC,CAAC;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,aAAa,QAAQ,KAAK;EACjD,MAAM,MAAM,KAAK,aAAa;EAC9B,MAAM,QAAQ,SAAS,IAAI,CAAC;EAC5B,MAAM,WAAqB,CAAC;EAC5B,IAAI,UAA0B;EAC9B,IAAI;EAEJ,IAAI,OAAO;GACT,SAAS,KAAK,MAAM,QAAQ;GAC5B,IAAI,MAAM,YAAY,MACpB,IAAI;IACF,MAAM,IAAI,MAAM,iBAAiB,KAAK,MAAM,OAAO;IACnD,UAAU,EAAE;IACZ,SAAS,KAAK,gBAAgB,EAAE,UAAU,SAAS,OAAO,KAAK,EAAE,QAAQ;GAC3E,SAAS,KAAK;IAIZ,mBACE,eAAe,kBACX,6CAA6C,IAAI,IAAI,MAAM,GAAG,GAAG,MACjE,wBAAwB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;IAC7E,SAAS,KAAK,6BAA6B,kBAAkB;GAC/D;QAEA,SAAS,KAAK,6DAA6D;EAE/E,OAAO;GACL,MAAM,KAAK,IAAI,eAAe;GAC9B,MAAM,OAAO,OAAO,QAAQ,gCAAgC;GAC5D,SAAS,KAAK,eAAe,KAAK,0BAA0B;EAC9D;EAEA,MAAM,sBAAsB,UAAU,KAAA;EACtC,MAAM,aAAa,qBAAqB,KAAA;EACxC,MAAM,YAAY,uBAAuB,CAAC,cAAc,YAAY;EACpE,aAAa,KAAK;GAChB,OAAO,IAAI;GACX,OAAO,IAAI;GACX;GACA;GACA;GACA,GAAI,aAAa;IAAE,YAAY;IAAe;GAAiB,IAAI,CAAC;GACpE;EACF,CAAC;CACH;CAMA,MAAM,cAAc,iBAAiB;CACrC,MAAM,gBAAkD,cACpD;EACE,UAAU,YAAY;EACtB,SAAS,YAAY;EACrB,aAAa,CACX,sHACA,GAAG,YAAY,WACjB;EACA,gBAAgB,4BAA4B;GAAE,QAAQ,KAAK;GAAQ;EAAa,CAAC;CACnF,IACA,KAAA;CAEJ,OAAO,kBAAkB;EACvB,QAAQ,KAAK;EACb;EACA,GAAI,kBAAkB,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc;CACzD,CAAC;AACH;;;;;;;;AAgCA,SAAS,yBAAyB,KAAmD;CACnF,MAAM,eAAe,cAAoE;EACvF,IAAI,cAAc,QAAQ,OAAO,cAAc,UAAU,OAAO;EAChE,MAAM,EAAE,SAAS,WAAW;EAC5B,IAAI,OAAO,YAAY,WAAW,OAAO;EACzC,OAAO;GAAE;GAAS,QAAQ,OAAO,WAAW,WAAW,SAAS;EAAG;CACrE;CAEA,MAAM,QAAQ,IAAI,MAAM,aAAa;CACrC,IAAI,OACF,IAAI;EACF,MAAM,SAAS,YAAY,KAAK,MAAM,MAAM,EAAE,CAAC;EAC/C,IAAI,QAAQ,OAAO;CACrB,QAAQ,CAER;CAIF,MAAM,QAAQ,IAAI,QAAQ,GAAG;CAC7B,IAAI,UAAU,IAAI;EAChB,MAAM,YAAY,YAAY,qBAAqB,IAAI,MAAM,KAAK,CAAC,CAAC;EACpE,IAAI,WAAW,OAAO;CACxB;CACA,MAAM,IAAI,gBAAgB,uBAAuB,GAAG;AACtD;;;;;;;AAQA,SAAgB,4BACd,MACA,OAAkC,CAAC,GACf;CACpB,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,kBAAkB,KAAK,mBAAmB;CAChD,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,aAAa,KAAK,cAAc,IAAI,WAAW;CACrD,MAAM,OAAO,KAAK;CAClB,MAAM,SAAS,OAAO,UAA2C;EAE/D,IAAI;GACF,MAAM,MAAM,OAAO,KAAK;EAC1B,QAAQ,CAER;CACF;CACA,MAAM,UAA8B,OAAO,aAAa,YAAY;EAClE,MAAM,UAAU;GACd;GACA,UAAU,CACR;IACE,MAAM;IACN,SACE;GACJ,GACA;IACE,MAAM;IACN,SAAS,gBAAgB,YAAY,MAAM,IACzC,YAAY,WAAW,aAAa,YAAY,SAAS,MAAM,GAChE,wBAAwB,QAAQ,MAAM,GAAG,eAAe;GAC3D,CACF;GACA,aAAa;GACb,WAAW;EACb;EACA,IAAI;EACJ,KAAK,IAAI,UAAU,GAAG,UAAU,aAAa,WAAW;GACtD,MAAM,UAAU,KAAK,IAAI;GACzB,MAAM,OAAO;IACX,SAAS,WAAW;IACpB,UAAU,KAAK;IACf;IACA,UAAU;IACV,SAAS;IACT,cAAc;IACd,WAAW;IACX,WAAW;IACX,aAAa;IACb,gBAAgB,CAAC;GACnB,CAAC;GACD,IAAI;IACF,MAAM,OAAO,MAAM,WAAW,YAAY;KACxC,SAAS;KACT,OAAO,KAAK,aAAa;KACzB,OAAO;KACP;KACA,eACE,KAAK,oBAAoB,KAAA,IACrB,KAAA,IACA,2BAA2B,SAAS,EAAE,iBAAiB,KAAK,gBAAgB,CAAC;KACnF,MAAM;MACJ,GAAG,KAAK;MACR,eAAe,YAAY;MAC3B,SAAS,OAAO,OAAO;KACzB;KACA,QAAQ,KAAK;KACb,UAAU,QAAQ,WAAW,KAAK,KAAK,SAAS;MAAE;MAAQ,gBAAgB;KAAO,CAAC;KAClF,SAAS;KACT,kBAAkB;IACpB,CAAC;IACD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK;IAChC,MAAM,OAAO,KAAK;IAMlB,kBAAkB,OAAO,KAAK,aAAa;KACzC,iBAAiB;KACjB,SAAS,uCAAuC,YAAY;IAC9D,CAAC;IACD,MAAM,MAAM,KAAK;IACjB,MAAM,OAAO;KACX,SAAS,WAAW;KACpB,UAAU,KAAK;KACf;KACA,UAAU;KACV,SAAS;KACT,cAAc;KACd,WAAW;KACX,WAAW,KAAK,IAAI;KACpB,YAAY,KAAK,IAAI,IAAI;KACzB,cAAc;KACd,gBAAgB,CAAC;IACnB,CAAC;IACD,OAAO,yBAAyB,GAAG;GACrC,SAAS,KAAK;IACZ,UAAU;IACV,MAAM,OAAO;KACX,SAAS,WAAW;KACpB,UAAU,KAAK;KACf;KACA,UAAU;KACV,SAAS;KACT,cAAc;KACd,WAAW;KACX,WAAW,KAAK,IAAI;KACpB,YAAY,KAAK,IAAI,IAAI;KACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;KAC7D,gBAAgB,CAAC;IACnB,CAAC;IAGD,IAAI,eAAe,wBAAwB,MAAM;GACnD;EACF;EACA,MAAM,mBAAmB,QAAQ,UAAU,IAAI,MAAM,OAAO,OAAO,CAAC;CACtE;CACA,QAAQ,cAAc;EACpB,UAAU;EACV,SAAS;GAAE,MAAM;GAA2B,SAAS;EAAM;EAC3D,aAAa,CACX,uGACF;CACF;CACA,OAAO;AACT"}

package/dist/cost-ledger-C1W3ICmP.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cost-ledger-C1W3ICmP.d.ts","names":[],"sources":["../src/cost-ledger/contract.ts","../src/cost-ledger.ts"],"mappings":";KAGY;;KAGA;EACN;EAAkB;;EAClB;EAAmB;;EACnB;EAAoB;;;UAGT;EACf,QAAQ;EACR,SAAS;;EAET;IACM;IAAmB;;IACnB;IAAoB;IAAe;;;EAEzC,SAAS;IACP;IACA;IACA;IACA,OAAO;;;UAIM;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA,SAAS;EACT;EACA;EACA;EACA;EACA,OAAO;EACP;;UAGe,wBAAwB;EACvC;;UAGe,4BAA4B;EAC3C;;UAGe,oBAAoB,cAAc;EACjD,gBAAgB;EAChB;EACA;EACA;EACA;;EAEA;IACE;IACA;IACA;IACA;;;EAGF;;EAEA;;;EAGA;;UAKe,yBAAyB;EACxC,gBAAgB;EAChB;;EAEA,qBAAqB;EACrB;;EAEA;EACA;EACA;;;UAIe;;EAEf;;EAEA;;EAEA;EACA;;KAGU;EACN;;EAEA,oBAAoB;IAClB,KAAK;EACN;IAAkB;UAER,iBAAiB;EAChC;EACA,SAAS;EACT;EACA;;EAEA;EACA,OAAO;EACP,SAAS;;EAET,gBAAgB;;EAEhB,QAAQ,QAAQ,aAAa,iBAAiB,QAAQ;EACtD,QAAQ,OAAO,IAAI;EACnB,kBAAkB,OAAO,QAAQ;;KAGvB,eAAe;EACrB;EAAiB;EAAgB,OAAO;EAAG,SAAS;;EACpD;EAAkB;EAAiB,OAAO;EAAO,UAAU;;UAEhD;EACf,SAAS;EACT;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf,gBAAgB;EAChB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,gBAAgB;EAChB,WAAW;EACX;EACA;EACA;EACA;EACA;;UAGe;EACf,UAAU;EACV;EACA,OAAO;;UAGQ;;EAEf;;EAEA,SAAS;;;UAIM;EACf;IAAU;IAAkB;;EAC5B,OAAO,0BAA0B;;UAGlB;EACf;EACA,cAAc;;EAEd,oBAAoB;;;;;;;;KASV,mBAAmB,KAC7B,YACA,cAAc,8CAEd,QAAQ,KAAK;;;;cCjIF;mBACM;mBACA;mBACA;mBACA;UACT;UACA;UACA;WACC;mBACQ;EAEjB,YAAY,iBAAiB;EAwDvB,YAAY,GAAG,OAAO,iBAAiB,KAAK,QAAQ,eAAe;;EA8GnE,YAAY,UAAS,wBAA6B;;EA0BxD,UACE,gBACA,UAAU,kBACV;IAAW;IAAkB;MAC5B;EAiBH,KAAK,SAAS,mBAAmB;;EAQjC,YAAY,SAAS,mBAAmB;EAcxC,QAAQ,SAAS,mBAAmB;EAIpC,cAAc;EAYd;UAIc;UAoDN;UAsCA;UAKM;UAoBN;UAmBA;UAkBA;UAcA;;UAgCA;UAwBA;UAYA;UAMA"}

package/dist/dataset-DQqhOCPt.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dataset-DQqhOCPt.d.ts","names":[],"sources":["../src/dataset.ts"],"mappings":";;;;;;;;;;;;;;;;;KAiBY;KACA;UAEK;EACf;;EAEA;EACA,QAAQ;EACR,aAAa;;EAEb;;;;;;;;;;EAUA;EACA,OAAO;;UAGQ;EACf;EACA;EACA;EACA;EACA;;EAEA;;UAGe;EACf;EACA,YAAY;;EAEZ;EACA;EACA,aAAa,OAAO;;UAGZ;EACR,QAAQ;EACR,aAAa;;EAEb;EACA;;EAEA,UAAU,UAAU;;EAEpB;;cAeW;WACF;WACA,YAAY;UACb;UACA;EAER,YAAY;IACV;IACA,YAAY;IACZ,WAAW;IACX;;;EASF,gBAAgB;MAIZ;;;;;EAQJ,MAAM,UAAS,eAAoB;;;;;EAqB7B,YAAY,QAAQ;;EAgB1B,MAAM,YAAW;IAAU;IAAc;OAA0B;EAWnE;EAIA,IAAI,UAAU;EAQd,OAAO;;;;;;EAYP;SAQO,UACL,eACA,UAAU,KAAK,oEACd"}

package/dist/default-registry-CLG5YqGS.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"default-registry-CLG5YqGS.d.ts","names":[],"sources":["../src/analyst/behavioral-trace-questions.ts","../src/analyst/behavioral-analyst.ts","../src/analyst/kind-factory.ts","../src/analyst/default-registry.ts"],"mappings":";;;;;;;;cAYa;;cAGA;;aAET;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;aAIF;aACA;aAEA;eACE;eACA;eACA;;;;KAKM,yCAAyC;KACzC;KACA;UACK;EACf;EACA;;EAEA,SAAS;;;UAIM;EACf;EACA,SAAS;EACT,cAAc;;UAEC;EACf;EACA;EACA,QAAQ;IAAQ;IAAY;IAAuB,cAAc;;;;UAGlD;EACf;EACA;EACA;EACA;EACA;EACA,KAAK;EACL,eAAe;;UAGA;EACf;EACA;EACA;EACA,OAAO;EACP;EACA;;EAEA,OAAO;;EAEP,QAAQ;;EAER;IAAW;IAAmB;;EAC9B,cAAc;;EAEd;IACE;IACA,UAAU;MAAQ;MAAY;MAAiB;MAAc;;;;UAIhD,sCAAsC;EACrD;;EAEA;EACA,cAAc;;UAGC;;EAEf;EACA;EACA,WAAW;;EAEX,mBAAmB;EACnB,QAAQ;;EAER,kBAAkB;EAClB,cAAc;EACd,eAAe,QACb,OACE,sBACA,QAAQ,OAAO,2BAA2B;EAG9C;EACA;;EAEA;EACA;EACA;;;iBAiBc,8BAA8B;EAC5C,YAAY;EACZ,OAAO;EACP,cAAc;EACd;EACA;EACA,mBAAmB;;;;UCpLJ;;EAEf;;EAEA;;EAEA,iBAAiB;;;iBAoGH,kBACd,UAAS,2BACR,oBAAoB;;;;UCzHN;EACf;EACA;EACA;EACA;;EAEA,sBAAsB,SAAS;;EAE/B;;EAEA,WAAW;;EAEX,kBACE,OAAO,oBACP,SAAS,wCACe;EAC1B,SAAS,QAAQ;EACjB,eAAe,KAAK,mBAAmB,SAAS,mBAAmB;EACnE;EACA;;UAGe;EACf,QAAQ;;EAER;EACA;;;iBAIoB,gBAAgB;EACpC,YAAY;EACZ,QAAQ;EACR,OAAO;EACP,SAAS;EACT;IACE,QAAQ;;iBAgHI,mBACd,YAAY,wBACZ,SAAS,4BACR,oBAAoB;;;UCrKN;;;;;;EAMf,SAAS;EACT,uBAAuB;;EAEvB;EACA,aAAa;EACb,WAAW;;iBAGG,4BACd,UAAS,gCACR"}

package/dist/define-agent-eval-JKt3gMQr.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"define-agent-eval-JKt3gMQr.d.ts","names":["_$__0.FinalEvidenceUse","_$__0.GateResult"],"sources":["../src/campaign/presets/run-final-comparison.ts","../src/contract/self-improve-method.ts","../src/contract/self-improve.ts","../src/contract/define-agent-eval.ts"],"mappings":";;;;;;;;;;UAaU,uBAAuB,kBAAkB,UAAU,mBACnD,KAAK,mBAAmB,WAAW;EAC3C,iBAAiB;EACjB,eAAe;EACf,sBACE,SAAS,gBACT,UAAU,WACV,KAAK,WAAW,mBAAmB,WAAW,+BAC3C,QAAQ;EACb,MAAM,KAAK,WAAW;EACtB,QAAQ;EACR,gBAAgB;EAChB;EACA;EACA,cAAc,QAAQ,gBAAgB,UAAU,mBAAmB;;;iBAI/C,mBAAmB,kBAAkB,UAAU,WACnE,MAAM,uBAAuB,WAAW,aAAU;;;;;;;;;;;;kBAA5CA;;;;;;;;;;;UCAS;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,oBAAoB,YAAY,0BAA0B;EAC1D,QAAQ;EACR;IACE;IACA;IACA;IACA;IACA;IACA;IACA;IACA,sBAAsB;;EAExB,MAAM,QAAQ,kBAAkB;EAChC;EACA;EACA;EACA;EACA,MAAM;EACN;EACA;;UAGe,wBAAwB,kBAAkB,UAAU,mBAC3D,KACN,0BAA0B,WAAW;EAWvC;IAAa,UAAU;IAAiB,QAAQ;;EAChD,uBAAuB;EACvB;;EAEA,UAAU,0BAA0B,WAAW;EAC/C,QAAQ,KAAK,0BAA0B,WAAW;IAChD;;EAEF,YAAY;EACZ,cAAc,YAAY,0BAA0B,WAAW;;EAE/D,MAAM;;EAEN,YAAY;EACZ,UAAU,0BAA0B,WAAW;EAC/C,KAAK,QAAQ,kBAAkB,mBAAmB,WAAW;IAC3D;IACA,iBAAiB,0BAA0B,WAAW;IACtD,eAAe,0BAA0B,WAAW;IACpD;IACA,QAAQ;IACR,MAAM;IACN,WAAW,kBAAkB;;;;;UCpBhB;;;EAGf;;;;EAIA;;EAEA;;EAEA;;;EAGA;;;EAGA;;;;EAIA;;EAEA,mBAAmB;;;;;;;;;EASnB;;EAEA;;;;;EAKA;;KAGU;EACN;EAA0B;;EAC1B;EAA4B;EAAuB;;EACnD;EAA4B;EAAe;;EAC3C;EAA8B;EAAe;EAAuB;;EAGpE;EAAsB;EAAkB;;EACxC;EAAyB;EAAW;EAAY;EAAa;;UAElD,mBAAmB,kBAAkB,UAAU,mBACtD;;;;;;;;;;;;;;EAcR,QAAQ,SAAS,gBAAgB,UAAU,WAAW,KAAK,oBAAoB,QAAQ;;;;;;;EAQvF;;EAEA;;;EAIA,WAAW;;EAGX,OAAO,YAAY,WAAW;;;EAI9B,iBAAiB;;EAGjB,SAAS;;;;;;;;;;;;;EAcT,sBAAsB,gCAAgC,WAAW;;;;;EAMjE,WAAW,gBAAgB;;;;;;EAO3B,SAAS,mBAAmB,WAAW;;;EAIvC,qBAAqB;;;EAIrB,OAAO,KAAK,WAAW;;;;;;;;EASvB,cAAc,eAAe,gBAAgB,iBAAiB,mBAAmB;;;;EAKjF,UAAU;;;;EAKV;;;EAIA,gBAAgB,QAAQ,uBAAuB;;;;;EAM/C,iBAAiB;IACf,UAAU;IACV;IACA;;;;EAKF;;;;;;;EAQA,YAAY;;;EAIZ,cAAc,OAAO;;;;EAKrB;EACA;EACA;;;;;;;;;;;;;EAcA,eAAe;;;;EAKf,eAAe;;EAGf;;;;;;;;EASA;;;;;;;;;EAUA,oBAAoB,uBAAuB,WAAW;;;EAItD,WAAW;;;;;EAMX,SAAS,uBAAuB,WAAW;;;EAI3C,eAAe,uBAAuB,WAAW;;EAEjD,WAAW;;EAEX,QAAQ;;EAER,gBAAgB;;UAGD,0BAA0B,kBAAkB,UAAU;EACrE;EACA,QAAQ;EACR,gBAAgB;;;;EAIhB;IACE;IACA,aAAa;;;;;EAKf;IACE;IACA,aAAa;IACb,SAAS;;;IAGT;;;;IAIA;;;;;;EAMF;;;EAGA;;;;EAIA,YAAY;;EAEZ;;;EAGA;;EAEA;;EAEA;;EAEA,MAAM;;;EAGN,UAAU;;;EAGV,gBAAgB;;EAEhB;IACE;IACA,MAAM;IACN;IACA,aAAa;;;;;;;;EAQf,SAAS;;;;EAIT,QAAQ;;;;;;EAMR,KAAK,yBAAyB,WAAW;;KAG/B,kBAAkB,kBAAkB,UAAU,aACtD,0BAA0B,WAAW,aACrC,wBAAwB,WAAW;KAE3B,yBAAyB,kBAAkB,UAAU,aAAa,KAC5E,mBAAmB,WAAW;EAG9B,QAAQ,mBAAmB,WAAW;EACtC;EACA,gBAAgB,QAAQ;;KAGd,2BAA2B,kBAAkB,UAAU,aAAa,KAC9E,mBAAmB,WAAW;EAG9B;EACA,gBAAgB,QAAQ;;;cAIb,4BAA4B;WAC9B,MAAM;WACN,UAAU;EAEnB,YAAY,gBAAgB,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA0NtB,YAAY,kBAAkB,UAAU,WACtD,MAAM,yBAAyB,WAAW,aACzC,QAAQ,wBAAwB,WAAW;iBAC9B,YAAY,kBAAkB,UAAU,WACtD,MAAM,2BAA2B,WAAW,aAC3C,QAAQ,0BAA0B,WAAW;iBAChC,YAAY,kBAAkB,UAAU,WACtD,MAAM,mBAAmB,WAAW,aACnC,QAAQ,kBAAkB,WAAW;;;KC9nB5B,eAAe,kBAAkB,UAAU,cACrD,SAAS,gBACT,UAAU,WACV,KAAK,oBACF,QAAQ;KAED,uBAAuB,kBAAkB,UAAU,aAAa,mBAC1E,WACA;UAGe,yBAAyB,kBAAkB,UAAU,mBAC5D,KACN,eAAe,WAAW;;EAI5B,YAAY;;EAEZ,UAAU;;EAEV,QAAQ,eAAe,WAAW;;EAElC,QAAQ,YAAY,WAAW;;EAE/B,SAAS,YAAY,WAAW;;EAEhC;;KAGU,wBAAwB,kBAAkB,UAAU,aAAa,KAC3E,QAAQ,mBAAmB,WAAW;EAGtC,SAAS,QAAQ;EACjB,eAAe,QAAQ;;UAGR,iBAAiB,kBAAkB,UAAU;;WAEnD,oBAAoB;;WAEpB,iBAAiB;;;;;EAK1B,SACE,OAAO,yBAAyB,WAAW,aAC1C,QAAQ,eAAe,WAAW;;;;;;;EAOrC,QACE,OAAO,wBAAwB,WAAW,aACzC,QAAQ,kBAAkB,WAAW;;;;;;;;;iBAU1B,gBAAgB,kBAAkB,UAAU,WAC1D,UAAU,uBAAuB,WAAW,aAC3C,iBAAiB,WAAW"}

package/dist/descriptive-B2iPaT9J.d.ts

@@ -1,89 +0,0 @@
-//#region src/statistics/descriptive.d.ts
-/**
- * Descriptive statistics: means, bootstrap spread, correlation, and the
- * weighted judge-dimension composite. Nothing here is a significance test.
- */
-/** Weighted mean — falls back to uniform weights when omitted */
-declare function weightedMean(scores: {
-  score: number;
-  weight?: number;
-}[]): number;
-/**
- * Percentile bootstrap confidence interval on the mean of `scores`.
- *
- * Descriptive spread. It is not a significance test, and at small n its bounds
- * are anti-conservative in the same way {@link pairedBootstrap}'s are — see
- * {@link BOOTSTRAP_GATE_MIN_N}. With no `seed` the resampling is seeded from
- * the scores themselves, so the interval is reproducible either way.
- */
-declare function confidenceInterval(scores: number[], confidence?: number, opts?: {
-  seed?: number;
-  resamples?: number;
-}): {
-  mean: number;
-  lower: number;
-  upper: number;
-};
-/** Partial credit: returns 0-1 ratio of current toward target */
-declare function partialCredit(current: number, target: number): number;
-/** Distribution summary of a number series: count, extremes, quantiles, sum. */
-interface SeriesDistribution {
-  readonly n: number;
-  readonly min: number;
-  readonly p50: number;
-  readonly p90: number;
-  readonly max: number;
-  readonly sum: number;
-}
-/**
- * Fold a number series into its distribution summary. Quantiles use the
- * nearest-rank definition — the `ceil(q·n)`-th order statistic — so every
- * reported quantile is a value from the series. Returns `null` for an empty
- * series: an empty series has no distribution, and a zero-filled summary
- * would read as a measured all-zero series.
- */
-declare function summarizeNumberSeries(values: readonly number[]): SeriesDistribution | null;
-/**
- * Average-rank-with-ties transform (1-indexed). Tied values receive the mean
- * of the ranks they span, the standard correction for Spearman's ρ.
- */
-declare function ranks(xs: number[]): number[];
-/**
- * Pearson product-moment correlation coefficient r ∈ [-1, 1] between two
- * equal-length series. See the edge-case contract above: NaN for n < 2 or
- * unequal lengths, 1 when both series are constant, 0 when exactly one is.
- */
-declare function pearsonR(a: number[], b: number[]): number;
-/**
- * Spearman's rank correlation ρ — Pearson over the average-rank-with-ties
- * transform of each series. Same edge-case contract as {@link pearsonR}.
- */
-declare function spearmanR(a: number[], b: number[]): number;
-interface WeightedCompositeInput {
-  /** Per-dimension scores (typically 0..1). */
-  dims: Record<string, number>;
-  /** Weight per dimension. Every weighted dimension MUST be present in
-   *  `dims` — a weight for an absent dimension is a config error and throws,
-   *  because silently dropping it would renormalise the composite onto a
-   *  different denominator than intended. */
-  weights: Record<string, number>;
-  /** Optional pass threshold; when set, the result reports `pass`. */
-  threshold?: number;
-}
-interface WeightedCompositeResult {
-  composite: number;
-  pass?: boolean;
-}
-/**
- * Weighted composite over judge dimensions: `Σ(score_d · w_d) / Σ(w_d)` across
- * the weighted dimensions. The canonical replacement for the per-consumer
- * hand-rolled composite math (tax/legal/creative/gtm each ship a copy).
- *
- * Fail-loud: throws if a weighted dimension is missing from `dims`, if any
- * weight is negative, or if the weights sum to 0 — none of which can produce
- * a meaningful composite.
- */
-declare function weightedComposite(input: WeightedCompositeInput): WeightedCompositeResult;
-//#endregion
-export { partialCredit as a, spearmanR as c, weightedMean as d, confidenceInterval as i, summarizeNumberSeries as l, WeightedCompositeInput as n, pearsonR as o, WeightedCompositeResult as r, ranks as s, SeriesDistribution as t, weightedComposite as u };
-//# sourceMappingURL=descriptive-B2iPaT9J.d.ts.map

package/dist/descriptive-B2iPaT9J.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"descriptive-B2iPaT9J.d.ts","names":[],"sources":["../src/statistics/descriptive.ts"],"mappings":";;;;;;iBAQgB,aAAa;EAAU;EAAe;;;;;;;;;;iBAoBtC,mBACd,kBACA,qBACA;EAAQ;EAAe;;EACpB;EAAc;EAAe;;;iBAiClB,cAAc,iBAAiB;;UAM9B;WACN;WACA;WACA;WACA;WACA;WACA;;;;;;;;;iBAUK,sBAAsB,4BAA4B;;;;;iBA8BlD,MAAM;;;;;;iBAmBN,SAAS,aAAa;;;;;iBAuBtB,UAAU,aAAa;UAKtB;;EAEf,MAAM;;;;;EAKN,SAAS;;EAET;;UAGe;EACf;EACA;;;;;;;;;;;iBAYc,kBAAkB,OAAO,yBAAyB"}

package/dist/descriptive-CVNy48rR.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"descriptive-CVNy48rR.js","names":[],"sources":["../src/statistics/descriptive.ts"],"sourcesContent":["/**\n * Descriptive statistics: means, bootstrap spread, correlation, and the\n * weighted judge-dimension composite. Nothing here is a significance test.\n */\n\nimport { makeRng } from './internal'\n\n/** Weighted mean — falls back to uniform weights when omitted */\nexport function weightedMean(scores: { score: number; weight?: number }[]): number {\n  if (scores.length === 0) return 0\n  let totalWeight = 0\n  let weightedSum = 0\n  for (const { score, weight } of scores) {\n    const w = weight ?? 1\n    weightedSum += score * w\n    totalWeight += w\n  }\n  return totalWeight > 0 ? weightedSum / totalWeight : 0\n}\n\n/**\n * Percentile bootstrap confidence interval on the mean of `scores`.\n *\n * Descriptive spread. It is not a significance test, and at small n its bounds\n * are anti-conservative in the same way {@link pairedBootstrap}'s are — see\n * {@link BOOTSTRAP_GATE_MIN_N}. With no `seed` the resampling is seeded from\n * the scores themselves, so the interval is reproducible either way.\n */\nexport function confidenceInterval(\n  scores: number[],\n  confidence = 0.95,\n  opts: { seed?: number; resamples?: number } = {},\n): { mean: number; lower: number; upper: number } {\n  if (scores.length === 0) return { mean: 0, lower: 0, upper: 0 }\n  if (scores.length === 1) return { mean: scores[0]!, lower: scores[0]!, upper: scores[0]! }\n\n  const n = scores.length\n  const mean = scores.reduce((a, b) => a + b, 0) / n\n\n  const B = opts.resamples ?? 1000\n  const rng = makeRng(opts.seed, scores)\n  const bootstrapMeans: number[] = []\n\n  for (let i = 0; i < B; i++) {\n    let sum = 0\n    for (let j = 0; j < n; j++) {\n      sum += scores[Math.floor(rng() * n)]!\n    }\n    bootstrapMeans.push(sum / n)\n  }\n\n  bootstrapMeans.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowerIdx = Math.floor((alpha / 2) * B)\n  const upperIdx = Math.floor((1 - alpha / 2) * B) - 1\n\n  return {\n    mean,\n    lower: bootstrapMeans[lowerIdx]!,\n    upper: bootstrapMeans[Math.min(upperIdx, B - 1)]!,\n  }\n}\n\n/** Partial credit: returns 0-1 ratio of current toward target */\nexport function partialCredit(current: number, target: number): number {\n  if (target <= 0) return 1\n  return Math.min(1, Math.max(0, current / target))\n}\n\n/** Distribution summary of a number series: count, extremes, quantiles, sum. */\nexport interface SeriesDistribution {\n  readonly n: number\n  readonly min: number\n  readonly p50: number\n  readonly p90: number\n  readonly max: number\n  readonly sum: number\n}\n\n/**\n * Fold a number series into its distribution summary. Quantiles use the\n * nearest-rank definition — the `ceil(q·n)`-th order statistic — so every\n * reported quantile is a value from the series. Returns `null` for an empty\n * series: an empty series has no distribution, and a zero-filled summary\n * would read as a measured all-zero series.\n */\nexport function summarizeNumberSeries(values: readonly number[]): SeriesDistribution | null {\n  if (values.length === 0) return null\n  const sorted = [...values].sort((a, b) => a - b)\n  const rank = (q: number): number =>\n    sorted[Math.min(sorted.length - 1, Math.max(0, Math.ceil(q * sorted.length) - 1))] as number\n  return {\n    n: sorted.length,\n    min: sorted[0] as number,\n    p50: rank(0.5),\n    p90: rank(0.9),\n    max: sorted[sorted.length - 1] as number,\n    sum: sorted.reduce((a, b) => a + b, 0),\n  }\n}\n\n// ── Correlation (Pearson / Spearman) ─────────────────────────────────\n//\n// The single source for linear (Pearson) and rank (Spearman) correlation.\n// Edge-case contract is explicit so every caller agrees on what a\n// degenerate input means:\n//   - length mismatch or n < 2  → NaN   (correlation is undefined; not 0)\n//   - both series constant      → 1     (degenerate perfect agreement)\n//   - exactly one series constant → 0   (no covariation to detect)\n// Returning NaN for n < 2 (rather than 0) keeps \"not enough data\" distinct\n// from \"measured zero correlation\", which a 0 would silently conflate.\n\n/**\n * Average-rank-with-ties transform (1-indexed). Tied values receive the mean\n * of the ranks they span, the standard correction for Spearman's ρ.\n */\nexport function ranks(xs: number[]): number[] {\n  const indexed = xs.map((v, i) => ({ v, i })).sort((a, b) => a.v - b.v)\n  const r = new Array<number>(xs.length)\n  let i = 0\n  while (i < indexed.length) {\n    let j = i\n    while (j + 1 < indexed.length && indexed[j + 1]!.v === indexed[i]!.v) j++\n    const avg = (i + j) / 2 + 1\n    for (let k = i; k <= j; k++) r[indexed[k]!.i] = avg\n    i = j + 1\n  }\n  return r\n}\n\n/**\n * Pearson product-moment correlation coefficient r ∈ [-1, 1] between two\n * equal-length series. See the edge-case contract above: NaN for n < 2 or\n * unequal lengths, 1 when both series are constant, 0 when exactly one is.\n */\nexport function pearsonR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return Number.NaN\n  const n = a.length\n  const meanA = a.reduce((s, v) => s + v, 0) / n\n  const meanB = b.reduce((s, v) => s + v, 0) / n\n  let num = 0\n  let varA = 0\n  let varB = 0\n  for (let i = 0; i < n; i++) {\n    const da = a[i]! - meanA\n    const db = b[i]! - meanB\n    num += da * db\n    varA += da * da\n    varB += db * db\n  }\n  if (varA === 0 || varB === 0) return varA === 0 && varB === 0 ? 1 : 0\n  return num / Math.sqrt(varA * varB)\n}\n\n/**\n * Spearman's rank correlation ρ — Pearson over the average-rank-with-ties\n * transform of each series. Same edge-case contract as {@link pearsonR}.\n */\nexport function spearmanR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return Number.NaN\n  return pearsonR(ranks(a), ranks(b))\n}\n\nexport interface WeightedCompositeInput {\n  /** Per-dimension scores (typically 0..1). */\n  dims: Record<string, number>\n  /** Weight per dimension. Every weighted dimension MUST be present in\n   *  `dims` — a weight for an absent dimension is a config error and throws,\n   *  because silently dropping it would renormalise the composite onto a\n   *  different denominator than intended. */\n  weights: Record<string, number>\n  /** Optional pass threshold; when set, the result reports `pass`. */\n  threshold?: number\n}\n\nexport interface WeightedCompositeResult {\n  composite: number\n  pass?: boolean\n}\n\n/**\n * Weighted composite over judge dimensions: `Σ(score_d · w_d) / Σ(w_d)` across\n * the weighted dimensions. The canonical replacement for the per-consumer\n * hand-rolled composite math (tax/legal/creative/gtm each ship a copy).\n *\n * Fail-loud: throws if a weighted dimension is missing from `dims`, if any\n * weight is negative, or if the weights sum to 0 — none of which can produce\n * a meaningful composite.\n */\nexport function weightedComposite(input: WeightedCompositeInput): WeightedCompositeResult {\n  const entries = Object.entries(input.weights)\n  if (entries.length === 0) {\n    throw new Error('weightedComposite: `weights` is empty — nothing to combine')\n  }\n  let weightedSum = 0\n  let weightTotal = 0\n  for (const [dim, weight] of entries) {\n    if (weight < 0) {\n      throw new Error(`weightedComposite: weight for '${dim}' is negative (${weight})`)\n    }\n    if (!(dim in input.dims)) {\n      throw new Error(\n        `weightedComposite: weighted dimension '${dim}' is absent from \\`dims\\` — ` +\n          'refusing to renormalise onto a different denominator',\n      )\n    }\n    weightedSum += input.dims[dim]! * weight\n    weightTotal += weight\n  }\n  if (weightTotal === 0) {\n    throw new Error('weightedComposite: weights sum to 0 — composite is undefined')\n  }\n  const composite = weightedSum / weightTotal\n  return input.threshold === undefined\n    ? { composite }\n    : { composite, pass: composite >= input.threshold }\n}\n"],"mappings":";;;;;;;AAQA,SAAgB,aAAa,QAAsD;CACjF,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,KAAK,MAAM,EAAE,OAAO,YAAY,QAAQ;EACtC,MAAM,IAAI,UAAU;EACpB,eAAe,QAAQ;EACvB,eAAe;CACjB;CACA,OAAO,cAAc,IAAI,cAAc,cAAc;AACvD;;;;;;;;;AAUA,SAAgB,mBACd,QACA,aAAa,KACb,OAA8C,CAAC,GACC;CAChD,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,MAAM;EAAG,OAAO;EAAG,OAAO;CAAE;CAC9D,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,MAAM,OAAO;EAAK,OAAO,OAAO;EAAK,OAAO,OAAO;CAAI;CAEzF,MAAM,IAAI,OAAO;CACjB,MAAM,OAAO,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAEjD,MAAM,IAAI,KAAK,aAAa;CAC5B,MAAM,MAAM,QAAQ,KAAK,MAAM,MAAM;CACrC,MAAM,iBAA2B,CAAC;CAElC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,OAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC;EAEpC,eAAe,KAAK,MAAM,CAAC;CAC7B;CAEA,eAAe,MAAM,GAAG,MAAM,IAAI,CAAC;CAEnC,MAAM,QAAQ,IAAI;CAClB,MAAM,WAAW,KAAK,MAAO,QAAQ,IAAK,CAAC;CAC3C,MAAM,WAAW,KAAK,OAAO,IAAI,QAAQ,KAAK,CAAC,IAAI;CAEnD,OAAO;EACL;EACA,OAAO,eAAe;EACtB,OAAO,eAAe,KAAK,IAAI,UAAU,IAAI,CAAC;CAChD;AACF;;AAGA,SAAgB,cAAc,SAAiB,QAAwB;CACrE,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,MAAM,CAAC;AAClD;;;;;;;;AAmBA,SAAgB,sBAAsB,QAAsD;CAC1F,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC/C,MAAM,QAAQ,MACZ,OAAO,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,OAAO,MAAM,IAAI,CAAC,CAAC;CAClF,OAAO;EACL,GAAG,OAAO;EACV,KAAK,OAAO;EACZ,KAAK,KAAK,EAAG;EACb,KAAK,KAAK,EAAG;EACb,KAAK,OAAO,OAAO,SAAS;EAC5B,KAAK,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC;CACvC;AACF;;;;;AAiBA,SAAgB,MAAM,IAAwB;CAC5C,MAAM,UAAU,GAAG,KAAK,GAAG,OAAO;EAAE;EAAG;CAAE,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;CACrE,MAAM,IAAI,IAAI,MAAc,GAAG,MAAM;CACrC,IAAI,IAAI;CACR,OAAO,IAAI,QAAQ,QAAQ;EACzB,IAAI,IAAI;EACR,OAAO,IAAI,IAAI,QAAQ,UAAU,QAAQ,IAAI,EAAE,CAAE,MAAM,QAAQ,EAAE,CAAE,GAAG;EACtE,MAAM,OAAO,IAAI,KAAK,IAAI;EAC1B,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK,EAAE,QAAQ,EAAE,CAAE,KAAK;EAChD,IAAI,IAAI;CACV;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,SAAS,GAAa,GAAqB;CACzD,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,GAAG,OAAO;CAClD,MAAM,IAAI,EAAE;CACZ,MAAM,QAAQ,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAC7C,MAAM,QAAQ,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAC7C,IAAI,MAAM;CACV,IAAI,OAAO;CACX,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,KAAK,EAAE,KAAM;EACnB,OAAO,KAAK;EACZ,QAAQ,KAAK;EACb,QAAQ,KAAK;CACf;CACA,IAAI,SAAS,KAAK,SAAS,GAAG,OAAO,SAAS,KAAK,SAAS,IAAI,IAAI;CACpE,OAAO,MAAM,KAAK,KAAK,OAAO,IAAI;AACpC;;;;;AAMA,SAAgB,UAAU,GAAa,GAAqB;CAC1D,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,GAAG,OAAO;CAClD,OAAO,SAAS,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACpC;;;;;;;;;;AA4BA,SAAgB,kBAAkB,OAAwD;CACxF,MAAM,UAAU,OAAO,QAAQ,MAAM,OAAO;CAC5C,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,MAAM,4DAA4D;CAE9E,IAAI,cAAc;CAClB,IAAI,cAAc;CAClB,KAAK,MAAM,CAAC,KAAK,WAAW,SAAS;EACnC,IAAI,SAAS,GACX,MAAM,IAAI,MAAM,kCAAkC,IAAI,iBAAiB,OAAO,EAAE;EAElF,IAAI,EAAE,OAAO,MAAM,OACjB,MAAM,IAAI,MACR,0CAA0C,IAAI,iFAEhD;EAEF,eAAe,MAAM,KAAK,OAAQ;EAClC,eAAe;CACjB;CACA,IAAI,gBAAgB,GAClB,MAAM,IAAI,MAAM,8DAA8D;CAEhF,MAAM,YAAY,cAAc;CAChC,OAAO,MAAM,cAAc,KAAA,IACvB,EAAE,UAAU,IACZ;EAAE;EAAW,MAAM,aAAa,MAAM;CAAU;AACtD"}

package/dist/emitter-DABYYTcH.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"emitter-DABYYTcH.d.ts","names":[],"sources":["../src/trace/emitter.ts"],"mappings":";;;UAuCiB,WAAW,UAAU,OAAO;EAC3C,MAAM;EACN,IAAI,QAAQ,QAAQ,KAAK;EACzB,KAAK,gBAAgB,OAAO,QAAQ,QAAQ,KAAK;;UAGlC;EACf;EACA,SAAS;EACT,OAAO;;EAEP,UAAU;;EAEV;;KAGU,mBAAmB,KAAK,2BAA2B;;KAGnD;KASA,uBAAuB,gBAAgB,OAAO;UAQzC;EACf;;EAEA;;EAEA;;;;;;;;;;EAUA,gBAAgB;;EAEhB;;;;;;;EAOA,iBAAiB;;cAGN;UACH;mBACS;mBACA;UACT;UACA;UACA;UACA;UACA;UACA;UACA;EAER,YAAY,OAAO,YAAY,UAAS;MAUpC;MAIA,cAAc;;EAKlB,gBAAgB;;EAKhB;UAKQ;UAIM;;EAkBd,mBAAmB,MAAM;;;;;;;;;;;EAgBnB,SACJ,KAAK,KAAK;IAA0D;MACnE,QAAQ;;;;;EAiBL,OAAO,UAAU,kBAAkB;EASnC,SAAS,iBAAiB;UAoBlB;EAwBR,KAAK,UAAU,OAAO,MAC1B;IACE,MAAM;IACN;IACA;IACA,aAAa;MACX,QAAQ,KAAK,0DAChB,QAAQ,WAAW;;;;;;UASR;UAkBN;EAqCR,IACE,MAAM,KAAK,sDACV,QAAQ,WAAW;EAItB,KACE,MAAM,KAAK,uDACV,QAAQ,WAAW;EAItB,UACE,MAAM,KAAK,4DACV,QAAQ,WAAW;EAIhB,YACJ,SAAS,KAAK,oEACb,QAAQ;EAgBX,QACE,MAAM,KAAK,0DACV,QAAQ,WAAW;EAMhB,KAAK;IACT,MAAM;IACN;IACA,UAAU;MACR,QAAQ;EAeN,aACJ,OAAO,KAAK;IAA8C;MACzD,QAAQ;EAwBL,eAAe,UAAU,KAAK,oCAAoC,QAAQ;;;;;;;;EAe1E,OAAO,GACX,MAAM,WAAW,0BACjB,KAAK,QAAQ,eAAe,QAAQ,KACnC,QAAQ"}

package/dist/engine-dtRVeuQs.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"engine-dtRVeuQs.d.ts","names":[],"sources":["../src/eval-tools.ts","../src/trace-analyst/tools.ts","../src/analyst/finding-signature.ts","../src/analyst/engine.ts"],"mappings":";;;;;;;;;;;;;;;;;;;UAsBiB;EACf;EACA;EACA,YAAY;EACZ,UAAU,eAAe;IAAQ,SAAS;QAAkB;;;;cCZjD;;;;;;cAOA;UAGI,uCAAuC;EACtD,OAAO;;UAGQ,oCAAoC;EACnD,kBAAkB;;EAElB;;EAEA;;;iBAMc,kCACd,SAAS,iCACR;;;cC7BG,0BAAwB,EAAA;;;GAKnB,EAAA,KAAA;KAEC,qBAAqB,EAAE,aAAa;cAiBnC,yBAAuB,EAAA;;;;;;;;;;;;;;;;;GAKzB,EAAA,KAAA;KAEC,oBAAoB,EAAE,aAAa;;;;;;cAOlC;;iBAYG,2BAA2B,SAAS,oBAAoB;iBAQxD,gBACd,cACA,OAAO,aAAa,SAAS,mCAC5B;;;;UCpEc;;EAEf;;EAEA;;EAEA;;EAEA;;UA0Be;EACf;EACA;EACA;EACA,gBAAgB;;;;;;;;;;;EAWhB,aAAa,SAAS;EACtB,QAAQ;EACR,YAAY;EACZ;EACA,WAAW;EACX,SAAS;EACT,OAAO,iBAAiB,SAAS;;;UAIlB;EACf;EACA,UAAU;;EAEV;;;;;EAKA;;EAEA;EACA,SAAS;;;;;;;;;UAUM;WACN;WACA;WACA;;WAEA;;;;;;;;WAQA,iBAAiB,SAAS;EACnC,QAAQ,SAAS,6BAA6B,QAAQ"}

package/dist/errors-DEE6u6ot.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"errors-DEE6u6ot.d.ts","names":[],"sources":["../src/errors.ts"],"mappings":";;;;;;;;;;;;;;;KAeY;;;;;cAiBC,uBAAuB;;WAEzB,MAAM;EAEf,YAAY,MAAM,oBAAoB,iBAAiB;IAAY;;;;cAQxD,wBAAwB;EACnC,YAAY,iBAAiB;IAAY;;;;cAM9B,2BAA2B;EACtC,YAAY,iBAAiB;IAAY;;;;cAM9B,sBAAsB;EACjC,YAAY,iBAAiB;IAAY;;;;cAM9B,oBAAoB;EAC/B,YAAY,iBAAiB;IAAY;;;;;;;;cAU9B,8BAA8B;EACzC,YAAY,iBAAiB;IAAY;;;;cAM9B,mBAAmB;EAC9B,YAAY,iBAAiB;IAAY"}

package/dist/evaluation-DblGquCB.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"evaluation-DblGquCB.d.ts","names":[],"sources":["../src/evaluation.ts"],"mappings":";;;;UAYiB,iBAAiB;EAChC,OAAO;EACP,SAAS;EACT;;UAGe;;;EAGf;EACA,SAAS;EACT,aAAa;EACb;EACA,UAAU;EACV;EACA,WAAW;EACX,gBAAgB;;EAEhB,aAAa,SAAS,uBAAuB;;KAGnC,gBAAgB,GAAG,MAC7B,OAAO,GACP,UAAU,sBACP,QAAQ,iBAAiB;UAEb,iBAAiB,GAAG;EACnC,UAAU,OAAO,GAAG;IAAW,QAAQ;IAAa;QAA6B,QAAQ;EACzF,UAAU,OAAO,MAAM;EACvB,oBAAoB,OAAO,UAAU;EACrC,mBAAmB,OAAO;EAC1B,aAAa;EACb,gBAAgB;;EAEhB,YAAY,OAAO,GAAG,OAAO,aAAa;;;iBAI5B,gBAAgB,GAAG,GAAG,SAAS,iBAAiB,GAAG,KAAK,gBAAgB,GAAG;UA6B1E,uBAAuB,GAAG,UAAU,UAAU;EAC7D;EACA;EACA,YAAY,YAAY,GAAG;EAC3B,UAAU;IAAkB,UAAU;IAAG,UAAU;KAAK;EACxD,MAAM,OAAO,GAAG;IAAS,UAAU;IAAG,UAAU;QAAQ,aAAa,QAAQ;;EAE7E,UACE,QAAQ,iBAAiB,IACzB;IAAS,UAAU;IAAG,UAAU;eACtB;EACZ,aAAa,UAAU;;;iBAIT,QAAQ,GAAG,UAAU,UAAU,GAC7C,SAAS,uBAAuB,GAAG,GAAG,KACrC,YAAY,GAAG;UA4BD,yBAAyB,GAAG;EAC3C;EACA;EACA;EACA,WAAW,QAAQ;EACnB,MAAM,QAAQ;EACd,WACE,OAAO,GACP,SAAS,mBACT,gBAAgB,mBACb,QAAQ,iBAAiB;EAC9B,MAAM,OAAO,GAAG,OAAO,GAAG,SAAS,mBAAmB,mBAAmB,QAAQ;EACjF,UAAU,QAAQ,iBAAiB,IAAI,OAAO,GAAG,SAAS,0BAA0B;;;iBAItE,UAAU,GAAG,GAAG,SAAS,yBAAyB,GAAG,KAAK,QAAQ"}

package/dist/exact-types-Do63KoKn.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"exact-types-Do63KoKn.d.ts","names":[],"sources":["../src/analyst/exact-types.ts"],"mappings":";;;;UAMiB,oBAAoB,0BAA0B,QAAQ;;WAE5D,iBAAiB,SAAS;;KAGhC,aAAa,KAAK,0BAA0B,mBACpC,aAAa,UACtB,+BACc,aAAa,IAAI,aAAa,EAAE,WAC5C;KAEM,uBAAuB,aAAa,EAAE,aAAa;KACnD,6BAA6B,aAAa,EAAE,aAAa;;UAGpD;EACf;EACA;EACA,QAAQ,SAAS;;;UAIF;EACf;EACA;EACA;;KAyBU,gCAAgC,aAAa,EAAE,aAAa;KAC5D,oCAAoC,aAC9C,EAAE,aAAa;KAGL,yBAAyB;;EAEnC;;KAGU;EACN;;EAEA;EACA;IAAS;IAAe;;;UAGb,8BAA8B;EAC7C,aAAa;EACb,gBAAgB;EAChB,YAAY;;;KAIF,wBACP,QAAQ;EAAmB;;EAC1B,gBAAgB;MAEjB,KAAK,QAAQ;EAAmB;;EAC/B,SAAS;KAEX,QAAQ;EAAmB;MAC1B,KAAK,QAAQ;EAAmB;;EAC/B,SAAS;MAEV,KAAK,QAAQ;EAAmB;;EAC/B,QAAQ;;cAwCR,uBAAqB,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAOzB,EAAA,KAAA;cAII,sBAAoB,EAAA,uBAAA,EAAA;;;;;;;;;;;GAaxB,EAAA,KAAA;cAiBI,sBAAoB,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAYxB,EAAA,KAAA;cAEI,0BAAwB,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+E1B,EAAA,KAAA"}

package/dist/exporters-DWvM16LE.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"exporters-DWvM16LE.js","names":[],"sources":["../src/rollout/exporters.ts"],"sourcesContent":["/**\n * Pure exporters over `tangle.rollout.v1` lines → the training-data shapes\n * the improvement loops feed:\n *   - SFT chat JSONL           (clean trainable successes, {messages, metadata})\n *   - reward rows              (every scored line, success or failure, with steps)\n *   - Prime Intellect verifiers RolloutOutput (prompt/completion split + reward)\n *   - OpenAI RFT items         (prompt turns + verdict reference fields)\n *\n * All exporters are pure functions of the lines — filtering (never train on\n * holdout, reward thresholds, the realness gate) happens HERE, on inline\n * labels, no joins.\n *\n * Every exporter takes `MintedRolloutLine[]`, not `RolloutLine[]`: the reward\n * on a minted line has been checked against the anti-Goodhart invariant, and\n * the brand is what stops a hand-built object literal claiming a positive\n * reward on a gamed run from being handed to an exporter that copies it\n * verbatim into training data.\n */\n\nimport type {\n  ChatMessage,\n  MintedRolloutLine,\n  RolloutLine,\n  RolloutSplit,\n  RolloutStep,\n  ToolDef,\n} from './schema'\nimport { assertRewardGate } from './schema'\n\n// ---------------------------------------------------------------------------\n// The realness claims every emitted row carries.\n// ---------------------------------------------------------------------------\n\n/**\n * The gate's two claims, which travel TOGETHER on every emitted row.\n *\n * `realness_gated` alone is ambiguous, and the ambiguity is exploitable:\n * `false` reads as \"we screened it and nothing fired\", so a producer that has no\n * screen at all emitted rows indistinguishable from screened-clean ones, and\n * every consumer of the published dataset read them as clean. The second field\n * is what separates the two claims, and it only removes the ambiguity if it\n * reaches the WIRE — for a round it existed on `RolloutOutcome` and on no\n * exported row shape at all, which left the published rows exactly as ambiguous\n * as before.\n *\n * So there is one helper and every row shape spreads it. A row that states one\n * claim without the other is not constructible by copying the pattern, and\n * `exporters.test.ts` walks every emitted shape to prove none does.\n */\nexport interface RealnessLabels {\n  /** The screen's VERDICT: the run faked its success signal. */\n  realness_gated: boolean\n  /**\n   * Whether a screen RAN at all. `true` = it ran, so `realness_gated` is its\n   * verdict. `false` = the producer declares it has none. `null` = not stated\n   * (pre-unification producers), which is \"unknown\" and never \"clean\".\n   */\n  realness_screened: boolean | null\n}\n\nfunction realnessLabels(line: MintedRolloutLine): RealnessLabels {\n  return {\n    realness_gated: line.outcome.realness_gated === true,\n    // `?? null` rather than `?? false`: absent means the producer never stated\n    // it, and `false` is a load-bearing claim (\"no screen exists\") that would be\n    // an invention here.\n    realness_screened: line.outcome.realness_screened ?? null,\n  }\n}\n\n// ---------------------------------------------------------------------------\n// (a) SFT chat JSONL\n// ---------------------------------------------------------------------------\n\nexport interface TrainingExportOptions {\n  /** Include held-out evaluation data in training output. Default false. */\n  allowHeldOutTrainingData?: boolean\n  /** Require reward to be strictly greater than this value. Default 0. */\n  minimumQualityExclusive?: number\n  /**\n   * Explicit split selection, replacing the default trainable-split rule.\n   * Use this only when producing a deliberately named non-training slice\n   * (e.g. `['holdout']` for a holdout-only evaluation bundle).\n   */\n  splitFilter?: RolloutSplit[]\n}\n\n/**\n * What a signed-signal exporter (verifiers, RFT) does with lines that are not\n * clean trainable successes — realness-gated lines above all.\n *\n *   - 'exclude'       — the default, the same fail-closed policy as every\n *                       other training export: positive, completed,\n *                       non-gated rows on a trainable split.\n *   - 'zero-and-flag' — keep them, at their non-positive (or null) reward,\n *                       with `RealnessLabels` on the row. The dataset release\n *                       sets this per `FORMAT_GATE_DISPOSITION`: in these\n *                       formats the reward is a signed learning signal, so a\n *                       gamed trajectory at reward 0 is a correct negative,\n *                       and dropping it would bias the negative population\n *                       toward honest failures and leave a trainer no example\n *                       of gaming being penalized. The split policy is NOT\n *                       relaxed: held-out lines still need the named opt-in.\n *\n * SFT deliberately has no such option — an SFT row is an imitation target and\n * a gamed trajectory must never appear in one at any weight.\n */\ntype GatedLineDisposition = 'exclude' | 'zero-and-flag'\n\ninterface SignedSignalExportOptions extends TrainingExportOptions {\n  /** Disposition for non-trainable lines. Default 'exclude'. */\n  gatedLines?: GatedLineDisposition\n}\n\nexport type SftExportOptions = TrainingExportOptions\n\nexport interface SftRow {\n  messages: ChatMessage[]\n  metadata: {\n    rollout_id: string\n    run_id: string\n    candidate_id: string | null\n    instance_id: string\n    reward: number\n  } & RealnessLabels\n}\n\n/**\n * Supervised fine-tune rows: the completed conversation of each qualifying\n * line. Fail-closed filters: trainable split only (never holdout/canary unless\n * an explicit `splitFilter` names a non-training slice),\n * reward strictly above `minimumQualityExclusive` (default 0), realness-gated\n * lines never qualify, gap lines carry no trainable content, and\n * copied-context turns are dropped from the transcript (Harbor ATIF RFC 0001\n * rule 7 — see `ChatMessage.is_copied_context`).\n *\n * `realness_gated` is therefore always `false` on an emitted row. It is carried\n * anyway: an SFT row is a pure imitation target, so the row states its realness\n * claims instead of making the reader know the format's policy, and carrying\n * both flags on all four shapes is what lets the release accounting measure\n * every config with one rule rather than skipping the one whose row shape\n * happened to omit the field.\n */\nexport function toSftRows(lines: MintedRolloutLine[], options: SftExportOptions = {}): SftRow[] {\n  for (const line of lines) assertRewardGate(line, 'SFT export')\n  return lines\n    .filter((line) => isTrainingLineEligible(line, options) && line.messages.length > 0)\n    .map((line) => ({\n      // Dropped, not kept-and-masked: a copied-context turn was authored by\n      // another agent, and an SFT trainer has no notion of \"present but not a\n      // target\" — every message it is handed is something to imitate.\n      messages: line.messages.filter((message) => message.is_copied_context !== true),\n      metadata: {\n        rollout_id: line.rollout_id,\n        run_id: line.run_id,\n        candidate_id: line.candidate_id ?? null,\n        instance_id: line.task.instance_id,\n        reward: line.outcome.reward as number,\n        ...realnessLabels(line),\n      },\n    }))\n    .filter((row) => row.messages.length > 0)\n}\n\n// ---------------------------------------------------------------------------\n// (b) Reward rows\n// ---------------------------------------------------------------------------\n\nexport interface RewardRow {\n  /** First user turn — the task prompt. */\n  prompt: string\n  steps: RolloutStep[]\n  reward: number\n  metadata: {\n    rollout_id: string\n    run_id: string\n    candidate_id: string | null\n    instance_id: string\n    split: RolloutSplit\n    /**\n     * The anti-Goodhart verdict AND whether a screen produced it, carried on the\n     * row rather than left implicit in a reward of 0. Zeroing alone is lossy: it\n     * makes a run that FAKED its success indistinguishable from one that\n     * honestly failed, so a consumer can neither drop the gamed population nor\n     * mine it (a labeled gamed trajectory is the training signal for a gaming\n     * detector). `realness_gated` alone is lossy the same way in the other\n     * direction — see `RealnessLabels`.\n     */\n  } & RealnessLabels\n}\n\n/**\n * Reward-labeled rows for completed, positive-quality training runs.\n */\nexport function toRewardRows(\n  lines: MintedRolloutLine[],\n  options: TrainingExportOptions = {},\n): RewardRow[] {\n  for (const line of lines) assertRewardGate(line, 'reward-row export')\n  return lines\n    .filter(\n      (line) =>\n        isTrainingLineEligible(line, options) &&\n        line.messages.some(\n          (message) =>\n            message.role === 'user' &&\n            typeof message.content === 'string' &&\n            message.content.length > 0,\n        ),\n    )\n    .map((line) => ({\n      prompt: line.messages.find((m) => m.role === 'user')?.content ?? '',\n      steps: line.steps ?? [],\n      reward: line.outcome.reward as number,\n      metadata: {\n        rollout_id: line.rollout_id,\n        run_id: line.run_id,\n        candidate_id: line.candidate_id ?? null,\n        instance_id: line.task.instance_id,\n        split: line.task.split,\n        ...realnessLabels(line),\n      },\n    }))\n}\n\n// ---------------------------------------------------------------------------\n// (c) Prime Intellect verifiers RolloutOutput\n// ---------------------------------------------------------------------------\n\nexport interface VerifiersTokenUsage {\n  input_tokens: number | null\n  output_tokens: number | null\n  reasoning_tokens: number | null\n  cache_read_tokens: number | null\n  cache_write_tokens: number | null\n}\n\nexport interface VerifiersRolloutOutput {\n  /** Messages through the last turn BEFORE the first assistant turn. */\n  prompt: ChatMessage[]\n  /** The first assistant turn onward — what the policy produced. */\n  completion: ChatMessage[]\n  reward: number | null\n  metrics: Record<string, unknown>\n  tool_defs: ToolDef[]\n  token_usage: VerifiersTokenUsage\n  info: {\n    task: RolloutLine['task']\n    policy: RolloutLine['policy']\n    rollout_id: string\n    run_id: string\n    experiment_id: string | null\n    candidate_id: string | null\n    generation: number | null\n    candidate_index: number | null\n    role: RolloutLine['role']\n  } & RealnessLabels\n}\n\n/** Index of the first assistant turn; messages.length when none exists. */\nfunction firstAssistantIndex(messages: ChatMessage[]): number {\n  const index = messages.findIndex((m) => m.role === 'assistant')\n  return index === -1 ? messages.length : index\n}\n\nfunction assertCompleteProjection(line: MintedRolloutLine, context: string): void {\n  if (line.provenance.lossy_projection === true) {\n    throw new Error(`${context}: rollout ${line.rollout_id} has a lossy projection`)\n  }\n}\n\nexport function toVerifiersRolloutOutput(line: MintedRolloutLine): VerifiersRolloutOutput {\n  assertRewardGate(line, 'verifiers export')\n  assertCompleteProjection(line, 'verifiers export')\n  const split = firstAssistantIndex(line.messages)\n  return {\n    prompt: line.messages.slice(0, split),\n    completion: line.messages.slice(split),\n    reward: line.outcome.reward,\n    metrics: line.outcome.metrics,\n    tool_defs: line.tool_defs,\n    token_usage: {\n      input_tokens: line.cost.tokens_in,\n      output_tokens: line.cost.tokens_out,\n      reasoning_tokens: line.cost.tokens_reasoning,\n      cache_read_tokens: line.cost.cache_read,\n      cache_write_tokens: line.cost.cache_write,\n    },\n    info: {\n      task: line.task,\n      policy: line.policy,\n      rollout_id: line.rollout_id,\n      run_id: line.run_id,\n      experiment_id: line.experiment_id ?? null,\n      candidate_id: line.candidate_id ?? null,\n      generation: line.generation,\n      candidate_index: line.candidate_index,\n      role: line.role,\n      ...realnessLabels(line),\n    },\n  }\n}\n\nexport function toVerifiersRolloutOutputs(\n  lines: MintedRolloutLine[],\n  options: SignedSignalExportOptions = {},\n): VerifiersRolloutOutput[] {\n  if (options.gatedLines === 'zero-and-flag') {\n    return lines\n      .filter(\n        (line) =>\n          isSplitEligible(line, options) &&\n          line.provenance.lossy_projection !== true &&\n          line.messages.length > 0,\n      )\n      .map(toVerifiersRolloutOutput)\n  }\n  return lines\n    .filter(\n      (line) =>\n        isTrainingLineEligible(line, options) &&\n        firstAssistantIndex(line.messages) > 0 &&\n        firstAssistantIndex(line.messages) < line.messages.length,\n    )\n    .map(toVerifiersRolloutOutput)\n}\n\n// ---------------------------------------------------------------------------\n// (d) OpenAI RFT items\n// ---------------------------------------------------------------------------\n\nexport interface RftItem {\n  /** Prompt turns only — the graded completion is re-sampled during RFT. */\n  messages: ChatMessage[]\n  /** Verdict/label fields the grader references as item.reference.* */\n  reference: {\n    reward: number | null\n    reward_source: string | null\n    verdict: unknown\n    instance_id: string\n    suite: string\n    split: RolloutSplit\n    rollout_id: string\n  } & RealnessLabels\n}\n\nexport function toRftItem(line: MintedRolloutLine): RftItem {\n  assertRewardGate(line, 'RFT export')\n  assertCompleteProjection(line, 'RFT export')\n  const split = firstAssistantIndex(line.messages)\n  return {\n    messages: line.messages.slice(0, split),\n    reference: {\n      reward: line.outcome.reward,\n      reward_source: line.outcome.reward_source,\n      verdict: line.outcome.verdict,\n      instance_id: line.task.instance_id,\n      suite: line.task.suite,\n      split: line.task.split,\n      rollout_id: line.rollout_id,\n      ...realnessLabels(line),\n    },\n  }\n}\n\n/** RFT needs a real prompt: lines whose transcript starts with prompt turns. */\nexport function toRftItems(\n  lines: MintedRolloutLine[],\n  options: SignedSignalExportOptions = {},\n): RftItem[] {\n  return lines\n    .filter(\n      (line) =>\n        (options.gatedLines === 'zero-and-flag'\n          ? isSplitEligible(line, options) && line.provenance.lossy_projection !== true\n          : isTrainingLineEligible(line, options)) &&\n        line.messages.length > 0 &&\n        firstAssistantIndex(line.messages) > 0,\n    )\n    .map(toRftItem)\n}\n\n// ---------------------------------------------------------------------------\n// Serialization — one JSON object per line, the interchange format for\n// every export. `tangle.rollout.v1` lines and export rows alike.\n// ---------------------------------------------------------------------------\n\nexport function toJsonl(rows: ReadonlyArray<unknown>): string {\n  return rows.map((r) => JSON.stringify(r)).join('\\n') + (rows.length ? '\\n' : '')\n}\n\n/**\n * The split half of the training policy alone: `search` is trainable, held-out\n * needs the named opt-in, `dev` and `canary` never ship. This is the ONE check\n * `'zero-and-flag'` does not relax — a gated line is shipped as a labeled\n * negative, not as a licence to train on evaluation data. An explicit\n * `splitFilter` names a non-training slice instead of the default rule.\n *\n * Exported as the single implementation of that rule: `rl/exporters` applies\n * it on its line paths too, so the two waists cannot drift on which splits are\n * trainable.\n */\nexport function isSplitEligible(\n  line: RolloutLine,\n  options: Pick<TrainingExportOptions, 'allowHeldOutTrainingData' | 'splitFilter'>,\n): boolean {\n  if (options.splitFilter !== undefined) return options.splitFilter.includes(line.task.split)\n  if (line.task.split === 'search') return true\n  return line.task.split === 'holdout' && options.allowHeldOutTrainingData === true\n}\n\n/**\n * The whole fail-closed training policy for one line: scored, positive above\n * the floor, completed, not gated, on an eligible split. Shared with\n * `rl/exporters` so its text-lookup adapter cannot drift from this rule.\n */\nexport function isTrainingLineEligible(\n  line: RolloutLine,\n  options: TrainingExportOptions,\n): line is RolloutLine & { outcome: RolloutLine['outcome'] & { reward: number } } {\n  const minimumQualityExclusive = options.minimumQualityExclusive ?? 0\n  if (!Number.isFinite(minimumQualityExclusive)) {\n    throw new Error('minimumQualityExclusive must be finite')\n  }\n\n  const reward = line.outcome.reward\n  if (reward === null) return false\n  if (!Number.isFinite(reward)) {\n    throw new Error(`training reward for rollout \"${line.rollout_id}\" must be finite`)\n  }\n  if (reward <= minimumQualityExclusive) return false\n  if (!line.outcome.is_completed || line.outcome.is_truncated || line.outcome.error !== null) {\n    return false\n  }\n  if (line.outcome.realness_gated === true) return false\n  if (line.provenance.lossy_projection === true) return false\n  return isSplitEligible(line, options)\n}\n"],"mappings":";;AA4DA,SAAS,eAAe,MAAyC;CAC/D,OAAO;EACL,gBAAgB,KAAK,QAAQ,mBAAmB;EAIhD,mBAAmB,KAAK,QAAQ,qBAAqB;CACvD;AACF;;;;;;;;;;;;;;;;;AA2EA,SAAgB,UAAU,OAA4B,UAA4B,CAAC,GAAa;CAC9F,KAAK,MAAM,QAAQ,OAAO,iBAAiB,MAAM,YAAY;CAC7D,OAAO,MACJ,QAAQ,SAAS,uBAAuB,MAAM,OAAO,KAAK,KAAK,SAAS,SAAS,CAAC,CAAC,CACnF,KAAK,UAAU;EAId,UAAU,KAAK,SAAS,QAAQ,YAAY,QAAQ,sBAAsB,IAAI;EAC9E,UAAU;GACR,YAAY,KAAK;GACjB,QAAQ,KAAK;GACb,cAAc,KAAK,gBAAgB;GACnC,aAAa,KAAK,KAAK;GACvB,QAAQ,KAAK,QAAQ;GACrB,GAAG,eAAe,IAAI;EACxB;CACF,EAAE,CAAC,CACF,QAAQ,QAAQ,IAAI,SAAS,SAAS,CAAC;AAC5C;;;;AAgCA,SAAgB,aACd,OACA,UAAiC,CAAC,GACrB;CACb,KAAK,MAAM,QAAQ,OAAO,iBAAiB,MAAM,mBAAmB;CACpE,OAAO,MACJ,QACE,SACC,uBAAuB,MAAM,OAAO,KACpC,KAAK,SAAS,MACX,YACC,QAAQ,SAAS,UACjB,OAAO,QAAQ,YAAY,YAC3B,QAAQ,QAAQ,SAAS,CAC7B,CACJ,CAAC,CACA,KAAK,UAAU;EACd,QAAQ,KAAK,SAAS,MAAM,MAAM,EAAE,SAAS,MAAM,CAAC,EAAE,WAAW;EACjE,OAAO,KAAK,SAAS,CAAC;EACtB,QAAQ,KAAK,QAAQ;EACrB,UAAU;GACR,YAAY,KAAK;GACjB,QAAQ,KAAK;GACb,cAAc,KAAK,gBAAgB;GACnC,aAAa,KAAK,KAAK;GACvB,OAAO,KAAK,KAAK;GACjB,GAAG,eAAe,IAAI;EACxB;CACF,EAAE;AACN;;AAqCA,SAAS,oBAAoB,UAAiC;CAC5D,MAAM,QAAQ,SAAS,WAAW,MAAM,EAAE,SAAS,WAAW;CAC9D,OAAO,UAAU,KAAK,SAAS,SAAS;AAC1C;AAEA,SAAS,yBAAyB,MAAyB,SAAuB;CAChF,IAAI,KAAK,WAAW,qBAAqB,MACvC,MAAM,IAAI,MAAM,GAAG,QAAQ,YAAY,KAAK,WAAW,wBAAwB;AAEnF;AAEA,SAAgB,yBAAyB,MAAiD;CACxF,iBAAiB,MAAM,kBAAkB;CACzC,yBAAyB,MAAM,kBAAkB;CACjD,MAAM,QAAQ,oBAAoB,KAAK,QAAQ;CAC/C,OAAO;EACL,QAAQ,KAAK,SAAS,MAAM,GAAG,KAAK;EACpC,YAAY,KAAK,SAAS,MAAM,KAAK;EACrC,QAAQ,KAAK,QAAQ;EACrB,SAAS,KAAK,QAAQ;EACtB,WAAW,KAAK;EAChB,aAAa;GACX,cAAc,KAAK,KAAK;GACxB,eAAe,KAAK,KAAK;GACzB,kBAAkB,KAAK,KAAK;GAC5B,mBAAmB,KAAK,KAAK;GAC7B,oBAAoB,KAAK,KAAK;EAChC;EACA,MAAM;GACJ,MAAM,KAAK;GACX,QAAQ,KAAK;GACb,YAAY,KAAK;GACjB,QAAQ,KAAK;GACb,eAAe,KAAK,iBAAiB;GACrC,cAAc,KAAK,gBAAgB;GACnC,YAAY,KAAK;GACjB,iBAAiB,KAAK;GACtB,MAAM,KAAK;GACX,GAAG,eAAe,IAAI;EACxB;CACF;AACF;AAEA,SAAgB,0BACd,OACA,UAAqC,CAAC,GACZ;CAC1B,IAAI,QAAQ,eAAe,iBACzB,OAAO,MACJ,QACE,SACC,gBAAgB,MAAM,OAAO,KAC7B,KAAK,WAAW,qBAAqB,QACrC,KAAK,SAAS,SAAS,CAC3B,CAAC,CACA,IAAI,wBAAwB;CAEjC,OAAO,MACJ,QACE,SACC,uBAAuB,MAAM,OAAO,KACpC,oBAAoB,KAAK,QAAQ,IAAI,KACrC,oBAAoB,KAAK,QAAQ,IAAI,KAAK,SAAS,MACvD,CAAC,CACA,IAAI,wBAAwB;AACjC;AAqBA,SAAgB,UAAU,MAAkC;CAC1D,iBAAiB,MAAM,YAAY;CACnC,yBAAyB,MAAM,YAAY;CAC3C,MAAM,QAAQ,oBAAoB,KAAK,QAAQ;CAC/C,OAAO;EACL,UAAU,KAAK,SAAS,MAAM,GAAG,KAAK;EACtC,WAAW;GACT,QAAQ,KAAK,QAAQ;GACrB,eAAe,KAAK,QAAQ;GAC5B,SAAS,KAAK,QAAQ;GACtB,aAAa,KAAK,KAAK;GACvB,OAAO,KAAK,KAAK;GACjB,OAAO,KAAK,KAAK;GACjB,YAAY,KAAK;GACjB,GAAG,eAAe,IAAI;EACxB;CACF;AACF;;AAGA,SAAgB,WACd,OACA,UAAqC,CAAC,GAC3B;CACX,OAAO,MACJ,QACE,UACE,QAAQ,eAAe,kBACpB,gBAAgB,MAAM,OAAO,KAAK,KAAK,WAAW,qBAAqB,OACvE,uBAAuB,MAAM,OAAO,MACxC,KAAK,SAAS,SAAS,KACvB,oBAAoB,KAAK,QAAQ,IAAI,CACzC,CAAC,CACA,IAAI,SAAS;AAClB;AAOA,SAAgB,QAAQ,MAAsC;CAC5D,OAAO,KAAK,KAAK,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,KAAK,SAAS,OAAO;AAC/E;;;;;;;;;;;;AAaA,SAAgB,gBACd,MACA,SACS;CACT,IAAI,QAAQ,gBAAgB,KAAA,GAAW,OAAO,QAAQ,YAAY,SAAS,KAAK,KAAK,KAAK;CAC1F,IAAI,KAAK,KAAK,UAAU,UAAU,OAAO;CACzC,OAAO,KAAK,KAAK,UAAU,aAAa,QAAQ,6BAA6B;AAC/E;;;;;;AAOA,SAAgB,uBACd,MACA,SACgF;CAChF,MAAM,0BAA0B,QAAQ,2BAA2B;CACnE,IAAI,CAAC,OAAO,SAAS,uBAAuB,GAC1C,MAAM,IAAI,MAAM,wCAAwC;CAG1D,MAAM,SAAS,KAAK,QAAQ;CAC5B,IAAI,WAAW,MAAM,OAAO;CAC5B,IAAI,CAAC,OAAO,SAAS,MAAM,GACzB,MAAM,IAAI,MAAM,gCAAgC,KAAK,WAAW,iBAAiB;CAEnF,IAAI,UAAU,yBAAyB,OAAO;CAC9C,IAAI,CAAC,KAAK,QAAQ,gBAAgB,KAAK,QAAQ,gBAAgB,KAAK,QAAQ,UAAU,MACpF,OAAO;CAET,IAAI,KAAK,QAAQ,mBAAmB,MAAM,OAAO;CACjD,IAAI,KAAK,WAAW,qBAAqB,MAAM,OAAO;CACtD,OAAO,gBAAgB,MAAM,OAAO;AACtC"}

package/dist/exporters-Dk3oEbK_.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"exporters-Dk3oEbK_.d.ts","names":[],"sources":["../src/rollout/exporters.ts"],"mappings":";;;;;;;;;;;;;;;;;;UAiDiB;;EAEf;;;;;;EAMA;;UAiBe;;EAEf;;EAEA;;;;;;EAMA,cAAc;;;;;;;;;;;;;;;;;;;;;;KAuBX;UAEK,kCAAkC;;EAE1C,aAAa;;KAGH,mBAAmB;UAEd;EACf,UAAU;EACV;IACE;IACA;IACA;IACA;IACA;MACE;;;;;;;;;;;;;;;;;;iBAmBU,UAAU,OAAO,qBAAqB,UAAS,mBAAwB;UAyBtE;;EAEf;EACA,OAAO;EACP;EACA;IACE;IACA;IACA;IACA;IACA,OAAO;MAUL;;;;;iBAMU,aACd,OAAO,qBACP,UAAS,wBACR;UAgCc;EACf;EACA;EACA;EACA;EACA;;UAGe;;EAEf,QAAQ;;EAER,YAAY;EACZ;EACA,SAAS;EACT,WAAW;EACX,aAAa;EACb;IACE,MAAM;IACN,QAAQ;IACR;IACA;IACA;IACA;IACA;IACA;IACA,MAAM;MACJ;;iBA+CU,0BACd,OAAO,qBACP,UAAS,4BACR;UAyBc;;EAEf,UAAU;;EAEV;IACE;IACA;IACA;IACA;IACA;IACA,OAAO;IACP;MACE;;;iBAuBU,WACd,OAAO,qBACP,UAAS,4BACR;iBAkBa,QAAQ,MAAM"}

package/dist/failure-cluster-DN0t63Z0.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"failure-cluster-DN0t63Z0.d.ts","names":[],"sources":["../src/failure-taxonomy.ts","../src/pipelines/failure-cluster.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;KA6CY;;iBAuHI,aAAa,cAAc,eAAe;UAIzC;EACf,KAAK;EACL,OAAO;EACP,QAAQ;;UAGO;EACf,cAAc;;EAEd,OAAO;EACP;EACA;EACA;;;UAIe;EACf;EACA,QAAQ,KAAK;IACX,cAAc;IACd;;IAEA,QAAQ;IACR;IACA;;;;;;;;;;UAWa;;EAEf,cAAc;EACd,SAAS;;EAET,QAAQ;;;;;;;;;;;;iBAwEM,sBACd,mCACA,iBAAgB,sBACf;;;;;;;;;;iBAkba,gBACd,KAAK,gBACL,QAAO,eACP,uBAAsB,sBACrB;;;UCpsBc;EACf,cAAc;;EAEd;;EAEA;;;;;;;EAOA;EACA;EACA;EACA;EACA;;UAGe;EACf,UAAU;EACV;EACA;;iBAGoB,mBACpB,OAAO,YACP;EAAW,QAAQ;EAAe;IACjC,QAAQ"}

package/dist/feedback-trajectory-CYVJXolG.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"feedback-trajectory-CYVJXolG.d.ts","names":[],"sources":["../src/control-runtime/contract.ts","../src/feedback-trajectory-review.ts","../src/feedback-trajectory.ts"],"mappings":";;;;;;;KAIY;KAEA;UAEK;;EAEf;;EAEA;;EAEA;;EAEA,WAAW;;EAEX;;EAEA;;EAEA;;EAEA,WAAW;;UAGI;EACf;EACA;EACA;;UAGe,oBAAoB,QAAQ;;;;;EAK3C;;;;;EAKA;;EAEA;;EAEA,oBAAoB,OAAO;;EAE3B,qBAAqB,QAAQ;;UAGd,eACf,QACA,SACA,eACA,cAAc,oBAAoB;EAElC;EACA,OAAO;EACP,OAAO;EACP,SAAS,YAAY,QAAQ,SAAS,eAAe;EACrD,QAAQ;EACR;EACA;EACA;EACA;EACA,aAAa;EACb,UAAU;;KAGA,gBAAgB;EAEtB;EACA,QAAQ;EACR;;EAGA;EACA;EACA;EACA;;EAEA,eAAe;;UAGJ;EACf;EACA;EACA;EACA;EACA,eAAe;;UAGA,qBAAqB;EACpC;EACA,SAAS;EACT;EACA;EACA;;UAGe;EACf;EACA;EACA;;UAGe,YACf,QACA,SACA,eACA,cAAc,oBAAoB;EAElC;EACA,UAAU,gBAAgB;EAC1B,aAAa;EACb,YAAY;EACZ,aAAa;EACb,YAAY;EACZ,gBAAgB,qBAAqB;EACrC;EACA;;UAGe,iBACf,QACA,SACA,eACA,cAAc,oBAAoB;EAElC;EACA;EACA;EACA;EACA;EACA,OAAO,YAAY,QAAQ,SAAS,eAAe;EACnD,YAAY;EACZ,YAAY;EACZ;EACA;;EAEA;EACA,eAAe;EACf,eAAe;EACf;;UAGe,qBACf,QACA,SACA,eACA,cAAc,oBAAoB;EAElC;EACA,SAAS,QAAQ;EACjB,SAAS;;EAET,gBAAgB;;;;;EAKhB,oBAAoB;IAClB,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,SAAS,YAAY,QAAQ,SAAS,eAAe;;;EAIvD,UAAU;IACR,SAAS,YAAY,QAAQ,SAAS,eAAe;IACrD,aAAa;QACT,QAAQ,UAAU;;EAGxB,WAAW;IACT;IACA,OAAO;IACP,SAAS,YAAY,QAAQ,SAAS,eAAe;IACrD,aAAa;QACT,QAAQ,WAAW;;EAGzB,SACE,KAAK,eAAe,QAAQ,SAAS,eAAe,WACjD,QAAQ,gBAAgB,YAAY,gBAAgB;;EAGzD,MACE,QAAQ,SACR,KAAK,eAAe,QAAQ,SAAS,eAAe,WACjD,QAAQ,iBAAiB;;EAG9B,cACE,KAAK,eAAe,QAAQ,SAAS,eAAe,WACjD,QAAQ,gBAAgB;;EAG7B,UAAU,MAAM,YAAY,QAAQ,SAAS,eAAe,WAAW;;EAGvE,eAAe,oBAAoB,QAAQ;;EAG3C,QAAQ;EACR;EACA;EACA;;;;KCtMG,sBAAsB,QAAQ;KACvB;KACA;UAEK;EACf;EACA;EACA,WAAW;;UAGH;EACR,WAAW;EACX,QAAQ;EACR;EACA;EACA;EACA;;KAGU,yBACP;EACC;EACA,eAAe;EACf;EACA;MAED;EACC;EACA,cAAc;EACd;EACA;;;iBAgCU,iBAAiB,KAAK,mBAAmB;;;KCrD7C;KAWA;KAEA;KAYA;UAEK;EACf;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA,WAAW;;UAGI;EACf;EACA,QAAQ;EACR,MAAM;EACN;EACA;EACA,WAAW;EACX;EACA,WAAW;;UAGI;EACf;EACA;EACA,cAAc;EACd;EACA;EACA,iBAAiB;EACjB,QAAQ;EACR,WAAW;EACX;EACA,WAAW;;UAGI;EACf;EACA;EACA,UAAU;EACV;EACA;EACA;EACA,WAAW;;UAGI;EACf;EACA;EACA;EACA,MAAM;EACN,UAAU;EACV,QAAQ;EACR,UAAU;EACV,QAAQ;EACR,OAAO;EACP;EACA;EACA,WAAW;;UAGI;EACf,KAAK,YAAY,qBAAqB;EACtC,IAAI,aAAa,QAAQ;EACzB,KAAK,SAAS,2BAA2B,QAAQ;EACjD,cAAc,YAAY,SAAS,kBAAkB,QAAQ;EAC7D,YAAY,YAAY,OAAO,eAAe,qBAAqB,QAAQ;;UAG5D;EACf;EACA;EACA,QAAQ;EACR;;UAGe;EACf;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA,YAAY;EACZ;EACA,WAAW;;UAoBI;EACf,MAAM;EACN,kBAAkB;EAClB,0BAA0B;EAC1B,2BAA2B;EAC3B,UAAU;EACV;EACA;EACA;EACA,QAAQ;EACR,OAAO;EACP;EACA;IACE;IACA;IACA;;EAEF,WAAW;;UAGI;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,UAAU;EACV;EACA;EACA,UAAU;EACV;EACA;;cAUW,2CAA2C;mBACrC;EAEX,KAAK,YAAY,qBAAqB;EAItC,IAAI,aAAa,QAAQ;EAKzB,KAAK,SAAQ,2BAAgC,QAAQ;EAMrD,cAAc,YAAY,SAAS,kBAAkB,QAAQ;EAa7D,YACJ,YACA,OAAO,eACP,qBACC,QAAQ;;cAsBA,6CAA6C;mBACvC;mBACA;UACT;EAER,YAAY;IAAW;;EAIjB,KAAK,YAAY,qBAAqB;EAMtC,IAAI,aAAa,QAAQ;EAKzB,KAAK,SAAQ,2BAAgC,QAAQ;EAKrD,cAAc,YAAY,SAAS,kBAAkB,QAAQ;EAO7D,YACJ,YACA,OAAO,eACP,qBACC,QAAQ;UAOG;UAWA;;iBA8BA,yBAAyB;EACvC;EACA;EACA;EACA,MAAM;EACN,WAAW;EACX,SAAS;EACT,UAAU;EACV,QAAQ;EACR,OAAO;EACP;EACA,WAAW;IACT;;iBAqBY,+BACd,KAAK,kBACL,SAAS,mCACR;;iBAsFa,2BACd,KAAK,kBACL;EAAW;IACV;iBA4Da,oBACd,YAAY,KAAK,iEACjB,SAAQ,sBACP;iBAca,0BACd,YAAY,oBACZ,SAAS,sBACR;iBAuBa,uCACd,cAAc,uBACb;iBAIa,iCACd,YAAY,qBACX;iBA6Ca,oCACd,cAAc,uBACb;iBAyCa,0BACd,cAAc,sBACd;EAAW;IACV;iBA2Ba,+BAA+B,SAAS;iBAWxC,+BAA+B,QAAQ,SAAS,eAC9D,KAAK,iBAAiB,QAAQ,SAAS,gBACvC;EACE;EACA;EACA,eAAe;EACf,oBAAoB,MAAM,YAAY,QAAQ,SAAS;EACvD,0BACE,MAAM,YAAY,QAAQ,SAAS,mBAChC;EACL;IAED"}

package/dist/hf-dataset-CKxIJQba.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hf-dataset-CKxIJQba.js","names":[],"sources":["../src/rollout/ledger.ts","../src/rollout/release/gate-report.ts","../src/rollout/release/card.ts","../src/rollout/release/scrub.ts","../src/rollout/release/hf-dataset.ts"],"sourcesContent":["/**\n * Rollout-ledger file API — append-only JSONL of validated `tangle.rollout.v1`\n * lines. Writes validate BEFORE touching disk (a bad line never lands);\n * reads validate line-by-line and fail loud with the line number, because a\n * silently-skipped rollout is a corrupted dataset.\n *\n * \"Validate\" includes the anti-Goodhart invariant (a realness-gated line may\n * not carry a positive reward), so a poisoned line can neither enter a ledger\n * nor leave one.\n *\n * Two read modes, matching the two write-side row classes: `readRolloutLedger`\n * re-validates under the mint policy (training data), `readRolloutJournal`\n * under the write policy (supervision journals, whose unscreened positive\n * rewards are writable and must stay readable).\n */\n\nimport { appendFile, mkdir, readFile, writeFile } from 'node:fs/promises'\nimport { dirname } from 'node:path'\nimport { assertMinted, assertRolloutLine, type MintedRolloutLine, type RolloutLine } from './schema'\n\nfunction serialize(lines: RolloutLine[]): string {\n  for (const [i, line] of lines.entries()) assertRolloutLine(line, `rollout line [${i}]`)\n  return lines.map((line) => JSON.stringify(line)).join('\\n') + (lines.length > 0 ? '\\n' : '')\n}\n\n/** Replace the ledger file with exactly `lines`. */\nexport async function writeRolloutLedger(path: string, lines: RolloutLine[]): Promise<void> {\n  const payload = serialize(lines)\n  await mkdir(dirname(path), { recursive: true })\n  await writeFile(path, payload)\n}\n\n/** Append `lines` to the ledger file (created if absent). */\nexport async function appendRolloutLines(path: string, lines: RolloutLine[]): Promise<void> {\n  if (lines.length === 0) return\n  const payload = serialize(lines)\n  await mkdir(dirname(path), { recursive: true })\n  await appendFile(path, payload)\n}\n\n/**\n * Read and validate every line. Throws on the first malformed/invalid line\n * (with its 1-based line number) — fail-closed, never a silent drop.\n *\n * Validation includes the anti-Goodhart invariant, which is why the result is\n * `MintedRolloutLine[]`: a ledger file is the main way a rollout reaches this\n * process from outside the type system (another run, another machine, a\n * hand-edited JSONL), so this read is the runtime boundary where a poisoned\n * line is refused rather than exported.\n */\nexport async function readRolloutLedger(path: string): Promise<MintedRolloutLine[]> {\n  return readLines(path, (parsed, context) => assertMinted(parsed, context))\n}\n\n\n\nasync function readLines<T>(\n  path: string,\n  admit: (parsed: unknown, context: string) => T,\n): Promise<T[]> {\n  const raw = await readFile(path, 'utf8')\n  const lines: T[] = []\n  const rawLines = raw.split('\\n')\n  for (let i = 0; i < rawLines.length; i++) {\n    const text = rawLines[i]\n    if (!text?.trim()) continue\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(text)\n    } catch (error) {\n      throw new Error(\n        `${path}:${i + 1}: malformed JSON — ${error instanceof Error ? error.message : String(error)}`,\n      )\n    }\n    lines.push(admit(parsed, `${path}:${i + 1}`))\n  }\n  return lines\n}\n","/**\n * Per-format accounting of the anti-Goodhart gate for one dataset release.\n *\n * The defect this exists to make impossible: a dataset card that STATES what\n * the gate does while the build does something else. A sentence in a README is\n * a claim about bytes it never reads, so it drifts the moment an exporter\n * changes — and the drift ships to whoever downloads the dataset.\n *\n * So the card is not allowed to assert anything about the gate. The build\n * measures the rows it is ABOUT TO WRITE (`measureFormatGate`), the measurement\n * is checked against the declared per-format disposition (`assertGateReport`,\n * which throws rather than warns), and the card renders only numbers handed to\n * it. A card that disagrees with its own data files cannot be produced without\n * failing the build first.\n *\n * The dispositions themselves are the release policy, stated once as data:\n *\n *   sft       EXCLUDE       — an SFT row is an imitation target. A gamed\n *                             trajectory must never be imitated, at any weight.\n *   verifiers ZERO_AND_FLAG — reward is a signed learning signal here, so a\n *                             gamed trajectory at reward 0 is a correct\n *                             negative. Dropping it would bias the negative\n *                             population toward honest failures and leave a\n *                             trainer no example of what gaming looks like\n *                             when it is penalized.\n *   rft       ZERO_AND_FLAG — RFT re-samples the completion; only the prompt\n *                             and the grader's `reference.*` verdict ship, so\n *                             nothing gamed is imitated. The flag is what lets\n *                             a grader author skip the instance.\n *   raw       ZERO_AND_FLAG — a faithful audit dump. Removing rows from it\n *                             would defeat its only purpose, and the gated\n *                             row is the one an auditor most wants.\n *\n * `ZERO_AND_FLAG` is never `reward: 0` alone. Zeroing without the label makes a\n * faked success indistinguishable from an honest failure — it hides the gamed\n * population from the buyer instead of disclosing it. Every included format\n * carries `realness_gated` on the row itself.\n *\n * And `ZERO_AND_FLAG` means the whole outcome, not the scalar. A gated row that\n * ships `reward: 0` beside the per-layer verifier scores the reward was\n * computed from has not been zeroed in any sense a trainer respects; the\n * accounting therefore measures every reward-derived number each format writes,\n * not just the one field.\n */\n\nimport type { RftItem, SftRow, VerifiersRolloutOutput } from '../exporters'\nimport {\n  GATE_CHECK_IDS,\n  GATE_POLICIES,\n  type GateCheckId,\n  undeclaredStepPayload,\n} from '../gate-checks'\nimport type { MintedRolloutLine } from '../schema'\nimport type { ReleaseFormat } from './card'\n\n/** What a format does with a line the realness gate flagged. */\nexport type GateDisposition = 'exclude' | 'zero-and-flag'\n\nexport const FORMAT_GATE_DISPOSITION: Record<ReleaseFormat, GateDisposition> = {\n  sft: 'exclude',\n  verifiers: 'zero-and-flag',\n  rft: 'zero-and-flag',\n  raw: 'zero-and-flag',\n}\n\n/** What the gate accounting reads off an emitted row, per format. */\nexport interface ReleaseRowRef {\n  rollout_id: string\n  reward: number | null\n  /**\n   * The rest of the row that was DERIVED from the reward — the per-layer score\n   * dict, the judge verdict record, whatever this format ships beside the\n   * scalar. Walked for positive numbers, so the certification is about the\n   * whole outcome rather than one field.\n   *\n   * Absent when the format's row carries nothing but the scalar. NOT the whole\n   * row: `cost.tokens_in`, `wall_s` and `total_steps` are positive numbers that\n   * have nothing to do with the reward, and a certification that flags them is\n   * a certification nobody can act on.\n   */\n  evidence?: unknown\n  /**\n   * The screen claim AS EMITTED — read off the row, not off the line it came\n   * from, because what ships is what matters. Required, not optional: an\n   * optional field is how a format quietly opts out of the check that reads it,\n   * and every emitted row shape carries `RealnessLabels` precisely so no adapter\n   * has to.\n   */\n  realness_screened: boolean | null\n  /**\n   * The part of an emitted `steps[]` the wire format does not declare.\n   *\n   * Separate from `evidence` because the declared step fields are FULL of\n   * legitimate positive numbers — `durationMs`, `llm_call_count`,\n   * `prompt_token_ids` — and a certification that flags those is one nobody can\n   * act on. Only the undeclared remainder is unclassified reward-bearing\n   * payload, which is the same partition the check applies.\n   *\n   * Set only by formats whose row carries steps: today `raw` alone.\n   */\n  stepEvidence?: unknown\n}\n\n/** A positive number found inside an emitted gated row, with where it was. */\nexport interface EmittedEvidence {\n  /** JSON-ish path from the row's evidence root, e.g. `metrics['layer.tests']`. */\n  path: string\n  value: number\n}\n\nexport interface FormatGateCounts {\n  /** Gated lines that reached this format's exporter. */\n  input: number\n  /** Gated rows the format actually wrote. */\n  emitted: number\n  /**\n   * Gated lines this format did not write. Not all of these are the gate:\n   * `verifiers` also drops gap lines (empty transcript) and `rft` drops lines\n   * with no prompt turn, so an excluded count can mix both causes.\n   */\n  excluded: number\n  /** Highest reward on an emitted gated row; `null` when none was emitted. */\n  maxEmittedReward: number | null\n  /**\n   * The largest positive number found in the reward-DERIVED payload of an\n   * emitted gated row, and its path; `null` when there is none.\n   *\n   * This column exists because the release once certified CLEAN while leaking.\n   * `assertGateReport` inspected `outcome.reward` alone, so a gated row shipping\n   * `reward: 0` next to `metrics['layer.tests']: 1` — the deterministic verifier\n   * score the reward was computed from, and the per-rubric score dict of the\n   * Prime Intellect verifiers format — passed, and the card rendered \"max reward\n   * | 0\" over a file that carried the gamed signal at full value. A wrong\n   * certification is worse than the leak: it is the leak plus a document saying\n   * there isn't one.\n   */\n  maxEmittedEvidence: EmittedEvidence | null\n  /**\n   * Rows this format wrote carrying a positive reward whose producer DECLARED\n   * that no authenticity screen ever ran on it (`realness_screened: false`).\n   *\n   * Measured over EVERY emitted row, not just the gated ones: an unscreened\n   * reward is by definition one the gate never had a verdict on, so it is not in\n   * the gated set and a measurement scoped to that set would report 0 forever.\n   * `assertMinted` already refuses these, which is exactly why the release still\n   * measures them — the last door before a public dataset does not get to assume\n   * the earlier doors held.\n   */\n  unscreenedPositiveRows: number\n  /** Highest reward on such a row; `null` when there is none. */\n  maxUnscreenedReward: number | null\n  /**\n   * The largest positive number found in an emitted gated row's UNDECLARED\n   * per-step payload, and its path; `null` when there is none.\n   *\n   * The column exists because the gate read `outcome` and nothing else for\n   * three rounds, so a gated line shipping `steps: [{kind, name, reward: 0.86}]`\n   * certified clean — the release accounting agreed with the exporter that a\n   * per-step reward was not a reward.\n   */\n  maxEmittedStepEvidence: EmittedEvidence | null\n}\n\nexport interface GateReport {\n  /** Gated lines in the release input, after the split/proposer filters. */\n  gatedLines: number\n  byFormat: Partial<Record<ReleaseFormat, FormatGateCounts>>\n}\n\n/** Rollout ids of every gated line, the key the emitted rows are matched on. */\nexport function gatedRolloutIds(lines: readonly MintedRolloutLine[]): Set<string> {\n  return new Set(lines.filter((line) => line.outcome.realness_gated).map((line) => line.rollout_id))\n}\n\n/**\n * Row refs per format. Written as one adapter per format so that the knowledge\n * of WHERE the id and reward live in each published shape sits next to the\n * assertion that uses it — an exporter that moves either field breaks here\n * rather than silently reporting zero gated rows.\n */\nexport const releaseRowRefs = {\n  // An SFT row is `{messages, metadata}` and `metadata` holds ids plus the\n  // scalar — no reward-derived payload beyond `reward` itself, and the gated\n  // disposition is EXCLUDE anyway.\n  sft: (rows: readonly SftRow[]): ReleaseRowRef[] =>\n    rows.map((row) => ({\n      rollout_id: row.metadata.rollout_id,\n      reward: row.metadata.reward,\n      realness_screened: row.metadata.realness_screened,\n    })),\n  // `metrics` IS the per-rubric score dict in the Prime Intellect verifiers\n  // format — the same numbers the reward was computed from. This is the leak\n  // that shipped.\n  verifiers: (rows: readonly VerifiersRolloutOutput[]): ReleaseRowRef[] =>\n    rows.map((row) => ({\n      rollout_id: row.info.rollout_id,\n      reward: row.reward,\n      evidence: row.metrics,\n      realness_screened: row.info.realness_screened,\n    })),\n  // RFT re-samples the completion, but the grader reads `item.reference.*`, so\n  // the verbatim judge verdict is a reward-bearing field on the row.\n  rft: (rows: readonly RftItem[]): ReleaseRowRef[] =>\n    rows.map((row) => ({\n      rollout_id: row.reference.rollout_id,\n      reward: row.reference.reward,\n      evidence: row.reference.verdict,\n      realness_screened: row.reference.realness_screened,\n    })),\n  raw: (lines: readonly MintedRolloutLine[]): ReleaseRowRef[] =>\n    lines.map((line) => ({\n      rollout_id: line.rollout_id,\n      reward: line.outcome.reward,\n      // `provenance.gated_evidence` is deliberately NOT walked: relocating the\n      // diagnostics there is what the gate DOES, and the raw config is the\n      // audit dump those diagnostics exist for.\n      evidence: { metrics: line.outcome.metrics, verdict: line.outcome.verdict },\n      // `raw` is the only config that writes the whole line, so it is the only\n      // one whose rows can carry a per-step reward.\n      stepEvidence: undeclaredStepPayload(line.steps),\n      realness_screened: line.outcome.realness_screened ?? null,\n    })),\n}\n\n/** Every positive finite number inside a row's reward-derived payload, with its path. */\nfunction positiveNumbersIn(value: unknown, path: string): EmittedEvidence[] {\n  if (typeof value === 'number') {\n    return Number.isFinite(value) && value > 0 ? [{ path, value }] : []\n  }\n  if (Array.isArray(value)) {\n    return value.flatMap((item, i) => positiveNumbersIn(item, `${path}[${i}]`))\n  }\n  if (typeof value === 'object' && value !== null) {\n    return Object.entries(value).flatMap(([key, child]) =>\n      positiveNumbersIn(child, path === '' ? key : `${path}.${key}`),\n    )\n  }\n  return []\n}\n\n/** Measure one format's gated rows from the refs of the rows about to be written. */\nexport function measureFormatGate(\n  gated: ReadonlySet<string>,\n  refs: readonly ReleaseRowRef[],\n): FormatGateCounts {\n  const emitted = refs.filter((ref) => gated.has(ref.rollout_id))\n  const rewards = emitted.map((ref) => ref.reward).filter((r): r is number => r !== null)\n  const evidence = emitted.flatMap((ref) => positiveNumbersIn(ref.evidence, ''))\n  const stepEvidence = emitted.flatMap((ref) => positiveNumbersIn(ref.stepEvidence, 'steps'))\n  const unscreened = refs\n    .filter((ref) => ref.realness_screened === false)\n    .map((ref) => ref.reward)\n    .filter((r): r is number => r !== null && r > 0)\n  return {\n    input: gated.size,\n    emitted: emitted.length,\n    excluded: gated.size - emitted.length,\n    maxEmittedReward: rewards.length === 0 ? null : Math.max(...rewards),\n    maxEmittedEvidence: evidence.reduce<EmittedEvidence | null>(\n      (best, found) => (best === null || found.value > best.value ? found : best),\n      null,\n    ),\n    unscreenedPositiveRows: unscreened.length,\n    maxUnscreenedReward: unscreened.length === 0 ? null : Math.max(...unscreened),\n    maxEmittedStepEvidence: stepEvidence.reduce<EmittedEvidence | null>(\n      (best, found) => (best === null || found.value > best.value ? found : best),\n      null,\n    ),\n  }\n}\n\n/**\n * The measured form of each canonical gate check, over the rows a release is\n * ABOUT TO WRITE. Returns the failure message, or `null` when the format is\n * clean on that check.\n *\n * TOTAL over `GateCheckId` — this map and `GATE_POLICIES.assertGateReport` are\n * the two things a new check breaks here, so the release certifier cannot be\n * left behind by a check added anywhere else in the package. That is the whole\n * point: for four rounds each guard composed its own subset by hand, and a\n * release certifying CLEAN while leaking is the most expensive version of that\n * mistake, because it is the leak plus a document saying there isn't one.\n */\nconst REPORT_MEASURES: {\n  readonly [K in GateCheckId]: (format: ReleaseFormat, counts: FormatGateCounts) => string | null\n} = {\n  'reward-relationship': (format, counts) =>\n    counts.maxEmittedReward === null || counts.maxEmittedReward <= 0\n      ? null\n      : `release format \"${format}\": ${counts.emitted} realness-gated row(s) carry a positive ` +\n        `reward (max ${counts.maxEmittedReward}). A run flagged as gamed may not ship a ` +\n        'positive reward in any config.',\n  'gated-evidence': (format, counts) => {\n    if (counts.maxEmittedEvidence === null) return null\n    const { path, value } = counts.maxEmittedEvidence\n    return (\n      `release format \"${format}\": ${counts.emitted} realness-gated row(s) carry a positive ` +\n      `reward-derived number (${path} = ${value}). Zeroing the scalar is not enough — the ` +\n      'per-layer scores and judge verdict a fabricated reward was computed FROM are the ' +\n      'same signal in component form, and in this format they are read as training input. ' +\n      'They belong in `provenance.gated_evidence` (see `gateGamedOutcome`), not on the row.'\n    )\n  },\n  'undeclared-step-payload': (format, counts) => {\n    if (counts.maxEmittedStepEvidence === null) return null\n    const { path, value } = counts.maxEmittedStepEvidence\n    return (\n      `release format \"${format}\": ${counts.emitted} realness-gated row(s) carry a positive ` +\n      `per-step number under a field \\`tangle.rollout.v1\\` does not declare (${path} = ${value}). ` +\n      'A per-step reward is the same training signal as the scalar, in credit-assignment form, ' +\n      'and the exporters copy `steps` through verbatim — so the row ships it beside a `reward` ' +\n      'of 0. It belongs in `provenance.gated_evidence.steps` (see `gateGamedOutcome`).'\n    )\n  },\n  'unscreened-reward': (format, counts) =>\n    counts.maxUnscreenedReward === null\n      ? null\n      : `release format \"${format}\": ${counts.unscreenedPositiveRows} row(s) carry a positive ` +\n        `reward (max ${counts.maxUnscreenedReward}) whose producer declares that NO authenticity ` +\n        'screen ran on it (`realness_screened: false`). Nothing has established those successes ' +\n        'are real, and a published dataset may not present an unqualified verdict as a measured ' +\n        'one. Screen the runs, or publish them at `reward: null`.',\n}\n\n/**\n * Fail the build when the measurement disagrees with the declared policy.\n *\n * Throws, never filters: an emitted positive reward on a gated row means an\n * exporter upstream stopped applying the gate, and silently dropping the row\n * would hide the producer that made it — the producer is the actual defect.\n *\n * Certifies the whole emitted outcome, not `reward` alone. The earlier version\n * checked one field and therefore certified a release CLEAN while its\n * `verifiers/train.jsonl` shipped the gamed run's per-layer scores at 1.0 in\n * the top-level `metrics` dict — the card then rendered \"max reward | 0\" over\n * exactly that file. A certification that is wrong is worse than an\n * uncertified leak, so the checks it runs are no longer written down here at\n * all: it iterates `GATE_CHECK_IDS` under its own declared policy.\n */\nexport function assertGateReport(report: GateReport): void {\n  for (const [format, counts] of Object.entries(report.byFormat) as Array<\n    [ReleaseFormat, FormatGateCounts]\n  >) {\n    for (const id of GATE_CHECK_IDS) {\n      if (GATE_POLICIES.assertGateReport[id].kind !== 'enforce') continue\n      const failure = REPORT_MEASURES[id](format, counts)\n      if (failure !== null) throw new Error(failure)\n    }\n    // Not a gate check: this one is the RELEASE POLICY (`FORMAT_GATE_DISPOSITION`)\n    // rather than the anti-Goodhart invariant — it asks whether the format did\n    // what it said it would with gated rows, not whether a row is poisoned.\n    if (FORMAT_GATE_DISPOSITION[format] === 'exclude' && counts.emitted > 0) {\n      throw new Error(\n        `release format \"${format}\" declares gated lines EXCLUDED but wrote ${counts.emitted} ` +\n          'of them.',\n      )\n    }\n  }\n}\n","/**\n * HuggingFace dataset-card (README.md) generation for a rollout-ledger release.\n *\n * The card is a pure function of the SCRUBBED lines plus the release options —\n * no timestamps, no environment reads — so rebuilding from the same ledger\n * yields byte-identical output. It documents the schema, provenance (run ids,\n * generations, the official judge), per-role reward semantics including the\n * inherited/contribution caveat, and a role × reward counts table.\n */\n\nimport { type MintedRolloutLine, ROLLOUT_ROLES, ROLLOUT_SCHEMA, type RolloutRole } from '../schema'\nimport { assertGateReport, FORMAT_GATE_DISPOSITION, type GateReport } from './gate-report'\nimport type { ScrubCounts } from './scrub'\n\nexport const RELEASE_FORMATS = ['sft', 'verifiers', 'rft', 'raw'] as const\nexport type ReleaseFormat = (typeof RELEASE_FORMATS)[number]\n\n/** Format → data file path inside the dataset dir (train split only). */\nexport const FORMAT_FILES: Record<ReleaseFormat, string> = {\n  sft: 'sft/train.jsonl',\n  verifiers: 'verifiers/train.jsonl',\n  rft: 'rft/train.jsonl',\n  raw: 'raw/train.jsonl',\n}\n\nconst FORMAT_DESCRIPTIONS: Record<ReleaseFormat, string> = {\n  sft: 'Successful trainable-split transcripts (`reward >= 1`, never realness-gated) as `{messages, metadata}` chat JSONL.',\n  verifiers:\n    'Prime Intellect verifiers `RolloutOutput`: prompt/completion split at the first assistant turn, plus reward, metrics, tool defs, and token usage.',\n  rft: 'OpenAI RFT items: prompt turns plus `reference.*` verdict fields for a grader (completions are re-sampled during RFT).',\n  raw: `Full \\`${ROLLOUT_SCHEMA}\\` ledger lines (scrubbed), one per agent invocation.`,\n}\n\nexport interface DatasetCardInputs {\n  /** Scrubbed, release-filtered lines (what actually ships). */\n  lines: MintedRolloutLine[]\n  formats: ReleaseFormat[]\n  includeProposers: boolean\n  /** Source ledger basenames, for provenance. */\n  sourceFiles: string[]\n  scrubTotals: ScrubCounts\n  excluded: { proposers: number; nonTrain: number }\n  formatCounts: Partial<Record<ReleaseFormat, number>>\n  /**\n   * Per-format anti-Goodhart accounting MEASURED on the rows the build wrote.\n   * Required, not optional: the card's only statement about the gate is a\n   * render of these numbers, so a card cannot be produced without them and\n   * cannot drift from the data files it ships beside.\n   */\n  gate: GateReport\n}\n\nfunction unique(values: Array<string | null>): string[] {\n  return [...new Set(values.filter((v): v is string => v !== null))].sort()\n}\n\nfunction formatReward(reward: number | null): string {\n  if (reward === null) return 'null'\n  return Number.isInteger(reward) ? String(reward) : reward.toFixed(4)\n}\n\nfunction markdownTable(header: string[], rows: string[][]): string {\n  return [\n    `| ${header.join(' | ')} |`,\n    `| ${header.map(() => '---').join(' | ')} |`,\n    ...rows.map((row) => `| ${row.join(' | ')} |`),\n  ].join('\\n')\n}\n\n/** Where the anti-Goodhart flag lives on each format's emitted row. */\nconst GATE_FLAG_FIELD: Record<ReleaseFormat, string> = {\n  sft: '— (no gated row is written)',\n  verifiers: '`info.realness_gated`',\n  rft: '`reference.realness_gated`',\n  raw: '`outcome.realness_gated`',\n}\n\nconst GATE_POLICY_LABEL: Record<ReleaseFormat, string> = {\n  sft: 'EXCLUDED — an SFT row is an imitation target',\n  verifiers: 'INCLUDED, reward forced to 0, flagged',\n  rft: 'INCLUDED, reward forced to 0, flagged',\n  raw: 'INCLUDED verbatim, flagged',\n}\n\nfunction gateSection(formats: ReleaseFormat[], gate: GateReport, totalLines: number): string {\n  const rows = formats.map((format) => {\n    const counts = gate.byFormat[format]\n    return [\n      format,\n      GATE_POLICY_LABEL[format],\n      String(counts?.emitted ?? 0),\n      String(counts?.excluded ?? 0),\n      counts?.maxEmittedReward === null || counts === undefined\n        ? '—'\n        : formatReward(counts.maxEmittedReward),\n      counts?.maxEmittedEvidence == null\n        ? '—'\n        : `${counts.maxEmittedEvidence.path} = ${counts.maxEmittedEvidence.value}`,\n      GATE_FLAG_FIELD[format],\n    ]\n  })\n  const mixedExclusion = formats.some(\n    (format) => FORMAT_GATE_DISPOSITION[format] === 'zero-and-flag',\n  )\n  return [\n    `\\`outcome.realness_gated: true\\` marks a run whose success signal was faked (it satisfied the proxy without doing the work). **${gate.gatedLines} of ${totalLines} lines in this release are gated.**`,\n    '',\n    'The gate is enforced, not asserted. A line pairing `realness_gated: true` with a reward above 0 is rejected by the schema validator, so it cannot be read out of a source ledger or written into `raw/train.jsonl` at all; on a gated line the numbers the reward was computed from (`outcome.metrics`, the verbatim judge `outcome.verdict`, and any per-step field the schema does not declare — a per-step reward is the same signal in credit-assignment form) are moved out of `outcome` and `steps[]` and into `provenance.gated_evidence`, where no config reads them as training input; the exporters re-check the same invariant on every line; and the release build measures the rows it is about to write and refuses to write ANY file if a gated row carries a positive reward — or any positive number derived from one — in ANY config.',\n    '',\n    'The table below is **measured on the rows in this release**, not a description of intent — the build counts the emitted rows and this card renders those counts:',\n    '',\n    markdownTable(\n      [\n        'config',\n        'policy',\n        'gated rows written',\n        'gated rows not written',\n        'max reward',\n        'max reward-derived number',\n        'flag',\n      ],\n      rows,\n    ),\n    '',\n    'Why gated rows are kept where they are kept: an SFT row is imitated verbatim, so a gamed trajectory must never appear in one at any weight. In `verifiers` the reward is a signed learning signal, and a gamed trajectory at reward 0 is a correct negative — dropping it would bias the negative population toward honest failures and leave a trainer no example of gaming being penalized. `rft` re-samples the completion, so only the prompt and the grader reference ship. `raw` is a faithful audit dump, where the gated row is the one an auditor most wants.',\n    '',\n    \"Reward 0 is never the only label: every included config carries the flag on the row itself, because zeroing alone makes a faked success indistinguishable from an honest failure. Filter on the flag to drop the gamed population, or select on it to mine it. The gated run's own measurements are not destroyed either — they are parked verbatim under `provenance.gated_evidence` in `raw/train.jsonl`, which is where an auditor can see what the run claimed and why it was flagged.\",\n    mixedExclusion\n      ? '\\n\"Gated rows not written\" is not all gate: `verifiers` also drops gap lines (empty transcript) and `rft` drops lines with no prompt turn, so that column can mix both causes.'\n      : '',\n  ]\n    .join('\\n')\n    .trimEnd()\n}\n\nfunction roleRewardRows(lines: MintedRolloutLine[]): string[][] {\n  const counts = new Map<RolloutRole, Map<string, number>>()\n  for (const line of lines) {\n    const byReward = counts.get(line.role) ?? new Map<string, number>()\n    const key = formatReward(line.outcome.reward)\n    byReward.set(key, (byReward.get(key) ?? 0) + 1)\n    counts.set(line.role, byReward)\n  }\n  const rows: string[][] = []\n  for (const role of ROLLOUT_ROLES) {\n    const byReward = counts.get(role)\n    if (!byReward) continue\n    const keys = [...byReward.keys()].sort((a, b) => {\n      if (a === 'null') return 1\n      if (b === 'null') return -1\n      return Number(b) - Number(a)\n    })\n    for (const key of keys) rows.push([role, key, String(byReward.get(key))])\n  }\n  return rows\n}\n\nexport function buildDatasetCard(inputs: DatasetCardInputs): string {\n  const {\n    lines,\n    formats,\n    includeProposers,\n    sourceFiles,\n    scrubTotals,\n    excluded,\n    formatCounts,\n    gate,\n  } = inputs\n  // The card is the artifact a buyer reads; it may not render a gate report\n  // that violates the release policy even when called outside the build.\n  assertGateReport(gate)\n\n  const runIds = unique(lines.map((line) => line.run_id))\n  const generations = [...new Set(lines.map((line) => line.generation))]\n    .filter((g): g is number => g !== null)\n    .sort((a, b) => a - b)\n  const models = unique(lines.map((line) => line.policy.model))\n  const harnesses = unique(lines.map((line) => line.policy.harness))\n  const captures = unique(lines.map((line) => line.provenance.capture))\n  const rewardSources = unique(lines.map((line) => line.outcome.reward_source))\n  const gapLines = lines.filter((line) => line.messages.length === 0).length\n  const gatedLines = lines.filter((line) => line.outcome.realness_gated).length\n  if (gatedLines !== gate.gatedLines) {\n    throw new Error(\n      `dataset card: gate report claims ${gate.gatedLines} realness-gated line(s) but the lines ` +\n        `it describes contain ${gatedLines} — the card and the build measured different data.`,\n    )\n  }\n\n  const configs = formats\n    .map((format) =>\n      [\n        `  - config_name: ${format}`,\n        '    data_files:',\n        '      - split: train',\n        `        path: ${FORMAT_FILES[format]}`,\n      ].join('\\n'),\n    )\n    .join('\\n')\n\n  const frontmatter = [\n    '---',\n    'license: unknown',\n    'pretty_name: Tangle rollout ledger — agent trajectories',\n    'configs:',\n    configs,\n    '---',\n  ].join('\\n')\n\n  const formatsTable = markdownTable(\n    ['config', 'path', 'rows', 'contents'],\n    formats.map((format) => [\n      format,\n      `\\`${FORMAT_FILES[format]}\\``,\n      String(formatCounts[format] ?? 0),\n      FORMAT_DESCRIPTIONS[format],\n    ]),\n  )\n\n  const countsTable = markdownTable(['role', 'reward', 'lines'], roleRewardRows(lines))\n\n  const scrubTable = markdownTable(\n    ['rule', 'rewrites'],\n    Object.entries(scrubTotals).map(([rule, count]) => [rule, String(count)]),\n  )\n\n  const proposerNote = includeProposers\n    ? 'Proposer sessions are INCLUDED (`--include-proposers`); their transcripts contain improvement-loop harness source.'\n    : `Proposer sessions are excluded by default (${excluded.proposers} lines dropped); they contain improvement-loop harness source. Rebuild with \\`--include-proposers\\` to keep them.`\n\n  return `${frontmatter}\n\n# Tangle rollout ledger — agent trajectories\n\nOne line per agent invocation (supervisor episode, worker session, proposer shot, judge call, analyst pass) captured by the \\`${ROLLOUT_SCHEMA}\\` rollout ledger, labeled with improvement-loop coordinates and the official-judge reward, with the full message transcript inline.\n\nThis release contains the **trainable split only** (\\`search\\`). Holdout, dev, and canary splits are structurally excluded at build time, and the build additionally drops any non-trainable line as a fail-closed filter (${excluded.nonTrain} dropped here).\n\n## Formats\n\n${formatsTable}\n\n## Anti-Goodhart gate (\\`realness_gated\\`)\n\n${gateSection(formats, gate, lines.length)}\n\n## Schema (\\`${ROLLOUT_SCHEMA}\\`)\n\nEach raw line carries:\n\n- \\`rollout_id\\` / \\`parent_rollout_id\\` — invocation identity; workers point at their spawning supervisor episode.\n- \\`run_id\\`, \\`experiment_id\\`, \\`candidate_id\\` — run/experiment/candidate identity from the producing RunRecord, when present.\n- \\`generation\\`, \\`candidate_index\\` — improvement-loop coordinates (\\`-1\\` = baseline campaign; \\`null\\` = not an improvement loop).\n- \\`role\\` — one of ${ROLLOUT_ROLES.map((role) => `\\`${role}\\``).join(', ')}.\n- \\`task\\` — suite, instance id, split, seed, replicate index.\n- \\`policy\\` — harness, model, provider, profile commit, prompt/config hashes, sampling params.\n- \\`messages\\` / \\`tool_defs\\` — full transcript in canonical OpenAI chat-with-tools form (including \\`reasoning_content\\`). An empty \\`messages\\` array is a labeled gap line; \\`provenance.gap\\` says why the transcript could not be recovered (${gapLines} gap lines in this release).\n- \\`outcome\\` — \\`reward\\` (the single scalar), \\`reward_source\\`, the verbatim judge \\`verdict\\`, non-scalar \\`metrics\\`, and \\`realness_gated\\` (anti-Goodhart flag; see [Anti-Goodhart gate](#anti-goodhart-gate-realness_gated) for the per-config treatment and the measured counts).\n- \\`cost\\` — usd, token counts, wall time.\n- \\`artifacts\\` / \\`provenance\\` — patch/run-dir/transcript pointers (scrubbed) and capture metadata.\n\n## Provenance\n\n- Source ledgers: ${sourceFiles.map((file) => `\\`${file}\\``).join(', ')}\n- Run ids: ${runIds.map((id) => `\\`${id}\\``).join(', ')}\n- Generations: ${generations.join(', ')} (\\`-1\\` = baseline campaign)\n- Models: ${models.map((m) => `\\`${m}\\``).join(', ')}\n- Harnesses: ${harnesses.map((h) => `\\`${h}\\``).join(', ')}\n- Capture modes: ${captures.join(', ')}\n- Every reward traces to a named source (reward sources in this release: ${rewardSources.map((s) => `\\`${s}\\``).join(', ')}).\n\n${proposerNote}\n\n## Reward semantics per role\n\n- **agent** — the producing RunRecord's holdout/search score, with the realness gate forcing gamed successes to 0.\n- **supervisor** — the official-judge verdict on the episode's delivered artifact (1 = resolved, 0 = not).\n- **worker** — INHERITED from the parent supervisor episode (\\`…/inherited\\`). Caveat: reward 1 does not establish this worker's individual contribution (sibling workers in the same episode share the episode outcome), and reward 0 does not prove this worker failed.\n- **proposer** — the fraction of improvement-set instances the proposed candidate resolved (\\`…/candidate-resolved-fraction\\`); a scalar in [0, 1], not a binary verdict.\n- **judge / analyst** — carry the episode verdict where one applies; otherwise \\`reward: null\\` (a labeled gap, never 0).\n\n## Counts\n\n${countsTable}\n\nTotal lines: ${lines.length}\n\n## Scrubbing\n\nAbsolute home paths were rewritten to \\`$WORK\\`, credential-shaped strings were replaced with \\`[REDACTED:<kind>]\\` markers, internal hostnames were normalized to \\`*.internal.example\\`, and username-bearing incidentals (\\`ls -l\\` owner columns, per-user pytest tmpdirs) were normalized to \\`user\\` / \\`$USER\\`. Rewrite counts for this release (full per-file breakdown in \\`scrub-report.json\\`):\n\n${scrubTable}\n\n## License\n\n\\`license: unknown\\` is a placeholder — the releasing operator must set the real SPDX license id in the frontmatter above before publishing.\n\n## Citation\n\n\\`\\`\\`bibtex\n@misc{tangle_rollout_ledger,\n  title = {Tangle rollout ledger — agent trajectories},\n  author = {{Tangle Network}},\n  howpublished = {HuggingFace Datasets},\n  note = {Operator: fill in the repository URL, authors, and year before publishing}\n}\n\\`\\`\\`\n`\n}\n","/**\n * Deterministic scrubbing pass over rollout-ledger lines before public release.\n *\n * Every rule is a pure regex rewrite applied to every string value in a line\n * (messages, artifacts, run ids, tool arguments — everywhere), so the scrubbed\n * line is still a valid `tangle.rollout.v1` line. Rules are idempotent:\n * scrub(scrub(x)) === scrub(x), and a second pass counts zero hits — that is\n * the property the release pipeline relies on to prove nothing half-scrubbed\n * ships. Rule order matters: whole `KEY=value` env pairs are redacted before\n * the bare-key rule so one secret is never counted twice.\n */\n\nimport { assertMinted, type MintedRolloutLine } from '../schema'\n\nexport interface ScrubRule {\n  name: string\n  pattern: RegExp\n  /** Rewrite for one match; `g1` is the first capture group when present. */\n  rewrite: (match: string, g1?: string) => string\n}\n\nconst SCRUB_RULES: readonly ScrubRule[] = [\n  {\n    // /home/<user> and /Users/<user> prefixes → $WORK ($HOME-derived paths).\n    name: 'home-path',\n    pattern: /\\/(?:home|Users)\\/[A-Za-z0-9._-]+/g,\n    rewrite: () => '$WORK',\n  },\n  {\n    // Harness stores encode cwd as a dashed path segment (-home-drew-…);\n    // strip the leading -home-<user> so the username never ships.\n    name: 'home-path-encoded',\n    pattern: /(?<=\\/)-(?:home|Users)-[A-Za-z0-9_.]+/g,\n    rewrite: () => '$WORK',\n  },\n  {\n    // pytest names its tmpdir after the invoking user (/tmp/pytest-of-drew).\n    name: 'tmp-user-dir',\n    pattern: /\\/tmp\\/pytest-of-[A-Za-z0-9._-]+/g,\n    rewrite: () => '/tmp/pytest-of-$USER',\n  },\n  {\n    // `ls -l` owner/group columns leak the username in captured tool output.\n    // The `(?!user user…)` guard keeps a second pass at zero rewrites.\n    name: 'ls-owner',\n    pattern:\n      /([-bcdlps][-rwxsStT]{9}[.+@]?\\s+\\d+\\s+)(?!user user(?=\\s))[A-Za-z0-9._-]+\\s+[A-Za-z0-9._-]+(?=\\s)/g,\n    rewrite: (_match, prefix) => `${prefix}user user`,\n  },\n  {\n    // Env-var-shaped secrets: NAME=value where NAME looks credential-bearing.\n    // The (?!\\[REDACTED:) guard keeps the rule idempotent on its own output.\n    name: 'env-secret',\n    pattern:\n      /\\b([A-Z][A-Z0-9_]*(?:KEY|TOKEN|SECRET|PASSWORD|PASSWD|CREDENTIALS?))=(?!\\[REDACTED:)(\"[^\"]*\"|'[^']*'|[^\\s\"']+)/g,\n    rewrite: (_match, name) => `${name}=[REDACTED:env]`,\n  },\n  {\n    name: 'bearer-token',\n    pattern: /\\b(Bearer|Basic)\\s+(?!\\[REDACTED:)[A-Za-z0-9\\-._~+/=]{8,}/g,\n    rewrite: (_match, scheme) => `${scheme} [REDACTED:bearer]`,\n  },\n  {\n    // Bare provider-prefixed keys (OpenAI/Anthropic sk-, GitHub ghp_/gho_/…,\n    // fine-grained PATs, HuggingFace hf_, Slack xox*, AWS AKIA).\n    name: 'api-key',\n    pattern:\n      /\\b(?:sk-[A-Za-z0-9_-]{16,}|gh[pousr]_[A-Za-z0-9]{16,}|github_pat_[A-Za-z0-9_]{20,}|hf_[A-Za-z0-9]{16,}|xox[baprs]-[A-Za-z0-9-]{10,}|AKIA[0-9A-Z]{16})\\b/g,\n    rewrite: () => '[REDACTED:api-key]',\n  },\n  {\n    // Our infra hostnames → placeholder domain, subdomain preserved\n    // (router.tangle.tools → router.internal.example).\n    name: 'infra-host',\n    pattern: /(?<![A-Za-z0-9.-])((?:[A-Za-z0-9-]+\\.)*)tangle\\.(?:tools|network)(?![A-Za-z0-9-])/g,\n    rewrite: (_match, prefix) => `${prefix ?? ''}internal.example`,\n  },\n  {\n    // Known workstation hostnames leak through email Message-IDs and fqdn\n    // lookups inside captured test output; extend the list as machines join.\n    name: 'machine-host',\n    pattern: /\\b[A-Za-z0-9]+-GTR-Pro\\b/g,\n    rewrite: () => 'workstation',\n  },\n]\n\n/** Rule name → number of matches rewritten. Always carries every rule (0 is data). */\nexport type ScrubCounts = Record<string, number>\n\nexport function emptyScrubCounts(): ScrubCounts {\n  return Object.fromEntries(SCRUB_RULES.map((rule) => [rule.name, 0]))\n}\n\nexport function addScrubCounts(into: ScrubCounts, from: ScrubCounts): ScrubCounts {\n  for (const [name, count] of Object.entries(from)) into[name] = (into[name] ?? 0) + count\n  return into\n}\n\nexport function scrubText(text: string, counts: ScrubCounts): string {\n  let out = text\n  for (const rule of SCRUB_RULES) {\n    out = out.replace(rule.pattern, (match: string, ...rest: unknown[]) => {\n      counts[rule.name] = (counts[rule.name] ?? 0) + 1\n      return rule.rewrite(match, typeof rest[0] === 'string' ? rest[0] : undefined)\n    })\n  }\n  return out\n}\n\nfunction scrubValue(value: unknown, counts: ScrubCounts): unknown {\n  if (typeof value === 'string') return scrubText(value, counts)\n  if (Array.isArray(value)) return value.map((item) => scrubValue(item, counts))\n  if (value !== null && typeof value === 'object') {\n    const out: Record<string, unknown> = {}\n    for (const [key, item] of Object.entries(value)) out[key] = scrubValue(item, counts)\n    return out\n  }\n  return value\n}\n\n/**\n * Scrub every string value in a line; structure and key order are preserved.\n *\n * `assertMinted` on the way out rather than a cast: scrubbing rebuilds the\n * object, so the brand has to be re-earned, and re-validating proves the rules\n * did not rewrite a field the schema constrains (`reward` is a number, not a\n * string, so no rule should ever touch it — this is what checks that).\n */\nfunction scrubRolloutLine(line: MintedRolloutLine, counts: ScrubCounts): MintedRolloutLine {\n  return assertMinted(scrubValue(line, counts), `scrubbed rollout line ${line.rollout_id}`)\n}\n\nexport function scrubLines(lines: MintedRolloutLine[]): {\n  lines: MintedRolloutLine[]\n  counts: ScrubCounts\n} {\n  const counts = emptyScrubCounts()\n  return { lines: lines.map((line) => scrubRolloutLine(line, counts)), counts }\n}\n\n/**\n * A `RolloutScrubber` (text → text) applying the full rule set — the\n * default hook to pass to `mintRolloutRows({ scrub })` so lines are\n * scrubbed at mint time, before they ever reach a ledger file. Release\n * builds re-run `scrubLines` regardless (idempotent), so double-scrubbing\n * is safe and counted as zero.\n */\nexport function defaultRolloutScrubber(text: string): string {\n  return scrubText(text, emptyScrubCounts())\n}\n","/**\n * One-command HuggingFace dataset release from rollout ledgers:\n *\n *   agent-eval rollout-release <ledger.jsonl...> --out <dir> \\\n *     [--formats sft,verifiers,rft,raw] [--include-proposers] [--push <org/name>]\n *\n * Pipeline per input ledger: read + validate → fail-closed filters\n * (trainable split only; proposer sessions dropped unless\n * --include-proposers, they contain improvement-loop harness source) →\n * deterministic scrub → export the requested formats + scrub-report.json +\n * auto-generated README.md card. Deterministic: same inputs and flags →\n * byte-identical output dir.\n *\n * --push uploads the built dir with `huggingface-cli upload` only when the\n * CLI exists on PATH and HF_TOKEN is present in the env; the token is\n * never printed. Everything else runs fully offline.\n */\n\nimport { spawnSync } from 'node:child_process'\nimport { mkdir, writeFile } from 'node:fs/promises'\nimport { basename, dirname, join } from 'node:path'\nimport { toJsonl, toRftItems, toSftRows, toVerifiersRolloutOutputs } from '../exporters'\nimport { readRolloutLedger, writeRolloutLedger } from '../ledger'\nimport { isTrainableSplit, type MintedRolloutLine } from '../schema'\nimport { buildDatasetCard, FORMAT_FILES, RELEASE_FORMATS, type ReleaseFormat } from './card'\nimport {\n  assertGateReport,\n  FORMAT_GATE_DISPOSITION,\n  type GateReport,\n  gatedRolloutIds,\n  measureFormatGate,\n  releaseRowRefs,\n} from './gate-report'\nimport { addScrubCounts, emptyScrubCounts, type ScrubCounts, scrubLines } from './scrub'\n\nexport interface BuildOptions {\n  out: string\n  formats: ReleaseFormat[]\n  includeProposers: boolean\n}\n\nexport interface ScrubReport {\n  /** Input ledger path → rule → rewrite count (only shipped lines are scrubbed). */\n  files: Record<string, ScrubCounts>\n  totals: ScrubCounts\n  excluded: { proposers: number; nonTrain: number }\n}\n\nexport interface BuildSummary {\n  inputs: string[]\n  read: number\n  kept: number\n  scrub: ScrubReport\n  formatCounts: Partial<Record<ReleaseFormat, number>>\n  /** Per-format anti-Goodhart accounting, measured on the rows written. */\n  gate: GateReport\n  files: string[]\n}\n\nexport async function buildHfDataset(\n  inputs: string[],\n  options: BuildOptions,\n): Promise<BuildSummary> {\n  if (inputs.length === 0) throw new Error('no input ledgers given')\n  if (options.formats.length === 0) throw new Error('no formats selected')\n\n  const report: ScrubReport = {\n    files: {},\n    totals: emptyScrubCounts(),\n    excluded: { proposers: 0, nonTrain: 0 },\n  }\n  const kept: MintedRolloutLine[] = []\n  let read = 0\n\n  for (const input of inputs) {\n    const lines = await readRolloutLedger(input)\n    read += lines.length\n    const shippable = lines.filter((line) => {\n      if (!isTrainableSplit(line.task.split)) {\n        report.excluded.nonTrain += 1\n        return false\n      }\n      if (!options.includeProposers && line.role === 'proposer') {\n        report.excluded.proposers += 1\n        return false\n      }\n      return true\n    })\n    const scrubbed = scrubLines(shippable)\n    report.files[input] = scrubbed.counts\n    addScrubCounts(report.totals, scrubbed.counts)\n    kept.push(...scrubbed.lines)\n  }\n\n  const formatCounts: Partial<Record<ReleaseFormat, number>> = {}\n  const files: string[] = []\n  const gated = gatedRolloutIds(kept)\n  const gate: GateReport = { gatedLines: gated.size, byFormat: {} }\n\n  // Every selected format's rows are exported and gate-measured BEFORE the\n  // first byte is written. A build that would ship a gamed run at a positive\n  // reward fails with nothing on disk, rather than leaving a poisoned config\n  // behind for someone to `--push`.\n  const pending: Array<{ path: string; write: () => Promise<void> }> = []\n\n  for (const format of options.formats) {\n    const path = join(options.out, FORMAT_FILES[format])\n    if (format === 'raw') {\n      // writeRolloutLedger re-validates every scrubbed line before it lands.\n      gate.byFormat.raw = measureFormatGate(gated, releaseRowRefs.raw(kept))\n      formatCounts.raw = kept.length\n      pending.push({ path, write: () => writeRolloutLedger(path, kept) })\n    } else if (format === 'sft') {\n      const rows = toSftRows(kept)\n      gate.byFormat.sft = measureFormatGate(gated, releaseRowRefs.sft(rows))\n      formatCounts.sft = rows.length\n      pending.push({ path, write: () => writeFile(path, toJsonl(rows)) })\n    } else if (format === 'verifiers') {\n      // The declared disposition drives the exporter: 'zero-and-flag' ships\n      // gated lines and honest failures as labeled negatives at reward 0.\n      const outputs = toVerifiersRolloutOutputs(kept, {\n        gatedLines: FORMAT_GATE_DISPOSITION.verifiers,\n      })\n      gate.byFormat.verifiers = measureFormatGate(gated, releaseRowRefs.verifiers(outputs))\n      formatCounts.verifiers = outputs.length\n      pending.push({ path, write: () => writeFile(path, toJsonl(outputs)) })\n    } else {\n      const items = toRftItems(kept, { gatedLines: FORMAT_GATE_DISPOSITION.rft })\n      gate.byFormat.rft = measureFormatGate(gated, releaseRowRefs.rft(items))\n      formatCounts.rft = items.length\n      pending.push({ path, write: () => writeFile(path, toJsonl(items)) })\n    }\n  }\n\n  assertGateReport(gate)\n\n  for (const { path, write } of pending) {\n    await mkdir(dirname(path), { recursive: true })\n    await write()\n    files.push(path)\n  }\n\n  const reportPath = join(options.out, 'scrub-report.json')\n  await writeFile(reportPath, `${JSON.stringify(report, null, 2)}\\n`)\n  files.push(reportPath)\n\n  const cardPath = join(options.out, 'README.md')\n  await writeFile(\n    cardPath,\n    buildDatasetCard({\n      lines: kept,\n      formats: options.formats,\n      includeProposers: options.includeProposers,\n      sourceFiles: inputs.map((input) => basename(input)),\n      scrubTotals: report.totals,\n      excluded: report.excluded,\n      formatCounts,\n      gate,\n    }),\n  )\n  files.push(cardPath)\n\n  return { inputs, read, kept: kept.length, scrub: report, formatCounts, gate, files }\n}\n\nfunction planPushCommand(repo: string, outDir: string): string[] {\n  return ['huggingface-cli', 'upload', repo, outDir, '.', '--repo-type', 'dataset']\n}\n\nfunction pushDataset(repo: string, outDir: string): void {\n  const found = spawnSync('which', ['huggingface-cli'], { stdio: 'ignore' })\n  if (found.status !== 0) {\n    throw new Error(\n      'huggingface-cli not found on PATH — install huggingface_hub[cli] before --push',\n    )\n  }\n  if (!process.env.HF_TOKEN) {\n    throw new Error('HF_TOKEN not present in env — refusing to push')\n  }\n  const [command, ...args] = planPushCommand(repo, outDir) as [string, ...string[]]\n  // Token stays in the inherited env; it is never echoed or interpolated.\n  const run = spawnSync(command, args, { stdio: 'inherit' })\n  if (run.status !== 0) throw new Error(`huggingface-cli upload exited ${String(run.status)}`)\n}\n\nexport interface RolloutReleaseCliArgs extends BuildOptions {\n  inputs: string[]\n  push: string | null\n}\n\nconst ROLLOUT_RELEASE_USAGE =\n  'usage: agent-eval rollout-release <ledger.jsonl...> --out <dir> [--formats sft,verifiers,rft,raw] [--include-proposers] [--push <org/name>]'\n\nfunction parseRolloutReleaseArgs(argv: string[]): RolloutReleaseCliArgs {\n  const args: RolloutReleaseCliArgs = {\n    inputs: [],\n    out: '',\n    formats: [...RELEASE_FORMATS],\n    includeProposers: false,\n    push: null,\n  }\n  for (let i = 0; i < argv.length; i++) {\n    const arg = argv[i]!\n    if (arg === '--out') {\n      args.out = argv[++i] ?? ''\n    } else if (arg === '--formats') {\n      const raw = (argv[++i] ?? '').split(',').filter(Boolean)\n      for (const format of raw) {\n        if (!RELEASE_FORMATS.includes(format as ReleaseFormat)) {\n          throw new Error(\n            `unknown format \"${format}\" — expected one of ${RELEASE_FORMATS.join(',')}`,\n          )\n        }\n      }\n      args.formats = raw as ReleaseFormat[]\n    } else if (arg === '--include-proposers') {\n      args.includeProposers = true\n    } else if (arg === '--push') {\n      args.push = argv[++i] ?? null\n    } else if (arg.startsWith('--')) {\n      throw new Error(`unknown flag \"${arg}\"`)\n    } else {\n      args.inputs.push(arg)\n    }\n  }\n  if (args.inputs.length === 0 || !args.out) {\n    throw new Error(ROLLOUT_RELEASE_USAGE)\n  }\n  if (args.push !== null && !/^[\\w.-]+\\/[\\w.-]+$/.test(args.push)) {\n    throw new Error(`--push expects <org/name>, got \"${args.push}\"`)\n  }\n  return args\n}\n\n/** CLI driver for `agent-eval rollout-release`. Returns the process exit code. */\nexport async function runRolloutReleaseCli(argv: string[]): Promise<number> {\n  let args: RolloutReleaseCliArgs\n  try {\n    args = parseRolloutReleaseArgs(argv)\n  } catch (error) {\n    process.stderr.write(`${error instanceof Error ? error.message : String(error)}\\n`)\n    return 2\n  }\n  const summary = await buildHfDataset(args.inputs, args)\n  process.stdout.write(\n    `${JSON.stringify(\n      {\n        read: summary.read,\n        kept: summary.kept,\n        formatCounts: summary.formatCounts,\n        gate: summary.gate,\n        scrub: summary.scrub,\n      },\n      null,\n      2,\n    )}\\n`,\n  )\n  process.stdout.write(`dataset → ${args.out} (${summary.files.length} files)\\n`)\n  if (args.push !== null) {\n    pushDataset(args.push, args.out)\n    process.stdout.write(`pushed → ${args.push}\\n`)\n  }\n  return 0\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoBA,SAAS,UAAU,OAA8B;CAC/C,KAAK,MAAM,CAAC,GAAG,SAAS,MAAM,QAAQ,GAAG,kBAAkB,MAAM,iBAAiB,EAAE,EAAE;CACtF,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,MAAM,SAAS,IAAI,OAAO;AAC3F;;AAGA,eAAsB,mBAAmB,MAAc,OAAqC;CAC1F,MAAM,UAAU,UAAU,KAAK;CAC/B,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,UAAU,MAAM,OAAO;AAC/B;;AAGA,eAAsB,mBAAmB,MAAc,OAAqC;CAC1F,IAAI,MAAM,WAAW,GAAG;CACxB,MAAM,UAAU,UAAU,KAAK;CAC/B,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,WAAW,MAAM,OAAO;AAChC;;;;;;;;;;;AAYA,eAAsB,kBAAkB,MAA4C;CAClF,OAAO,UAAU,OAAO,QAAQ,YAAY,aAAa,QAAQ,OAAO,CAAC;AAC3E;AAIA,eAAe,UACb,MACA,OACc;CACd,MAAM,MAAM,MAAM,SAAS,MAAM,MAAM;CACvC,MAAM,QAAa,CAAC;CACpB,MAAM,WAAW,IAAI,MAAM,IAAI;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,IAAI,CAAC,MAAM,KAAK,GAAG;EACnB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,IAAI;EAC1B,SAAS,OAAO;GACd,MAAM,IAAI,MACR,GAAG,KAAK,GAAG,IAAI,EAAE,qBAAqB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAC7F;EACF;EACA,MAAM,KAAK,MAAM,QAAQ,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC;CAC9C;CACA,OAAO;AACT;;;ACnBA,MAAa,0BAAkE;CAC7E,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;;AA2GA,SAAgB,gBAAgB,OAAkD;CAChF,OAAO,IAAI,IAAI,MAAM,QAAQ,SAAS,KAAK,QAAQ,cAAc,CAAC,CAAC,KAAK,SAAS,KAAK,UAAU,CAAC;AACnG;;;;;;;AAQA,MAAa,iBAAiB;CAI5B,MAAM,SACJ,KAAK,KAAK,SAAS;EACjB,YAAY,IAAI,SAAS;EACzB,QAAQ,IAAI,SAAS;EACrB,mBAAmB,IAAI,SAAS;CAClC,EAAE;CAIJ,YAAY,SACV,KAAK,KAAK,SAAS;EACjB,YAAY,IAAI,KAAK;EACrB,QAAQ,IAAI;EACZ,UAAU,IAAI;EACd,mBAAmB,IAAI,KAAK;CAC9B,EAAE;CAGJ,MAAM,SACJ,KAAK,KAAK,SAAS;EACjB,YAAY,IAAI,UAAU;EAC1B,QAAQ,IAAI,UAAU;EACtB,UAAU,IAAI,UAAU;EACxB,mBAAmB,IAAI,UAAU;CACnC,EAAE;CACJ,MAAM,UACJ,MAAM,KAAK,UAAU;EACnB,YAAY,KAAK;EACjB,QAAQ,KAAK,QAAQ;EAIrB,UAAU;GAAE,SAAS,KAAK,QAAQ;GAAS,SAAS,KAAK,QAAQ;EAAQ;EAGzE,cAAc,sBAAsB,KAAK,KAAK;EAC9C,mBAAmB,KAAK,QAAQ,qBAAqB;CACvD,EAAE;AACN;;AAGA,SAAS,kBAAkB,OAAgB,MAAiC;CAC1E,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,CAAC;EAAE;EAAM;CAAM,CAAC,IAAI,CAAC;CAEpE,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,SAAS,MAAM,MAAM,kBAAkB,MAAM,GAAG,KAAK,GAAG,EAAE,EAAE,CAAC;CAE5E,IAAI,OAAO,UAAU,YAAY,UAAU,MACzC,OAAO,OAAO,QAAQ,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,WAC1C,kBAAkB,OAAO,SAAS,KAAK,MAAM,GAAG,KAAK,GAAG,KAAK,CAC/D;CAEF,OAAO,CAAC;AACV;;AAGA,SAAgB,kBACd,OACA,MACkB;CAClB,MAAM,UAAU,KAAK,QAAQ,QAAQ,MAAM,IAAI,IAAI,UAAU,CAAC;CAC9D,MAAM,UAAU,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,CAAC,QAAQ,MAAmB,MAAM,IAAI;CACtF,MAAM,WAAW,QAAQ,SAAS,QAAQ,kBAAkB,IAAI,UAAU,EAAE,CAAC;CAC7E,MAAM,eAAe,QAAQ,SAAS,QAAQ,kBAAkB,IAAI,cAAc,OAAO,CAAC;CAC1F,MAAM,aAAa,KAChB,QAAQ,QAAQ,IAAI,sBAAsB,KAAK,CAAC,CAChD,KAAK,QAAQ,IAAI,MAAM,CAAC,CACxB,QAAQ,MAAmB,MAAM,QAAQ,IAAI,CAAC;CACjD,OAAO;EACL,OAAO,MAAM;EACb,SAAS,QAAQ;EACjB,UAAU,MAAM,OAAO,QAAQ;EAC/B,kBAAkB,QAAQ,WAAW,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO;EACnE,oBAAoB,SAAS,QAC1B,MAAM,UAAW,SAAS,QAAQ,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MACtE,IACF;EACA,wBAAwB,WAAW;EACnC,qBAAqB,WAAW,WAAW,IAAI,OAAO,KAAK,IAAI,GAAG,UAAU;EAC5E,wBAAwB,aAAa,QAClC,MAAM,UAAW,SAAS,QAAQ,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MACtE,IACF;CACF;AACF;;;;;;;;;;;;;AAcA,MAAM,kBAEF;CACF,wBAAwB,QAAQ,WAC9B,OAAO,qBAAqB,QAAQ,OAAO,oBAAoB,IAC3D,OACA,mBAAmB,OAAO,KAAK,OAAO,QAAQ,sDAC/B,OAAO,iBAAiB;CAE7C,mBAAmB,QAAQ,WAAW;EACpC,IAAI,OAAO,uBAAuB,MAAM,OAAO;EAC/C,MAAM,EAAE,MAAM,UAAU,OAAO;EAC/B,OACE,mBAAmB,OAAO,KAAK,OAAO,QAAQ,iEACpB,KAAK,KAAK,MAAM;CAK9C;CACA,4BAA4B,QAAQ,WAAW;EAC7C,IAAI,OAAO,2BAA2B,MAAM,OAAO;EACnD,MAAM,EAAE,MAAM,UAAU,OAAO;EAC/B,OACE,mBAAmB,OAAO,KAAK,OAAO,QAAQ,gHAC2B,KAAK,KAAK,MAAM;CAK7F;CACA,sBAAsB,QAAQ,WAC5B,OAAO,wBAAwB,OAC3B,OACA,mBAAmB,OAAO,KAAK,OAAO,uBAAuB,uCAC9C,OAAO,oBAAoB;AAIlD;;;;;;;;;;;;;;;;AAiBA,SAAgB,iBAAiB,QAA0B;CACzD,KAAK,MAAM,CAAC,QAAQ,WAAW,OAAO,QAAQ,OAAO,QAAQ,GAE1D;EACD,KAAK,MAAM,MAAM,gBAAgB;GAC/B,IAAI,cAAc,iBAAiB,GAAG,CAAC,SAAS,WAAW;GAC3D,MAAM,UAAU,gBAAgB,GAAG,CAAC,QAAQ,MAAM;GAClD,IAAI,YAAY,MAAM,MAAM,IAAI,MAAM,OAAO;EAC/C;EAIA,IAAI,wBAAwB,YAAY,aAAa,OAAO,UAAU,GACpE,MAAM,IAAI,MACR,mBAAmB,OAAO,4CAA4C,OAAO,QAAQ,UAEvF;CAEJ;AACF;;;;;;;;;;;;ACxVA,MAAa,kBAAkB;CAAC;CAAO;CAAa;CAAO;AAAK;;AAIhE,MAAa,eAA8C;CACzD,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;AAEA,MAAM,sBAAqD;CACzD,KAAK;CACL,WACE;CACF,KAAK;CACL,KAAK,UAAU,eAAe;AAChC;AAqBA,SAAS,OAAO,QAAwC;CACtD,OAAO,CAAC,GAAG,IAAI,IAAI,OAAO,QAAQ,MAAmB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;AAC1E;AAEA,SAAS,aAAa,QAA+B;CACnD,IAAI,WAAW,MAAM,OAAO;CAC5B,OAAO,OAAO,UAAU,MAAM,IAAI,OAAO,MAAM,IAAI,OAAO,QAAQ,CAAC;AACrE;AAEA,SAAS,cAAc,QAAkB,MAA0B;CACjE,OAAO;EACL,KAAK,OAAO,KAAK,KAAK,EAAE;EACxB,KAAK,OAAO,UAAU,KAAK,CAAC,CAAC,KAAK,KAAK,EAAE;EACzC,GAAG,KAAK,KAAK,QAAQ,KAAK,IAAI,KAAK,KAAK,EAAE,GAAG;CAC/C,CAAC,CAAC,KAAK,IAAI;AACb;;AAGA,MAAM,kBAAiD;CACrD,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;AAEA,MAAM,oBAAmD;CACvD,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;AAEA,SAAS,YAAY,SAA0B,MAAkB,YAA4B;CAC3F,MAAM,OAAO,QAAQ,KAAK,WAAW;EACnC,MAAM,SAAS,KAAK,SAAS;EAC7B,OAAO;GACL;GACA,kBAAkB;GAClB,OAAO,QAAQ,WAAW,CAAC;GAC3B,OAAO,QAAQ,YAAY,CAAC;GAC5B,QAAQ,qBAAqB,QAAQ,WAAW,KAAA,IAC5C,MACA,aAAa,OAAO,gBAAgB;GACxC,QAAQ,sBAAsB,OAC1B,MACA,GAAG,OAAO,mBAAmB,KAAK,KAAK,OAAO,mBAAmB;GACrE,gBAAgB;EAClB;CACF,CAAC;CACD,MAAM,iBAAiB,QAAQ,MAC5B,WAAW,wBAAwB,YAAY,eAClD;CACA,OAAO;EACL,kIAAkI,KAAK,WAAW,MAAM,WAAW;EACnK;EACA;EACA;EACA;EACA;EACA,cACE;GACE;GACA;GACA;GACA;GACA;GACA;GACA;EACF,GACA,IACF;EACA;EACA;EACA;EACA;EACA,iBACI,qLACA;CACN,CAAC,CACE,KAAK,IAAI,CAAC,CACV,QAAQ;AACb;AAEA,SAAS,eAAe,OAAwC;CAC9D,MAAM,yBAAS,IAAI,IAAsC;CACzD,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,OAAO,IAAI,KAAK,IAAI,qBAAK,IAAI,IAAoB;EAClE,MAAM,MAAM,aAAa,KAAK,QAAQ,MAAM;EAC5C,SAAS,IAAI,MAAM,SAAS,IAAI,GAAG,KAAK,KAAK,CAAC;EAC9C,OAAO,IAAI,KAAK,MAAM,QAAQ;CAChC;CACA,MAAM,OAAmB,CAAC;CAC1B,KAAK,MAAM,QAAQ,eAAe;EAChC,MAAM,WAAW,OAAO,IAAI,IAAI;EAChC,IAAI,CAAC,UAAU;EACf,MAAM,OAAO,CAAC,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;GAC/C,IAAI,MAAM,QAAQ,OAAO;GACzB,IAAI,MAAM,QAAQ,OAAO;GACzB,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;EAC7B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM,KAAK,KAAK;GAAC;GAAM;GAAK,OAAO,SAAS,IAAI,GAAG,CAAC;EAAC,CAAC;CAC1E;CACA,OAAO;AACT;AAEA,SAAgB,iBAAiB,QAAmC;CAClE,MAAM,EACJ,OACA,SACA,kBACA,aACA,aACA,UACA,cACA,SACE;CAGJ,iBAAiB,IAAI;CAErB,MAAM,SAAS,OAAO,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;CACtD,MAAM,cAAc,CAAC,GAAG,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CACnE,QAAQ,MAAmB,MAAM,IAAI,CAAC,CACtC,MAAM,GAAG,MAAM,IAAI,CAAC;CACvB,MAAM,SAAS,OAAO,MAAM,KAAK,SAAS,KAAK,OAAO,KAAK,CAAC;CAC5D,MAAM,YAAY,OAAO,MAAM,KAAK,SAAS,KAAK,OAAO,OAAO,CAAC;CACjE,MAAM,WAAW,OAAO,MAAM,KAAK,SAAS,KAAK,WAAW,OAAO,CAAC;CACpE,MAAM,gBAAgB,OAAO,MAAM,KAAK,SAAS,KAAK,QAAQ,aAAa,CAAC;CAC5E,MAAM,WAAW,MAAM,QAAQ,SAAS,KAAK,SAAS,WAAW,CAAC,CAAC,CAAC;CACpE,MAAM,aAAa,MAAM,QAAQ,SAAS,KAAK,QAAQ,cAAc,CAAC,CAAC;CACvE,IAAI,eAAe,KAAK,YACtB,MAAM,IAAI,MACR,oCAAoC,KAAK,WAAW,6DAC1B,WAAW,mDACvC;CAcF,MAAM,cAAc;EAClB;EACA;EACA;EACA;EAfc,QACb,KAAK,WACJ;GACE,oBAAoB;GACpB;GACA;GACA,iBAAiB,aAAa;EAChC,CAAC,CAAC,KAAK,IAAI,CACb,CAAC,CACA,KAAK,IAOA;EACN;CACF,CAAC,CAAC,KAAK,IAAI;CAEX,MAAM,eAAe,cACnB;EAAC;EAAU;EAAQ;EAAQ;CAAU,GACrC,QAAQ,KAAK,WAAW;EACtB;EACA,KAAK,aAAa,QAAQ;EAC1B,OAAO,aAAa,WAAW,CAAC;EAChC,oBAAoB;CACtB,CAAC,CACH;CAEA,MAAM,cAAc,cAAc;EAAC;EAAQ;EAAU;CAAO,GAAG,eAAe,KAAK,CAAC;CAEpF,MAAM,aAAa,cACjB,CAAC,QAAQ,UAAU,GACnB,OAAO,QAAQ,WAAW,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC,CAC1E;CAEA,MAAM,eAAe,mBACjB,uHACA,8CAA8C,SAAS,UAAU;CAErE,OAAO,GAAG,YAAY;;;;gIAIwG,eAAe;;6NAE8E,SAAS,SAAS;;;;EAI7O,aAAa;;;;EAIb,YAAY,SAAS,MAAM,MAAM,MAAM,EAAE;;eAE5B,eAAe;;;;;;;sBAOR,cAAc,KAAK,SAAS,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;;;qPAGyK,SAAS;;;;;;;oBAO1O,YAAY,KAAK,SAAS,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;aAC3D,OAAO,KAAK,OAAO,KAAK,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;iBACvC,YAAY,KAAK,IAAI,EAAE;YAC5B,OAAO,KAAK,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;eACtC,UAAU,KAAK,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;mBACxC,SAAS,KAAK,IAAI,EAAE;2EACoC,cAAc,KAAK,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;;EAEzH,aAAa;;;;;;;;;;;;EAYb,YAAY;;eAEC,MAAM,OAAO;;;;;;EAM1B,WAAW;;;;;;;;;;;;;;;;;AAiBb;;;;;;;;;;;;;;AC/RA,MAAM,cAAoC;CACxC;EAEE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;CACA;EAGE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;CACA;EAEE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;CACA;EAGE,MAAM;EACN,SACE;EACF,UAAU,QAAQ,WAAW,GAAG,OAAO;CACzC;CACA;EAGE,MAAM;EACN,SACE;EACF,UAAU,QAAQ,SAAS,GAAG,KAAK;CACrC;CACA;EACE,MAAM;EACN,SAAS;EACT,UAAU,QAAQ,WAAW,GAAG,OAAO;CACzC;CACA;EAGE,MAAM;EACN,SACE;EACF,eAAe;CACjB;CACA;EAGE,MAAM;EACN,SAAS;EACT,UAAU,QAAQ,WAAW,GAAG,UAAU,GAAG;CAC/C;CACA;EAGE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;AACF;AAKA,SAAgB,mBAAgC;CAC9C,OAAO,OAAO,YAAY,YAAY,KAAK,SAAS,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;AACrE;AAEA,SAAgB,eAAe,MAAmB,MAAgC;CAChF,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,IAAI,GAAG,KAAK,SAAS,KAAK,SAAS,KAAK;CACnF,OAAO;AACT;AAEA,SAAgB,UAAU,MAAc,QAA6B;CACnE,IAAI,MAAM;CACV,KAAK,MAAM,QAAQ,aACjB,MAAM,IAAI,QAAQ,KAAK,UAAU,OAAe,GAAG,SAAoB;EACrE,OAAO,KAAK,SAAS,OAAO,KAAK,SAAS,KAAK;EAC/C,OAAO,KAAK,QAAQ,OAAO,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,KAAA,CAAS;CAC9E,CAAC;CAEH,OAAO;AACT;AAEA,SAAS,WAAW,OAAgB,QAA8B;CAChE,IAAI,OAAO,UAAU,UAAU,OAAO,UAAU,OAAO,MAAM;CAC7D,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,KAAK,SAAS,WAAW,MAAM,MAAM,CAAC;CAC7E,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EAC/C,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG,IAAI,OAAO,WAAW,MAAM,MAAM;EACnF,OAAO;CACT;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAS,iBAAiB,MAAyB,QAAwC;CACzF,OAAO,aAAa,WAAW,MAAM,MAAM,GAAG,yBAAyB,KAAK,YAAY;AAC1F;AAEA,SAAgB,WAAW,OAGzB;CACA,MAAM,SAAS,iBAAiB;CAChC,OAAO;EAAE,OAAO,MAAM,KAAK,SAAS,iBAAiB,MAAM,MAAM,CAAC;EAAG;CAAO;AAC9E;;;;;;;;AASA,SAAgB,uBAAuB,MAAsB;CAC3D,OAAO,UAAU,MAAM,iBAAiB,CAAC;AAC3C;;;;;;;;;;;;;;;;;;;;AC1FA,eAAsB,eACpB,QACA,SACuB;CACvB,IAAI,OAAO,WAAW,GAAG,MAAM,IAAI,MAAM,wBAAwB;CACjE,IAAI,QAAQ,QAAQ,WAAW,GAAG,MAAM,IAAI,MAAM,qBAAqB;CAEvE,MAAM,SAAsB;EAC1B,OAAO,CAAC;EACR,QAAQ,iBAAiB;EACzB,UAAU;GAAE,WAAW;GAAG,UAAU;EAAE;CACxC;CACA,MAAM,OAA4B,CAAC;CACnC,IAAI,OAAO;CAEX,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,QAAQ,MAAM,kBAAkB,KAAK;EAC3C,QAAQ,MAAM;EAYd,MAAM,WAAW,WAXC,MAAM,QAAQ,SAAS;GACvC,IAAI,CAAC,iBAAiB,KAAK,KAAK,KAAK,GAAG;IACtC,OAAO,SAAS,YAAY;IAC5B,OAAO;GACT;GACA,IAAI,CAAC,QAAQ,oBAAoB,KAAK,SAAS,YAAY;IACzD,OAAO,SAAS,aAAa;IAC7B,OAAO;GACT;GACA,OAAO;EACT,CAC4B,CAAS;EACrC,OAAO,MAAM,SAAS,SAAS;EAC/B,eAAe,OAAO,QAAQ,SAAS,MAAM;EAC7C,KAAK,KAAK,GAAG,SAAS,KAAK;CAC7B;CAEA,MAAM,eAAuD,CAAC;CAC9D,MAAM,QAAkB,CAAC;CACzB,MAAM,QAAQ,gBAAgB,IAAI;CAClC,MAAM,OAAmB;EAAE,YAAY,MAAM;EAAM,UAAU,CAAC;CAAE;CAMhE,MAAM,UAA+D,CAAC;CAEtE,KAAK,MAAM,UAAU,QAAQ,SAAS;EACpC,MAAM,OAAO,KAAK,QAAQ,KAAK,aAAa,OAAO;EACnD,IAAI,WAAW,OAAO;GAEpB,KAAK,SAAS,MAAM,kBAAkB,OAAO,eAAe,IAAI,IAAI,CAAC;GACrE,aAAa,MAAM,KAAK;GACxB,QAAQ,KAAK;IAAE;IAAM,aAAa,mBAAmB,MAAM,IAAI;GAAE,CAAC;EACpE,OAAO,IAAI,WAAW,OAAO;GAC3B,MAAM,OAAO,UAAU,IAAI;GAC3B,KAAK,SAAS,MAAM,kBAAkB,OAAO,eAAe,IAAI,IAAI,CAAC;GACrE,aAAa,MAAM,KAAK;GACxB,QAAQ,KAAK;IAAE;IAAM,aAAa,UAAU,MAAM,QAAQ,IAAI,CAAC;GAAE,CAAC;EACpE,OAAO,IAAI,WAAW,aAAa;GAGjC,MAAM,UAAU,0BAA0B,MAAM,EAC9C,YAAY,wBAAwB,UACtC,CAAC;GACD,KAAK,SAAS,YAAY,kBAAkB,OAAO,eAAe,UAAU,OAAO,CAAC;GACpF,aAAa,YAAY,QAAQ;GACjC,QAAQ,KAAK;IAAE;IAAM,aAAa,UAAU,MAAM,QAAQ,OAAO,CAAC;GAAE,CAAC;EACvE,OAAO;GACL,MAAM,QAAQ,WAAW,MAAM,EAAE,YAAY,wBAAwB,IAAI,CAAC;GAC1E,KAAK,SAAS,MAAM,kBAAkB,OAAO,eAAe,IAAI,KAAK,CAAC;GACtE,aAAa,MAAM,MAAM;GACzB,QAAQ,KAAK;IAAE;IAAM,aAAa,UAAU,MAAM,QAAQ,KAAK,CAAC;GAAE,CAAC;EACrE;CACF;CAEA,iBAAiB,IAAI;CAErB,KAAK,MAAM,EAAE,MAAM,WAAW,SAAS;EACrC,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;EAC9C,MAAM,MAAM;EACZ,MAAM,KAAK,IAAI;CACjB;CAEA,MAAM,aAAa,KAAK,QAAQ,KAAK,mBAAmB;CACxD,MAAM,UAAU,YAAY,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,GAAG;CAClE,MAAM,KAAK,UAAU;CAErB,MAAM,WAAW,KAAK,QAAQ,KAAK,WAAW;CAC9C,MAAM,UACJ,UACA,iBAAiB;EACf,OAAO;EACP,SAAS,QAAQ;EACjB,kBAAkB,QAAQ;EAC1B,aAAa,OAAO,KAAK,UAAU,SAAS,KAAK,CAAC;EAClD,aAAa,OAAO;EACpB,UAAU,OAAO;EACjB;EACA;CACF,CAAC,CACH;CACA,MAAM,KAAK,QAAQ;CAEnB,OAAO;EAAE;EAAQ;EAAM,MAAM,KAAK;EAAQ,OAAO;EAAQ;EAAc;EAAM;CAAM;AACrF;AAEA,SAAS,gBAAgB,MAAc,QAA0B;CAC/D,OAAO;EAAC;EAAmB;EAAU;EAAM;EAAQ;EAAK;EAAe;CAAS;AAClF;AAEA,SAAS,YAAY,MAAc,QAAsB;CAEvD,IADc,UAAU,SAAS,CAAC,iBAAiB,GAAG,EAAE,OAAO,SAAS,CAChE,CAAC,CAAC,WAAW,GACnB,MAAM,IAAI,MACR,gFACF;CAEF,IAAI,CAAC,QAAQ,IAAI,UACf,MAAM,IAAI,MAAM,gDAAgD;CAElE,MAAM,CAAC,SAAS,GAAG,QAAQ,gBAAgB,MAAM,MAAM;CAEvD,MAAM,MAAM,UAAU,SAAS,MAAM,EAAE,OAAO,UAAU,CAAC;CACzD,IAAI,IAAI,WAAW,GAAG,MAAM,IAAI,MAAM,iCAAiC,OAAO,IAAI,MAAM,GAAG;AAC7F;AAOA,MAAM,wBACJ;AAEF,SAAS,wBAAwB,MAAuC;CACtE,MAAM,OAA8B;EAClC,QAAQ,CAAC;EACT,KAAK;EACL,SAAS,CAAC,GAAG,eAAe;EAC5B,kBAAkB;EAClB,MAAM;CACR;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,SACV,KAAK,MAAM,KAAK,EAAE,MAAM;OACnB,IAAI,QAAQ,aAAa;GAC9B,MAAM,OAAO,KAAK,EAAE,MAAM,GAAA,CAAI,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO;GACvD,KAAK,MAAM,UAAU,KACnB,IAAI,CAAC,gBAAgB,SAAS,MAAuB,GACnD,MAAM,IAAI,MACR,mBAAmB,OAAO,sBAAsB,gBAAgB,KAAK,GAAG,GAC1E;GAGJ,KAAK,UAAU;EACjB,OAAO,IAAI,QAAQ,uBACjB,KAAK,mBAAmB;OACnB,IAAI,QAAQ,UACjB,KAAK,OAAO,KAAK,EAAE,MAAM;OACpB,IAAI,IAAI,WAAW,IAAI,GAC5B,MAAM,IAAI,MAAM,iBAAiB,IAAI,EAAE;OAEvC,KAAK,OAAO,KAAK,GAAG;CAExB;CACA,IAAI,KAAK,OAAO,WAAW,KAAK,CAAC,KAAK,KACpC,MAAM,IAAI,MAAM,qBAAqB;CAEvC,IAAI,KAAK,SAAS,QAAQ,CAAC,qBAAqB,KAAK,KAAK,IAAI,GAC5D,MAAM,IAAI,MAAM,mCAAmC,KAAK,KAAK,EAAE;CAEjE,OAAO;AACT;;AAGA,eAAsB,qBAAqB,MAAiC;CAC1E,IAAI;CACJ,IAAI;EACF,OAAO,wBAAwB,IAAI;CACrC,SAAS,OAAO;EACd,QAAQ,OAAO,MAAM,GAAG,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,EAAE,GAAG;EAClF,OAAO;CACT;CACA,MAAM,UAAU,MAAM,eAAe,KAAK,QAAQ,IAAI;CACtD,QAAQ,OAAO,MACb,GAAG,KAAK,UACN;EACE,MAAM,QAAQ;EACd,MAAM,QAAQ;EACd,cAAc,QAAQ;EACtB,MAAM,QAAQ;EACd,OAAO,QAAQ;CACjB,GACA,MACA,CACF,EAAE,GACJ;CACA,QAAQ,OAAO,MAAM,aAAa,KAAK,IAAI,IAAI,QAAQ,MAAM,OAAO,UAAU;CAC9E,IAAI,KAAK,SAAS,MAAM;EACtB,YAAY,KAAK,MAAM,KAAK,GAAG;EAC/B,QAAQ,OAAO,MAAM,YAAY,KAAK,KAAK,GAAG;CAChD;CACA,OAAO;AACT"}

package/dist/index-CHxwfW5g.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-CHxwfW5g.d.ts","names":[],"sources":["../src/matrix/cell-spend.ts","../src/matrix/types.ts","../src/matrix/runner.ts"],"mappings":";;;;;;;;;;;;;;;;;;UAsBiB;;;;EAIf;;EAEA;;;;EAIA;;;;;;;;;;;;;;;;iBAiBc,cAAc,gBAAgB,OAAO;;;;;UC/BpC,WAAW;;EAE1B;;EAEA,QAAQ;IAAQ;IAAY,OAAO;;;;EAGnC,SAAS,OAAO,GAAG;;;UAIJ;EACf,MAAM;IAAiB;IAAY;;;EAEnC;;EAEA;;UAGe,WAAW;EAC1B,QAAQ;EACR,SAAS;;;;EAIT;EACA;EACA;;;;;;;;;;;EAWA,iBAAiB;;;;EAIjB;IAAU;IAAiB;;;UAGZ;EACf;EACA;EACA;EACA;EACA;EACA;EACA;;;EAGA;;EAEA;EACA;;UAGe,aAAa;EAC5B,OAAO;IAAQ,MAAM;IAAY,MAAM,WAAW;;;;EAGlD,QAAQ,eAAe,eAAe;EACtC;IACE;IACA;;;IAGA;IACA;IACA;;;;IAIA;;;;IAIA;;;;IAIA;IACA;;;EAGF;;UAGe,sBAAsB;EACrC,MAAM;;;;;;EAMN,UAAU,MAAM,eAAe,QAAQ,WAAW;;EAElD;;EAEA,UAAU,MAAM,KAAK;;EAErB;;EAEA;;;;;EAKA;;;;;;;;;;;;;EAaA;;EAEA,kBAAkB,MAAM,YAAY,QAAQ,WAAW;;;EAGvD,SAAS;;;;iBC1BW,eAAe,QACnC,MAAM,sBAAsB,UAC3B,QAAQ,aAAa"}

package/dist/index-CTIRz-AB.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-CTIRz-AB.d.ts","names":[],"sources":["../src/semantic-concept-judge.ts","../src/analyst/chat-trace-engine.ts","../src/analyst/trace-tool-callback.ts","../src/analyst/dspy-rlm-engine.ts","../src/analyst/finding-subject.ts","../src/analyst/kinds/control-integrity.ts","../src/analyst/kinds/failure-mode.ts","../src/analyst/kinds/improvement.ts","../src/analyst/kinds/knowledge-gap.ts","../src/analyst/kinds/knowledge-poisoning.ts","../src/analyst/kinds/index.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAuDY;UAEK;EACf;;EAEA;;EAEA;;EAEA,aAAa;;UAGE;EACf;EACA;;EAEA;EACA;EACA,UAAU;;UAGK;;EAEf;;EAEA;;EAEA,aAAa;IAAQ;IAAc;;;EAEnC,kBAAkB;;EAElB;EACA;;UAGe;EACf;EACA;;EAEA;EACA;EACA;EACA,UAAU;EACV;EACA;EACA;;EAEA;EACA;;;;;;;;KASU;UAQK;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,MAAM;;EAEN,UAAU;EACV,aAAa;EACb;EACA,WAAW;EACX,SAAS;;;;;;EAMT,iBAAiB;;EAEjB,oBAAoB,QAAQ,OAAO;;cAKxB;;;;;;iBAkGS,wBACpB,OAAO,2BACP,SAAS,8BACR,QAAQ;;;UChMM;;;;;EAKf,MAAM;;EAEN;;EAEA,UAAU;;EAEV;;EAEA;;EAEA,WAAW;;EAEX;;;;;;;;;;EAUA;;;;;;iBAkCc,sBAAsB,SAAS,yBAAyB;;;KCrG5D,0BAA0B;;;UCYrB;;EAEf,MAAM;;EAEN;;EAEA,kBAAkB,aAAa;EAC/B;;EAEA,UAAU;;EAEV;;EAEA;;;;;;EAMA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,kBAAkB,QAAQ;;EAE1B;;;;;;;;;;EAUA;;EAEA,SAAS;;EAET;;;iBAIc,yBAAyB,SAAS,4BAA4B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KCvClE;EAEN;EAAwB;EAAc;;EACtC;EAAyB;;EACzB;EAAuB;;EACvB;EAAyB;;EAGzB;EAAuB;;EACvB;EAAe;;EACf;EAAkB;EAAc;;EAChC;EAAkB;;EAClB;EAAa;EAAgB;;EAC7B;EAAc;;EACd;EAAkB;;EAClB;EAAkB;;EAClB;EAAwB;;EACxB;EAAuB;;EACvB;EAAc;;EACd;EAAa;EAAgB;;EAC7B;EAAgB;;EAChB;EAAqB;;EACrB;EAAuB;;EAEvB;EAA4B;;EAC5B;EAA2B;;EAE3B;EAAiB;;KAEX,qBAAqB;cAEpB,uBAAuB,cAAc;;;;;;;;;;;;;;;;;iBA0FlC,oBAAoB,iCAAiC;;;;;;;iBAoHrD,qBAAqB,GAAG;;;;;;;;;;cA8D3B,wBAAwB,SAAS,OAAO;;;;;;;;;cAoExC,wBAAwB,eAAe,cAAc;;iBAqElD,+BAA+B;;;;iBCvc/B,6BACd,OAAO,uBAAuB,mBAC9B,qBACC;;cA4BU,mCACA,oBAAoB,uBAAuB;WAE7C;WACA;WAEA;WACA;IAAS;IAAgC;;WACzC;WACA;aACP;aACA;;EAGI,QACJ,OAAO,uBAAuB,mBAC9B,KAAK,iBACJ,QAAQ;;cAUA,2BAAyB;;;cCHzB,wBAAwB;;;cC3BxB,uBAAuB;;;cCGvB,yBAAyB;;;cCPzB,+BAA+B;;;;;;;;;;;;cCP/B,sCAAsC"}

package/dist/index-CalAsXMR.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-CalAsXMR.d.ts","names":[],"sources":["../src/ledger-core/atomic-file-lock.ts","../src/ledger-core/journal-file.ts","../src/ledger-core/trusted-head.ts","../src/ledger-core/journal.ts","../src/ledger-core/merkle.ts","../src/ledger-core/projector-snapshot.ts"],"mappings":";;;;;;;UA8BiB,4BAA4B;WAClC;;UAGM;WACN,OAAO;EAChB;;KAGU;WACG;WAA0B;WAAyB,QAAQ;;WAC3D;WAA0B;;KAE7B;WACG;WAAyB,MAAM;IAC1C;UAEa;WACN;WACA;;;;;;;;iBA8BK,yBACd,SAAS,wBACR;;;;;UC/Dc;;EAEf;EACA,eAAe,iBAAiB;IAAY;MAAoB;;;;;iBAkDlD,0BACd,cACA,kBACA,SAAS;KA6CC,eAAe;EAAO;EAAgB,OAAO;;EAAQ;;iBAEjD,sBAAsB,GACpC,cACA,SAAS,mBACT,WAAW,IACV,eAAe;;;;UCnED;EACf;EACA,WAAW;;;UAII;EACf;EACA,WAAW;;;;;;;;KA8FD;EACN;EAAe,MAAM;EAAmB;;EACxC;EAAe;EAAY;EAAoB;;EAC/C;EAAgB;;;UAsCL;;EAEf;;;EAGA;;;;;UC7Ie;EACf;;;;;UAMe,kBAAkB,cAAc;EAC/C;EACA,cAAc;EACd,OAAO;EACP,WAAW;;KAGD,cAAc,uBAAuB,cAAc,mBAAmB,SAChF,kBAAkB;UAEH;EACf;EACA;;;;;;;;;;UAWe,gBAAgB,OAAO;EACtC,MAAM,OAAO,OAAO;;;;EAIpB,YAAY;;;;;;;;;;UAWG,6BAA6B,OAAO;EACnD,UAAU,YAAY;EACtB,QAAQ,sBAAsB,gBAAgB,OAAO;;UAGtC,mBACf,uBACA,cAAc,iBACd,oBACQ;;EAER,QAAQ;EACR,cAAc,kBAAkB;;;;;;EAMhC,WAAW,cAAc,SAAS,oBAAoB,cAAc,QAAQ;;EAE5E,iBAAiB,OAAO,cAAc,QAAQ,QAAQ;EACtD,mBAAmB,gBAAgB,cAAc,QAAQ,QAAQ;EACjE,qBAAqB,6BAA6B,cAAc,QAAQ,QAAQ;;UAGjE,mBAAmB,OAAO;EACzC,OAAO;;EAEP;EACA,YAAY;;UAGG;;;;;;;;;;;;;;EAcf;;UAGe;;;;;;;EAOf;;;;;;EAMA;IAAsB;;;;;;cA2CX,kBAAkB,uBAAuB,cAAc,iBAAiB;WAC1E;;WAEA;;;WAGA;mBACQ;mBACA;mBACA;mBACA;UACT;EAER,YACE,cACA,OAAO,mBAAmB,QAAQ,OAAO,aACzC,UAAS;EAcL,UAAU,QAAQ;EAIlB,OACJ,OAAO,OACP,UAAS,sBACR,QAAQ,mBAAmB,cAAc,QAAQ,QAAQ;;EA+CtD,eAAe,QAAQ;;;;EAWvB,kBAAkB,QAAQ;;;;;;;;EAkC1B,oBAAoB,QAAQ;;;;UAsB1B;;;;UAgBA;UAwCA;;;;;;;;;;;;;UA2CA;;;;;;;;UAuBA;;;;UAiBA;;;;;;;;;;;;;;;UAwBA;;;;;;UAqIA;;;;UA+CO;EACf,KAAK;EACL,MAAM,cAAc;;;;;UC9qBL;WACN;WACA;WACA,eAAe;;;UAIT;WACN;WACA;WACA,eAAe;;KAGd;WACG;;WACA;WAA0B;;;iBAWzB;;;;;iBAQA,eAAe,SAAS,qBAAqB,gBAAgB;;iBAU7D,WAAW,iBAAiB,eAAe;;iBAM3C,qBACd,iBAAiB,cACjB,oBACC;;iBAea,sBACd,MAAM,YACN,OAAO,sBACP,MAAM,aACL;;;;UCtDc;EACf,MAAM;;;;EAIN;;EAEA"}