cognitive-core 0.2.5 → 0.3.1

package/dist/learning/mutation-gate.d.ts

@@ -0,0 +1,218 @@
+/**
+ * MutationGate — acceptance gate for playbook mutations.
+ *
+ * Direct port of GEPA's `StrictImprovementAcceptance` (strategies/acceptance.py:39-48)
+ * adapted for cognitive-core's experience-stream substrate.
+ *
+ * Flow:
+ *   1. Sample a minibatch of experiences for the parent playbook.
+ *   2. Score both parent and candidate on each experience using a
+ *      `ReplayJudge` (cached results preferred over fresh judge calls).
+ *   3. Accept if `sum(child) > sum(parent)`; reject otherwise.
+ *   4. On accept: snapshot parent into version history, persist child
+ *      with `parentPlaybookId` set for lineage.
+ *
+ * Cache semantics:
+ *   - Cache lookups respect the `judged_by` priority: live > verifier > llm-judge.
+ *   - Fresh judge results are written back at `judged_by = 'llm-judge'`
+ *     priority. They will not overwrite live observations from real solves.
+ *
+ * Sparse-minibatch handling: when `sampleMinibatchForPlaybook` returns
+ * fewer than `minMinibatchSize` experiences, the gate accepts the
+ * mutation provisionally. There's no evidence to reject on, and the
+ * frontier will catch regressions in real-world use.
+ */
+import type { Playbook } from '../types/playbook.js';
+import type { PlaybookLibrary } from '../memory/playbook.js';
+import type { SqlitePersistence } from '../persistence/index.js';
+import type { ReplayJudge } from './replay.js';
+/**
+ * Configuration for the mutation gate.
+ */
+export interface MutationGateConfig {
+    /** Number of experiences to sample for the gate (default: 5) */
+    minibatchSize?: number;
+    /**
+     * If the sampled minibatch has fewer than this many experiences, the
+     * gate accepts unconditionally. Default 3 — below this we have no
+     * statistical signal to reject on.
+     */
+    minMinibatchSize?: number;
+    /**
+     * How to handle an empty minibatch (no experiences available at all
+     * for the gate).
+     *
+     *   - `'accept'`: auto-accept unconditionally (legacy behavior). Useful
+     *     when the live frontier is expected to correct mistakes over time
+     *     and you want maximum exploration.
+     *   - `'reject'`: never accept on zero evidence. Strictest policy.
+     *   - `'gate-on-frontier'` (default): accept only if at least one
+     *     parent has any frontier presence on the task signature. Filters
+     *     out brand-new-signature merges (no informed reason to accept)
+     *     while preserving the cold-start path for active signatures.
+     */
+    emptyMinibatchPolicy?: 'accept' | 'reject' | 'gate-on-frontier';
+}
+/**
+ * Per-example breakdown of a mutation evaluation.
+ */
+export interface ExampleEvaluation {
+    experienceId: string;
+    parentScore: number;
+    childScore: number;
+}
+/**
+ * Why the gate decided what it did. Shared across `MutationDecision`
+ * (single-parent) and `MergeDecision` (two-parent) so the union can't
+ * drift between the two result shapes.
+ *
+ *   - `improved`: child beats parent(s) on the minibatch
+ *   - `regression`: child lost to at least one parent
+ *   - `sparse-minibatch`: too few experiences for a real gate; auto-accepted
+ *   - `empty-minibatch`: no experiences available; handled per emptyMinibatchPolicy
+ *   - `no-mutation`: child hashes identical to parent — nothing to do
+ *   - `parent-missing`: parent playbook not found
+ */
+export type GateReason = 'improved' | 'regression' | 'sparse-minibatch' | 'empty-minibatch' | 'no-mutation' | 'parent-missing';
+/**
+ * Result of a mutation proposal.
+ */
+export interface MutationDecision {
+    accepted: boolean;
+    reason: GateReason;
+    parentSum: number;
+    childSum: number;
+    perExample: ExampleEvaluation[];
+    /** Number of fresh judge calls made (excludes cache hits). */
+    judgeCalls: number;
+}
+/**
+ * Result of a two-parent merge proposal. Same shape as `MutationDecision`
+ * but with both parents' sums recorded — acceptance is `child >= max(parents)`,
+ * GEPA's `engine.py:688` rule.
+ */
+export interface MergeDecision {
+    accepted: boolean;
+    reason: GateReason;
+    /** Sum of parent A's frontier scores on the stratified minibatch. */
+    parentASum: number;
+    /** Sum of parent B's frontier scores on the stratified minibatch. */
+    parentBSum: number;
+    /** Sum of the child's (judge or cache) scores on the same minibatch. */
+    childSum: number;
+    /** Per-example breakdown: each parent's score and the child's. */
+    perExample: Array<{
+        experienceId: string;
+        parentAScore: number;
+        parentBScore: number;
+        childScore: number;
+        /** Which parent's bucket this experience came from. */
+        bucket: 'aWins' | 'bWins' | 'tied';
+    }>;
+    judgeCalls: number;
+    /** Bucket sizes from the stratified sampler. */
+    buckets: {
+        aWins: number;
+        bWins: number;
+        tied: number;
+    };
+}
+/**
+ * MutationGate — orchestrates judge-based acceptance of playbook mutations.
+ */
+export declare class MutationGate {
+    private readonly library;
+    private readonly persistence;
+    private readonly judge;
+    private config;
+    constructor(library: PlaybookLibrary, persistence: SqlitePersistence, judge: ReplayJudge, config?: MutationGateConfig);
+    /**
+     * Propose a child playbook as a mutation of `parentId`. Gate it on a
+     * minibatch and persist on acceptance.
+     *
+     * `proposed.id` is preserved as-is. Callers should generate a fresh id
+     * for the child (the gate does not enforce uniqueness on its own).
+     *
+     * `taskSignature` (optional) is used ONLY for the empty-minibatch
+     * `gate-on-frontier` policy (is this signature active for the parent?).
+     * It does NOT filter the gate minibatch: gate sampling pools the parent's
+     * recent frontier experiences across all `{domain}:{intent}` signatures
+     * (see the note in `sampleMinibatchForPlaybook`). Filtering by the
+     * fine-grained signature would shatter a domain-general playbook's
+     * evidence to ~1-per-signature, permanently below `minMinibatchSize`, so
+     * the real parent-vs-child comparison could never fire on real benchmarks.
+     */
+    propose(parentId: string, proposed: Playbook, taskSignature?: string): Promise<MutationDecision>;
+    /**
+     * Propose a merged child from two parents. Faithful port of GEPA's
+     * `engine.py:_run_parallel_merge` + `merge.py:select_eval_subsample`:
+     *
+     *   1. Stratified sampling: pick from buckets where A beat B, where B
+     *      beat A, and where they tied (`sampleMergeMinibatch`).
+     *   2. Parent scores come from the frontier directly — those are
+     *      ground truth from past live solves, no judge call needed.
+     *   3. Child scores come from cache → judge fallback.
+     *   4. Acceptance: `child_sum >= max(parent_a_sum, parent_b_sum)`.
+     *      Stricter than the single-parent gate's `child > parent` and
+     *      symmetric across both parents — this is the rule that catches
+     *      merges that beat only the primary while regressing the secondary.
+     *
+     * **Parent ordering contract:** by convention, `parentAId` is the
+     * primary parent and `parentBId` is the secondary. Callers (typically
+     * `MergeProposer`) determine primary by signature-scoped `totalWins`
+     * and must pass them in that order. The accepted child's
+     * `parentPlaybookId` is set to `parentAId`; the gate does NOT recompute
+     * primary (a recomputation using global wins would disagree when a
+     * parent has more wins on a *different* signature).
+     *
+     * On accept: both parents' versions are snapshotted into
+     * `playbook_versions`. The secondary's lineage lives implicitly in
+     * the merged `evolution.createdFrom` produced by `mergePlaybooks`.
+     */
+    proposeFromMerge(parentAId: string, parentBId: string, proposed: Playbook, taskSignature: string, 
+    /**
+     * Optional RNG for the stratified minibatch sampler. Pass a
+     * deterministic source in tests; production uses Math.random.
+     */
+    rng?: () => number): Promise<MergeDecision>;
+    /**
+     * Decide whether to accept under the empty-minibatch policy.
+     *
+     *   - `'accept'`: always accept (legacy behavior)
+     *   - `'reject'`: never accept
+     *   - `'gate-on-frontier'` (default): accept only if at least one
+     *     parent has any frontier presence on the given task signature.
+     *     `taskSignature` is optional (the single-parent gate allows it
+     *     to be undefined); when missing, this policy degrades to `reject`
+     *     because we have no scope to ask "is this signature active?"
+     */
+    private applyEmptyMinibatchPolicy;
+    /**
+     * Get a score from cache if present; otherwise invoke the judge and
+     * write the result back to cache at `llm-judge` priority. Returns
+     * the score and a flag indicating whether it came from cache.
+     */
+    private resolveScore;
+    /**
+     * Snapshot parent version, set lineage on child, persist child.
+     */
+    private commit;
+    /**
+     * Snapshot BOTH parents, set primary lineage on child, persist child.
+     *
+     * By convention, the FIRST positional parent (`parentA`) is the primary
+     * — `proposeFromMerge` requires callers to pass parents in (primary,
+     * secondary) order. The `MergeProposer` already determines primary by
+     * signature-scoped `totalWins` and places it in `proposal.primaryParentId`,
+     * so the gate trusts that ordering rather than recomputing from
+     * signature-agnostic `getFrontierContribution` (which would disagree
+     * when a parent has more global wins on a *different* signature).
+     *
+     * The secondary parent's contribution is captured in the merged
+     * playbook's `evolution.createdFrom` (which `mergePlaybooks` populates
+     * with the union of both parents' source trajectories).
+     */
+    private commitMerge;
+}
+export declare function createMutationGate(library: PlaybookLibrary, persistence: SqlitePersistence, judge: ReplayJudge, config?: MutationGateConfig): MutationGate;
+//# sourceMappingURL=mutation-gate.d.ts.map

