@opensearch-project/agent-health 0.5.2 → 0.7.0

package/lib/dist/lib/bedrockCompat.js

@@ -0,0 +1,83 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * Bedrock model compatibility helpers shared by every Bedrock Converse call
+ * site (judge, skill eval generator, skill improver, failure clustering,
+ * assistant fallback).
+ *
+ * Two concerns live here so the policy is defined exactly once:
+ *
+ * 1. **Temperature deprecation** — newer Anthropic models (Claude Opus 4.5+,
+ *    Sonnet 4.6+, and the Claude 5 family incl. Fable/Mythos) reject an
+ *    explicit `temperature` with `ValidationException: 'temperature' is
+ *    deprecated for this model`. `buildInferenceConfig()` omits the field for
+ *    those models and lets the model use its default. (GitHub issue #299)
+ *
+ * 2. **Region-aware inference profiles** — the default model registry pins
+ *    `us.`-prefixed cross-region inference profile ids, which only resolve
+ *    from US regions. `resolveRegionAwareModelId()` swaps the prefix to the
+ *    one matching the active AWS region (`eu.` / `apac.`) at call time, so
+ *    the registry itself stays region-neutral. (GitHub issue #298)
+ */
+/**
+ * Model-id patterns that have deprecated the `temperature` parameter.
+ * Matched case-insensitively against the full model/inference-profile id.
+ */
+const TEMPERATURE_DEPRECATED_PATTERNS = [
+    /claude-opus-4-[5-9]/, // Opus 4.5, 4.6, 4.7, 4.8, ...
+    /claude-sonnet-4-[6-9]/, // Sonnet 4.6+ (4.5 still accepts temperature)
+    /claude-[a-z]+-5(?![0-9])/, // Claude 5 family: fable-5, mythos-5, opus-5, sonnet-5, ...
+];
+/** Whether the given Bedrock model still accepts an explicit `temperature`. */
+export function modelSupportsTemperature(modelId) {
+    const id = (modelId || '').toLowerCase();
+    return !TEMPERATURE_DEPRECATED_PATTERNS.some((p) => p.test(id));
+}
+/**
+ * Build a Converse `inferenceConfig`, including `temperature` only when the
+ * target model accepts it. Callers pass their preferred temperature; for
+ * models that have deprecated the parameter it is silently omitted (the
+ * model's own default applies).
+ */
+export function buildInferenceConfig(modelId, opts) {
+    const cfg = { maxTokens: opts.maxTokens };
+    if (opts.temperature !== undefined && modelSupportsTemperature(modelId)) {
+        cfg.temperature = opts.temperature;
+    }
+    return cfg;
+}
+/** Inference-profile prefix appropriate for the given (or current) AWS region. */
+export function regionInferencePrefix(region) {
+    const r = (region ||
+        process.env.AWS_REGION ||
+        process.env.AWS_DEFAULT_REGION ||
+        'us-east-1').toLowerCase();
+    if (r.startsWith('eu-'))
+        return 'eu.';
+    if (r.startsWith('ap-'))
+        return 'apac.';
+    return 'us.';
+}
+const CROSS_REGION_PREFIXES = ['us.', 'eu.', 'apac.'];
+/**
+ * Re-home a cross-region inference-profile id to the active AWS region.
+ *
+ * `us.anthropic.claude-...` → `eu.anthropic.claude-...` when running in an
+ * EU region, etc. Ids that carry no regional prefix (bare model ids,
+ * `global.` profiles, non-Bedrock ids like `mock://` or `gpt-4o`) are
+ * returned unchanged.
+ */
+export function resolveRegionAwareModelId(modelId, region) {
+    if (!modelId)
+        return modelId;
+    const target = regionInferencePrefix(region);
+    for (const prefix of CROSS_REGION_PREFIXES) {
+        if (modelId.startsWith(prefix)) {
+            return prefix === target ? modelId : target + modelId.slice(prefix.length);
+        }
+    }
+    return modelId;
+}
+//# sourceMappingURL=bedrockCompat.js.map

package/lib/dist/lib/bedrockCompat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bedrockCompat.js","sourceRoot":"","sources":["../../bedrockCompat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AAEH;;;GAGG;AACH,MAAM,+BAA+B,GAAa;IAChD,qBAAqB,EAAE,+BAA+B;IACtD,uBAAuB,EAAE,8CAA8C;IACvE,0BAA0B,EAAE,4DAA4D;CACzF,CAAC;AAEF,+EAA+E;AAC/E,MAAM,UAAU,wBAAwB,CAAC,OAAe;IACtD,MAAM,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IACzC,OAAO,CAAC,+BAA+B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAAe,EACf,IAAiD;IAEjD,MAAM,GAAG,GAAgD,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IACvF,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,wBAAwB,CAAC,OAAO,CAAC,EAAE,CAAC;QACxE,GAAG,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;IACrC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,qBAAqB,CAAC,MAAe;IACnD,MAAM,CAAC,GAAG,CACR,MAAM;QACN,OAAO,CAAC,GAAG,CAAC,UAAU;QACtB,OAAO,CAAC,GAAG,CAAC,kBAAkB;QAC9B,WAAW,CACZ,CAAC,WAAW,EAAE,CAAC;IAChB,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IACxC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,qBAAqB,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAU,CAAC;AAE/D;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CAAC,OAAe,EAAE,MAAe;IACxE,IAAI,CAAC,OAAO;QAAE,OAAO,OAAO,CAAC;IAC7B,MAAM,MAAM,GAAG,qBAAqB,CAAC,MAAM,CAAC,CAAC;IAC7C,KAAK,MAAM,MAAM,IAAI,qBAAqB,EAAE,CAAC;QAC3C,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/lib/dist/lib/benchmarkCaseReview.d.ts

@@ -0,0 +1,114 @@
+/**
+ * Pure helpers for the benchmark case-review matrix.
+ *
+ * The benchmark document supplies the canonical run/case relationship, while
+ * lightweight report summaries supply the actual pass/fail/error verdicts.
+ * Keeping this logic outside React makes the bucket priority and pager order
+ * deterministic (and cheap to test) for suites with hundreds of cases.
+ */
+export type CaseVerdict = 'passed' | 'failed' | 'errored' | 'not-run';
+export type CaseReviewBucket = 'needs-attention' | 'flaky' | 'stable' | 'no-data';
+export type CaseReviewFilter = 'all' | Exclude<CaseReviewBucket, 'no-data'>;
+export type SwipeDirection = 'prev' | 'next';
+export interface PagerDragInput {
+    dx: number;
+    dy: number;
+    latched: boolean;
+    atStart: boolean;
+    atEnd: boolean;
+}
+export interface PagerDragResult {
+    offset: number;
+    latched: boolean;
+}
+/**
+ * Latch a horizontal pager drag after a small slop, then preserve that latch
+ * for the rest of the gesture. Pulling beyond either end receives resistance
+ * so the pane communicates the boundary without changing cases.
+ *
+ * Reduced-motion behavior intentionally stays out of this geometry helper;
+ * callers suppress the returned offset while retaining gesture navigation.
+ */
+export declare function computePagerDrag({ dx, dy, latched, atStart, atEnd, }: PagerDragInput): PagerDragResult;
+/**
+ * Resolve a completed gesture without suppressing native touch movement. A
+ * negative x displacement is a left swipe (next); a positive one is previous.
+ */
+export declare function resolveSwipeDirection(dx: number, dy: number, touchCount?: number): SwipeDirection | null;
+export interface VerdictReportSummary {
+    status?: string;
+    passFailStatus?: 'passed' | 'failed' | null;
+    metricsStatus?: string;
+}
+export interface VerdictRunResult {
+    reportId?: string;
+    status?: string;
+    /** Present on newer embedded benchmark results; reports remain authoritative. */
+    passFailStatus?: 'passed' | 'failed';
+}
+export interface VerdictRun {
+    id: string;
+    createdAt: string;
+    status?: string;
+    results?: Record<string, VerdictRunResult>;
+}
+export interface ReviewableCase {
+    id: string;
+    name: string;
+    prompt?: string;
+}
+export interface CaseReviewRow<T extends ReviewableCase = ReviewableCase> {
+    testCase: T;
+    verdicts: CaseVerdict[];
+    bucket: CaseReviewBucket;
+    passRate: number | null;
+}
+/** A legacy run with no top-level status is complete once all results are terminal. */
+export declare function isCompletedVerdictRun(run: VerdictRun): boolean;
+export declare function getRecentCompletedRuns<T extends VerdictRun>(runs: T[], limit?: number): T[];
+/**
+ * Resolve one case×run cell. A real pass/fail verdict from the report is
+ * authoritative and outranks `metricsStatus === 'error'`: metrics/cost
+ * enrichment runs after the agent-vs-judge verdict is already known, so a
+ * later enrichment failure must not overwrite a genuine pass/fail with
+ * 'errored'. `metricsStatus === 'error'` only decides the cell when the
+ * report has no real passFailStatus yet.
+ */
+export declare function deriveCaseVerdict(run: VerdictRun, testCaseId: string, reportsById: Record<string, VerdictReportSummary | undefined>): CaseVerdict;
+export declare function deriveCaseVerdicts(runs: VerdictRun[], testCaseId: string, reportsById: Record<string, VerdictReportSummary | undefined>): CaseVerdict[];
+/**
+ * Buckets are disjoint by priority. Evaluator errors require attention but do
+ * not become failed verdicts or enter the pass-rate denominator.
+ */
+export declare function classifyCaseVerdicts(verdicts: CaseVerdict[]): CaseReviewBucket;
+export declare function getCasePassRate(verdicts: CaseVerdict[]): number | null;
+export declare function buildCaseReviewRows<T extends ReviewableCase>(testCases: T[], recentRuns: VerdictRun[], reportsById: Record<string, VerdictReportSummary | undefined>): CaseReviewRow<T>[];
+/** Search/filter first, then pass-rate ascending; no-data sorts last. */
+export declare function filterAndSortCaseRows<T extends ReviewableCase>(rows: CaseReviewRow<T>[], search: string, filter: CaseReviewFilter): CaseReviewRow<T>[];
+export declare function getCasePagerPosition<T extends ReviewableCase>(rows: CaseReviewRow<T>[], selectedCaseId: string | undefined): {
+    index: number;
+    position: number;
+    total: number;
+    previousId?: string;
+    nextId?: string;
+};
+export interface VersionedRunResult {
+    reportId?: string;
+}
+export interface VersionedRun {
+    results?: Record<string, VersionedRunResult>;
+}
+export interface VersionedReportSummary {
+    testCaseVersion?: number;
+}
+/**
+ * The Cases tab always renders a case's *current* definition, even when the
+ * user arrived from a specific historical run (e.g. a heat-strip cell click).
+ * This detects that mismatch so callers can show a minimal, honest notice
+ * instead of silently presenting a definition the run never actually used.
+ * Deliberately does not resurrect the old per-version selector — just a
+ * disclosure that the definition may have changed since some of the runs
+ * shown here.
+ */
+export declare function hasHistoricalVersionMismatch(currentVersion: number, runs: VersionedRun[], testCaseId: string, reportsById: Record<string, VersionedReportSummary | undefined>): boolean;
+//# sourceMappingURL=benchmarkCaseReview.d.ts.map

package/lib/dist/lib/benchmarkCaseReview.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarkCaseReview.d.ts","sourceRoot":"","sources":["../../benchmarkCaseReview.ts"],"names":[],"mappings":"AAKA;;;;;;;GAOG;AAEH,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;AACtE,MAAM,MAAM,gBAAgB,GAAG,iBAAiB,GAAG,OAAO,GAAG,QAAQ,GAAG,SAAS,CAAC;AAClF,MAAM,MAAM,gBAAgB,GAAG,KAAK,GAAG,OAAO,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;AAC5E,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,MAAM,CAAC;AAO7C,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;CAClB;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,EAC/B,EAAE,EACF,EAAE,EACF,OAAO,EACP,OAAO,EACP,KAAK,GACN,EAAE,cAAc,GAAG,eAAe,CAalC;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,EACV,UAAU,SAAI,GACb,cAAc,GAAG,IAAI,CAKvB;AAED,MAAM,WAAW,oBAAoB;IACnC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,cAAc,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,IAAI,CAAC;IAC5C,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,iFAAiF;IACjF,cAAc,CAAC,EAAE,QAAQ,GAAG,QAAQ,CAAC;CACtC;AAED,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CAC5C;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,cAAc,GAAG,cAAc;IACtE,QAAQ,EAAE,CAAC,CAAC;IACZ,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,MAAM,EAAE,gBAAgB,CAAC;IACzB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED,uFAAuF;AACvF,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,UAAU,GAAG,OAAO,CAM9D;AAED,wBAAgB,sBAAsB,CAAC,CAAC,SAAS,UAAU,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,KAAK,SAAI,GAAG,CAAC,EAAE,CAKtF;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,UAAU,EACf,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,oBAAoB,GAAG,SAAS,CAAC,GAC5D,WAAW,CAsBb;AAED,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,UAAU,EAAE,EAClB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,oBAAoB,GAAG,SAAS,CAAC,GAC5D,WAAW,EAAE,CAEf;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,gBAAgB,CAmB9E;AAED,wBAAgB,eAAe,CAAC,QAAQ,EAAE,WAAW,EAAE,GAAG,MAAM,GAAG,IAAI,CAItE;AAED,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,cAAc,EAC1D,SAAS,EAAE,CAAC,EAAE,EACd,UAAU,EAAE,UAAU,EAAE,EACxB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,oBAAoB,GAAG,SAAS,CAAC,GAC5D,aAAa,CAAC,CAAC,CAAC,EAAE,CAUpB;AAED,yEAAyE;AACzE,wBAAgB,qBAAqB,CAAC,CAAC,SAAS,cAAc,EAC5D,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,gBAAgB,GACvB,aAAa,CAAC,CAAC,CAAC,EAAE,CAgBpB;AAED,wBAAgB,oBAAoB,CAAC,CAAC,SAAS,cAAc,EAC3D,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,EACxB,cAAc,EAAE,MAAM,GAAG,SAAS,GACjC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAS1F;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,YAAY;IAC3B,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;CAC9C;AAED,MAAM,WAAW,sBAAsB;IACrC,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;GAQG;AACH,wBAAgB,4BAA4B,CAC1C,cAAc,EAAE,MAAM,EACtB,IAAI,EAAE,YAAY,EAAE,EACpB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,sBAAsB,GAAG,SAAS,CAAC,GAC9D,OAAO,CAMT"}

package/lib/dist/lib/benchmarkCaseReview.js

@@ -0,0 +1,177 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+const MIN_SWIPE_DISTANCE = 48;
+const HORIZONTAL_SWIPE_RATIO = 1.5;
+const PAGER_DRAG_SLOP = 10;
+const PAGER_EDGE_RESISTANCE = 0.35;
+/**
+ * Latch a horizontal pager drag after a small slop, then preserve that latch
+ * for the rest of the gesture. Pulling beyond either end receives resistance
+ * so the pane communicates the boundary without changing cases.
+ *
+ * Reduced-motion behavior intentionally stays out of this geometry helper;
+ * callers suppress the returned offset while retaining gesture navigation.
+ */
+export function computePagerDrag({ dx, dy, latched, atStart, atEnd, }) {
+    const nextLatched = latched || (Math.abs(dx) > PAGER_DRAG_SLOP &&
+        Math.abs(dx) > Math.abs(dy));
+    if (!nextLatched)
+        return { offset: 0, latched: false };
+    const beyondStart = atStart && dx > 0;
+    const beyondEnd = atEnd && dx < 0;
+    return {
+        offset: (beyondStart || beyondEnd) ? dx * PAGER_EDGE_RESISTANCE : dx,
+        latched: true,
+    };
+}
+/**
+ * Resolve a completed gesture without suppressing native touch movement. A
+ * negative x displacement is a left swipe (next); a positive one is previous.
+ */
+export function resolveSwipeDirection(dx, dy, touchCount = 1) {
+    if (touchCount !== 1)
+        return null;
+    if (Math.abs(dx) < MIN_SWIPE_DISTANCE)
+        return null;
+    if (Math.abs(dx) < HORIZONTAL_SWIPE_RATIO * Math.abs(dy))
+        return null;
+    return dx < 0 ? 'next' : 'prev';
+}
+/** A legacy run with no top-level status is complete once all results are terminal. */
+export function isCompletedVerdictRun(run) {
+    if (run.status)
+        return run.status === 'completed';
+    const results = Object.values(run.results || {});
+    return results.length > 0 && results.every(result => result.status !== 'pending' && result.status !== 'running');
+}
+export function getRecentCompletedRuns(runs, limit = 5) {
+    return [...runs]
+        .filter(isCompletedVerdictRun)
+        .sort((a, b) => new Date(b.createdAt).getTime() - new Date(a.createdAt).getTime())
+        .slice(0, limit);
+}
+/**
+ * Resolve one case×run cell. A real pass/fail verdict from the report is
+ * authoritative and outranks `metricsStatus === 'error'`: metrics/cost
+ * enrichment runs after the agent-vs-judge verdict is already known, so a
+ * later enrichment failure must not overwrite a genuine pass/fail with
+ * 'errored'. `metricsStatus === 'error'` only decides the cell when the
+ * report has no real passFailStatus yet.
+ */
+export function deriveCaseVerdict(run, testCaseId, reportsById) {
+    const result = run.results?.[testCaseId];
+    if (!result || result.status === 'pending' || result.status === 'running')
+        return 'not-run';
+    const report = result.reportId ? reportsById[result.reportId] : undefined;
+    if (report?.passFailStatus === 'passed')
+        return 'passed';
+    if (report?.passFailStatus === 'failed')
+        return 'failed';
+    if (report?.metricsStatus === 'error')
+        return 'errored';
+    // New benchmark documents carry this summary. It is a resilience fallback
+    // for deleted/legacy report documents, not the primary source of truth.
+    if (result.passFailStatus === 'passed')
+        return 'passed';
+    if (result.passFailStatus === 'failed')
+        return 'failed';
+    if (result.status === 'failed' || result.status === 'cancelled' || report?.status === 'failed') {
+        return 'failed';
+    }
+    // A completed result without a verdict means the evaluator did not produce
+    // a usable score. Keep it visually/semantically separate from agent failure.
+    if (result.status === 'completed')
+        return 'errored';
+    return 'not-run';
+}
+export function deriveCaseVerdicts(runs, testCaseId, reportsById) {
+    return runs.map(run => deriveCaseVerdict(run, testCaseId, reportsById));
+}
+/**
+ * Buckets are disjoint by priority. Evaluator errors require attention but do
+ * not become failed verdicts or enter the pass-rate denominator.
+ */
+export function classifyCaseVerdicts(verdicts) {
+    const observed = verdicts.filter(verdict => verdict !== 'not-run');
+    if (observed.length === 0)
+        return 'no-data';
+    const latestThree = verdicts.slice(0, 3);
+    if (latestThree.some(verdict => verdict === 'failed' || verdict === 'errored')) {
+        return 'needs-attention';
+    }
+    const scored = verdicts.filter(verdict => verdict === 'passed' || verdict === 'failed');
+    const hasPass = scored.includes('passed');
+    const hasFail = scored.includes('failed');
+    if (hasPass && hasFail)
+        return 'flaky';
+    if (hasPass)
+        return 'stable';
+    // Sparse histories can put an old failure/error outside the last-three
+    // window. They still have data and are not passing, so attention is the only
+    // honest bucket.
+    return 'needs-attention';
+}
+export function getCasePassRate(verdicts) {
+    const passed = verdicts.filter(verdict => verdict === 'passed').length;
+    const failed = verdicts.filter(verdict => verdict === 'failed').length;
+    return passed + failed === 0 ? null : passed / (passed + failed);
+}
+export function buildCaseReviewRows(testCases, recentRuns, reportsById) {
+    return testCases.map(testCase => {
+        const verdicts = deriveCaseVerdicts(recentRuns, testCase.id, reportsById);
+        return {
+            testCase,
+            verdicts,
+            bucket: classifyCaseVerdicts(verdicts),
+            passRate: getCasePassRate(verdicts),
+        };
+    });
+}
+/** Search/filter first, then pass-rate ascending; no-data sorts last. */
+export function filterAndSortCaseRows(rows, search, filter) {
+    const query = search.trim().toLocaleLowerCase();
+    return rows
+        .filter(row => filter === 'all' || row.bucket === filter)
+        .filter(row => !query ||
+        row.testCase.name.toLocaleLowerCase().includes(query) ||
+        (row.testCase.prompt || '').toLocaleLowerCase().includes(query))
+        .sort((a, b) => {
+        if (a.passRate === null && b.passRate !== null)
+            return 1;
+        if (a.passRate !== null && b.passRate === null)
+            return -1;
+        if (a.passRate !== null && b.passRate !== null && a.passRate !== b.passRate) {
+            return a.passRate - b.passRate;
+        }
+        return a.testCase.name.localeCompare(b.testCase.name);
+    });
+}
+export function getCasePagerPosition(rows, selectedCaseId) {
+    const index = selectedCaseId ? rows.findIndex(row => row.testCase.id === selectedCaseId) : -1;
+    return {
+        index,
+        position: index >= 0 ? index + 1 : 0,
+        total: rows.length,
+        previousId: index > 0 ? rows[index - 1].testCase.id : undefined,
+        nextId: index >= 0 && index < rows.length - 1 ? rows[index + 1].testCase.id : undefined,
+    };
+}
+/**
+ * The Cases tab always renders a case's *current* definition, even when the
+ * user arrived from a specific historical run (e.g. a heat-strip cell click).
+ * This detects that mismatch so callers can show a minimal, honest notice
+ * instead of silently presenting a definition the run never actually used.
+ * Deliberately does not resurrect the old per-version selector — just a
+ * disclosure that the definition may have changed since some of the runs
+ * shown here.
+ */
+export function hasHistoricalVersionMismatch(currentVersion, runs, testCaseId, reportsById) {
+    return runs.some(run => {
+        const result = run.results?.[testCaseId];
+        const report = result?.reportId ? reportsById[result.reportId] : undefined;
+        return typeof report?.testCaseVersion === 'number' && report.testCaseVersion !== currentVersion;
+    });
+}
+//# sourceMappingURL=benchmarkCaseReview.js.map

package/lib/dist/lib/benchmarkCaseReview.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarkCaseReview.js","sourceRoot":"","sources":["../../benchmarkCaseReview.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAgBH,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,sBAAsB,GAAG,GAAG,CAAC;AACnC,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,MAAM,qBAAqB,GAAG,IAAI,CAAC;AAenC;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAC/B,EAAE,EACF,EAAE,EACF,OAAO,EACP,OAAO,EACP,KAAK,GACU;IACf,MAAM,WAAW,GAAG,OAAO,IAAI,CAC7B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe;QAC9B,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAC5B,CAAC;IACF,IAAI,CAAC,WAAW;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAEvD,MAAM,WAAW,GAAG,OAAO,IAAI,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC;IAClC,OAAO;QACL,MAAM,EAAE,CAAC,WAAW,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,qBAAqB,CAAC,CAAC,CAAC,EAAE;QACpE,OAAO,EAAE,IAAI;KACd,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,EAAU,EACV,EAAU,EACV,UAAU,GAAG,CAAC;IAEd,IAAI,UAAU,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAClC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,sBAAsB,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IACtE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;AAClC,CAAC;AAmCD,uFAAuF;AACvF,MAAM,UAAU,qBAAqB,CAAC,GAAe;IACnD,IAAI,GAAG,CAAC,MAAM;QAAE,OAAO,GAAG,CAAC,MAAM,KAAK,WAAW,CAAC;IAClD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IACjD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAClD,MAAM,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,CAC3D,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAuB,IAAS,EAAE,KAAK,GAAG,CAAC;IAC/E,OAAO,CAAC,GAAG,IAAI,CAAC;SACb,MAAM,CAAC,qBAAqB,CAAC;SAC7B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;SACjF,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,GAAe,EACf,UAAkB,EAClB,WAA6D;IAE7D,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC;IACzC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE5F,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1E,IAAI,MAAM,EAAE,cAAc,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACzD,IAAI,MAAM,EAAE,cAAc,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACzD,IAAI,MAAM,EAAE,aAAa,KAAK,OAAO;QAAE,OAAO,SAAS,CAAC;IAExD,0EAA0E;IAC1E,wEAAwE;IACxE,IAAI,MAAM,CAAC,cAAc,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACxD,IAAI,MAAM,CAAC,cAAc,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAExD,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,IAAI,MAAM,EAAE,MAAM,KAAK,QAAQ,EAAE,CAAC;QAC/F,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,2EAA2E;IAC3E,6EAA6E;IAC7E,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW;QAAE,OAAO,SAAS,CAAC;IACpD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,IAAkB,EAClB,UAAkB,EAClB,WAA6D;IAE7D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,iBAAiB,CAAC,GAAG,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;AAC1E,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,QAAuB;IAC1D,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;IACnE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAE5C,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,IAAI,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,SAAS,CAAC,EAAE,CAAC;QAC/E,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAED,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,QAAQ,CAAC,CAAC;IACxF,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAI,OAAO,IAAI,OAAO;QAAE,OAAO,OAAO,CAAC;IACvC,IAAI,OAAO;QAAE,OAAO,QAAQ,CAAC;IAE7B,uEAAuE;IACvE,6EAA6E;IAC7E,iBAAiB;IACjB,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,QAAuB;IACrD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;IACvE,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;IACvE,OAAO,MAAM,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,SAAc,EACd,UAAwB,EACxB,WAA6D;IAE7D,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;QAC9B,MAAM,QAAQ,GAAG,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;QAC1E,OAAO;YACL,QAAQ;YACR,QAAQ;YACR,MAAM,EAAE,oBAAoB,CAAC,QAAQ,CAAC;YACtC,QAAQ,EAAE,eAAe,CAAC,QAAQ,CAAC;SACpC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,qBAAqB,CACnC,IAAwB,EACxB,MAAc,EACd,MAAwB;IAExB,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,iBAAiB,EAAE,CAAC;IAChD,OAAO,IAAI;SACR,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,KAAK,KAAK,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC;SACxD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK;QACnB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;QACrD,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,iBAAiB,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAChE;SACA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QACzD,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC5E,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QACjC,CAAC;QACD,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACP,CAAC;AAED,MAAM,UAAU,oBAAoB,CAClC,IAAwB,EACxB,cAAkC;IAElC,MAAM,KAAK,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,OAAO;QACL,KAAK;QACL,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,KAAK,EAAE,IAAI,CAAC,MAAM;QAClB,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;QAC/D,MAAM,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;KACxF,CAAC;AACJ,CAAC;AAcD;;;;;;;;GAQG;AACH,MAAM,UAAU,4BAA4B,CAC1C,cAAsB,EACtB,IAAoB,EACpB,UAAkB,EAClB,WAA+D;IAE/D,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QACrB,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC3E,OAAO,OAAO,MAAM,EAAE,eAAe,KAAK,QAAQ,IAAI,MAAM,CAAC,eAAe,KAAK,cAAc,CAAC;IAClG,CAAC,CAAC,CAAC;AACL,CAAC"}

package/lib/dist/lib/benchmarkImage.d.ts

@@ -0,0 +1,52 @@
+import type { BenchmarkImage, TestCase } from '../types/index.js';
+/** Eval conditions frozen into an image digest. */
+export interface ImageEvalConditions {
+    evaluatorId?: string;
+    judgeModelId?: string;
+}
+/** Bump when the digest input shape changes (invalidates old digests). */
+export declare const IMAGE_DIGEST_VERSION = 1;
+/**
+ * Deterministic JSON: objects serialized with sorted keys, recursively.
+ * Arrays keep their order (order-sensitivity is decided by the caller).
+ */
+export declare function canonicalStringify(value: unknown): string;
+/**
+ * Content fingerprint of a single test case. Uses CONTENT only — never the
+ * storage id — so re-imported test cases (fresh ids, same content) fingerprint
+ * identically. Fields chosen to match what actually changes agent behavior
+ * and judging: prompt, context, expected outcomes/trajectory, tools.
+ */
+export declare function fingerprintTestCase(tc: Partial<TestCase> & {
+    name: string;
+}): {
+    name: string;
+    contentHash: string;
+};
+/**
+ * Compute the image digest for a set of test cases + eval conditions.
+ * Order-insensitive over test cases (fingerprints are sorted), content- and
+ * condition-sensitive.
+ */
+export declare function computeImageDigest(input: {
+    testCases: Array<Partial<TestCase> & {
+        name: string;
+    }>;
+    evalConditions?: ImageEvalConditions;
+}): string;
+/** Storage id for an image doc (content-addressed — one doc per digest). */
+export declare function imageIdForDigest(digest: string): string;
+/**
+ * Build a full image doc for storage. `create` on the storage side is
+ * find-or-create keyed on the digest, so calling this repeatedly for the
+ * same inputs is harmless.
+ */
+export declare function buildImageDoc(input: {
+    testCases: Array<Partial<TestCase> & {
+        id?: string;
+        name: string;
+    }>;
+    evalConditions?: ImageEvalConditions;
+    tags?: string[];
+}): BenchmarkImage;
+//# sourceMappingURL=benchmarkImage.d.ts.map

package/lib/dist/lib/benchmarkImage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarkImage.d.ts","sourceRoot":"","sources":["../../benchmarkImage.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExD,mDAAmD;AACnD,MAAM,WAAW,mBAAmB;IAClC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,0EAA0E;AAC1E,eAAO,MAAM,oBAAoB,IAAI,CAAC;AAEtC;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAEzD;AAmBD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CACjC,EAAE,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAA;CAAE,CAYvC;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE;IACxC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG;QAAE,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACvD,cAAc,CAAC,EAAE,mBAAmB,CAAC;CACtC,GAAG,MAAM,CAaT;AAED,4EAA4E;AAC5E,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE;IACnC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpE,cAAc,CAAC,EAAE,mBAAmB,CAAC;IACrC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB,GAAG,cAAc,CAkBjB"}

package/lib/dist/lib/benchmarkImage.js

@@ -0,0 +1,113 @@
+/*
+ * Copyright OpenSearch Contributors
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * Benchmark images — content-addressed identity for evaluation conditions.
+ *
+ * An image freezes the "controls" of an evaluation run: the test-case
+ * contents and the eval conditions (evaluator, judge model). The digest is a
+ * SHA-256 over a canonical serialization, so:
+ *
+ *   - two runs with the same digest are comparable **by construction**
+ *     (same tests, same judge conditions — only the agent varies);
+ *   - re-running the same command yields the same digest → the image is
+ *     found, not re-created (inherent dedup: identity is content, not name).
+ *
+ * Names are docker-style *tags*: mutable labels pointing at a digest, never
+ * identity. See the benchmark-dedup design discussion for rationale.
+ */
+import { createHash } from 'crypto';
+/** Bump when the digest input shape changes (invalidates old digests). */
+export const IMAGE_DIGEST_VERSION = 1;
+/**
+ * Deterministic JSON: objects serialized with sorted keys, recursively.
+ * Arrays keep their order (order-sensitivity is decided by the caller).
+ */
+export function canonicalStringify(value) {
+    return JSON.stringify(sortValue(value));
+}
+function sortValue(value) {
+    if (Array.isArray(value))
+        return value.map(sortValue);
+    if (value && typeof value === 'object') {
+        const out = {};
+        for (const key of Object.keys(value).sort()) {
+            const v = value[key];
+            if (v !== undefined)
+                out[key] = sortValue(v);
+        }
+        return out;
+    }
+    return value;
+}
+function sha256Hex(input) {
+    return createHash('sha256').update(input, 'utf8').digest('hex');
+}
+/**
+ * Content fingerprint of a single test case. Uses CONTENT only — never the
+ * storage id — so re-imported test cases (fresh ids, same content) fingerprint
+ * identically. Fields chosen to match what actually changes agent behavior
+ * and judging: prompt, context, expected outcomes/trajectory, tools.
+ */
+export function fingerprintTestCase(tc) {
+    const content = {
+        name: tc.name,
+        initialPrompt: tc.initialPrompt ?? null,
+        context: tc.context ?? null,
+        tools: tc.tools ?? null,
+        expectedOutcomes: tc.expectedOutcomes ?? null,
+        expectedTrajectory: tc.expectedTrajectory ?? null,
+        // Code-imported cases: sourceHash already fingerprints the executable body.
+        sourceHash: tc.sourceHash ?? null,
+    };
+    return { name: tc.name, contentHash: sha256Hex(canonicalStringify(content)) };
+}
+/**
+ * Compute the image digest for a set of test cases + eval conditions.
+ * Order-insensitive over test cases (fingerprints are sorted), content- and
+ * condition-sensitive.
+ */
+export function computeImageDigest(input) {
+    const fingerprints = input.testCases
+        .map(fingerprintTestCase)
+        .sort((a, b) => a.contentHash.localeCompare(b.contentHash));
+    const payload = {
+        v: IMAGE_DIGEST_VERSION,
+        testCases: fingerprints.map((f) => f.contentHash),
+        evalConditions: {
+            evaluatorId: input.evalConditions?.evaluatorId ?? null,
+            judgeModelId: input.evalConditions?.judgeModelId ?? null,
+        },
+    };
+    return sha256Hex(canonicalStringify(payload));
+}
+/** Storage id for an image doc (content-addressed — one doc per digest). */
+export function imageIdForDigest(digest) {
+    return `img-${digest}`;
+}
+/**
+ * Build a full image doc for storage. `create` on the storage side is
+ * find-or-create keyed on the digest, so calling this repeatedly for the
+ * same inputs is harmless.
+ */
+export function buildImageDoc(input) {
+    const digest = computeImageDigest(input);
+    const fingerprints = input.testCases
+        .map((tc) => ({ ...fingerprintTestCase(tc), id: tc.id }))
+        .sort((a, b) => a.contentHash.localeCompare(b.contentHash));
+    return {
+        id: imageIdForDigest(digest),
+        docType: 'benchmark-image',
+        digest,
+        tags: input.tags ?? [],
+        testCaseFingerprints: fingerprints,
+        testCaseCount: fingerprints.length,
+        evalConditions: {
+            ...(input.evalConditions?.evaluatorId ? { evaluatorId: input.evalConditions.evaluatorId } : {}),
+            ...(input.evalConditions?.judgeModelId ? { judgeModelId: input.evalConditions.judgeModelId } : {}),
+        },
+        createdAt: new Date().toISOString(),
+    };
+}
+//# sourceMappingURL=benchmarkImage.js.map

package/lib/dist/lib/benchmarkImage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarkImage.js","sourceRoot":"","sources":["../../benchmarkImage.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AASpC,0EAA0E;AAC1E,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAEtC;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAC/C,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACtD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvC,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAgC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACvE,MAAM,CAAC,GAAI,KAAiC,CAAC,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,KAAK,SAAS;gBAAE,GAAG,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,KAAa;IAC9B,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,EAAwC;IAExC,MAAM,OAAO,GAAG;QACd,IAAI,EAAE,EAAE,CAAC,IAAI;QACb,aAAa,EAAE,EAAE,CAAC,aAAa,IAAI,IAAI;QACvC,OAAO,EAAE,EAAE,CAAC,OAAO,IAAI,IAAI;QAC3B,KAAK,EAAE,EAAE,CAAC,KAAK,IAAI,IAAI;QACvB,gBAAgB,EAAE,EAAE,CAAC,gBAAgB,IAAI,IAAI;QAC7C,kBAAkB,EAAE,EAAE,CAAC,kBAAkB,IAAI,IAAI;QACjD,4EAA4E;QAC5E,UAAU,EAAE,EAAE,CAAC,UAAU,IAAI,IAAI;KAClC,CAAC;IACF,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;AAChF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAGlC;IACC,MAAM,YAAY,GAAG,KAAK,CAAC,SAAS;SACjC,GAAG,CAAC,mBAAmB,CAAC;SACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAG;QACd,CAAC,EAAE,oBAAoB;QACvB,SAAS,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;QACjD,cAAc,EAAE;YACd,WAAW,EAAE,KAAK,CAAC,cAAc,EAAE,WAAW,IAAI,IAAI;YACtD,YAAY,EAAE,KAAK,CAAC,cAAc,EAAE,YAAY,IAAI,IAAI;SACzD;KACF,CAAC;IACF,OAAO,SAAS,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,4EAA4E;AAC5E,MAAM,UAAU,gBAAgB,CAAC,MAAc;IAC7C,OAAO,OAAO,MAAM,EAAE,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAI7B;IACC,MAAM,MAAM,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,YAAY,GAAG,KAAK,CAAC,SAAS;SACjC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,mBAAmB,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;SACxD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IAC9D,OAAO;QACL,EAAE,EAAE,gBAAgB,CAAC,MAAM,CAAC;QAC5B,OAAO,EAAE,iBAAiB;QAC1B,MAAM;QACN,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;QACtB,oBAAoB,EAAE,YAAY;QAClC,aAAa,EAAE,YAAY,CAAC,MAAM;QAClC,cAAc,EAAE;YACd,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,cAAc,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/F,GAAG,CAAC,KAAK,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,cAAc,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnG;QACD,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACpC,CAAC;AACJ,CAAC"}