@eir-labs/coltrane 0.4.0

package/dist/src/outputs.js

@@ -0,0 +1,452 @@
+// §6 — the universal output store + output_refs provenance graph + findings view.
+// Pure-TS (in-memory by default; optional disk-backed jsonl persistence), ledger.ts
+// style. Validation is NOT reimplemented here: write() wires registry.validate() and
+// rejects bad-schema outputs AT WRITE (T3).
+//
+// Persistence (PR #78 follow-up): when a `persistDir` is supplied, every
+// write() appends a json line to `<persistDir>/outputs/<gig_id>.jsonl` and every
+// addRef() appends to `<persistDir>/refs/<from_gig_id>.jsonl`. Reads (get / all /
+// findings / trace / refs) lazy-hydrate from disk on first access, so a fresh
+// process can serve outputs written by an earlier session. Matches the
+// append-only jsonl-chain shape used elsewhere in the audit substrate.
+import { randomUUID } from "node:crypto";
+import * as fs from "node:fs";
+import * as path from "node:path";
+import { CORE_TYPES } from "./core_types.js";
+import { validateOutput } from "./output_validation.js";
+import { outputContentHash } from "./canonical_form.js";
+// §6 output_refs.relation CHECK constraint, as a closed set.
+export const REF_RELATIONS = [
+    "derived_from",
+    "validates",
+    "challenges",
+    "refines",
+    "triggers",
+    "contains",
+];
+export class OutputStoreError extends Error {
+}
+// Default disk-persistence root, matching chain_keeper.py's ~/.eir/<chain>/ shape.
+// Resolved against COLTRANE_OUTPUTS_DIR (test override) or $HOME.
+export function defaultOutputsPersistDir() {
+    const override = process.env["COLTRANE_OUTPUTS_DIR"];
+    if (override && override.length > 0)
+        return override;
+    const home = process.env["HOME"] ?? process.env["USERPROFILE"] ?? ".";
+    return path.join(home, ".eir", "coltrane_outputs");
+}
+function ensureDir(dir) {
+    fs.mkdirSync(dir, { recursive: true });
+}
+function appendJsonl(file, row) {
+    ensureDir(path.dirname(file));
+    fs.appendFileSync(file, JSON.stringify(row) + "\n", "utf8");
+}
+function readJsonl(file, corrupt) {
+    if (!fs.existsSync(file))
+        return [];
+    const text = fs.readFileSync(file, "utf8");
+    const rows = [];
+    const lines = text.split("\n");
+    for (let i = 0; i < lines.length; i++) {
+        // `.trim()`, not `.length > 0` — a lone `\r` from a CRLF file is length 1 and would
+        // otherwise reach JSON.parse (same reasoning as FileLedger.read).
+        const line = lines[i].trim();
+        if (!line)
+            continue;
+        try {
+            rows.push(JSON.parse(line));
+        }
+        catch (e) {
+            // Still forgiving (chain_keeper.py's shape), but no longer silent (#248). Compatibility
+            // with a forgiving reader is an argument for skipping the line, never for hiding it.
+            corrupt.push({
+                path: file,
+                line_no: i + 1,
+                reason: `unparseable JSON: ${e instanceof Error ? e.message : String(e)}`,
+                preview: line.slice(0, 120),
+            });
+        }
+    }
+    return rows;
+}
+function listJsonl(dir) {
+    if (!fs.existsSync(dir))
+        return [];
+    const out = [];
+    for (const name of fs.readdirSync(dir)) {
+        if (name.endsWith(".jsonl"))
+            out.push(path.join(dir, name));
+    }
+    return out;
+}
+export function createOutputStore(registry, options) {
+    const outputs = new Map();
+    const edges = [];
+    const persistDir = options?.persistDir;
+    const outputsDir = persistDir ? path.join(persistDir, "outputs") : undefined;
+    const refsDir = persistDir ? path.join(persistDir, "refs") : undefined;
+    // Track which gig_ids we've hydrated so a single gig file is read at most once.
+    const hydratedGigs = new Set();
+    let fullyHydrated = false;
+    const fileScans = new Map();
+    const unmoved = (file, st) => {
+        const prev = fileScans.get(file);
+        return prev && prev.size === st.size && prev.mtimeMs === st.mtimeMs ? prev : undefined;
+    };
+    /**
+     * Bring the damage record for one file up to date, WITHOUT parsing out its rows.
+     *
+     * This is the whole reason `integrity()` can afford to be honest. A file whose bytes have
+     * not moved keeps its recorded verdict for the price of a `stat`; only a file that changed
+     * — or one we have never actually read, which is precisely the file this process wrote —
+     * costs a read.
+     */
+    function ensureScan(file) {
+        if (!fs.existsSync(file))
+            return undefined;
+        const st = fs.statSync(file);
+        const cached = unmoved(file, st);
+        if (cached)
+            return cached;
+        const corrupt = [];
+        readJsonl(file, corrupt);
+        const scan = { size: st.size, mtimeMs: st.mtimeMs, corrupt };
+        fileScans.set(file, scan);
+        return scan;
+    }
+    function readRows(file) {
+        if (!fs.existsSync(file))
+            return [];
+        const st = fs.statSync(file);
+        if (unmoved(file, st))
+            return readJsonl(file, []); // damage already recorded for these bytes
+        const corrupt = [];
+        const rows = readJsonl(file, corrupt);
+        fileScans.set(file, { size: st.size, mtimeMs: st.mtimeMs, corrupt });
+        return rows;
+    }
+    function asStr(v) {
+        return typeof v === "string" ? v : undefined;
+    }
+    // The registry's answer to "what core is this type, really". A bare core is itself;
+    // a registered domain type is its `extends`; anything unregistered is unresolvable.
+    // Exposed as `coreTypeOf` below AND consulted by `write` — deliberately one function,
+    // because #263 was precisely two layers disagreeing about the same question.
+    function resolveCoreType(typeSlug) {
+        if (CORE_TYPES.includes(typeSlug))
+            return typeSlug;
+        const dt = registry.listTypes().find((t) => t.slug === typeSlug);
+        return dt ? dt.extends : null;
+    }
+    function hydrateGig(gig_id) {
+        if (!outputsDir || hydratedGigs.has(gig_id))
+            return;
+        hydratedGigs.add(gig_id);
+        const file = path.join(outputsDir, `${gig_id}.jsonl`);
+        for (const rec of readRows(file)) {
+            if (!outputs.has(rec.id))
+                outputs.set(rec.id, rec);
+        }
+        if (refsDir) {
+            const refsFile = path.join(refsDir, `${gig_id}.jsonl`);
+            for (const ref of readRows(refsFile)) {
+                if (!edges.some((e) => e.id === ref.id))
+                    edges.push(ref);
+            }
+        }
+    }
+    function hydrateAll() {
+        if (!outputsDir || fullyHydrated)
+            return;
+        fullyHydrated = true;
+        for (const file of listJsonl(outputsDir)) {
+            const base = path.basename(file, ".jsonl");
+            hydrateGig(base);
+        }
+        // Also pull in any orphan refs files (defensive — addRef writes by from_gig_id).
+        if (refsDir) {
+            for (const file of listJsonl(refsDir)) {
+                for (const ref of readRows(file)) {
+                    if (!edges.some((e) => e.id === ref.id))
+                        edges.push(ref);
+                }
+            }
+        }
+    }
+    return {
+        write(o) {
+            // #263 — the asserted core must agree with the registry's answer.
+            //
+            // #227/#228 made `core_type` load-bearing: it selects which substance floor is
+            // enforced. So a caller asserting the wrong core does not merely mislabel the record —
+            // it gets the WRONG core's floor applied, and can satisfy `Verdict.checks[]` while
+            // sealing something the registry says is an Interpretation that owed `claims[]`.
+            //
+            // ORDER: this runs FIRST, ahead of the schema validation below, and that placement is
+            // load-bearing in a way the first draft of this fix got wrong. The agreement check is
+            // pure METADATA — it compares two declarations and never looks at the payload — so it
+            // does not need the schema to have passed. Running it second meant that for a CLOSED
+            // schema (the default, and what every shipped domain type uses) a payload carrying the
+            // wrong core's substance field died on Ajv first, telling the operator to delete
+            // `checks` when the actual repair is to fix the declared core. The diagnosis for a
+            // contradicted core has to come from the check that understands cores.
+            //
+            // Unresolvable slugs still fall through untouched: an unregistered domain_type is the
+            // registry's `unknown domain_type` rejection below, and this must not become a second,
+            // competing owner of that error.
+            if (o.domain_type) {
+                const registered = resolveCoreType(o.domain_type);
+                if (registered !== null && registered !== o.core_type) {
+                    throw new OutputStoreError(`output rejected: ${o.domain_type} was sealed as core_type "${o.core_type}" but the ` +
+                        `registry defines it as "${registered}" — one of the two is wrong, and the core ` +
+                        `decides which substance invariant applies`);
+                }
+            }
+            // #263 follow-on — a `core_type` that is not a core type at all.
+            //
+            // The check above only fires when a domain_type RESOLVES. With no domain_type (the
+            // freeform path, Rob #133) any string sailed through: `core_type: "Nonsense"` sealed,
+            // and so did `core_type: ""`. `validateOutput` returns valid for an unrecognised core,
+            // so those records carried NO substance floor whatsoever — the purest form of the very
+            // defect #263 describes, reachable without a registry entry at all.
+            if (!CORE_TYPES.includes(o.core_type)) {
+                throw new OutputStoreError(`output rejected: "${o.core_type}" is not a core type — expected one of ` +
+                    `[${CORE_TYPES.join(", ")}]. The core selects which substance invariant applies, ` +
+                    `so an unrecognised one silently means "no floor at all".`);
+            }
+            // T2/T3: reject bad-schema output AT WRITE by wiring the registry validator.
+            const result = registry.validate({
+                core_type: o.core_type,
+                domain_type: o.domain_type,
+                data: o.data,
+            });
+            if (!result.valid) {
+                throw new OutputStoreError(`output rejected: ${o.domain_type} failed schema validation — ${result.errors.join("; ")}`);
+            }
+            // #227/#228 — the CORE-type invariant, checked on every write regardless of whether
+            // a domain schema applied. registry.validate above returns {valid:true} without
+            // looking at the data for a bare core type and for an absent domain_type, and a
+            // subtype can overload away an inherited floor (#230) — so the substance floor an
+            // Artifact/Verdict carries by definition has to be enforced here, at the one seal
+            // boundary, not delegated to the domain schema that may not exist.
+            //
+            // validateOutput was already written and already tested; it was simply never called
+            // (#228). Path (b) per the #228 ruling: an ABSENT substance key is rejected, not just
+            // an empty one — an Artifact nobody can check is not an artifact, and a Verdict with
+            // no evidence is not a verification.
+            //
+            // Per the #227 ruling ("there's no subtype thing — it's all the way top to bottom")
+            // ALL SIX cores now carry a floor, not just Artifact and Verdict, and it applies to
+            // bare cores and domain subtypes alike. src/output_validation.ts holds the table.
+            const core = validateOutput({
+                core_type: o.core_type,
+                domain_type: o.domain_type,
+                data: o.data,
+            });
+            if (!core.valid) {
+                throw new OutputStoreError(`output rejected: ${o.domain_type || o.core_type} failed core-type invariant — ${core.reason}`);
+            }
+            const domain_type_version = o.domain_type_version ?? 1;
+            const rec = {
+                id: randomUUID(),
+                core_type: o.core_type,
+                domain_type: o.domain_type,
+                domain_type_version,
+                domain: o.domain,
+                gig_id: o.gig_id,
+                agent_slug: o.agent_slug,
+                from_role: o.from_role,
+                phase: o.phase,
+                primitive: o.primitive,
+                data: o.data,
+                content_sha: outputContentHash({
+                    core_type: o.core_type,
+                    domain_type: o.domain_type,
+                    domain_type_version,
+                    domain: o.domain,
+                    primitive: o.primitive,
+                    phase: o.phase,
+                    agent_slug: o.agent_slug,
+                    data: o.data,
+                }),
+                input_refs: o.input_refs ?? [],
+                // Real predecessor hashes (#196): prefer caller-supplied, else resolve each input_ref's
+                // content_sha from the store. The chain is then walkable input_refs[i] ↔ input_shas[i].
+                input_shas: o.input_shas ?? (o.input_refs ?? []).map((id) => outputs.get(id)?.content_sha ?? ""),
+                created_at: new Date().toISOString(),
+                cost_usd: o.cost_usd,
+                tokens_used: o.tokens_used,
+                duration_ms: o.duration_ms,
+                skill_provenance: o.skill_provenance,
+            };
+            outputs.set(rec.id, rec);
+            if (outputsDir) {
+                // Mark this gig hydrated so we don't re-read what we just wrote.
+                hydratedGigs.add(rec.gig_id);
+                appendJsonl(path.join(outputsDir, `${rec.gig_id}.jsonl`), rec);
+            }
+            return rec;
+        },
+        get(id) {
+            const hit = outputs.get(id);
+            if (hit)
+                return hit;
+            // Lazy-hydrate on miss: a fresh session reading an id from an earlier run.
+            hydrateAll();
+            return outputs.get(id);
+        },
+        all() {
+            hydrateAll();
+            return [...outputs.values()];
+        },
+        addRef(from_output_id, to_output_id, relation, primitive) {
+            if (!REF_RELATIONS.includes(relation)) {
+                throw new OutputStoreError(`invalid relation "${relation}"`);
+            }
+            // Ensure endpoints exist (possibly hydrating to find them).
+            const fromRec = outputs.get(from_output_id) ?? (hydrateAll(), outputs.get(from_output_id));
+            if (!fromRec) {
+                throw new OutputStoreError(`from_output_id "${from_output_id}" does not exist`);
+            }
+            if (!outputs.has(to_output_id)) {
+                throw new OutputStoreError(`to_output_id "${to_output_id}" does not exist`);
+            }
+            const ref = {
+                id: randomUUID(),
+                from_output_id,
+                to_output_id,
+                relation,
+                primitive,
+                created_at: new Date().toISOString(),
+            };
+            edges.push(ref);
+            if (refsDir) {
+                appendJsonl(path.join(refsDir, `${fromRec.gig_id}.jsonl`), ref);
+            }
+            return ref;
+        },
+        refs() {
+            hydrateAll();
+            return [...edges];
+        },
+        trace(id, opts) {
+            // Walk backward: a node's parents are its input_refs plus the targets of
+            // its derived_from/refines edges. Returns every reachable ancestor (the
+            // provenance closure), cycle-safe.
+            hydrateAll();
+            //
+            // max_depth: hard cap on hop count from the seed. depth=0 → no walk
+            // (returns []); depth=1 → only direct parents; etc.
+            //
+            // gig_id scope: the walk only follows into nodes that share the seed's
+            // gig_id. Cross-gig ancestors are not surfaced.
+            const maxDepth = opts?.max_depth;
+            const seed = outputs.get(id);
+            const seedGigId = seed?.gig_id;
+            const seen = new Set();
+            const order = [];
+            const stack = [{ id, depth: 0 }];
+            while (stack.length) {
+                const { id: cur, depth } = stack.pop();
+                if (seen.has(cur))
+                    continue;
+                seen.add(cur);
+                const rec = outputs.get(cur);
+                if (!rec)
+                    continue;
+                if (cur !== id) {
+                    if (seedGigId !== undefined && rec.gig_id !== seedGigId)
+                        continue;
+                    order.push(rec);
+                }
+                if (maxDepth !== undefined && depth >= maxDepth)
+                    continue;
+                for (const p of rec.input_refs)
+                    stack.push({ id: p, depth: depth + 1 });
+                for (const e of edges) {
+                    if (e.from_output_id === cur && (e.relation === "derived_from" || e.relation === "refines")) {
+                        stack.push({ id: e.to_output_id, depth: depth + 1 });
+                    }
+                }
+            }
+            return order;
+        },
+        findings() {
+            hydrateAll();
+            const rows = [];
+            for (const o of outputs.values()) {
+                if (o.domain_type !== "finding" || o.domain !== "eirtests")
+                    continue;
+                const d = o.data;
+                rows.push({
+                    id: o.id,
+                    gig_id: o.gig_id,
+                    pattern_key: asStr(d["pattern_key"]),
+                    severity: asStr(d["severity"]),
+                    title: asStr(d["title"]),
+                    evidence: asStr(d["evidence"]),
+                    location: asStr(d["location"]),
+                    recommendation: asStr(d["recommendation"]),
+                    is_novel: typeof d["is_novel"] === "boolean" ? d["is_novel"] : undefined,
+                    kpi_impacts: d["kpi_impacts"],
+                    status: asStr(d["status"]),
+                    agent_role: o.agent_slug,
+                    dimension: asStr(d["dimension"]),
+                    created_at: o.created_at,
+                });
+            }
+            return rows;
+        },
+        coreTypeOf(typeSlug) {
+            return resolveCoreType(typeSlug);
+        },
+        integrity() {
+            // Force the full hydrate first, so reads stay consistent with what we are about to
+            // report — an integrity report over a partially-hydrated store would itself be the
+            // "shorter chain reported as the whole chain" failure (#248).
+            hydrateAll();
+            // #255 round 2 — then RE-SCAN FROM DISK, every call, ignoring every hydration memo.
+            //
+            // Reporting `corruption` / `scannedFiles` was answering a different question than the
+            // one asked. Those accumulate as a side effect of READS, and two memos suppress them
+            // in exactly the cases that matter:
+            //
+            //   • `write()` adds the gig to `hydratedGigs`, so a file this process WROTE is never
+            //     read back. In production the MCP server is long-lived with a persistDir, so every
+            //     gig a process ran was exempt from the corruption scan for that process's life —
+            //     precisely the torn-append-from-a-crash case #248 exists to catch. The old code
+            //     answered `{ok:true, scanned:0}` for a directory full of its own output.
+            //   • `hydrateAll` short-circuits on `fullyHydrated`, so the SECOND system_health
+            //     re-asserted the first one's answer no matter what had happened on disk since.
+            //     CLAUDE.md tells operators to run system_health first thing in a session, which
+            //     pins that snapshot at the earliest possible moment.
+            //
+            // A damage report has to describe the bytes now, not the bytes we happened to have
+            // cached. `scanFile` re-reads a file whose (size, mtime) has moved since we last looked
+            // and stats the rest, so this is a fresh answer without being a blind full re-read.
+            //
+            // That distinction is load-bearing, not an optimisation. `system_health` is the first
+            // thing CLAUDE.md tells an operator to run, and it goes through the MCP relay — which
+            // has a known handoff race after `server_restart` (#170). Measured against the real
+            // outputs dir (4,595 files / 5.6 MB), an unconditional re-read added ~110 ms to every
+            // call and made that race fire in 1 run of 4 where clean main passed 6 of 6. A guard
+            // that destabilises the transport it reports through is not a guard worth having.
+            const corrupt = [];
+            let scanned = 0;
+            for (const dir of [outputsDir, refsDir]) {
+                if (!dir)
+                    continue;
+                for (const file of listJsonl(dir)) {
+                    const scan = ensureScan(file);
+                    if (!scan)
+                        continue;
+                    scanned++;
+                    corrupt.push(...scan.corrupt);
+                }
+            }
+            return { ok: corrupt.length === 0, scanned, corrupt };
+        },
+    };
+}
+//# sourceMappingURL=outputs.js.map