package/dist/learning/mutation-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mutation-gate.d.ts","sourceRoot":"","sources":["../../src/learning/mutation-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAErD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACjE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,gEAAgE;IAChE,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;;;;;;;;;OAYG;IACH,oBAAoB,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,kBAAkB,CAAC;CACjE;AAQD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,UAAU,GAClB,UAAU,GACV,YAAY,GACZ,kBAAkB,GAClB,iBAAiB,GACjB,aAAa,GACb,gBAAgB,CAAC;AAErB;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,UAAU,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,iBAAiB,EAAE,CAAC;IAChC,8DAA8D;IAC9D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,UAAU,CAAC;IACnB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,UAAU,EAAE,MAAM,CAAC;IACnB,wEAAwE;IACxE,QAAQ,EAAE,MAAM,CAAC;IACjB,kEAAkE;IAClE,UAAU,EAAE,KAAK,CAAC;QAChB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,UAAU,EAAE,MAAM,CAAC;QACnB,uDAAuD;QACvD,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,MAAM,CAAC;KACpC,CAAC,CAAC;IACH,UAAU,EAAE,MAAM,CAAC;IACnB,gDAAgD;IAChD,OAAO,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;CACzD;AAED;;GAEG;AACH,qBAAa,YAAY;IAIrB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK;IALxB,OAAO,CAAC,MAAM,CAA+B;gBAG1B,OAAO,EAAE,eAAe,EACxB,WAAW,EAAE,iBAAiB,EAC9B,KAAK,EAAE,WAAW,EACnC,MAAM,GAAE,kBAAuB;IAKjC;;;;;;;;;;;;;;;OAeG;IACG,OAAO,CACX,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,QAAQ,EAClB,aAAa,CAAC,EAAE,MAAM,GACrB,OAAO,CAAC,gBAAgB,CAAC;IAsH5B;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACG,gBAAgB,CACpB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,QAAQ,EAClB,aAAa,EAAE,MAAM;IACrB;;;OAGG;IACH,GAAG,GAAE,MAAM,MAAoB,GAC9B,OAAO,CAAC,aAAa,CAAC;IAwIzB;;;;;;;;;;OAUG;YACW,yBAAyB;IAkBvC;;;;OAIG;YACW,YAAY;IAwB1B;;OAEG;YACW,MAAM;IAUpB;;;;;;;;;;;;;;OAcG;YACW,WAAW;CAe1B;AAED,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,eAAe,EACxB,WAAW,EAAE,iBAAiB,EAC9B,KAAK,EAAE,WAAW,EAClB,MAAM,CAAC,EAAE,kBAAkB,GAC1B,YAAY,CAEd"}

