@tangle-network/agent-eval 0.95.0 → 0.96.0

package/dist/campaign/proposers/fapo.d.ts

@@ -1,120 +0,0 @@
-/**
- * FAPO (Fully Autonomous Prompt Optimization) is an orchestration policy, not
- * a new prompt mutation primitive. The paper's loop evaluates an inspectable
- * workflow, attributes failures to an edit level, proposes ONE scoped change,
- * reviews it, measures it, and escalates from prompt -> parameters -> structure
- * only when prompt-level search is exhausted and attribution supports the
- * higher-cost edit.
- *
- * This substrate proposer encodes that policy while keeping the edit generators
- * pluggable:
- *   - prompt: usually `gepaProposer`, `skillOptProposer`, or a runtime reflective proposer
- *   - parameter: `parameterSweepProposer` or a caller-supplied config proposer
- *   - structural: a caller-supplied code/worktree proposer from agent-runtime
- *
- * It deliberately does not import Claude Code, LangGraph, or Cisco's tenant
- * runtime. agent-eval owns measurement and proposer contracts; runtime-shaped
- * code generation stays downstream.
- *
- * Grounded sources:
- *   - Kassianik et al., "FAPO: Fully Autonomous Prompt Optimization of
- *     Multi-Step LLM Pipelines", arXiv:2606.19605v1.
- *   - cisco-foundation-ai/fully-automated-prompt-optimization at
- *     376b50c57d5e2423e5a5de46e0d315a761d272d8.
- */
-import type { ProposeContext, ProposedCandidate, SurfaceProposer } from '../types';
-export type FapoOptimizationLevel = 'prompt' | 'parameter' | 'structural';
-export interface FapoScopeContract {
-    /** Levels the tenant/playbook allows. Defaults to the levels with proposers. */
-    allowedLevels?: readonly FapoOptimizationLevel[];
-    /** Explicitly forbidden levels; wins over `allowedLevels`. */
-    forbiddenLevels?: readonly FapoOptimizationLevel[];
-}
-export interface FapoFailureCluster {
-    label: string;
-    level: FapoOptimizationLevel;
-    count: number;
-    confidence?: 'high' | 'medium' | 'low';
-    suggestedFix?: string;
-    caseIds?: string[];
-}
-export interface FapoAttributionSignals {
-    counts: Record<FapoOptimizationLevel, number>;
-    clusters: FapoFailureCluster[];
-}
-export interface FapoReviewIssue {
-    checkName: string;
-    severity: 'block' | 'warn';
-    description: string;
-    location?: string;
-}
-export interface FapoReviewResult {
-    verdict: 'pass' | 'warn' | 'fail';
-    issues?: FapoReviewIssue[];
-    suggestions?: string[];
-}
-export interface FapoReviewInput<TFindings = unknown> {
-    level: FapoOptimizationLevel;
-    candidate: ProposedCandidate;
-    context: ProposeContext<TFindings>;
-    reason: string;
-}
-export interface FapoProposerOptions<TFindings = unknown> {
-    /** Level-specific candidate proposers. At least one is required. */
-    proposers?: Partial<Record<FapoOptimizationLevel, SurfaceProposer<TFindings>>>;
-    /** Convenience aliases for `proposers.<level>`. */
-    promptProposer?: SurfaceProposer<TFindings>;
-    parameterProposer?: SurfaceProposer<TFindings>;
-    structuralProposer?: SurfaceProposer<TFindings>;
-    /** Tenant/playbook-derived allowed and forbidden edit levels. */
-    scope?: FapoScopeContract;
-    /**
-     * Independent reviewer hook. Return `fail` to block a candidate before eval,
-     * mirroring FAPO's variant-reviewer phase.
-     */
-    reviewCandidate?: (input: FapoReviewInput<TFindings>) => Promise<FapoReviewResult>;
-    /**
-     * FAPO proposes one scoped change per cycle. Keep this at 1 unless you are
-     * intentionally relaxing the paper loop for a batch experiment.
-     */
-    proposalsPerCycle?: number;
-    /** Consecutive non-improving variants required before a level is exhausted. Default 3. */
-    plateauWindow?: number;
-    /** Distinct strategies required before declaring a plateau. Default 3. */
-    minDistinctStrategies?: number;
-    /** Candidate score delta needed to count as an improvement. Default 0. */
-    minImprovement?: number;
-    /** Paper-faithful default: try prompt edits before escalating. */
-    promptFirst?: boolean;
-    /** Paper-faithful default: try parameter/config edits before structural code edits. */
-    parameterBeforeStructural?: boolean;
-}
-/** Build a FAPO policy proposer from level-specific candidate generators. */
-export declare function fapoProposer<TFindings = unknown>(opts: FapoProposerOptions<TFindings>): SurfaceProposer<TFindings>;
-export declare function extractFapoAttributionSignals(findings: readonly unknown[]): FapoAttributionSignals;
-export type JsonPrimitive = string | number | boolean | null;
-export type JsonValue = JsonPrimitive | JsonValue[] | {
-    [key: string]: JsonValue;
-};
-export interface ParameterChange {
-    path: string | readonly string[];
-    value: JsonValue;
-}
-export interface ParameterCandidate {
-    label: string;
-    rationale: string;
-    /** Deep-merged into the current JSON surface. */
-    patch?: Record<string, JsonValue>;
-    /** Dot-path writes, e.g. `{ path: 'retrieval.k', value: 10 }`. */
-    changes?: readonly ParameterChange[];
-}
-export interface ParameterSweepProposerOptions {
-    candidates: readonly ParameterCandidate[];
-    /** Optional parser for non-JSON config surface strings. */
-    parse?: (surface: string) => Record<string, JsonValue>;
-    /** Optional serializer for non-JSON config surface strings. */
-    stringify?: (config: Record<string, JsonValue>) => string;
-}
-/** Config/parameter-level proposer for FAPO's middle escalation level. */
-export declare function parameterSweepProposer(opts: ParameterSweepProposerOptions): SurfaceProposer;
-//# sourceMappingURL=fapo.d.ts.map

