zelari-code 2.13.0 → 2.14.0

package/dist/cli/kraken/verifierRouting.js

@@ -0,0 +1,264 @@
+/**
+ * verifierRouting — t21 (§P1.D × PW §10): risk-based cross-family verifier
+ * routing on top of the P0.6 cross-model default.
+ *
+ *   low      ⇒ reviewer OFF — deterministic verification only (strict gate).
+ *   medium   ⇒ 1 reviewer, different family, ECONOMICAL (cheapest model
+ *              within that family; no pricing API exists, so the established
+ *              cheap heuristic from krakenModel.isCheapModelId/pickCheapModel
+ *              is the "cheap" signal; unresolvable ⇒ first different-family
+ *              candidate = the current P0.6 pick).
+ *   high     ⇒ 1 reviewer, different family, STRONGEST available (same
+ *              situation: prefer non-cheap ids within that family, else the
+ *              P0.6 first different-family candidate).
+ *   critical ⇒ 2 reviewers from two DIFFERENT families (neither = builder),
+ *              merged PESSIMISTICALLY; reviewer disagreement surfaces as a
+ *              `verifier-divergence` evidence item in the proof (PW §10).
+ *
+ * Risk resolution precedence: ZELARI_VERIFY_RISK env (host override) >
+ * active TaskContract (t22 seam, setActiveContractScope) > 'medium'.
+ *
+ * ADVISORY-ONLY invariant is untouched: whatever this module routes can never
+ * rewrite the deterministic gate verdict — reviewers inform, they do not
+ * decide (ADR-0026 / CompletionPolicy locks stay the only authority).
+ */
+import { basename } from 'node:path';
+import { TASK_RISKS } from '@zelari/core';
+import { inferModelFamily, isCheapModelId, pickCheapModel, pickDifferentFamily, resolveCrossModelVerifier, } from '../tools/krakenModel.js';
+// t22 seam (required): the active contract of THIS turn carries its risk.
+import { activeContractScope } from './contractCompiler.js';
+// t29 (§16): passive reputation consult — records come from the injected
+// store snapshot (reputationStore.ts); null/empty source keeps the t21
+// behavior byte-identical. Family constraints below are NOT weakened: the
+// reputation pick only reorders WITHIN an already family-filtered pool.
+import { reputationFamilyPick } from './modelReputation.js';
+// t29: runtime reputation source. The host (graph executor) loads the
+// per-repo JSONL store and injects a snapshot; tests inject fixtures and
+// reset with setReputationSource(null).
+let reputationSource = null;
+/** Inject (or clear, with null) the reputation records routing consults. */
+export function setReputationSource(records) {
+    reputationSource = records;
+}
+/** Host override switch: wins over the task-contract risk declaration. */
+export const VERIFY_RISK_ENV = 'ZELARI_VERIFY_RISK';
+/**
+ * Active risk for the verify pass: `ZELARI_VERIFY_RISK` wins over the ACTIVE
+ * TaskContract (`contractCompiler.setActiveContractScope`, t22); absent both
+ * ⇒ 'medium' (the historical single-reviewer behavior). Invalid env values
+ * are ignored so a typo cannot silently downgrade enforcement.
+ */
+export function activeRisk(env = process.env) {
+    const raw = env[VERIFY_RISK_ENV]?.trim().toLowerCase();
+    if (raw && TASK_RISKS.includes(raw))
+        return raw;
+    return activeContractScope()?.contract.risk ?? 'medium';
+}
+/** Candidate model ids inside one family bucket, stable first-seen order. */
+function idsInFamily(family, candidates) {
+    const ids = [];
+    for (const c of candidates) {
+        if (!c.provider || !c.model)
+            continue;
+        if (inferModelFamily(c.provider, c.model) === family && !ids.includes(c.model)) {
+            ids.push(c.model);
+        }
+    }
+    return ids;
+}
+/** t29: family-pool model ids → rankable candidate objects (real provider when known). */
+function poolCandidates(pool, candidates, fallbackProvider) {
+    return pool.map((m) => candidates.find((c) => c.model === m) ?? { provider: fallbackProvider, model: m });
+}
+/**
+ * Pick within an already-selected family:
+ * - 'cheap': krakenModel.pickCheapModel (the repo's only cheap signal);
+ * - 'strong': first id NOT matching the cheap heuristic (no pricing API and
+ *   no exported strong registry exists — documented per t21 brief; degrades
+ *   to the family's stable first candidate when everything looks cheap).
+ */
+function pickWithinFamily(family, builderModel, ids, prefer) {
+    if (ids.length === 0)
+        return builderModel;
+    if (prefer === 'cheap') {
+        return pickCheapModel(builderModel, ids) ?? ids[0];
+    }
+    const strong = ids.filter((id) => !isCheapModelId(id));
+    return strong[0] ?? ids[0];
+}
+/** Critical fallback: second reviewer from another family than A's/builder. */
+function secondCrossPick(builder, firstFamily, candidates, firstIdentity) {
+    const remaining = candidates.filter((c) => inferModelFamily(c.provider, c.model) !== firstFamily);
+    const alt = pickDifferentFamilyIdentity(builder, remaining, firstIdentity);
+    return alt;
+}
+function pickDifferentFamilyIdentity(builder, candidates, avoidIdentity) {
+    const picked = pickDifferentFamily(builder, candidates);
+    if (!picked || picked.provider === '')
+        return null;
+    if (avoidIdentity &&
+        picked.provider === avoidIdentity.provider &&
+        picked.model === avoidIdentity.model) {
+        return null;
+    }
+    return { identity: picked, family: inferModelFamily(picked.provider, picked.model) };
+}
+/**
+ * Resolve the reviewer set for one advisory verify pass.
+ *
+ * Precedence mirrors the pre-t21 P0.6 resolution path: a FIXED dedicated
+ * selection IS the user-configured reviewer (kept verbatim; critical cannot
+ * conjure independence around it and degrades to a single review). Inherit
+ * mode reuses resolveCrossModelVerifier for the primary so ZELARI_KRAKEN_*
+ * semantics stay identical at every risk; strength/economy refinement applies
+ * ONLY to a successful cross-family pick — same-family fallback keeps the
+ * session identity verbatim (P0.6 parity, never a worse model than today).
+ *
+ * Degrade-and-continue: missing/incomplete candidates reduce the reviewer
+ * count (encoded in rationaleCode), never throw and never fabricate one.
+ */
+export function resolveVerifierRouting(builderIdentity, risk, opts = {}) {
+    if (risk === 'low') {
+        // PW §10: reviewer OFF — deterministic checks are the whole verdict basis.
+        return { risk, rationaleCode: 'reviewer-off-low-risk-deterministic-only', reviewers: [] };
+    }
+    const base = opts.selectionMode === 'fixed'
+        ? builderIdentity
+        : (opts.session ?? builderIdentity);
+    if (!base || !base.provider || !base.model) {
+        return { risk, rationaleCode: 'no-verifiable-identity', reviewers: [] };
+    }
+    if (opts.selectionMode === 'fixed') {
+        return {
+            risk,
+            rationaleCode: risk === 'critical' ? 'critical-fixed-single-reviewer' : 'fixed-dedicated-verifier',
+            reviewers: [{ identity: base, family: inferModelFamily(base.provider, base.model), role: 'strongest' }],
+        };
+    }
+    const candidates = (opts.familyCandidates ?? []).filter((c) => c.provider && c.model);
+    const builderFamily = inferModelFamily(base.provider, base.model);
+    const cross = resolveCrossModelVerifier(base, candidates, opts.env ?? process.env);
+    if (risk !== 'critical') {
+        if (cross && inferModelFamily(cross.provider, cross.model) !== builderFamily) {
+            const family = inferModelFamily(cross.provider, cross.model);
+            const pool = [...new Set([cross.model, ...idsInFamily(family, candidates)])];
+            const prefer = risk === 'medium' ? 'cheap' : 'strong';
+            // t29: when a trusted reputation sample exists for this (repo, verify)
+            // bucket, the pool's top-ranked identity wins — same family constraint,
+            // better in-family choice; otherwise the cheap/strong heuristic stands.
+            const repPick = reputationFamilyPick(reputationSource, poolCandidates(pool, candidates, cross.provider), opts.repo ?? basename(process.cwd()));
+            const identity = repPick ?? {
+                provider: cross.provider,
+                model: pickWithinFamily(family, cross.model, pool, prefer),
+            };
+            return {
+                risk,
+                rationaleCode: repPick
+                    ? `cross-family-${risk === 'medium' ? 'economical' : 'strongest-available'}-reputation`
+                    : risk === 'medium'
+                        ? 'cross-family-economical'
+                        : 'cross-family-strongest-available',
+                reviewers: [{ identity, family, role: risk === 'medium' ? 'economical' : 'strongest' }],
+            };
+        }
+        // No usable different-family candidate: keep the session identity verbatim.
+        return {
+            risk,
+            rationaleCode: risk === 'medium' ? 'same-family-fallback-medium' : 'same-family-fallback-high',
+            reviewers: [{ identity: base, family: builderFamily, role: risk === 'medium' ? 'economical' : 'strongest' }],
+        };
+    }
+    // critical: two independent families. First choice = strongest within the
+    // primary cross family (or session fallback when none exists).
+    let firstReviewer;
+    if (cross && inferModelFamily(cross.provider, cross.model) !== builderFamily) {
+        const family = inferModelFamily(cross.provider, cross.model);
+        const pool = [...new Set([cross.model, ...idsInFamily(family, candidates)])];
+        firstReviewer = {
+            // t29: reputation-refined within the primary family (constraint intact);
+            // falls back to the strongest heuristic when no trusted sample exists.
+            identity: reputationFamilyPick(reputationSource, poolCandidates(pool, candidates, cross.provider), opts.repo ?? basename(process.cwd())) ?? {
+                provider: cross.provider,
+                model: pickWithinFamily(family, cross.model, pool, 'strong'),
+            },
+            family,
+            role: 'strongest',
+        };
+    }
+    else {
+        firstReviewer = { identity: base, family: builderFamily, role: 'second-opinion' };
+    }
+    if (firstReviewer.family === builderFamily) {
+        // Not even one different-family candidate: single degraded review.
+        return { risk, rationaleCode: 'critical-single-same-family-degraded', reviewers: [firstReviewer] };
+    }
+    let second = secondCrossPick(base, firstReviewer.family, candidates, firstReviewer.identity);
+    let code = 'critical-dual-cross-family-pessimistic-merge';
+    if (!second) {
+        // Only one other family: take a DIFFERENT model within it (weaker but
+        // still a distinct judge); nothing left ⇒ drop the second reviewer.
+        const sameFamilyAlt = candidates.find((c) => inferModelFamily(c.provider, c.model) === firstReviewer.family &&
+            !(c.provider === firstReviewer.identity.provider && c.model === firstReviewer.identity.model));
+        second = sameFamilyAlt
+            ? { identity: { provider: sameFamilyAlt.provider, model: sameFamilyAlt.model }, family: firstReviewer.family }
+            : null;
+        if (second)
+            code = 'critical-second-reviewer-same-family';
+        else
+            return { risk, rationaleCode: 'critical-single-cross-family-degraded', reviewers: [firstReviewer] };
+    }
+    const secondRole = second.family === firstReviewer.family ? firstReviewer.role : 'second-opinion';
+    return {
+        risk,
+        rationaleCode: code,
+        reviewers: [firstReviewer, { ...second, role: secondRole }],
+    };
+}
+/** Pessimistic merge order: any blocker/fail dominates confidence. */
+const VERDICT_RANK = {
+    rejected: 2,
+    unknown: 1,
+    confirmed: 0,
+};
+/**
+ * Merge N reviews pessimistically: the WORST verdict wins (rejected beats
+ * unknown beats confirmed; earliest review wins exact ties so behavior is
+ * deterministic). The merged review is what attaches to the gate payload.
+ */
+export function mergeVerifierVerdicts(reviews) {
+    if (reviews.length === 0)
+        throw new Error('mergeVerifierVerdicts: no reviews');
+    return reviews.reduce((worst, next) => VERDICT_RANK[next.verdict] > VERDICT_RANK[worst.verdict] ? next : worst);
+}
+/** True when the two verdicts disagree (recorded as evidence, not resolved). */
+export function verdictsDiverge(reviews) {
+    return new Set(reviews.map((r) => r.verdict)).size > 1;
+}
+/**
+ * Build the `verifier-divergence` EVIDENCE item (PW §10): when two critical-
+ * risk reviewers disagree (one blocker, one pass — or any mismatch), BOTH
+ * verdicts travel side by side into the proof instead of one winning quietly.
+ * Rationale text is capped like every other proof cell. Null for <2 reviews
+ * (single-reviewer runs carry no divergence entry — payloads stay stable).
+ */
+export function divergenceFromReviews(reviews, meta) {
+    if (reviews.length < 2)
+        return null;
+    return {
+        kind: 'verifier-divergence',
+        risk: 'critical',
+        divergent: verdictsDiverge(reviews),
+        mergedVerdict: mergeVerifierVerdicts(reviews).verdict,
+        reviews: reviews.map((r, i) => ({
+            provider: r.effectiveModel.provider ?? null,
+            model: r.effectiveModel.model ?? null,
+            family: meta?.[i]?.family ?? inferModelFamily(r.effectiveModel.provider ?? '', r.effectiveModel.model ?? ''),
+            role: meta?.[i]?.role ?? 'strongest',
+            verdict: r.verdict,
+            score: r.score ?? null,
+            rationale: r.rationale?.slice(0, 500) ?? null,
+            fallback: r.fallback ?? null,
+        })),
+    };
+}
+//# sourceMappingURL=verifierRouting.js.map

