@miller-tech/uap 1.136.2 → 1.137.1

package/dist/self-tuning/search-reducer.d.ts

@@ -0,0 +1,76 @@
+/**
+ * LLM Self-Tuning — the Search-Space Reducer (P1): a real Gaussian-process
+ * Bayesian optimizer over the tunable-flag space.
+ *
+ * With 16 flags of mixed type the naive grid is intractable (design §3.3.3), so
+ * this module implements the three reduction techniques the design calls for as
+ * an actual GP-BO loop:
+ *   1. DEPENDENCY AWARENESS — inactive flags (whose parent gates them off) do
+ *      not contribute to the kernel distance and are never perturbed, so the
+ *      optimizer never wastes samples on a knob that has no effect.
+ *   2. BAYESIAN OPTIMIZATION — a Gaussian process with an ARD kernel over mixed
+ *      numeric (squared-exponential) + categorical (Hamming) dimensions models
+ *      the quality surface; the next point maximizes Expected Improvement.
+ *   3. TRANSFER LEARNING — prior good configs (from other models) are injected
+ *      into the candidate pool as high-value seeds.
+ *
+ * The GP math is dependency-free: standardized targets, a Cholesky solve of
+ * (K+σ²I), a small log-marginal-likelihood grid over the lengthscales, and the
+ * closed-form EI acquisition. Everything is seeded for reproducible reports.
+ */
+import { FlagConfig } from './flags.js';
+/** One observed (config, quality) datapoint the GP is conditioned on. */
+export interface Observation {
+    config: FlagConfig;
+    /** Composite quality score (0-100) measured for this config. */
+    quality: number;
+}
+/** The four search phases (design §3.3.2). Bias which flags get perturbed. */
+export type SearchPhase = 'coarse' | 'medium' | 'fine' | 'combinatorial';
+export interface SearchOptions {
+    /** RNG seed for reproducibility. Default 1. */
+    seed?: number;
+    /** Candidate pool size to score with the acquisition. Default 256. */
+    poolSize?: number;
+    /** EI exploration margin (ξ). Higher = more exploratory. Default 1.0 (std units). */
+    xi?: number;
+    /** Observation noise variance on the standardized scale. Default 0.05. */
+    noise?: number;
+    /** Prior good configs (e.g. cross-model transfer) seeded into the pool. */
+    priors?: FlagConfig[];
+    /** Search phase controlling candidate generation. Default 'combinatorial'. */
+    phase?: SearchPhase;
+    /**
+     * Cold-start anchor: the config to explore around when there are NO
+     * observations yet (nothing to fit a GP on). Lets the loop bootstrap its first
+     * proposal from the current config instead of stalling.
+     */
+    seedConfig?: FlagConfig;
+}
+export interface Suggestion {
+    config: FlagConfig;
+    /** Expected Improvement (standardized units) of this config. */
+    ei: number;
+    /** GP predictive mean quality (0-100). */
+    mean: number;
+    /** GP predictive std (0-100 scale). */
+    std: number;
+}
+/**
+ * Generate a de-duplicated candidate pool around `best`: single- and
+ * double-flag perturbations (phase-scoped) + priors + a few random configs.
+ */
+export declare function generateCandidates(best: FlagConfig, opts?: SearchOptions): FlagConfig[];
+/**
+ * The core BO step: fit a GP on `observations` and return the candidate config
+ * that maximizes Expected Improvement over the current best observed quality.
+ * With <2 observations there is nothing to model, so it returns the best
+ * single-flag neighbor deterministically (pure exploration).
+ */
+export declare function proposeNext(observations: Observation[], opts?: SearchOptions): Suggestion | null;
+/** Expose the fitted-GP prediction for callers that want the surface directly. */
+export declare function fitAndPredict(observations: Observation[], at: FlagConfig, noise?: number): {
+    mean: number;
+    std: number;
+} | null;
+//# sourceMappingURL=search-reducer.d.ts.map