package/dist/src/outputs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"outputs.js","sourceRoot":"","sources":["../../src/outputs.ts"],"names":[],"mappings":"AAAA,kFAAkF;AAClF,oFAAoF;AACpF,qFAAqF;AACrF,4CAA4C;AAC5C,EAAE;AACF,yEAAyE;AACzE,iFAAiF;AACjF,kFAAkF;AAClF,8EAA8E;AAC9E,uEAAuE;AACvE,uEAAuE;AACvE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAElC,OAAO,EAAE,UAAU,EAAiB,MAAM,iBAAiB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD,6DAA6D;AAC7D,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,cAAc;IACd,WAAW;IACX,YAAY;IACZ,SAAS;IACT,UAAU;IACV,UAAU;CACF,CAAC;AAgGX,MAAM,OAAO,gBAAiB,SAAQ,KAAK;CAAG;AAgE9C,mFAAmF;AACnF,kEAAkE;AAClE,MAAM,UAAU,wBAAwB;IACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;IACrD,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IACrD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,GAAG,CAAC;IACtE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,SAAS,CAAC,GAAW;IAC5B,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,GAAY;IAC7C,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9B,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,SAAS,CAAI,IAAY,EAAE,OAAgC;IAClE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAQ,EAAE,CAAC;IACrB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,oFAAoF;QACpF,kEAAkE;QAClE,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAM,CAAC,CAAC;QACnC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,wFAAwF;YACxF,qFAAqF;YACrF,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,IAAI;gBACV,OAAO,EAAE,CAAC,GAAG,CAAC;gBACd,MAAM,EAAE,qBAAqB,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;gBACzE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;aAC5B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,GAAW;IAC5B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,QAAkB,EAAE,OAA4B;IAChF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;IAChD,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,CAAC;IACvC,MAAM,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7E,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEvE,gFAAgF;IAChF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,IAAI,aAAa,GAAG,KAAK,CAAC;IAiB1B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,EAAY,EAAwB,EAAE;QACnE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACzF,CAAC,CAAC;IAEF;;;;;;;OAOG;IACH,SAAS,UAAU,CAAC,IAAY;QAC9B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QAC3C,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACjC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,SAAS,CAAU,IAAI,EAAE,OAAO,CAAC,CAAC;QAClC,MAAM,IAAI,GAAa,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC;QACvE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,QAAQ,CAAI,IAAY;QAC/B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAAE,OAAO,SAAS,CAAI,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,0CAA0C;QAChG,MAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,SAAS,CAAI,IAAI,EAAE,OAAO,CAAC,CAAC;QACzC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,KAAK,CAAC,CAAU;QACvB,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IAED,oFAAoF;IACpF,oFAAoF;IACpF,sFAAsF;IACtF,6EAA6E;IAC7E,SAAS,eAAe,CAAC,QAAgB;QACvC,IAAK,UAAgC,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC1E,MAAM,EAAE,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QACjE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAChC,CAAC;IAED,SAAS,UAAU,CAAC,MAAc;QAChC,IAAI,CAAC,UAAU,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO;QACpD,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,MAAM,QAAQ,CAAC,CAAC;QACtD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAe,IAAI,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,CAAC;YACvD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAY,QAAQ,CAAC,EAAE,CAAC;gBAChD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,SAAS,UAAU;QACjB,IAAI,CAAC,UAAU,IAAI,aAAa;YAAE,OAAO;QACzC,aAAa,GAAG,IAAI,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC3C,UAAU,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QACD,iFAAiF;QACjF,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAY,IAAI,CAAC,EAAE,CAAC;oBAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,CAAC,CAAC;YACL,kEAAkE;YAClE,EAAE;YACF,+EAA+E;YAC/E,uFAAuF;YACvF,mFAAmF;YACnF,iFAAiF;YACjF,EAAE;YACF,sFAAsF;YACtF,sFAAsF;YACtF,sFAAsF;YACtF,qFAAqF;YACrF,uFAAuF;YACvF,iFAAiF;YACjF,mFAAmF;YACnF,uEAAuE;YACvE,EAAE;YACF,sFAAsF;YACtF,uFAAuF;YACvF,iCAAiC;YACjC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBAClB,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBAClD,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,KAAK,CAAC,CAAC,SAAS,EAAE,CAAC;oBACtD,MAAM,IAAI,gBAAgB,CACxB,oBAAoB,CAAC,CAAC,WAAW,6BAA6B,CAAC,CAAC,SAAS,YAAY;wBACnF,2BAA2B,UAAU,4CAA4C;wBACjF,2CAA2C,CAC9C,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,iEAAiE;YACjE,EAAE;YACF,mFAAmF;YACnF,sFAAsF;YACtF,uFAAuF;YACvF,uFAAuF;YACvF,oEAAoE;YACpE,IAAI,CAAE,UAAgC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7D,MAAM,IAAI,gBAAgB,CACxB,qBAAqB,CAAC,CAAC,SAAS,yCAAyC;oBACvE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,yDAAyD;oBAClF,0DAA0D,CAC7D,CAAC;YACJ,CAAC;YACD,6EAA6E;YAC7E,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC;gBAC/B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,IAAI,EAAE,CAAC,CAAC,IAAI;aACb,CAAC,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;gBAClB,MAAM,IAAI,gBAAgB,CACxB,oBAAoB,CAAC,CAAC,WAAW,+BAA+B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC3F,CAAC;YACJ,CAAC;YACD,oFAAoF;YACpF,gFAAgF;YAChF,gFAAgF;YAChF,kFAAkF;YAClF,kFAAkF;YAClF,mEAAmE;YACnE,EAAE;YACF,oFAAoF;YACpF,sFAAsF;YACtF,qFAAqF;YACrF,qCAAqC;YACrC,EAAE;YACF,oFAAoF;YACpF,oFAAoF;YACpF,kFAAkF;YAClF,MAAM,IAAI,GAAG,cAAc,CAAC;gBAC1B,SAAS,EAAE,CAAC,CAAC,SAAqB;gBAClC,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,IAAI,EAAE,CAAC,CAAC,IAAI;aACb,CAAC,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChB,MAAM,IAAI,gBAAgB,CACxB,oBAAoB,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,iCAAiC,IAAI,CAAC,MAAM,EAAE,CAC/F,CAAC;YACJ,CAAC;YACD,MAAM,mBAAmB,GAAG,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC;YACvD,MAAM,GAAG,GAAiB;gBACxB,EAAE,EAAE,UAAU,EAAE;gBAChB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,mBAAmB;gBACnB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,UAAU,EAAE,CAAC,CAAC,UAAU;gBACxB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,WAAW,EAAE,iBAAiB,CAAC;oBAC7B,SAAS,EAAE,CAAC,CAAC,SAAS;oBACtB,WAAW,EAAE,CAAC,CAAC,WAAW;oBAC1B,mBAAmB;oBACnB,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,SAAS,EAAE,CAAC,CAAC,SAAS;oBACtB,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,IAAI,EAAE,CAAC,CAAC,IAAI;iBACb,CAAC;gBACF,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,EAAE;gBAC9B,wFAAwF;gBACxF,wFAAwF;gBACxF,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,WAAW,IAAI,EAAE,CAAC;gBAChG,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACpC,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;aACrC,CAAC;YACF,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACzB,IAAI,UAAU,EAAE,CAAC;gBACf,iEAAiE;gBACjE,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC7B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,GAAG,CAAC,MAAM,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;YACjE,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,GAAG,CAAC,EAAE;YACJ,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,GAAG;gBAAE,OAAO,GAAG,CAAC;YACpB,2EAA2E;YAC3E,UAAU,EAAE,CAAC;YACb,OAAO,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzB,CAAC;QAED,GAAG;YACD,UAAU,EAAE,CAAC;YACb,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED,MAAM,CAAC,cAAc,EAAE,YAAY,EAAE,QAAQ,EAAE,SAAS;YACtD,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACtC,MAAM,IAAI,gBAAgB,CAAC,qBAAqB,QAAQ,GAAG,CAAC,CAAC;YAC/D,CAAC;YACD,4DAA4D;YAC5D,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,MAAM,IAAI,gBAAgB,CAAC,mBAAmB,cAAc,kBAAkB,CAAC,CAAC;YAClF,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,gBAAgB,CAAC,iBAAiB,YAAY,kBAAkB,CAAC,CAAC;YAC9E,CAAC;YACD,MAAM,GAAG,GAAc;gBACrB,EAAE,EAAE,UAAU,EAAE;gBAChB,cAAc;gBACd,YAAY;gBACZ,QAAQ;gBACR,SAAS;gBACT,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACrC,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,IAAI,OAAO,EAAE,CAAC;gBACZ,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;YAClE,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,IAAI;YACF,UAAU,EAAE,CAAC;YACb,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;QACpB,CAAC;QAED,KAAK,CAAC,EAAE,EAAE,IAAI;YACZ,yEAAyE;YACzE,wEAAwE;YACxE,mCAAmC;YACnC,UAAU,EAAE,CAAC;YACb,EAAE;YACF,oEAAoE;YACpE,oDAAoD;YACpD,EAAE;YACF,uEAAuE;YACvE,gDAAgD;YAChD,MAAM,QAAQ,GAAG,IAAI,EAAE,SAAS,CAAC;YACjC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,EAAE,MAAM,CAAC;YAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,MAAM,KAAK,GAAmB,EAAE,CAAC;YACjC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACvE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;gBACpB,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACxC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7B,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;oBACf,IAAI,SAAS,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;wBAAE,SAAS;oBAClE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;gBACD,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK,IAAI,QAAQ;oBAAE,SAAS;gBAC1D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,UAAU;oBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;oBACtB,IAAI,CAAC,CAAC,cAAc,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,KAAK,cAAc,IAAI,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,EAAE,CAAC;wBAC5F,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACvD,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,QAAQ;YACN,UAAU,EAAE,CAAC;YACb,MAAM,IAAI,GAAc,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjC,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU;oBAAE,SAAS;gBACrE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;gBACjB,IAAI,CAAC,IAAI,CAAC;oBACR,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;oBACpC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBAC9B,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;oBACxB,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBAC9B,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBAC9B,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;oBAC1C,QAAQ,EAAE,OAAO,CAAC,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC,CAAC,CAAE,CAAC,CAAC,UAAU,CAAa,CAAC,CAAC,CAAC,SAAS;oBACrF,WAAW,EAAE,CAAC,CAAC,aAAa,CAAC;oBAC7B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;oBAC1B,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;oBAChC,UAAU,EAAE,CAAC,CAAC,UAAU;iBACzB,CAAC,CAAC;YACL,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,UAAU,CAAC,QAAQ;YACjB,OAAO,eAAe,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;QAED,SAAS;YACP,mFAAmF;YACnF,mFAAmF;YACnF,8DAA8D;YAC9D,UAAU,EAAE,CAAC;YAEb,oFAAoF;YACpF,EAAE;YACF,sFAAsF;YACtF,qFAAqF;YACrF,oCAAoC;YACpC,EAAE;YACF,sFAAsF;YACtF,wFAAwF;YACxF,sFAAsF;YACtF,qFAAqF;YACrF,8EAA8E;YAC9E,kFAAkF;YAClF,oFAAoF;YACpF,qFAAqF;YACrF,0DAA0D;YAC1D,EAAE;YACF,mFAAmF;YACnF,wFAAwF;YACxF,oFAAoF;YACpF,EAAE;YACF,sFAAsF;YACtF,sFAAsF;YACtF,oFAAoF;YACpF,sFAAsF;YACtF,qFAAqF;YACrF,kFAAkF;YAClF,MAAM,OAAO,GAA4B,EAAE,CAAC;YAC5C,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;oBAC9B,IAAI,CAAC,IAAI;wBAAE,SAAS;oBACpB,OAAO,EAAE,CAAC;oBACV,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YACD,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;QACxD,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/src/overtones.d.ts