package/dist/campaign/proposers/fapo.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fapo.d.ts","sourceRoot":"","sources":["../../../src/campaign/proposers/fapo.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EAIV,cAAc,EACd,iBAAiB,EACjB,eAAe,EAChB,MAAM,UAAU,CAAA;AAGjB,MAAM,MAAM,qBAAqB,GAAG,QAAQ,GAAG,WAAW,GAAG,YAAY,CAAA;AAMzE,MAAM,WAAW,iBAAiB;IAChC,gFAAgF;IAChF,aAAa,CAAC,EAAE,SAAS,qBAAqB,EAAE,CAAA;IAChD,8DAA8D;IAC9D,eAAe,CAAC,EAAE,SAAS,qBAAqB,EAAE,CAAA;CACnD;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAA;IACb,KAAK,EAAE,qBAAqB,CAAA;IAC5B,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAA;IACtC,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;CACnB;AAED,MAAM,WAAW,sBAAsB;IACrC,MAAM,EAAE,MAAM,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAA;IAC7C,QAAQ,EAAE,kBAAkB,EAAE,CAAA;CAC/B;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,EAAE,OAAO,GAAG,MAAM,CAAA;IAC1B,WAAW,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAAA;IACjC,MAAM,CAAC,EAAE,eAAe,EAAE,CAAA;IAC1B,WAAW,CAAC,EAAE,MAAM,EAAE,CAAA;CACvB;AAED,MAAM,WAAW,eAAe,CAAC,SAAS,GAAG,OAAO;IAClD,KAAK,EAAE,qBAAqB,CAAA;IAC5B,SAAS,EAAE,iBAAiB,CAAA;IAC5B,OAAO,EAAE,cAAc,CAAC,SAAS,CAAC,CAAA;IAClC,MAAM,EAAE,MAAM,CAAA;CACf;AAED,MAAM,WAAW,mBAAmB,CAAC,SAAS,GAAG,OAAO;IACtD,oEAAoE;IACpE,SAAS,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,qBAAqB,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;IAC9E,mDAAmD;IACnD,cAAc,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAA;IAC3C,iBAAiB,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAA;IAC9C,kBAAkB,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAA;IAC/C,iEAAiE;IACjE,KAAK,CAAC,EAAE,iBAAiB,CAAA;IACzB;;;OAGG;IACH,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,eAAe,CAAC,SAAS,CAAC,KAAK,OAAO,CAAC,gBAAgB,CAAC,CAAA;IAClF;;;OAGG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,0FAA0F;IAC1F,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,0EAA0E;IAC1E,qBAAqB,CAAC,EAAE,MAAM,CAAA;IAC9B,0EAA0E;IAC1E,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,kEAAkE;IAClE,WAAW,CAAC,EAAE,OAAO,CAAA;IACrB,uFAAuF;IACvF,yBAAyB,CAAC,EAAE,OAAO,CAAA;CACpC;AAcD,6EAA6E;AAC7E,wBAAgB,YAAY,CAAC,SAAS,GAAG,OAAO,EAC9C,IAAI,EAAE,mBAAmB,CAAC,SAAS,CAAC,GACnC,eAAe,CAAC,SAAS,CAAC,CAsF5B;AAiMD,wBAAgB,6BAA6B,CAC3C,QAAQ,EAAE,SAAS,OAAO,EAAE,GAC3B,sBAAsB,CAUxB;AA0LD,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAAA;AAC5D,MAAM,MAAM,SAAS,GAAG,aAAa,GAAG,SAAS,EAAE,GAAG;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,CAAA;AAElF,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAA;IAChC,KAAK,EAAE,SAAS,CAAA;CACjB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAA;IACb,SAAS,EAAE,MAAM,CAAA;IACjB,iDAAiD;IACjD,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IACjC,kEAAkE;IAClE,OAAO,CAAC,EAAE,SAAS,eAAe,EAAE,CAAA;CACrC;AAED,MAAM,WAAW,6BAA6B;IAC5C,UAAU,EAAE,SAAS,kBAAkB,EAAE,CAAA;IACzC,2DAA2D;IAC3D,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;IACtD,+DAA+D;IAC/D,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,MAAM,CAAA;CAC1D;AAED,0EAA0E;AAC1E,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,6BAA6B,GAAG,eAAe,CA8B3F"}