package/dist/self-tuning/search-reducer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-reducer.d.ts","sourceRoot":"","sources":["../../src/self-tuning/search-reducer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAGH,OAAO,EAGL,UAAU,EAKX,MAAM,YAAY,CAAC;AAEpB,yEAAyE;AACzE,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,UAAU,CAAC;IACnB,gEAAgE;IAChE,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,8EAA8E;AAC9E,MAAM,MAAM,WAAW,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,eAAe,CAAC;AAEzE,MAAM,WAAW,aAAa;IAC5B,+CAA+C;IAC/C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,sEAAsE;IACtE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qFAAqF;IACrF,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,0EAA0E;IAC1E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2EAA2E;IAC3E,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;IACtB,8EAA8E;IAC9E,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB;;;;OAIG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;CACzB;AAED,MAAM,WAAW,UAAU;IACzB,MAAM,EAAE,UAAU,CAAC;IACnB,gEAAgE;IAChE,EAAE,EAAE,MAAM,CAAC;IACX,0CAA0C;IAC1C,IAAI,EAAE,MAAM,CAAC;IACb,uCAAuC;IACvC,GAAG,EAAE,MAAM,CAAC;CACb;AA+OD;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,UAAU,EAChB,IAAI,GAAE,aAAkB,GACvB,UAAU,EAAE,CAsDd;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,YAAY,EAAE,WAAW,EAAE,EAAE,IAAI,GAAE,aAAkB,GAAG,UAAU,GAAG,IAAI,CAsCpG;AAED,kFAAkF;AAClF,wBAAgB,aAAa,CAC3B,YAAY,EAAE,WAAW,EAAE,EAC3B,EAAE,EAAE,UAAU,EACd,KAAK,SAAO,GACX;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAItC"}

package/dist/self-tuning/search-reducer.js

