@tangle-network/agent-eval 0.93.0 → 0.95.0

package/dist/scorecard.d.ts

@@ -0,0 +1,133 @@
+/**
+ * @stable
+ *
+ * Eval scorecard — the persistent (persona × profile) score timeline.
+ *
+ * Every benchmark run folds into per-cell entries; a cell is
+ * `(scenarioId, profileHash)` and its timeline carries one entry per commit.
+ * The scorecard answers the question a single run cannot: did THIS change
+ * regress persona P on profile F, even while the aggregate improved?
+ *
+ * Storage is an append-only JSONL log — one line per (cell, commit). Appends
+ * never read-modify-write, so concurrent campaign runs cannot clobber each
+ * other; `loadScorecard` folds the log into the queryable `Scorecard`, and a
+ * malformed line never breaks the read. `diffScorecard` compares the latest
+ * entry of each cell against its predecessor with Cohen's d + Welch's t-test.
+ */
+import type { AgentProfile } from './agent-profile';
+import type { RunRecord } from './run-record';
+/** One commit's measurement of one (scenario, profile) cell. */
+export interface ScorecardEntry {
+    commitSha: string;
+    /** ISO timestamp the entry was recorded. */
+    timestamp: string;
+    /** Per-seed (or per-rep) scores for this cell at this commit. */
+    scores: number[];
+    /** Median of `scores` — the cell's headline score for the commit. */
+    composite: number;
+    /** Per-dimension means, when the runs carried a judge breakdown. */
+    perDimension?: Record<string, number>;
+    /** RunRecord ids folded into this entry — provenance. */
+    runIds: string[];
+}
+/** A (scenario, profile) cell and its commit-ordered score timeline. */
+export interface ScorecardCell {
+    scenarioId: string;
+    profileHash: string;
+    /** Model id — denormalised from the profile for readable filtering. */
+    model: string;
+    timeline: ScorecardEntry[];
+}
+/** The folded scorecard: every cell, plus the profile definitions by hash. */
+export interface Scorecard {
+    cells: ScorecardCell[];
+    /** Profile definitions seen — keeps the scorecard self-describing. */
+    profiles: Record<string, AgentProfile>;
+}
+/** One append-only log line — a single cell's entry for a single commit. */
+export interface ScorecardLogLine {
+    scenarioId: string;
+    profileHash: string;
+    model: string;
+    profile: AgentProfile;
+    entry: ScorecardEntry;
+}
+export interface RecordRunsOptions {
+    /** The profile that produced these runs — keys the cell. */
+    profile: AgentProfile;
+    commitSha: string;
+    /** Defaults to `new Date().toISOString()`. */
+    timestamp?: string;
+}
+/**
+ * Fold a benchmark's `RunRecord[]` into per-cell scorecard log lines — one
+ * line per scenario the runs cover. All runs are attributed to the single
+ * `profile` in `opts` (the harness ran them under it); the cell key is
+ * `(scenarioId, agentProfileHash(profile))`.
+ */
+export declare function recordRuns(runs: RunRecord[], opts: RecordRunsOptions): ScorecardLogLine[];
+/** Append cell entries to the JSONL scorecard log. Creates the file/dir. */
+export declare function appendScorecard(logPath: string, lines: ScorecardLogLine[]): void;
+/** Record runs and append them to the log in one call. Returns the lines. */
+export declare function recordRunsToScorecard(logPath: string, runs: RunRecord[], opts: RecordRunsOptions): ScorecardLogLine[];
+/**
+ * Fold the JSONL log into a queryable `Scorecard`. A missing file yields an
+ * empty scorecard; a malformed line is skipped — a corrupt append never
+ * breaks the read. Each cell's timeline is sorted chronologically.
+ */
+export declare function loadScorecard(logPath: string): Scorecard;
+export type CellVerdict = 'improved' | 'regressed' | 'flat' | 'new';
+export interface ScorecardCellDiff {
+    scenarioId: string;
+    profileHash: string;
+    model: string;
+    verdict: CellVerdict;
+    /** Composite of the latest entry. */
+    current: number;
+    /** Composite of the comparison entry — `null` when `verdict === 'new'`. */
+    baseline: number | null;
+    /** `current − baseline` — `null` when new. */
+    delta: number | null;
+    /** Cohen's d of current vs baseline samples — `null` when new or n < 2. */
+    cohensD: number | null;
+    /** Welch's t-test p-value — `null` when new or n < 2. */
+    pValue: number | null;
+    currentCommit: string;
+    baselineCommit: string | null;
+}
+export interface ScorecardDiff {
+    cells: ScorecardCellDiff[];
+    summary: {
+        improved: number;
+        regressed: number;
+        flat: number;
+        new: number;
+    };
+}
+export interface DiffScorecardOptions {
+    /** Compare each cell against this commit instead of its immediate predecessor. */
+    baselineCommit?: string;
+    /** |Cohen's d| at/above which a move counts as real. Default 0.5. */
+    minEffect?: number;
+    /** p-value at/below which a move is significant. Default 0.05. */
+    maxP?: number;
+    /**
+     * |delta| at/above which a move counts when statistics are unavailable
+     * (a cell with fewer than 2 samples on either side). Default 0.05.
+     */
+    minDelta?: number;
+}
+/**
+ * Compare the latest entry of every cell against its predecessor (or against
+ * `baselineCommit`) and classify the move. A move is `improved`/`regressed`
+ * only when it clears both the effect-size and significance gates; otherwise
+ * `flat`. Cells with no prior entry are `new`.
+ */
+export declare function diffScorecard(scorecard: Scorecard, opts?: DiffScorecardOptions): ScorecardDiff;
+/**
+ * Render a scorecard diff as a human-readable report — the block a feature
+ * PR prints. Regressions are listed first; flat cells are summarised, not
+ * enumerated.
+ */
+export declare function formatScorecardDiff(diff: ScorecardDiff): string;
+//# sourceMappingURL=scorecard.d.ts.map