package/dist/cli/kraken/verifierRouting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifierRouting.js","sourceRoot":"","sources":["../../../src/cli/kraken/verifierRouting.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,UAAU,EAAiB,MAAM,cAAc,CAAC;AAEzD,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,mBAAmB,EACnB,yBAAyB,GAC1B,MAAM,yBAAyB,CAAC;AACjC,0EAA0E;AAC1E,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,yEAAyE;AACzE,uEAAuE;AACvE,0EAA0E;AAC1E,wEAAwE;AACxE,OAAO,EAAE,oBAAoB,EAAyB,MAAM,sBAAsB,CAAC;AAKnF,sEAAsE;AACtE,yEAAyE;AACzE,wCAAwC;AACxC,IAAI,gBAAgB,GAAuC,IAAI,CAAC;AAEhE,4EAA4E;AAC5E,MAAM,UAAU,mBAAmB,CAAC,OAA2C;IAC7E,gBAAgB,GAAG,OAAO,CAAC;AAC7B,CAAC;AAED,0EAA0E;AAC1E,MAAM,CAAC,MAAM,eAAe,GAAG,oBAAoB,CAAC;AAkCpD;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,MAAW,OAAO,CAAC,GAAG;IAC/C,MAAM,GAAG,GAAG,GAAG,CAAC,eAAe,CAAC,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,IAAI,GAAG,IAAK,UAAgC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,GAAe,CAAC;IACnF,OAAO,mBAAmB,EAAE,EAAE,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC;AAC1D,CAAC;AAED,6EAA6E;AAC7E,SAAS,WAAW,CAClB,MAAc,EACd,UAA0D;IAE1D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,KAAK;YAAE,SAAS;QACtC,IAAI,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,MAAM,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0FAA0F;AAC1F,SAAS,cAAc,CACrB,IAAuB,EACvB,UAA0D,EAC1D,gBAAwB;IAExB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC5G,CAAC;AAED;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,MAAc,EAAE,YAAoB,EAAE,GAAsB,EAAE,MAA0B;IAChH,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,YAAY,CAAC;IAC1C,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;QACvB,OAAO,cAAc,CAAC,YAAY,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAE,CAAC;IACtD,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC;IACvD,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAE,CAAC;AAC9B,CAAC;AAED,+EAA+E;AAC/E,SAAS,eAAe,CACtB,OAA4C,EAC5C,WAAmB,EACnB,UAA0D,EAC1D,aAAkD;IAElD,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,CAAC;IAClG,MAAM,GAAG,GAAG,2BAA2B,CAAC,OAAO,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAC3E,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,2BAA2B,CAClC,OAA4C,EAC5C,UAA0D,EAC1D,aAAmD;IAEnD,MAAM,MAAM,GAAG,mBAAmB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IACxD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,QAAQ,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IACnD,IACE,aAAa;QACb,MAAM,CAAC,QAAQ,KAAK,aAAa,CAAC,QAAQ;QAC1C,MAAM,CAAC,KAAK,KAAK,aAAa,CAAC,KAAK,EACpC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;AACvF,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,sBAAsB,CACpC,eAA2D,EAC3D,IAAc,EACd,OAAsC,EAAE;IAExC,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;QACnB,2EAA2E;QAC3E,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,0CAA0C,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC5F,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,KAAK,OAAO;QACzC,CAAC,CAAC,eAAe;QACjB,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,eAAe,CAAC,CAAC;IACtC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3C,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,wBAAwB,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAC1E,CAAC;IACD,IAAI,IAAI,CAAC,aAAa,KAAK,OAAO,EAAE,CAAC;QACnC,OAAO;YACL,IAAI;YACJ,aAAa,EAAE,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC,0BAA0B;YAClG,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;SACxG,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;IACtF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC;IAEnF,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACxB,IAAI,KAAK,IAAI,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,aAAa,EAAE,CAAC;YAC7E,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YAC7D,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7E,MAAM,MAAM,GAAG,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;YACtD,uEAAuE;YACvE,wEAAwE;YACxE,wEAAwE;YACxE,MAAM,OAAO,GAAG,oBAAoB,CAClC,gBAAgB,EAChB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,EAChD,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CACrC,CAAC;YACF,MAAM,QAAQ,GAAG,OAAO,IAAI;gBAC1B,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,KAAK,EAAE,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC;aAC3D,CAAC;YACF,OAAO;gBACL,IAAI;gBACJ,aAAa,EAAE,OAAO;oBACpB,CAAC,CAAC,gBAAgB,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,qBAAqB,aAAa;oBACvF,CAAC,CAAC,IAAI,KAAK,QAAQ;wBACjB,CAAC,CAAC,yBAAyB;wBAC3B,CAAC,CAAC,kCAAkC;gBACxC,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;aACxF,CAAC;QACJ,CAAC;QACD,4EAA4E;QAC5E,OAAO;YACL,IAAI;YACJ,aAAa,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,6BAA6B,CAAC,CAAC,CAAC,2BAA2B;YAC9F,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SAC7G,CAAC;IACJ,CAAC;IAED,0EAA0E;IAC1E,+DAA+D;IAC/D,IAAI,aAA8B,CAAC;IACnC,IAAI,KAAK,IAAI,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,aAAa,EAAE,CAAC;QAC7E,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,aAAa,GAAG;YACd,yEAAyE;YACzE,uEAAuE;YACvE,QAAQ,EAAE,oBAAoB,CAC5B,gBAAgB,EAChB,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,EAChD,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CACrC,IAAI;gBACH,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,KAAK,EAAE,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC;aAC7D;YACD,MAAM;YACN,IAAI,EAAE,WAAW;SAClB,CAAC;IACJ,CAAC;SAAM,CAAC;QACN,aAAa,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC;IACpF,CAAC;IAED,IAAI,aAAa,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;QAC3C,mEAAmE;QACnE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,sCAAsC,EAAE,SAAS,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC;IACrG,CAAC;IACD,IAAI,MAAM,GAAG,eAAe,CAAC,IAAI,EAAE,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC7F,IAAI,IAAI,GAAG,8CAA8C,CAAC;IAC1D,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,sEAAsE;QACtE,oEAAoE;QACpE,MAAM,aAAa,GAAG,UAAU,CAAC,IAAI,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,aAAa,CAAC,MAAM;YACnE,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,QAAQ,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,CAChG,CAAC;QACF,MAAM,GAAG,aAAa;YACpB,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,EAAE;YAC9G,CAAC,CAAC,IAAI,CAAC;QACT,IAAI,MAAM;YAAE,IAAI,GAAG,sCAAsC,CAAC;;YACrD,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,uCAAuC,EAAE,SAAS,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC;IAC3G,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,KAAK,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC;IAClG,OAAO;QACL,IAAI;QACJ,aAAa,EAAE,IAAI;QACnB,SAAS,EAAE,CAAC,aAAa,EAAE,EAAE,GAAG,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;KAC5D,CAAC;AACJ,CAAC;AAED,sEAAsE;AACtE,MAAM,YAAY,GAA8C;IAC9D,QAAQ,EAAE,CAAC;IACX,OAAO,EAAE,CAAC;IACV,SAAS,EAAE,CAAC;CACb,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAkC;IACtE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IAC/E,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CACpC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CACxE,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,eAAe,CAAC,OAAkC;IAChE,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,OAAkC,EAClC,IAAoD;IAEpD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,OAAO;QACL,IAAI,EAAE,qBAAqB;QAC3B,IAAI,EAAE,UAAU;QAChB,SAAS,EAAE,eAAe,CAAC,OAAO,CAAC;QACnC,aAAa,EAAE,qBAAqB,CAAC,OAAO,CAAC,CAAC,OAAO;QACrD,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9B,QAAQ,EAAE,CAAC,CAAC,cAAc,CAAC,QAAQ,IAAI,IAAI;YAC3C,KAAK,EAAE,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI,IAAI;YACrC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,gBAAgB,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5G,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,WAAW;YACpC,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI;YACtB,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,IAAI;YAC7C,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI;SAC7B,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC"}