@@ -0,0 +1,349 @@
+/**
+ * LLM Self-Tuning — the Search-Space Reducer (P1): a real Gaussian-process
+ * Bayesian optimizer over the tunable-flag space.
+ *
+ * With 16 flags of mixed type the naive grid is intractable (design §3.3.3), so
+ * this module implements the three reduction techniques the design calls for as
+ * an actual GP-BO loop:
+ *   1. DEPENDENCY AWARENESS — inactive flags (whose parent gates them off) do
+ *      not contribute to the kernel distance and are never perturbed, so the
+ *      optimizer never wastes samples on a knob that has no effect.
+ *   2. BAYESIAN OPTIMIZATION — a Gaussian process with an ARD kernel over mixed
+ *      numeric (squared-exponential) + categorical (Hamming) dimensions models
+ *      the quality surface; the next point maximizes Expected Improvement.
+ *   3. TRANSFER LEARNING — prior good configs (from other models) are injected
+ *      into the candidate pool as high-value seeds.
+ *
+ * The GP math is dependency-free: standardized targets, a Cholesky solve of
+ * (K+σ²I), a small log-marginal-likelihood grid over the lengthscales, and the
+ * closed-form EI acquisition. Everything is seeded for reproducible reports.
+ */
+import { mulberry32 } from '../benchmarks/paired/stats.js';
+import { TUNABLE_FLAGS, flagValue, isFlagActive, coerceToDomain, } from './flags.js';
+// ---------------------------------------------------------------------------
+// Normal helpers (erf-based CDF) for the EI closed form.
+// ---------------------------------------------------------------------------
+function erf(x) {
+    // Abramowitz & Stegun 7.1.26 — max error 1.5e-7.
+    const t = 1 / (1 + 0.3275911 * Math.abs(x));
+    const y = 1 -
+        ((((1.061405429 * t - 1.453152027) * t + 1.421413741) * t - 0.284496736) * t + 0.254829592) *
+            t *
+            Math.exp(-x * x);
+    return x >= 0 ? y : -y;
+}
+function normCdf(z) {
+    return 0.5 * (1 + erf(z / Math.SQRT2));
+}
+function normPdf(z) {
+    return Math.exp(-0.5 * z * z) / Math.sqrt(2 * Math.PI);
+}
+// ---------------------------------------------------------------------------
+// Mixed numeric/categorical ARD kernel.
+// ---------------------------------------------------------------------------
+/** Normalize a flag's value to a comparable scalar, or a categorical token. */
+function normNumeric(flag, v) {
+    const d = flag.domain;
+    if (d.kind === 'number') {
+        const n = typeof v === 'number' ? v : Number(v);
+        if (!Number.isFinite(n))
+            return 0;
+        return (Math.max(d.min, Math.min(d.max, n)) - d.min) / Math.max(1e-9, d.max - d.min);
+    }
+    // bool as 0/1
+    return v === true || v === 'true' || v === 1 ? 1 : 0;
+}
+/** k(a,b) with signal variance 1. Inactive-in-both dims contribute nothing. */
+function kernel(a, b, p) {
+    let exponent = 0;
+    for (const flag of TUNABLE_FLAGS) {
+        const activeA = isFlagActive(flag, a);
+        const activeB = isFlagActive(flag, b);
+        if (!activeA && !activeB)
+            continue; // both agree the dim is irrelevant
+        const va = flagValue(a, flag.key);
+        const vb = flagValue(b, flag.key);
+        if (flag.domain.kind === 'enum') {
+            // Categorical (Hamming): mismatch OR active-in-one-only is a full mismatch.
+            const mism = activeA !== activeB || String(va) !== String(vb) ? 1 : 0;
+            exponent += mism / (p.lenCat * p.lenCat);
+        }
+        else {
+            const ua = activeA ? normNumeric(flag, va) : normNumeric(flag, undefined);
+            const ub = activeB ? normNumeric(flag, vb) : normNumeric(flag, undefined);
+            // active-in-one-only adds a structural penalty on top of the value gap.
+            const struct = activeA !== activeB ? 0.5 : 0;
+            const diff = ua - ub;
+            exponent += (diff * diff + struct) / (p.lenNum * p.lenNum);
+        }
+    }
+    return Math.exp(-0.5 * exponent);
+}
+// ---------------------------------------------------------------------------
+// Linear algebra: Cholesky of an SPD matrix + triangular solves.
+// ---------------------------------------------------------------------------
+function cholesky(A) {
+    const n = A.length;
+    const L = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j <= i; j++) {
+            let sum = A[i][j];
+            for (let k = 0; k < j; k++)
+                sum -= L[i][k] * L[j][k];
+            if (i === j) {
+                L[i][j] = Math.sqrt(Math.max(sum, 1e-10));
+            }
+            else {
+                L[i][j] = sum / L[j][j];
+            }
+        }
+    }
+    return L;
+}
+/** Solve L y = b (forward) then Lᵀ x = y (back) for A x = b given A=LLᵀ. */
+function cholSolve(L, b) {
+    const n = L.length;
+    const y = new Array(n).fill(0);
+    for (let i = 0; i < n; i++) {
+        let s = b[i];
+        for (let k = 0; k < i; k++)
+            s -= L[i][k] * y[k];
+        y[i] = s / L[i][i];
+    }
+    const x = new Array(n).fill(0);
+    for (let i = n - 1; i >= 0; i--) {
+        let s = y[i];
+        for (let k = i + 1; k < n; k++)
+            s -= L[k][i] * x[k];
+        x[i] = s / L[i][i];
+    }
+    return x;
+}
+function buildK(configs, p, noise) {
+    const n = configs.length;
+    const K = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (let i = 0; i < n; i++) {
+        for (let j = i; j < n; j++) {
+            const k = kernel(configs[i], configs[j], p);
+            K[i][j] = k;
+            K[j][i] = k;
+        }
+        K[i][i] += noise; // jitter + observation noise on the diagonal
+    }
+    return K;
+}
+/** Log marginal likelihood (up to constants) for hyperparameter selection. */
+function logMarginalLikelihood(configs, yStd, p, noise) {
+    const K = buildK(configs, p, noise);
+    const L = cholesky(K);
+    const alpha = cholSolve(L, yStd);
+    let dataFit = 0;
+    for (let i = 0; i < yStd.length; i++)
+        dataFit += yStd[i] * alpha[i];
+    let logDet = 0;
+    for (let i = 0; i < L.length; i++)
+        logDet += Math.log(L[i][i]);
+    return -0.5 * dataFit - logDet - 0.5 * yStd.length * Math.log(2 * Math.PI);
+}
+function fitGP(obs, noise) {
+    const configs = obs.map((o) => o.config);
+    const ys = obs.map((o) => o.quality);
+    const yMean = ys.reduce((a, b) => a + b, 0) / ys.length;
+    const varY = ys.reduce((a, b) => a + (b - yMean) * (b - yMean), 0) / Math.max(1, ys.length - 1);
+    const yStd = Math.max(1e-6, Math.sqrt(varY));
+    const yz = ys.map((y) => (y - yMean) / yStd);
+    // Light hyperparameter search: pick (lenNum, lenCat) maximizing log-ML over a
+    // small grid. This is standard GP model selection, kept cheap.
+    const numGrid = [0.15, 0.3, 0.5, 0.8];
+    const catGrid = [0.5, 1.0, 2.0];
+    let best = { lenNum: 0.3, lenCat: 1.0 };
+    let bestLml = -Infinity;
+    for (const lenNum of numGrid) {
+        for (const lenCat of catGrid) {
+            const lml = logMarginalLikelihood(configs, yz, { lenNum, lenCat }, noise);
+            if (Number.isFinite(lml) && lml > bestLml) {
+                bestLml = lml;
+                best = { lenNum, lenCat };
+            }
+        }
+    }
+    const K = buildK(configs, best, noise);
+    const L = cholesky(K);
+    const alpha = cholSolve(L, yz);
+    return { L, alpha, yMean, yStd, params: best, configs, noise };
+}
+/** Predict (mean, std) in ORIGINAL quality units at a candidate config. */
+function predict(gp, x) {
+    const ks = gp.configs.map((c) => kernel(x, c, gp.params));
+    let mz = 0;
+    for (let i = 0; i < ks.length; i++)
+        mz += ks[i] * gp.alpha[i];
+    const v = cholSolve(gp.L, ks);
+    let kxx = kernel(x, x, gp.params) + gp.noise;
+    for (let i = 0; i < ks.length; i++)
+        kxx -= ks[i] * v[i];
+    const varz = Math.max(0, kxx);
+    return { mean: gp.yMean + mz * gp.yStd, std: Math.sqrt(varz) * gp.yStd };
+}
+// ---------------------------------------------------------------------------
+// Candidate generation (phase-aware, dependency-respecting).
+// ---------------------------------------------------------------------------
+function configKey(cfg) {
+    // Only active flags define identity — two configs differing solely in an
+    // inactive flag are the same point.
+    return TUNABLE_FLAGS.filter((f) => isFlagActive(f, cfg))
+        .map((f) => `${f.key}=${flagValue(cfg, f.key)}`)
+        .sort()
+        .join('|');
+}
+/** The set of flag values reachable for a numeric flag (grid over its range). */
+function numericGrid(flag) {
+    if (flag.domain.kind !== 'number')
+        return [];
+    const { min, max, step, int } = flag.domain;
+    const out = [];
+    for (let v = min; v <= max + 1e-9; v += step)
+        out.push(int ? Math.round(v) : Number(v.toFixed(6)));
+    return out.length ? out : [int ? Math.round(min) : min];
+}
+/** All alternative values for a flag (excluding its current value). */
+function alternatives(flag, current) {
+    if (flag.domain.kind === 'bool')
+        return [!(current === true)];
+    if (flag.domain.kind === 'enum')
+        return flag.domain.values.filter((v) => v !== current);
+    return numericGrid(flag).filter((v) => v !== current);
+}
+/** Which flags a phase is allowed to perturb. */
+function phaseFlags(phase, cfg) {
+    const active = TUNABLE_FLAGS.filter((f) => isFlagActive(f, cfg) || f.dependsOn.length === 0);
+    switch (phase) {
+        case 'coarse': // toggle the top-level boolean enablers only
+            return active.filter((f) => f.domain.kind === 'bool' && f.dependsOn.length === 0);
+        case 'medium': // enum choices (recipe type, intensity)
+            return active.filter((f) => f.domain.kind === 'enum');
+        case 'fine': // numeric refinement
+            return active.filter((f) => f.domain.kind === 'number');
+        case 'combinatorial':
+        default:
+            return active;
+    }
+}
+function mutate(cfg, flag, value) {
+    const next = { ...cfg };
+    const coerced = coerceToDomain(flag.key, value);
+    if (coerced !== null)
+        next[flag.key] = coerced;
+    return next;
+}
+/**
+ * Generate a de-duplicated candidate pool around `best`: single- and
+ * double-flag perturbations (phase-scoped) + priors + a few random configs.
+ */
+export function generateCandidates(best, opts = {}) {
+    const rng = mulberry32(opts.seed ?? 1);
+    const phase = opts.phase ?? 'combinatorial';
+    const poolSize = opts.poolSize ?? 256;
+    const seen = new Set([configKey(best)]);
+    const pool = [];
+    const push = (c) => {
+        const k = configKey(c);
+        if (!seen.has(k)) {
+            seen.add(k);
+            pool.push(c);
+        }
+    };
+    const flags = phaseFlags(phase, best);
+    // Priors (transfer seeds) first — highest-value candidates.
+    for (const prior of opts.priors ?? [])
+        push({ ...best, ...prior });
+    // Single-flag neighbors.
+    for (const flag of flags) {
+        for (const v of alternatives(flag, flagValue(best, flag.key))) {
+            push(mutate(best, flag, v));
+            if (pool.length >= poolSize)
+                return pool;
+        }
+    }
+    // Double-flag neighbors (combinatorial phase captures interactions).
+    if (phase === 'combinatorial') {
+        for (let i = 0; i < flags.length && pool.length < poolSize; i++) {
+            for (let j = i + 1; j < flags.length && pool.length < poolSize; j++) {
+                const av = alternatives(flags[i], flagValue(best, flags[i].key));
+                const bv = alternatives(flags[j], flagValue(best, flags[j].key));
+                if (!av.length || !bv.length)
+                    continue;
+                const a = av[(rng() * av.length) | 0];
+                const b = bv[(rng() * bv.length) | 0];
+                push(mutate(mutate(best, flags[i], a), flags[j], b));
+            }
+        }
+    }
+    // A few fully-random configs for exploration.
+    const nRandom = Math.min(32, poolSize - pool.length);
+    for (let r = 0; r < nRandom; r++) {
+        let c = { ...best };
+        for (const flag of flags) {
+            if (rng() < 0.5)
+                continue;
+            const alts = alternatives(flag, flagValue(c, flag.key));
+            if (alts.length)
+                c = mutate(c, flag, alts[(rng() * alts.length) | 0]);
+        }
+        push(c);
+    }
+    return pool;
+}
+/**
+ * The core BO step: fit a GP on `observations` and return the candidate config
+ * that maximizes Expected Improvement over the current best observed quality.
+ * With <2 observations there is nothing to model, so it returns the best
+ * single-flag neighbor deterministically (pure exploration).
+ */
+export function proposeNext(observations, opts = {}) {
+    if (observations.length === 0) {
+        // Cold start with no data: explore around the seed config if given.
+        if (!opts.seedConfig)
+            return null;
+        const cands = generateCandidates(opts.seedConfig, opts);
+        return cands.length ? { config: cands[0], ei: Number.POSITIVE_INFINITY, mean: 0, std: 0 } : null;
+    }
+    const noise = opts.noise ?? 0.05;
+    const xi = opts.xi ?? 1.0;
+    const best = observations.reduce((a, b) => (b.quality > a.quality ? b : a));
+    const candidates = generateCandidates(best.config, opts);
+    if (candidates.length === 0)
+        return null;
+    // Cold start: not enough data to condition a GP — explore the first neighbor.
+    if (observations.length < 3) {
+        const c = candidates[0];
+        return { config: c, ei: Number.POSITIVE_INFINITY, mean: best.quality, std: 0 };
+    }
+    const gp = fitGP(observations, noise);
+    const fBestZ = (best.quality - gp.yMean) / gp.yStd;
+    let bestCand = null;
+    for (const c of candidates) {
+        const { mean, std } = predict(gp, c);
+        const stdZ = std / gp.yStd;
+        let ei;
+        if (stdZ < 1e-9) {
+            ei = 0;
+        }
+        else {
+            const muZ = (mean - gp.yMean) / gp.yStd;
+            const z = (muZ - fBestZ - xi) / stdZ;
+            ei = (muZ - fBestZ - xi) * normCdf(z) + stdZ * normPdf(z);
+        }
+        if (!bestCand || ei > bestCand.ei)
+            bestCand = { config: c, ei, mean, std };
+    }
+    return bestCand;
+}
+/** Expose the fitted-GP prediction for callers that want the surface directly. */
+export function fitAndPredict(observations, at, noise = 0.05) {
+    if (observations.length < 2)
+        return null;
+    const gp = fitGP(observations, noise);
+    return predict(gp, at);
+}
+//# sourceMappingURL=search-reducer.js.map