package/dist/scorecard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scorecard.d.ts","sourceRoot":"","sources":["../src/scorecard.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AAGnD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,cAAc,CAAA;AAK7C,gEAAgE;AAChE,MAAM,WAAW,cAAc;IAC7B,SAAS,EAAE,MAAM,CAAA;IACjB,4CAA4C;IAC5C,SAAS,EAAE,MAAM,CAAA;IACjB,iEAAiE;IACjE,MAAM,EAAE,MAAM,EAAE,CAAA;IAChB,qEAAqE;IACrE,SAAS,EAAE,MAAM,CAAA;IACjB,oEAAoE;IACpE,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACrC,yDAAyD;IACzD,MAAM,EAAE,MAAM,EAAE,CAAA;CACjB;AAED,wEAAwE;AACxE,MAAM,WAAW,aAAa;IAC5B,UAAU,EAAE,MAAM,CAAA;IAClB,WAAW,EAAE,MAAM,CAAA;IACnB,uEAAuE;IACvE,KAAK,EAAE,MAAM,CAAA;IACb,QAAQ,EAAE,cAAc,EAAE,CAAA;CAC3B;AAED,8EAA8E;AAC9E,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,aAAa,EAAE,CAAA;IACtB,sEAAsE;IACtE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;CACvC;AAED,4EAA4E;AAC5E,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,MAAM,CAAA;IAClB,WAAW,EAAE,MAAM,CAAA;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,OAAO,EAAE,YAAY,CAAA;IACrB,KAAK,EAAE,cAAc,CAAA;CACtB;AAID,MAAM,WAAW,iBAAiB;IAChC,4DAA4D;IAC5D,OAAO,EAAE,YAAY,CAAA;IACrB,SAAS,EAAE,MAAM,CAAA;IACjB,8CAA8C;IAC9C,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAkCD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,IAAI,EAAE,iBAAiB,GAAG,gBAAgB,EAAE,CAuCzF;AAID,4EAA4E;AAC5E,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,EAAE,GAAG,IAAI,CAIhF;AAED,6EAA6E;AAC7E,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,SAAS,EAAE,EACjB,IAAI,EAAE,iBAAiB,GACtB,gBAAgB,EAAE,CAIpB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,CAkCxD;AAID,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,GAAG,MAAM,GAAG,KAAK,CAAA;AAEnE,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,MAAM,CAAA;IAClB,WAAW,EAAE,MAAM,CAAA;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,OAAO,EAAE,WAAW,CAAA;IACpB,qCAAqC;IACrC,OAAO,EAAE,MAAM,CAAA;IACf,2EAA2E;IAC3E,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAA;IACvB,8CAA8C;IAC9C,KAAK,EAAE,MAAM,GAAG,IAAI,CAAA;IACpB,2EAA2E;IAC3E,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;IACtB,yDAAyD;IACzD,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;IACrB,aAAa,EAAE,MAAM,CAAA;IACrB,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;CAC9B;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,iBAAiB,EAAE,CAAA;IAC1B,OAAO,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;CAC5E;AAED,MAAM,WAAW,oBAAoB;IACnC,kFAAkF;IAClF,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,qEAAqE;IACrE,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,kEAAkE;IAClE,IAAI,CAAC,EAAE,MAAM,CAAA;IACb;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,SAAS,EACpB,IAAI,GAAE,oBAAyB,GAC9B,aAAa,CAsEf;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAgC/D"}

package/dist/scorecard.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=scorecard.test.d.ts.map

package/dist/scorecard.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scorecard.test.d.ts","sourceRoot":"","sources":["../src/scorecard.test.ts"],"names":[],"mappings":""}