package/dist/campaign/proposers/gepa.d.ts

@@ -1,86 +0,0 @@
-/**
- * `gepaProposer` — a reflective `SurfaceProposer` for prompt-tier surfaces.
- * Each generation it reflects on the prior best candidate's per-scenario
- * scores + weakest dimensions, asks an LLM to propose targeted rewrites of
- * the current surface, and returns them as the next population.
- *
- * Maps onto the GEPA paper (Agrawal et al., arXiv:2507.19457):
- *   - *Reflection*: each generation reflects on the best parent's weakest
- *     dimensions + per-scenario top/bottom scores to propose targeted rewrites.
- *   - *Pareto frontier*: `runOptimization` maintains the non-dominated set of
- *     surfaces across generations (per-scenario objective vectors) and supplies
- *     it as `ctx.paretoParents`. A surface uniquely best on one hard scenario
- *     survives even when its mean composite is lower.
- *   - *Combine complementary lessons*: when the frontier has >1 member, the
- *     first population slot is a merge of those parents' strengths (one LLM
- *     call citing each parent's winning scenarios). Toggle via `combineParents`.
- * Dominance is computed by the package-canonical `paretoFrontier` (`pareto.ts`).
- *
- * Optional `constraints` move structured-doc guards into the proposer
- * (preserve H2 section headings, cap sentence-level edits) — useful when
- * the surface IS a structured procedure like a SKILL.md / runbook /
- * judge rubric. When `constraints` is omitted, behavior is unchanged.
- *
- * The proposer is surface-agnostic — any string surface in any consumer opts
- * in by selecting it. Reuses the generic reflection primitive
- * (`buildReflectionPrompt` / `parseReflectionResponse`) and the router client.
- *
- * Earns its keep where there is real per-instance signal (which the
- * dimensional + per-scenario evidence + the `LabeledScenarioStore` flywheel
- * now provide). For thin-signal surfaces it degrades to plain reflection.
- * On generation 0 (no history) it reflects on the current surface against
- * the mutation primitives alone.
- */
-import { type LlmClientOptions } from '../../llm-client';
-import type { SurfaceProposer } from '../types';
-export interface GepaProposerConstraints {
-    /** H2 section headings that MUST appear unchanged in every candidate.
-     *  When set, the proposer auto-detects current H2s if this is empty AND
-     *  rejects any candidate that drops or renames a preserved heading.
-     *  Use when the surface is a structured doc (SKILL.md, runbook,
-     *  sectioned system prompt, judge rubric). */
-    preserveSections?: string[];
-    /** Maximum sentence-level edits per candidate vs the parent surface.
-     *  Rejection threshold = maxSentenceEdits × 2 (counts adds + removes).
-     *  Inspired by SkillOpt's edit-budget as a "textual learning rate."
-     *  Cap prevents an LLM rewrite from overwriting useful prior rules. */
-    maxSentenceEdits?: number;
-}
-export interface GepaProposerOptions {
-    /** Router transport (apiKey/baseUrl). */
-    llm: LlmClientOptions;
-    /** Model that performs the reflection. */
-    model: string;
-    /** What is being optimized — appears in the reflection prompt for orientation. */
-    target: string;
-    /** Surface-specific mutation levers offered to the model. */
-    mutationPrimitives?: string[];
-    /** Top/bottom scenarios surfaced as evidence each generation. Default 3. */
-    evidenceK?: number;
-    /** Reflection sampling temperature. Default 0.7. */
-    temperature?: number;
-    /** Reflection max tokens. Default 6000. */
-    maxTokens?: number;
-    /** Structured-doc constraints. Candidates violating any are rejected
-     *  post-parse and dropped from the returned population. */
-    constraints?: GepaProposerConstraints;
-    /** GEPA combine-complementary-lessons: when the loop supplies a Pareto
-     *  frontier of >1 non-dominated parents (`ctx.paretoParents`), spend one
-     *  slot of the population on a merge of their strengths. Default `true` —
-     *  this is the GEPA-faithful behavior; the merge only fires once the
-     *  frontier has more than one member (generation ≥ 1). Set `false` for
-     *  pure single-parent reflection. */
-    combineParents?: boolean;
-    /** Cap on how many frontier parents feed one combine prompt (highest
-     *  composite first), to bound prompt size. Default 4. */
-    combineMaxParents?: number;
-}
-export declare function gepaProposer(opts: GepaProposerOptions): SurfaceProposer;
-/** Extract H2 headings (`## Foo`) from a markdown surface. Exported for
- *  consumers building custom mutators that share the same invariant. */
-export declare function extractH2Sections(text: string): string[];
-/** Sentence-level edit distance — count distinct add/remove ops between
- *  two surfaces via a normalised line-by-line set diff. Treats trivial
- *  whitespace as identical. Exported for tests + consumer-side validators. */
-export declare function countSentenceEdits(baseline: string, candidate: string): number;
-//# sourceMappingURL=gepa.d.ts.map

