gdp-wired 0.15.0 → 0.17.0

package/README.md

@@ -69,6 +69,10 @@ All of these are proven automatically, and each proof is also a Lean theorem:
   machine runs as, with each guard and action it names given again in gdp-wired's terms, and `conforms(chart, machine,
   createActor)` drives XState's own actor and the compiled rule with the same random events, comparing every state and
   context; what a chart can't run the same way is refused when built, with the reason (`examples/xstate.ts`).
+- **What nobody stated, looked for when the prover alone stops**: where `proveRule` or `proveSteps` doesn't prove the laws
+  and no run breaks them, it looks for lemmas about the rule's recurrences and lists (`discover`) and then invariants
+  (`inferLaws`), within 10 s (`{search: {ms}}`; `{search: false}`, the prover alone); the verdict's `found` holds what
+  proved them, as laws and lemmas with the source to paste.
 - **Invariants nobody wrote** (`gdp-wired/infer`): `inferLaws(rule, laws)` proves a law that holds but isn't inductive
   alone, with the laws it finds (bounds, sums and differences over the state, the same where a flag or a choice holds
   one value, and laws about every key of a map), each proven by the kernel with yours and handed back as the
@@ -116,6 +120,7 @@ sound.
 | Part | Trusted? | What it does |
 | --- | --- | --- |
 | `kernel/kernel.ts`, `core/check.ts` | **Yes** | Turns a rule and its laws into goals, and checks a proof tree for each: case splits on linear facts, then a linear refutation at each leaf |
+| `kernel/cyclic.ts` | **Yes** | Cyclic proofs: builds each node's goals (its own, and for each node it uses, that node's hypotheses and that the rank drops) and checks each tree with kernel.ts's check. Its twin is `lean-kernel/Cyclic.lean` (`cyclic_sound`) |
 | `kernel/prove.ts` | No | Finds the proof trees. If it's wrong, the kernel rejects the tree |
 | `lean-kernel/` | Optional | The kernel's twin in Lean 4.34.0, every rule proven sound there with the standard axioms only. The exporter sends the kernel's real trees; tampered ones compute to false |
 | `research/search/`, `research/synth/`, `research/hw/` | No | The GPU searches for breaking runs, and invariant and rank synthesis. Every hit is replayed or proven before it counts |
@@ -246,6 +251,13 @@ const soon = retry.law('the next try is at most 64 after the last request', ({ne
   `Acct.set(k, value)`, `Acct.each(k => value)`) and `.items({Queue: Job})` (`push`, `pop`, `set`, `insertAt`,
   `removeAt`, `apply`, `has`, `within`, `increasing(by)`), one map per variable of the kind; `rule.decode` reads them back
   as objects and arrays.
+- **Sequences a request carries** (`.carriesSeq('Path')`, and tables of them, `.carriesSeqs('Paths')`): a sequence of
+  naturals as positions and a length, `Path.at(i)`, `Path.len`, a table's row `Paths.row(r)`; `A.prefixOf(B)`,
+  `startsWith`, `equals`, `extends(B, k)`, `has(x)`, each a condition about every position below a length, so laws about
+  prefixes of paths need no induction or lemma. The request gives an array of naturals (interned names), a table an
+  array of them. `everyBelow(n, k => ...)` checks bookkeeping a request carries row by row (where each grant went). A
+  condition about every row of a table can't compare the rows' sequences (that is two keys at once); compare a row at a
+  named row, a witness, instead (`examples/scopes.ts`: pi-fabric's path scopes, covering, attenuation and normalization).
 - **Lists a request carries** (`.carriesList('Lines', Line, folds, lemmas)`): the items one carried map per variable of
   the kind, the length `Lines.len`, each fold (`{total: {from: 0, step: (acc, line) => acc.plus(line.amount)}}`) a
   carried map of its running values whose equations every request is assumed to meet (the encoding computes them from the

package/dist/core/chart.js

@@ -256,9 +256,9 @@ export class Chart {
                     missed.push({ name, law: r.law(`${name} is never reached`, (env) => env[reg.field].is(l).not()) });
             }
         const proven = (v) => v.proven && v.checked;
-        const allMissed = missed.length > 0 && proven(proveRule(r, [...this.chartLaws(), ...missed.map(x => x.law)]));
+        const allMissed = missed.length > 0 && proven(proveRule(r, [...this.chartLaws(), ...missed.map(x => x.law)], { search: false }));
         for (const x of missed)
-            reached[x.name] = allMissed || proven(proveRule(r, [...this.chartLaws(), x.law])) ? 'unreachable' : 'unknown';
+            reached[x.name] = allMissed || proven(proveRule(r, [...this.chartLaws(), x.law], { search: false })) ? 'unreachable' : 'unknown';
         // A way out is a transition to a state: an internal one stays where it is.
         const stuck = regions.flatMap(reg => reg.leaves.filter(l => !reg.finals.has(l) && !placed.some(t => t.to !== undefined && t.region === reg.name && t.sources.includes(l))).map(l => label(reg, l)));
         // Pairs as specific as each other, on one event, from a state they share: proven never both enabled, all at once,
@@ -270,9 +270,9 @@ export class Chart {
             pairs.push({ t, u, law: r.stepLaw(`transitions ${t.order} and ${u.order} on ${t.event} are never both enabled`, (env) => all(env[`on${i}`], env[`on${j}`]).not()) });
         }));
         const ambiguous = [];
-        if (pairs.length && !proven(proveSteps(r, this.chartLaws(), pairs.map(x => x.law))))
+        if (pairs.length && !proven(proveSteps(r, this.chartLaws(), pairs.map(x => x.law), { search: false })))
             for (const { t, u, law } of pairs) {
-                const v = proveSteps(r, this.chartLaws(), [law]);
+                const v = proveSteps(r, this.chartLaws(), [law], { search: false });
                 if (!proven(v))
                     ambiguous.push({ event: t.event, transitions: [t.order, u.order], verdict: v });
             }

package/dist/core/cyclic.d.ts

@@ -0,0 +1,51 @@
+import type { C, E, Law, Machine } from './machine.js';
+import type { Fold, Instances } from '../kernel/kernel.js';
+import { type CNode, type Cyclic, type Fact, type Use } from '../kernel/cyclic.js';
+export type NodeSpec = Omit<CNode, 'uses' | 'main'> & {
+    uses: Omit<Use, 'premises' | 'descent'>[];
+};
+export type CyclicVerdict = {
+    proven: true;
+    checked: boolean;
+    proof: Cyclic;
+    why?: string;
+} | {
+    proven: false;
+    checked: false;
+    node: string;
+    goal: string;
+    stuck: string;
+};
+export declare const pair: (u: E, key: E) => E;
+export declare function proveCyclic(facts: Fact[], specs: NodeSpec[]): CyclicVerdict;
+export type RecurCase = {
+    name: string;
+    args: string[];
+    zero: E;
+    next: E;
+    lemmas: {
+        name: string;
+        holds: C;
+    }[];
+    between: {
+        name: string;
+        holds: C;
+    }[];
+    facts: Law[];
+};
+export declare function recurNodes(r: RecurCase): {
+    facts: Fact[];
+    specs: NodeSpec[];
+};
+export declare const cyclicMachine: (m: Machine, laws?: Law[]) => boolean;
+export declare function machineNodes(m: Machine, laws: Law[], instances: Record<string, Instances>): {
+    facts: Fact[];
+    specs: NodeSpec[];
+};
+export declare function foldNodes(f: Fold, laws: Law[]): {
+    facts: Fact[];
+    specs: NodeSpec[];
+};
+export declare const cyclicOn: () => boolean;
+export declare const quietly: <T>(f: () => T) => T;
+export declare function crossCyclic(kind: string, name: string, usual: boolean, run: () => CyclicVerdict, usualMs?: number): void;

package/dist/core/cyclic.js

@@ -0,0 +1,295 @@
+import { substC, substE } from "../kernel/kernel.js";
+import { descentGoal, mainGoal, premiseGoal, refuseCyclic } from "../kernel/cyclic.js";
+import { cellProducts, grow } from "../kernel/prove.js";
+const v = (name) => ({ op: 'var', name });
+const k = (value) => ({ op: 'const', value });
+const add = (a, b) => ({ op: 'add', a, b });
+const less1 = (a) => ({ op: 'sub', a, b: k(1) });
+const get = (map, key) => ({ op: 'get', map, key });
+const le = (a, b) => ({ op: '<=', a, b });
+const eq = (a, b) => ({ op: '=', a, b });
+const and = (...xs) => (xs.length === 1 ? xs[0] : { op: 'and', xs });
+const implies = (a, b) => ({ op: 'or', xs: [{ op: 'not', x: a }, b] });
+const yes = le(k(0), k(0));
+const vars = (s) => ({ vars: s, maps: {}, flags: {} });
+// A map's cell at time u and key k, in the run's one map over both: u + k·Ω, where Ω is above the run's length T, so
+// that no two (u, k) with u <= T meet (u < Ω). Linear in u, and two keys' cells differ by (k − k')·Ω.
+const omega = v('O$');
+export const pair = (u, key) => add(u, { op: 'prod', a: key, b: omega });
+// Every goal grown, then the whole checked by the kernel.
+export function proveCyclic(facts, specs) {
+    const nodes = [];
+    const grown = (g, node) => {
+        const was = cellProducts.on;
+        cellProducts.on = true;
+        let o;
+        try {
+            o = grow(g);
+        }
+        finally {
+            cellProducts.on = was;
+        }
+        return 'tree' in o ? o.tree : { proven: false, checked: false, node, goal: g.name, stuck: o.stuck };
+    };
+    for (const n of specs) {
+        const main = grown(mainGoal(facts, specs, n), n.name);
+        if ('proven' in main)
+            return main;
+        const uses = [];
+        for (const u of n.uses) {
+            const m = specs[u.node];
+            if (!m)
+                return { proven: false, checked: false, node: n.name, goal: `use of node ${u.node}`, stuck: 'no such node' };
+            const premises = [];
+            for (const [i, c] of m.hyps.entries()) {
+                const t = grown(premiseGoal(facts, n, u, c, i), n.name);
+                if ('proven' in t)
+                    return t;
+                premises.push(t);
+            }
+            const descent = grown(descentGoal(facts, n, u, m), n.name);
+            if ('proven' in descent)
+                return descent;
+            uses.push({ ...u, premises, descent });
+        }
+        nodes.push({ ...n, uses, main });
+    }
+    const proof = { facts, nodes }, why = refuseCyclic(proof);
+    return { proven: true, checked: why === undefined, proof, ...(why ? { why } : {}) };
+}
+// The facts of a machine's functions (laws about every key of them), as cyclic facts.
+const factOf = (l) => ({ name: l.name, keys: [...(l.forall ? [l.forall] : []), ...(l.keys ?? [])], holds: l.holds });
+export function recurNodes(r) {
+    const f = `${r.name}$`, x = v('x'), y = v('y'), kk = v('k$');
+    const facts = [
+        { name: `${r.name}(0)`, keys: [], holds: eq(get(f, k(0)), r.zero) },
+        { name: `${r.name}(x + 1)`, keys: ['k$'], holds: eq(get(f, add(kk, k(1))), substE(r.next, vars({ x: kk, prev: get(f, kk) }))) },
+        ...r.facts.map(factOf),
+    ];
+    const at = (t) => vars({ x: t, fx: get(f, t) });
+    const n = r.lemmas.length;
+    const lemmaUses = (to, guard) => r.lemmas.map((_, j) => ({ node: j, subst: { x: to }, guard }));
+    const specs = r.lemmas.map(l => ({
+        name: `${r.name}: ${l.name}`, hyps: [], concl: substC(l.holds, at(x)), rank: [k(0), x],
+        insts: [{ fact: 0, at: [] }, { fact: 1, at: [less1(x)] }], uses: lemmaUses(less1(x), le(k(1), x)),
+    }));
+    // A law between two points: for every x <= y, by induction on y from x, the lemmas at x, at y and at y − 1.
+    for (const b of r.between)
+        specs.push({
+            name: `${r.name}: ${b.name}`, hyps: [], rank: [k(1), y],
+            concl: implies(le(x, y), substC(b.holds, vars({ x, fx: get(f, x), y, fy: get(f, y) }))),
+            insts: [{ fact: 1, at: [less1(y)] }],
+            uses: [...r.between.map((_, j) => ({ node: n + j, subst: { y: less1(y) }, guard: le(add(x, k(1)), y) })), ...lemmaUses(x, yes), ...lemmaUses(y, yes), ...lemmaUses(less1(y), le(k(1), y))],
+        });
+    return { facts, specs: withReads(facts, specs) };
+}
+// Function facts at the keys a node's goal reads them at: each fact about every key of a function read f[k] (the key
+// alone) at each key f is read at, twice over (a fact's own reads give more keys).
+function withReads(facts, specs) {
+    const simple = facts.flatMap((f, i) => {
+        if (f.keys.length !== 1)
+            return [];
+        const reads = [...JSON.stringify(f.holds).matchAll(/"op":"get","map":"([^"]+)","key":\{"op":"var","name":"([^"]+)"\}/g)].filter(m => m[2] === f.keys[0]);
+        return reads.map(m => ({ fact: i, map: m[1] }));
+    });
+    if (!simple.length)
+        return specs;
+    const readsIn = (t, map) => { const out = []; const walk = (x) => { if (x && typeof x === 'object') {
+        const o = x;
+        if (o.op === 'get' && o.map === map)
+            out.push(o.key);
+        for (const val of Object.values(o))
+            walk(val);
+    } }; walk(t); return out; };
+    return specs.map(n => {
+        const insts = [...n.insts], seen = new Set(insts.map(p => JSON.stringify(p)));
+        for (let round = 0; round < 2; round++) {
+            const goal = [n.hyps, n.concl, insts.map(p => substC(facts[p.fact].holds, vars(Object.fromEntries(facts[p.fact].keys.map((key, i) => [key, p.at[i]]))))), n.uses.map(u => substC(specs[u.node].concl, vars(u.subst)))];
+            for (const s of simple)
+                for (const key of readsIn(goal, s.map)) {
+                    const p = { fact: s.fact, at: [key] }, id = JSON.stringify(p);
+                    if (!seen.has(id)) {
+                        seen.add(id);
+                        insts.push(p);
+                    }
+                }
+        }
+        return { ...n, insts };
+    });
+}
+// --- machines -------------------------------------------------------------------------------------------------------
+// The machines this instance covers: no history, no flag holding at every key, and no law that reads a map at a key
+// read from a map of the state (a table of nodes: a node's fold at its child), whose cells a run's maps put at keys
+// the prover would have to prove equal through products (`machineNodes` proves those laws far slower than the usual
+// rule, past its budget: research/cyclic/probe.ts).
+export const cyclicMachine = (m, laws = []) => {
+    const maps = Object.keys(m.maps ?? {});
+    const nested = (t) => { let found = false; const walk = (x, inKey) => { if (found || !x || typeof x !== 'object')
+        return; const o = x; if (o.op === 'get' && inKey && maps.includes(o.map)) {
+        found = true;
+        return;
+    } if (o.op === 'get') {
+        walk(o.key, true);
+        return;
+    } for (const val of Object.values(o))
+        walk(val, inKey); }; walk(t, false); return found; };
+    return !m.history && !Object.values(m.step.flags ?? {}).some(c => c.op === 'all') && !laws.some(l => nested(l.holds));
+};
+// The run as maps over time: names at time u read as their maps there.
+function trace(m) {
+    const maps = [...Object.keys(m.maps ?? {}), ...(m.inputMaps ?? [])];
+    const at = (u) => ({
+        vars: Object.fromEntries([...Object.keys(m.state), ...m.inputs].map(n => [n, get(`${n}@`, u)])),
+        maps: Object.fromEntries(maps.map(map => [map, (key) => get(`${map}@`, pair(u, key))])), flags: {},
+    });
+    return { at };
+}
+// Every map read at `from` (the same term) read at `to`.
+const readsAt = (t, from, to) => {
+    const id = JSON.stringify(from);
+    const walk = (x) => {
+        if (Array.isArray(x))
+            return x.map(walk);
+        if (!x || typeof x !== 'object')
+            return x;
+        const o = x;
+        if (o.op === 'get' && JSON.stringify(o.key) === id)
+            return { ...o, key: to };
+        return Object.fromEntries(Object.entries(o).map(([key, val]) => [key, walk(val)]));
+    };
+    return walk(t);
+};
+// A machine's flags, each its condition over the frame before the step (through the flags before it).
+const flagsOf = (m) => {
+    const out = {};
+    for (const [f, c] of Object.entries(m.step.flags ?? {}))
+        out[f] = substC(c, { vars: {}, maps: {}, flags: out });
+    return out;
+};
+export function machineNodes(m, laws, instances) {
+    const { at } = trace(m), flags = flagsOf(m), inline = (t) => substC(t, { vars: {}, maps: {}, flags });
+    const t = v('t$'), T = v('T$'), u = v('u$'), key = v('k$');
+    const inlineE = (e) => substE(e, { vars: {}, maps: {}, flags });
+    const now = (c, when) => substC(c, at(when)), nowE = (e, when) => substE(inlineE(e), at(when));
+    const state = Object.keys(m.state), mapNames = Object.keys(m.maps ?? {});
+    // The start and a step, each stated at the time u it gives (a start at u <= 0, a step at 1 <= u <= T from u − 1), so a
+    // node reads them at its own time t: the cells they give are the cells it reads, with no key to prove equal.
+    const start = le(u, k(0)), stepped = and(le(k(1), u), le(u, T)), prev = less1(u);
+    const facts = [
+        { name: `${m.name}: the start`, keys: ['u$'], holds: implies(start, and(yes, ...state.map(s => eq(get(`${s}@`, u), m.state[s])))) },
+        { name: `${m.name}: a step`, keys: ['u$'], holds: implies(stepped, and(yes, ...(m.assume ? [now(inline(m.assume), prev)] : []), ...state.map(s => eq(get(`${s}@`, u), nowE(m.step.state?.[s] ?? v(s), prev))))) },
+        ...mapNames.flatMap((map) => {
+            const w = m.step.maps?.[map], cell = (when) => get(`${map}@`, pair(when, key));
+            // A write at one key: where the key is the write's, the value with every read at the write's key read at the key
+            // instead (the same cell there), so the cells the step gives are at the key the node reads.
+            const next = !w ? cell(prev) : 'each' in w ? substE(substE(w.value, { vars: { [w.each]: key }, maps: {}, flags }), at(prev))
+                : { op: 'if', c: eq(key, nowE(w.key, prev)), then: substE(readsAt(inlineE(w.value), inlineE(w.key), key), at(prev)), else: cell(prev) };
+            return [
+                { name: `${m.name}: ${map} at the start`, keys: ['u$', 'k$'], holds: implies(start, eq(cell(u), k(m.maps[map]))) },
+                { name: `${m.name}: ${map} at a step`, keys: ['u$', 'k$'], holds: implies(stepped, eq(cell(u), next)) },
+                { name: `${m.name}: ${map}'s cells are naturals`, keys: ['u$', 'k$'], holds: le(k(0), cell(u)) },
+            ];
+        }),
+        ...(m.facts ?? []).map(factOf),
+        // That a state variable's value at a time is a natural holds of every model: read at the node's time, it makes the
+        // value a column of its own (a value read only inside a product would be none, and no two reads of it equal).
+        ...state.map((s) => ({ name: `${m.name}: ${s} is a natural`, keys: ['u$'], holds: le(k(0), get(`${s}@`, u)) })),
+        { name: `${m.name}: params are naturals`, keys: [], holds: and(yes, ...m.params.map(x => le(k(0), v(x)))) },
+    ];
+    const fi = (name) => facts.findIndex(f => f.name === name);
+    const keysOf = (l) => [...(l.forall ? [l.forall] : []), ...(l.keys ?? [])];
+    // A map read at the node's time t at key e: that map's start, step and natural facts at (t, e).
+    const mapInsts = (c) => {
+        const out = [], seen = new Set();
+        const walk = (x) => {
+            if (!x || typeof x !== 'object')
+                return;
+            const o = x;
+            if (o.op === 'get' && typeof o.map === 'string' && o.map.endsWith('@') && mapNames.includes(o.map.slice(0, -1))) {
+                const kk = o.key;
+                if (kk.op === 'add' && JSON.stringify(kk.a) === JSON.stringify(t) && kk.b.op === 'prod') {
+                    const read = kk.b.a, id = JSON.stringify(read), map = o.map.slice(0, -1);
+                    if (!seen.has(`${map}:${id}`)) {
+                        seen.add(`${map}:${id}`);
+                        out.push(...['at the start', 'at a step', '\'s cells are naturals'].map(what => ({ fact: fi(`${m.name}: ${map}${what.startsWith('\'') ? what : ` ${what}`}`), at: [t, read] })));
+                    }
+                }
+            }
+            for (const val of Object.values(o))
+                walk(val);
+        };
+        walk(c);
+        return out;
+    };
+    const specs = laws.map(l => {
+        const inst = instances[l.name] ?? {};
+        // Terms over the frame before the step (the machine's proof proves a law about every key at a fresh key k#: here
+        // the node's own k).
+        const fresh = Object.fromEntries(laws.flatMap(x => (x.forall ? [[`${x.forall}#`, v(x.forall)]] : [])));
+        const pre = at(less1(t)), before = (e) => substE(substE(e, vars(fresh)), pre);
+        // The laws at the step before, at the keys the machine's proof assumes them at.
+        const uses = laws.flatMap((l2, j) => {
+            const ks = keysOf(l2);
+            if (!ks.length)
+                return [{ node: j, subst: { 't$': less1(t) }, guard: le(k(1), t) }];
+            const flat = inst[l2.name] ?? [];
+            return Array.from({ length: Math.floor(flat.length / ks.length) }, (_, i) => ({ node: j, subst: { 't$': less1(t), ...Object.fromEntries(ks.map((kn, q) => [kn, before(flat[i * ks.length + q])])) }, guard: le(k(1), t) }));
+        });
+        // The functions' facts at the keys the proof names, over the frame before the step (at t = 0, the start's).
+        const factInsts = (m.facts ?? []).flatMap(f => {
+            const ks = keysOf(f), flat = inst[f.name] ?? [];
+            if (!ks.length)
+                return [{ fact: fi(f.name), at: [] }];
+            return Array.from({ length: Math.floor(flat.length / ks.length) }, (_, i) => ({ fact: fi(f.name), at: flat.slice(i * ks.length, (i + 1) * ks.length).map(before) }));
+        });
+        const concl = substC(l.holds, at(t));
+        const useConcls = uses.map(us => substC(substC(laws[us.node].holds, at(t)), vars(us.subst)));
+        const base = mapInsts([concl, useConcls]);
+        return {
+            name: `${m.name}: ${l.name}`, hyps: [...(m.pre ? [m.pre] : []), le(t, T), ...(mapNames.length ? [{ op: '<', a: T, b: omega }] : [])], concl, rank: [t],
+            insts: [{ fact: 0, at: [t] }, { fact: 1, at: [t] }, ...factInsts, ...base, ...state.map(st => ({ fact: fi(`${m.name}: ${st} is a natural`), at: [t] })), { fact: fi(`${m.name}: params are naturals`), at: [] }], uses,
+        };
+    });
+    return { facts, specs };
+}
+// --- folds over trees -----------------------------------------------------------------------------------------------
+// The tree as a table of nodes below its size N: a node n is a leaf (Kind[n] = 0) whose values come from its inputs,
+// or a node (Kind[n] = 1) with children Left[n], Right[n] numbered below n, its values from theirs and its inputs.
+export function foldNodes(f, laws) {
+    const n = v('n$'), N = v('N$'), names = Object.keys(f.leaf);
+    const at = (i) => vars(Object.fromEntries([...names, ...f.inputs].map(x => [x, get(`${x}@`, i)])));
+    const kind = (i) => get('Kind@', i), left = (i) => get('Left@', i), right = (i) => get('Right@', i);
+    const side = (child, p) => Object.fromEntries(names.map(x => [`${p}${x}`, get(`${x}@`, child)]));
+    const nodeAt = (i) => vars({ ...Object.fromEntries(f.inputs.map(x => [x, get(`${x}@`, i)])), ...side(left(i), 'l_'), ...side(right(i), 'r_') });
+    const assume = (i) => (f.assume ? [substC(f.assume, at(i))] : []);
+    const facts = [{ name: `${f.name}: the table`, keys: ['n$'], holds: implies({ op: '<', a: n, b: N }, and(le(kind(n), k(1)), implies(eq(kind(n), k(0)), and(yes, ...assume(n), ...names.map(x => eq(get(`${x}@`, n), substE(f.leaf[x], at(n)))))), implies(eq(kind(n), k(1)), and({ op: '<', a: left(n), b: n }, { op: '<', a: right(n), b: n }, ...assume(n), ...names.map(x => eq(get(`${x}@`, n), substE(f.node[x], nodeAt(n)))))))) },
+        // Each value a natural (true of every model), so a value read only inside a product is a column of its own.
+        { name: `${f.name}: values are naturals`, keys: ['n$'], holds: and(yes, ...names.map(x => le(k(0), get(`${x}@`, n)))) },
+        { name: `${f.name}: params are naturals`, keys: [], holds: and(yes, ...f.params.map(x => le(k(0), v(x)))) }];
+    const specs = laws.map(l => ({
+        name: `${f.name}: ${l.name}`, hyps: [...(f.pre ? [f.pre] : []), { op: '<', a: n, b: N }], concl: substC(l.holds, at(n)), rank: [n],
+        insts: [{ fact: 0, at: [n] }, ...[n, left(n), right(n)].map(i => ({ fact: 1, at: [i] })), { fact: 2, at: [] }],
+        uses: laws.flatMap((_, j) => [left, right].map(c => ({ node: j, subst: { 'n$': c(n) }, guard: eq(kind(n), k(1)) }))),
+    }));
+    return { facts, specs };
+}
+// --- the cyclic route beside the usual one (GDP_CYCLIC=1) -------------------------------------------------------------
+// With GDP_CYCLIC=1, every proof the instances above cover is made again as a cyclic proof, and a verdict that differs
+// throws: the suite run so shows the rules are instances. Each comparison is printed to stderr as a line `cyclic: {...}`.
+const env = () => globalThis.process?.env;
+let quiet = 0;
+export const cyclicOn = () => quiet === 0 && env()?.GDP_CYCLIC === '1';
+// A search's many trial proofs (core/discover.ts, core/infer.ts) aren't compared: what it finds is proven again.
+export const quietly = (f) => { quiet++; try {
+    return f();
+}
+finally {
+    quiet--;
+} };
+export function crossCyclic(kind, name, usual, run, usualMs) {
+    const t0 = performance.now(), out = run(), ms = Math.round(performance.now() - t0);
+    const cyclic = out.proven && out.checked;
+    console.error(`cyclic: ${JSON.stringify({ kind, name, usual, cyclic, ms, ...(usualMs === undefined ? {} : { usualMs: Math.round(usualMs) }), ...(out.proven ? { nodes: out.proof.nodes.length, ...(out.why ? { why: out.why } : {}) } : { goal: out.goal, stuck: out.stuck }) })}`);
+    if (cyclic !== usual)
+        throw new Error(`cyclic route: ${kind} ${name} is ${cyclic ? 'proven' : 'not proven'} as a cyclic proof, ${usual ? 'proven' : 'not proven'} the usual way${out.proven ? (out.why ? ` (${out.why})` : '') : ` (${out.goal}: ${out.stuck})`}`);
+}