package/dist/self-play.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Self-play scenario evolution — agents generate adversarial scenarios
+ * against each other; survivors become part of the eval corpus.
+ *
+ * Framework-agnostic about how scenarios are generated. Caller supplies:
+ *   - `propose`: asks a "proposer" agent for candidate scenarios
+ *   - `scoreAgainst`: runs a target agent against a scenario and returns
+ *     its score
+ *
+ * A scenario *survives* if it reveals a meaningful score difference
+ * between two target agents (or between a target agent and itself on
+ * different runs). Survivors are promoted to a Dataset; the caller
+ * decides what to do with them (hold-out, training, regression set).
+ *
+ * Guard rails: minimum absolute score delta to consider a scenario
+ * informative; floor on absolute target score so degenerate break-all
+ * scenarios (noise, gibberish) don't flood the corpus.
+ */
+import { Dataset } from './dataset';
+export interface CandidateScenario {
+    id: string;
+    payload: unknown;
+    /** Free-form tags (domain, generation, parent). */
+    tags?: Record<string, string>;
+}
+export interface ScoredTarget {
+    targetId: string;
+    score: number;
+}
+export interface EvolutionRound {
+    round: number;
+    proposed: CandidateScenario[];
+    survived: CandidateScenario[];
+    rejected: Array<{
+        candidate: CandidateScenario;
+        reason: string;
+    }>;
+    scoredBreakdown: Array<{
+        candidate: CandidateScenario;
+        scores: ScoredTarget[];
+        spread: number;
+    }>;
+}
+export interface SelfPlayOptions {
+    /** Minimum score spread across targets for a scenario to survive. Default 0.1. */
+    minSpread?: number;
+    /** Minimum floor score across targets — keeps degenerate break-all scenarios
+     *  out. Default 0.1 (if every target scores below this, discard). */
+    minAbsoluteFloor?: number;
+    /** Hard cap on survivors per round. Default 50. */
+    maxSurvivors?: number;
+    /** Rounds to run. Default 1. Each round's survivors can be fed back into
+     *  `propose` to compound. */
+    rounds?: number;
+    /** Seed for scenario id generation if proposer doesn't provide one. */
+    seed?: number;
+}
+export interface SelfPlayProposer {
+    propose(round: number, priorSurvivors: CandidateScenario[]): Promise<CandidateScenario[]>;
+}
+export interface SelfPlayScorer {
+    /** Score one candidate against every target; returns parallel array. */
+    scoreCandidate(candidate: CandidateScenario, targets: string[]): Promise<ScoredTarget[]>;
+}
+export declare function runSelfPlay(proposer: SelfPlayProposer, scorer: SelfPlayScorer, targets: string[], options?: SelfPlayOptions): Promise<{
+    rounds: EvolutionRound[];
+    dataset: Dataset;
+}>;
+//# sourceMappingURL=self-play.d.ts.map

package/dist/self-play.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-play.d.ts","sourceRoot":"","sources":["../src/self-play.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,OAAO,EAAwB,MAAM,WAAW,CAAA;AAEzD,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAA;IACV,OAAO,EAAE,OAAO,CAAA;IAChB,mDAAmD;IACnD,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAC9B;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAA;IAChB,KAAK,EAAE,MAAM,CAAA;CACd;AAED,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAA;IACb,QAAQ,EAAE,iBAAiB,EAAE,CAAA;IAC7B,QAAQ,EAAE,iBAAiB,EAAE,CAAA;IAC7B,QAAQ,EAAE,KAAK,CAAC;QAAE,SAAS,EAAE,iBAAiB,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACjE,eAAe,EAAE,KAAK,CAAC;QAAE,SAAS,EAAE,iBAAiB,CAAC;QAAC,MAAM,EAAE,YAAY,EAAE,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CACjG;AAED,MAAM,WAAW,eAAe;IAC9B,kFAAkF;IAClF,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB;yEACqE;IACrE,gBAAgB,CAAC,EAAE,MAAM,CAAA;IACzB,mDAAmD;IACnD,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB;iCAC6B;IAC7B,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,uEAAuE;IACvE,IAAI,CAAC,EAAE,MAAM,CAAA;CACd;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAA;CAC1F;AAED,MAAM,WAAW,cAAc;IAC7B,wEAAwE;IACxE,cAAc,CAAC,SAAS,EAAE,iBAAiB,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAA;CACzF;AAED,wBAAsB,WAAW,CAC/B,QAAQ,EAAE,gBAAgB,EAC1B,MAAM,EAAE,cAAc,EACtB,OAAO,EAAE,MAAM,EAAE,EACjB,OAAO,GAAE,eAAoB,GAC5B,OAAO,CAAC;IAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAAC,CA4EzD"}

package/dist/semantic-concept-judge.d.ts

