darwin-agents 0.5.0-alpha.2 → 0.5.1-alpha.2

package/CHANGELOG.md

@@ -1,5 +1,119 @@
 # Changelog
 
+## [Unreleased]
+
+## [0.5.1-alpha.2] — 2026-06-06
+
+### Fixed
+
+- **CI green again on Node 20/22** (red since v0.5.0-alpha.2). The `better-sqlite3`
+  peer dependency was pinned to `^11.0.0`, which ships no prebuilt binary for newer
+  Node ABIs — `new Database()` in the test `before` hook crashed with a
+  `NODE_MODULE_VERSION` mismatch (127 vs 137), which `node:test` reported as the
+  whole trajectory suite being "cancelled by parent". Widened the peer range to
+  `^11.0.0 || ^12.0.0` (consumers may use either major) and added
+  `better-sqlite3@^12.10.0` as a devDependency so the test suite runs against the
+  full Node 20–26 ABI matrix. Verified on Node 22 + 24 (336/336 tests green), tsc clean.
+
+## [0.5.1-alpha.1] — 2026-05-29
+
+**GEPA Polish-Welle.** Closes the three deliberate paper deviations
+documented in `optimizer-gepa.ts` as V0.6 backlog from V0.5.0-alpha.2.
+**Zero breaking changes** — every V0.5.0 callsite keeps working unchanged.
+**R1 + R2 + R3 code-review-loop GO**, **336/337 vitest tests grün** (+29
+V0.5.1 regression tests). tsc strict clean, build clean.
+
+### Added — three new surfaces
+
+- **`crowdingDistance(variants, objectives)`** in `src/evolution/pareto.ts` —
+  pure NSGA-II Deb 2002 density-estimator. Returns one distance per
+  variant: per-objective min-max-normalised neighbour gap, summed across
+  objectives, with `+Infinity` for boundary variants so they always
+  survive truncation. Scale-safe through per-objective normalisation
+  (unlike `scalarise` which is scale-sensitive).
+- **`ParetoTruncationStrategy`** type + new 4th parameter to
+  `paretoSelect(variants, objectives, maxKeep, truncationStrategy)`.
+  Two strategies: `"scalarised"` (V0.5.0 default, kept) and `"crowding"`
+  (NSGA-II density-preserving). Backward-compatible default.
+- **`GepaOptimizerOptions`** interface + new constructor option
+  `reflectionRunPrompt?: RunPromptFn`. When supplied, reflection AND
+  merge route through the override — matches GEPA paper guidance
+  (stronger LM for reflection than for task execution). Falls back to
+  the main `runPrompt` when omitted. Closes V0.5.0 R1 Research F7.
+- **`GepaOptimizer.merge(parents, opts)`** — GEPA Paper Appendix F
+  system-aware merge. Takes two distinct Pareto-front parents, asks the
+  reflection LM to combine their strongest aspects into one mutated
+  prompt. Returns `{ id: "gepa-merge-<a>+<b>", prompt }`. Validations:
+  exactly 2 parents, distinct ids, non-empty prompts. Output is
+  fence-stripped + sentence-boundary capped to
+  `max(longerParent.length * 1.3, 3500)`. Paper reports ~5% lift when
+  run every K-th generation.
+- **`GepaOptimizer.nextGeneration.truncationStrategy` passthrough** —
+  forwards the new `paretoSelect` parameter from `NextGenerationOptions`.
+  Default `"scalarised"` matches V0.5.0 byte-for-byte.
+
+### Fixed — R1 + R2 + R3 code-review-loop
+
+R1 critic reported a P1 template-injection in `merge` (claimed `{SCORE_A}`
+/ `{SCORE_B}` placeholders inside parent prompts were double-substituted
+because they ran before `{PROMPT_A}` / `{PROMPT_B}`). On R2 verification
+the V1 ordering (ID + SCORE first, PROMPT last) was confirmed CORRECT —
+`String.prototype.replace` only finds matches in the current working
+string, and user content does not enter the working string until the
+final two replacements. **Net effect:** code unchanged, but
+`tests/v0.5.1-features.test.ts` now explicitly regression-tests BOTH
+`{ID_B}` AND `{SCORE_A}` + `{SCORE_B}` literals inside parent prompts —
+the test coverage gap was the real R1 finding, not the substitution order.
+
+R1 Analyst documentation-drift fixes:
+
+- `src/evolution/optimizer-gepa.ts` header — V0.6 deferrals updated to
+  reflect V0.5.1 shipping `truncationStrategy` + `merge` +
+  `reflectionRunPrompt`. Instance-coverage sampling remains V0.6
+  backlog.
+- `src/evolution/reflector.ts` — "deferred to V0.5.1" wording replaced
+  with "SHIPPED in V0.5.1".
+- `src/evolution/pareto.ts` — `"coverage"` mention removed from the
+  `paretoSelect` docstring; type carries only `"scalarised" | "crowding"`,
+  no type/doc mismatch remains.
+
+### Test coverage
+
+- **336/337 vitest tests grün** (was 307/308 baseline + 29 new tests
+  in `tests/v0.5.1-features.test.ts`). 1 pre-existing skip carried over.
+- New tests cover: `crowdingDistance` (4 boundary + 4 three-variant
+  scale-safe + non-finite defense), `paretoSelect` (default vs explicit
+  scalarised parity + crowding boundary preservation), `GepaOptimizer`
+  reflection-LM routing + fallback + invalid-type guard, `merge`
+  (template-injection for ID + SCORE, tuple validation, same-id
+  rejection, empty-prompt rejection, reflection-LM routing, fence-strip,
+  length cap, rejection propagation), `nextGeneration`
+  truncationStrategy passthrough + backward-compat byte-equivalence.
+
+### V0.6 backlog (carried over from V0.5.1 deferrals)
+
+- `"coverage"` strategy on `ParetoTruncationStrategy` (GEPA Algorithm 2
+  instance-proportional sampling)
+- Extract `cleanOutput` + `truncateAtSentenceBoundary` to shared
+  `src/evolution/text-utils.ts` (currently byte-identical in `Reflector`
+  + `GepaOptimizer`)
+- Collision-safe `makeMergeId` separator (current `+` collides if
+  caller-side ids contain `+` literally — unlikely with default
+  `gepa-cand-${i}` ids)
+- More edge tests: `merge` with non-finite metrics, `crowdingDistance`
+  with all-Infinity inputs
+
+### Migration from V0.5.0
+
+None required. V0.5.1 is additive. Adopt new surfaces incrementally:
+
+- Switch `nextGeneration` to `truncationStrategy: "crowding"` for
+  diversity-critical workloads
+- Pass a stronger Opus model as `reflectionRunPrompt` while keeping a
+  cheaper Haiku as the main task LM
+- Invoke `optimizer.merge([survivors[0], survivors[1]])` every K-th
+  generation for the Paper Appendix F lift
+
 ## [0.5.0-alpha.2] — 2026-05-25
 
 **GEPA-Style Reflective Optimizer (Phase 2 A2).** Multi-objective Pareto
@@ -85,6 +199,138 @@ The 3-Agent code-review loop ran twice. R1 found 13 findings, R2 caught
   v0.5.0-alpha.1.
 - tsc strict + build clean.
 