package/dist/campaign/proposers/gepa.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gepa.d.ts","sourceRoot":"","sources":["../../../src/campaign/proposers/gepa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAEH,OAAO,EAAW,KAAK,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAOjE,OAAO,KAAK,EAAqC,eAAe,EAAE,MAAM,UAAU,CAAA;AA6BlF,MAAM,WAAW,uBAAuB;IACtC;;;;kDAI8C;IAC9C,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAA;IAC3B;;;2EAGuE;IACvE,gBAAgB,CAAC,EAAE,MAAM,CAAA;CAC1B;AAED,MAAM,WAAW,mBAAmB;IAClC,yCAAyC;IACzC,GAAG,EAAE,gBAAgB,CAAA;IACrB,0CAA0C;IAC1C,KAAK,EAAE,MAAM,CAAA;IACb,kFAAkF;IAClF,MAAM,EAAE,MAAM,CAAA;IACd,6DAA6D;IAC7D,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAA;IAC7B,4EAA4E;IAC5E,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,oDAAoD;IACpD,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,2CAA2C;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB;+DAC2D;IAC3D,WAAW,CAAC,EAAE,uBAAuB,CAAA;IACrC;;;;;yCAKqC;IACrC,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB;6DACyD;IACzD,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,mBAAmB,GAAG,eAAe,CAmHvE;AA2CD;wEACwE;AACxE,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAOxD;AAED;;8EAE8E;AAC9E,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAY9E"}

package/dist/campaign/proposers/halo.d.ts