package/dist/cli/kraken/worktreeScheduling.js

@@ -0,0 +1,201 @@
+/**
+ * worktreeScheduling.ts — P2.C: overlap-scored worktree scheduling (pure).
+ *
+ * P2.A ownership arbitration serializes ANY overlapping pair of writers: the
+ * safe default, but it pays the full latency of the first writer before the
+ * second starts even when the overlap is thin. The executor already has the
+ * isolation machinery to do better (krakenWorktree): a tentacle can run in its
+ * own git worktree, and the executor merges worktree branches SEQUENTIALLY
+ * (Correction 4 — conflict keeps the branch, never aborts), so two writers in
+ * two worktrees can never corrupt each other mid-flight; the only cost of a
+ * parallel pair is a possibly-expensive MERGE. That reframes the admission
+ * question from "do they overlap?" (binary) to "how much do they overlap?"
+ * (graded): thin overlap → the merge is cheap, admit in parallel under
+ * isolation; near-identical scopes → the merge conflict would cost more than
+ * the serialization, keep the P2.A deferral.
+ *
+ *   - `estimateOverlapScore(aScopes, bScopes)` — the graded heuristic. Honest
+ *     about its granularity: it is a MAX over scope-glob pairs of three values
+ *     only — identical (normalized) glob → 1; anything `globsOverlap` calls
+ *     overlapping but not identical (ancestor/containment, wildcard claims,
+ *     cross-segment globs) → 0.5; disjoint → 0. It does NOT measure how many
+ *     files two globs share; it measures whether the overlap is "same claim"
+ *     (1, merge = guaranteed conflict) or "different claims that touch" (0.5,
+ *     merge = plausible conflict). A wildcard `**` scope scores 0.5 against
+ *     anything: undeclared-scope writers are the very case isolation helps,
+ *     and `OVERLAP_HIGH_THRESHOLD` is the tuning knob if a repo finds that too
+ *     brave.
+ *   - `classifyOverlap(score)` — three bands with exported, tunable consts:
+ *     score ≥ OVERLAP_HIGH_THRESHOLD (0.75) → 'high' (serialize as today);
+ *     score < OVERLAP_LOW_THRESHOLD (0.5) → 'disjoint' (arbitration never
+ *     deferred it anyway); in between → 'low' (isolate and admit). The band
+ *     that matters in practice is exactly [0.5, 0.75): a node that arbitration
+ *     deferred ALWAYS overlaps a racing writer, so its score is ≥ 0.5 — a
+ *     "low" band strictly below 0.5 would make parallel admission dead code.
+ *   - `worktreeSchedulingDecision(node, racingNodes, env)` — the pure policy
+ *     the executor consults for a deferred writer: is the env mode 'auto', is
+ *     the node worktree-capable, and is its best overlap score low enough?
+ *     Returns a mode plus the score, the rationale code and the racing node
+ *     that produced the best score (for telemetry). Reads NO process.env —
+ *     the caller passes the env slice in.
+ *   - `resolveWorktreeMode(envValue)` — the ZELARI_KRAKEN_WORKTREE value
+ *     grammar for scheduling: undefined/''/`0` → 'off', `1`/`true` → 'on',
+ *     `auto` → 'auto'; ANYTHING ELSE → 'off' (documented fallback: an
+ *     unrecognized value must never widen parallelism). Note 'yes'/'on' enable
+ *     worktree CREATION in krakenWorktree but resolve to 'off' here —
+ *     scheduling mode stays conservative for unknown values.
+ *
+ * PURE by contract: no fs, no clock, no process.env reads, no imports beyond
+ * fileOwnership (glob semantics are its, never duplicated) and ambient node
+ * types. Platform case folding is injected by the caller, like fileOwnership.
+ *
+ * @since v0.10.x — Kraken worktree scheduling (P2.C / t27)
+ */
+import { globsOverlap, normalizeGlob, writeScopeOf, } from './fileOwnership.js';
+/**
+ * Score assigned to a scope-glob pair that overlaps without being identical
+ * (containment, wildcard claims, cross-segment globs). The only non-binary
+ * rung of the heuristic — see the module doc for why.
+ */
+export const PARTIAL_OVERLAP_SCORE = 0.5;
+/**
+ * At or above this overlap score a parallel pair's merge is presumed too
+ * expensive: keep the P2.A sequential deferral. Tunable by design.
+ */
+export const OVERLAP_HIGH_THRESHOLD = 0.75;
+/**
+ * Below this score two scopes are disjoint — arbitration never deferred the
+ * pair in the first place, so the classifier reports it only for completeness.
+ * The 'low' (isolate-and-admit) band is [OVERLAP_LOW_THRESHOLD,
+ * OVERLAP_HIGH_THRESHOLD). Tunable by design.
+ */
+export const OVERLAP_LOW_THRESHOLD = 0.5;
+/**
+ * Band a 0..1 overlap score falls into: 'high' serializes (as P2.A always
+ * did), 'low' may run in parallel under worktree isolation, 'disjoint' never
+ * needed either.
+ */
+export function classifyOverlap(score) {
+    if (score >= OVERLAP_HIGH_THRESHOLD)
+        return 'high';
+    if (score < OVERLAP_LOW_THRESHOLD)
+        return 'disjoint';
+    return 'low';
+}
+/**
+ * Estimate how strongly two normalized write-scope sets overlap: 0 (disjoint)
+ * .. 1 (same claim). Max over all scope-glob pairs — one hot pair is enough to
+ * classify the whole node pair. Deterministic; identical glob pairs
+ * short-circuit to 1.
+ */
+export function estimateOverlapScore(aScopes, bScopes, opts = {}) {
+    const fold = opts.caseInsensitive ?? true;
+    // Mirror globsOverlap's folding so "identical" and "overlapping" agree on
+    // what the caller's filesystem considers the same name.
+    const norm = (g) => normalizeGlob(fold ? g.toLowerCase() : g);
+    let best = 0;
+    for (const a of aScopes) {
+        for (const b of bScopes) {
+            let score;
+            if (norm(a) === norm(b)) {
+                score = 1; // same claim: the merge would be a guaranteed conflict
+            }
+            else if (globsOverlap(a, b, fold)) {
+                score = PARTIAL_OVERLAP_SCORE; // different claims that touch
+            }
+            else {
+                score = 0;
+            }
+            if (score > best)
+                best = score;
+            if (best === 1)
+                return 1;
+        }
+    }
+    return best;
+}
+/**
+ * Kinds whose tentacle the existing worktree machinery can isolate: the
+ * `runTentacle` creation path is driven by the `general` agent kind, and the
+ * executor maps both `general` and `fix` graph nodes onto it (rework — a `fix`
+ * editing an EXISTING worktree — is excluded by the executor's rework map,
+ * which this pure module cannot see).
+ */
+export const WORKTREE_CAPABLE_KINDS = ['general', 'fix'];
+/** True when a node's kind can run inside a git worktree at all. */
+export function isWorktreeCapableKind(kind) {
+    return WORKTREE_CAPABLE_KINDS.includes(kind);
+}
+/**
+ * Resolve the ZELARI_KRAKEN_WORKTREE scheduling mode from a raw env value.
+ * `undefined`/''/`0` → 'off' (today's behavior), `1`/`true` → 'on' (always
+ * worktree, unchanged), `auto` → 'auto' (scheduler decides per overlap).
+ * Anything else → 'off': an unrecognized value must never widen parallelism.
+ */
+export function resolveWorktreeMode(envValue) {
+    const v = (envValue ?? '').trim().toLowerCase();
+    if (v === 'auto')
+        return 'auto';
+    if (v === '1' || v === 'true')
+        return 'on';
+    return 'off';
+}
+/**
+ * The P2.C admission policy for one node against the writers it would race
+ * with. Pure: the env slice is passed in, never read from process.env.
+ *
+ * `racingNodes` is the set of writers the node would run alongside — already
+ * in flight PLUS admitted this same round (from the scheduler's viewpoint
+ * both are running the moment admission returns). Only the 'auto' mode ever
+ * yields 'parallel-worktree'; 'off'/'on' modes defer defensively so a caller
+ * that skips its own mode check cannot accidentally widen parallelism.
+ *
+ * Worktree capability is checked per kind here; the caller still owns the
+ * per-node state this module cannot see (rework lineage, a caller-level
+ * `allowWorktree: false`).
+ */
+export function worktreeSchedulingDecision(node, racingNodes, env, opts = {}) {
+    if (resolveWorktreeMode(env.ZELARI_KRAKEN_WORKTREE) !== 'auto') {
+        return { mode: 'defer', overlapScore: 0, rationaleCode: 'worktree-mode-not-auto' };
+    }
+    const nodeScopes = writeScopeOf(node);
+    if (!nodeScopes) {
+        // Read-only node: arbitration never defers these anyway; say so honestly.
+        return { mode: 'defer', overlapScore: 0, rationaleCode: 'read-only-node' };
+    }
+    if (!isWorktreeCapableKind(node.kind)) {
+        return { mode: 'defer', overlapScore: 0, rationaleCode: 'kind-not-worktree-capable' };
+    }
+    let best = 0;
+    let bestMatchId;
+    for (const other of racingNodes) {
+        const otherScopes = writeScopeOf(other);
+        if (!otherScopes)
+            continue; // read-only racer: never a write conflict
+        const score = estimateOverlapScore(nodeScopes, otherScopes, opts);
+        if (score > best) {
+            best = score;
+            bestMatchId = other.id;
+        }
+        if (best === 1)
+            break;
+    }
+    if (best === 0) {
+        return { mode: 'plain-parallel', overlapScore: 0, rationaleCode: 'no-racing-overlap' };
+    }
+    if (classifyOverlap(best) === 'low') {
+        return {
+            mode: 'parallel-worktree',
+            overlapScore: best,
+            rationaleCode: 'low-overlap-worktree',
+            ...(bestMatchId !== undefined ? { bestMatchId } : {}),
+        };
+    }
+    return {
+        mode: 'defer',
+        overlapScore: best,
+        rationaleCode: 'high-overlap',
+        ...(bestMatchId !== undefined ? { bestMatchId } : {}),
+    };
+}
+//# sourceMappingURL=worktreeScheduling.js.map

