@vessel-dsp/runtime 0.2.0

package/dist/calibrate.js

@@ -0,0 +1,420 @@
+// Runtime calibration harness: measure this host's own dense-solve cost per
+// unknown count, so the admission check in `./admission.ts` can be enforced.
+//
+// Method (the whole measurement, stated once so a reader can audit it).
+// For each system size, in ascending order:
+//  1. Call the caller-supplied factory once to prepare one workload, then run
+//     `warmupSolves` untimed solves so caches, JIT state, and branch
+//     predictors settle before any reading is taken.
+//  2. Time batches of solves. A batch starts at `solvesPerSample` solves and
+//     grows by factors of ten until the batch elapsed time is at least one
+//     hundred times the stated timer resolution, so the clock resolution is
+//     under one percent of every timed batch. Growth stops at
+//     MAX_SOLVES_PER_SAMPLE; if even that batch is unresolved, calibration
+//     refuses with `timer-too-coarse` instead of reporting a number the clock
+//     cannot support. Probe batches are discarded, never counted as samples.
+//  3. Take `samples` timed batches. Each sample is the batch elapsed time
+//     divided by the batch solve count, in nanoseconds per solve.
+//  4. Report the MEDIAN of the samples as the size's cost. Median, not mean:
+//     a single huge sample (a scheduling pause, a garbage collection, a
+//     thermal excursion) moves the mean by a large fraction and barely moves
+//     the median, and with a handful of samples the median stays
+//     representative of the sustained cost admission must budget for.
+//  5. Report spread as the interquartile range over the median
+//     (`spreadFraction = (q3 - q1) / median`, Tukey hinges: q1 is the median
+//     of the lower floor(n/2) samples, q3 the median of the upper
+//     floor(n/2)). A single sample gives spread zero.
+//  6. Enforce a monotone non-decreasing envelope across sizes: a larger
+//     system never reports cheaper than a smaller one. Correction is a
+//     running maximum over ascending sizes (each size is raised to the
+//     largest median seen so far, never lowered), and every correction is
+//     listed in `corrections` with both the measured and the reported
+//     figure, so no adjustment is silent.
+//
+// The `nsPerSolve` curve interpolates log-log between measured sizes,
+// clamps below the smallest measured size (a tiny system is charged at the
+// smallest measured cost, which is conservative), and extrapolates beyond
+// the largest measured size with one fitted exponent: the least-squares
+// slope of log cost on log size over the whole corrected table, anchored at
+// the largest measured point so the curve is continuous there. A
+// single-size table is constant everywhere. Non-positive or non-finite
+// counts throw a RangeError.
+//
+// This module is ENGINE-AGNOSTIC. The caller passes the thing to time (a
+// factory returning a one-solve function), so today it times a TypeScript
+// solve and later the WebAssembly console. It invents no engine numbers:
+// every nanosecond in the table was read off the injected clock.
+//
+// Clocks. `now` returns NANOSECONDS. The default wraps `performance.now`
+// (which reports milliseconds) with the millisecond-to-nanosecond factor.
+// `minTimerResolutionNs` is the smallest difference the clock can honestly
+// report; the batch-growth loop enforces the one-percent rule against it.
+/** Sizes measured when the caller states none. */
+export const DEFAULT_CALIBRATION_SIZES = [2, 4, 8, 16, 32, 64];
+/** Batches never grow past this many solves; beyond it the clock is refused. */
+const MAX_SOLVES_PER_SAMPLE = 1_000_000;
+/** A timed batch must last at least this many times the stated resolution. */
+const BATCH_RESOLUTION_MARGIN = 100;
+/** Default assumed resolution of a `performance.now`-derived clock. */
+const DEFAULT_TIMER_RESOLUTION_NS = 1000;
+function defaultNowNs() {
+    return performance.now() * 1e6;
+}
+function isPositiveInt(value) {
+    return Number.isInteger(value) && value > 0;
+}
+function medianOfSorted(sorted) {
+    const n = sorted.length;
+    const mid = Math.floor(n / 2);
+    if (n % 2 === 1) {
+        return sorted[mid];
+    }
+    return (sorted[mid - 1] + sorted[mid]) / 2;
+}
+/** Least-squares slope of log(cost) on log(size); 0 when no slope exists. */
+function fitLogLogExponent(points) {
+    const usable = points.filter((p) => p.unknownCount > 0 && p.costNs > 0);
+    if (usable.length < 2) {
+        return 0;
+    }
+    let sumX = 0;
+    let sumY = 0;
+    let sumXX = 0;
+    let sumXY = 0;
+    for (const p of usable) {
+        const x = Math.log(p.unknownCount);
+        const y = Math.log(p.costNs);
+        sumX += x;
+        sumY += y;
+        sumXX += x * x;
+        sumXY += x * y;
+    }
+    const m = usable.length;
+    const denominator = m * sumXX - sumX * sumX;
+    if (denominator === 0 || !Number.isFinite(denominator)) {
+        return 0;
+    }
+    const slope = (m * sumXY - sumX * sumY) / denominator;
+    return Number.isFinite(slope) ? slope : 0;
+}
+function buildNsPerSolve(rows) {
+    const bySize = new Map();
+    for (const row of rows) {
+        bySize.set(row.unknownCount, row.costNs);
+    }
+    const ascending = [...rows].sort((a, b) => a.unknownCount - b.unknownCount);
+    const exponent = fitLogLogExponent(ascending);
+    const smallest = ascending[0];
+    const largest = ascending[ascending.length - 1];
+    return (unknownCount) => {
+        if (!Number.isFinite(unknownCount) || unknownCount <= 0) {
+            throw new RangeError(`nsPerSolve requires a positive finite unknown count, got ${unknownCount}`);
+        }
+        const exact = bySize.get(unknownCount);
+        if (exact !== undefined) {
+            return exact;
+        }
+        if (unknownCount < smallest.unknownCount) {
+            return smallest.costNs;
+        }
+        if (ascending.length === 1) {
+            return smallest.costNs;
+        }
+        for (let i = 0; i < ascending.length - 1; i++) {
+            const lo = ascending[i];
+            const hi = ascending[i + 1];
+            if (unknownCount > lo.unknownCount && unknownCount < hi.unknownCount) {
+                const t = (Math.log(unknownCount) - Math.log(lo.unknownCount)) /
+                    (Math.log(hi.unknownCount) - Math.log(lo.unknownCount));
+                return Math.exp(Math.log(lo.costNs) + t * (Math.log(hi.costNs) - Math.log(lo.costNs)));
+            }
+        }
+        return largest.costNs * (unknownCount / largest.unknownCount) ** exponent;
+    };
+}
+/**
+ * Measure this host's dense-solve cost per unknown count. Refuses with a
+ * typed reason instead of reporting a number the inputs cannot support.
+ */
+export function calibrateNsPerSolve(options) {
+    const solve = options.solve;
+    if (typeof solve !== "function") {
+        throw new TypeError("calibrateNsPerSolve requires a solve factory");
+    }
+    const sizes = options.sizes ?? DEFAULT_CALIBRATION_SIZES;
+    if (sizes.length === 0) {
+        return { ok: false, reason: "no-sizes" };
+    }
+    for (const [index, size] of sizes.entries()) {
+        if (!isPositiveInt(size)) {
+            return { ok: false, reason: "bad-size", size, index };
+        }
+    }
+    const warmupSolves = options.warmupSolves ?? 50;
+    if (!Number.isInteger(warmupSolves) || warmupSolves < 0 || !Number.isFinite(warmupSolves)) {
+        return {
+            ok: false,
+            reason: "zero-solves",
+            field: "warmupSolves",
+            value: warmupSolves,
+        };
+    }
+    const solvesPerSample = options.solvesPerSample ?? 100;
+    if (!isPositiveInt(solvesPerSample)) {
+        return {
+            ok: false,
+            reason: "zero-solves",
+            field: "solvesPerSample",
+            value: solvesPerSample,
+        };
+    }
+    const samples = options.samples ?? 7;
+    if (!isPositiveInt(samples)) {
+        return {
+            ok: false,
+            reason: "zero-solves",
+            field: "samples",
+            value: samples,
+        };
+    }
+    const now = options.now ?? defaultNowNs;
+    const resolutionNs = options.minTimerResolutionNs ?? DEFAULT_TIMER_RESOLUTION_NS;
+    if (!Number.isFinite(resolutionNs) || resolutionNs < 0) {
+        throw new RangeError(`minTimerResolutionNs must be a finite number at least 0, got ${resolutionNs}`);
+    }
+    const requiredBatchNs = BATCH_RESOLUTION_MARGIN * resolutionNs;
+    const ordered = [...sizes].sort((a, b) => a - b);
+    const measured = [];
+    for (const unknownCount of ordered) {
+        let run;
+        try {
+            run = solve(unknownCount);
+        }
+        catch (thrown) {
+            return { ok: false, reason: "solve-threw", unknownCount, thrown };
+        }
+        if (typeof run !== "function") {
+            return {
+                ok: false,
+                reason: "solve-threw",
+                unknownCount,
+                thrown: new TypeError(`solve factory for ${unknownCount} unknowns did not return a function`),
+            };
+        }
+        try {
+            for (let i = 0; i < warmupSolves; i++) {
+                run();
+            }
+        }
+        catch (thrown) {
+            return { ok: false, reason: "solve-threw", unknownCount, thrown };
+        }
+        // Grow the batch until the clock resolves it with margin, or refuse.
+        let batch = solvesPerSample;
+        let elapsedNs = 0;
+        for (;;) {
+            let t0Ns;
+            let t1Ns;
+            try {
+                t0Ns = now();
+                for (let i = 0; i < batch; i++) {
+                    run();
+                }
+                t1Ns = now();
+            }
+            catch (thrown) {
+                return { ok: false, reason: "solve-threw", unknownCount, thrown };
+            }
+            if (!Number.isFinite(t0Ns) ||
+                !Number.isFinite(t1Ns) ||
+                !Number.isFinite(t1Ns - t0Ns) ||
+                t1Ns - t0Ns < 0) {
+                return {
+                    ok: false,
+                    reason: "non-finite-time",
+                    unknownCount,
+                    t0Ns,
+                    t1Ns,
+                };
+            }
+            elapsedNs = t1Ns - t0Ns;
+            if (elapsedNs >= requiredBatchNs) {
+                break;
+            }
+            if (batch >= MAX_SOLVES_PER_SAMPLE) {
+                return {
+                    ok: false,
+                    reason: "timer-too-coarse",
+                    unknownCount,
+                    resolutionNs,
+                    largestBatchSolves: batch,
+                    elapsedNs,
+                };
+            }
+            batch = Math.min(batch * 10, MAX_SOLVES_PER_SAMPLE);
+        }
+        const perSolve = [];
+        for (let s = 0; s < samples; s++) {
+            let t0Ns;
+            let t1Ns;
+            try {
+                t0Ns = now();
+                for (let i = 0; i < batch; i++) {
+                    run();
+                }
+                t1Ns = now();
+            }
+            catch (thrown) {
+                return { ok: false, reason: "solve-threw", unknownCount, thrown };
+            }
+            if (!Number.isFinite(t0Ns) ||
+                !Number.isFinite(t1Ns) ||
+                !Number.isFinite(t1Ns - t0Ns) ||
+                t1Ns - t0Ns < 0) {
+                return {
+                    ok: false,
+                    reason: "non-finite-time",
+                    unknownCount,
+                    t0Ns,
+                    t1Ns,
+                };
+            }
+            perSolve.push((t1Ns - t0Ns) / batch);
+        }
+        const sorted = [...perSolve].sort((a, b) => a - b);
+        const median = medianOfSorted(sorted);
+        const half = Math.floor(sorted.length / 2);
+        const q1 = medianOfSorted(sorted.slice(0, half === 0 ? 1 : half));
+        const q3 = medianOfSorted(sorted.slice(sorted.length - (half === 0 ? 1 : half)));
+        const spread = median > 0 ? (q3 - q1) / median : 0;
+        measured.push({ unknownCount, median, spread });
+    }
+    // Monotone non-decreasing envelope over ascending sizes, reporting fixes.
+    const table = [];
+    const corrections = [];
+    let ceiling = 0;
+    for (const row of measured) {
+        const corrected = Math.max(row.median, ceiling);
+        if (corrected > row.median) {
+            corrections.push({
+                unknownCount: row.unknownCount,
+                measuredNsPerSolve: row.median,
+                correctedNsPerSolve: corrected,
+            });
+        }
+        ceiling = corrected;
+        table.push({
+            unknownCount: row.unknownCount,
+            medianNsPerSolve: corrected,
+            spreadFraction: row.spread,
+            samples,
+        });
+    }
+    const nsPerSolve = buildNsPerSolve(table.map((row) => ({
+        unknownCount: row.unknownCount,
+        costNs: row.medianNsPerSolve,
+    })));
+    return {
+        ok: true,
+        table,
+        corrections,
+        nsPerSolve,
+        toRealtimeBudget: (args) => {
+            const budget = {
+                nsPerSolve,
+                nsPerMacroSample: args.nsPerMacroSample,
+            };
+            return {
+                ...budget,
+                ...(args.budgetedIterationsPerSample !== undefined
+                    ? {
+                        budgetedIterationsPerSample: args.budgetedIterationsPerSample,
+                    }
+                    : {}),
+                ...(args.cpuBudgetFraction !== undefined
+                    ? { cpuBudgetFraction: args.cpuBudgetFraction }
+                    : {}),
+            };
+        },
+    };
+}
+// Sink the timed solution checksum here so the solve loop stays observable
+// work no engine may legally skip. Module-private: it is a DCE guard, not
+// part of the interface.
+let denseSolveSink = 0;
+/**
+ * A TEST WORKLOAD for calibration, not a claim about the real engine. It
+ * performs one dense Gaussian elimination with partial pivoting on a fixed
+ * well-conditioned diagonally dominant n by n system in plain TypeScript,
+ * deterministically (same entries every call), with no allocation inside the
+ * timed function (all working buffers are preallocated by the factory).
+ * Later the same harness times the WebAssembly console instead; figures from
+ * this workload describe the TypeScript loop under the calibrating host and
+ * nothing else.
+ */
+export function denseLinearSolveWorkload(unknownCount) {
+    if (!isPositiveInt(unknownCount)) {
+        throw new RangeError(`denseLinearSolveWorkload requires a positive integer unknown count, got ${unknownCount}`);
+    }
+    const n = unknownCount;
+    const base = new Float64Array(n * n);
+    const rhs = new Float64Array(n);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+            // Diagonal 2n dominates the harmonic off-diagonal tail, so the
+            // system is strictly diagonally dominant and well-conditioned.
+            base[i * n + j] = i === j ? 2 * n : 1 / (1 + Math.abs(i - j));
+        }
+        rhs[i] = 1 + (i % 7);
+    }
+    const lu = new Float64Array(n * n);
+    const x = new Float64Array(n);
+    return () => {
+        lu.set(base);
+        x.set(rhs);
+        for (let col = 0; col < n; col++) {
+            let pivot = col;
+            let best = Math.abs(lu[col * n + col]);
+            for (let row = col + 1; row < n; row++) {
+                const mag = Math.abs(lu[row * n + col]);
+                if (mag > best) {
+                    best = mag;
+                    pivot = row;
+                }
+            }
+            if (pivot !== col) {
+                for (let k = col; k < n; k++) {
+                    const tmp = lu[col * n + k];
+                    lu[col * n + k] = lu[pivot * n + k];
+                    lu[pivot * n + k] = tmp;
+                }
+                const tmp = x[col];
+                x[col] = x[pivot];
+                x[pivot] = tmp;
+            }
+            const diag = lu[col * n + col];
+            for (let row = col + 1; row < n; row++) {
+                const factor = lu[row * n + col] / diag;
+                lu[row * n + col] = factor;
+                for (let k = col + 1; k < n; k++) {
+                    lu[row * n + k] =
+                        lu[row * n + k] - factor * lu[col * n + k];
+                }
+                x[row] = x[row] - factor * x[col];
+            }
+        }
+        for (let row = n - 1; row >= 0; row--) {
+            let sum = x[row];
+            for (let k = row + 1; k < n; k++) {
+                sum -= lu[row * n + k] * x[k];
+            }
+            x[row] = sum / lu[row * n + row];
+        }
+        let checksum = 0;
+        for (let i = 0; i < n; i++) {
+            checksum += x[i];
+        }
+        denseSolveSink += checksum;
+    };
+}
+//# sourceMappingURL=calibrate.js.map