@@ -0,0 +1,135 @@
+/**
+ * Semantic concept judge — "does the built artifact actually implement
+ * the features the user asked for?"
+ *
+ * Distinct from the domain/code/coherence judges in `judges.ts`:
+ *   - those judges score free-form conversational agent outputs along
+ *     quality dimensions (accuracy, depth, etc.)
+ *   - this judge scores a *built artifact* (served HTML + source files)
+ *     against an explicit list of expected concepts, returning per-concept
+ *     {present, score 0-10, evidence, severity}.
+ *
+ * The judge is strict about distinguishing (a) a working implementation
+ * from (b) a keyword-present stub. "// TODO: mint button" is NOT present.
+ * Only real, functional, wired-up code counts.
+ *
+ * Use via {@link createSemanticConceptJudge} or directly via
+ * {@link runSemanticConceptJudge}. Soft-fails (available=false) on LLM
+ * or JSON-parse errors so the caller can treat that as "layer skipped"
+ * rather than "layer failed" in a multi-layer pipeline.
+ */
+import { type LlmClientOptions } from './llm-client';
+import type { Severity } from './multi-layer-verifier';
+/**
+ * Implementation complexity class for weighted scoring.
+ *
+ * - `render` (default): the concept is a UI surface that displays static
+ *   data — render a list, show a counter, lay out a button. Single-file
+ *   work, no external integration.
+ * - `integrate`: the concept requires wiring a real external system —
+ *   wallet connect (wagmi + RainbowKit + chain config), payment provider
+ *   (Stripe Elements + intent + webhook), an API client with auth.
+ *   Multi-file, library-knowledge, runtime correctness matters.
+ * - `compute`: the concept requires algorithmic work — solver, simulator,
+ *   constraint propagation, ML inference. Correctness > UI polish.
+ *
+ * Default weights (when applied via `weightConcepts: 'complexity'`):
+ *   render=1.0, integrate=2.0, compute=2.5
+ *
+ * Cross-vertical scoring without complexity weighting silently inflates
+ * the rate of UI-heavy verticals (healthcare, fintech dashboards) vs
+ * integration-heavy verticals (DeFi, wallets) — all concepts treated
+ * equally even though the agent does 2-3x the work for `integrate`.
+ */
+export type ConceptComplexity = 'render' | 'integrate' | 'compute';
+export interface ConceptSpec {
+    name: string;
+    /** Short hints that help the judge; not used for matching. */
+    keywords?: string[];
+    /** Optional explicit weight; default 1.0. Overrides complexity-derived weight. */
+    weight?: number;
+    /** Implementation complexity class. Default `render`. */
+    complexity?: ConceptComplexity;
+}
+export interface ConceptFinding {
+    concept: string;
+    present: boolean;
+    /** 0..10. 10 = production-ready; 7 = functional thin; 4 = partial; 0 = absent. */
+    score: number;
+    evidence: string;
+    severity: Severity;
+}
+export interface SemanticConceptJudgeInput {
+    /** Full natural-language prompt the agent was handed. */
+    userRequest: string;
+    /** Rendered HTML the preview returns (UI artifacts). Optional. */
+    servedHtml?: string;
+    /** Top-level source files from the agent's workdir. */
+    sourceFiles: Array<{
+        path: string;
+        content: string;
+    }>;
+    /** The expected concept list. */
+    expectedConcepts: ConceptSpec[];
+    /** Free-form metadata (id, difficulty) to inject into the prompt. */
+    artifactLabel?: string;
+    artifactDescription?: string;
+}
+export interface SemanticConceptJudgeResult {
+    kind: 'semantic-concept';
+    version: string;
+    /** Normalized 0..1 score — mean of per-concept scores / 10. */
+    score: number;
+    presentCount: number;
+    totalCount: number;
+    findings: ConceptFinding[];
+    summary: string;
+    durationMs: number;
+    costUsd: number | null;
+    /** False on LLM/JSON error — treat as "skipped / unable to judge" in pipelines. */
+    available: boolean;
+    error?: string;
+}
+/**
+ * Score-aggregation strategy. `mean` averages 0-10 scores uniformly.
+ * `complexity` applies the default weight table (render=1, integrate=2,
+ * compute=2.5) unless a concept has an explicit `weight`. `explicit`
+ * honors only `weight` (defaulting to 1 for unspecified).
+ */
+export type ConceptWeightStrategy = 'mean' | 'complexity' | 'explicit';
+export declare const DEFAULT_COMPLEXITY_WEIGHTS: Record<ConceptComplexity, number>;
+export interface SemanticConceptJudgeOptions {
+    /** Model id to call. Default 'claude-sonnet-4-6' via agent-eval defaults. */
+    model?: string;
+    /** Per-call timeout. Default 300s. */
+    timeoutMs?: number;
+    /** Pipeline budget for the prompt (source blob truncation). Default 45000. */
+    maxSourceChars?: number;
+    /** Per-file cap before inclusion. Default 20000. */
+    maxPerFileChars?: number;
+    /** HTML cap. Default 30000. */
+    maxHtmlChars?: number;
+    /** LlmClient config (baseUrl, apiKey, authHeader, …). */
+    llm?: LlmClientOptions;
+    /**
+     * Score aggregation strategy. Default `mean` — uniform average across
+     * concepts. Cross-vertical comparisons should use `complexity` to
+     * neutralize the integrate-vs-render asymmetry.
+     */
+    weightConcepts?: ConceptWeightStrategy;
+    /** Override the default complexity → weight table. */
+    complexityWeights?: Partial<Record<ConceptComplexity, number>>;
+}
+export declare const SEMANTIC_CONCEPT_JUDGE_VERSION = "semantic-concept-judge-v1-2026-04-24";
+/**
+ * Run the semantic concept judge. Soft-fails to available=false on
+ * LLM/JSON errors — callers in a MultiLayerVerifier pipeline can treat
+ * that as "skip" rather than "fail."
+ */
+export declare function runSemanticConceptJudge(input: SemanticConceptJudgeInput, options?: SemanticConceptJudgeOptions): Promise<SemanticConceptJudgeResult>;
+/**
+ * Factory: pin LLM options once, return a closure that accepts inputs.
+ * Convenient for pipelines that want to share a single LlmClient config.
+ */
+export declare function createSemanticConceptJudge(options?: SemanticConceptJudgeOptions): (input: SemanticConceptJudgeInput) => Promise<SemanticConceptJudgeResult>;
+//# sourceMappingURL=semantic-concept-judge.d.ts.map

