universal-physics-tensor 11.0.0 → 12.0.0

package/dist/composition/own-equation-magnitude.d.ts

@@ -0,0 +1,95 @@
+/**
+ * A magnitude for a quantity from its own equation, for the discovery magnitude gate.
+ *
+ * The gate (`discovery.ts`, `magnitudeGate`) reads a quantity's magnitude from the sourced
+ * representative-value table, else from the value the graph fixes with no anchor input (the
+ * target of a source-less equation), else from the anchor. A quantity none of those reach (the
+ * Hubble distance, c/H0, whose input the table states but the anchor does not reach) made the gate
+ * abstain. This module evaluates such a quantity from an edge into it whose every source is
+ * valued: a table value, a registered constant, a no-anchor constant, or a value this module
+ * already derived, iterated to a fixed point. It is seeded from the table and the constants only,
+ * never from the anchor, so a derived magnitude is not anchor-derived.
+ *
+ * Three guards, each a refusal the caller sees (`DerivedMagnitudes.refusals`):
+ *   - precision: a derived value carries σ in decades of log10|value|, propagated from its inputs
+ *     through the edge's log-elasticities, σ = √(Σ (∂log f/∂log xᵢ)² σᵢ²) (σᵢ is the table row's
+ *     σ, 0 for a constant, the derived σ for a derived input). The gate uses a value only when σ is
+ *     at most {@link DEFAULT_SIGMA_DECADES}, the table's own "good to about one order". The FRET
+ *     efficiency from two 5 nm order-of-magnitude scales is exactly 0.5 and carries 3√2 decades: a
+ *     number with no magnitude information, which this guard refuses.
+ *   - agreement: two edges that derive one quantity and differ by more than a relative
+ *     {@link DERIVED_AGREEMENT} give it no value; no edge wins by its place in the list.
+ *   - the edge's own evaluation (`evaluateEdge`): a domain refusal, an unset coefficient or a
+ *     non-finite or zero result gives no value.
+ *
+ * Seeds are SI (the table's unit) and are converted into each quantity's evaluator convention
+ * (`conventionScaleToSI`; `planck-mass-energy` and `vacuum-expectation-value` speak GeV), and every
+ * result is converted back to SI.
+ *
+ * INTERNAL — read by `discovery.ts`; surfaced through `upt discover` and `upt ground`.
+ *
+ * @module composition/own-equation-magnitude
+ */
+import type { BridgeEdge } from './edge.js';
+import type { QuantityIdentification } from './compose.js';
+import type { RepresentativeValue } from './representative-values.js';
+/**
+ * Relative difference above which two edges deriving one quantity disagree. Two encodings of one
+ * equation agree to rounding; a factor that differs (2 against 1) is far above it.
+ * @internal
+ */
+export declare const DERIVED_AGREEMENT = 1e-9;
+/** A magnitude derived from a quantity's own equation. @internal */
+export interface DerivedMagnitude {
+    /** The value in SI (the table's unit), converted back from the evaluator's convention. */
+    readonly value: number;
+    /** σ in decades of log10|value|, propagated through the edge's log-elasticities. */
+    readonly sigmaDecades: number;
+    /** The edge that produced it (`identification:<from>` for a registered identification's copy). */
+    readonly edge: string;
+    /** The names the edge read, sorted. */
+    readonly inputs: readonly string[];
+}
+/** Why a quantity reached by an equation has no derived magnitude. @internal */
+export interface DerivedMagnitudeRefusal {
+    readonly name: string;
+    /**
+     * `imprecise`: the propagated σ is above the guard. `disagreeing-edges`: two edges that derive it
+     * differ by more than {@link DERIVED_AGREEMENT}. `precision-unknown`: the edge fired at the point
+     * but not at the points the elasticity reads, so σ could not be measured.
+     */
+    readonly reason: 'imprecise' | 'disagreeing-edges' | 'precision-unknown';
+    /** The edges involved, sorted. */
+    readonly edges: readonly string[];
+    /** The propagated σ, for `imprecise`. */
+    readonly sigmaDecades?: number;
+    /** One sentence for a reader. */
+    readonly detail: string;
+}
+/** The magnitudes the graph derives from the table and the constants, and the refusals. @internal */
+export interface DerivedMagnitudes {
+    /** Derived magnitudes the gate may use (σ within the guard), by quantity name. */
+    readonly values: ReadonlyMap<string, DerivedMagnitude>;
+    /** Every quantity an equation reached that has no usable derived magnitude, sorted by name. */
+    readonly refusals: readonly DerivedMagnitudeRefusal[];
+}
+/** What the caller supplies: the sourced table and the no-anchor constants. @internal */
+export interface OwnEquationSeeds {
+    /** The sourced representative values, in SI. */
+    readonly representativeValues: Readonly<Record<string, RepresentativeValue>>;
+    /** The values the graph fixes with no anchor input, in the evaluator's convention (`forwardEvaluate(edges, {}, …)`). */
+    readonly constantValues: ReadonlyMap<string, number>;
+    /** Identifications honoured as copies, as `forwardEvaluate` honours them. */
+    readonly identifications: readonly QuantityIdentification[];
+}
+/**
+ * The magnitudes `edges` derive from the sourced table and the constants, with the refusals. A
+ * quantity the table or a constant states is a seed and is never derived. Each round fires every
+ * edge from the values of the round before, so the edge list's order decides nothing; a quantity
+ * that two edges value differently is withdrawn with everything derived from it, and the fixed
+ * point is recomputed without it. A value is assigned from the first of its agreeing edges by id.
+ *
+ * @internal
+ */
+export declare function deriveOwnEquationMagnitudes(edges: readonly BridgeEdge[], seeds: OwnEquationSeeds, maxSigmaDecades?: number): DerivedMagnitudes;
+//# sourceMappingURL=own-equation-magnitude.d.ts.map

package/dist/composition/own-equation-magnitude.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"own-equation-magnitude.d.ts","sourceRoot":"","sources":["../../src/composition/own-equation-magnitude.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,cAAc,CAAC;AAG3D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAOtE;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,OAAO,CAAC;AAgBtC,oEAAoE;AACpE,MAAM,WAAW,gBAAgB;IAC/B,0FAA0F;IAC1F,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,oFAAoF;IACpF,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,kGAAkG;IAClG,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,uCAAuC;IACvC,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED,gFAAgF;AAChF,MAAM,WAAW,uBAAuB;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,WAAW,GAAG,mBAAmB,GAAG,mBAAmB,CAAC;IACzE,kCAAkC;IAClC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,yCAAyC;IACzC,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,iCAAiC;IACjC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,qGAAqG;AACrG,MAAM,WAAW,iBAAiB;IAChC,kFAAkF;IAClF,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IACvD,+FAA+F;IAC/F,QAAQ,CAAC,QAAQ,EAAE,SAAS,uBAAuB,EAAE,CAAC;CACvD;AAiBD,yFAAyF;AACzF,MAAM,WAAW,gBAAgB;IAC/B,gDAAgD;IAChD,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC7E,wHAAwH;IACxH,QAAQ,CAAC,cAAc,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrD,6EAA6E;IAC7E,QAAQ,CAAC,eAAe,EAAE,SAAS,sBAAsB,EAAE,CAAC;CAC7D;AAkGD;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CACzC,KAAK,EAAE,SAAS,UAAU,EAAE,EAC5B,KAAK,EAAE,gBAAgB,EACvB,eAAe,GAAE,MAA8B,GAC9C,iBAAiB,CAkFnB"}

package/dist/composition/own-equation-magnitude.js