@@ -1,44 +0,0 @@
-/**
- * `haloProposer` — wraps the REAL halo-engine (Inference.net's hierarchical
- * agentic trace analyzer, `pip install halo-engine`, repo context-labs/halo)
- * as an agent-eval `SurfaceProposer`, so HALO competes head-to-head with
- * `gepaProposer` — and with our own `traceAnalystProposer` — inside `compareProposers`
- * on identical traces / scenarios / held-out scoring.
- *
- * It PRESERVES halo's actual working usage — `analyze` shells out to the
- * published CLI (`halo <traces.jsonl> -p <prompt> -m <model>`) and uses its real
- * RLM findings verbatim. We do NOT reimplement its analysis; that would make the
- * benchmark meaningless. The materialize/apply pipeline is the shared
- * `analysisEditProposer` — identical to `traceAnalystProposer`, which is what makes
- * the comparison apples-to-apples.
- *
- * Fail-loud: no traces → throw; halo errors → throw; empty findings → throw.
- */
-import type { LlmClientOptions } from '../../llm-client';
-import type { ProposeContext, SurfaceProposer } from '../types';
-export interface HaloProposerOptions {
-    /** OpenAI-compatible base URL for BOTH halo's RLM analysis and the apply
-     *  step (e.g. the Tangle router `https://router.tangle.tools/v1`). */
-    baseUrl: string;
-    /** Bearer key (else relies on OPENAI_API_KEY in the env halo inherits). */
-    apiKey?: string;
-    /** Model for halo's `--model` (its RLM). Default 'gpt-5.4-mini' (halo's own default). */
-    model?: string;
-    /** Model used to APPLY halo's findings to the prompt surface. Default = `model`. */
-    applyModel?: string;
-    /** The real halo binary. Default 'halo' (from `pip install halo-engine`). */
-    haloBin?: string;
-    /** Resolve the OTLP traces (JSONL string) halo should analyze for THIS
-     *  generation. Returning empty throws (halo has nothing to analyze). */
-    resolveTraces: (ctx: ProposeContext) => string | Promise<string>;
-    /** halo's analysis prompt (`-p`). Default targets the failure taxonomy. */
-    analysisPrompt?: string;
-    /** halo `--max-depth` / `--max-turns` passthrough. */
-    maxDepth?: number;
-    maxTurns?: number;
-    /** Test seam: inject a fetch for the apply-step callLlm (no network in unit tests). */
-    fetchImpl?: LlmClientOptions['fetch'];
-}
-/** Wrap the real halo-engine CLI as a SurfaceProposer (prompt-tier). */
-export declare function haloProposer(opts: HaloProposerOptions): SurfaceProposer;
-//# sourceMappingURL=halo.d.ts.map

package/dist/campaign/proposers/halo.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"halo.d.ts","sourceRoot":"","sources":["../../../src/campaign/proposers/halo.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AACxD,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,UAAU,CAAA;AAK/D,MAAM,WAAW,mBAAmB;IAClC;0EACsE;IACtE,OAAO,EAAE,MAAM,CAAA;IACf,2EAA2E;IAC3E,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,yFAAyF;IACzF,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,oFAAoF;IACpF,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,6EAA6E;IAC7E,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB;4EACwE;IACxE,aAAa,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;IAChE,2EAA2E;IAC3E,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,sDAAsD;IACtD,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,uFAAuF;IACvF,SAAS,CAAC,EAAE,gBAAgB,CAAC,OAAO,CAAC,CAAA;CACtC;AAKD,wEAAwE;AACxE,wBAAgB,YAAY,CAAC,IAAI,EAAE,mBAAmB,GAAG,eAAe,CAgDvE"}

package/dist/campaign/proposers/halo.test.d.ts

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

package/dist/campaign/proposers/halo.test.d.ts.map

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

package/dist/campaign/proposers/memory.d.ts

@@ -1,47 +0,0 @@
-/**
- * `memoryCurationProposer` — a CURATOR `SurfaceProposer`, the complement to the
- * OPTIMIZER proposers (`gepaProposer` rewrites the prompt; this one BUILDS a
- * searchable memory of what prior trajectories taught and grafts the most
- * relevant lessons onto the surface).
- *
- * Each generation it:
- *  1. collects lessons — this generation's trace-analyst `findings` PLUS the
- *     memory already carried in the parent surface (so memory accumulates
- *     across generations instead of resetting);
- *  2. curates them — normalizes, deduplicates near-identical lessons, and ranks
- *     by recurrence (a lesson seen across many findings outranks a one-off);
- *  3. retrieves the top-K and writes them back as a single delimited memory
- *     block in the surface (idempotent — the block is replaced, never stacked,
- *     so the prompt does not grow without bound).
- *
- * This is the substrate behind the "knowledge base of working trajectories" the
- * agent searches: the curated block IS the retrieved memory the next run reads.
- * Curation is DETERMINISTIC (no LLM) so a lift it produces is attributable to
- * the lessons, not to model noise in a rewrite. An optional `distill` LLM step
- * can compress raw findings into crisp imperatives; default is verbatim.
- *
- * Fail-loud: never fabricates a lesson. With no findings and no prior memory it
- * returns no candidate (nothing learned yet — gen 0). It does not throw on an
- * empty generation because early generations legitimately have no findings.
- */
-import { type LlmClientOptions } from '../../llm-client';
-import type { SurfaceProposer } from '../types';
-export interface MemoryCurationProposerOptions {
-    /** Top-K lessons retained in the surface memory block. Default 12. */
-    maxEntries?: number;
-    /** Heading rendered above the lessons inside the block. Default below. */
-    sectionHeading?: string;
-    /**
-     * Optional LLM distillation: compress raw findings into crisp, generalizable
-     * one-line imperatives before curating. Omit for verbatim (deterministic).
-     */
-    distill?: {
-        baseUrl: string;
-        apiKey?: string;
-        model: string;
-        fetchImpl?: LlmClientOptions['fetch'];
-    };
-}
-/** Build the CURATOR proposer. */
-export declare function memoryCurationProposer(opts?: MemoryCurationProposerOptions): SurfaceProposer;
-//# sourceMappingURL=memory.d.ts.map