package/dist/self-tuning/search-reducer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-reducer.js","sourceRoot":"","sources":["../../src/self-tuning/search-reducer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAC3D,OAAO,EACL,aAAa,EAIb,SAAS,EACT,YAAY,EACZ,cAAc,GACf,MAAM,YAAY,CAAC;AA2CpB,8EAA8E;AAC9E,yDAAyD;AACzD,8EAA8E;AAC9E,SAAS,GAAG,CAAC,CAAS;IACpB,iDAAiD;IACjD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,MAAM,CAAC,GACL,CAAC;QACD,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC;YACzF,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AACD,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACzC,CAAC;AACD,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;AACzD,CAAC;AAED,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAE9E,+EAA+E;AAC/E,SAAS,WAAW,CAAC,IAAiB,EAAE,CAAwB;IAC9D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QAClC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvF,CAAC;IACD,cAAc;IACd,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AASD,+EAA+E;AAC/E,SAAS,MAAM,CAAC,CAAa,EAAE,CAAa,EAAE,CAAe;IAC3D,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO;YAAE,SAAS,CAAC,mCAAmC;QACvE,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAChC,4EAA4E;YAC5E,MAAM,IAAI,GAAG,OAAO,KAAK,OAAO,IAAI,MAAM,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,QAAQ,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC1E,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC1E,wEAAwE;YACxE,MAAM,MAAM,GAAG,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;YACrB,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,iEAAiE;AACjE,8EAA8E;AAC9E,SAAS,QAAQ,CAAC,CAAa;IAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD,4EAA4E;AAC5E,SAAS,SAAS,CAAC,CAAa,EAAE,CAAW;IAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAeD,SAAS,MAAM,CAAC,OAAqB,EAAE,CAAe,EAAE,KAAa;IACnE,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,MAAM,CAAC,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACZ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;QACD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,6CAA6C;IACjE,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8EAA8E;AAC9E,SAAS,qBAAqB,CAAC,OAAqB,EAAE,IAAc,EAAE,CAAe,EAAE,KAAa;IAClG,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,OAAO,CAAC,GAAG,GAAG,OAAO,GAAG,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,KAAK,CAAC,GAAkB,EAAE,KAAa;IAC9C,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;IACxD,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAChG,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;IAE7C,8EAA8E;IAC9E,+DAA+D;IAC/D,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACtC,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,IAAI,IAAI,GAAiB,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IACtD,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;IACxB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,qBAAqB,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,CAAC;YAC1E,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;gBAC1C,OAAO,GAAG,GAAG,CAAC;gBACd,IAAI,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/B,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACjE,CAAC;AAED,2EAA2E;AAC3E,SAAS,OAAO,CAAC,EAAY,EAAE,CAAa;IAC1C,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1D,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9D,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC9B,IAAI,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC9B,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;AAC3E,CAAC;AAED,8EAA8E;AAC9E,6DAA6D;AAC7D,8EAA8E;AAC9E,SAAS,SAAS,CAAC,GAAe;IAChC,yEAAyE;IACzE,oCAAoC;IACpC,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SACrD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;SAC/C,IAAI,EAAE;SACN,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AAED,iFAAiF;AACjF,SAAS,WAAW,CAAC,IAAiB;IACpC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,EAAE,CAAC;IAC7C,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;IAC5C,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC1D,CAAC;AAED,uEAAuE;AACvE,SAAS,YAAY,CAAC,IAAiB,EAAE,OAA8B;IACrE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC;IAC9D,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC;IACxF,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC;AACxD,CAAC;AAED,iDAAiD;AACjD,SAAS,UAAU,CAAC,KAAkB,EAAE,GAAe;IACrD,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IAC7F,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,QAAQ,EAAE,6CAA6C;YAC1D,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QACpF,KAAK,QAAQ,EAAE,wCAAwC;YACrD,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;QACxD,KAAK,MAAM,EAAE,qBAAqB;YAChC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QAC1D,KAAK,eAAe,CAAC;QACrB;YACE,OAAO,MAAM,CAAC;IAClB,CAAC;AACH,CAAC;AAED,SAAS,MAAM,CAAC,GAAe,EAAE,IAAiB,EAAE,KAAgB;IAClE,MAAM,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;IACxB,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAChD,IAAI,OAAO,KAAK,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;IAC/C,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,IAAgB,EAChB,OAAsB,EAAE;IAExB,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,eAAe,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,GAAG,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,IAAI,GAAiB,EAAE,CAAC;IAC9B,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,EAAE;QAC7B,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAEtC,4DAA4D;IAC5D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;QAAE,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;IAEnE,yBAAyB;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC9D,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ;gBAAE,OAAO,IAAI,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,IAAI,KAAK,KAAK,eAAe,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAChE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpE,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjE,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjE,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,MAAM;oBAAE,SAAS;gBACvC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,GAAe,EAAE,GAAG,IAAI,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,GAAG,EAAE,GAAG,GAAG;gBAAE,SAAS;YAC1B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,IAAI,IAAI,CAAC,MAAM;gBAAE,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,CAAC;IACV,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,YAA2B,EAAE,OAAsB,EAAE;IAC/E,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,oEAAoE;QACpE,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC;QAClC,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACxD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,iBAAiB,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACnG,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;IACjC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;IAE1B,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACzD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,8EAA8E;IAC9E,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,iBAAiB,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;IACjF,CAAC;IAED,MAAM,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;IAEnD,IAAI,QAAQ,GAAsB,IAAI,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;QAC3B,IAAI,EAAU,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YAChB,EAAE,GAAG,CAAC,CAAC;QACT,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;YACxC,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;YACrC,EAAE,GAAG,CAAC,GAAG,GAAG,MAAM,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,CAAC,QAAQ,IAAI,EAAE,GAAG,QAAQ,CAAC,EAAE;YAAE,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;IAC7E,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,aAAa,CAC3B,YAA2B,EAC3B,EAAc,EACd,KAAK,GAAG,IAAI;IAEZ,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IACtC,OAAO,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACzB,CAAC"}