@@ -0,0 +1,270 @@
+/**
+ * A magnitude for a quantity from its own equation, for the discovery magnitude gate.
+ *
+ * The gate (`discovery.ts`, `magnitudeGate`) reads a quantity's magnitude from the sourced
+ * representative-value table, else from the value the graph fixes with no anchor input (the
+ * target of a source-less equation), else from the anchor. A quantity none of those reach (the
+ * Hubble distance, c/H0, whose input the table states but the anchor does not reach) made the gate
+ * abstain. This module evaluates such a quantity from an edge into it whose every source is
+ * valued: a table value, a registered constant, a no-anchor constant, or a value this module
+ * already derived, iterated to a fixed point. It is seeded from the table and the constants only,
+ * never from the anchor, so a derived magnitude is not anchor-derived.
+ *
+ * Three guards, each a refusal the caller sees (`DerivedMagnitudes.refusals`):
+ *   - precision: a derived value carries σ in decades of log10|value|, propagated from its inputs
+ *     through the edge's log-elasticities, σ = √(Σ (∂log f/∂log xᵢ)² σᵢ²) (σᵢ is the table row's
+ *     σ, 0 for a constant, the derived σ for a derived input). The gate uses a value only when σ is
+ *     at most {@link DEFAULT_SIGMA_DECADES}, the table's own "good to about one order". The FRET
+ *     efficiency from two 5 nm order-of-magnitude scales is exactly 0.5 and carries 3√2 decades: a
+ *     number with no magnitude information, which this guard refuses.
+ *   - agreement: two edges that derive one quantity and differ by more than a relative
+ *     {@link DERIVED_AGREEMENT} give it no value; no edge wins by its place in the list.
+ *   - the edge's own evaluation (`evaluateEdge`): a domain refusal, an unset coefficient or a
+ *     non-finite or zero result gives no value.
+ *
+ * Seeds are SI (the table's unit) and are converted into each quantity's evaluator convention
+ * (`conventionScaleToSI`; `planck-mass-energy` and `vacuum-expectation-value` speak GeV), and every
+ * result is converted back to SI.
+ *
+ * INTERNAL — read by `discovery.ts`; surfaced through `upt discover` and `upt ground`.
+ *
+ * @module composition/own-equation-magnitude
+ */
+import { evaluateEdge } from './edge.js';
+import { evaluationInputs, refusesThePoint } from './retrodiction.js';
+import { DEFAULT_SIGMA_DECADES, sigmaDecadesOf } from './representative-values.js';
+import { conventionFactor, conventionScaleToSI } from '../dimensional/unit-convention.js';
+import { CONSTANT_REGISTRY } from '../dimensional/symbolic-constants.js';
+import { centralPartial } from '../numerical/finite-difference.js';
+import { byKey, compareCodepoint } from '../core/compare.js';
+import { formatQuantity } from '../core/format.js';
+/**
+ * Relative difference above which two edges deriving one quantity disagree. Two encodings of one
+ * equation agree to rounding; a factor that differs (2 against 1) is far above it.
+ * @internal
+ */
+export const DERIVED_AGREEMENT = 1e-9;
+/**
+ * The half-step, in decades of an input, of the central difference that measures a
+ * log-elasticity. A power law's elasticity is exact at any step; for another form the truncation
+ * error is of order the step squared.
+ */
+const ELASTICITY_STEP_DECADES = 1e-3;
+/**
+ * Decades by which a propagated σ may exceed the guard and still pass: room for the central
+ * difference's rounding, so a power law of elasticity 1 on a one-decade input is not refused for a
+ * last-bit excess (the Hubble distance's σ measures exactly 1). Far below any σ the guard refuses.
+ */
+const SIGMA_GUARD_SLACK = 1e-9;
+/** The seeds: the table (SI → evaluator unit), then a registered constant that is a graph quantity, then a no-anchor constant. */
+function seedsOf(edges, seeds) {
+    const known = new Map();
+    for (const [name, rv] of Object.entries(seeds.representativeValues)) {
+        if (!(Number.isFinite(rv.value) && rv.value !== 0))
+            continue;
+        known.set(name, { value: rv.value / conventionScaleToSI(name), sigmaDecades: sigmaDecadesOf(rv) });
+    }
+    const names = new Set(edges.flatMap((e) => [e.target.name, ...e.sources.map((s) => s.name)]));
+    for (const record of CONSTANT_REGISTRY) {
+        const name = record.quantity;
+        if (name === undefined || !names.has(name) || known.has(name))
+            continue;
+        known.set(name, { value: record.value / conventionScaleToSI(name), sigmaDecades: 0 });
+    }
+    for (const [name, value] of seeds.constantValues) {
+        if (known.has(name) || !(Number.isFinite(value) && value !== 0))
+            continue;
+        known.set(name, { value, sigmaDecades: 0 });
+    }
+    return known;
+}
+/** log10|f| as a function of log10|x_key|, the other inputs held. NaN when the edge refuses. */
+function logResponse(edge, inputs, key) {
+    const sign = Math.sign(inputs[key]);
+    return (point) => {
+        try {
+            return Math.log10(Math.abs(evaluateEdge(edge, { ...inputs, [key]: sign * 10 ** point['u'] })));
+        }
+        catch (err) {
+            if (!refusesThePoint(err))
+                throw err;
+            return Number.NaN;
+        }
+    };
+}
+/** σ of an edge's value from its inputs' σ, through the log-elasticities; undefined when one is not finite. */
+function propagatedSigma(edge, inputs, known) {
+    let sum = 0;
+    for (const key of Object.keys(inputs).sort(compareCodepoint)) {
+        const sigma = known.get(key)?.sigmaDecades ?? 0;
+        if (sigma === 0)
+            continue;
+        const x = inputs[key];
+        if (!(Number.isFinite(x) && x !== 0))
+            return undefined;
+        const elasticity = centralPartial(logResponse(edge, inputs, key), { u: Math.log10(Math.abs(x)) }, 'u', ELASTICITY_STEP_DECADES);
+        if (!Number.isFinite(elasticity))
+            return undefined;
+        sum += elasticity * elasticity * sigma * sigma;
+    }
+    return Math.sqrt(sum);
+}
+/** Every edge and identification that fires for an unvalued, unblocked target, from `known` as it stands. */
+function firings(edges, idents, known, skip) {
+    const out = new Map();
+    const push = (target, f) => {
+        const list = out.get(target);
+        if (list === undefined)
+            out.set(target, [f]);
+        else
+            list.push(f);
+    };
+    for (const id of idents) {
+        const from = known.get(id.from);
+        if (from === undefined || skip(id.to))
+            continue;
+        const value = from.value * conventionFactor(id.from, id.to);
+        if (Number.isFinite(value) && value !== 0) {
+            push(id.to, { edge: `identification:${id.from}`, value, sigmaDecades: from.sigmaDecades, inputs: [id.from] });
+        }
+    }
+    const values = new Map([...known].map(([name, k]) => [name, k.value]));
+    for (const e of edges) {
+        if (skip(e.target.name))
+            continue;
+        if (!e.sources.every((s) => known.has(s.name)))
+            continue;
+        const inputs = evaluationInputs(e, values);
+        let value;
+        try {
+            value = evaluateEdge(e, inputs);
+        }
+        catch (err) {
+            if (!refusesThePoint(err))
+                throw err;
+            continue;
+        }
+        if (!(Number.isFinite(value) && value !== 0))
+            continue;
+        push(e.target.name, { edge: e.id, value, sigmaDecades: propagatedSigma(e, inputs, known), inputs: Object.keys(inputs).sort(compareCodepoint) });
+    }
+    return out;
+}
+/** The firings sorted by edge id; and whether any two differ by more than {@link DERIVED_AGREEMENT}. */
+function agreement(list) {
+    const sorted = [...list].sort(byKey((f) => f.edge));
+    const agree = sorted.every((f) => Math.abs(f.value - sorted[0].value) <= DERIVED_AGREEMENT * Math.max(Math.abs(f.value), Math.abs(sorted[0].value)));
+    return { sorted, agree };
+}
+/**
+ * The magnitudes `edges` derive from the sourced table and the constants, with the refusals. A
+ * quantity the table or a constant states is a seed and is never derived. Each round fires every
+ * edge from the values of the round before, so the edge list's order decides nothing; a quantity
+ * that two edges value differently is withdrawn with everything derived from it, and the fixed
+ * point is recomputed without it. A value is assigned from the first of its agreeing edges by id.
+ *
+ * @internal
+ */
+export function deriveOwnEquationMagnitudes(edges, seeds, maxSigmaDecades = DEFAULT_SIGMA_DECADES) {
+    const seeded = seedsOf(edges, seeds);
+    const disagreeing = new Map();
+    for (;;) {
+        const unmeasured = new Map();
+        const known = new Map(seeded);
+        const derived = new Map();
+        const skip = (name) => known.has(name) || disagreeing.has(name) || unmeasured.has(name);
+        for (;;) {
+            const round = firings(edges, seeds.identifications, known, skip);
+            if (round.size === 0)
+                break;
+            for (const target of [...round.keys()].sort(compareCodepoint)) {
+                const { sorted, agree } = agreement(round.get(target));
+                const edgeIds = sorted.map((f) => f.edge);
+                if (!agree) {
+                    disagreeing.set(target, disagreement(target, sorted));
+                    continue;
+                }
+                const chosen = sorted[0];
+                if (chosen.sigmaDecades === undefined) {
+                    unmeasured.set(target, {
+                        name: target,
+                        reason: 'precision-unknown',
+                        edges: edgeIds,
+                        detail: `${chosen.edge} fires at the point but not at the points its log-elasticity reads, so σ was not measured`,
+                    });
+                    continue;
+                }
+                derived.set(target, chosen);
+                known.set(target, { value: chosen.value, sigmaDecades: chosen.sigmaDecades });
+            }
+        }
+        // An edge whose sources were valued only after its target was: it must agree with that value.
+        const late = [];
+        const values = new Map([...known].map(([name, k]) => [name, k.value]));
+        for (const [target, chosen] of derived) {
+            const all = [chosen];
+            for (const e of edges) {
+                if (e.target.name !== target || e.id === chosen.edge)
+                    continue;
+                if (!e.sources.every((s) => known.has(s.name)))
+                    continue;
+                try {
+                    const value = evaluateEdge(e, evaluationInputs(e, values));
+                    if (Number.isFinite(value) && value !== 0)
+                        all.push({ edge: e.id, value, sigmaDecades: undefined, inputs: [] });
+                }
+                catch (err) {
+                    if (!refusesThePoint(err))
+                        throw err;
+                }
+            }
+            for (const id of seeds.identifications) {
+                if (id.to !== target || `identification:${id.from}` === chosen.edge)
+                    continue;
+                const from = known.get(id.from);
+                if (from === undefined)
+                    continue;
+                const value = from.value * conventionFactor(id.from, id.to);
+                if (Number.isFinite(value) && value !== 0)
+                    all.push({ edge: `identification:${id.from}`, value, sigmaDecades: undefined, inputs: [] });
+            }
+            const { sorted, agree } = agreement(all);
+            if (!agree) {
+                disagreeing.set(target, disagreement(target, sorted));
+                late.push(target);
+            }
+        }
+        if (late.length > 0)
+            continue;
+        const usable = new Map();
+        const refusals = [...disagreeing.values(), ...unmeasured.values()];
+        for (const [name, f] of derived) {
+            const sigma = f.sigmaDecades;
+            if (sigma > maxSigmaDecades + SIGMA_GUARD_SLACK) {
+                refusals.push({
+                    name,
+                    reason: 'imprecise',
+                    edges: [f.edge],
+                    sigmaDecades: sigma,
+                    detail: `${f.edge} gives ${name} from ${f.inputs.join(', ')} at σ = ${formatQuantity(sigma, 3)} decades, ` +
+                        `above the ${maxSigmaDecades}-decade precision the gate requires`,
+                });
+                continue;
+            }
+            usable.set(name, { value: f.value * conventionScaleToSI(name), sigmaDecades: sigma, edge: f.edge, inputs: f.inputs });
+        }
+        refusals.sort(byKey((r) => r.name));
+        return { values: usable, refusals };
+    }
+}
+/** The refusal record of two or more edges that value one quantity differently. */
+function disagreement(name, sorted) {
+    return {
+        name,
+        reason: 'disagreeing-edges',
+        edges: sorted.map((f) => f.edge),
+        detail: `${sorted.map((f) => `${f.edge} gives ${formatQuantity(f.value, 4)}`).join(', ')}: ` +
+            `they differ by more than a relative ${DERIVED_AGREEMENT}, so no edge is taken`,
+    };
+}
+//# sourceMappingURL=own-equation-magnitude.js.map