package/dist/learning/mutation-gate.js

@@ -0,0 +1,390 @@
+/**
+ * MutationGate — acceptance gate for playbook mutations.
+ *
+ * Direct port of GEPA's `StrictImprovementAcceptance` (strategies/acceptance.py:39-48)
+ * adapted for cognitive-core's experience-stream substrate.
+ *
+ * Flow:
+ *   1. Sample a minibatch of experiences for the parent playbook.
+ *   2. Score both parent and candidate on each experience using a
+ *      `ReplayJudge` (cached results preferred over fresh judge calls).
+ *   3. Accept if `sum(child) > sum(parent)`; reject otherwise.
+ *   4. On accept: snapshot parent into version history, persist child
+ *      with `parentPlaybookId` set for lineage.
+ *
+ * Cache semantics:
+ *   - Cache lookups respect the `judged_by` priority: live > verifier > llm-judge.
+ *   - Fresh judge results are written back at `judged_by = 'llm-judge'`
+ *     priority. They will not overwrite live observations from real solves.
+ *
+ * Sparse-minibatch handling: when `sampleMinibatchForPlaybook` returns
+ * fewer than `minMinibatchSize` experiences, the gate accepts the
+ * mutation provisionally. There's no evidence to reject on, and the
+ * frontier will catch regressions in real-world use.
+ */
+const DEFAULTS = {
+    minibatchSize: 5,
+    minMinibatchSize: 3,
+    emptyMinibatchPolicy: 'gate-on-frontier',
+};
+/**
+ * MutationGate — orchestrates judge-based acceptance of playbook mutations.
+ */
+export class MutationGate {
+    library;
+    persistence;
+    judge;
+    config;
+    constructor(library, persistence, judge, config = {}) {
+        this.library = library;
+        this.persistence = persistence;
+        this.judge = judge;
+        this.config = { ...DEFAULTS, ...config };
+    }
+    /**
+     * Propose a child playbook as a mutation of `parentId`. Gate it on a
+     * minibatch and persist on acceptance.
+     *
+     * `proposed.id` is preserved as-is. Callers should generate a fresh id
+     * for the child (the gate does not enforce uniqueness on its own).
+     *
+     * `taskSignature` (optional) is used ONLY for the empty-minibatch
+     * `gate-on-frontier` policy (is this signature active for the parent?).
+     * It does NOT filter the gate minibatch: gate sampling pools the parent's
+     * recent frontier experiences across all `{domain}:{intent}` signatures
+     * (see the note in `sampleMinibatchForPlaybook`). Filtering by the
+     * fine-grained signature would shatter a domain-general playbook's
+     * evidence to ~1-per-signature, permanently below `minMinibatchSize`, so
+     * the real parent-vs-child comparison could never fire on real benchmarks.
+     */
+    async propose(parentId, proposed, taskSignature) {
+        const parent = await this.library.get(parentId);
+        if (!parent) {
+            return {
+                accepted: false,
+                reason: 'parent-missing',
+                parentSum: 0,
+                childSum: 0,
+                perExample: [],
+                judgeCalls: 0,
+            };
+        }
+        const parentHash = this.library.hashOf(parent);
+        const childHash = this.library.hashOf(proposed);
+        if (parentHash === childHash) {
+            return {
+                accepted: false,
+                reason: 'no-mutation',
+                parentSum: 0,
+                childSum: 0,
+                perExample: [],
+                judgeCalls: 0,
+            };
+        }
+        // Pool the gate minibatch ACROSS `{domain}:{intent}` signatures.
+        // `getFrontierByPlaybook` rows are already per-playbook, so every row is
+        // an application of THIS parent and is relevant regardless of task
+        // domain. A domain-general playbook applied across many domains (real
+        // benchmark families span retail-operations, cloud-finops, it-operations,
+        // …) would otherwise have its evidence shattered into ~1-per-signature
+        // buckets, always below `minMinibatchSize`, so the gate would take the
+        // sparse-minibatch auto-accept bypass and NEVER run the real parent-vs-
+        // child verifier comparison. `taskSignature` is still threaded to the
+        // empty-minibatch policy below (frontier-presence check), just not used
+        // as the sampling FILTER.
+        const minibatch = await this.library.sampleMinibatchForPlaybook(parentId, this.config.minibatchSize, taskSignature, 
+        /* poolAcrossSignatures */ true);
+        if (minibatch.length === 0) {
+            // No evidence — fall back to the configured empty-minibatch policy.
+            const policyAccept = await this.applyEmptyMinibatchPolicy([parent], taskSignature);
+            if (policyAccept) {
+                await this.commit(parent, proposed);
+            }
+            return {
+                accepted: policyAccept,
+                reason: 'empty-minibatch',
+                parentSum: 0,
+                childSum: 0,
+                perExample: [],
+                judgeCalls: 0,
+            };
+        }
+        let parentSum = 0;
+        let childSum = 0;
+        let judgeCalls = 0;
+        const perExample = [];
+        for (const exp of minibatch) {
+            const parentResult = await this.resolveScore(parent, parentHash, exp);
+            const childResult = await this.resolveScore(proposed, childHash, exp);
+            if (parentResult.used === 'judge')
+                judgeCalls++;
+            if (childResult.used === 'judge')
+                judgeCalls++;
+            parentSum += parentResult.score;
+            childSum += childResult.score;
+            perExample.push({
+                experienceId: exp.id,
+                parentScore: parentResult.score,
+                childScore: childResult.score,
+            });
+        }
+        if (minibatch.length < this.config.minMinibatchSize) {
+            // Sparse signal — auto-accept with note. Still record the cache
+            // entries we picked up along the way.
+            await this.commit(parent, proposed);
+            return {
+                accepted: true,
+                reason: 'sparse-minibatch',
+                parentSum,
+                childSum,
+                perExample,
+                judgeCalls,
+            };
+        }
+        if (childSum > parentSum) {
+            await this.commit(parent, proposed);
+            return {
+                accepted: true,
+                reason: 'improved',
+                parentSum,
+                childSum,
+                perExample,
+                judgeCalls,
+            };
+        }
+        return {
+            accepted: false,
+            reason: 'regression',
+            parentSum,
+            childSum,
+            perExample,
+            judgeCalls,
+        };
+    }
+    /**
+     * Propose a merged child from two parents. Faithful port of GEPA's
+     * `engine.py:_run_parallel_merge` + `merge.py:select_eval_subsample`:
+     *
+     *   1. Stratified sampling: pick from buckets where A beat B, where B
+     *      beat A, and where they tied (`sampleMergeMinibatch`).
+     *   2. Parent scores come from the frontier directly — those are
+     *      ground truth from past live solves, no judge call needed.
+     *   3. Child scores come from cache → judge fallback.
+     *   4. Acceptance: `child_sum >= max(parent_a_sum, parent_b_sum)`.
+     *      Stricter than the single-parent gate's `child > parent` and
+     *      symmetric across both parents — this is the rule that catches
+     *      merges that beat only the primary while regressing the secondary.
+     *
+     * **Parent ordering contract:** by convention, `parentAId` is the
+     * primary parent and `parentBId` is the secondary. Callers (typically
+     * `MergeProposer`) determine primary by signature-scoped `totalWins`
+     * and must pass them in that order. The accepted child's
+     * `parentPlaybookId` is set to `parentAId`; the gate does NOT recompute
+     * primary (a recomputation using global wins would disagree when a
+     * parent has more wins on a *different* signature).
+     *
+     * On accept: both parents' versions are snapshotted into
+     * `playbook_versions`. The secondary's lineage lives implicitly in
+     * the merged `evolution.createdFrom` produced by `mergePlaybooks`.
+     */
+    async proposeFromMerge(parentAId, parentBId, proposed, taskSignature, 
+    /**
+     * Optional RNG for the stratified minibatch sampler. Pass a
+     * deterministic source in tests; production uses Math.random.
+     */
+    rng = Math.random) {
+        const parentA = await this.library.get(parentAId);
+        const parentB = await this.library.get(parentBId);
+        if (!parentA || !parentB) {
+            return {
+                accepted: false,
+                reason: 'parent-missing',
+                parentASum: 0,
+                parentBSum: 0,
+                childSum: 0,
+                perExample: [],
+                judgeCalls: 0,
+                buckets: { aWins: 0, bWins: 0, tied: 0 },
+            };
+        }
+        const childHash = this.library.hashOf(proposed);
+        if (childHash === this.library.hashOf(parentA) || childHash === this.library.hashOf(parentB)) {
+            return {
+                accepted: false,
+                reason: 'no-mutation',
+                parentASum: 0,
+                parentBSum: 0,
+                childSum: 0,
+                perExample: [],
+                judgeCalls: 0,
+                buckets: { aWins: 0, bWins: 0, tied: 0 },
+            };
+        }
+        const sample = await this.library.sampleMergeMinibatch(parentAId, parentBId, taskSignature, this.config.minibatchSize, rng);
+        const bucketSizes = {
+            aWins: sample.buckets.aWins.length,
+            bWins: sample.buckets.bWins.length,
+            tied: sample.buckets.tied.length,
+        };
+        if (sample.experiences.length === 0) {
+            // No head-to-head data — fall back to the configured policy.
+            const policyAccept = await this.applyEmptyMinibatchPolicy([parentA, parentB], taskSignature);
+            if (policyAccept) {
+                await this.commitMerge(parentA, parentB, proposed);
+            }
+            return {
+                accepted: policyAccept,
+                reason: 'empty-minibatch',
+                parentASum: 0,
+                parentBSum: 0,
+                childSum: 0,
+                perExample: [],
+                judgeCalls: 0,
+                buckets: bucketSizes,
+            };
+        }
+        let parentASum = 0;
+        let parentBSum = 0;
+        let childSum = 0;
+        let judgeCalls = 0;
+        const perExample = [];
+        for (const exp of sample.experiences) {
+            // Parent scores are ground truth from the frontier (set by
+            // sampleMergeMinibatch, which only returns experiences where both
+            // parents scored).
+            const parentAScore = sample.parentAScoreByExp.get(exp.id);
+            const parentBScore = sample.parentBScoreByExp.get(exp.id);
+            parentASum += parentAScore;
+            parentBSum += parentBScore;
+            // Child score: cache first, then judge.
+            const childResult = await this.resolveScore(proposed, childHash, exp);
+            if (childResult.used === 'judge')
+                judgeCalls++;
+            childSum += childResult.score;
+            const bucket = parentAScore > parentBScore ? 'aWins' : parentBScore > parentAScore ? 'bWins' : 'tied';
+            perExample.push({
+                experienceId: exp.id,
+                parentAScore,
+                parentBScore,
+                childScore: childResult.score,
+                bucket,
+            });
+        }
+        if (sample.experiences.length < this.config.minMinibatchSize) {
+            await this.commitMerge(parentA, parentB, proposed);
+            return {
+                accepted: true,
+                reason: 'sparse-minibatch',
+                parentASum,
+                parentBSum,
+                childSum,
+                perExample,
+                judgeCalls,
+                buckets: bucketSizes,
+            };
+        }
+        // GEPA's `engine.py:688` acceptance rule: child must beat BOTH parents
+        // (>= max). The single-parent gate uses strict `>`; for merges we use
+        // `>=` because a merge that ties both parents is a free win — it
+        // preserves their combined wins without regressing.
+        if (childSum >= Math.max(parentASum, parentBSum)) {
+            await this.commitMerge(parentA, parentB, proposed);
+            return {
+                accepted: true,
+                reason: 'improved',
+                parentASum,
+                parentBSum,
+                childSum,
+                perExample,
+                judgeCalls,
+                buckets: bucketSizes,
+            };
+        }
+        return {
+            accepted: false,
+            reason: 'regression',
+            parentASum,
+            parentBSum,
+            childSum,
+            perExample,
+            judgeCalls,
+            buckets: bucketSizes,
+        };
+    }
+    /**
+     * Decide whether to accept under the empty-minibatch policy.
+     *
+     *   - `'accept'`: always accept (legacy behavior)
+     *   - `'reject'`: never accept
+     *   - `'gate-on-frontier'` (default): accept only if at least one
+     *     parent has any frontier presence on the given task signature.
+     *     `taskSignature` is optional (the single-parent gate allows it
+     *     to be undefined); when missing, this policy degrades to `reject`
+     *     because we have no scope to ask "is this signature active?"
+     */
+    async applyEmptyMinibatchPolicy(parents, taskSignature) {
+        switch (this.config.emptyMinibatchPolicy) {
+            case 'accept':
+                return true;
+            case 'reject':
+                return false;
+            case 'gate-on-frontier': {
+                if (!taskSignature)
+                    return false;
+                const rows = await this.library.getFrontierForSignature(taskSignature);
+                const parentIds = new Set(parents.map((p) => p.id));
+                return rows.some((r) => parentIds.has(r.playbook_id));
+            }
+        }
+    }
+    /**
+     * Get a score from cache if present; otherwise invoke the judge and
+     * write the result back to cache at `llm-judge` priority. Returns
+     * the score and a flag indicating whether it came from cache.
+     */
+    async resolveScore(playbook, hash, experience) {
+        const cached = this.persistence.getCachedEval(hash, experience.id);
+        if (cached) {
+            return { score: cached.score, used: 'cache' };
+        }
+        const verdict = await this.judge.judge(playbook, experience);
+        // Honor the judge's reported precedence (e.g. LiveReplay → 'verifier'),
+        // so a faithful rollout score isn't cached as — or overwritten by — a
+        // mere LLM-judge guess. Defaults to 'llm-judge'.
+        this.persistence.upsertEvalCache(hash, experience.id, verdict.score, verdict.priority ?? 'llm-judge', verdict.details);
+        return { score: verdict.score, used: 'judge' };
+    }
+    /**
+     * Snapshot parent version, set lineage on child, persist child.
+     */
+    async commit(parent, child) {
+        this.persistence.snapshotPlaybookVersion(parent.id, parent.evolution.version, `Pre-mutation snapshot (child: ${child.id})`);
+        child.parentPlaybookId = parent.id;
+        await this.library.add(child);
+    }
+    /**
+     * Snapshot BOTH parents, set primary lineage on child, persist child.
+     *
+     * By convention, the FIRST positional parent (`parentA`) is the primary
+     * — `proposeFromMerge` requires callers to pass parents in (primary,
+     * secondary) order. The `MergeProposer` already determines primary by
+     * signature-scoped `totalWins` and places it in `proposal.primaryParentId`,
+     * so the gate trusts that ordering rather than recomputing from
+     * signature-agnostic `getFrontierContribution` (which would disagree
+     * when a parent has more global wins on a *different* signature).
+     *
+     * The secondary parent's contribution is captured in the merged
+     * playbook's `evolution.createdFrom` (which `mergePlaybooks` populates
+     * with the union of both parents' source trajectories).
+     */
+    async commitMerge(parentA, parentB, child) {
+        this.persistence.snapshotPlaybookVersion(parentA.id, parentA.evolution.version, `Pre-merge snapshot (merged with ${parentB.id} -> ${child.id})`);
+        this.persistence.snapshotPlaybookVersion(parentB.id, parentB.evolution.version, `Pre-merge snapshot (merged with ${parentA.id} -> ${child.id})`);
+        child.parentPlaybookId = parentA.id;
+        await this.library.add(child);
+    }
+}
+export function createMutationGate(library, persistence, judge, config) {
+    return new MutationGate(library, persistence, judge, config);
+}
+//# sourceMappingURL=mutation-gate.js.map