package/dist/campaign/proposers/memory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../../src/campaign/proposers/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,EAAW,KAAK,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AACjE,OAAO,KAAK,EAAqC,eAAe,EAAE,MAAM,UAAU,CAAA;AAYlF,MAAM,WAAW,6BAA6B;IAC5C,sEAAsE;IACtE,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,0EAA0E;IAC1E,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB;;;OAGG;IACH,OAAO,CAAC,EAAE;QACR,OAAO,EAAE,MAAM,CAAA;QACf,MAAM,CAAC,EAAE,MAAM,CAAA;QACf,KAAK,EAAE,MAAM,CAAA;QACb,SAAS,CAAC,EAAE,gBAAgB,CAAC,OAAO,CAAC,CAAA;KACtC,CAAA;CACF;AA+CD,kCAAkC;AAClC,wBAAgB,sBAAsB,CAAC,IAAI,GAAE,6BAAkC,GAAG,eAAe,CAyDhG"}

package/dist/campaign/proposers/memory.test.d.ts

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

package/dist/campaign/proposers/memory.test.d.ts.map

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

package/dist/campaign/proposers/skill-opt.d.ts

@@ -1,88 +0,0 @@
-/**
- * `skillOptProposer` — a patch-mode `SurfaceProposer` implementing SkillOpt
- * (Microsoft, arXiv:2605.23904). Where `gepaProposer` regenerates the whole
- * surface by reflection, SkillOpt proposes BOUNDED, anchored edits
- * (add/delete/replace) to ONE skill document, so a good rule introduced
- * earlier is not clobbered by a later sweeping rewrite. The edit budget is the
- * paper's "textual learning rate"; a rejected-edit buffer + a slow-update
- * meta-note steer the optimizer away from dead ends.
- *
- * This module is the PROPOSER — the LLM call that turns evidence into
- * structured patches. The accept-only-if-held-out-improves loop, the budget
- * annealing, and the rejected buffer live in the `runSkillOpt` preset, which
- * owns the epoch hill-climb. The proposer also conforms to `SurfaceProposer`
- * (`propose` applies its patches to the current surface and returns the
- * candidate surfaces) so it is a drop-in for `runOptimization` and a fair
- * entrant in `compareProposers`.
- */
-import { type LlmClientOptions } from '../../llm-client';
-import { type SkillPatch } from '../skill-patch';
-import type { SurfaceProposer } from '../types';
-/** Evidence the optimizer reflects on: where the current surface is weakest.
- *  Computed by the caller (the preset uses a TRAIN campaign so proposals never
- *  see the held-out split; the generic loop derives it from history). */
-export interface SkillOptEvidence {
-    /** Lowest-scoring scenarios (drives WHICH behavior to patch). */
-    weakScenarios: Array<{
-        scenarioId: string;
-        composite: number;
-    }>;
-    /** Lowest-scoring judge dimensions (drives WHAT to patch for). */
-    weakDimensions: Array<{
-        dimension: string;
-        score: number;
-    }>;
-}
-/** A patch that was tried and not accepted — fed back to the model so it does
- *  not re-propose a dead end (SkillOpt's rejected-edit buffer). */
-export interface RejectedEdit {
-    label: string;
-    rationale: string;
-    reason: string;
-}
-export interface ProposePatchesArgs {
-    surface: string;
-    evidence: SkillOptEvidence;
-    /** Max ops per patch this round (the annealed textual learning rate). */
-    editBudget: number;
-    rejectedBuffer: RejectedEdit[];
-    /** Slow-update meta guidance accumulated across epochs. */
-    metaNote?: string;
-    /** Analyst findings + research report rendered as a prompt block so a patch
-     *  targets a NAMED diagnosed root cause. Built by
-     *  the proposer from `ctx.findings`/`ctx.report`; the patch-native `runSkillOpt`
-     *  path may also supply it. */
-    findingsNote?: string;
-    /** How many candidate patches to propose. */
-    count: number;
-    signal: AbortSignal;
-}
-export interface SkillOptProposerOptions {
-    llm: LlmClientOptions;
-    model: string;
-    /** What the skill document governs — orients the prompt. */
-    target: string;
-    /** Default ops-per-patch cap when used as a bare `SurfaceProposer`. The
-     *  `runSkillOpt` preset overrides this per epoch as it anneals. Default 3. */
-    editBudget?: number;
-    temperature?: number;
-    maxTokens?: number;
-    /** Top-K weak scenarios/dimensions surfaced as evidence. Default 3. */
-    evidenceK?: number;
-}
-export interface SkillOptProposer extends SurfaceProposer {
-    /** Patch-native path used by `runSkillOpt` (the SkillOpt epoch loop owns
-     *  acceptance/budget/buffer). Returns structured patches, NOT surfaces. */
-    proposePatches(args: ProposePatchesArgs): Promise<SkillPatch[]>;
-}
-export declare function skillOptProposer(opts: SkillOptProposerOptions): SkillOptProposer;
-/** Parse + validate the patch response. Throws `SkillPatchParseError` when the
- *  response is not valid JSON at all (a router/model failure the caller must
- *  see — never a silent no-op epoch). Returns `[]` only for the legitimate
- *  "valid JSON, zero usable patches" case. Malformed ops within a patch are
- *  dropped (not silently mutated); each patch is truncated to the edit budget. */
-export declare class SkillPatchParseError extends Error {
-    constructor(message: string);
-}
-export declare function parseSkillPatchResponse(raw: string, maxPatches: number, editBudget: number): SkillPatch[];
-//# sourceMappingURL=skill-opt.d.ts.map