package/dist/calibrate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"calibrate.js","sourceRoot":"","sources":["../src/calibrate.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,6EAA6E;AAC7E,EAAE;AACF,wEAAwE;AACxE,4CAA4C;AAC5C,8EAA8E;AAC9E,qEAAqE;AACrE,qDAAqD;AACrD,6EAA6E;AAC7E,2EAA2E;AAC3E,4EAA4E;AAC5E,8DAA8D;AAC9D,2EAA2E;AAC3E,8EAA8E;AAC9E,6EAA6E;AAC7E,0EAA0E;AAC1E,kEAAkE;AAClE,6EAA6E;AAC7E,wEAAwE;AACxE,6EAA6E;AAC7E,iEAAiE;AACjE,sEAAsE;AACtE,+DAA+D;AAC/D,6EAA6E;AAC7E,kEAAkE;AAClE,sDAAsD;AACtD,wEAAwE;AACxE,uEAAuE;AACvE,uEAAuE;AACvE,0EAA0E;AAC1E,sEAAsE;AACtE,0CAA0C;AAC1C,EAAE;AACF,sEAAsE;AACtE,2EAA2E;AAC3E,0EAA0E;AAC1E,wEAAwE;AACxE,4EAA4E;AAC5E,iEAAiE;AACjE,uEAAuE;AACvE,6BAA6B;AAC7B,EAAE;AACF,yEAAyE;AACzE,0EAA0E;AAC1E,yEAAyE;AACzE,iEAAiE;AACjE,EAAE;AACF,yEAAyE;AACzE,0EAA0E;AAC1E,2EAA2E;AAC3E,0EAA0E;AAI1E,kDAAkD;AAClD,MAAM,CAAC,MAAM,yBAAyB,GAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AAElF,gFAAgF;AAChF,MAAM,qBAAqB,GAAG,SAAS,CAAC;AAExC,8EAA8E;AAC9E,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAEpC,uEAAuE;AACvE,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAsGzC,SAAS,YAAY;IACpB,OAAO,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC;AAChC,CAAC;AAED,SAAS,aAAa,CAAC,KAAa;IACnC,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,cAAc,CAAC,MAAyB;IAChD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC,GAAG,CAAW,CAAC;IAC9B,CAAC;IACD,OAAO,CAAE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAY,GAAI,MAAM,CAAC,GAAG,CAAY,CAAC,GAAG,CAAC,CAAC;AACpE,CAAC;AAED,6EAA6E;AAC7E,SAAS,iBAAiB,CACzB,MAA2D;IAE3D,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC;IACV,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,CAAC;QACV,IAAI,IAAI,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC5C,IAAI,WAAW,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACxD,OAAO,CAAC,CAAC;IACV,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,WAAW,CAAC;IACtD,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,eAAe,CACvB,IAAyD;IAEzD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC;IAC5E,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAA6C,CAAC;IAC1E,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAG7C,CAAC;IACF,OAAO,CAAC,YAAoB,EAAU,EAAE;QACvC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,YAAY,IAAI,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,UAAU,CACnB,4DAA4D,YAAY,EAAE,CAC1E,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACvC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACd,CAAC;QACD,IAAI,YAAY,GAAG,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC1C,OAAO,QAAQ,CAAC,MAAM,CAAC;QACxB,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,QAAQ,CAAC,MAAM,CAAC;QACxB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAA6C,CAAC;YACpE,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAA6C,CAAC;YACxE,IAAI,YAAY,GAAG,EAAE,CAAC,YAAY,IAAI,YAAY,GAAG,EAAE,CAAC,YAAY,EAAE,CAAC;gBACtE,MAAM,CAAC,GACN,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC;oBACpD,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;gBACzD,OAAO,IAAI,CAAC,GAAG,CACd,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CACrE,CAAC;YACH,CAAC;QACF,CAAC;QACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,IAAI,QAAQ,CAAC;IAC3E,CAAC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAClC,OAAyB;IAEzB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,IAAI,OAAO,KAAK,KAAK,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,SAAS,CAAC,8CAA8C,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,yBAAyB,CAAC;IACzD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IAC1C,CAAC;IACD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC7C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACvD,CAAC;IACF,CAAC;IACD,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,EAAE,CAAC;IAChD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,YAAY,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC;QAC3F,OAAO;YACN,EAAE,EAAE,KAAK;YACT,MAAM,EAAE,aAAa;YACrB,KAAK,EAAE,cAAc;YACrB,KAAK,EAAE,YAAY;SACnB,CAAC;IACH,CAAC;IACD,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC;IACvD,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,EAAE,CAAC;QACrC,OAAO;YACN,EAAE,EAAE,KAAK;YACT,MAAM,EAAE,aAAa;YACrB,KAAK,EAAE,iBAAiB;YACxB,KAAK,EAAE,eAAe;SACtB,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7B,OAAO;YACN,EAAE,EAAE,KAAK;YACT,MAAM,EAAE,aAAa;YACrB,KAAK,EAAE,SAAS;YAChB,KAAK,EAAE,OAAO;SACd,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,YAAY,CAAC;IACxC,MAAM,YAAY,GAAG,OAAO,CAAC,oBAAoB,IAAI,2BAA2B,CAAC;IACjF,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,UAAU,CACnB,gEAAgE,YAAY,EAAE,CAC9E,CAAC;IACH,CAAC;IACD,MAAM,eAAe,GAAG,uBAAuB,GAAG,YAAY,CAAC;IAE/D,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,QAAQ,GAA+D,EAAE,CAAC;IAChF,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,GAAe,CAAC;QACpB,IAAI,CAAC;YACJ,GAAG,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;QAC3B,CAAC;QAAC,OAAO,MAAM,EAAE,CAAC;YACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,OAAO,GAAG,KAAK,UAAU,EAAE,CAAC;YAC/B,OAAO;gBACN,EAAE,EAAE,KAAK;gBACT,MAAM,EAAE,aAAa;gBACrB,YAAY;gBACZ,MAAM,EAAE,IAAI,SAAS,CACpB,qBAAqB,YAAY,qCAAqC,CACtE;aACD,CAAC;QACH,CAAC;QACD,IAAI,CAAC;YACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,GAAG,EAAE,CAAC;YACP,CAAC;QACF,CAAC;QAAC,OAAO,MAAM,EAAE,CAAC;YACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC;QACnE,CAAC;QACD,qEAAqE;QACrE,IAAI,KAAK,GAAG,eAAe,CAAC;QAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,SAAS,CAAC;YACT,IAAI,IAAY,CAAC;YACjB,IAAI,IAAY,CAAC;YACjB,IAAI,CAAC;gBACJ,IAAI,GAAG,GAAG,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,GAAG,EAAE,CAAC;gBACP,CAAC;gBACD,IAAI,GAAG,GAAG,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,MAAM,EAAE,CAAC;gBACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC;YACnE,CAAC;YACD,IACC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACtB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACtB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC7B,IAAI,GAAG,IAAI,GAAG,CAAC,EACd,CAAC;gBACF,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,MAAM,EAAE,iBAAiB;oBACzB,YAAY;oBACZ,IAAI;oBACJ,IAAI;iBACJ,CAAC;YACH,CAAC;YACD,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC;YACxB,IAAI,SAAS,IAAI,eAAe,EAAE,CAAC;gBAClC,MAAM;YACP,CAAC;YACD,IAAI,KAAK,IAAI,qBAAqB,EAAE,CAAC;gBACpC,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,MAAM,EAAE,kBAAkB;oBAC1B,YAAY;oBACZ,YAAY;oBACZ,kBAAkB,EAAE,KAAK;oBACzB,SAAS;iBACT,CAAC;YACH,CAAC;YACD,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,EAAE,qBAAqB,CAAC,CAAC;QACrD,CAAC;QACD,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,IAAY,CAAC;YACjB,IAAI,IAAY,CAAC;YACjB,IAAI,CAAC;gBACJ,IAAI,GAAG,GAAG,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,GAAG,EAAE,CAAC;gBACP,CAAC;gBACD,IAAI,GAAG,GAAG,EAAE,CAAC;YACd,CAAC;YAAC,OAAO,MAAM,EAAE,CAAC;gBACjB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC;YACnE,CAAC;YACD,IACC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACtB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACtB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;gBAC7B,IAAI,GAAG,IAAI,GAAG,CAAC,EACd,CAAC;gBACF,OAAO;oBACN,EAAE,EAAE,KAAK;oBACT,MAAM,EAAE,iBAAiB;oBACzB,YAAY;oBACZ,IAAI;oBACJ,IAAI;iBACJ,CAAC;YACH,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,cAAc,CACxB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CACrD,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,QAAQ,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,0EAA0E;IAC1E,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,MAAM,WAAW,GAA4B,EAAE,CAAC;IAChD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAChD,IAAI,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YAC5B,WAAW,CAAC,IAAI,CAAC;gBAChB,YAAY,EAAE,GAAG,CAAC,YAAY;gBAC9B,kBAAkB,EAAE,GAAG,CAAC,MAAM;gBAC9B,mBAAmB,EAAE,SAAS;aAC9B,CAAC,CAAC;QACJ,CAAC;QACD,OAAO,GAAG,SAAS,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC;YACV,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,gBAAgB,EAAE,SAAS;YAC3B,cAAc,EAAE,GAAG,CAAC,MAAM;YAC1B,OAAO;SACP,CAAC,CAAC;IACJ,CAAC;IACD,MAAM,UAAU,GAAG,eAAe,CACjC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACnB,YAAY,EAAE,GAAG,CAAC,YAAY;QAC9B,MAAM,EAAE,GAAG,CAAC,gBAAgB;KAC5B,CAAC,CAAC,CACH,CAAC;IACF,OAAO;QACN,EAAE,EAAE,IAAI;QACR,KAAK;QACL,WAAW;QACX,UAAU;QACV,gBAAgB,EAAE,CAAC,IAA0B,EAAkB,EAAE;YAChE,MAAM,MAAM,GAAmB;gBAC9B,UAAU;gBACV,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;aACvC,CAAC;YACF,OAAO;gBACN,GAAG,MAAM;gBACT,GAAG,CAAC,IAAI,CAAC,2BAA2B,KAAK,SAAS;oBACjD,CAAC,CAAC;wBACA,2BAA2B,EAAE,IAAI,CAAC,2BAA2B;qBAC7D;oBACF,CAAC,CAAC,EAAE,CAAC;gBACN,GAAG,CAAC,IAAI,CAAC,iBAAiB,KAAK,SAAS;oBACvC,CAAC,CAAC,EAAE,iBAAiB,EAAE,IAAI,CAAC,iBAAiB,EAAE;oBAC/C,CAAC,CAAC,EAAE,CAAC;aACN,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AAED,2EAA2E;AAC3E,0EAA0E;AAC1E,yBAAyB;AACzB,IAAI,cAAc,GAAG,CAAC,CAAC;AAEvB;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CAAC,YAAoB;IAC5D,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CACnB,2EAA2E,YAAY,EAAE,CACzF,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,YAAY,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,+DAA+D;YAC/D,+DAA+D;YAC/D,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,OAAO,GAAS,EAAE;QACjB,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACb,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAClC,IAAI,KAAK,GAAG,GAAG,CAAC;YAChB,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAW,CAAC,CAAC;YACjD,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAW,CAAC,CAAC;gBAClD,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;oBAChB,IAAI,GAAG,GAAG,CAAC;oBACX,KAAK,GAAG,GAAG,CAAC;gBACb,CAAC;YACF,CAAC;YACD,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,MAAM,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAW,CAAC;oBACtC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAW,CAAC;oBAC9C,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;gBACzB,CAAC;gBACD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAW,CAAC;gBAC7B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAW,CAAC;gBAC5B,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;YAChB,CAAC;YACD,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAW,CAAC;YACzC,KAAK,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAI,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAY,GAAG,IAAI,CAAC;gBACpD,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;gBAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAClC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;wBACb,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAY,GAAG,MAAM,GAAI,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAY,CAAC;gBACrE,CAAC;gBACD,CAAC,CAAC,GAAG,CAAC,GAAI,CAAC,CAAC,GAAG,CAAY,GAAG,MAAM,GAAI,CAAC,CAAC,GAAG,CAAY,CAAC;YAC3D,CAAC;QACF,CAAC;QACD,KAAK,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YACvC,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAW,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,GAAG,IAAK,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAY,GAAI,CAAC,CAAC,CAAC,CAAY,CAAC;YACvD,CAAC;YACD,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAI,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAY,CAAC;QAC9C,CAAC;QACD,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAW,CAAC;QAC5B,CAAC;QACD,cAAc,IAAI,QAAQ,CAAC;IAC5B,CAAC,CAAC;AACH,CAAC"}