package/dist/cli/kraken/worktreeScheduling.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worktreeScheduling.js","sourceRoot":"","sources":["../../../src/cli/kraken/worktreeScheduling.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AAEH,OAAO,EACL,YAAY,EACZ,aAAa,EACb,YAAY,GAGb,MAAM,oBAAoB,CAAC;AAE5B;;;;GAIG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAEzC;;;GAGG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,CAAC;AAE3C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAIzC;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,IAAI,KAAK,IAAI,sBAAsB;QAAE,OAAO,MAAM,CAAC;IACnD,IAAI,KAAK,GAAG,qBAAqB;QAAE,OAAO,UAAU,CAAC;IACrD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAClC,OAA0B,EAC1B,OAA0B,EAC1B,OAA2B,EAAE;IAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC;IAC1C,0EAA0E;IAC1E,wDAAwD;IACxD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,KAAa,CAAC;YAClB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,KAAK,GAAG,CAAC,CAAC,CAAC,uDAAuD;YACpE,CAAC;iBAAM,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;gBACpC,KAAK,GAAG,qBAAqB,CAAC,CAAC,8BAA8B;YAC/D,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,IAAI,KAAK,GAAG,IAAI;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC/B,IAAI,IAAI,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAsB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AAE5E,oEAAoE;AACpE,MAAM,UAAU,qBAAqB,CAAC,IAAY;IAChD,OAAO,sBAAsB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC/C,CAAC;AAID;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,QAA4B;IAC9D,MAAM,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAChD,IAAI,CAAC,KAAK,MAAM;QAAE,OAAO,MAAM,CAAC;IAChC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IAC3C,OAAO,KAAK,CAAC;AACf,CAAC;AAyBD;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,0BAA0B,CACxC,IAAmB,EACnB,WAAqC,EACrC,GAAsB,EACtB,OAA2B,EAAE;IAE7B,IAAI,mBAAmB,CAAC,GAAG,CAAC,sBAAsB,CAAC,KAAK,MAAM,EAAE,CAAC;QAC/D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,wBAAwB,EAAE,CAAC;IACrF,CAAC;IACD,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,0EAA0E;QAC1E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,gBAAgB,EAAE,CAAC;IAC7E,CAAC;IACD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,2BAA2B,EAAE,CAAC;IACxF,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,WAA+B,CAAC;IACpC,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,CAAC,WAAW;YAAE,SAAS,CAAC,0CAA0C;QACtE,MAAM,KAAK,GAAG,oBAAoB,CAAC,UAAU,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;QAClE,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;YACjB,IAAI,GAAG,KAAK,CAAC;YACb,WAAW,GAAG,KAAK,CAAC,EAAE,CAAC;QACzB,CAAC;QACD,IAAI,IAAI,KAAK,CAAC;YAAE,MAAM;IACxB,CAAC;IACD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,mBAAmB,EAAE,CAAC;IACzF,CAAC;IACD,IAAI,eAAe,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;QACpC,OAAO;YACL,IAAI,EAAE,mBAAmB;YACzB,YAAY,EAAE,IAAI;YAClB,aAAa,EAAE,sBAAsB;YACrC,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtD,CAAC;IACJ,CAAC;IACD,OAAO;QACL,IAAI,EAAE,OAAO;QACb,YAAY,EAAE,IAAI;QAClB,aAAa,EAAE,cAAc;QAC7B,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtD,CAAC;AACJ,CAAC"}