package/dist/campaign/proposers/skill-opt.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"skill-opt.d.ts","sourceRoot":"","sources":["../../../src/campaign/proposers/skill-opt.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAW,KAAK,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAEjE,OAAO,EAAmB,KAAK,UAAU,EAAqB,MAAM,gBAAgB,CAAA;AACpF,OAAO,KAAK,EAAqC,eAAe,EAAE,MAAM,UAAU,CAAA;AAYlF;;yEAEyE;AACzE,MAAM,WAAW,gBAAgB;IAC/B,iEAAiE;IACjE,aAAa,EAAE,KAAK,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IAC/D,kEAAkE;IAClE,cAAc,EAAE,KAAK,CAAC;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAC5D;AAED;mEACmE;AACnE,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAA;IACb,SAAS,EAAE,MAAM,CAAA;IACjB,MAAM,EAAE,MAAM,CAAA;CACf;AAED,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,MAAM,CAAA;IACf,QAAQ,EAAE,gBAAgB,CAAA;IAC1B,yEAAyE;IACzE,UAAU,EAAE,MAAM,CAAA;IAClB,cAAc,EAAE,YAAY,EAAE,CAAA;IAC9B,2DAA2D;IAC3D,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB;;;mCAG+B;IAC/B,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,6CAA6C;IAC7C,KAAK,EAAE,MAAM,CAAA;IACb,MAAM,EAAE,WAAW,CAAA;CACpB;AAED,MAAM,WAAW,uBAAuB;IACtC,GAAG,EAAE,gBAAgB,CAAA;IACrB,KAAK,EAAE,MAAM,CAAA;IACb,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAA;IACd;kFAC8E;IAC9E,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,uEAAuE;IACvE,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED,MAAM,WAAW,gBAAiB,SAAQ,eAAe;IACvD;+EAC2E;IAC3E,cAAc,CAAC,IAAI,EAAE,kBAAkB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;CAChE;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,uBAAuB,GAAG,gBAAgB,CA8DhF;AAuED;;;;kFAIkF;AAClF,qBAAa,oBAAqB,SAAQ,KAAK;gBACjC,OAAO,EAAE,MAAM;CAI5B;AAED,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,GACjB,UAAU,EAAE,CAmCd"}

package/dist/campaign/proposers/trace-analyst.d.ts