package/dist/composition/own-equation-magnitude.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"own-equation-magnitude.js","sourceRoot":"","sources":["../../src/composition/own-equation-magnitude.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAEzC,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACtE,OAAO,EAAE,qBAAqB,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEnF,OAAO,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAC1F,OAAO,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AACzE,OAAO,EAAE,cAAc,EAAE,MAAM,mCAAmC,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAEtC;;;;GAIG;AACH,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAErC;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAgE/B,kIAAkI;AAClI,SAAS,OAAO,CAAC,KAA4B,EAAE,KAAuB;IACpE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,CAAC,EAAE,CAAC;QACpE,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC;YAAE,SAAS;QAC7D,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,cAAc,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACrG,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,KAAK,MAAM,MAAM,IAAI,iBAAiB,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACxE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;IACxF,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,cAAc,EAAE,CAAC;QACjD,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,SAAS;QAC1E,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gGAAgG;AAChG,SAAS,WAAW,CAAC,IAAgB,EAAE,MAAwC,EAAE,GAAW;IAC1F,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC,CAAC;IACrC,OAAO,CAAC,KAAK,EAAE,EAAE;QACf,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,IAAI,KAAK,CAAC,GAAG,CAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClG,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;gBAAE,MAAM,GAAG,CAAC;YACrC,OAAO,MAAM,CAAC,GAAG,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;AACJ,CAAC;AAED,+GAA+G;AAC/G,SAAS,eAAe,CAAC,IAAgB,EAAE,MAAwC,EAAE,KAAiC;IACpH,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAC7D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,YAAY,IAAI,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,CAAC;YAAE,SAAS;QAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAE,CAAC;QACvB,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACvD,MAAM,UAAU,GAAG,cAAc,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,uBAAuB,CAAC,CAAC;QAChI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,SAAS,CAAC;QACnD,GAAG,IAAI,UAAU,GAAG,UAAU,GAAG,KAAK,GAAG,KAAK,CAAC;IACjD,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,6GAA6G;AAC7G,SAAS,OAAO,CACd,KAA4B,EAC5B,MAAyC,EACzC,KAAiC,EACjC,IAA+B;IAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,MAAM,IAAI,GAAG,CAAC,MAAc,EAAE,CAAS,EAAQ,EAAE;QAC/C,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS;YAAE,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;;YACxC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC;IACF,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAAE,SAAS;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5D,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChH,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,SAAS;QAClC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,SAAS;QACzD,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,KAAa,CAAC;QAClB,IAAI,CAAC;YACH,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;gBAAE,MAAM,GAAG,CAAC;YACrC,SAAS;QACX,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,SAAS;QACvD,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;IAClJ,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,wGAAwG;AACxG,SAAS,SAAS,CAAC,IAAuB;IACxC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CACxB,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,IAAI,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,CAC3H,CAAC;IACF,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAA4B,EAC5B,KAAuB,EACvB,eAAe,GAAW,qBAAqB;IAE/C,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAmC,CAAC;IAC/D,SAAS,CAAC;QACR,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmC,CAAC;QAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,IAAI,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzG,SAAS,CAAC;YACR,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACjE,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;gBAAE,MAAM;YAC5B,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;gBACxD,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;oBACtD,SAAS;gBACX,CAAC;gBACD,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;gBAC1B,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;oBACtC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE;wBACrB,IAAI,EAAE,MAAM;wBACZ,MAAM,EAAE,mBAAmB;wBAC3B,KAAK,EAAE,OAAO;wBACd,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,2FAA2F;qBAClH,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC5B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;YAChF,CAAC;QACH,CAAC;QACD,8FAA8F;QAC9F,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvE,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACvC,MAAM,GAAG,GAAa,CAAC,MAAM,CAAC,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI;oBAAE,SAAS;gBAC/D,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAE,SAAS;gBACzD,IAAI,CAAC;oBACH,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;oBAC3D,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;wBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;gBAClH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;wBAAE,MAAM,GAAG,CAAC;gBACvC,CAAC;YACH,CAAC;YACD,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;gBACvC,IAAI,EAAE,CAAC,EAAE,KAAK,MAAM,IAAI,kBAAkB,EAAE,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC,IAAI;oBAAE,SAAS;gBAC9E,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAChC,IAAI,IAAI,KAAK,SAAS;oBAAE,SAAS;gBACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC5D,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,kBAAkB,EAAE,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YACzI,CAAC;YACD,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;gBACtD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA4B,CAAC;QACnD,MAAM,QAAQ,GAA8B,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,CAAC,CAAC,YAAa,CAAC;YAC9B,IAAI,KAAK,GAAG,eAAe,GAAG,iBAAiB,EAAE,CAAC;gBAChD,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI;oBACJ,MAAM,EAAE,WAAW;oBACnB,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;oBACf,YAAY,EAAE,KAAK;oBACnB,MAAM,EACJ,GAAG,CAAC,CAAC,IAAI,UAAU,IAAI,SAAS,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;wBAClG,aAAa,eAAe,qCAAqC;iBACpE,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QACxH,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACpC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;IACtC,CAAC;AACH,CAAC;AAED,mFAAmF;AACnF,SAAS,YAAY,CAAC,IAAY,EAAE,MAAyB;IAC3D,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,mBAAmB;QAC3B,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAChC,MAAM,EACJ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,UAAU,cAAc,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YACpF,uCAAuC,iBAAiB,uBAAuB;KAClF,CAAC;AACJ,CAAC","sourcesContent":["/**\n * A magnitude for a quantity from its own equation, for the discovery magnitude gate.\n *\n * The gate (`discovery.ts`, `magnitudeGate`) reads a quantity's magnitude from the sourced\n * representative-value table, else from the value the graph fixes with no anchor input (the\n * target of a source-less equation), else from the anchor. A quantity none of those reach (the\n * Hubble distance, c/H0, whose input the table states but the anchor does not reach) made the gate\n * abstain. This module evaluates such a quantity from an edge into it whose every source is\n * valued: a table value, a registered constant, a no-anchor constant, or a value this module\n * already derived, iterated to a fixed point. It is seeded from the table and the constants only,\n * never from the anchor, so a derived magnitude is not anchor-derived.\n *\n * Three guards, each a refusal the caller sees (`DerivedMagnitudes.refusals`):\n *   - precision: a derived value carries σ in decades of log10|value|, propagated from its inputs\n *     through the edge's log-elasticities, σ = √(Σ (∂log f/∂log xᵢ)² σᵢ²) (σᵢ is the table row's\n *     σ, 0 for a constant, the derived σ for a derived input). The gate uses a value only when σ is\n *     at most {@link DEFAULT_SIGMA_DECADES}, the table's own \"good to about one order\". The FRET\n *     efficiency from two 5 nm order-of-magnitude scales is exactly 0.5 and carries 3√2 decades: a\n *     number with no magnitude information, which this guard refuses.\n *   - agreement: two edges that derive one quantity and differ by more than a relative\n *     {@link DERIVED_AGREEMENT} give it no value; no edge wins by its place in the list.\n *   - the edge's own evaluation (`evaluateEdge`): a domain refusal, an unset coefficient or a\n *     non-finite or zero result gives no value.\n *\n * Seeds are SI (the table's unit) and are converted into each quantity's evaluator convention\n * (`conventionScaleToSI`; `planck-mass-energy` and `vacuum-expectation-value` speak GeV), and every\n * result is converted back to SI.\n *\n * INTERNAL — read by `discovery.ts`; surfaced through `upt discover` and `upt ground`.\n *\n * @module composition/own-equation-magnitude\n */\n\nimport type { BridgeEdge } from './edge.js';\nimport { evaluateEdge } from './edge.js';\nimport type { QuantityIdentification } from './compose.js';\nimport { evaluationInputs, refusesThePoint } from './retrodiction.js';\nimport { DEFAULT_SIGMA_DECADES, sigmaDecadesOf } from './representative-values.js';\nimport type { RepresentativeValue } from './representative-values.js';\nimport { conventionFactor, conventionScaleToSI } from '../dimensional/unit-convention.js';\nimport { CONSTANT_REGISTRY } from '../dimensional/symbolic-constants.js';\nimport { centralPartial } from '../numerical/finite-difference.js';\nimport { byKey, compareCodepoint } from '../core/compare.js';\nimport { formatQuantity } from '../core/format.js';\n\n/**\n * Relative difference above which two edges deriving one quantity disagree. Two encodings of one\n * equation agree to rounding; a factor that differs (2 against 1) is far above it.\n * @internal\n */\nexport const DERIVED_AGREEMENT = 1e-9;\n\n/**\n * The half-step, in decades of an input, of the central difference that measures a\n * log-elasticity. A power law's elasticity is exact at any step; for another form the truncation\n * error is of order the step squared.\n */\nconst ELASTICITY_STEP_DECADES = 1e-3;\n\n/**\n * Decades by which a propagated σ may exceed the guard and still pass: room for the central\n * difference's rounding, so a power law of elasticity 1 on a one-decade input is not refused for a\n * last-bit excess (the Hubble distance's σ measures exactly 1). Far below any σ the guard refuses.\n */\nconst SIGMA_GUARD_SLACK = 1e-9;\n\n/** A magnitude derived from a quantity's own equation. @internal */\nexport interface DerivedMagnitude {\n  /** The value in SI (the table's unit), converted back from the evaluator's convention. */\n  readonly value: number;\n  /** σ in decades of log10|value|, propagated through the edge's log-elasticities. */\n  readonly sigmaDecades: number;\n  /** The edge that produced it (`identification:<from>` for a registered identification's copy). */\n  readonly edge: string;\n  /** The names the edge read, sorted. */\n  readonly inputs: readonly string[];\n}\n\n/** Why a quantity reached by an equation has no derived magnitude. @internal */\nexport interface DerivedMagnitudeRefusal {\n  readonly name: string;\n  /**\n   * `imprecise`: the propagated σ is above the guard. `disagreeing-edges`: two edges that derive it\n   * differ by more than {@link DERIVED_AGREEMENT}. `precision-unknown`: the edge fired at the point\n   * but not at the points the elasticity reads, so σ could not be measured.\n   */\n  readonly reason: 'imprecise' | 'disagreeing-edges' | 'precision-unknown';\n  /** The edges involved, sorted. */\n  readonly edges: readonly string[];\n  /** The propagated σ, for `imprecise`. */\n  readonly sigmaDecades?: number;\n  /** One sentence for a reader. */\n  readonly detail: string;\n}\n\n/** The magnitudes the graph derives from the table and the constants, and the refusals. @internal */\nexport interface DerivedMagnitudes {\n  /** Derived magnitudes the gate may use (σ within the guard), by quantity name. */\n  readonly values: ReadonlyMap<string, DerivedMagnitude>;\n  /** Every quantity an equation reached that has no usable derived magnitude, sorted by name. */\n  readonly refusals: readonly DerivedMagnitudeRefusal[];\n}\n\n/** A known value in the evaluator's convention, with its σ in decades. */\ninterface Known {\n  readonly value: number;\n  readonly sigmaDecades: number;\n}\n\n/** One edge (or identification) that fired for a target. */\ninterface Firing {\n  readonly edge: string;\n  readonly value: number;\n  /** Undefined when the elasticity could not be measured. */\n  readonly sigmaDecades: number | undefined;\n  readonly inputs: readonly string[];\n}\n\n/** What the caller supplies: the sourced table and the no-anchor constants. @internal */\nexport interface OwnEquationSeeds {\n  /** The sourced representative values, in SI. */\n  readonly representativeValues: Readonly<Record<string, RepresentativeValue>>;\n  /** The values the graph fixes with no anchor input, in the evaluator's convention (`forwardEvaluate(edges, {}, …)`). */\n  readonly constantValues: ReadonlyMap<string, number>;\n  /** Identifications honoured as copies, as `forwardEvaluate` honours them. */\n  readonly identifications: readonly QuantityIdentification[];\n}\n\n/** The seeds: the table (SI → evaluator unit), then a registered constant that is a graph quantity, then a no-anchor constant. */\nfunction seedsOf(edges: readonly BridgeEdge[], seeds: OwnEquationSeeds): Map<string, Known> {\n  const known = new Map<string, Known>();\n  for (const [name, rv] of Object.entries(seeds.representativeValues)) {\n    if (!(Number.isFinite(rv.value) && rv.value !== 0)) continue;\n    known.set(name, { value: rv.value / conventionScaleToSI(name), sigmaDecades: sigmaDecadesOf(rv) });\n  }\n  const names = new Set(edges.flatMap((e) => [e.target.name, ...e.sources.map((s) => s.name)]));\n  for (const record of CONSTANT_REGISTRY) {\n    const name = record.quantity;\n    if (name === undefined || !names.has(name) || known.has(name)) continue;\n    known.set(name, { value: record.value / conventionScaleToSI(name), sigmaDecades: 0 });\n  }\n  for (const [name, value] of seeds.constantValues) {\n    if (known.has(name) || !(Number.isFinite(value) && value !== 0)) continue;\n    known.set(name, { value, sigmaDecades: 0 });\n  }\n  return known;\n}\n\n/** log10|f| as a function of log10|x_key|, the other inputs held. NaN when the edge refuses. */\nfunction logResponse(edge: BridgeEdge, inputs: Readonly<Record<string, number>>, key: string): (point: Record<string, number>) => number {\n  const sign = Math.sign(inputs[key]!);\n  return (point) => {\n    try {\n      return Math.log10(Math.abs(evaluateEdge(edge, { ...inputs, [key]: sign * 10 ** point['u']! })));\n    } catch (err) {\n      if (!refusesThePoint(err)) throw err;\n      return Number.NaN;\n    }\n  };\n}\n\n/** σ of an edge's value from its inputs' σ, through the log-elasticities; undefined when one is not finite. */\nfunction propagatedSigma(edge: BridgeEdge, inputs: Readonly<Record<string, number>>, known: ReadonlyMap<string, Known>): number | undefined {\n  let sum = 0;\n  for (const key of Object.keys(inputs).sort(compareCodepoint)) {\n    const sigma = known.get(key)?.sigmaDecades ?? 0;\n    if (sigma === 0) continue;\n    const x = inputs[key]!;\n    if (!(Number.isFinite(x) && x !== 0)) return undefined;\n    const elasticity = centralPartial(logResponse(edge, inputs, key), { u: Math.log10(Math.abs(x)) }, 'u', ELASTICITY_STEP_DECADES);\n    if (!Number.isFinite(elasticity)) return undefined;\n    sum += elasticity * elasticity * sigma * sigma;\n  }\n  return Math.sqrt(sum);\n}\n\n/** Every edge and identification that fires for an unvalued, unblocked target, from `known` as it stands. */\nfunction firings(\n  edges: readonly BridgeEdge[],\n  idents: readonly QuantityIdentification[],\n  known: ReadonlyMap<string, Known>,\n  skip: (name: string) => boolean,\n): Map<string, Firing[]> {\n  const out = new Map<string, Firing[]>();\n  const push = (target: string, f: Firing): void => {\n    const list = out.get(target);\n    if (list === undefined) out.set(target, [f]);\n    else list.push(f);\n  };\n  for (const id of idents) {\n    const from = known.get(id.from);\n    if (from === undefined || skip(id.to)) continue;\n    const value = from.value * conventionFactor(id.from, id.to);\n    if (Number.isFinite(value) && value !== 0) {\n      push(id.to, { edge: `identification:${id.from}`, value, sigmaDecades: from.sigmaDecades, inputs: [id.from] });\n    }\n  }\n  const values = new Map([...known].map(([name, k]) => [name, k.value]));\n  for (const e of edges) {\n    if (skip(e.target.name)) continue;\n    if (!e.sources.every((s) => known.has(s.name))) continue;\n    const inputs = evaluationInputs(e, values);\n    let value: number;\n    try {\n      value = evaluateEdge(e, inputs);\n    } catch (err) {\n      if (!refusesThePoint(err)) throw err;\n      continue;\n    }\n    if (!(Number.isFinite(value) && value !== 0)) continue;\n    push(e.target.name, { edge: e.id, value, sigmaDecades: propagatedSigma(e, inputs, known), inputs: Object.keys(inputs).sort(compareCodepoint) });\n  }\n  return out;\n}\n\n/** The firings sorted by edge id; and whether any two differ by more than {@link DERIVED_AGREEMENT}. */\nfunction agreement(list: readonly Firing[]): { sorted: Firing[]; agree: boolean } {\n  const sorted = [...list].sort(byKey((f) => f.edge));\n  const agree = sorted.every(\n    (f) => Math.abs(f.value - sorted[0]!.value) <= DERIVED_AGREEMENT * Math.max(Math.abs(f.value), Math.abs(sorted[0]!.value)),\n  );\n  return { sorted, agree };\n}\n\n/**\n * The magnitudes `edges` derive from the sourced table and the constants, with the refusals. A\n * quantity the table or a constant states is a seed and is never derived. Each round fires every\n * edge from the values of the round before, so the edge list's order decides nothing; a quantity\n * that two edges value differently is withdrawn with everything derived from it, and the fixed\n * point is recomputed without it. A value is assigned from the first of its agreeing edges by id.\n *\n * @internal\n */\nexport function deriveOwnEquationMagnitudes(\n  edges: readonly BridgeEdge[],\n  seeds: OwnEquationSeeds,\n  maxSigmaDecades: number = DEFAULT_SIGMA_DECADES,\n): DerivedMagnitudes {\n  const seeded = seedsOf(edges, seeds);\n  const disagreeing = new Map<string, DerivedMagnitudeRefusal>();\n  for (;;) {\n    const unmeasured = new Map<string, DerivedMagnitudeRefusal>();\n    const known = new Map(seeded);\n    const derived = new Map<string, Firing>();\n    const skip = (name: string): boolean => known.has(name) || disagreeing.has(name) || unmeasured.has(name);\n    for (;;) {\n      const round = firings(edges, seeds.identifications, known, skip);\n      if (round.size === 0) break;\n      for (const target of [...round.keys()].sort(compareCodepoint)) {\n        const { sorted, agree } = agreement(round.get(target)!);\n        const edgeIds = sorted.map((f) => f.edge);\n        if (!agree) {\n          disagreeing.set(target, disagreement(target, sorted));\n          continue;\n        }\n        const chosen = sorted[0]!;\n        if (chosen.sigmaDecades === undefined) {\n          unmeasured.set(target, {\n            name: target,\n            reason: 'precision-unknown',\n            edges: edgeIds,\n            detail: `${chosen.edge} fires at the point but not at the points its log-elasticity reads, so σ was not measured`,\n          });\n          continue;\n        }\n        derived.set(target, chosen);\n        known.set(target, { value: chosen.value, sigmaDecades: chosen.sigmaDecades });\n      }\n    }\n    // An edge whose sources were valued only after its target was: it must agree with that value.\n    const late: string[] = [];\n    const values = new Map([...known].map(([name, k]) => [name, k.value]));\n    for (const [target, chosen] of derived) {\n      const all: Firing[] = [chosen];\n      for (const e of edges) {\n        if (e.target.name !== target || e.id === chosen.edge) continue;\n        if (!e.sources.every((s) => known.has(s.name))) continue;\n        try {\n          const value = evaluateEdge(e, evaluationInputs(e, values));\n          if (Number.isFinite(value) && value !== 0) all.push({ edge: e.id, value, sigmaDecades: undefined, inputs: [] });\n        } catch (err) {\n          if (!refusesThePoint(err)) throw err;\n        }\n      }\n      for (const id of seeds.identifications) {\n        if (id.to !== target || `identification:${id.from}` === chosen.edge) continue;\n        const from = known.get(id.from);\n        if (from === undefined) continue;\n        const value = from.value * conventionFactor(id.from, id.to);\n        if (Number.isFinite(value) && value !== 0) all.push({ edge: `identification:${id.from}`, value, sigmaDecades: undefined, inputs: [] });\n      }\n      const { sorted, agree } = agreement(all);\n      if (!agree) {\n        disagreeing.set(target, disagreement(target, sorted));\n        late.push(target);\n      }\n    }\n    if (late.length > 0) continue;\n    const usable = new Map<string, DerivedMagnitude>();\n    const refusals: DerivedMagnitudeRefusal[] = [...disagreeing.values(), ...unmeasured.values()];\n    for (const [name, f] of derived) {\n      const sigma = f.sigmaDecades!;\n      if (sigma > maxSigmaDecades + SIGMA_GUARD_SLACK) {\n        refusals.push({\n          name,\n          reason: 'imprecise',\n          edges: [f.edge],\n          sigmaDecades: sigma,\n          detail:\n            `${f.edge} gives ${name} from ${f.inputs.join(', ')} at σ = ${formatQuantity(sigma, 3)} decades, ` +\n            `above the ${maxSigmaDecades}-decade precision the gate requires`,\n        });\n        continue;\n      }\n      usable.set(name, { value: f.value * conventionScaleToSI(name), sigmaDecades: sigma, edge: f.edge, inputs: f.inputs });\n    }\n    refusals.sort(byKey((r) => r.name));\n    return { values: usable, refusals };\n  }\n}\n\n/** The refusal record of two or more edges that value one quantity differently. */\nfunction disagreement(name: string, sorted: readonly Firing[]): DerivedMagnitudeRefusal {\n  return {\n    name,\n    reason: 'disagreeing-edges',\n    edges: sorted.map((f) => f.edge),\n    detail:\n      `${sorted.map((f) => `${f.edge} gives ${formatQuantity(f.value, 4)}`).join(', ')}: ` +\n      `they differ by more than a relative ${DERIVED_AGREEMENT}, so no edge is taken`,\n  };\n}\n"]}