+## [0.5.0-alpha.1] — 2026-05-24
+
+**Phase 2 A1: Execution-Trace-Capture.** First pre-release of Darwin's
+Phase 2 tech roadmap. Unblocks GEPA-style reflective optimizers (A2)
+and validate-by-reproduce drift-detection (A5) by giving them a
+structured trajectory to consume.
+
+Industry-aligned with the 2026 agent-observability consensus (Braintrust,
+Langfuse, Strands SDK, Microsoft Foundry, OTEL GenAI semantic conventions):
+three span types — Tool / Reasoning / Turn-level errors — captured into a
+single `ExecutionTrace` object, persisted as JSONB (Postgres) or TEXT
+(SQLite), and tagged with a forward-compatible `version: 1` discriminator.
+
+### Added
+
+- **`ExecutionTrace` schema** (`src/types.ts`) — versioned trajectory shape:
+  `toolCalls[]` (with OTEL-mappable `id` / `tool` / `args` / `resultSummary`
+  (2000-char cap) / `outcome` / `durationMs` / `retryCount?` / `errorClass?` /
+  `errorMessage?` / `turn`), `textBlockCount` (honest name — NOT a thinking-
+  block counter, V2 will add typed `reasoningBlocks`), `turnCount`,
+  `mcpInvocations`, `errors[]` (turn-level), `tokenUsage?` (OTEL `gen_ai.usage.*`
+  fields: input/output/cache_read/cache_creation tokens), `capturedAt`. Plus
+  optional `trajectory?: ExecutionTrace` on `DarwinExperiment` (additive —
+  pre-A1 callers unaffected).
+
+- **`createTraceCapture()` factory** (`src/core/trace-capture.ts`) — pure,
+  transport-agnostic capturer. The runtime feeds tool events; the capturer
+  aggregates into a typed trajectory. API:
+
+  ```ts
+  const trace = createTraceCapture();
+  trace.startTurn();
+  trace.recordToolUse('toolu_01AB', 'mcp__nex__search', { query: 'x' });
+  trace.recordToolResult('toolu_01AB', 'success', { resultSummary: '3 hits' });
+  trace.recordTextBlock();
+  trace.addTokens({ inputTokens: 1200, outputTokens: 340 });
+  trace.recordError('parse_error', 'invalid JSON');
+  const trajectory = trace.finalize();
+  ```
+
+  Unpaired `recordToolUse` calls (no matching `recordToolResult` before
+  `finalize`) surface as `outcome: 'error', errorClass: 'unpaired_call'`
+  so silent SDK hangs remain visible in the trace. Customizable via
+  `TraceCaptureOptions`: `now?` (clock injection for tests),
+  `isMcpTool?` (predicate override for non-`mcp__`-prefixed servers).
+
+- **`addTokens()` aggregator** — lossy-merge of per-turn LLM usage. Missing
+  fields (`NaN` / `Infinity` / `undefined`) skip silently rather than
+  defaulting to zero — preserves the distinction between "provider didn't
+  report" and "actually zero tokens".
+
+- **JSONB persistence** in `darwin_experiments.trajectory` column +
+  `idx_darwin_exp_trajectory_gin` GIN index (Postgres) for `@>`
+  containment queries from A2 / A5 consumers. SQLite stores the same
+  shape as JSON-stringified TEXT.
+
+- **`scripts/migrate-add-trajectory.ts`** — idempotent migration script.
+  Pre-checks column + index existence (filtered by `current_schema()`
+  for multi-schema-safe operation), runs `ALTER TABLE … ADD COLUMN IF
+  NOT EXISTS trajectory JSONB` + `CREATE INDEX IF NOT EXISTS`, then
+  verifies. Rollback path documented inline.
+
+  ```bash
+  DARWIN_POSTGRES_URL=postgresql://… npx tsx scripts/migrate-add-trajectory.ts
+  ```
+
+- **Defensive parsing** in both memory backends — `parseTrajectory` /
+  `parseTrajectoryColumn` drop malformed values (wrong `version`,
+  non-object, invalid JSON) to `undefined` instead of crashing the
+  load. Future schema versions (`version !== 1`) are silently ignored
+  so v0.5 consumers don't break on v0.6 trajectories.
+
+- **39 new tests** across two suites (all green):
+  - `tests/trace-capture.test.ts` (32 unit tests): basic flow,
+    defensive behaviour, truncation (2000-char `resultSummary`),
+    MCP-heuristic, schema invariants, tool_call_id passthrough,
+    `addTokens` aggregate semantics
+  - `tests/memory-trajectory.test.ts` (7 tests): SQLite roundtrip,
+    backward-compat with pre-A1 rows, defensive parsing, idempotent
+    migration, Postgres-gated JSONB roundtrip
+
+### Changed
+
+- **DDL single-source-of-truth** — the trajectory column is defined
+  ONLY in the additive `ALTER TABLE … ADD COLUMN IF NOT EXISTS` path
+  (Postgres) / PRAGMA-guarded ALTER (SQLite), never inline in the
+  `CREATE TABLE`. Schema-evolution lives in one place; fresh installs
+  reach the same end-state as legacy installs.
+
+- **Postgres `ON CONFLICT` preserves trajectory** on feedback-only
+  re-saves via `COALESCE(EXCLUDED.trajectory, darwin_experiments.trajectory)`.
+  This means a second `saveExperiment(exp)` call that omits trajectory
+  doesn't zero out the previously-stored trace.
+
+  **NOTE — SQLite asymmetry:** SQLite uses `INSERT OR REPLACE` which
+  drops + re-inserts the row, so callers wanting to preserve a prior
+  trajectory across re-saves MUST include it in the new payload. This
+  asymmetry is documented on `MemoryProvider.saveExperiment` in the
+  interface JSDoc.
+
+### Backwards compatibility
+
+100% backwards-compatible. The new `trajectory` field is optional, the
+new column is nullable, the new methods on `MemoryProvider` are
+additive. Existing v0.4.x consumers see no behavioural changes.
+
+Verified on a live `darwin_db` with 341 experiments, 339 of which
+pre-date A1 — all loaded cleanly with `trajectory: undefined`.
+
+### Why "alpha.1"
+
+`textBlockCount` is honest but limited — V2 will replace it with a
+typed `reasoningBlocks: ReasoningBlock[]` sequence carrying the actual
+text content per reasoning step, which is what GEPA reflectors need
+for per-decision blame attribution. Existing `textBlockCount` will stay
+as a fast aggregate. The `alpha.1` tag signals the schema is subject to
+this kind of additive evolution before `0.5.0` final.
+
+Three known minor gaps (deferred to follow-up patches):
+
+- Per-call cost attribution (token usage per tool invocation, not just
+  per-run aggregate)
+- Trace-capture lazy-load flag stays permanent on transient import
+  failure (low impact: Darwin is either built or not)
+- Token extraction in the SDK adapter is Anthropic-shaped (`message.usage`)
+  and may silently miss tokens for non-Anthropic providers — by design
+  (token usage is documented optional), but a debug-level log line in a
+  follow-up patch will make this easier to spot.
+
+Install: `npm install darwin-agents@alpha`. The default `latest` tag
+remains on `0.4.9` until `0.5.0` final ships.
+
 ## [0.4.9] — 2026-05-22
 
 Polish on top of v0.4.8. Adds spec-compliance, error classification,

package/dist/src/evolution/optimizer-gepa.d.ts

@@ -40,14 +40,18 @@
  *   - **`feedbackStrategy: "split"` is OUR adaptation** — GEPA paper
  *     does not partition feedback across offspring. We do it to force
  *     mutation diversity in a single `Promise.all` batch.