@@ -1,48 +0,0 @@
-/**
- * `traceAnalystProposer` — wraps agent-eval's OWN trace-analyst engine
- * (`AnalystRegistry` over the agentic OTLP reader) as a `SurfaceProposer`.
- * It is the symmetric opponent to `haloProposer`: both run the SAME shared
- * `analysisEditProposer` pipeline (materialize identical traces → apply via one
- * identical LLM edit), so a `compareProposers` lift delta isolates a single
- * variable — ANALYSIS QUALITY. The benchmark answers "is our HALO clone as good
- * as the real HALO?" as a held-out lift CI, not a vibe.
- *
- * Findings come from the REGISTRY (structured `AnalystFinding[]` carrying
- * area / severity / recommended_action), rendered into the report the shared
- * apply step consumes.
- *
- * Fail-loud: no traces → throw; analyst run errors → throw; zero findings →
- * throw. Never fabricate a candidate.
- */
-import { type TraceAnalystKindSpec } from '../../analyst/kind-factory';
-import type { AnalystFinding } from '../../analyst/types';
-import type { LlmClientOptions } from '../../llm-client';
-import type { ProposeContext, SurfaceProposer } from '../types';
-export interface TraceAnalystProposerOptions {
-    /** OpenAI-compatible base URL for BOTH the analyst's agentic reads and the
-     *  apply step (e.g. `https://api.deepseek.com/v1` or the Tangle router). */
-    baseUrl: string;
-    /** Bearer key. Required — the Ax AI service has no env fallback here. */
-    apiKey: string;
-    /** Model the analyst kinds use for their agentic trace reads. */
-    model: string;
-    /** Model used to APPLY findings to the prompt surface. Default = `model`.
-     *  Keep this EQUAL to haloProposer's `applyModel` for an apples-to-apples run. */
-    applyModel?: string;
-    /** Ax provider name. Default 'openai' — works for any OpenAI-compatible base
-     *  via `apiURL`. Use 'deepseek' to hit DeepSeek's native provider. */
-    provider?: string;
-    /** Which analyst kinds to run. Default = the full shipped suite. */
-    kinds?: readonly TraceAnalystKindSpec[];
-    /** Resolve the OTLP traces (JSONL string) the analyst should read for THIS
-     *  generation — identical contract to `haloProposer.resolveTraces`. */
-    resolveTraces: (ctx: ProposeContext) => string | Promise<string>;
-    /** Override the findings producer. Default: the shipped `AnalystRegistry`
-     *  over `kinds`. The unit suite injects canned findings here. */
-    analyze?: (tracePath: string, ctx: ProposeContext) => Promise<ReadonlyArray<AnalystFinding>>;
-    /** Test seam: inject a fetch for the apply-step `callLlm`. */
-    fetchImpl?: LlmClientOptions['fetch'];
-}
-/** Wrap agent-eval's trace-analyst registry as a SurfaceProposer (prompt-tier). */
-export declare function traceAnalystProposer(opts: TraceAnalystProposerOptions): SurfaceProposer;
-//# sourceMappingURL=trace-analyst.d.ts.map

package/dist/campaign/proposers/trace-analyst.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"trace-analyst.d.ts","sourceRoot":"","sources":["../../../src/campaign/proposers/trace-analyst.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,EAA0B,KAAK,oBAAoB,EAAE,MAAM,4BAA4B,CAAA;AAG9F,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAA;AACzD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAExD,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,UAAU,CAAA;AAG/D,MAAM,WAAW,2BAA2B;IAC1C;gFAC4E;IAC5E,OAAO,EAAE,MAAM,CAAA;IACf,yEAAyE;IACzE,MAAM,EAAE,MAAM,CAAA;IACd,iEAAiE;IACjE,KAAK,EAAE,MAAM,CAAA;IACb;sFACkF;IAClF,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB;0EACsE;IACtE,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,oEAAoE;IACpE,KAAK,CAAC,EAAE,SAAS,oBAAoB,EAAE,CAAA;IACvC;2EACuE;IACvE,aAAa,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;IAChE;qEACiE;IACjE,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC,CAAA;IAC5F,8DAA8D;IAC9D,SAAS,CAAC,EAAE,gBAAgB,CAAC,OAAO,CAAC,CAAA;CACtC;AAcD,mFAAmF;AACnF,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,2BAA2B,GAAG,eAAe,CAoDvF"}

package/dist/campaign/proposers/trace-analyst.test.d.ts

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

package/dist/campaign/proposers/trace-analyst.test.d.ts.map

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