package/dist/learning/mutation-gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mutation-gate.js","sourceRoot":"","sources":["../../src/learning/mutation-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAoCH,MAAM,QAAQ,GAAiC;IAC7C,aAAa,EAAE,CAAC;IAChB,gBAAgB,EAAE,CAAC;IACnB,oBAAoB,EAAE,kBAAkB;CACzC,CAAC;AAwEF;;GAEG;AACH,MAAM,OAAO,YAAY;IAIJ;IACA;IACA;IALX,MAAM,CAA+B;IAE7C,YACmB,OAAwB,EACxB,WAA8B,EAC9B,KAAkB,EACnC,SAA6B,EAAE;QAHd,YAAO,GAAP,OAAO,CAAiB;QACxB,gBAAW,GAAX,WAAW,CAAmB;QAC9B,UAAK,GAAL,KAAK,CAAa;QAGnC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,EAAE,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,OAAO,CACX,QAAgB,EAChB,QAAkB,EAClB,aAAsB;QAEtB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,gBAAgB;gBACxB,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,EAAE;gBACd,UAAU,EAAE,CAAC;aACd,CAAC;QACJ,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAEhD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,aAAa;gBACrB,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,EAAE;gBACd,UAAU,EAAE,CAAC;aACd,CAAC;QACJ,CAAC;QAED,iEAAiE;QACjE,yEAAyE;QACzE,mEAAmE;QACnE,sEAAsE;QACtE,0EAA0E;QAC1E,uEAAuE;QACvE,uEAAuE;QACvE,wEAAwE;QACxE,sEAAsE;QACtE,wEAAwE;QACxE,0BAA0B;QAC1B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,0BAA0B,CAC7D,QAAQ,EACR,IAAI,CAAC,MAAM,CAAC,aAAa,EACzB,aAAa;QACb,0BAA0B,CAAC,IAAI,CAChC,CAAC;QAEF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,oEAAoE;YACpE,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,yBAAyB,CAAC,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC;YACnF,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACtC,CAAC;YACD,OAAO;gBACL,QAAQ,EAAE,YAAY;gBACtB,MAAM,EAAE,iBAAiB;gBACzB,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,EAAE;gBACd,UAAU,EAAE,CAAC;aACd,CAAC;QACJ,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,UAAU,GAAwB,EAAE,CAAC;QAE3C,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;YACtE,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YAEtE,IAAI,YAAY,CAAC,IAAI,KAAK,OAAO;gBAAE,UAAU,EAAE,CAAC;YAChD,IAAI,WAAW,CAAC,IAAI,KAAK,OAAO;gBAAE,UAAU,EAAE,CAAC;YAE/C,SAAS,IAAI,YAAY,CAAC,KAAK,CAAC;YAChC,QAAQ,IAAI,WAAW,CAAC,KAAK,CAAC;YAC9B,UAAU,CAAC,IAAI,CAAC;gBACd,YAAY,EAAE,GAAG,CAAC,EAAE;gBACpB,WAAW,EAAE,YAAY,CAAC,KAAK;gBAC/B,UAAU,EAAE,WAAW,CAAC,KAAK;aAC9B,CAAC,CAAC;QACL,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;YACpD,gEAAgE;YAChE,sCAAsC;YACtC,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,kBAAkB;gBAC1B,SAAS;gBACT,QAAQ;gBACR,UAAU;gBACV,UAAU;aACX,CAAC;QACJ,CAAC;QAED,IAAI,QAAQ,GAAG,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,UAAU;gBAClB,SAAS;gBACT,QAAQ;gBACR,UAAU;gBACV,UAAU;aACX,CAAC;QACJ,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,MAAM,EAAE,YAAY;YACpB,SAAS;YACT,QAAQ;YACR,UAAU;YACV,UAAU;SACX,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,KAAK,CAAC,gBAAgB,CACpB,SAAiB,EACjB,SAAiB,EACjB,QAAkB,EAClB,aAAqB;IACrB;;;OAGG;IACH,MAAoB,IAAI,CAAC,MAAM;QAE/B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAClD,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACzB,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,gBAAgB;gBACxB,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,CAAC;gBACb,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,EAAE;gBACd,UAAU,EAAE,CAAC;gBACb,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;aACzC,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,SAAS,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,SAAS,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7F,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,aAAa;gBACrB,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,CAAC;gBACb,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,EAAE;gBACd,UAAU,EAAE,CAAC;gBACb,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;aACzC,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,oBAAoB,CACpD,SAAS,EACT,SAAS,EACT,aAAa,EACb,IAAI,CAAC,MAAM,CAAC,aAAa,EACzB,GAAG,CACJ,CAAC;QACF,MAAM,WAAW,GAAG;YAClB,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM;YAClC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM;YAClC,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM;SACjC,CAAC;QAEF,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,6DAA6D;YAC7D,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,yBAAyB,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;YAC7F,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YACrD,CAAC;YACD,OAAO;gBACL,QAAQ,EAAE,YAAY;gBACtB,MAAM,EAAE,iBAAiB;gBACzB,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,CAAC;gBACb,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,EAAE;gBACd,UAAU,EAAE,CAAC;gBACb,OAAO,EAAE,WAAW;aACrB,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,UAAU,GAAgC,EAAE,CAAC;QAEnD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;YACrC,2DAA2D;YAC3D,kEAAkE;YAClE,mBAAmB;YACnB,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC3D,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC3D,UAAU,IAAI,YAAY,CAAC;YAC3B,UAAU,IAAI,YAAY,CAAC;YAE3B,wCAAwC;YACxC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YACtE,IAAI,WAAW,CAAC,IAAI,KAAK,OAAO;gBAAE,UAAU,EAAE,CAAC;YAC/C,QAAQ,IAAI,WAAW,CAAC,KAAK,CAAC;YAE9B,MAAM,MAAM,GACV,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YACzF,UAAU,CAAC,IAAI,CAAC;gBACd,YAAY,EAAE,GAAG,CAAC,EAAE;gBACpB,YAAY;gBACZ,YAAY;gBACZ,UAAU,EAAE,WAAW,CAAC,KAAK;gBAC7B,MAAM;aACP,CAAC,CAAC;QACL,CAAC;QAED,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC7D,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YACnD,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,kBAAkB;gBAC1B,UAAU;gBACV,UAAU;gBACV,QAAQ;gBACR,UAAU;gBACV,UAAU;gBACV,OAAO,EAAE,WAAW;aACrB,CAAC;QACJ,CAAC;QAED,uEAAuE;QACvE,sEAAsE;QACtE,iEAAiE;QACjE,oDAAoD;QACpD,IAAI,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;YACjD,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;YACnD,OAAO;gBACL,QAAQ,EAAE,IAAI;gBACd,MAAM,EAAE,UAAU;gBAClB,UAAU;gBACV,UAAU;gBACV,QAAQ;gBACR,UAAU;gBACV,UAAU;gBACV,OAAO,EAAE,WAAW;aACrB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,MAAM,EAAE,YAAY;YACpB,UAAU;YACV,UAAU;YACV,QAAQ;YACR,UAAU;YACV,UAAU;YACV,OAAO,EAAE,WAAW;SACrB,CAAC;IACJ,CAAC;IAED;;;;;;;;;;OAUG;IACK,KAAK,CAAC,yBAAyB,CACrC,OAAmB,EACnB,aAAsB;QAEtB,QAAQ,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;YACzC,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC;YACd,KAAK,QAAQ;gBACX,OAAO,KAAK,CAAC;YACf,KAAK,kBAAkB,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,aAAa;oBAAE,OAAO,KAAK,CAAC;gBACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,uBAAuB,CAAC,aAAa,CAAC,CAAC;gBACvE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,YAAY,CACxB,QAAkB,EAClB,IAAY,EACZ,UAAsB;QAEtB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC;QACnE,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAChD,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC7D,wEAAwE;QACxE,sEAAsE;QACtE,iDAAiD;QACjD,IAAI,CAAC,WAAW,CAAC,eAAe,CAC9B,IAAI,EACJ,UAAU,CAAC,EAAE,EACb,OAAO,CAAC,KAAK,EACb,OAAO,CAAC,QAAQ,IAAI,WAAW,EAC/B,OAAO,CAAC,OAAO,CAChB,CAAC;QACF,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,MAAM,CAAC,MAAgB,EAAE,KAAe;QACpD,IAAI,CAAC,WAAW,CAAC,uBAAuB,CACtC,MAAM,CAAC,EAAE,EACT,MAAM,CAAC,SAAS,CAAC,OAAO,EACxB,iCAAiC,KAAK,CAAC,EAAE,GAAG,CAC7C,CAAC;QACF,KAAK,CAAC,gBAAgB,GAAG,MAAM,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,KAAK,CAAC,WAAW,CAAC,OAAiB,EAAE,OAAiB,EAAE,KAAe;QAC7E,IAAI,CAAC,WAAW,CAAC,uBAAuB,CACtC,OAAO,CAAC,EAAE,EACV,OAAO,CAAC,SAAS,CAAC,OAAO,EACzB,mCAAmC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,GAAG,CAChE,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,uBAAuB,CACtC,OAAO,CAAC,EAAE,EACV,OAAO,CAAC,SAAS,CAAC,OAAO,EACzB,mCAAmC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,GAAG,CAChE,CAAC;QAEF,KAAK,CAAC,gBAAgB,GAAG,OAAO,CAAC,EAAE,CAAC;QACpC,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;CACF;AAED,MAAM,UAAU,kBAAkB,CAChC,OAAwB,EACxB,WAA8B,EAC9B,KAAkB,EAClB,MAA2B;IAE3B,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAC/D,CAAC"}