@@ -0,0 +1,42 @@
+import { type Key } from "./circle_of_fifths.js";
+/**
+ * Frequency of A4 = 440 Hz. The reference pitch for the tuning system.
+ * 12-TET (twelve-tone equal temperament) places every adjacent semitone at a
+ * frequency ratio of 2^(1/12) ≈ 1.05946.
+ */
+export declare const A4_HZ = 440;
+/** Fundamental frequency for a given key, tied to A4 = 440 Hz at octave 4. */
+export declare function fundamentalHz(k: Key): number;
+/**
+ * Overtone series for a fundamental. Returns the first N harmonics
+ * (multiples 1, 2, 3, ..., N of the fundamental frequency).
+ */
+export declare function overtoneSeries(k: Key, n?: number): readonly number[];
+/**
+ * Cents-distance between two frequencies. 100 cents = one semitone.
+ * Used to judge how close two overtones are — perceptually, within ~25 cents
+ * is heard as "the same note."
+ */
+export declare function centsDistance(hz_a: number, hz_b: number): number;
+/**
+ * How well two overtone series ALIGN. For each pair (a_i, b_j) with i,j in the
+ * first N harmonics, count the pairs that fall within tolerance_cents of each
+ * other. Returns a NUMBER (overlap count), not a verdict. Higher = more
+ * physically-resonant; lower = more dissonant.
+ *
+ * Octaves count as alignment (an octave is the same note class).
+ */
+export declare function overtoneOverlap(a: Key, b: Key, n?: number, tolerance_cents?: number): number;
+/**
+ * Consonance score between two keys, by overtone overlap.
+ * NOT a verdict — a feature for the tensor. The CALLER decides what threshold
+ * means "consonant" vs "dissonant" — different musical traditions use different
+ * thresholds (Western tonal vs jazz vs microtonal).
+ */
+export declare function overtoneConsonance(a: Key, b: Key): number;
+/**
+ * Map every key against every other key, returning a 12×12 overlap matrix.
+ * Pure data — preserved as a structure, never collapsed to "one chord is
+ * consonant" or similar.
+ */
+export declare function consonanceMatrix(): Readonly<Record<Key, Readonly<Record<Key, number>>>>;