package/dist/composition/probe/backend-protocol.d.ts

@@ -7,17 +7,20 @@
  * @internal
  */
 import type { ExprNode } from '../../dimensional/ast-types.js';
+/** One request line that the search sends to an expression-search backend worker. */
 export interface BackendRequest {
     readonly problemId: string;
     readonly budgetMs: number;
     readonly variables: readonly string[];
     readonly target: string;
 }
+/** One candidate expression that an expression-search backend worker returns. */
 export interface BackendCandidate {
     readonly expression: ExprNode;
     readonly prefactor?: number;
     readonly note?: string;
 }
+/** The parsed reply of a backend worker: its candidates, or an error. */
 export interface BackendResponse {
     readonly ok: boolean;
     readonly candidates: readonly BackendCandidate[];

package/dist/composition/probe/backend-protocol.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"backend-protocol.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/backend-protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAE/D,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;IACrB,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAwBD;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE;QAAE,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;QAAC,GAAG,IAAI,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IACzE,QAAQ,CAAC,MAAM,EAAE;QAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,IAAI,GAAG,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC9F,QAAQ,CAAC,MAAM,EAAE;QAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,IAAI,GAAG,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC9F,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC;IAC5D,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,KAAK,IAAI,GAAG,OAAO,CAAC;IAC5F,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC;CAClC;AAED,wFAAwF;AACxF,MAAM,MAAM,cAAc,GAAG,CAC3B,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,EAAE;IAAE,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,WAAW,EAAE,OAAO,CAAA;CAAE,KAC7E,aAAa,CAAC;AAEnB;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CACpC,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,EAAE,cAAc,EACvB,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,cAAc,CAAA;CAAO,GACtE,OAAO,CAAC,eAAe,CAAC,CAsD1B"}
+{"version":3,"file":"backend-protocol.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/backend-protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAE/D,qFAAqF;AACrF,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,CAAC;IACtC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,iFAAiF;AACjF,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,yEAAyE;AACzE,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC;IACrB,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;CACzB;AAwBD;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,EAAE;QAAE,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;QAAC,GAAG,IAAI,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IACzE,QAAQ,CAAC,MAAM,EAAE;QAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,IAAI,GAAG,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC9F,QAAQ,CAAC,MAAM,EAAE;QAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,UAAU,KAAK,IAAI,GAAG,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IAC9F,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC;IAC5D,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,KAAK,IAAI,GAAG,OAAO,CAAC;IAC5F,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,OAAO,CAAC;CAClC;AAED,wFAAwF;AACxF,MAAM,MAAM,cAAc,GAAG,CAC3B,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,EAAE;IAAE,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,WAAW,EAAE,OAAO,CAAA;CAAE,KAC7E,aAAa,CAAC;AAEnB;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CACpC,IAAI,EAAE,SAAS,MAAM,EAAE,EACvB,OAAO,EAAE,cAAc,EACvB,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,cAAc,CAAA;CAAO,GACtE,OAAO,CAAC,eAAe,CAAC,CAsD1B"}