package/dist/semantic-concept-judge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-concept-judge.d.ts","sourceRoot":"","sources":["../src/semantic-concept-judge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAe,KAAK,gBAAgB,EAAE,MAAM,cAAc,CAAA;AACjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAA;AAItD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,MAAM,iBAAiB,GAAG,QAAQ,GAAG,WAAW,GAAG,SAAS,CAAA;AAElE,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAA;IACZ,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;IACnB,kFAAkF;IAClF,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,yDAAyD;IACzD,UAAU,CAAC,EAAE,iBAAiB,CAAA;CAC/B;AAED,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,OAAO,CAAA;IAChB,kFAAkF;IAClF,KAAK,EAAE,MAAM,CAAA;IACb,QAAQ,EAAE,MAAM,CAAA;IAChB,QAAQ,EAAE,QAAQ,CAAA;CACnB;AAED,MAAM,WAAW,yBAAyB;IACxC,yDAAyD;IACzD,WAAW,EAAE,MAAM,CAAA;IACnB,kEAAkE;IAClE,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,uDAAuD;IACvD,WAAW,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACrD,iCAAiC;IACjC,gBAAgB,EAAE,WAAW,EAAE,CAAA;IAC/B,qEAAqE;IACrE,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,mBAAmB,CAAC,EAAE,MAAM,CAAA;CAC7B;AAED,MAAM,WAAW,0BAA0B;IACzC,IAAI,EAAE,kBAAkB,CAAA;IACxB,OAAO,EAAE,MAAM,CAAA;IACf,+DAA+D;IAC/D,KAAK,EAAE,MAAM,CAAA;IACb,YAAY,EAAE,MAAM,CAAA;IACpB,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,cAAc,EAAE,CAAA;IAC1B,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,MAAM,CAAA;IAClB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;IACtB,mFAAmF;IACnF,SAAS,EAAE,OAAO,CAAA;IAClB,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAED;;;;;GAKG;AACH,MAAM,MAAM,qBAAqB,GAAG,MAAM,GAAG,YAAY,GAAG,UAAU,CAAA;AAEtE,eAAO,MAAM,0BAA0B,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAIxE,CAAA;AAED,MAAM,WAAW,2BAA2B;IAC1C,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,sCAAsC;IACtC,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,8EAA8E;IAC9E,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,oDAAoD;IACpD,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,+BAA+B;IAC/B,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,yDAAyD;IACzD,GAAG,CAAC,EAAE,gBAAgB,CAAA;IACtB;;;;OAIG;IACH,cAAc,CAAC,EAAE,qBAAqB,CAAA;IACtC,sDAAsD;IACtD,iBAAiB,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC,CAAA;CAC/D;AAID,eAAO,MAAM,8BAA8B,yCAAyC,CAAA;AA4FpF;;;;GAIG;AACH,wBAAsB,uBAAuB,CAC3C,KAAK,EAAE,yBAAyB,EAChC,OAAO,GAAE,2BAAgC,GACxC,OAAO,CAAC,0BAA0B,CAAC,CA2HrC;AAED;;;GAGG;AACH,wBAAgB,0BAA0B,CACxC,OAAO,GAAE,2BAAgC,GACxC,CAAC,KAAK,EAAE,yBAAyB,KAAK,OAAO,CAAC,0BAA0B,CAAC,CAE3E"}

package/dist/semantic-concept-judge.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=semantic-concept-judge.test.d.ts.map

package/dist/semantic-concept-judge.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-concept-judge.test.d.ts","sourceRoot":"","sources":["../src/semantic-concept-judge.test.ts"],"names":[],"mappings":""}

package/dist/{sequential-5iSVfzl2.d.ts → sequential.d.ts}

@@ -36,8 +36,8 @@
  *   - Waudby-Smith, I., Ramdas, A. (2024). Estimating means of bounded
  *     random variables by betting. JRSS B, 86(1), 1–27.
  */