package/dist/src/overtones.js

@@ -0,0 +1,98 @@
+// Harmonic-series overtones. Each fundamental tone carries its overtone series
+// — the integer multiples of its frequency that sound when it's played. This is
+// what makes two notes physically consonant (their overtone series align) or
+// dissonant (they don't). A SEPARATE read-channel from circle-of-fifths key-
+// topology: where the circle measures KEY relationships, overtones measure
+// FREQUENCY-resonance. Both belong in the tensor; neither collapses to scalar.
+import { KEYS } from "./circle_of_fifths.js";
+/**
+ * Frequency of A4 = 440 Hz. The reference pitch for the tuning system.
+ * 12-TET (twelve-tone equal temperament) places every adjacent semitone at a
+ * frequency ratio of 2^(1/12) ≈ 1.05946.
+ */
+export const A4_HZ = 440;
+const SEMITONE_RATIO = Math.pow(2, 1 / 12);
+// Semitone count above C for each circle-of-fifths key (octave = 0).
+// We use this to compute fundamentals: C=0, G=7, D=2, A=9, E=4, B=11, etc.
+const SEMITONES_ABOVE_C = {
+    C: 0, G: 7, D: 2, A: 9, E: 4, B: 11,
+    Gb: 6, Db: 1, Ab: 8, Eb: 3, Bb: 10, F: 5,
+};
+/** Fundamental frequency for a given key, tied to A4 = 440 Hz at octave 4. */
+export function fundamentalHz(k) {
+    const semitonesFromA4 = SEMITONES_ABOVE_C[k] - SEMITONES_ABOVE_C["A"];
+    return A4_HZ * Math.pow(SEMITONE_RATIO, semitonesFromA4);
+}
+/**
+ * Overtone series for a fundamental. Returns the first N harmonics
+ * (multiples 1, 2, 3, ..., N of the fundamental frequency).
+ */
+export function overtoneSeries(k, n = 8) {
+    if (n < 1)
+        return [];
+    const f0 = fundamentalHz(k);
+    const out = [];
+    for (let i = 1; i <= n; i++)
+        out.push(f0 * i);
+    return out;
+}
+/**
+ * Cents-distance between two frequencies. 100 cents = one semitone.
+ * Used to judge how close two overtones are — perceptually, within ~25 cents
+ * is heard as "the same note."
+ */
+export function centsDistance(hz_a, hz_b) {
+    return 1200 * Math.log2(hz_a / hz_b);
+}
+/**
+ * How well two overtone series ALIGN. For each pair (a_i, b_j) with i,j in the
+ * first N harmonics, count the pairs that fall within tolerance_cents of each
+ * other. Returns a NUMBER (overlap count), not a verdict. Higher = more
+ * physically-resonant; lower = more dissonant.
+ *
+ * Octaves count as alignment (an octave is the same note class).
+ */
+export function overtoneOverlap(a, b, n = 8, tolerance_cents = 25) {
+    const series_a = overtoneSeries(a, n);
+    const series_b = overtoneSeries(b, n);
+    let count = 0;
+    for (const fa of series_a) {
+        for (const fb of series_b) {
+            // Fold into a single octave for the comparison (overtones repeat across octaves).
+            let cents = centsDistance(fa, fb);
+            while (cents > 600)
+                cents -= 1200;
+            while (cents < -600)
+                cents += 1200;
+            if (Math.abs(cents) <= tolerance_cents)
+                count++;
+        }
+    }
+    return count;
+}
+/**
+ * Consonance score between two keys, by overtone overlap.
+ * NOT a verdict — a feature for the tensor. The CALLER decides what threshold
+ * means "consonant" vs "dissonant" — different musical traditions use different
+ * thresholds (Western tonal vs jazz vs microtonal).
+ */
+export function overtoneConsonance(a, b) {
+    return overtoneOverlap(a, b);
+}
+/**
+ * Map every key against every other key, returning a 12×12 overlap matrix.
+ * Pure data — preserved as a structure, never collapsed to "one chord is
+ * consonant" or similar.
+ */
+export function consonanceMatrix() {
+    const out = {};
+    for (const a of KEYS) {
+        const row = {};
+        for (const b of KEYS) {
+            row[b] = overtoneOverlap(a, b);
+        }
+        out[a] = row;
+    }
+    return out;
+}
+//# sourceMappingURL=overtones.js.map