package/dist/self-tuning/tuning-profile.d.ts

@@ -0,0 +1,72 @@
+/**
+ * LLM Self-Tuning — model-specific tuning profiles (P1/P3).
+ *
+ * A `TuningProfile` is the best-known flag configuration for one executor model
+ * family, plus the accepted-step history that produced it. It is the durable
+ * output of the tuning loop and the prior for a fresh run on the same model.
+ * Persisted as JSON under `.uap/self-tuning/<model>.json`, mirroring the
+ * self-harness profile-snapshot pattern.
+ *
+ * Bundled starter profiles (qwen3.6, opus4.8) ship as typed constants (see
+ * ./profiles) so they are always present at runtime, and are used as the seed
+ * config + as cross-model transfer priors.
+ */
+import { FlagChange, FlagConfig } from './flags.js';
+/** One accepted (or recorded-rejected) tuning step. */
+export interface TuningRecord {
+    at: string;
+    changes: FlagChange[];
+    /** Composite quality measured for the resulting config. */
+    quality: number;
+    /** Quality delta vs the config it was compared against. */
+    delta: number;
+    accepted: boolean;
+    provenance: string;
+}
+export interface TuningProfile {
+    /** Normalized model family (see normalizeModel). */
+    model: string;
+    /** Best-known flag configuration for this model. */
+    config: FlagConfig;
+    /** Composite quality (0-100) of `config` when it was accepted. */
+    quality: number;
+    updatedAt: string;
+    provenance: string;
+    /** Append-only accepted/rejected step history. */
+    history: TuningRecord[];
+    /** Monotonic version (bumped each accepted step). */
+    version: number;
+}
+/** A fresh profile seeded from the bundled starter (or all-defaults). */
+export declare function seedProfile(model: string, now: string): TuningProfile;
+/**
+ * Look up a bundled starter config by (normalized) model family. Matches the
+ * bundled key against the normalized model so `qwen3.6-a3b-q4` → `qwen36` etc.
+ */
+export declare function getBundledProfile(model: string): FlagConfig | null;
+/**
+ * Cross-model transfer priors: the best-known configs from OTHER model families
+ * — bundled starters plus any stored profiles — used to seed the optimizer for
+ * `model` (design §3.3.3 transfer learning). A config that worked elsewhere is a
+ * high-value candidate, not a shortcut: it still goes through full validation.
+ */
+export declare function crossModelPriors(model: string, store?: TuningProfileStore): FlagConfig[];
+/** JSON-file-backed profile store, one file per model under a base dir. */
+export declare class TuningProfileStore {
+    private readonly baseDir;
+    constructor(baseDir: string);
+    /** The model families with a stored profile (basenames under the base dir). */
+    knownModels(): string[];
+    private pathFor;
+    load(model: string): TuningProfile | null;
+    /** Load the stored profile, or a fresh seeded one when none exists yet. */
+    loadOrSeed(model: string, now: string): TuningProfile;
+    save(profile: TuningProfile): void;
+}
+/**
+ * Fold an accepted step into a profile: adopt the new config, bump the version,
+ * update quality, and append the record. Rejected steps are appended to history
+ * (for learning) without changing the adopted config.
+ */
+export declare function recordStep(profile: TuningProfile, record: TuningRecord, newConfig: FlagConfig): TuningProfile;
+//# sourceMappingURL=tuning-profile.d.ts.map

package/dist/self-tuning/tuning-profile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tuning-profile.d.ts","sourceRoot":"","sources":["../../src/self-tuning/tuning-profile.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAqB,MAAM,YAAY,CAAC;AAGvE,uDAAuD;AACvD,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,oDAAoD;IACpD,KAAK,EAAE,MAAM,CAAC;IACd,oDAAoD;IACpD,MAAM,EAAE,UAAU,CAAC;IACnB,kEAAkE;IAClE,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,kDAAkD;IAClD,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,qDAAqD;IACrD,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,yEAAyE;AACzE,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,aAAa,CAYrE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAQlE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,kBAAkB,GAAG,UAAU,EAAE,CAiBxF;AAED,2EAA2E;AAC3E,qBAAa,kBAAkB;IACjB,OAAO,CAAC,QAAQ,CAAC,OAAO;gBAAP,OAAO,EAAE,MAAM;IAE5C,+EAA+E;IAC/E,WAAW,IAAI,MAAM,EAAE;IAUvB,OAAO,CAAC,OAAO;IAIf,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI;IAUzC,2EAA2E;IAC3E,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,aAAa;IAIrD,IAAI,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;CAKnC;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,GAAG,aAAa,CAa7G"}