package/dist/composition/probe/backend-protocol.js.map

@@ -1 +1 @@
-{"version":3,"file":"backend-protocol.js","sourceRoot":"","sources":["../../../src/composition/probe/backend-protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAsB3C,SAAS,UAAU,CAAC,KAAc;IAChC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,IAAI,GAAI,KAA4B,CAAC,IAAI,CAAC;IAChD,OAAO,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,GAAG,GAAG,MAAuE,CAAC;IACpF,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,MAAM,SAAS,GACb,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IAClG,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACzD,CAAC;AAuBD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,IAAuB,EACvB,OAAuB,EACvB,IAAI,GAAiE,EAAE;IAEvE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;IAC5D,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ,CAAC;IACrD,MAAM,MAAM,GAAmB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;QAC5C,GAAG,EAAE,IAAI,CAAC,GAAG;QACb,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;QAC/B,WAAW,EAAE,IAAI;KAClB,CAAC,CAAC;IAEH,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,MAAM,SAAS,GAAiB,EAAE,CAAC;IACnC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE;QAC7B,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC,EAAE,SAAS,CAAC,CAAC;IAEd,MAAM,YAAY,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC;IACpD,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;IACjC,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC;IAEnB,MAAM,IAAI,GAAG,MAAM,IAAI,OAAO,CAAsE,CAAC,OAAO,EAAE,EAAE;QAC9G,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACxF,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IACH,YAAY,CAAC,MAAM,CAAC,CAAC;IAErB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,0BAA0B,SAAS,IAAI,EAAE,CAAC;IACvF,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QAChF,OAAO;YACL,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,GAAG,IAAI,iBAAiB,IAAI,CAAC,IAAI,EAAE;SAC3C,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACpD,MAAM,UAAU,GAAuB,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACvC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,0BAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;QAC9F,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAClC,CAAC","sourcesContent":["/**\n * Optional NDJSON worker protocol for expression-search backends.\n *\n * Spawn with an **argv array** (no shell). Timeout + kill. Schema-validate\n * output. **No vendored Python** — CI uses `tests/fixtures/discovery-workers/echo-worker.mjs`.\n *\n * @internal\n */\n\nimport { spawn } from 'node:child_process';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\n\nexport interface BackendRequest {\n  readonly problemId: string;\n  readonly budgetMs: number;\n  readonly variables: readonly string[];\n  readonly target: string;\n}\n\nexport interface BackendCandidate {\n  readonly expression: ExprNode;\n  readonly prefactor?: number;\n  readonly note?: string;\n}\n\nexport interface BackendResponse {\n  readonly ok: boolean;\n  readonly candidates: readonly BackendCandidate[];\n  readonly error?: string;\n}\n\nfunction isExprNode(value: unknown): value is ExprNode {\n  if (!value || typeof value !== 'object') return false;\n  const kind = (value as { kind?: unknown }).kind;\n  return typeof kind === 'string' && kind.length > 0;\n}\n\nfunction parseLine(line: string): BackendCandidate | null {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(line);\n  } catch {\n    return null;\n  }\n  if (!parsed || typeof parsed !== 'object') return null;\n  const obj = parsed as { expression?: unknown; prefactor?: unknown; note?: unknown };\n  if (!isExprNode(obj.expression)) return null;\n  const prefactor =\n    typeof obj.prefactor === 'number' && Number.isFinite(obj.prefactor) ? obj.prefactor : undefined;\n  const note = typeof obj.note === 'string' ? obj.note : undefined;\n  return { expression: obj.expression, prefactor, note };\n}\n\n/**\n * The part of a launched worker process that {@link runBackendWorker} uses. A `node:child_process`\n * `ChildProcess` satisfies it; the interface keeps Node types out of this module's declarations.\n * @internal\n */\nexport interface WorkerProcess {\n  readonly stdin: { write(chunk: string): unknown; end(): unknown } | null;\n  readonly stdout: { on(event: 'data', listener: (chunk: Uint8Array) => void): unknown } | null;\n  readonly stderr: { on(event: 'data', listener: (chunk: Uint8Array) => void): unknown } | null;\n  on(event: 'error', listener: (err: Error) => void): unknown;\n  on(event: 'close', listener: (code: number | null, signal: string | null) => void): unknown;\n  kill(signal: 'SIGKILL'): unknown;\n}\n\n/** Launches a worker process. The default is `node:child_process` `spawn`. @internal */\nexport type WorkerLauncher = (\n  command: string,\n  args: readonly string[],\n  options: { cwd?: string; stdio: ['pipe', 'pipe', 'pipe']; windowsHide: boolean },\n) => WorkerProcess;\n\n/**\n * Run an untrusted NDJSON worker. Never uses a shell.\n *\n * The timeout starts when the launcher returns, so it includes the worker's own start-up time.\n * `opts.spawn` replaces the process launcher; tests use it to drive the exit paths without a real\n * process. @internal\n */\nexport async function runBackendWorker(\n  argv: readonly string[],\n  request: BackendRequest,\n  opts: { timeoutMs?: number; cwd?: string; spawn?: WorkerLauncher } = {},\n): Promise<BackendResponse> {\n  if (argv.length === 0) {\n    return { ok: false, candidates: [], error: 'empty argv' };\n  }\n  const timeoutMs = opts.timeoutMs ?? request.budgetMs;\n  const launch: WorkerLauncher = opts.spawn ?? spawn;\n  const child = launch(argv[0]!, argv.slice(1), {\n    cwd: opts.cwd,\n    stdio: ['pipe', 'pipe', 'pipe'],\n    windowsHide: true,\n  });\n\n  const chunks: Uint8Array[] = [];\n  const errChunks: Uint8Array[] = [];\n  child.stdout?.on('data', (d) => chunks.push(d));\n  child.stderr?.on('data', (d) => errChunks.push(d));\n\n  const killer = setTimeout(() => {\n    child.kill('SIGKILL');\n  }, timeoutMs);\n\n  const stdinPayload = `${JSON.stringify(request)}\\n`;\n  child.stdin?.write(stdinPayload);\n  child.stdin?.end();\n\n  const exit = await new Promise<{ code: number | null; signal: string | null; spawnError?: string }>((resolve) => {\n    child.on('error', (err) => resolve({ code: 1, signal: null, spawnError: err.message }));\n    child.on('close', (code, signal) => resolve({ code, signal }));\n  });\n  clearTimeout(killer);\n\n  if (exit.signal === 'SIGKILL') {\n    return { ok: false, candidates: [], error: `worker timed out after ${timeoutMs}ms` };\n  }\n  if (exit.code !== 0) {\n    const err = exit.spawnError ?? Buffer.concat(errChunks).toString('utf8').trim();\n    return {\n      ok: false,\n      candidates: [],\n      error: err || `worker exited ${exit.code}`,\n    };\n  }\n\n  const text = Buffer.concat(chunks).toString('utf8');\n  const candidates: BackendCandidate[] = [];\n  for (const line of text.split(/\\r?\\n/)) {\n    if (line.trim().length === 0) continue;\n    const c = parseLine(line);\n    if (!c) {\n      return { ok: false, candidates: [], error: `malformed NDJSON line: ${line.slice(0, 200)}` };\n    }\n    candidates.push(c);\n  }\n  return { ok: true, candidates };\n}\n"]}
+{"version":3,"file":"backend-protocol.js","sourceRoot":"","sources":["../../../src/composition/probe/backend-protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAyB3C,SAAS,UAAU,CAAC,KAAc;IAChC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IACtD,MAAM,IAAI,GAAI,KAA4B,CAAC,IAAI,CAAC;IAChD,OAAO,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,SAAS,CAAC,IAAY;IAC7B,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,GAAG,GAAG,MAAuE,CAAC;IACpF,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,MAAM,SAAS,GACb,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IAClG,MAAM,IAAI,GAAG,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,OAAO,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACzD,CAAC;AAuBD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,IAAuB,EACvB,OAAuB,EACvB,IAAI,GAAiE,EAAE;IAEvE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;IAC5D,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,QAAQ,CAAC;IACrD,MAAM,MAAM,GAAmB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;QAC5C,GAAG,EAAE,IAAI,CAAC,GAAG;QACb,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;QAC/B,WAAW,EAAE,IAAI;KAClB,CAAC,CAAC;IAEH,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,MAAM,SAAS,GAAiB,EAAE,CAAC;IACnC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE;QAC7B,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC,EAAE,SAAS,CAAC,CAAC;IAEd,MAAM,YAAY,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC;IACpD,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;IACjC,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC;IAEnB,MAAM,IAAI,GAAG,MAAM,IAAI,OAAO,CAAsE,CAAC,OAAO,EAAE,EAAE;QAC9G,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACxF,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IACH,YAAY,CAAC,MAAM,CAAC,CAAC;IAErB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,0BAA0B,SAAS,IAAI,EAAE,CAAC;IACvF,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QAChF,OAAO;YACL,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,GAAG,IAAI,iBAAiB,IAAI,CAAC,IAAI,EAAE;SAC3C,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACpD,MAAM,UAAU,GAAuB,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACvC,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,0BAA0B,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;QAC9F,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AAClC,CAAC","sourcesContent":["/**\n * Optional NDJSON worker protocol for expression-search backends.\n *\n * Spawn with an **argv array** (no shell). Timeout + kill. Schema-validate\n * output. **No vendored Python** — CI uses `tests/fixtures/discovery-workers/echo-worker.mjs`.\n *\n * @internal\n */\n\nimport { spawn } from 'node:child_process';\nimport type { ExprNode } from '../../dimensional/ast-types.js';\n\n/** One request line that the search sends to an expression-search backend worker. */\nexport interface BackendRequest {\n  readonly problemId: string;\n  readonly budgetMs: number;\n  readonly variables: readonly string[];\n  readonly target: string;\n}\n\n/** One candidate expression that an expression-search backend worker returns. */\nexport interface BackendCandidate {\n  readonly expression: ExprNode;\n  readonly prefactor?: number;\n  readonly note?: string;\n}\n\n/** The parsed reply of a backend worker: its candidates, or an error. */\nexport interface BackendResponse {\n  readonly ok: boolean;\n  readonly candidates: readonly BackendCandidate[];\n  readonly error?: string;\n}\n\nfunction isExprNode(value: unknown): value is ExprNode {\n  if (!value || typeof value !== 'object') return false;\n  const kind = (value as { kind?: unknown }).kind;\n  return typeof kind === 'string' && kind.length > 0;\n}\n\nfunction parseLine(line: string): BackendCandidate | null {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(line);\n  } catch {\n    return null;\n  }\n  if (!parsed || typeof parsed !== 'object') return null;\n  const obj = parsed as { expression?: unknown; prefactor?: unknown; note?: unknown };\n  if (!isExprNode(obj.expression)) return null;\n  const prefactor =\n    typeof obj.prefactor === 'number' && Number.isFinite(obj.prefactor) ? obj.prefactor : undefined;\n  const note = typeof obj.note === 'string' ? obj.note : undefined;\n  return { expression: obj.expression, prefactor, note };\n}\n\n/**\n * The part of a launched worker process that {@link runBackendWorker} uses. A `node:child_process`\n * `ChildProcess` satisfies it; the interface keeps Node types out of this module's declarations.\n * @internal\n */\nexport interface WorkerProcess {\n  readonly stdin: { write(chunk: string): unknown; end(): unknown } | null;\n  readonly stdout: { on(event: 'data', listener: (chunk: Uint8Array) => void): unknown } | null;\n  readonly stderr: { on(event: 'data', listener: (chunk: Uint8Array) => void): unknown } | null;\n  on(event: 'error', listener: (err: Error) => void): unknown;\n  on(event: 'close', listener: (code: number | null, signal: string | null) => void): unknown;\n  kill(signal: 'SIGKILL'): unknown;\n}\n\n/** Launches a worker process. The default is `node:child_process` `spawn`. @internal */\nexport type WorkerLauncher = (\n  command: string,\n  args: readonly string[],\n  options: { cwd?: string; stdio: ['pipe', 'pipe', 'pipe']; windowsHide: boolean },\n) => WorkerProcess;\n\n/**\n * Run an untrusted NDJSON worker. Never uses a shell.\n *\n * The timeout starts when the launcher returns, so it includes the worker's own start-up time.\n * `opts.spawn` replaces the process launcher; tests use it to drive the exit paths without a real\n * process. @internal\n */\nexport async function runBackendWorker(\n  argv: readonly string[],\n  request: BackendRequest,\n  opts: { timeoutMs?: number; cwd?: string; spawn?: WorkerLauncher } = {},\n): Promise<BackendResponse> {\n  if (argv.length === 0) {\n    return { ok: false, candidates: [], error: 'empty argv' };\n  }\n  const timeoutMs = opts.timeoutMs ?? request.budgetMs;\n  const launch: WorkerLauncher = opts.spawn ?? spawn;\n  const child = launch(argv[0]!, argv.slice(1), {\n    cwd: opts.cwd,\n    stdio: ['pipe', 'pipe', 'pipe'],\n    windowsHide: true,\n  });\n\n  const chunks: Uint8Array[] = [];\n  const errChunks: Uint8Array[] = [];\n  child.stdout?.on('data', (d) => chunks.push(d));\n  child.stderr?.on('data', (d) => errChunks.push(d));\n\n  const killer = setTimeout(() => {\n    child.kill('SIGKILL');\n  }, timeoutMs);\n\n  const stdinPayload = `${JSON.stringify(request)}\\n`;\n  child.stdin?.write(stdinPayload);\n  child.stdin?.end();\n\n  const exit = await new Promise<{ code: number | null; signal: string | null; spawnError?: string }>((resolve) => {\n    child.on('error', (err) => resolve({ code: 1, signal: null, spawnError: err.message }));\n    child.on('close', (code, signal) => resolve({ code, signal }));\n  });\n  clearTimeout(killer);\n\n  if (exit.signal === 'SIGKILL') {\n    return { ok: false, candidates: [], error: `worker timed out after ${timeoutMs}ms` };\n  }\n  if (exit.code !== 0) {\n    const err = exit.spawnError ?? Buffer.concat(errChunks).toString('utf8').trim();\n    return {\n      ok: false,\n      candidates: [],\n      error: err || `worker exited ${exit.code}`,\n    };\n  }\n\n  const text = Buffer.concat(chunks).toString('utf8');\n  const candidates: BackendCandidate[] = [];\n  for (const line of text.split(/\\r?\\n/)) {\n    if (line.trim().length === 0) continue;\n    const c = parseLine(line);\n    if (!c) {\n      return { ok: false, candidates: [], error: `malformed NDJSON line: ${line.slice(0, 200)}` };\n    }\n    candidates.push(c);\n  }\n  return { ok: true, candidates };\n}\n"]}

package/dist/composition/probe/candidate-store.d.ts

@@ -16,6 +16,7 @@ export declare function canTransition(from: ProbeCandidateStatus | 'none', to: P
 export declare function applyStatus(record: ProbeCandidateRecord, to: ProbeCandidateStatus, reason: string, runId: string, at?: string): ProbeCandidateRecord;
 /** Pipeline order index; terminals sort last. @internal */
 export declare function statusRank(s: ProbeCandidateStatus): number;
+/** The in-memory store of probe candidate records and their rejections. */
 export declare class ProbeCandidateStore {
     private readonly byId;
     private readonly rejections;

package/dist/composition/probe/candidate-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"candidate-store.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/candidate-store.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,oBAAoB,EACpB,oBAAoB,EACpB,oBAAoB,EAErB,MAAM,YAAY,CAAC;AAgDpB,+DAA+D;AAC/D,wBAAgB,aAAa,CAC3B,IAAI,EAAE,oBAAoB,GAAG,MAAM,EACnC,EAAE,EAAE,oBAAoB,GACvB,OAAO,CAET;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,oBAAoB,EAC5B,EAAE,EAAE,oBAAoB,EACxB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,EAAE,SAA2B,GAC5B,oBAAoB,CAgBtB;AAED,2DAA2D;AAC3D,wBAAgB,UAAU,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM,CAG1D;AAED,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA2C;IAChE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA8B;IAEzD,yEAAyE;IACzE,GAAG,CAAC,MAAM,EAAE,oBAAoB,GAAG,IAAI,CAKtC;IAED,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS,CAEhD;IAED,6CAA6C;IAC7C,OAAO,CAAC,MAAM,EAAE,oBAAoB,GAAG,IAAI,CAE1C;IAED,GAAG,IAAI,SAAS,oBAAoB,EAAE,CAErC;IAED,iBAAiB,CAAC,GAAG,EAAE,oBAAoB,GAAG,IAAI,CAEjD;IAED,sFAAsF;IACtF,UAAU,CAAC,gBAAgB,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAI7D;IAED,aAAa,IAAI,SAAS,oBAAoB,EAAE,CAE/C;CACF"}
+{"version":3,"file":"candidate-store.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/candidate-store.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EACV,oBAAoB,EACpB,oBAAoB,EACpB,oBAAoB,EAErB,MAAM,YAAY,CAAC;AAgDpB,+DAA+D;AAC/D,wBAAgB,aAAa,CAC3B,IAAI,EAAE,oBAAoB,GAAG,MAAM,EACnC,EAAE,EAAE,oBAAoB,GACvB,OAAO,CAET;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,oBAAoB,EAC5B,EAAE,EAAE,oBAAoB,EACxB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,EAAE,SAA2B,GAC5B,oBAAoB,CAgBtB;AAED,2DAA2D;AAC3D,wBAAgB,UAAU,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM,CAG1D;AAED,2EAA2E;AAC3E,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAA2C;IAChE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA8B;IAEzD,yEAAyE;IACzE,GAAG,CAAC,MAAM,EAAE,oBAAoB,GAAG,IAAI,CAKtC;IAED,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS,CAEhD;IAED,6CAA6C;IAC7C,OAAO,CAAC,MAAM,EAAE,oBAAoB,GAAG,IAAI,CAE1C;IAED,GAAG,IAAI,SAAS,oBAAoB,EAAE,CAErC;IAED,iBAAiB,CAAC,GAAG,EAAE,oBAAoB,GAAG,IAAI,CAEjD;IAED,sFAAsF;IACtF,UAAU,CAAC,gBAAgB,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAI7D;IAED,aAAa,IAAI,SAAS,oBAAoB,EAAE,CAE/C;CACF"}

package/dist/composition/probe/candidate-store.js

@@ -76,6 +76,7 @@ export function statusRank(s) {
     const i = ORDER.indexOf(s);
     return i >= 0 ? i : -1;
 }
+/** The in-memory store of probe candidate records and their rejections. */
 export class ProbeCandidateStore {
     byId = new Map();
     rejections = [];

package/dist/composition/probe/candidate-store.js.map

@@ -1 +1 @@
-{"version":3,"file":"candidate-store.js","sourceRoot":"","sources":["../../../src/composition/probe/candidate-store.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AASH,MAAM,KAAK,GAAoC;IAC7C,WAAW;IACX,oBAAoB;IACpB,iBAAiB;IACjB,mBAAmB;IACnB,wBAAwB;IACxB,wBAAwB;CACzB,CAAC;AAEF,MAAM,QAAQ,GAAsC,IAAI,GAAG,CAAC;IAC1D,UAAU;IACV,WAAW;IACX,kBAAkB;IAClB,uBAAuB;IACvB,wBAAwB;CACzB,CAAC,CAAC;AAEH,MAAM,OAAO,GACX,IAAI,GAAG,CAAC;IACN,CAAC,MAAM,EAAE,IAAI,GAAG,CAAuB,CAAC,WAAW,CAAC,CAAC,CAAC;IACtD,CAAC,WAAW,EAAE,IAAI,GAAG,CAAuB,CAAC,oBAAoB,EAAE,UAAU,CAAC,CAAC,CAAC;IAChF;QACE,oBAAoB;QACpB,IAAI,GAAG,CAAuB;YAC5B,iBAAiB;YACjB,kBAAkB;YAClB,uBAAuB;YACvB,UAAU;SACX,CAAC;KACH;IACD;QACE,iBAAiB;QACjB,IAAI,GAAG,CAAuB,CAAC,mBAAmB,EAAE,uBAAuB,EAAE,UAAU,CAAC,CAAC;KAC1F;IACD;QACE,mBAAmB;QACnB,IAAI,GAAG,CAAuB;YAC5B,wBAAwB;YACxB,WAAW;YACX,UAAU;YACV,kBAAkB;SACnB,CAAC;KACH;IACD,CAAC,wBAAwB,EAAE,IAAI,GAAG,CAAuB,CAAC,wBAAwB,CAAC,CAAC,CAAC;CACtF,CAAC,CAAC;AAEL,+DAA+D;AAC/D,MAAM,UAAU,aAAa,CAC3B,IAAmC,EACnC,EAAwB;IAExB,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,MAA4B,EAC5B,EAAwB,EACxB,MAAc,EACd,KAAa,EACb,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAE7B,MAAM,IAAI,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;IACxE,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,wBAAwB,EAAE,CAAC;QAC9E,MAAM,IAAI,UAAU,CAClB,iCAAiC,MAAM,CAAC,MAAM,2BAA2B,EAAE,GAAG,CAC/E,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CAAC,mCAAmC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,KAAK,GAAgB,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3D,OAAO;QACL,GAAG,MAAM;QACT,MAAM,EAAE,EAAE;QACV,aAAa,EAAE,CAAC,GAAG,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,UAAU,CAAC,CAAuB;IAChD,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,MAAM,OAAO,mBAAmB;IACb,IAAI,GAAG,IAAI,GAAG,EAAgC,CAAC;IAC/C,UAAU,GAA2B,EAAE,CAAC;IAEzD,yEAAyE;IACzE,GAAG,CAAC,MAA4B;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,UAAU,CAAC,sCAAsC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,6CAA6C;IAC7C,OAAO,CAAC,MAA4B;QAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,GAAG;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,iBAAiB,CAAC,GAAyB;QACzC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,sFAAsF;IACtF,UAAU,CAAC,gBAAwB,EAAE,OAAe;QAClD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CACzB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,gBAAgB,KAAK,gBAAgB,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,CACpF,CAAC;IACJ,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;CACF","sourcesContent":["/**\n * Append-only Product B candidate store + rejection registry.\n * Product A adjudications stay in `adjudication.ts`.\n *\n * @module composition/probe/candidate-store\n */\n\nimport type {\n  ProbeCandidateRecord,\n  ProbeCandidateStatus,\n  ProbeRejectionRecord,\n  StatusEvent,\n} from './types.js';\n\nconst ORDER: readonly ProbeCandidateStatus[] = [\n  'generated',\n  'structurally-valid',\n  'empirically-fit',\n  'heldout-supported',\n  'falsification-survivor',\n  'expert-review-required',\n];\n\nconst TERMINAL: ReadonlySet<ProbeCandidateStatus> = new Set([\n  'rejected',\n  'falsified',\n  'equivalent-known',\n  'insufficient-evidence',\n  'expert-review-required',\n]);\n\nconst ALLOWED: ReadonlyMap<ProbeCandidateStatus | 'none', ReadonlySet<ProbeCandidateStatus>> =\n  new Map([\n    ['none', new Set<ProbeCandidateStatus>(['generated'])],\n    ['generated', new Set<ProbeCandidateStatus>(['structurally-valid', 'rejected'])],\n    [\n      'structurally-valid',\n      new Set<ProbeCandidateStatus>([\n        'empirically-fit',\n        'equivalent-known',\n        'insufficient-evidence',\n        'rejected',\n      ]),\n    ],\n    [\n      'empirically-fit',\n      new Set<ProbeCandidateStatus>(['heldout-supported', 'insufficient-evidence', 'rejected']),\n    ],\n    [\n      'heldout-supported',\n      new Set<ProbeCandidateStatus>([\n        'falsification-survivor',\n        'falsified',\n        'rejected',\n        'equivalent-known',\n      ]),\n    ],\n    ['falsification-survivor', new Set<ProbeCandidateStatus>(['expert-review-required'])],\n  ]);\n\n/** True when `to` is a legal successor of `from`. @internal */\nexport function canTransition(\n  from: ProbeCandidateStatus | 'none',\n  to: ProbeCandidateStatus,\n): boolean {\n  return ALLOWED.get(from)?.has(to) === true;\n}\n\n/**\n * Append a status event. Throws if the transition skips a required gate.\n * Current `status` is always the last event's `to`.\n *\n * @internal\n */\nexport function applyStatus(\n  record: ProbeCandidateRecord,\n  to: ProbeCandidateStatus,\n  reason: string,\n  runId: string,\n  at = new Date().toISOString(),\n): ProbeCandidateRecord {\n  const from = record.statusHistory.length === 0 ? 'none' : record.status;\n  if (TERMINAL.has(record.status) && record.status !== 'falsification-survivor') {\n    throw new RangeError(\n      `applyStatus: terminal status '${record.status}' cannot transition to '${to}'`,\n    );\n  }\n  if (!canTransition(from, to)) {\n    throw new RangeError(`applyStatus: illegal transition ${String(from)} → ${to}`);\n  }\n  const event: StatusEvent = { at, from, to, reason, runId };\n  return {\n    ...record,\n    status: to,\n    statusHistory: [...record.statusHistory, event],\n  };\n}\n\n/** Pipeline order index; terminals sort last. @internal */\nexport function statusRank(s: ProbeCandidateStatus): number {\n  const i = ORDER.indexOf(s);\n  return i >= 0 ? i : -1;\n}\n\nexport class ProbeCandidateStore {\n  private readonly byId = new Map<string, ProbeCandidateRecord>();\n  private readonly rejections: ProbeRejectionRecord[] = [];\n\n  /** Insert a freshly generated record (must be `generated`). @internal */\n  put(record: ProbeCandidateRecord): void {\n    if (this.byId.has(record.id)) {\n      throw new RangeError(`ProbeCandidateStore: duplicate id '${record.id}'`);\n    }\n    this.byId.set(record.id, record);\n  }\n\n  get(id: string): ProbeCandidateRecord | undefined {\n    return this.byId.get(id);\n  }\n\n  /** Replace after `applyStatus`. @internal */\n  replace(record: ProbeCandidateRecord): void {\n    this.byId.set(record.id, record);\n  }\n\n  all(): readonly ProbeCandidateRecord[] {\n    return [...this.byId.values()];\n  }\n\n  rememberRejection(rec: ProbeRejectionRecord): void {\n    this.rejections.push(rec);\n  }\n\n  /** True when an equivalent fingerprint was rejected in the same context. @internal */\n  isRejected(canonicalAstHash: string, context: string): boolean {\n    return this.rejections.some(\n      (r) => r.fingerprint.canonicalAstHash === canonicalAstHash && r.context === context,\n    );\n  }\n\n  rejectionList(): readonly ProbeRejectionRecord[] {\n    return this.rejections;\n  }\n}\n"]}
+{"version":3,"file":"candidate-store.js","sourceRoot":"","sources":["../../../src/composition/probe/candidate-store.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AASH,MAAM,KAAK,GAAoC;IAC7C,WAAW;IACX,oBAAoB;IACpB,iBAAiB;IACjB,mBAAmB;IACnB,wBAAwB;IACxB,wBAAwB;CACzB,CAAC;AAEF,MAAM,QAAQ,GAAsC,IAAI,GAAG,CAAC;IAC1D,UAAU;IACV,WAAW;IACX,kBAAkB;IAClB,uBAAuB;IACvB,wBAAwB;CACzB,CAAC,CAAC;AAEH,MAAM,OAAO,GACX,IAAI,GAAG,CAAC;IACN,CAAC,MAAM,EAAE,IAAI,GAAG,CAAuB,CAAC,WAAW,CAAC,CAAC,CAAC;IACtD,CAAC,WAAW,EAAE,IAAI,GAAG,CAAuB,CAAC,oBAAoB,EAAE,UAAU,CAAC,CAAC,CAAC;IAChF;QACE,oBAAoB;QACpB,IAAI,GAAG,CAAuB;YAC5B,iBAAiB;YACjB,kBAAkB;YAClB,uBAAuB;YACvB,UAAU;SACX,CAAC;KACH;IACD;QACE,iBAAiB;QACjB,IAAI,GAAG,CAAuB,CAAC,mBAAmB,EAAE,uBAAuB,EAAE,UAAU,CAAC,CAAC;KAC1F;IACD;QACE,mBAAmB;QACnB,IAAI,GAAG,CAAuB;YAC5B,wBAAwB;YACxB,WAAW;YACX,UAAU;YACV,kBAAkB;SACnB,CAAC;KACH;IACD,CAAC,wBAAwB,EAAE,IAAI,GAAG,CAAuB,CAAC,wBAAwB,CAAC,CAAC,CAAC;CACtF,CAAC,CAAC;AAEL,+DAA+D;AAC/D,MAAM,UAAU,aAAa,CAC3B,IAAmC,EACnC,EAAwB;IAExB,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,MAA4B,EAC5B,EAAwB,EACxB,MAAc,EACd,KAAa,EACb,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAE7B,MAAM,IAAI,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;IACxE,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,wBAAwB,EAAE,CAAC;QAC9E,MAAM,IAAI,UAAU,CAClB,iCAAiC,MAAM,CAAC,MAAM,2BAA2B,EAAE,GAAG,CAC/E,CAAC;IACJ,CAAC;IACD,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,UAAU,CAAC,mCAAmC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,KAAK,GAAgB,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC3D,OAAO;QACL,GAAG,MAAM;QACT,MAAM,EAAE,EAAE;QACV,aAAa,EAAE,CAAC,GAAG,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,UAAU,CAAC,CAAuB;IAChD,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,2EAA2E;AAC3E,MAAM,OAAO,mBAAmB;IACb,IAAI,GAAG,IAAI,GAAG,EAAgC,CAAC;IAC/C,UAAU,GAA2B,EAAE,CAAC;IAEzD,yEAAyE;IACzE,GAAG,CAAC,MAA4B;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,UAAU,CAAC,sCAAsC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3E,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,GAAG,CAAC,EAAU;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAED,6CAA6C;IAC7C,OAAO,CAAC,MAA4B;QAClC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED,GAAG;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,iBAAiB,CAAC,GAAyB;QACzC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,sFAAsF;IACtF,UAAU,CAAC,gBAAwB,EAAE,OAAe;QAClD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CACzB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,gBAAgB,KAAK,gBAAgB,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,CACpF,CAAC;IACJ,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;CACF","sourcesContent":["/**\n * Append-only Product B candidate store + rejection registry.\n * Product A adjudications stay in `adjudication.ts`.\n *\n * @module composition/probe/candidate-store\n */\n\nimport type {\n  ProbeCandidateRecord,\n  ProbeCandidateStatus,\n  ProbeRejectionRecord,\n  StatusEvent,\n} from './types.js';\n\nconst ORDER: readonly ProbeCandidateStatus[] = [\n  'generated',\n  'structurally-valid',\n  'empirically-fit',\n  'heldout-supported',\n  'falsification-survivor',\n  'expert-review-required',\n];\n\nconst TERMINAL: ReadonlySet<ProbeCandidateStatus> = new Set([\n  'rejected',\n  'falsified',\n  'equivalent-known',\n  'insufficient-evidence',\n  'expert-review-required',\n]);\n\nconst ALLOWED: ReadonlyMap<ProbeCandidateStatus | 'none', ReadonlySet<ProbeCandidateStatus>> =\n  new Map([\n    ['none', new Set<ProbeCandidateStatus>(['generated'])],\n    ['generated', new Set<ProbeCandidateStatus>(['structurally-valid', 'rejected'])],\n    [\n      'structurally-valid',\n      new Set<ProbeCandidateStatus>([\n        'empirically-fit',\n        'equivalent-known',\n        'insufficient-evidence',\n        'rejected',\n      ]),\n    ],\n    [\n      'empirically-fit',\n      new Set<ProbeCandidateStatus>(['heldout-supported', 'insufficient-evidence', 'rejected']),\n    ],\n    [\n      'heldout-supported',\n      new Set<ProbeCandidateStatus>([\n        'falsification-survivor',\n        'falsified',\n        'rejected',\n        'equivalent-known',\n      ]),\n    ],\n    ['falsification-survivor', new Set<ProbeCandidateStatus>(['expert-review-required'])],\n  ]);\n\n/** True when `to` is a legal successor of `from`. @internal */\nexport function canTransition(\n  from: ProbeCandidateStatus | 'none',\n  to: ProbeCandidateStatus,\n): boolean {\n  return ALLOWED.get(from)?.has(to) === true;\n}\n\n/**\n * Append a status event. Throws if the transition skips a required gate.\n * Current `status` is always the last event's `to`.\n *\n * @internal\n */\nexport function applyStatus(\n  record: ProbeCandidateRecord,\n  to: ProbeCandidateStatus,\n  reason: string,\n  runId: string,\n  at = new Date().toISOString(),\n): ProbeCandidateRecord {\n  const from = record.statusHistory.length === 0 ? 'none' : record.status;\n  if (TERMINAL.has(record.status) && record.status !== 'falsification-survivor') {\n    throw new RangeError(\n      `applyStatus: terminal status '${record.status}' cannot transition to '${to}'`,\n    );\n  }\n  if (!canTransition(from, to)) {\n    throw new RangeError(`applyStatus: illegal transition ${String(from)} → ${to}`);\n  }\n  const event: StatusEvent = { at, from, to, reason, runId };\n  return {\n    ...record,\n    status: to,\n    statusHistory: [...record.statusHistory, event],\n  };\n}\n\n/** Pipeline order index; terminals sort last. @internal */\nexport function statusRank(s: ProbeCandidateStatus): number {\n  const i = ORDER.indexOf(s);\n  return i >= 0 ? i : -1;\n}\n\n/** The in-memory store of probe candidate records and their rejections. */\nexport class ProbeCandidateStore {\n  private readonly byId = new Map<string, ProbeCandidateRecord>();\n  private readonly rejections: ProbeRejectionRecord[] = [];\n\n  /** Insert a freshly generated record (must be `generated`). @internal */\n  put(record: ProbeCandidateRecord): void {\n    if (this.byId.has(record.id)) {\n      throw new RangeError(`ProbeCandidateStore: duplicate id '${record.id}'`);\n    }\n    this.byId.set(record.id, record);\n  }\n\n  get(id: string): ProbeCandidateRecord | undefined {\n    return this.byId.get(id);\n  }\n\n  /** Replace after `applyStatus`. @internal */\n  replace(record: ProbeCandidateRecord): void {\n    this.byId.set(record.id, record);\n  }\n\n  all(): readonly ProbeCandidateRecord[] {\n    return [...this.byId.values()];\n  }\n\n  rememberRejection(rec: ProbeRejectionRecord): void {\n    this.rejections.push(rec);\n  }\n\n  /** True when an equivalent fingerprint was rejected in the same context. @internal */\n  isRejected(canonicalAstHash: string, context: string): boolean {\n    return this.rejections.some(\n      (r) => r.fingerprint.canonicalAstHash === canonicalAstHash && r.context === context,\n    );\n  }\n\n  rejectionList(): readonly ProbeRejectionRecord[] {\n    return this.rejections;\n  }\n}\n"]}

package/dist/composition/probe/corpus.d.ts

@@ -5,10 +5,12 @@
  * @module composition/probe/corpus
  */
 import type { ExprNode } from '../../dimensional/ast-types.js';
+/** One corpus entry that matches an expression, with the layer that holds it. */
 export interface CorpusMatch {
     readonly id: string;
     readonly layer: 'canonical' | 'bridge';
 }
+/** The result of comparing one expression with the in-repo corpus. */
 export interface CorpusComparisonResult {
     readonly corpusId: string;
     readonly corpusVersion: string;
@@ -16,8 +18,8 @@ export interface CorpusComparisonResult {
     readonly algebraicMatches: readonly CorpusMatch[];
     readonly searchedAt: string;
 }
-/** Compare an expression to the in-repo L- and B-layers. @internal */
-export declare function compareToCorpus(expr: ExprNode, corpusVersion: string): CorpusComparisonResult;
+/** Compare an expression to the in-repo L- and B-layers. `searchedAt` is the run's pinned time; default now. @internal */
+export declare function compareToCorpus(expr: ExprNode, corpusVersion: string, searchedAt?: string): CorpusComparisonResult;
 /**
  * Compare a FITTED prefactor with the prefactor of each corpus relation the
  * candidate is algebraically equivalent to. `normalForm` matches up to a

package/dist/composition/probe/corpus.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"corpus.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/corpus.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAW/D,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,QAAQ,CAAC;CACxC;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,WAAW,EAAE,CAAC;IAClD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAID,sEAAsE;AACtE,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,GAAG,sBAAsB,CA4B7F;AAgDD;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,sBAAsB,EAC9B,SAAS,EAAE,QAAQ,EACnB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,GACrB,MAAM,EAAE,CA0CV;AAED,oDAAoD;AACpD,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAM5E"}
+{"version":3,"file":"corpus.d.ts","sourceRoot":"","sources":["../../../src/composition/probe/corpus.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gCAAgC,CAAC;AAW/D,iFAAiF;AACjF,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,WAAW,GAAG,QAAQ,CAAC;CACxC;AAED,sEAAsE;AACtE,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;IAC9C,QAAQ,CAAC,gBAAgB,EAAE,SAAS,WAAW,EAAE,CAAC;IAClD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAID,0HAA0H;AAC1H,wBAAgB,eAAe,CAC7B,IAAI,EAAE,QAAQ,EACd,aAAa,EAAE,MAAM,EACrB,UAAU,GAAE,MAAiC,GAC5C,sBAAsB,CA4BxB;AAgDD;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,sBAAsB,EAC9B,SAAS,EAAE,QAAQ,EACnB,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,GACrB,MAAM,EAAE,CA0CV;AAED,oDAAoD;AACpD,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAM5E"}

package/dist/composition/probe/corpus.js

@@ -13,8 +13,8 @@ import { equals } from '../../dimensional/algebra.js';
 import { canonicalPrefactor } from '../canonical-prefactors.js';
 import { constantRatio, fixedPoint } from '../../canonical/fixed-points.js';
 const CORPUS_ID = 'upt-l-layer+b-layer';
-/** Compare an expression to the in-repo L- and B-layers. @internal */
-export function compareToCorpus(expr, corpusVersion) {
+/** Compare an expression to the in-repo L- and B-layers. `searchedAt` is the run's pinned time; default now. @internal */
+export function compareToCorpus(expr, corpusVersion, searchedAt = new Date().toISOString()) {
     const form = normalForm(expr);
     const algebraic = [];
     for (const ce of CANONICAL_EQUATIONS) {
@@ -41,7 +41,7 @@ export function compareToCorpus(expr, corpusVersion) {
         corpusVersion,
         exactMatches: [],
         algebraicMatches: algebraic,
-        searchedAt: new Date().toISOString(),
+        searchedAt,
     };
 }
 /**