package/dist/src/overtones.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"overtones.js","sourceRoot":"","sources":["../../src/overtones.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,gFAAgF;AAChF,6EAA6E;AAC7E,6EAA6E;AAC7E,2EAA2E;AAC3E,+EAA+E;AAE/E,OAAO,EAAE,IAAI,EAAY,MAAM,uBAAuB,CAAC;AAEvD;;;;GAIG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,GAAG,CAAC;AAEzB,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAE3C,qEAAqE;AACrE,2EAA2E;AAC3E,MAAM,iBAAiB,GAAkC;IACvD,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE;IACnC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;CACzC,CAAC;AAEF,8EAA8E;AAC9E,MAAM,UAAU,aAAa,CAAC,CAAM;IAClC,MAAM,eAAe,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;IACtE,OAAO,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;AAC3D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,CAAM,EAAE,IAAY,CAAC;IAClD,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IACrB,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9C,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,IAAY;IACtD,OAAO,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,CAAM,EACN,CAAM,EACN,IAAY,CAAC,EACb,kBAA0B,EAAE;IAE5B,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,kFAAkF;YAClF,IAAI,KAAK,GAAG,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,OAAO,KAAK,GAAG,GAAG;gBAAE,KAAK,IAAI,IAAI,CAAC;YAClC,OAAO,KAAK,GAAG,CAAC,GAAG;gBAAE,KAAK,IAAI,IAAI,CAAC;YACnC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,eAAe;gBAAE,KAAK,EAAE,CAAC;QAClD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAM,EAAE,CAAM;IAC/C,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB;IAC9B,MAAM,GAAG,GAA8C,EAAE,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,GAAG,GAAwB,EAAyB,CAAC;QAC3D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,GAAG,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACf,CAAC;IACD,OAAO,GAAuC,CAAC;AACjD,CAAC"}

package/dist/src/player_to_claude_code.d.ts

@@ -0,0 +1,17 @@
+export interface Player {
+    slug: string;
+    display_name: string;
+    description: string;
+    agent_profile_ref: string;
+    lane: string;
+    tools_allowlist: readonly string[];
+    charter: string;
+}
+/** Parse a player .md file body (frontmatter + body) into a Player record.
+ * Throws if required fields are missing or the frontmatter delimiters are
+ * malformed. Minimal YAML — we only support the exact shape we ship. */
+export declare function parsePlayer(fileContents: string): Player;
+/** Compile a Player into a Claude Code agent .md string.
+ * Output shape: YAML frontmatter (name, description, tools, model) + a body
+ * with the orientation line and the player's charter. */
+export declare function compilePlayerToClaudeAgent(player: Player): string;