- *   - **paretoSelect truncation uses scalarised tie-break** — GEPA
- *     Algorithm 2 samples Pareto candidates proportional to instance
- *     coverage. We use a simpler weighted-sum tie-break. V0.6 will add
- *     a `truncationStrategy` option for coverage-proportional +
- *     NSGA-II crowding-distance.
+ *   - **paretoSelect truncation has two strategies (V0.5.1):**
+ *     `"scalarised"` (V0.5.0 default, weighted-sum tie-break) and
+ *     `"crowding"` (NSGA-II Deb 2002 density-preserving truncation).
+ *     GEPA Algorithm 2's instance-proportional coverage sampling is
+ *     still NOT implemented — backlog for V0.6.
  *   - **GEPA+Merge (system-aware crossover from two Pareto-pool
- *     ancestors, paper Appendix F)** is NOT implemented. +5% reported
- *     lift in the paper. Backlog for V0.6.
+ *     ancestors, paper Appendix F)** SHIPPED in V0.5.1 via
+ *     {@link GepaOptimizer#merge}. Paper reports ~5% lift when run on
+ *     every K-th generation.
+ *   - **Stronger reflection LM** SHIPPED in V0.5.1 via
+ *     {@link GepaOptimizerOptions.reflectionRunPrompt}. Falls back to
+ *     the main `runPrompt` when omitted.
  *   - **Instance-wise coverage sampling** (paper Algorithm 2) is NOT
  *     implemented. Backlog for V0.6.
  *
@@ -79,7 +83,7 @@
  * ```
  */
 import type { ReflectiveFeedback, RunPromptFn } from "./reflector.js";
-import { type ParetoObjective } from "./pareto.js";
+import { type ParetoObjective, type ParetoTruncationStrategy } from "./pareto.js";
 /** One evaluated variant in a generation. */
 export interface ScoredVariant {
     /** Variant identifier (e.g. "v3-gen2-cand1"). */
@@ -118,10 +122,59 @@ export interface NextGenerationOptions extends GenerateOptions {
      * Max variants to keep on the Pareto front. Default 3.
      */
     maxCarry?: number;
+    /**
+     * V0.5.1 — strategy used when the Pareto front exceeds `maxCarry`
+     * and needs truncation. Default `"scalarised"` (preserves V0.5.0
+     * behaviour). Switch to `"crowding"` for NSGA-II density-preserving
+     * truncation that maintains diversity along the front.
+     *
+     * NEW V0.5.1 (S1235).
+     */
+    truncationStrategy?: ParetoTruncationStrategy;
+}
+/**
+ * V0.5.1 options for {@link GepaOptimizer} constructor.
+ *
+ * R1 Research Finding F7 (S1185) closure — `reflectionRunPrompt` lets
+ * callers route reflection / merge calls to a STRONGER LM than the task
+ * LM, matching GEPA's official `reflection_lm` parameter. When omitted,
+ * reflection and merge fall back to the main `runPrompt`. NEW V0.5.1.
+ */
+export interface GepaOptimizerOptions {
+    /**
+     * Stronger LM for reflection / merge calls. Pass a higher-tier
+     * `RunPromptFn` (e.g. Claude Opus) here when your main task LM is a
+     * cheaper one. Per GEPA paper guidance reflection is the leverage
+     * point — a stronger reflector lifts mutation quality more than a
+     * stronger task LM.
+     *
+     * When omitted, reflection + merge use the main `runPrompt`.
+     *
+     * NEW V0.5.1 (S1235).
+     */
+    reflectionRunPrompt?: RunPromptFn;
+}
+/**
+ * V0.5.1 options for {@link GepaOptimizer#merge}.
+ */
+export interface MergeOptions {
+    /**
+     * Override the merge prompt template. Default is the GEPA Appendix-F
+     * system-aware merge template. Use a custom template when you want
+     * different merge pressure (e.g. conservative-additive vs. selective).
+     */
+    mergePromptTemplate?: string;
+    /**
+     * Hard upper bound on the returned merged-prompt length. Default
+     * `Math.max(max(parents[].prompt.length) * 1.3, 3500)` — same growth
+     * ceiling as {@link Reflector}.
+     */
+    maxMergeLength?: number;
 }
 export declare class GepaOptimizer {
     private readonly reflector;
-    constructor(runPrompt: RunPromptFn);
+    private readonly reflectionRunPrompt;
+    constructor(runPrompt: RunPromptFn, opts?: GepaOptimizerOptions);
     /**
      * Generate N variant mutations from the current prompt + feedback set.
      * Returns the raw mutated prompts — caller scores them (typically via
@@ -141,9 +194,44 @@ export declare class GepaOptimizer {
      * nextGeneration"). The actual selection logic lives in `pareto.ts`.
      */
     nextGeneration(scored: ReadonlyArray<ScoredVariant>, opts: NextGenerationOptions): ScoredVariant[];
+    /**
+     * V0.5.1 (S1235) — GEPA+Merge (Paper Appendix F).
+     *
+     * Combines the strongest aspects of TWO Pareto-front parents into a
+     * single mutated prompt via a reflection-LM call. The paper reports
+     * ~+5% lift over generation-only optimisation when this is run on
+     * every K-th generation (typically K=3-5). The merged prompt then
+     * competes alongside the regular generation outputs in the next
+     * `nextGeneration` Pareto-select step.
+     *
+     * Typical usage:
+     * ```ts
+     * // Every Kth generation, merge the top two Pareto-front members.
+     * if (gen % 3 === 0 && survivors.length >= 2) {
+     *   const merged = await optimizer.merge(
+     *     [survivors[0], survivors[1]],
+     *   );
+     *   // Score `merged.prompt` via your evaluator, then include the
+     *   // scored variant in the next nextGeneration() pool.
+     * }
+     * ```
+     *
+     * Errors are thrown — `merge` is a deliberate optimisation step, the
+     * caller chooses when to invoke it. No swallowing.
+     */
+    merge(parents: readonly [ScoredVariant, ScoredVariant], opts?: MergeOptions): Promise<{
+        id: string;
+        prompt: string;
+    }>;
+    /** Strip markdown fences + leading/trailing whitespace — mirrors `Reflector.cleanOutput`. */
+    private cleanOutput;
+    /** Sentence-boundary truncation — mirrors `Reflector.truncateAtSentenceBoundary`. */
+    private truncateAtSentenceBoundary;
     /** Clamp variant count into the documented bounds. */
     private clampN;
     /** Stable variant id: `gepa-cand-${i}` (caller can re-namespace). */
     private makeId;
+    /** V0.5.1 — stable merged-variant id: `gepa-merge-${idA}+${idB}`. */
+    private makeMergeId;
 }
 //# sourceMappingURL=optimizer-gepa.d.ts.map

package/dist/src/evolution/optimizer-gepa.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"optimizer-gepa.d.ts","sourceRoot":"","sources":["../../../src/evolution/optimizer-gepa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+EG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAEtE,OAAO,EAEL,KAAK,eAAe,EACrB,MAAM,aAAa,CAAC;AAErB,6CAA6C;AAC7C,MAAM,WAAW,aAAa;IAC5B,iDAAiD;IACjD,EAAE,EAAE,MAAM,CAAC;IACX,2BAA2B;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,iFAAiF;IACjF,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,4EAA4E;IAC5E,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,kDAAkD;AAClD,MAAM,WAAW,eAAe;IAC9B,wEAAwE;IACxE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;;;;OAQG;IACH,gBAAgB,CAAC,EAAE,OAAO,GAAG,WAAW,GAAG,QAAQ,CAAC;CACrD;AAED,wDAAwD;AACxD,MAAM,WAAW,qBAAsB,SAAQ,eAAe;IAC5D;;;;OAIG;IACH,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACnE;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAOD,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAY;gBAE1B,SAAS,EAAE,WAAW;IAIlC;;;;;OAKG;IACG,QAAQ,CACZ,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,aAAa,CAAC,kBAAkB,CAAC,EAC5C,IAAI,GAAE,eAAoB,GACzB,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IA0DjD;;;;;;;OAOG;IACH,cAAc,CACZ,MAAM,EAAE,aAAa,CAAC,aAAa,CAAC,EACpC,IAAI,EAAE,qBAAqB,GAC1B,aAAa,EAAE;IAyClB,sDAAsD;IACtD,OAAO,CAAC,MAAM;IAKd,qEAAqE;IACrE,OAAO,CAAC,MAAM;CAGf"}
+{"version":3,"file":"optimizer-gepa.d.ts","sourceRoot":"","sources":["../../../src/evolution/optimizer-gepa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmFG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAEtE,OAAO,EAEL,KAAK,eAAe,EACpB,KAAK,wBAAwB,EAC9B,MAAM,aAAa,CAAC;AAErB,6CAA6C;AAC7C,MAAM,WAAW,aAAa;IAC5B,iDAAiD;IACjD,EAAE,EAAE,MAAM,CAAC;IACX,2BAA2B;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,iFAAiF;IACjF,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,4EAA4E;IAC5E,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,kDAAkD;AAClD,MAAM,WAAW,eAAe;IAC9B,wEAAwE;IACxE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;;;;OAQG;IACH,gBAAgB,CAAC,EAAE,OAAO,GAAG,WAAW,GAAG,QAAQ,CAAC;CACrD;AAED,wDAAwD;AACxD,MAAM,WAAW,qBAAsB,SAAQ,eAAe;IAC5D;;;;OAIG;IACH,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACnE;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;;;;OAOG;IACH,kBAAkB,CAAC,EAAE,wBAAwB,CAAC;CAC/C;AAqCD;;;;;;;GAOG;AACH,MAAM,WAAW,oBAAoB;IACnC;;;;;;;;;;OAUG;IACH,mBAAmB,CAAC,EAAE,WAAW,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAY;IACtC,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAc;gBAEtC,SAAS,EAAE,WAAW,EAAE,IAAI,GAAE,oBAAyB;IAoBnE;;;;;OAKG;IACG,QAAQ,CACZ,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,aAAa,CAAC,kBAAkB,CAAC,EAC5C,IAAI,GAAE,eAAoB,GACzB,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IA0DjD;;;;;;;OAOG;IACH,cAAc,CACZ,MAAM,EAAE,aAAa,CAAC,aAAa,CAAC,EACpC,IAAI,EAAE,qBAAqB,GAC1B,aAAa,EAAE;IAgDlB;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACG,KAAK,CACT,OAAO,EAAE,SAAS,CAAC,aAAa,EAAE,aAAa,CAAC,EAChD,IAAI,GAAE,YAAiB,GACtB,OAAO,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IA6E1C,6FAA6F;IAC7F,OAAO,CAAC,WAAW;IAOnB,qFAAqF;IACrF,OAAO,CAAC,0BAA0B;IAWlC,sDAAsD;IACtD,OAAO,CAAC,MAAM;IAKd,qEAAqE;IACrE,OAAO,CAAC,MAAM;IAId,qEAAqE;IACrE,OAAO,CAAC,WAAW;CAGpB"}

package/dist/src/evolution/optimizer-gepa.js

@@ -40,14 +40,18 @@
  *   - **`feedbackStrategy: "split"` is OUR adaptation** — GEPA paper
  *     does not partition feedback across offspring. We do it to force
  *     mutation diversity in a single `Promise.all` batch.
- *   - **paretoSelect truncation uses scalarised tie-break** — GEPA
- *     Algorithm 2 samples Pareto candidates proportional to instance
- *     coverage. We use a simpler weighted-sum tie-break. V0.6 will add
- *     a `truncationStrategy` option for coverage-proportional +
- *     NSGA-II crowding-distance.
+ *   - **paretoSelect truncation has two strategies (V0.5.1):**
+ *     `"scalarised"` (V0.5.0 default, weighted-sum tie-break) and
+ *     `"crowding"` (NSGA-II Deb 2002 density-preserving truncation).
+ *     GEPA Algorithm 2's instance-proportional coverage sampling is
+ *     still NOT implemented — backlog for V0.6.
  *   - **GEPA+Merge (system-aware crossover from two Pareto-pool
- *     ancestors, paper Appendix F)** is NOT implemented. +5% reported
- *     lift in the paper. Backlog for V0.6.
+ *     ancestors, paper Appendix F)** SHIPPED in V0.5.1 via
+ *     {@link GepaOptimizer#merge}. Paper reports ~5% lift when run on
+ *     every K-th generation.
+ *   - **Stronger reflection LM** SHIPPED in V0.5.1 via
+ *     {@link GepaOptimizerOptions.reflectionRunPrompt}. Falls back to
+ *     the main `runPrompt` when omitted.
  *   - **Instance-wise coverage sampling** (paper Algorithm 2) is NOT
  *     implemented. Backlog for V0.6.
  *
@@ -84,10 +88,52 @@ const DEFAULT_NUM_VARIANTS = 3;
 const MIN_NUM_VARIANTS = 1;
 const MAX_NUM_VARIANTS = 10;
 const DEFAULT_MAX_CARRY = 3;
+/**
+ * V0.5.1 — GEPA+Merge prompt template (Paper Appendix F).
+ *
+ * Asks the LLM to combine the best aspects of two Pareto-front parents
+ * into a single mutated prompt. Deliberately NOT a literal cross-over
+ * of token spans — the paper reports the "system-aware merge" variant
+ * (semantic combination via reflection LM) lifts task performance by
+ * roughly 5%. Token-span crossover (the alternative they tested) did
+ * not yield the same gain.
+ *
+ * NEW V0.5.1 (S1235).
+ */
+const DEFAULT_MERGE_TEMPLATE = `
+You are a prompt-engineering merger. Below are two instruction prompts from a Pareto-front of variants. Each has its own strengths and weaknesses on different evaluation dimensions.
+
+PARENT A (id={ID_A}, score {SCORE_A}):
+\`\`\`
+{PROMPT_A}
+\`\`\`
+
+PARENT B (id={ID_B}, score {SCORE_B}):
+\`\`\`
+{PROMPT_B}
+\`\`\`
+
+Task: produce ONE merged instruction that combines the strongest aspects of BOTH parents. You may borrow phrasing from either, but the merge must preserve correct behavior from BOTH and not regress on any dimension either parent handles well. Keep the overall length envelope reasonable (no growth beyond ~30% of the longer parent).
+
+Return ONLY the merged instruction text. No prose, no explanations, no markdown fences.
+`.trim();
 export class GepaOptimizer {
     reflector;
-    constructor(runPrompt) {
-        this.reflector = new Reflector(runPrompt);
+    reflectionRunPrompt;
+    constructor(runPrompt, opts = {}) {
+        if (typeof runPrompt !== "function") {
+            throw new TypeError("GepaOptimizer: runPrompt must be a function");
+        }
+        // V0.5.1 (R1 Research F7 closure, S1235): if a stronger reflection LM
+        // is provided, route reflection + merge through it; otherwise fall
+        // back to the main runPrompt so existing V0.5.0 callsites keep
+        // working unchanged.
+        if (opts.reflectionRunPrompt !== undefined &&
+            typeof opts.reflectionRunPrompt !== "function") {
+            throw new TypeError("GepaOptimizer: opts.reflectionRunPrompt must be a function when supplied");
+        }
+        this.reflectionRunPrompt = opts.reflectionRunPrompt ?? runPrompt;
+        this.reflector = new Reflector(this.reflectionRunPrompt);
     }
     /**
      * Generate N variant mutations from the current prompt + feedback set.
@@ -174,7 +220,9 @@ export class GepaOptimizer {
                 "`metrics` object reference — provide a distinct metrics object per variant.");
         }
         const objectives = opts.objectives;
-        const survivorMetrics = paretoSelect(metricsArr, objectives, maxCarry);
+        // V0.5.1 (S1235) — forward truncationStrategy. Default "scalarised"
+        // preserves V0.5.0 behaviour byte-for-byte.
+        const survivorMetrics = paretoSelect(metricsArr, objectives, maxCarry, opts.truncationStrategy ?? "scalarised");
         // Build "metrics-ref → index" map then look up each survivor's index.
         // Linear scan twice is O(N²) worst-case but N≤10 in practice.
         const metricsToIndex = new Map();
@@ -184,6 +232,113 @@ export class GepaOptimizer {
             .filter((i) => typeof i === "number"));
         return scored.filter((_, i) => survivorIndices.has(i));
     }
+    /**
+     * V0.5.1 (S1235) — GEPA+Merge (Paper Appendix F).
+     *
+     * Combines the strongest aspects of TWO Pareto-front parents into a
+     * single mutated prompt via a reflection-LM call. The paper reports
+     * ~+5% lift over generation-only optimisation when this is run on
+     * every K-th generation (typically K=3-5). The merged prompt then
+     * competes alongside the regular generation outputs in the next
+     * `nextGeneration` Pareto-select step.
+     *
+     * Typical usage:
+     * ```ts
+     * // Every Kth generation, merge the top two Pareto-front members.
+     * if (gen % 3 === 0 && survivors.length >= 2) {
+     *   const merged = await optimizer.merge(
+     *     [survivors[0], survivors[1]],
+     *   );
+     *   // Score `merged.prompt` via your evaluator, then include the
+     *   // scored variant in the next nextGeneration() pool.
+     * }
+     * ```
+     *
+     * Errors are thrown — `merge` is a deliberate optimisation step, the
+     * caller chooses when to invoke it. No swallowing.
+     */
+    async merge(parents, opts = {}) {
+        if (!Array.isArray(parents) || parents.length !== 2) {
+            throw new TypeError("GepaOptimizer.merge: parents must be a tuple of exactly two ScoredVariants");
+        }
+        const [a, b] = parents;
+        if (!a || !b || typeof a.prompt !== "string" || typeof b.prompt !== "string") {
+            throw new TypeError("GepaOptimizer.merge: both parents must carry a non-empty `prompt` string");
+        }
+        if (a.prompt.length === 0 || b.prompt.length === 0) {
+            throw new TypeError("GepaOptimizer.merge: parent prompts must be non-empty");
+        }
+        // R1-self-check: emit a merge for two IDENTICAL parents would be a
+        // waste of an LLM call AND likely produce a near-identical mutation
+        // anyway. Fail loud so the caller fixes the pairing logic upstream
+        // rather than silently consume budget.
+        if (a.id === b.id) {
+            throw new TypeError(`GepaOptimizer.merge: both parents share id "${a.id}" — merge is only ` +
+                `meaningful between distinct Pareto-front members.`);
+        }
+        const template = opts.mergePromptTemplate ?? DEFAULT_MERGE_TEMPLATE;
+        // Scalar score for the prompt header — purely informational for the
+        // reflection LM. Sum of variant.metrics values (best-effort), zero
+        // for missing or non-finite. Caller can override via the template.
+        const scoreOf = (v) => {
+            let s = 0;
+            for (const val of Object.values(v.metrics)) {
+                if (typeof val === "number" && Number.isFinite(val))
+                    s += val;
+            }
+            return s;
+        };
+        // Template-injection defense (S1235): all FOUR metadata placeholders
+        // (`{ID_A}` / `{ID_B}` / `{SCORE_A}` / `{SCORE_B}`) are substituted
+        // FIRST, then the user-controlled `{PROMPT_A}` / `{PROMPT_B}` slots
+        // LAST. After the metadata substitutions are done, any literal
+        // `{ID_*}` / `{SCORE_*}` strings INSIDE the parent prompts cannot be
+        // re-processed — `String.prototype.replace` only matches what's
+        // currently in the working string, and the user content does not
+        // enter the working string until the final two replacements.
+        //
+        // R1 V0.5.1 self-check (S1235): R1 critic suggested swapping the
+        // order, but that would BREAK the defense — putting PROMPT first
+        // would let the subsequent ID/SCORE replacements grab literal
+        // `{ID_A}` etc. inside the user content. The original ordering is
+        // correct; the test coverage for SCORE placeholders is what was
+        // genuinely missing, and is now added in `tests/v0.5.1-features.test.ts`.
+        const metaPrompt = template
+            .replace("{ID_A}", a.id)
+            .replace("{ID_B}", b.id)
+            .replace("{SCORE_A}", scoreOf(a).toFixed(2))
+            .replace("{SCORE_B}", scoreOf(b).toFixed(2))
+            .replace("{PROMPT_A}", a.prompt)
+            .replace("{PROMPT_B}", b.prompt);
+        let merged = await this.reflectionRunPrompt(metaPrompt);
+        merged = this.cleanOutput(merged);
+        const longerParent = a.prompt.length >= b.prompt.length ? a.prompt : b.prompt;
+        const maxLength = opts.maxMergeLength ?? Math.max(Math.round(longerParent.length * 1.3), 3500);
+        if (merged.length > maxLength) {
+            merged = this.truncateAtSentenceBoundary(merged, maxLength);
+        }
+        return { id: this.makeMergeId(a.id, b.id), prompt: merged };
+    }
+    /** Strip markdown fences + leading/trailing whitespace — mirrors `Reflector.cleanOutput`. */
+    cleanOutput(raw) {
+        let out = raw.trim();
+        const fence = out.match(/^```[a-z]*\n?([\s\S]*?)\n?```$/i);
+        if (fence)
+            out = fence[1].trim();
+        return out;
+    }
+    /** Sentence-boundary truncation — mirrors `Reflector.truncateAtSentenceBoundary`. */
+    truncateAtSentenceBoundary(text, maxLength) {
+        if (text.length <= maxLength)
+            return text;
+        const truncated = text.slice(0, maxLength);
+        const lastPeriod = truncated.lastIndexOf(".");
+        const lastNewline = truncated.lastIndexOf("\n");
+        const cutPoint = Math.max(lastPeriod, lastNewline);
+        return cutPoint > maxLength * 0.7
+            ? truncated.slice(0, cutPoint + 1)
+            : truncated;
+    }
     /** Clamp variant count into the documented bounds. */
     clampN(n) {
         if (!Number.isFinite(n))
@@ -194,5 +349,9 @@ export class GepaOptimizer {
     makeId(i) {
         return `gepa-cand-${i}`;
     }
+    /** V0.5.1 — stable merged-variant id: `gepa-merge-${idA}+${idB}`. */
+    makeMergeId(idA, idB) {
+        return `gepa-merge-${idA}+${idB}`;
+    }
 }
 //# sourceMappingURL=optimizer-gepa.js.map

package/dist/src/evolution/optimizer-gepa.js.map

@@ -1 +1 @@
-{"version":3,"file":"optimizer-gepa.js","sourceRoot":"","sources":["../../../src/evolution/optimizer-gepa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+EG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EACL,YAAY,GAEb,MAAM,aAAa,CAAC;AA4CrB,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAC/B,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAC3B,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAC5B,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,MAAM,OAAO,aAAa;IACP,SAAS,CAAY;IAEtC,YAAY,SAAsB;QAChC,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,QAAQ,CACZ,aAAqB,EACrB,SAA4C,EAC5C,OAAwB,EAAE;QAE1B,iEAAiE;QACjE,iEAAiE;QACjE,2DAA2D;QAC3D,iEAAiE;QACjE,kCAAkC;QAClC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,SAAS,CACjB,8DAA8D;gBAC5D,wEAAwE;gBACxE,wDAAwD,CAC3D,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,IAAI,oBAAoB,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,IAAI,OAAO,CAAC;QAElD,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC1B,oEAAoE;YACpE,0EAA0E;YAC1E,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YACvE,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;YAC7B,kEAAkE;YAClE,mEAAmE;YACnE,6DAA6D;YAC7D,gEAAgE;YAChE,iBAAiB;YACjB,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAC9C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CACjD,CAAC;YACF,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9C,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtE,CAAC;QAED,kEAAkE;QAClE,gEAAgE;QAChE,MAAM,OAAO,GAA2B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5E,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,iEAAiE;YACjE,mEAAmE;YACnE,OAAO,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,+DAA+D;gBAC/D,6DAA6D;gBAC7D,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC1D,CAAC;YACD,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;OAOG;IACH,cAAc,CACZ,MAAoC,EACpC,IAA2B;QAE3B,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrD,MAAM,IAAI,SAAS,CACjB,mFAAmF,CACpF,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;QACpD,mEAAmE;QACnE,oEAAoE;QACpE,gEAAgE;QAChE,kEAAkE;QAClE,+DAA+D;QAC/D,gEAAgE;QAChE,EAAE;QACF,gEAAgE;QAChE,0DAA0D;QAC1D,mEAAmE;QACnE,4DAA4D;QAC5D,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC;YACnD,MAAM,IAAI,SAAS,CACjB,0EAA0E;gBACxE,6EAA6E,CAChF,CAAC;QACJ,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,UAEvB,CAAC;QACF,MAAM,eAAe,GAAG,YAAY,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACvE,sEAAsE;QACtE,8DAA8D;QAC9D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkC,CAAC;QACjE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,eAAe;aACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACjC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CACrD,CAAC;QACF,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,sDAAsD;IAC9C,MAAM,CAAC,CAAS;QACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,oBAAoB,CAAC;QACrD,OAAO,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,qEAAqE;IAC7D,MAAM,CAAC,CAAS;QACtB,OAAO,aAAa,CAAC,EAAE,CAAC;IAC1B,CAAC;CACF"}
+{"version":3,"file":"optimizer-gepa.js","sourceRoot":"","sources":["../../../src/evolution/optimizer-gepa.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmFG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EACL,YAAY,GAGb,MAAM,aAAa,CAAC;AAqDrB,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAC/B,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAC3B,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAC5B,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B;;;;;;;;;;;GAWG;AACH,MAAM,sBAAsB,GAAG;;;;;;;;;;;;;;;;CAgB9B,CAAC,IAAI,EAAE,CAAC;AA2CT,MAAM,OAAO,aAAa;IACP,SAAS,CAAY;IACrB,mBAAmB,CAAc;IAElD,YAAY,SAAsB,EAAE,OAA6B,EAAE;QACjE,IAAI,OAAO,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,MAAM,IAAI,SAAS,CAAC,6CAA6C,CAAC,CAAC;QACrE,CAAC;QACD,sEAAsE;QACtE,mEAAmE;QACnE,+DAA+D;QAC/D,qBAAqB;QACrB,IACE,IAAI,CAAC,mBAAmB,KAAK,SAAS;YACtC,OAAO,IAAI,CAAC,mBAAmB,KAAK,UAAU,EAC9C,CAAC;YACD,MAAM,IAAI,SAAS,CACjB,0EAA0E,CAC3E,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,IAAI,SAAS,CAAC;QACjE,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,QAAQ,CACZ,aAAqB,EACrB,SAA4C,EAC5C,OAAwB,EAAE;QAE1B,iEAAiE;QACjE,iEAAiE;QACjE,2DAA2D;QAC3D,iEAAiE;QACjE,kCAAkC;QAClC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,SAAS,CACjB,8DAA8D;gBAC5D,wEAAwE;gBACxE,wDAAwD,CAC3D,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,IAAI,oBAAoB,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,IAAI,OAAO,CAAC;QAElD,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC1B,oEAAoE;YACpE,0EAA0E;YAC1E,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YACvE,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;YAC7B,kEAAkE;YAClE,mEAAmE;YACnE,6DAA6D;YAC7D,gEAAgE;YAChE,iBAAiB;YACjB,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAC9C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CACjD,CAAC;YACF,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9C,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtE,CAAC;QAED,kEAAkE;QAClE,gEAAgE;QAChE,MAAM,OAAO,GAA2B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5E,SAAS,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,iEAAiE;YACjE,mEAAmE;YACnE,OAAO,CAAC,SAAS,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,+DAA+D;gBAC/D,6DAA6D;gBAC7D,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC1D,CAAC;YACD,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9C,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;OAOG;IACH,cAAc,CACZ,MAAoC,EACpC,IAA2B;QAE3B,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrD,MAAM,IAAI,SAAS,CACjB,mFAAmF,CACpF,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC;QACpD,mEAAmE;QACnE,oEAAoE;QACpE,gEAAgE;QAChE,kEAAkE;QAClE,+DAA+D;QAC/D,gEAAgE;QAChE,EAAE;QACF,gEAAgE;QAChE,0DAA0D;QAC1D,mEAAmE;QACnE,4DAA4D;QAC5D,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC;YACnD,MAAM,IAAI,SAAS,CACjB,0EAA0E;gBACxE,6EAA6E,CAChF,CAAC;QACJ,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,UAEvB,CAAC;QACF,oEAAoE;QACpE,4CAA4C;QAC5C,MAAM,eAAe,GAAG,YAAY,CAClC,UAAU,EACV,UAAU,EACV,QAAQ,EACR,IAAI,CAAC,kBAAkB,IAAI,YAAY,CACxC,CAAC;QACF,sEAAsE;QACtE,8DAA8D;QAC9D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkC,CAAC;QACjE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,eAAe;aACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACjC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CACrD,CAAC;QACF,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,KAAK,CAAC,KAAK,CACT,OAAgD,EAChD,OAAqB,EAAE;QAEvB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpD,MAAM,IAAI,SAAS,CACjB,4EAA4E,CAC7E,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC7E,MAAM,IAAI,SAAS,CACjB,0EAA0E,CAC3E,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,SAAS,CACjB,uDAAuD,CACxD,CAAC;QACJ,CAAC;QACD,mEAAmE;QACnE,oEAAoE;QACpE,mEAAmE;QACnE,uCAAuC;QACvC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAClB,MAAM,IAAI,SAAS,CACjB,+CAA+C,CAAC,CAAC,EAAE,oBAAoB;gBACrE,mDAAmD,CACtD,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,mBAAmB,IAAI,sBAAsB,CAAC;QAEpE,oEAAoE;QACpE,mEAAmE;QACnE,mEAAmE;QACnE,MAAM,OAAO,GAAG,CAAC,CAAgB,EAAU,EAAE;YAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3C,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;oBAAE,CAAC,IAAI,GAAG,CAAC;YAChE,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QAEF,qEAAqE;QACrE,oEAAoE;QACpE,oEAAoE;QACpE,+DAA+D;QAC/D,qEAAqE;QACrE,gEAAgE;QAChE,iEAAiE;QACjE,6DAA6D;QAC7D,EAAE;QACF,iEAAiE;QACjE,iEAAiE;QACjE,8DAA8D;QAC9D,kEAAkE;QAClE,gEAAgE;QAChE,0EAA0E;QAC1E,MAAM,UAAU,GAAG,QAAQ;aACxB,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;aACvB,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;aACvB,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC3C,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC3C,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,MAAM,CAAC;aAC/B,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAEnC,IAAI,MAAM,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QACxD,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAElC,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9E,MAAM,SAAS,GACb,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/E,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;YAC9B,MAAM,GAAG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9D,CAAC;QAED,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC9D,CAAC;IAED,6FAA6F;IACrF,WAAW,CAAC,GAAW;QAC7B,IAAI,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;QAC3D,IAAI,KAAK;YAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,qFAAqF;IAC7E,0BAA0B,CAAC,IAAY,EAAE,SAAiB;QAChE,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnD,OAAO,QAAQ,GAAG,SAAS,GAAG,GAAG;YAC/B,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC;YAClC,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;IAED,sDAAsD;IAC9C,MAAM,CAAC,CAAS;QACtB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,oBAAoB,CAAC;QACrD,OAAO,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,qEAAqE;IAC7D,MAAM,CAAC,CAAS;QACtB,OAAO,aAAa,CAAC,EAAE,CAAC;IAC1B,CAAC;IAED,qEAAqE;IAC7D,WAAW,CAAC,GAAW,EAAE,GAAW;QAC1C,OAAO,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;IACpC,CAAC;CACF"}

package/dist/src/evolution/pareto.d.ts

@@ -105,12 +105,62 @@ export declare function scalarise<T extends Record<string, unknown>>(variant: T,
  * Pareto-select up to `maxKeep` variants:
  *   1. Compute non-dominated front.
  *   2. If front size ≤ maxKeep: return front.
- *   3. If front size > maxKeep: sort by scalarised score (descending),
- *      keep top maxKeep.
+ *   3. If front size > maxKeep: truncate via the configured strategy
+ *      (default `"scalarised"` — weighted-sum tie-break).
  *
  * Use this when the GEPA generation budget is fixed (e.g. carry exactly
  * 3 variants to the next round) but the Pareto front happens to be
  * larger.
+ *
+ * V0.5.1 (S1235) — `truncationStrategy` opens up two new modes that
+ * close R1 Research deferrals from V0.5.0-alpha.2:
+ *   - `"scalarised"` (default, V0.5.0 behaviour): weighted-sum tie-break.
+ *     Scale-sensitive — pre-normalise objectives if their value ranges
+ *     differ (see `ParetoObjective.weight` docstring).
+ *   - `"crowding"` (NSGA-II Deb 2002): density-estimator that favours
+ *     variants in sparsely-populated regions of the front. Per-objective
+ *     min-max normalisation makes it scale-safe. Boundary variants
+ *     always survive (assigned Infinity). Recommended for diversity-
+ *     critical workloads.
+
+ * GEPA Algorithm 2's instance-proportional coverage sampling is the
+ * third paper strategy and is NOT implemented in V0.5.1 — the caller-
+ * side coverage data needed to drive it varies enough across domains
+ * that a one-size-fits-all signature would mislead. Backlog for V0.6.
+ */
+export type ParetoTruncationStrategy = "scalarised" | "crowding";
+export declare function paretoSelect<T extends Record<string, unknown>>(variants: ReadonlyArray<T>, objectives: ReadonlyArray<ParetoObjective<T>>, maxKeep?: number, truncationStrategy?: ParetoTruncationStrategy): T[];
+/**
+ * Compute the NSGA-II crowding distance for each variant in a
+ * non-dominated front. Returns an array of the same length as
+ * `variants`, indexed in input order.
+ *
+ * The classic Deb 2002 algorithm:
+ *   1. For each objective `m`: sort the front by `m`.
+ *   2. Boundary variants (lowest + highest `m`) get distance `+Infinity`
+ *      so they always survive truncation.
+ *   3. Interior variants get the normalised gap between neighbours:
+ *      `(f_m(x_{i+1}) - f_m(x_{i-1})) / (f_m_max - f_m_min)`
+ *   4. Sum across objectives.
+ *
+ * **Pure**, no I/O, deterministic. Safe to call from the hot path of
+ * paretoSelect. Returns `0` for any variant whose objective is non-finite
+ * — never returns NaN.
+ *
+ * NEW V0.5.1 (S1235).
+ *
+ * @example
+ * ```ts
+ * import { crowdingDistance, DARWIN_DEFAULT_OBJECTIVES } from "darwin-agents";
+ *
+ * const front = [
+ *   { id: "a", qualityScore: 8, sourceCount: 3, durationMs: 100, outputLength: 500 },
+ *   { id: "b", qualityScore: 9, sourceCount: 2, durationMs: 200, outputLength: 400 },
+ *   { id: "c", qualityScore: 7, sourceCount: 4, durationMs: 150, outputLength: 600 },
+ * ];
+ * const distances = crowdingDistance(front, DARWIN_DEFAULT_OBJECTIVES);
+ * // distances[i] = sum of per-objective normalised neighbour gaps for variant i
+ * ```
  */
-export declare function paretoSelect<T extends Record<string, unknown>>(variants: ReadonlyArray<T>, objectives: ReadonlyArray<ParetoObjective<T>>, maxKeep?: number): T[];
+export declare function crowdingDistance<T extends Record<string, unknown>>(variants: ReadonlyArray<T>, objectives: ReadonlyArray<ParetoObjective<T>>): number[];
 //# sourceMappingURL=pareto.d.ts.map

package/dist/src/evolution/pareto.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pareto.d.ts","sourceRoot":"","sources":["../../../src/evolution/pareto.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,kEAAkE;IAClE,GAAG,EAAE,MAAM,CAAC,CAAC;IACb;;;OAGG;IACH,SAAS,EAAE,UAAU,GAAG,UAAU,CAAC;IACnC;;;;;;;;;;;;OAYG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,yBAAyB,EAAE,aAAa,CAAC,eAAe,CAAC;IACpE,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC,CAKD,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACzD,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,EACJ,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,OAAO,CAeT;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACjE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,CAAC,EAAE,CAoBL;AAED;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACzD,OAAO,EAAE,CAAC,EACV,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,MAAM,CAUR;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5D,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAC7C,OAAO,CAAC,EAAE,MAAM,GACf,CAAC,EAAE,CAML"}
+{"version":3,"file":"pareto.d.ts","sourceRoot":"","sources":["../../../src/evolution/pareto.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,kEAAkE;IAClE,GAAG,EAAE,MAAM,CAAC,CAAC;IACb;;;OAGG;IACH,SAAS,EAAE,UAAU,GAAG,UAAU,CAAC;IACnC;;;;;;;;;;;;OAYG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;;GASG;AACH,eAAO,MAAM,yBAAyB,EAAE,aAAa,CAAC,eAAe,CAAC;IACpE,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB,CAAC,CAKD,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACzD,CAAC,EAAE,CAAC,EACJ,CAAC,EAAE,CAAC,EACJ,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,OAAO,CAeT;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACjE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,CAAC,EAAE,CAoBL;AAED;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACzD,OAAO,EAAE,CAAC,EACV,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,MAAM,CAUR;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,MAAM,wBAAwB,GAAG,YAAY,GAAG,UAAU,CAAC;AAEjE,wBAAgB,YAAY,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5D,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAC7C,OAAO,CAAC,EAAE,MAAM,EAChB,kBAAkB,GAAE,wBAAuC,GAC1D,CAAC,EAAE,CAkBL;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAChE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,EAC1B,UAAU,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAC5C,MAAM,EAAE,CAoDV"}

package/dist/src/evolution/pareto.js

@@ -118,23 +118,108 @@ export function scalarise(variant, objectives) {
     }
     return total;
 }
-/**
- * Pareto-select up to `maxKeep` variants:
- *   1. Compute non-dominated front.
- *   2. If front size ≤ maxKeep: return front.
- *   3. If front size > maxKeep: sort by scalarised score (descending),
- *      keep top maxKeep.
- *
- * Use this when the GEPA generation budget is fixed (e.g. carry exactly
- * 3 variants to the next round) but the Pareto front happens to be
- * larger.
- */
-export function paretoSelect(variants, objectives, maxKeep) {
+export function paretoSelect(variants, objectives, maxKeep, truncationStrategy = "scalarised") {
     const front = nonDominatedFront(variants, objectives);
     if (typeof maxKeep !== "number" || front.length <= maxKeep)
         return front;
+    if (truncationStrategy === "crowding") {
+        // NSGA-II crowding-distance truncation (Deb et al. 2002, IEEE TEVC).
+        // Per-objective min-max normalisation makes this scale-safe — the
+        // tie-break does NOT inherit `scalarise`'s scale-sensitivity.
+        const distances = crowdingDistance(front, objectives);
+        return [...front]
+            .map((v, i) => ({ v, cd: distances[i] }))
+            .sort((a, b) => b.cd - a.cd)
+            .slice(0, maxKeep)
+            .map((x) => x.v);
+    }
+    // Default "scalarised" — preserves V0.5.0 behaviour exactly.
     return [...front]
         .sort((a, b) => scalarise(b, objectives) - scalarise(a, objectives))
         .slice(0, maxKeep);
 }
+/**
+ * Compute the NSGA-II crowding distance for each variant in a
+ * non-dominated front. Returns an array of the same length as
+ * `variants`, indexed in input order.
+ *
+ * The classic Deb 2002 algorithm:
+ *   1. For each objective `m`: sort the front by `m`.
+ *   2. Boundary variants (lowest + highest `m`) get distance `+Infinity`
+ *      so they always survive truncation.
+ *   3. Interior variants get the normalised gap between neighbours:
+ *      `(f_m(x_{i+1}) - f_m(x_{i-1})) / (f_m_max - f_m_min)`
+ *   4. Sum across objectives.
+ *
+ * **Pure**, no I/O, deterministic. Safe to call from the hot path of
+ * paretoSelect. Returns `0` for any variant whose objective is non-finite
+ * — never returns NaN.
+ *
+ * NEW V0.5.1 (S1235).
+ *
+ * @example
+ * ```ts
+ * import { crowdingDistance, DARWIN_DEFAULT_OBJECTIVES } from "darwin-agents";
+ *
+ * const front = [
+ *   { id: "a", qualityScore: 8, sourceCount: 3, durationMs: 100, outputLength: 500 },
+ *   { id: "b", qualityScore: 9, sourceCount: 2, durationMs: 200, outputLength: 400 },
+ *   { id: "c", qualityScore: 7, sourceCount: 4, durationMs: 150, outputLength: 600 },
+ * ];
+ * const distances = crowdingDistance(front, DARWIN_DEFAULT_OBJECTIVES);
+ * // distances[i] = sum of per-objective normalised neighbour gaps for variant i
+ * ```
+ */
+export function crowdingDistance(variants, objectives) {
+    const n = variants.length;
+    if (n === 0)
+        return [];
+    if (n === 1)
+        return [Number.POSITIVE_INFINITY];
+    if (n === 2) {
+        // Both are boundaries on every objective — assign Infinity to both
+        // so truncation does not pick arbitrarily.
+        return [Number.POSITIVE_INFINITY, Number.POSITIVE_INFINITY];
+    }
+    if (objectives.length === 0)
+        return Array(n).fill(0);
+    const distances = Array(n).fill(0);
+    for (const obj of objectives) {
+        // Build [origIndex, value] pairs so we can sort without losing the
+        // mapping back to the input order.
+        const indexed = [];
+        let allFinite = true;
+        for (let i = 0; i < n; i++) {
+            const raw = variants[i][obj.key];
+            if (typeof raw !== "number" || !Number.isFinite(raw)) {
+                allFinite = false;
+                break;
+            }
+            // Direction-normalise so "better" is always larger — keeps the
+            // boundary assignment symmetric for maximize / minimize.
+            indexed.push({ i, v: obj.direction === "maximize" ? raw : -raw });
+        }
+        if (!allFinite)
+            continue; // Skip objectives with non-finite values.
+        indexed.sort((a, b) => a.v - b.v);
+        const min = indexed[0].v;
+        const max = indexed[n - 1].v;
+        const range = max - min;
+        // Boundary variants get +Infinity — assigned BEFORE the range check
+        // so degenerate-range fronts still keep their boundaries unique.
+        distances[indexed[0].i] = Number.POSITIVE_INFINITY;
+        distances[indexed[n - 1].i] = Number.POSITIVE_INFINITY;
+        if (range === 0)
+            continue; // All variants identical on this objective.
+        for (let k = 1; k < n - 1; k++) {
+            // Skip if we already hit Infinity from a previous objective —
+            // adding to Infinity is still Infinity, so no work to do.
+            if (distances[indexed[k].i] === Number.POSITIVE_INFINITY)
+                continue;
+            const gap = (indexed[k + 1].v - indexed[k - 1].v) / range;
+            distances[indexed[k].i] += gap;
+        }
+    }
+    return distances;
+}
 //# sourceMappingURL=pareto.js.map

package/dist/src/evolution/pareto.js.map

@@ -1 +1 @@
-{"version":3,"file":"pareto.js","sourceRoot":"","sources":["../../../src/evolution/pareto.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAwCH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAKhC;IACJ,EAAE,GAAG,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE;IAC3D,EAAE,GAAG,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;IAC3D,EAAE,GAAG,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE;IAC3D,EAAE,GAAG,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;CAC3D,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,CAAI,EACJ,CAAI,EACJ,UAA6C;IAE7C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,uBAAuB,GAAG,KAAK,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ;YAAE,OAAO,KAAK,CAAC;QACnE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/D,+DAA+D;QAC/D,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtD,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtD,IAAI,KAAK,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC,CAAC,gDAAgD;QACjF,IAAI,KAAK,GAAG,KAAK;YAAE,uBAAuB,GAAG,IAAI,CAAC;IACpD,CAAC;IACD,OAAO,uBAAuB,CAAC;AACjC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAA0B,EAC1B,UAA6C;IAE7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,gEAAgE;QAChE,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QAC/B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtB,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;gBACnD,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CACvB,OAAU,EACV,UAA6C;IAE7C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3D,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC;QAC/B,MAAM,iBAAiB,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,iBAAiB,GAAG,MAAM,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAC1B,QAA0B,EAC1B,UAA6C,EAC7C,OAAgB;IAEhB,MAAM,KAAK,GAAG,iBAAiB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACtD,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO;QAAE,OAAO,KAAK,CAAC;IACzE,OAAO,CAAC,GAAG,KAAK,CAAC;SACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SACnE,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;AACvB,CAAC"}
+{"version":3,"file":"pareto.js","sourceRoot":"","sources":["../../../src/evolution/pareto.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAwCH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAKhC;IACJ,EAAE,GAAG,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE;IAC3D,EAAE,GAAG,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;IAC3D,EAAE,GAAG,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE;IAC3D,EAAE,GAAG,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE;CAC3D,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CACvB,CAAI,EACJ,CAAI,EACJ,UAA6C;IAE7C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,uBAAuB,GAAG,KAAK,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ;YAAE,OAAO,KAAK,CAAC;QACnE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/D,+DAA+D;QAC/D,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtD,MAAM,KAAK,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtD,IAAI,KAAK,GAAG,KAAK;YAAE,OAAO,KAAK,CAAC,CAAC,gDAAgD;QACjF,IAAI,KAAK,GAAG,KAAK;YAAE,uBAAuB,GAAG,IAAI,CAAC;IACpD,CAAC;IACD,OAAO,uBAAuB,CAAC;AACjC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAA0B,EAC1B,UAA6C;IAE7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,gEAAgE;QAChE,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QAC/B,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YACtB,IAAI,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;gBACnD,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,SAAS,CACvB,OAAU,EACV,UAA6C;IAE7C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QAC3D,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC;QAC/B,MAAM,iBAAiB,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,KAAK,IAAI,iBAAiB,GAAG,MAAM,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AA+BD,MAAM,UAAU,YAAY,CAC1B,QAA0B,EAC1B,UAA6C,EAC7C,OAAgB,EAChB,qBAA+C,YAAY;IAE3D,MAAM,KAAK,GAAG,iBAAiB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACtD,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,OAAO;QAAE,OAAO,KAAK,CAAC;IACzE,IAAI,kBAAkB,KAAK,UAAU,EAAE,CAAC;QACtC,qEAAqE;QACrE,kEAAkE;QAClE,8DAA8D;QAC9D,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACtD,OAAO,CAAC,GAAG,KAAK,CAAC;aACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC;aACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC;aACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,6DAA6D;IAC7D,OAAO,CAAC,GAAG,KAAK,CAAC;SACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SACnE,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAA0B,EAC1B,UAA6C;IAE7C,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC1B,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAC/C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,mEAAmE;QACnE,2CAA2C;QAC3C,OAAO,CAAC,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAErD,MAAM,SAAS,GAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,mEAAmE;QACnE,mCAAmC;QACnC,MAAM,OAAO,GAAoC,EAAE,CAAC;QACpD,IAAI,SAAS,GAAG,IAAI,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrD,SAAS,GAAG,KAAK,CAAC;gBAClB,MAAM;YACR,CAAC;YACD,+DAA+D;YAC/D,yDAAyD;YACzD,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,SAAS;YAAE,SAAS,CAAC,0CAA0C;QAEpE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;QAExB,oEAAoE;QACpE,iEAAiE;QACjE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACpD,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAExD,IAAI,KAAK,KAAK,CAAC;YAAE,SAAS,CAAC,4CAA4C;QAEvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,8DAA8D;YAC9D,0DAA0D;YAC1D,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,iBAAiB;gBAAE,SAAS;YACpE,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YAC5D,SAAS,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/src/evolution/reflector.d.ts

@@ -28,13 +28,14 @@
  * deviations from Algorithm 1/2 of the GEPA paper (arxiv 2507.19457).
  * For a feature-complete GEPA experience use the upstream Python tool.
  *
- * **Single-LM design note (R1 Research Finding F7, S1185):** GEPA's
- * official guidance is to use a STRONGER LM for reflection than for
- * task execution (their `reflection_lm` parameter). This adapter
- * intentionally accepts only one injected `RunPromptFn` to keep the
- * V0.5 alpha surface minimal. Stronger-reflection-LM support
- * (`reflectionRunPrompt` override) is deferred to V0.5.1 — pass a
- * higher-tier model in your single `runPrompt` callback as a workaround.
+ * **Stronger reflection LM (V0.5.1, S1235):** GEPA's official guidance
+ * is to use a STRONGER LM for reflection than for task execution
+ * (their `reflection_lm` parameter). Direct support shipped in V0.5.1
+ * via `GepaOptimizerOptions.reflectionRunPrompt` on `GepaOptimizer`'s
+ * constructor — the override is wired into the internal Reflector so
+ * `reflect()` calls route through the stronger LM. The `Reflector`
+ * class itself remains single-LM by design (the override lives one
+ * layer up in `GepaOptimizer`).
  */
 import type { ExecutionTrace } from "../types.js";
 import type { RunPromptFn } from "./run-prompt-fn.js";

package/dist/src/evolution/reflector.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reflector.d.ts","sourceRoot":"","sources":["../../../src/evolution/reflector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAKtD,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,iEAAiE;AACjE,MAAM,WAAW,kBAAkB;IACjC,qEAAqE;IACrE,SAAS,EAAE,MAAM,CAAC;IAClB,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd;;;;;OAKG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB,uEAAuE;IACvE,KAAK,CAAC,EAAE,cAAc,CAAC;IACvB,gFAAgF;IAChF,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAsBD;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAc;gBAE5B,SAAS,EAAE,WAAW;IAOlC;;;;;;;OAOG;IACG,OAAO,CACX,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,aAAa,CAAC,kBAAkB,CAAC,EAC5C,IAAI,GAAE,cAAmB,GACxB,OAAO,CAAC,MAAM,CAAC;IA+ClB,iCAAiC;IACjC,OAAO,CAAC,cAAc;IA2BtB,6DAA6D;IAC7D,OAAO,CAAC,WAAW;IAQnB,yEAAyE;IACzE,OAAO,CAAC,0BAA0B;CAUnC"}
+{"version":3,"file":"reflector.d.ts","sourceRoot":"","sources":["../../../src/evolution/reflector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAKtD,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,iEAAiE;AACjE,MAAM,WAAW,kBAAkB;IACjC,qEAAqE;IACrE,SAAS,EAAE,MAAM,CAAC;IAClB,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd;;;;;OAKG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB,uEAAuE;IACvE,KAAK,CAAC,EAAE,cAAc,CAAC;IACvB,gFAAgF;IAChF,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAsBD;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAc;gBAE5B,SAAS,EAAE,WAAW;IAOlC;;;;;;;OAOG;IACG,OAAO,CACX,aAAa,EAAE,MAAM,EACrB,SAAS,EAAE,aAAa,CAAC,kBAAkB,CAAC,EAC5C,IAAI,GAAE,cAAmB,GACxB,OAAO,CAAC,MAAM,CAAC;IA+ClB,iCAAiC;IACjC,OAAO,CAAC,cAAc;IA2BtB,6DAA6D;IAC7D,OAAO,CAAC,WAAW;IAQnB,yEAAyE;IACzE,OAAO,CAAC,0BAA0B;CAUnC"}

package/dist/src/evolution/reflector.js

@@ -28,13 +28,14 @@
  * deviations from Algorithm 1/2 of the GEPA paper (arxiv 2507.19457).
  * For a feature-complete GEPA experience use the upstream Python tool.
  *
- * **Single-LM design note (R1 Research Finding F7, S1185):** GEPA's
- * official guidance is to use a STRONGER LM for reflection than for
- * task execution (their `reflection_lm` parameter). This adapter
- * intentionally accepts only one injected `RunPromptFn` to keep the
- * V0.5 alpha surface minimal. Stronger-reflection-LM support
- * (`reflectionRunPrompt` override) is deferred to V0.5.1 — pass a
- * higher-tier model in your single `runPrompt` callback as a workaround.
+ * **Stronger reflection LM (V0.5.1, S1235):** GEPA's official guidance
+ * is to use a STRONGER LM for reflection than for task execution
+ * (their `reflection_lm` parameter). Direct support shipped in V0.5.1
+ * via `GepaOptimizerOptions.reflectionRunPrompt` on `GepaOptimizer`'s
+ * constructor — the override is wired into the internal Reflector so
+ * `reflect()` calls route through the stronger LM. The `Reflector`
+ * class itself remains single-LM by design (the override lives one
+ * layer up in `GepaOptimizer`).
  */
 const DEFAULT_FEEDBACK_CAP = 2000;
 const DEFAULT_REFLECTION_TEMPLATE = `

package/dist/src/evolution/reflector.js.map

@@ -1 +1 @@
-{"version":3,"file":"reflector.js","sourceRoot":"","sources":["../../../src/evolution/reflector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAsDH,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAClC,MAAM,2BAA2B,GAAG;;;;;;;;;;;;;;;;;CAiBnC,CAAC,IAAI,EAAE,CAAC;AAET;;;GAGG;AACH,MAAM,OAAO,SAAS;IACH,SAAS,CAAc;IAExC,YAAY,SAAsB;QAChC,IAAI,OAAO,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,OAAO,CACX,aAAqB,EACrB,SAA4C,EAC5C,OAAuB,EAAE;QAEzB,IAAI,OAAO,aAAa,KAAK,QAAQ,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpE,MAAM,IAAI,SAAS,CAAC,6DAA6D,CAAC,CAAC;QACrF,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,SAAS,CAAC,8DAA8D,CAAC,CAAC;QACtF,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,IAAI,2BAA2B,CAAC;QAC9E,gEAAgE;QAChE,2DAA2D;QAC3D,gEAAgE;QAChE,sEAAsE;QACtE,4DAA4D;QAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,IAAI,oBAAoB,CAAC;QACxD,MAAM,GAAG,GACP,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC;YACnC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,oBAAoB,CAAC;QAE3B,MAAM,aAAa,GAAG,SAAS;aAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;aACjD,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,0DAA0D;QAC1D,mEAAmE;QACnE,uEAAuE;QACvE,mEAAmE;QACnE,wEAAwE;QACxE,gBAAgB;QAChB,MAAM,UAAU,GAAG,QAAQ;aACxB,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;aACxC,OAAO,CAAC,aAAa,EAAE,aAAa,CAAC;aACrC,OAAO,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;QAE9C,IAAI,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC/C,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAEpC,MAAM,SAAS,GACb,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACnF,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;YAC/B,OAAO,GAAG,IAAI,CAAC,0BAA0B,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAChE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,iCAAiC;IACzB,cAAc,CACpB,EAAsB,EACtB,KAAa,EACb,GAAW;QAEX,MAAM,UAAU,GACd,EAAE,CAAC,YAAY,CAAC,MAAM,GAAG,GAAG;YAC1B,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,kBAAkB;YACpD,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC;QACtB,MAAM,KAAK,GAAa;YACtB,eAAe,KAAK,MAAM,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO;YAC3E,WAAW;YACX,UAAU;SACX,CAAC;QACF,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YACb,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAC1B,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CACvD,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACd,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,KAAK,CAAC,SAAS,UAAU;oBACvD,GAAG,EAAE,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,qBAAqB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;oBAChF,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,6DAA6D;IACrD,WAAW,CAAC,GAAW;QAC7B,IAAI,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACrB,wDAAwD;QACxD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;QAC3D,IAAI,KAAK;YAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,yEAAyE;IACjE,0BAA0B,CAAC,IAAY,EAAE,SAAiB;QAChE,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnD,OAAO,QAAQ,GAAG,SAAS,GAAG,GAAG;YAC/B,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC;YAClC,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;CACF"}
+{"version":3,"file":"reflector.js","sourceRoot":"","sources":["../../../src/evolution/reflector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAsDH,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAClC,MAAM,2BAA2B,GAAG;;;;;;;;;;;;;;;;;CAiBnC,CAAC,IAAI,EAAE,CAAC;AAET;;;GAGG;AACH,MAAM,OAAO,SAAS;IACH,SAAS,CAAc;IAExC,YAAY,SAAsB;QAChC,IAAI,OAAO,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,OAAO,CACX,aAAqB,EACrB,SAA4C,EAC5C,OAAuB,EAAE;QAEzB,IAAI,OAAO,aAAa,KAAK,QAAQ,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpE,MAAM,IAAI,SAAS,CAAC,6DAA6D,CAAC,CAAC;QACrF,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,SAAS,CAAC,8DAA8D,CAAC,CAAC;QACtF,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,wBAAwB,IAAI,2BAA2B,CAAC;QAC9E,gEAAgE;QAChE,2DAA2D;QAC3D,gEAAgE;QAChE,sEAAsE;QACtE,4DAA4D;QAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,IAAI,oBAAoB,CAAC;QACxD,MAAM,GAAG,GACP,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC;YACnC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACpB,CAAC,CAAC,oBAAoB,CAAC;QAE3B,MAAM,aAAa,GAAG,SAAS;aAC5B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;aACjD,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,0DAA0D;QAC1D,mEAAmE;QACnE,uEAAuE;QACvE,mEAAmE;QACnE,wEAAwE;QACxE,gBAAgB;QAChB,MAAM,UAAU,GAAG,QAAQ;aACxB,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;aACxC,OAAO,CAAC,aAAa,EAAE,aAAa,CAAC;aACrC,OAAO,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;QAE9C,IAAI,OAAO,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC/C,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAEpC,MAAM,SAAS,GACb,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACnF,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;YAC/B,OAAO,GAAG,IAAI,CAAC,0BAA0B,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAChE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,iCAAiC;IACzB,cAAc,CACpB,EAAsB,EACtB,KAAa,EACb,GAAW;QAEX,MAAM,UAAU,GACd,EAAE,CAAC,YAAY,CAAC,MAAM,GAAG,GAAG;YAC1B,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,kBAAkB;YACpD,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC;QACtB,MAAM,KAAK,GAAa;YACtB,eAAe,KAAK,MAAM,EAAE,CAAC,SAAS,WAAW,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO;YAC3E,WAAW;YACX,UAAU;SACX,CAAC;QACF,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YACb,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAC1B,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CACvD,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACd,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,KAAK,CAAC,SAAS,UAAU;oBACvD,GAAG,EAAE,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,qBAAqB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;oBAChF,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,6DAA6D;IACrD,WAAW,CAAC,GAAW;QAC7B,IAAI,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACrB,wDAAwD;QACxD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;QAC3D,IAAI,KAAK;YAAE,GAAG,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,yEAAyE;IACjE,0BAA0B,CAAC,IAAY,EAAE,SAAiB;QAChE,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAAE,OAAO,IAAI,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnD,OAAO,QAAQ,GAAG,SAAS,GAAG,GAAG;YAC/B,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC;YAClC,CAAC,CAAC,SAAS,CAAC;IAChB,CAAC;CACF"}

package/dist/src/index.d.ts

@@ -31,8 +31,8 @@ export { ClaudeCliProvider } from './providers/claude-cli.js';
 export { createMemory, SqliteMemoryProvider, PostgresMemoryProvider } from './memory/index.js';
 export { loadNotificationConfig } from './evolution/notifications.js';
 export type { NotificationConfig } from './evolution/notifications.js';
-export { dominates, nonDominatedFront, paretoSelect, scalarise, DARWIN_DEFAULT_OBJECTIVES, type ParetoObjective, } from './evolution/pareto.js';
+export { dominates, nonDominatedFront, paretoSelect, scalarise, crowdingDistance, DARWIN_DEFAULT_OBJECTIVES, type ParetoObjective, type ParetoTruncationStrategy, } from './evolution/pareto.js';
 export { Reflector, type ReflectiveFeedback, type ReflectOptions, } from './evolution/reflector.js';
 export type { RunPromptFn } from './evolution/run-prompt-fn.js';
-export { GepaOptimizer, type ScoredVariant, type GenerateOptions as GepaGenerateOptions, type NextGenerationOptions as GepaNextGenerationOptions, } from './evolution/optimizer-gepa.js';
+export { GepaOptimizer, type ScoredVariant, type GenerateOptions as GepaGenerateOptions, type NextGenerationOptions as GepaNextGenerationOptions, type GepaOptimizerOptions, type MergeOptions as GepaMergeOptions, } from './evolution/optimizer-gepa.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/src/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAG5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,YAAY,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAGjF,YAAY,EACV,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,aAAa,EACb,aAAa,EACb,WAAW,EACX,cAAc,EACd,kBAAkB,EAClB,eAAe,EACf,QAAQ,EACR,eAAe,EACf,cAAc,EACd,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,SAAS,EACT,gBAAgB,EAChB,aAAa,EACb,eAAe,EACf,cAAc,GACf,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAG7D,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAGvF,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACvG,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAG9D,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAG/F,OAAO,EAAE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC;AACtE,YAAY,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,EACL,SAAS,EACT,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,yBAAyB,EACzB,KAAK,eAAe,GACrB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,SAAS,EACT,KAAK,kBAAkB,EACvB,KAAK,cAAc,GACpB,MAAM,0BAA0B,CAAC;AAClC,YAAY,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EACL,aAAa,EACb,KAAK,aAAa,EAClB,KAAK,eAAe,IAAI,mBAAmB,EAC3C,KAAK,qBAAqB,IAAI,yBAAyB,GACxD,MAAM,+BAA+B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAG5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,YAAY,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAGjF,YAAY,EACV,eAAe,EACf,YAAY,EACZ,gBAAgB,EAChB,aAAa,EACb,aAAa,EACb,WAAW,EACX,cAAc,EACd,kBAAkB,EAClB,eAAe,EACf,QAAQ,EACR,eAAe,EACf,cAAc,EACd,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,SAAS,EACT,gBAAgB,EAChB,aAAa,EACb,eAAe,EACf,cAAc,GACf,MAAM,YAAY,CAAC;AAGpB,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAG7D,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAGvF,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,YAAY,EAAE,WAAW,EAAE,cAAc,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACvG,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAG9D,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAG/F,OAAO,EAAE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC;AACtE,YAAY,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAIvE,OAAO,EACL,SAAS,EACT,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,gBAAgB,EAChB,yBAAyB,EACzB,KAAK,eAAe,EACpB,KAAK,wBAAwB,GAC9B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,SAAS,EACT,KAAK,kBAAkB,EACvB,KAAK,cAAc,GACpB,MAAM,0BAA0B,CAAC;AAClC,YAAY,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EACL,aAAa,EACb,KAAK,aAAa,EAClB,KAAK,eAAe,IAAI,mBAAmB,EAC3C,KAAK,qBAAqB,IAAI,yBAAyB,EACvD,KAAK,oBAAoB,EACzB,KAAK,YAAY,IAAI,gBAAgB,GACtC,MAAM,+BAA+B,CAAC"}

package/dist/src/index.js

@@ -35,7 +35,8 @@ export { createMemory, SqliteMemoryProvider, PostgresMemoryProvider } from './me
 // Notifications
 export { loadNotificationConfig } from './evolution/notifications.js';
 // V0.5.0-alpha.2 — GEPA-Style Reflective Optimizer (S1185 Phase 2 A2)
-export { dominates, nonDominatedFront, paretoSelect, scalarise, DARWIN_DEFAULT_OBJECTIVES, } from './evolution/pareto.js';
+// V0.5.1 — crowdingDistance + ParetoTruncationStrategy + GepaOptimizer.merge + reflectionRunPrompt
+export { dominates, nonDominatedFront, paretoSelect, scalarise, crowdingDistance, DARWIN_DEFAULT_OBJECTIVES, } from './evolution/pareto.js';
 export { Reflector, } from './evolution/reflector.js';
 export { GepaOptimizer, } from './evolution/optimizer-gepa.js';
 //# sourceMappingURL=index.js.map

package/dist/src/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,WAAW;AACX,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,8DAA8D;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AA2B7D,YAAY;AACZ,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE7D,kBAAkB;AAClB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEvF,YAAY;AACZ,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D,SAAS;AACT,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAE/F,gBAAgB;AAChB,OAAO,EAAE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC;AAGtE,sEAAsE;AACtE,OAAO,EACL,SAAS,EACT,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,yBAAyB,GAE1B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,SAAS,GAGV,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,aAAa,GAId,MAAM,+BAA+B,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,WAAW;AACX,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,8DAA8D;AAC9D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AA2B7D,YAAY;AACZ,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE7D,kBAAkB;AAClB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEvF,YAAY;AACZ,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAE9D,SAAS;AACT,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAE/F,gBAAgB;AAChB,OAAO,EAAE,sBAAsB,EAAE,MAAM,8BAA8B,CAAC;AAGtE,sEAAsE;AACtE,mGAAmG;AACnG,OAAO,EACL,SAAS,EACT,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,gBAAgB,EAChB,yBAAyB,GAG1B,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,SAAS,GAGV,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,aAAa,GAMd,MAAM,+BAA+B,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "darwin-agents",
-  "version": "0.5.0-alpha.2",
+  "version": "0.5.1-alpha.2",
   "description": "AI agents that improve themselves. Self-evolving prompts via A/B testing, multi-model critics, safety gates, and pattern detection.",
   "type": "module",
   "bin": {
@@ -58,7 +58,7 @@
   },
   "dependencies": {},
   "peerDependencies": {
-    "better-sqlite3": "^11.0.0",
+    "better-sqlite3": "^11.0.0 || ^12.0.0",
     "pg": "^8.0.0"
   },
   "peerDependenciesMeta": {
@@ -71,6 +71,7 @@
   },
   "devDependencies": {
     "@types/better-sqlite3": "^7.6.13",
+    "better-sqlite3": "^12.10.0",
     "@types/node": "^25.6.0",
     "@types/pg": "^8.11.0",
     "tsx": "^4.19.0",