-type SequentialDecision = 'promote_now' | 'continue' | 'reject_now' | 'equivalent';
-interface PairedEvalueOptions {
+export type SequentialDecision = 'promote_now' | 'continue' | 'reject_now' | 'equivalent';
+export interface PairedEvalueOptions {
     /**
      * Bound on |delta|. Default 1 (matching most score scales). Must satisfy
      * c > 0; deltas outside [-c, c] are clipped with a warning attached to
@@ -58,7 +58,7 @@ interface PairedEvalueOptions {
     /** Initial bet shrinkage (0 < scale ≤ 1). Default 0.5 — empirically robust. */
     initialBetShrinkage?: number;
 }
-interface PairedEvalueStep {
+export interface PairedEvalueStep {
     /** 1-indexed observation count. */
     t: number;
     delta: number;
@@ -72,7 +72,7 @@ interface PairedEvalueStep {
     /** Verdict at this stopping time. */
     decision: SequentialDecision;
 }
-interface PairedEvalueSequence {
+export interface PairedEvalueSequence {
     steps: PairedEvalueStep[];
     /** The decision at the final step. */
     finalDecision: SequentialDecision;
@@ -90,8 +90,8 @@ interface PairedEvalueSequence {
  * fires, the verdict at later steps remains decisive (the e-value is a
  * non-negative martingale; once it crosses the threshold, it's crossed).
  */
-declare function pairedEvalueSequence(deltas: number[], opts?: PairedEvalueOptions): PairedEvalueSequence;
-interface InterimReleaseConfidenceInput {
+export declare function pairedEvalueSequence(deltas: number[], opts?: PairedEvalueOptions): PairedEvalueSequence;
+export interface InterimReleaseConfidenceInput {
     /**
      * One delta series per candidate (paired deltas vs comparator). Order
      * within a series is the order the campaigns were run.
@@ -107,7 +107,7 @@ interface InterimReleaseConfidenceInput {
         high: number;
     };
 }
-interface InterimReleaseConfidence {
+export interface InterimReleaseConfidence {
     candidates: Array<{
         candidateId: string;
         decision: SequentialDecision;
@@ -134,6 +134,5 @@ interface InterimReleaseConfidence {
  * synthesising a campaign-level recommendation. Designed to be called on
  * every campaign tick — the recommendation is anytime-valid.
  */
-declare function evaluateInterimReleaseConfidence(input: InterimReleaseConfidenceInput): InterimReleaseConfidence;
-
-export { type InterimReleaseConfidence as I, type PairedEvalueOptions as P, type SequentialDecision as S, type InterimReleaseConfidenceInput as a, type PairedEvalueSequence as b, type PairedEvalueStep as c, evaluateInterimReleaseConfidence as e, pairedEvalueSequence as p };
+export declare function evaluateInterimReleaseConfidence(input: InterimReleaseConfidenceInput): InterimReleaseConfidence;
+//# sourceMappingURL=sequential.d.ts.map

package/dist/sequential.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequential.d.ts","sourceRoot":"","sources":["../src/sequential.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH,MAAM,MAAM,kBAAkB,GAAG,aAAa,GAAG,UAAU,GAAG,YAAY,GAAG,YAAY,CAAA;AAEzF,MAAM,WAAW,mBAAmB;IAClC;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,yCAAyC;IACzC,KAAK,CAAC,EAAE,MAAM,CAAA;IACd;;;;OAIG;IACH,IAAI,CAAC,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAA;IACpC,+EAA+E;IAC/E,mBAAmB,CAAC,EAAE,MAAM,CAAA;CAC7B;AAED,MAAM,WAAW,gBAAgB;IAC/B,mCAAmC;IACnC,CAAC,EAAE,MAAM,CAAA;IACT,KAAK,EAAE,MAAM,CAAA;IACb,+CAA+C;IAC/C,MAAM,EAAE,MAAM,CAAA;IACd,+CAA+C;IAC/C,MAAM,EAAE,MAAM,CAAA;IACd,+EAA+E;IAC/E,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,MAAM,CAAA;IACd,qCAAqC;IACrC,QAAQ,EAAE,kBAAkB,CAAA;CAC7B;AAED,MAAM,WAAW,oBAAoB;IACnC,KAAK,EAAE,gBAAgB,EAAE,CAAA;IACzB,sCAAsC;IACtC,aAAa,EAAE,kBAAkB,CAAA;IACjC,+EAA+E;IAC/E,eAAe,EAAE,MAAM,GAAG,IAAI,CAAA;IAC9B,0DAA0D;IAC1D,OAAO,EAAE,OAAO,CAAA;CACjB;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EAAE,EAChB,IAAI,GAAE,mBAAwB,GAC7B,oBAAoB,CAoEtB;AAED,MAAM,WAAW,6BAA6B;IAC5C;;;OAGG;IACH,WAAW,EAAE,KAAK,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAA;IAC7D,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,IAAI,CAAC,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAA;CACrC;AAED,MAAM,WAAW,wBAAwB;IACvC,UAAU,EAAE,KAAK,CAAC;QAChB,WAAW,EAAE,MAAM,CAAA;QACnB,QAAQ,EAAE,kBAAkB,CAAA;QAC5B,eAAe,EAAE,MAAM,GAAG,IAAI,CAAA;QAC9B,WAAW,EAAE,MAAM,CAAA;QACnB,WAAW,EAAE,MAAM,CAAA;QACnB,KAAK,EAAE,MAAM,CAAA;QACb,KAAK,EAAE,MAAM,CAAA;QACb,MAAM,EAAE,MAAM,CAAA;KACf,CAAC,CAAA;IACF;;;;OAIG;IACH,cAAc,EAAE;QAAE,QAAQ,EAAE,kBAAkB,CAAC;QAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,CAAA;CAC7E;AAED;;;;;GAKG;AACH,wBAAgB,gCAAgC,CAC9C,KAAK,EAAE,6BAA6B,GACnC,wBAAwB,CAmC1B"}

package/dist/{series-convergence-D5OWMBg6.d.ts → series-convergence.d.ts}

@@ -11,7 +11,7 @@
  *   - drifting:   recent trend is monotonic and beyond noise — regressing or improving
  *   - noisy:      neither — keep iterating, but flag as untrustworthy for gating
  */
-interface SeriesConvergenceOptions {
+export interface SeriesConvergenceOptions {
     /** Window size for "recent" analysis (default 5). */
     window?: number;
     /** Coefficient-of-variation threshold below which the window is stabilized (default 0.05 = 5%). */
@@ -19,7 +19,7 @@ interface SeriesConvergenceOptions {
     /** Minimum monotone run length to call drift (default 3). */
     driftRun?: number;
 }
-interface SeriesConvergenceResult {
+export interface SeriesConvergenceResult {
     state: 'stabilized' | 'drifting-up' | 'drifting-down' | 'noisy' | 'insufficient-data';
     windowMean: number;
     windowCv: number;
@@ -28,6 +28,5 @@ interface SeriesConvergenceResult {
     /** True when n ≥ window AND windowCv ≤ stableCv. */
     stable: boolean;
 }
-declare function analyzeSeries(values: number[], options?: SeriesConvergenceOptions): SeriesConvergenceResult;
-
-export { type SeriesConvergenceOptions as S, type SeriesConvergenceResult as a, analyzeSeries as b };
+export declare function analyzeSeries(values: number[], options?: SeriesConvergenceOptions): SeriesConvergenceResult;
+//# sourceMappingURL=series-convergence.d.ts.map

package/dist/series-convergence.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"series-convergence.d.ts","sourceRoot":"","sources":["../src/series-convergence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,MAAM,WAAW,wBAAwB;IACvC,qDAAqD;IACrD,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,mGAAmG;IACnG,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,6DAA6D;IAC7D,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED,MAAM,WAAW,uBAAuB;IACtC,KAAK,EAAE,YAAY,GAAG,aAAa,GAAG,eAAe,GAAG,OAAO,GAAG,mBAAmB,CAAA;IACrF,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,4FAA4F;IAC5F,OAAO,EAAE,MAAM,CAAA;IACf,oDAAoD;IACpD,MAAM,EAAE,OAAO,CAAA;CAChB;AAED,wBAAgB,aAAa,CAC3B,MAAM,EAAE,MAAM,EAAE,EAChB,OAAO,GAAE,wBAA6B,GACrC,uBAAuB,CAwCzB"}

package/dist/slo.d.ts

@@ -0,0 +1,48 @@
+/**
+ * SLO gates — quantified pass/fail primitives beyond score thresholds.
+ *
+ * Lifted from ADC's sandbox eval suite. Each SLO defines a metric, a
+ * threshold, and a severity (critical | warning). Critical breaches fail
+ * the eval; warnings are reported but don't gate CI. Margin is the
+ * ratio of actual to threshold for histogramming "how close are we?"
+ *
+ * Consumers assemble their own SLO arrays; DEFAULT_AGENT_SLOS covers
+ * the generic agent flow (provision, first token, pass rate, cost).
+ */
+export type SloSeverity = 'critical' | 'warning';
+export type SloComparator = 'lte' | 'gte';
+export interface Slo {
+    /** Stable identifier — must be unique within an SLO set. */
+    id: string;
+    /** Human description, shown in reports. */
+    description: string;
+    /** Metric key looked up in the candidate record. */
+    metric: string;
+    /** Whether the metric should stay below (lte) or above (gte) threshold. */
+    comparator: SloComparator;
+    /** Threshold value. */
+    threshold: number;
+    severity: SloSeverity;
+}
+export interface SloCheckResult {
+    slo: Slo;
+    actual: number | undefined;
+    passed: boolean;
+    /** actual/threshold for lte, threshold/actual for gte. >1 means safe margin; <1 means breach. 0 when actual is missing. */
+    margin: number;
+    detail: string;
+}
+export interface SloReport {
+    results: SloCheckResult[];
+    passedCritical: boolean;
+    criticalBreaches: SloCheckResult[];
+    warnings: SloCheckResult[];
+}
+/**
+ * Evaluate an SLO set against a candidate metrics object. Missing metrics
+ * count as breaches — if you declared it, you must measure it.
+ */
+export declare function checkSlos(metrics: Record<string, number>, slos: Slo[]): SloReport;
+/** Reference SLO set for agent-style evals. Tune per-product by cloning + overriding. */
+export declare const DEFAULT_AGENT_SLOS: Slo[];
+//# sourceMappingURL=slo.d.ts.map

package/dist/slo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"slo.d.ts","sourceRoot":"","sources":["../src/slo.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,SAAS,CAAA;AAChD,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,KAAK,CAAA;AAEzC,MAAM,WAAW,GAAG;IAClB,4DAA4D;IAC5D,EAAE,EAAE,MAAM,CAAA;IACV,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAA;IACnB,oDAAoD;IACpD,MAAM,EAAE,MAAM,CAAA;IACd,2EAA2E;IAC3E,UAAU,EAAE,aAAa,CAAA;IACzB,uBAAuB;IACvB,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,EAAE,WAAW,CAAA;CACtB;AAED,MAAM,WAAW,cAAc;IAC7B,GAAG,EAAE,GAAG,CAAA;IACR,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;IAC1B,MAAM,EAAE,OAAO,CAAA;IACf,2HAA2H;IAC3H,MAAM,EAAE,MAAM,CAAA;IACd,MAAM,EAAE,MAAM,CAAA;CACf;AAED,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,cAAc,EAAE,CAAA;IACzB,cAAc,EAAE,OAAO,CAAA;IACvB,gBAAgB,EAAE,cAAc,EAAE,CAAA;IAClC,QAAQ,EAAE,cAAc,EAAE,CAAA;CAC3B;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,SAAS,CAKjF;AAkCD,yFAAyF;AACzF,eAAO,MAAM,kBAAkB,EAAE,GAAG,EAyCnC,CAAA"}

package/dist/state-continuity.d.ts

@@ -0,0 +1,47 @@
+/**
+ * State continuity scoring — measures how well a resumed/handed-off agent
+ * preserves prior work.
+ *
+ * When session 2 continues
+ * session 1's work, the key question is: did it preserve key artifacts,
+ * or start over and lose context? Each `ContinuityCheck` inspects one
+ * aspect (file preserved, key count grew, status advanced) and yields
+ * 0-1 credit; the aggregate is the simple mean.
+ *
+ * Generic over any "snapshot" shape — pass your own checks.
+ */
+export interface ContinuitySnapshotPair<T> {
+    before: T;
+    after: T;
+}
+export interface ContinuityCheck<T> {
+    /** Stable identifier; shown in the report. */
+    id: string;
+    /** Description of what this check measures. */
+    description: string;
+    /** Returns 0..1 credit for this dimension (1 = fully preserved/improved). */
+    score: (pair: ContinuitySnapshotPair<T>) => number;
+}
+export interface ContinuityCheckResult {
+    id: string;
+    description: string;
+    score: number;
+    pass: boolean;
+}
+export interface ContinuityReport {
+    results: ContinuityCheckResult[];
+    /** Mean of per-check scores, in 0..1. */
+    overallScore: number;
+    /** True iff ALL checks scored ≥ passThreshold. */
+    pass: boolean;
+}
+export declare function scoreContinuity<T>(pair: ContinuitySnapshotPair<T>, checks: ContinuityCheck<T>[], options?: {
+    passThreshold?: number;
+}): ContinuityReport;
+/** Common check: a required key in a record exists and equals the prior value. */
+export declare function keyPreserved<T extends Record<string, unknown>>(key: keyof T & string): ContinuityCheck<T>;
+/** Common check: a collection (array) grew or stayed the same size. */
+export declare function collectionPreserved<T, K extends keyof T & string>(key: K, minRatio?: number): ContinuityCheck<T>;
+/** Common check: a status field advanced in an expected order. */
+export declare function statusAdvanced<T extends Record<string, unknown>>(key: keyof T & string, progression: readonly string[]): ContinuityCheck<T>;
+//# sourceMappingURL=state-continuity.d.ts.map

package/dist/state-continuity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-continuity.d.ts","sourceRoot":"","sources":["../src/state-continuity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,MAAM,WAAW,sBAAsB,CAAC,CAAC;IACvC,MAAM,EAAE,CAAC,CAAA;IACT,KAAK,EAAE,CAAC,CAAA;CACT;AAED,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,8CAA8C;IAC9C,EAAE,EAAE,MAAM,CAAA;IACV,+CAA+C;IAC/C,WAAW,EAAE,MAAM,CAAA;IACnB,6EAA6E;IAC7E,KAAK,EAAE,CAAC,IAAI,EAAE,sBAAsB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAA;CACnD;AAED,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,MAAM,CAAA;IACV,WAAW,EAAE,MAAM,CAAA;IACnB,KAAK,EAAE,MAAM,CAAA;IACb,IAAI,EAAE,OAAO,CAAA;CACd;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,qBAAqB,EAAE,CAAA;IAChC,yCAAyC;IACzC,YAAY,EAAE,MAAM,CAAA;IACpB,kDAAkD;IAClD,IAAI,EAAE,OAAO,CAAA;CACd;AAED,wBAAgB,eAAe,CAAC,CAAC,EAC/B,IAAI,EAAE,sBAAsB,CAAC,CAAC,CAAC,EAC/B,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,EAC5B,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,MAAM,CAAA;CAAO,GACvC,gBAAgB,CAYlB;AAED,kFAAkF;AAClF,wBAAgB,YAAY,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5D,GAAG,EAAE,MAAM,CAAC,GAAG,MAAM,GACpB,eAAe,CAAC,CAAC,CAAC,CAMpB;AAED,uEAAuE;AACvE,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,EAC/D,GAAG,EAAE,CAAC,EACN,QAAQ,SAAI,GACX,eAAe,CAAC,CAAC,CAAC,CAYpB;AAED,kEAAkE;AAClE,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC9D,GAAG,EAAE,MAAM,CAAC,GAAG,MAAM,EACrB,WAAW,EAAE,SAAS,MAAM,EAAE,GAC7B,eAAe,CAAC,CAAC,CAAC,CAWpB"}