package/dist/core/discover.d.ts

@@ -12,7 +12,7 @@ export type Discovery = {
     rule: AnyRule;
     found: Record<string, Found>;
 };
-export declare function discover(r: AnyRule, laws: Law[], stepLaws?: StepLaw[]): Discovery;
+export declare function discover(r: AnyRule, laws: Law[], stepLaws?: StepLaw[], first?: Verdict): Discovery;
 type TreeFold = {
     fold: Fold;
     lemmas?: Law[];

package/dist/core/discover.js

@@ -10,6 +10,7 @@
 //   const out = discover(r, laws, stepLaws)
 //   out.verdict          // the laws, proven of out.rule: r with its functions and lists made again with the lemmas
 //   out.found            // per function or list, the lemmas found, as source to paste into recur(...) or carriesList(...)
+import { quietly } from "./cyclic.js";
 import { any, atMost, compileFunction, evalC, evalE, n, plus, prod, same, times, x } from "./machine.js";
 import { Unproven, lit, proveFold, proveSteps, recur, recurOf } from "./dsl.js";
 const seeded = (seed) => { let s = seed; return (k) => { s = (s * 1103515245 + 12345) % 2 ** 31; return Math.floor(s / 2 ** 31 * k); }; };
@@ -259,8 +260,11 @@ function houdiniList(r, part, cands, params) {
 // --- the search ----------------------------------------------------------------------------------------------------
 // The laws of r, and where they aren't proven as r states them, the lemmas found for its functions and lists: all that
 // is proven first, then each dropped in turn while the laws stay proven without it.
-export function discover(r, laws, stepLaws = []) {
-    const first = proveSteps(r, laws, stepLaws);
+// `first`: the laws' verdict on r alone, when the caller has it.
+export function discover(r, laws, stepLaws = [], first) {
+    return quietly(() => discoverSearch(r, laws, stepLaws, first ?? proveSteps(r, laws, stepLaws, { search: false })));
+}
+function discoverSearch(r, laws, stepLaws, first) {
     if (first.proven && first.checked)
         return { verdict: first, rule: r, found: {} };
     const { params, fns, lists } = r.parts, ps = natParams(params);
@@ -284,7 +288,7 @@ export function discover(r, laws, stepLaws = []) {
             listKept[part[0]] = out.kept;
         }
     }
-    const verdict = proveSteps(rule, laws, stepLaws);
+    const verdict = proveSteps(rule, laws, stepLaws, { search: false });
     const found = () => ({
         ...Object.fromEntries(Object.entries(fnMade).map(([n, m]) => { const args = [...(recurOf(m.d).def.args ?? [])]; return [n, { ...(m.lemmas.length ? { lemmas: m.lemmas.map(c => recurSrc(c, args, false)) } : {}), ...(m.between.length ? { between: m.between.map(c => recurSrc(c, args, true)) } : {}) }]; })),
         ...Object.fromEntries(Object.entries(listKept).map(([n, cs]) => [n, { lemmas: cs.map(c => listSrc(c, Object.keys(lists.find(l => l[0] === n)[2]), ps, c.target)) }])),
@@ -297,7 +301,7 @@ export function discover(r, laws, stepLaws = []) {
     // A rule made again and the laws proven of it; or the lemma whose proof failed without the one dropped.
     const tryRule = (next) => {
         try {
-            const r2 = next(), v = proveSteps(r2, laws, stepLaws);
+            const r2 = next(), v = proveSteps(r2, laws, stepLaws, { search: false });
             return v.proven && v.checked ? { rule: r2, verdict: v } : undefined;
         }
         catch (e) {
@@ -405,7 +409,8 @@ const eOfSide = (side) => {
     return es.length ? es.slice(1).reduce((acc, t) => plus(acc, t), es[0]) : n(0);
 };
 const cOfCand = (c) => { const { pos, neg } = sides(c.lin), a = eOfSide(pos), b = eOfSide(neg); return c.rel === '=' ? same(a, b) : atMost(a, b); };
-export function discoverFold(f, laws) {
+export function discoverFold(f, laws) { return quietly(() => discoverFoldSearch(f, laws)); }
+function discoverFoldSearch(f, laws) {
     const stated = f.lemmas ?? [], first = proveFold({ fold: f.fold, lemmas: stated }, laws);
     if (first.proven && first.checked)
         return { verdict: first, lemmas: [], found: [] };

package/dist/core/dsl.d.ts

@@ -299,6 +299,26 @@ export declare class ListRef {
     within(): Forall;
     increasing(): Forall;
 }
+export declare class SeqRef {
+    private readonly map;
+    readonly len: Term;
+    private readonly base?;
+    constructor(map: MapRef, len: Term, base?: Term | undefined);
+    at(i: TermLike): Term;
+    private agree;
+    prefixOf(o: SeqRef): Cond;
+    startsWith(o: SeqRef): Cond;
+    equals(o: SeqRef): Cond;
+    extends(o: SeqRef, by: TermLike): Cond;
+    has(x: TermLike): Cond;
+}
+export declare class SeqTable {
+    readonly name: string;
+    readonly rows: Term;
+    constructor(name: string, rows: Term);
+    row(r: TermLike): SeqRef;
+}
+export declare const everyBelow: (n: TermLike, f: (key: Term) => Cond) => Cond;
 export type PartsWrite = {
     readonly parts: Record<string, MapWrite>;
 };
@@ -473,6 +493,8 @@ type Spec = {
     nodes?: [string, Kind<unknown>, string[], Record<string, NodeFold<unknown, string>>][];
     kinded?: [string, Kind<unknown>][];
     carried?: string[];
+    seqs?: string[];
+    seqTables?: string[];
     lists2?: [string, Kind<unknown>, Record<string, ListFold<unknown>>, Record<string, ListLemma>][];
     fns?: [string, FnDef][];
     facts?: ((env: never) => Record<string, Cond | Forall>)[];
@@ -539,6 +561,12 @@ export declare class Rule<P extends Obj = {}, I extends Obj = {}, S extends Obj
     carries<const N extends string>(...names: N[]): Rule<P, I & {
         [k in N]: MapRef;
     }, S, M, F, R, Su, Q>;
+    carriesSeq<const N extends string>(...names: N[]): Rule<P, I & {
+        [k in N]: SeqRef;
+    }, S, M, F, R, Su, Q>;
+    carriesSeqs<const N extends string>(...names: N[]): Rule<P, I & {
+        [k in N]: SeqTable;
+    }, S, M, F, R, Su, Q>;
     carriesList<const N extends string, V, Fd extends string = never>(name: N, of: Kind<V>, folds?: Record<Fd, ListFold<V, P>>, lemmas?: Record<string, (acc: Record<Fd, Term>, i: Term, p: P) => Cond>): Rule<P, I & {
         [k in N]: CarriedList<V, Fd>;
     }, S, M, F, R, Su, Q>;
@@ -604,7 +632,7 @@ export declare class Rule<P extends Obj = {}, I extends Obj = {}, S extends Obj
         [k in keyof P]: Raw;
     }): Record<string, number>;
     encodeInput(values: {
-        [k in keyof I]: I[k] extends MapRef ? ReadonlySet<number> | readonly number[] | ReadonlyMap<number, number> : I[k] extends CarriedList<any, any> ? readonly Raw[] : Raw;
+        [k in keyof I]: I[k] extends MapRef ? ReadonlySet<number> | readonly number[] | ReadonlyMap<number, number> : I[k] extends SeqRef ? readonly number[] : I[k] extends SeqTable ? readonly (readonly number[])[] : I[k] extends CarriedList<any, any> ? readonly Raw[] : Raw;
     }, params?: {
         [k in keyof P]: Raw;
     }): Request;
@@ -678,7 +706,7 @@ type Value<T> = {
     [k in keyof T]: ValueOf<T[k]>;
 };
 type RawInputs<T> = {
-    [k in keyof T]: T[k] extends MapRef ? ReadonlySet<number> | readonly number[] | ReadonlyMap<number, number> : T[k] extends CarriedList<infer V, infer _F> ? readonly ValueOf<V>[] : ValueOf<T[k]>;
+    [k in keyof T]: T[k] extends MapRef ? ReadonlySet<number> | readonly number[] | ReadonlyMap<number, number> : T[k] extends SeqRef ? readonly number[] : T[k] extends SeqTable ? readonly (readonly number[])[] : T[k] extends CarriedList<infer V, infer _F> ? readonly ValueOf<V>[] : ValueOf<T[k]>;
 };
 type Field = Term | Cond | Int | Decimal | Choice<string> | Str | Variant<any, any> | Maybe<any> | {
     [f: string]: Field | number;
@@ -770,13 +798,30 @@ export type Verdict = {
         params: Record<string, number>;
         trace: Record<string, unknown>[];
     };
+    found?: Found;
+};
+export type Found = {
+    laws?: {
+        law: Law;
+        text: string;
+        source?: string;
+    }[];
+    lemmas?: Record<string, {
+        lemmas?: string[];
+        between?: string[];
+    }>;
+};
+export type ProveOptions = {
+    search?: boolean | {
+        ms?: number;
+    };
 };
 export declare class Unproven extends Error {
     readonly verdict: Verdict;
     constructor(what: string, verdict: Verdict);
 }
-export declare function proveRule(r: Rule<Obj, Obj, Obj, Obj, Obj, Obj, Obj, Obj>, laws: Law[]): Verdict;
-export declare function proveSteps(r: Rule<Obj, Obj, Obj, Obj, Obj, Obj, Obj, Obj>, laws: Law[], stepLaws: StepLaw[]): Verdict;
+export declare function proveRule(r: Rule<Obj, Obj, Obj, Obj, Obj, Obj, Obj, Obj>, laws: Law[], opts?: ProveOptions): Verdict;
+export declare function proveSteps(r: Rule<Obj, Obj, Obj, Obj, Obj, Obj, Obj, Obj>, laws: Law[], stepLaws: StepLaw[], opts?: ProveOptions): Verdict;
 export type { StepLaw };
 export type { Liveness };
 export declare function proveLeadsTo(r: Rule<Obj, Obj, Obj, Obj, Obj, Obj, Obj, Obj>, laws: Law[], l: Liveness): Verdict;