package/dist/chain-advisories.d.ts

@@ -0,0 +1,71 @@
+import type { SlotContract } from "./chain-slot";
+/** One thing wrong with a chain, with the slots a host needs to point at. */
+export type ChainAdvisory = {
+    /**
+     * A closed code so a host can group or filter without reading the sentence.
+     *
+     * `unscalable-seam` — one side states no full scale, so the signal crosses unscaled.
+     * `speaker-signal-into-input` — a speaker terminal feeds a slot expecting instrument level.
+     * `cab-after-miked` — an already-miked signal is sent through a cabinet stage again.
+     * `undividable-seam` — one electrical side declares a port impedance and the other does not.
+     * `instrument-into-speaker-stage` — a stage wanting a speaker terminal is fed instrument level.
+     * `bypass-not-modelled` — a chain bypass was requested on a slot whose packet declares
+     * `audio.bypass: "none"` — the circuit has no bypass switch, so the slot is wired through.
+     */
+    readonly code: "unscalable-seam" | "speaker-signal-into-input" | "cab-after-miked" | "undividable-seam" | "instrument-into-speaker-stage" | "bypass-not-modelled";
+    /** The slot whose output crosses the seam, and the slot receiving it. */
+    readonly slots: readonly [number, number];
+    readonly message: string;
+};
+/**
+ * Seams where one side states no full scale. Pure, so a host can ask before playing.
+ *
+ * A one-slot chain has no seam and never reports.
+ */
+export declare function chainAdvisories(chain: readonly SlotContract[]): readonly ChainAdvisory[];
+/**
+ * Bypass requested on a packet that declares no bypass switch.
+ *
+ * `audio.bypass: "none"` is a declared absence (37 core-only lanes + 1 passive volume, 38 total
+ * after backfill) — not a missing field. A chain "bypass" on such a slot has nothing in the
+ * circuit to mean; wire is the only honest choice, and the slot must say so via advisory, not
+ * log. Hard-coded to the Program's carried declaration when present; missing field (pre-backfill
+ * programs) is treated as "switch" (has bypass) until Y lands `program.bypass`.
+ */
+export declare function bypassNotModelledAdvisories(slots: readonly import("./chain-slot").ChainSlot[]): readonly ChainAdvisory[];
+/**
+ * The multiplier applied to the signal crossing into `slot`.
+ *
+ * Two independent factors, multiplied:
+ *
+ *   - the **full-scale ratio**, converting between the two slots' own voltage normalisations, or 1
+ *     where either side states no supply to derive a bound from;
+ *   - the **impedance divider** `Zin / (Zout + Zin)`, the loading one slot's input puts on the
+ *     previous slot's output, or 1 where either electrical side declares none.
+ *
+ * They are separate questions and neither substitutes for the other: full scale is about the units
+ * a number is in, loading is about how much of the signal survives the connection. A seam can scale
+ * and not divide, or divide and not scale.
+ */
+export declare function seamScale(chain: readonly SlotContract[], slot: number): number;
+/**
+ * The resistive divider at a seam, or `1` when it cannot be computed.
+ *
+ * **Resistive and one-directional, which is a stated approximation rather than an oversight.** Real
+ * interaction between two stages is bidirectional and frequency-dependent, and only co-solving the
+ * adjacent blocks captures it -- the fidelity ceiling the unified plan §5.3 names and this
+ * deliberately does not attempt. What this does capture is the audible first-order half: a fuzz with
+ * a low input impedance loads the pickup or the pedal ahead of it, which is a large part of what that
+ * pedal *is*.
+ *
+ * **No default is invented anywhere.** A missing impedance yields 1, never an assumed "standard
+ * 1 MΩ input" -- a fabricated convention would be indistinguishable from a measurement in every
+ * downstream number. Measured on the corpus as of 2026-08-21 that means this returns 1 for every
+ * seam: **zero input jacks declare a typed impedance**, and the only four declarations anywhere are
+ * output impedances (`marshall-blues-breaker` 1 MΩ, `mxr-m117r-flanger` 1 kΩ,
+ * `mxr-noise-gate-line-driver` 10 kΩ, `pigtronix-philosophers-tone` 150 Ω). The mechanism is
+ * therefore inert until sources carry the input side, and `undividable-seam` is what says so out
+ * loud on a chain built from one of those four.
+ */
+export declare function seamDivider(chain: readonly SlotContract[], slot: number): number;
+//# sourceMappingURL=chain-advisories.d.ts.map

package/dist/chain-advisories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chain-advisories.d.ts","sourceRoot":"","sources":["../src/chain-advisories.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,YAAY,EAAiB,MAAM,cAAc,CAAC;AAkBhE,6EAA6E;AAC7E,MAAM,MAAM,aAAa,GAAG;IAC3B;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,IAAI,EACV,iBAAiB,GACjB,2BAA2B,GAC3B,iBAAiB,GACjB,kBAAkB,GAClB,+BAA+B,GAC/B,qBAAqB,CAAC;IACzB,yEAAyE;IACzE,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACzB,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,eAAe,CAC9B,KAAK,EAAE,SAAS,YAAY,EAAE,GAC5B,SAAS,aAAa,EAAE,CA8J1B;AAED;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,SAAS,OAAO,cAAc,EAAE,SAAS,EAAE,GAAG,SAAS,aAAa,EAAE,CAuBxH;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,SAAS,CACxB,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,IAAI,EAAE,MAAM,GACV,MAAM,CAQR;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,WAAW,CAC1B,KAAK,EAAE,SAAS,YAAY,EAAE,EAC9B,IAAI,EAAE,MAAM,GACV,MAAM,CAUR"}