What problem does it solve? Improving an LLM system without retraining the model requires optimizing the scaffolding around it (memory, retrieval, context assembly, prompts, summarizers), but doing this by hand is slow and ad hoc. This Skill automates that search: it proposes candidate harness implementations, scores each on a cheap deterministic eval, and maintains a Pareto frontier of quality versus cost. ## Core Features & Use Cases - Native evolutionary search loop: Proposes k candidate harness variants per round with parallel proposer agents, validates them, scores each with a $0 deterministic scorer, and Pareto-merges results, all via native Workflow/Agent/loop tools instead of a standalone Python harness. - Guardrails against silent failure: Built-in defenses against the frozen-replay defect, Goodharting (hard quality floors), eval leakage, and premature promotion, with held-out test discipline enforced. - Reusable templates and tooling: Ships a candidate-interface template, scorer template, proposer-prior template, a parameterized Workflow script, and a deterministic Pareto-frontier script (scripts/pareto.py). - Use Case: You want to shrink the tokens injected by your agent's memory summarizer without losing accuracy. Define the summarizer interface and a fidelity rubric, then run the search to get a frontier of compressors that hold fidelity above a floor at progressively lower character counts. ## Quick Start Ask the AI to use the meta-harness skill to frame a search over your harness component, build the scorer and candidate interface from the templates, and run the workflow to produce a quality-versus-cost Pareto frontier.